{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:B46AMD6YD37UYHJVPKHZHIWM26","short_pith_number":"pith:B46AMD6Y","schema_version":"1.0","canonical_sha256":"0f3c060fd81eff4c1d357a8f93a2ccd78c71793f162a8b989bf212bc8d0bbcc1","source":{"kind":"arxiv","id":"1309.0119","version":1},"attestation_state":"computed","paper":{"title":"Graphes parfaits : structure et algorithmes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nicolas Trotignon","submitted_at":"2013-08-31T14:17:06Z","abstract_excerpt":"This work is the PhD thesis of Nicolas Trotignon, written in 2004 under the supervision of Fr\\'ed\\'eric Maffray. It is motivated by the desire for a better understanding of perfect graphs. The proof of the Claude Berge's perfect graph conjecture in 2002 by Chudnovsky, Robertson, Seymour and Thomas has shed a new light on this field of combinatorics. But some questions are still unsettled, particulary the existence of a combinatorial algorithm for the coloring of perfect graphs.\n  An even pair of a graph is a pair of vertices such that every path joining them has even length. As proved by Fonlu"},"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":"1309.0119","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-31T14:17:06Z","cross_cats_sorted":[],"title_canon_sha256":"1a9e4753a6624a87f3e9d236192e7e936bf3a36b869e47a70bedb078c9ef5f3a","abstract_canon_sha256":"b928f99814ed116cf790ff50be58574d00b2a8392dbfc76d8751681aae0bd7bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:14:28.818892Z","signature_b64":"2S3aOCR9MzVTSOZT6c7iQkl2IOD9HCuDWQRvdB68W0NsMAMPlX9jrJxn1vQVunwaoNuC10SCSZCaWZADfxJ7Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f3c060fd81eff4c1d357a8f93a2ccd78c71793f162a8b989bf212bc8d0bbcc1","last_reissued_at":"2026-05-18T03:14:28.818378Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:14:28.818378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graphes parfaits : structure et algorithmes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nicolas Trotignon","submitted_at":"2013-08-31T14:17:06Z","abstract_excerpt":"This work is the PhD thesis of Nicolas Trotignon, written in 2004 under the supervision of Fr\\'ed\\'eric Maffray. It is motivated by the desire for a better understanding of perfect graphs. The proof of the Claude Berge's perfect graph conjecture in 2002 by Chudnovsky, Robertson, Seymour and Thomas has shed a new light on this field of combinatorics. But some questions are still unsettled, particulary the existence of a combinatorial algorithm for the coloring of perfect graphs.\n  An even pair of a graph is a pair of vertices such that every path joining them has even length. As proved by Fonlu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.0119","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1309.0119","created_at":"2026-05-18T03:14:28.818482+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.0119v1","created_at":"2026-05-18T03:14:28.818482+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0119","created_at":"2026-05-18T03:14:28.818482+00:00"},{"alias_kind":"pith_short_12","alias_value":"B46AMD6YD37U","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"B46AMD6YD37UYHJV","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"B46AMD6Y","created_at":"2026-05-18T12:27:38.830355+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/B46AMD6YD37UYHJVPKHZHIWM26","json":"https://pith.science/pith/B46AMD6YD37UYHJVPKHZHIWM26.json","graph_json":"https://pith.science/api/pith-number/B46AMD6YD37UYHJVPKHZHIWM26/graph.json","events_json":"https://pith.science/api/pith-number/B46AMD6YD37UYHJVPKHZHIWM26/events.json","paper":"https://pith.science/paper/B46AMD6Y"},"agent_actions":{"view_html":"https://pith.science/pith/B46AMD6YD37UYHJVPKHZHIWM26","download_json":"https://pith.science/pith/B46AMD6YD37UYHJVPKHZHIWM26.json","view_paper":"https://pith.science/paper/B46AMD6Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.0119&json=true","fetch_graph":"https://pith.science/api/pith-number/B46AMD6YD37UYHJVPKHZHIWM26/graph.json","fetch_events":"https://pith.science/api/pith-number/B46AMD6YD37UYHJVPKHZHIWM26/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B46AMD6YD37UYHJVPKHZHIWM26/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B46AMD6YD37UYHJVPKHZHIWM26/action/storage_attestation","attest_author":"https://pith.science/pith/B46AMD6YD37UYHJVPKHZHIWM26/action/author_attestation","sign_citation":"https://pith.science/pith/B46AMD6YD37UYHJVPKHZHIWM26/action/citation_signature","submit_replication":"https://pith.science/pith/B46AMD6YD37UYHJVPKHZHIWM26/action/replication_record"}},"created_at":"2026-05-18T03:14:28.818482+00:00","updated_at":"2026-05-18T03:14:28.818482+00:00"}