{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:2ZMQEWVTQDSF3RJOKFY7EDECSF","short_pith_number":"pith:2ZMQEWVT","schema_version":"1.0","canonical_sha256":"d659025ab380e45dc52e5171f20c82916ac46e6b66acf8d8c8610667df30fdfc","source":{"kind":"arxiv","id":"1301.5149","version":7},"attestation_state":"computed","paper":{"title":"Perfect graphs: a survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Nicolas Trotignon","submitted_at":"2013-01-22T11:22:14Z","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."},"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":"1301.5149","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-22T11:22:14Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"bac23173fd2ba98915a120a6f591d6cf2e727e40a17b584f3cb7943e2668a4b2","abstract_canon_sha256":"a4ca15385b53f468ed06a65c6ad2e338bee509c705c7e3e34a506b6c4d2ed61d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:53.072863Z","signature_b64":"+flgzD8y7bHAX73p+P8s68miGRODE9iMtcj2zIrv7jC9RWR/S2GxEiN+FcJa/csBRICqIKweXEPeHBdzmdJvBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d659025ab380e45dc52e5171f20c82916ac46e6b66acf8d8c8610667df30fdfc","last_reissued_at":"2026-05-18T02:03:53.072059Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:53.072059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Perfect graphs: a survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Nicolas Trotignon","submitted_at":"2013-01-22T11:22:14Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.5149","kind":"arxiv","version":7},"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":"1301.5149","created_at":"2026-05-18T02:03:53.072201+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.5149v7","created_at":"2026-05-18T02:03:53.072201+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.5149","created_at":"2026-05-18T02:03:53.072201+00:00"},{"alias_kind":"pith_short_12","alias_value":"2ZMQEWVTQDSF","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"2ZMQEWVTQDSF3RJO","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"2ZMQEWVT","created_at":"2026-05-18T12:27:32.513160+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/2ZMQEWVTQDSF3RJOKFY7EDECSF","json":"https://pith.science/pith/2ZMQEWVTQDSF3RJOKFY7EDECSF.json","graph_json":"https://pith.science/api/pith-number/2ZMQEWVTQDSF3RJOKFY7EDECSF/graph.json","events_json":"https://pith.science/api/pith-number/2ZMQEWVTQDSF3RJOKFY7EDECSF/events.json","paper":"https://pith.science/paper/2ZMQEWVT"},"agent_actions":{"view_html":"https://pith.science/pith/2ZMQEWVTQDSF3RJOKFY7EDECSF","download_json":"https://pith.science/pith/2ZMQEWVTQDSF3RJOKFY7EDECSF.json","view_paper":"https://pith.science/paper/2ZMQEWVT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.5149&json=true","fetch_graph":"https://pith.science/api/pith-number/2ZMQEWVTQDSF3RJOKFY7EDECSF/graph.json","fetch_events":"https://pith.science/api/pith-number/2ZMQEWVTQDSF3RJOKFY7EDECSF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2ZMQEWVTQDSF3RJOKFY7EDECSF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2ZMQEWVTQDSF3RJOKFY7EDECSF/action/storage_attestation","attest_author":"https://pith.science/pith/2ZMQEWVTQDSF3RJOKFY7EDECSF/action/author_attestation","sign_citation":"https://pith.science/pith/2ZMQEWVTQDSF3RJOKFY7EDECSF/action/citation_signature","submit_replication":"https://pith.science/pith/2ZMQEWVTQDSF3RJOKFY7EDECSF/action/replication_record"}},"created_at":"2026-05-18T02:03:53.072201+00:00","updated_at":"2026-05-18T02:03:53.072201+00:00"}