{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:2ZMQEWVTQDSF3RJOKFY7EDECSF","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":"a4ca15385b53f468ed06a65c6ad2e338bee509c705c7e3e34a506b6c4d2ed61d","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-22T11:22:14Z","title_canon_sha256":"bac23173fd2ba98915a120a6f591d6cf2e727e40a17b584f3cb7943e2668a4b2"},"schema_version":"1.0","source":{"id":"1301.5149","kind":"arxiv","version":7}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.5149","created_at":"2026-05-18T02:03:53Z"},{"alias_kind":"arxiv_version","alias_value":"1301.5149v7","created_at":"2026-05-18T02:03:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.5149","created_at":"2026-05-18T02:03:53Z"},{"alias_kind":"pith_short_12","alias_value":"2ZMQEWVTQDSF","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"2ZMQEWVTQDSF3RJO","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"2ZMQEWVT","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:772965e9d6efd34d146dea98b587334fc1809f77fa167eb888b728dfb72d1018","target":"graph","created_at":"2026-05-18T02:03:53Z","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":"Perfect graphs were defined by Claude Berge in the 1960s. They are important objects for graph theory, linear programming and combinatorial optimization. Claude Berge made a conjecture about them, that was proved by Chudnovsky, Robertson, Seymour and Thomas in 2002, and is now called the strong perfect graph theorem. This is a survey about perfect graphs, mostly focused on the strong perfect graph theorem.","authors_text":"Nicolas Trotignon","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-22T11:22:14Z","title":"Perfect graphs: a survey"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.5149","kind":"arxiv","version":7},"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:ce7219341376faf8acceab87ed658b4e8c9b71437df1476e6b6b35290614ec9c","target":"record","created_at":"2026-05-18T02:03:53Z","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":"a4ca15385b53f468ed06a65c6ad2e338bee509c705c7e3e34a506b6c4d2ed61d","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-22T11:22:14Z","title_canon_sha256":"bac23173fd2ba98915a120a6f591d6cf2e727e40a17b584f3cb7943e2668a4b2"},"schema_version":"1.0","source":{"id":"1301.5149","kind":"arxiv","version":7}},"canonical_sha256":"d659025ab380e45dc52e5171f20c82916ac46e6b66acf8d8c8610667df30fdfc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d659025ab380e45dc52e5171f20c82916ac46e6b66acf8d8c8610667df30fdfc","first_computed_at":"2026-05-18T02:03:53.072059Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:03:53.072059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+flgzD8y7bHAX73p+P8s68miGRODE9iMtcj2zIrv7jC9RWR/S2GxEiN+FcJa/csBRICqIKweXEPeHBdzmdJvBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:03:53.072863Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.5149","source_kind":"arxiv","source_version":7}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce7219341376faf8acceab87ed658b4e8c9b71437df1476e6b6b35290614ec9c","sha256:772965e9d6efd34d146dea98b587334fc1809f77fa167eb888b728dfb72d1018"],"state_sha256":"e5ad17d5868acd2e60490aa52ca4be7d05316b89cb6de1f1403fd751f81a5fcd"}