{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:YP4IHDL65OMM7CF72I72CSZ7CG","short_pith_number":"pith:YP4IHDL6","schema_version":"1.0","canonical_sha256":"c3f8838d7eeb98cf88bfd23fa14b3f1191a7cb0099f68d558aff94fbf6ca4fdb","source":{"kind":"arxiv","id":"1108.2949","version":2},"attestation_state":"computed","paper":{"title":"Cliques in Odd-Minor-Free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David R. Wood, Ken-ichi Kawarabayashi","submitted_at":"2011-08-15T07:46:15Z","abstract_excerpt":"This paper is about: (1) bounds on the number of cliques in a graph in a particular class, and (2) algorithms for listing all cliques in a graph. We present a simple algorithm that lists all cliques in an $n$-vertex graph in O(n) time per clique. For O(1)-degenerate graphs, such as graphs excluding a fixed minor, we describe a O(n) time algorithm for listing all cliques. We prove that graphs excluding a fixed odd-minor have $O(n^2)$ cliques (which is tight), and conclude a $O(n^3)$ time algorithm for listing all cliques."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1108.2949","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-15T07:46:15Z","cross_cats_sorted":[],"title_canon_sha256":"e4e0aabc0bb8bb877d06704afe3ff892e0dd63d25a6afe5c4ca071b72b78938e","abstract_canon_sha256":"9b4586c133947fe88cbda675821cad1c15fbb6fc78ead665cee1dcecdde7a06a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:52.645092Z","signature_b64":"M3KFoxoOtQBaE2nJBfFl5q3EQRsQifbxhBBQWksrRr7lPoSvNaOHTwejJ2gx96nEVZ9r1HD9AEZ9qqmlJ9blBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3f8838d7eeb98cf88bfd23fa14b3f1191a7cb0099f68d558aff94fbf6ca4fdb","last_reissued_at":"2026-05-18T04:02:52.644175Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:52.644175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cliques in Odd-Minor-Free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David R. Wood, Ken-ichi Kawarabayashi","submitted_at":"2011-08-15T07:46:15Z","abstract_excerpt":"This paper is about: (1) bounds on the number of cliques in a graph in a particular class, and (2) algorithms for listing all cliques in a graph. We present a simple algorithm that lists all cliques in an $n$-vertex graph in O(n) time per clique. For O(1)-degenerate graphs, such as graphs excluding a fixed minor, we describe a O(n) time algorithm for listing all cliques. We prove that graphs excluding a fixed odd-minor have $O(n^2)$ cliques (which is tight), and conclude a $O(n^3)$ time algorithm for listing all cliques."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.2949","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1108.2949","created_at":"2026-05-18T04:02:52.644333+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.2949v2","created_at":"2026-05-18T04:02:52.644333+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.2949","created_at":"2026-05-18T04:02:52.644333+00:00"},{"alias_kind":"pith_short_12","alias_value":"YP4IHDL65OMM","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"YP4IHDL65OMM7CF7","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"YP4IHDL6","created_at":"2026-05-18T12:26:47.523578+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YP4IHDL65OMM7CF72I72CSZ7CG","json":"https://pith.science/pith/YP4IHDL65OMM7CF72I72CSZ7CG.json","graph_json":"https://pith.science/api/pith-number/YP4IHDL65OMM7CF72I72CSZ7CG/graph.json","events_json":"https://pith.science/api/pith-number/YP4IHDL65OMM7CF72I72CSZ7CG/events.json","paper":"https://pith.science/paper/YP4IHDL6"},"agent_actions":{"view_html":"https://pith.science/pith/YP4IHDL65OMM7CF72I72CSZ7CG","download_json":"https://pith.science/pith/YP4IHDL65OMM7CF72I72CSZ7CG.json","view_paper":"https://pith.science/paper/YP4IHDL6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.2949&json=true","fetch_graph":"https://pith.science/api/pith-number/YP4IHDL65OMM7CF72I72CSZ7CG/graph.json","fetch_events":"https://pith.science/api/pith-number/YP4IHDL65OMM7CF72I72CSZ7CG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YP4IHDL65OMM7CF72I72CSZ7CG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YP4IHDL65OMM7CF72I72CSZ7CG/action/storage_attestation","attest_author":"https://pith.science/pith/YP4IHDL65OMM7CF72I72CSZ7CG/action/author_attestation","sign_citation":"https://pith.science/pith/YP4IHDL65OMM7CF72I72CSZ7CG/action/citation_signature","submit_replication":"https://pith.science/pith/YP4IHDL65OMM7CF72I72CSZ7CG/action/replication_record"}},"created_at":"2026-05-18T04:02:52.644333+00:00","updated_at":"2026-05-18T04:02:52.644333+00:00"}