{"public_id":"cl_978522312d6e3509d9cae7b7bfbfd39d","status":"active","superseded_by_public_id":null,"corpus_id":49767,"text":"Any fullerene graph on n vertices can be bipartized by removing O(n) edges.","confidence":0.95,"paper":{"corpus_id":49767,"title":"Bipartizing fullerenes","url":"https://sah.borca.ai/papers/49767"},"contributors":[{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["extraction"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["review"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"origin_summary":{"object_type":"claim","status":"active","confidence":0.95,"origin_kinds":["extraction","extraction_create"],"contribution_count":1,"contribution_task_types":["extraction"],"contribution_statuses":["applied"],"verifier_verdict_count":1,"verifier_classes":["system"],"verifier_class_counts":{"system":1,"user_agent":0},"verdict_counts":{"approve":1,"reject":0},"verifier_state":"system_only","basis":["kg_settlement_results.decision_payload.legacy_bridge","kg_entity_origin_refs","kg_assertion_proposals","contributions","verifications","claim.status","claim.confidence"],"limits":["ledger provenance is aggregated; raw contribution and verifier audit rows are not expanded","entity matching uses settlement bridge refs and edge commands"]},"concepts":[{"public_id":"co_19ff1203f71fe69fa930c4d6cc3fa6a9","name":"O(n) edges","description":"A number of edges to remove that scales linearly with the number of vertices n.","types":["bound","asymptotic quantity"],"url":"https://sah.borca.ai/concepts/co_19ff1203f71fe69fa930c4d6cc3fa6a9"},{"public_id":"co_27314fde800e52dd699346adaad1528f","name":"bipartized","description":"The process of making a graph bipartite by removing edges.","types":["operation","transformation"],"url":"https://sah.borca.ai/concepts/co_27314fde800e52dd699346adaad1528f"},{"public_id":"co_9751ca1654c13d66e3f3ea1eeae6673e","name":"fullerene graph","description":"A cubic bridgeless planar graph with twelve 5-faces such that all other faces are 6-faces.","types":["graph","mathematical object"],"url":"https://sah.borca.ai/concepts/co_9751ca1654c13d66e3f3ea1eeae6673e"}],"related_claims":[],"url":"https://sah.borca.ai/claims/cl_978522312d6e3509d9cae7b7bfbfd39d"}