{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:B46AMD6YD37UYHJVPKHZHIWM26","short_pith_number":"pith:B46AMD6Y","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"},"canonical_sha256":"0f3c060fd81eff4c1d357a8f93a2ccd78c71793f162a8b989bf212bc8d0bbcc1","source":{"kind":"arxiv","id":"1309.0119","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.0119","created_at":"2026-05-18T03:14:28Z"},{"alias_kind":"arxiv_version","alias_value":"1309.0119v1","created_at":"2026-05-18T03:14:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0119","created_at":"2026-05-18T03:14:28Z"},{"alias_kind":"pith_short_12","alias_value":"B46AMD6YD37U","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"B46AMD6YD37UYHJV","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"B46AMD6Y","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:B46AMD6YD37UYHJVPKHZHIWM26","target":"record","payload":{"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"},"canonical_sha256":"0f3c060fd81eff4c1d357a8f93a2ccd78c71793f162a8b989bf212bc8d0bbcc1","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"},"source_kind":"arxiv","source_id":"1309.0119","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:14:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qjz5Ta0jEjF/Ik8CGG3X0KEr7BF3iyX/Cgb6w1NHn9LxkQiyLZkaRccCurEpqQG3ODQ4sufhG8bWgE4RO81eDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T00:01:56.805230Z"},"content_sha256":"c2c69353917798164ba5afc1b675ce9aa1b26b73e81d2b34a6578a8e8baea255","schema_version":"1.0","event_id":"sha256:c2c69353917798164ba5afc1b675ce9aa1b26b73e81d2b34a6578a8e8baea255"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:B46AMD6YD37UYHJVPKHZHIWM26","target":"graph","payload":{"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"},"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:14:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JPgULaJs6DZa0mVfKc7XcPIDAjQZA9ec3bsFJ3APQT/ZXwc2GN4hu4Xu6NeBVSEd62HvliOCnAHpVli8A0UFCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T00:01:56.805626Z"},"content_sha256":"0158e6712adca5ba0514dfa1efaa936ba9bb0ff2a0bf3e36af8536c249c4b8fe","schema_version":"1.0","event_id":"sha256:0158e6712adca5ba0514dfa1efaa936ba9bb0ff2a0bf3e36af8536c249c4b8fe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B46AMD6YD37UYHJVPKHZHIWM26/bundle.json","state_url":"https://pith.science/pith/B46AMD6YD37UYHJVPKHZHIWM26/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B46AMD6YD37UYHJVPKHZHIWM26/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-07-05T00:01:56Z","links":{"resolver":"https://pith.science/pith/B46AMD6YD37UYHJVPKHZHIWM26","bundle":"https://pith.science/pith/B46AMD6YD37UYHJVPKHZHIWM26/bundle.json","state":"https://pith.science/pith/B46AMD6YD37UYHJVPKHZHIWM26/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B46AMD6YD37UYHJVPKHZHIWM26/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:B46AMD6YD37UYHJVPKHZHIWM26","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":"b928f99814ed116cf790ff50be58574d00b2a8392dbfc76d8751681aae0bd7bc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-31T14:17:06Z","title_canon_sha256":"1a9e4753a6624a87f3e9d236192e7e936bf3a36b869e47a70bedb078c9ef5f3a"},"schema_version":"1.0","source":{"id":"1309.0119","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.0119","created_at":"2026-05-18T03:14:28Z"},{"alias_kind":"arxiv_version","alias_value":"1309.0119v1","created_at":"2026-05-18T03:14:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0119","created_at":"2026-05-18T03:14:28Z"},{"alias_kind":"pith_short_12","alias_value":"B46AMD6YD37U","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"B46AMD6YD37UYHJV","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"B46AMD6Y","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:0158e6712adca5ba0514dfa1efaa936ba9bb0ff2a0bf3e36af8536c249c4b8fe","target":"graph","created_at":"2026-05-18T03:14:28Z","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 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","authors_text":"Nicolas Trotignon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-31T14:17:06Z","title":"Graphes parfaits : structure et algorithmes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.0119","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:c2c69353917798164ba5afc1b675ce9aa1b26b73e81d2b34a6578a8e8baea255","target":"record","created_at":"2026-05-18T03:14:28Z","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":"b928f99814ed116cf790ff50be58574d00b2a8392dbfc76d8751681aae0bd7bc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-31T14:17:06Z","title_canon_sha256":"1a9e4753a6624a87f3e9d236192e7e936bf3a36b869e47a70bedb078c9ef5f3a"},"schema_version":"1.0","source":{"id":"1309.0119","kind":"arxiv","version":1}},"canonical_sha256":"0f3c060fd81eff4c1d357a8f93a2ccd78c71793f162a8b989bf212bc8d0bbcc1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f3c060fd81eff4c1d357a8f93a2ccd78c71793f162a8b989bf212bc8d0bbcc1","first_computed_at":"2026-05-18T03:14:28.818378Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:14:28.818378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2S3aOCR9MzVTSOZT6c7iQkl2IOD9HCuDWQRvdB68W0NsMAMPlX9jrJxn1vQVunwaoNuC10SCSZCaWZADfxJ7Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:14:28.818892Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.0119","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c2c69353917798164ba5afc1b675ce9aa1b26b73e81d2b34a6578a8e8baea255","sha256:0158e6712adca5ba0514dfa1efaa936ba9bb0ff2a0bf3e36af8536c249c4b8fe"],"state_sha256":"ec138854a90e540f08b653c0cfef958b4dd2fe66db644b58b164df54f599cf11"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vmqXrqY5g9CQzyIkPLNv7tciX2YHxdaakRwjmuiTr9I4kclOp0ocvHD+EetamItw94VSwdVkQwgv109nnJCcCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T00:01:56.807656Z","bundle_sha256":"21c047eca38a18b8900e26264edcaeb41f6873df04cfe66897c9c4a4fcc264b9"}}