{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:FGAHAJ22OESXCJYSWZT7IJ452T","short_pith_number":"pith:FGAHAJ22","canonical_record":{"source":{"id":"1309.0449","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-02T16:12:35Z","cross_cats_sorted":[],"title_canon_sha256":"3b856e5342229778667e9dc74b0987f790fecfca8e09dd31d372ddca0d340faf","abstract_canon_sha256":"44048d42f254e79f491dd064cac845273eab5eef08053001e2da405f5506df6c"},"schema_version":"1.0"},"canonical_sha256":"298070275a7125712712b667f4279dd4d642c86cad1b0ad30c5bf2ffb1a2b4a5","source":{"kind":"arxiv","id":"1309.0449","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.0449","created_at":"2026-05-18T03:13:57Z"},{"alias_kind":"arxiv_version","alias_value":"1309.0449v1","created_at":"2026-05-18T03:13:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0449","created_at":"2026-05-18T03:13:57Z"},{"alias_kind":"pith_short_12","alias_value":"FGAHAJ22OESX","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FGAHAJ22OESXCJYS","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FGAHAJ22","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:FGAHAJ22OESXCJYSWZT7IJ452T","target":"record","payload":{"canonical_record":{"source":{"id":"1309.0449","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-02T16:12:35Z","cross_cats_sorted":[],"title_canon_sha256":"3b856e5342229778667e9dc74b0987f790fecfca8e09dd31d372ddca0d340faf","abstract_canon_sha256":"44048d42f254e79f491dd064cac845273eab5eef08053001e2da405f5506df6c"},"schema_version":"1.0"},"canonical_sha256":"298070275a7125712712b667f4279dd4d642c86cad1b0ad30c5bf2ffb1a2b4a5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:57.605698Z","signature_b64":"VRUBiAz9zA3ms1V4+N1bmuI3e1MHo8GOBcSVr1w1ylzf1sZbghR8yevoY7RmJ2H3meRkLz7cYFLc6hOjRnv+Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"298070275a7125712712b667f4279dd4d642c86cad1b0ad30c5bf2ffb1a2b4a5","last_reissued_at":"2026-05-18T03:13:57.604828Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:57.604828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.0449","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:13:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/S5z+v4cfJ1mu8GeW3mxtpy64fftWRwh7QWL+SfDraAKD/B4KU/0RDE1n4NMCI2WSzmgjZvJsEw/TSKxUBS3Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:26:39.751245Z"},"content_sha256":"bce558bed296336f1ac2f7df46937317d27acabefd260f4ab6d183bd6460f2ac","schema_version":"1.0","event_id":"sha256:bce558bed296336f1ac2f7df46937317d27acabefd260f4ab6d183bd6460f2ac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:FGAHAJ22OESXCJYSWZT7IJ452T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Odd pairs of cliques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fr\\'ed\\'eric Maffray, Michel Burlet, Nicolas Trotignon","submitted_at":"2013-09-02T16:12:35Z","abstract_excerpt":"A graph is Berge if it has no induced odd cycle on at least 5 vertices and no complement of induced odd cycle on at least 5 vertices. A graph is perfect if the chromatic number equals the maximum clique number for every induced subgraph. Chudnovsky, Robertson, Seymour and Thomas proved that every Berge graph either falls into some classical family of perfect graphs, or has a structural fault that cannot occur in a minimal imperfect graph. A corollary of this is the strong perfect graph theorem conjectured by Berge: every Berge graph is perfect. An even pair of vertices in a graph is a pair of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.0449","kind":"arxiv","version":1},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:13:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"85aJjc/N6B/NcIECpwXsEgsXe+ZGthha6zpMP+HX4xNH7kYTaD/UPBdTGR0sSoMdcvBKsEWuTwzmVDzkZA2qCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:26:39.751719Z"},"content_sha256":"4aff5efe2a9a1d2b75fd96af11e729b5c15515b893b31a85447ec88efe51efb8","schema_version":"1.0","event_id":"sha256:4aff5efe2a9a1d2b75fd96af11e729b5c15515b893b31a85447ec88efe51efb8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FGAHAJ22OESXCJYSWZT7IJ452T/bundle.json","state_url":"https://pith.science/pith/FGAHAJ22OESXCJYSWZT7IJ452T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FGAHAJ22OESXCJYSWZT7IJ452T/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T04:26:39Z","links":{"resolver":"https://pith.science/pith/FGAHAJ22OESXCJYSWZT7IJ452T","bundle":"https://pith.science/pith/FGAHAJ22OESXCJYSWZT7IJ452T/bundle.json","state":"https://pith.science/pith/FGAHAJ22OESXCJYSWZT7IJ452T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FGAHAJ22OESXCJYSWZT7IJ452T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:FGAHAJ22OESXCJYSWZT7IJ452T","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":"44048d42f254e79f491dd064cac845273eab5eef08053001e2da405f5506df6c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-02T16:12:35Z","title_canon_sha256":"3b856e5342229778667e9dc74b0987f790fecfca8e09dd31d372ddca0d340faf"},"schema_version":"1.0","source":{"id":"1309.0449","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.0449","created_at":"2026-05-18T03:13:57Z"},{"alias_kind":"arxiv_version","alias_value":"1309.0449v1","created_at":"2026-05-18T03:13:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0449","created_at":"2026-05-18T03:13:57Z"},{"alias_kind":"pith_short_12","alias_value":"FGAHAJ22OESX","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FGAHAJ22OESXCJYS","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FGAHAJ22","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:4aff5efe2a9a1d2b75fd96af11e729b5c15515b893b31a85447ec88efe51efb8","target":"graph","created_at":"2026-05-18T03:13:57Z","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":"A graph is Berge if it has no induced odd cycle on at least 5 vertices and no complement of induced odd cycle on at least 5 vertices. A graph is perfect if the chromatic number equals the maximum clique number for every induced subgraph. Chudnovsky, Robertson, Seymour and Thomas proved that every Berge graph either falls into some classical family of perfect graphs, or has a structural fault that cannot occur in a minimal imperfect graph. A corollary of this is the strong perfect graph theorem conjectured by Berge: every Berge graph is perfect. An even pair of vertices in a graph is a pair of ","authors_text":"Fr\\'ed\\'eric Maffray, Michel Burlet, Nicolas Trotignon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-02T16:12:35Z","title":"Odd pairs of cliques"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.0449","kind":"arxiv","version":1},"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:bce558bed296336f1ac2f7df46937317d27acabefd260f4ab6d183bd6460f2ac","target":"record","created_at":"2026-05-18T03:13:57Z","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":"44048d42f254e79f491dd064cac845273eab5eef08053001e2da405f5506df6c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-02T16:12:35Z","title_canon_sha256":"3b856e5342229778667e9dc74b0987f790fecfca8e09dd31d372ddca0d340faf"},"schema_version":"1.0","source":{"id":"1309.0449","kind":"arxiv","version":1}},"canonical_sha256":"298070275a7125712712b667f4279dd4d642c86cad1b0ad30c5bf2ffb1a2b4a5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"298070275a7125712712b667f4279dd4d642c86cad1b0ad30c5bf2ffb1a2b4a5","first_computed_at":"2026-05-18T03:13:57.604828Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:13:57.604828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VRUBiAz9zA3ms1V4+N1bmuI3e1MHo8GOBcSVr1w1ylzf1sZbghR8yevoY7RmJ2H3meRkLz7cYFLc6hOjRnv+Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:13:57.605698Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.0449","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bce558bed296336f1ac2f7df46937317d27acabefd260f4ab6d183bd6460f2ac","sha256:4aff5efe2a9a1d2b75fd96af11e729b5c15515b893b31a85447ec88efe51efb8"],"state_sha256":"1945b8778dfcf4199e1670deff3668f7ce05048b4c948f3a947c1859dd1ed81c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BLps9JwKCKYuEQDDlfCWslK7pONTi6DQHpgFDCZIHGNp3DSLR5VLsiQI+QzOY6PBVUQZ8Z0f4J/RDv89FR4lAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T04:26:39.754989Z","bundle_sha256":"30057d8a1e87a72fa8eef2778488b13b1ebc3011533a593a1b363df7e028bee9"}}