{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:YP4IHDL65OMM7CF72I72CSZ7CG","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"9b4586c133947fe88cbda675821cad1c15fbb6fc78ead665cee1dcecdde7a06a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-15T07:46:15Z","title_canon_sha256":"e4e0aabc0bb8bb877d06704afe3ff892e0dd63d25a6afe5c4ca071b72b78938e"},"schema_version":"1.0","source":{"id":"1108.2949","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.2949","created_at":"2026-05-18T04:02:52Z"},{"alias_kind":"arxiv_version","alias_value":"1108.2949v2","created_at":"2026-05-18T04:02:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.2949","created_at":"2026-05-18T04:02:52Z"},{"alias_kind":"pith_short_12","alias_value":"YP4IHDL65OMM","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YP4IHDL65OMM7CF7","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YP4IHDL6","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:635a31aa8816b183733748ee82cd9705154cd2a857cd30cf80c5787322331ada","target":"graph","created_at":"2026-05-18T04:02:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"David R. Wood, Ken-ichi Kawarabayashi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-15T07:46:15Z","title":"Cliques in Odd-Minor-Free Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.2949","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:425cc7446f8c11153fc1e78e15b633c9986d4342ce064150abffea90c77c9cf3","target":"record","created_at":"2026-05-18T04:02:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"9b4586c133947fe88cbda675821cad1c15fbb6fc78ead665cee1dcecdde7a06a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-15T07:46:15Z","title_canon_sha256":"e4e0aabc0bb8bb877d06704afe3ff892e0dd63d25a6afe5c4ca071b72b78938e"},"schema_version":"1.0","source":{"id":"1108.2949","kind":"arxiv","version":2}},"canonical_sha256":"c3f8838d7eeb98cf88bfd23fa14b3f1191a7cb0099f68d558aff94fbf6ca4fdb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c3f8838d7eeb98cf88bfd23fa14b3f1191a7cb0099f68d558aff94fbf6ca4fdb","first_computed_at":"2026-05-18T04:02:52.644175Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:02:52.644175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M3KFoxoOtQBaE2nJBfFl5q3EQRsQifbxhBBQWksrRr7lPoSvNaOHTwejJ2gx96nEVZ9r1HD9AEZ9qqmlJ9blBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:02:52.645092Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.2949","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:425cc7446f8c11153fc1e78e15b633c9986d4342ce064150abffea90c77c9cf3","sha256:635a31aa8816b183733748ee82cd9705154cd2a857cd30cf80c5787322331ada"],"state_sha256":"f60213fa5e15b3188ddf4a971050b9d07f92ac90cf554340b9337d554ec1d6b0"}