{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:XDXT2VQTEOEEBRHX4UPKCQT74J","short_pith_number":"pith:XDXT2VQT","canonical_record":{"source":{"id":"1309.0435","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-02T15:14:37Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"aae0c05de013b2b4f422af0abb72861825887fff25cd00f4dd5b98479e54893a","abstract_canon_sha256":"4d2fe1a081d0a087af2006cd3c6eb844941f8e0ac49fd48e08b4cb176af881e8"},"schema_version":"1.0"},"canonical_sha256":"b8ef3d5613238840c4f7e51ea1427fe24407979fb6dbeca39ede774ef4a3f393","source":{"kind":"arxiv","id":"1309.0435","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.0435","created_at":"2026-05-18T03:14:27Z"},{"alias_kind":"arxiv_version","alias_value":"1309.0435v1","created_at":"2026-05-18T03:14:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0435","created_at":"2026-05-18T03:14:27Z"},{"alias_kind":"pith_short_12","alias_value":"XDXT2VQTEOEE","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XDXT2VQTEOEEBRHX","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XDXT2VQT","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:XDXT2VQTEOEEBRHX4UPKCQT74J","target":"record","payload":{"canonical_record":{"source":{"id":"1309.0435","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-02T15:14:37Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"aae0c05de013b2b4f422af0abb72861825887fff25cd00f4dd5b98479e54893a","abstract_canon_sha256":"4d2fe1a081d0a087af2006cd3c6eb844941f8e0ac49fd48e08b4cb176af881e8"},"schema_version":"1.0"},"canonical_sha256":"b8ef3d5613238840c4f7e51ea1427fe24407979fb6dbeca39ede774ef4a3f393","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:14:27.309999Z","signature_b64":"hRipyIM6OPps5zzGXD6Z857D4EJ4gIRA13UB7S1sUR9gDHgIr7TD1HUqFaMpO26XMzTEOO80iCUU74+AoxFLAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8ef3d5613238840c4f7e51ea1427fe24407979fb6dbeca39ede774ef4a3f393","last_reissued_at":"2026-05-18T03:14:27.309567Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:14:27.309567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.0435","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:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0oPZsDvFBiT2/w8EGlHyIcTTHV3x0Ti3MkkHPFeGRCMxxrucI6WpD6Sg3Mt+v7Ih/ZG1rtvYz4hvKoxTFNbTDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:25:05.871016Z"},"content_sha256":"246b8f20567d53b323604fc3eacb6bb3a6796b30fd2ddac81ccb9f256fe8a92d","schema_version":"1.0","event_id":"sha256:246b8f20567d53b323604fc3eacb6bb3a6796b30fd2ddac81ccb9f256fe8a92d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:XDXT2VQTEOEEBRHX4UPKCQT74J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithms for perfectly contractile graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Fr\\'ed\\'eric Maffray, Nicolas Trotignon","submitted_at":"2013-09-02T15:14:37Z","abstract_excerpt":"We consider the class ${\\cal A}$ of graphs that contain no odd hole, no antihole of length at least 5, and no \"prism\" (a graph consisting of two disjoint triangles with three disjoint paths between them) and the class ${\\cal A}'$ of graphs that contain no odd hole, no antihole of length at least 5 and no odd prism (prism whose three paths are odd). These two classes were introduced by Everett and Reed and are relevant to the study of perfect graphs. We give polynomial-time recognition algorithms for these two classes. We proved previously that every graph $G\\in{\\cal A}$ is \"perfectly contracti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.0435","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:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iePygBGI/xHs+LnLF8UyRshx0tykCSCu+V6/UD72i7wKdbEFRcR0DbRGNcQrw3wY13mN6/QvM11C5IAtMlHJAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:25:05.871377Z"},"content_sha256":"fbf3c044b5952860e69c1866f714ceb0975113e192773a4b077594fff6931201","schema_version":"1.0","event_id":"sha256:fbf3c044b5952860e69c1866f714ceb0975113e192773a4b077594fff6931201"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XDXT2VQTEOEEBRHX4UPKCQT74J/bundle.json","state_url":"https://pith.science/pith/XDXT2VQTEOEEBRHX4UPKCQT74J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XDXT2VQTEOEEBRHX4UPKCQT74J/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-31T00:25:05Z","links":{"resolver":"https://pith.science/pith/XDXT2VQTEOEEBRHX4UPKCQT74J","bundle":"https://pith.science/pith/XDXT2VQTEOEEBRHX4UPKCQT74J/bundle.json","state":"https://pith.science/pith/XDXT2VQTEOEEBRHX4UPKCQT74J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XDXT2VQTEOEEBRHX4UPKCQT74J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:XDXT2VQTEOEEBRHX4UPKCQT74J","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":"4d2fe1a081d0a087af2006cd3c6eb844941f8e0ac49fd48e08b4cb176af881e8","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-02T15:14:37Z","title_canon_sha256":"aae0c05de013b2b4f422af0abb72861825887fff25cd00f4dd5b98479e54893a"},"schema_version":"1.0","source":{"id":"1309.0435","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.0435","created_at":"2026-05-18T03:14:27Z"},{"alias_kind":"arxiv_version","alias_value":"1309.0435v1","created_at":"2026-05-18T03:14:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0435","created_at":"2026-05-18T03:14:27Z"},{"alias_kind":"pith_short_12","alias_value":"XDXT2VQTEOEE","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XDXT2VQTEOEEBRHX","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XDXT2VQT","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:fbf3c044b5952860e69c1866f714ceb0975113e192773a4b077594fff6931201","target":"graph","created_at":"2026-05-18T03:14:27Z","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":"We consider the class ${\\cal A}$ of graphs that contain no odd hole, no antihole of length at least 5, and no \"prism\" (a graph consisting of two disjoint triangles with three disjoint paths between them) and the class ${\\cal A}'$ of graphs that contain no odd hole, no antihole of length at least 5 and no odd prism (prism whose three paths are odd). These two classes were introduced by Everett and Reed and are relevant to the study of perfect graphs. We give polynomial-time recognition algorithms for these two classes. We proved previously that every graph $G\\in{\\cal A}$ is \"perfectly contracti","authors_text":"Fr\\'ed\\'eric Maffray, Nicolas Trotignon","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-02T15:14:37Z","title":"Algorithms for perfectly contractile graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.0435","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:246b8f20567d53b323604fc3eacb6bb3a6796b30fd2ddac81ccb9f256fe8a92d","target":"record","created_at":"2026-05-18T03:14:27Z","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":"4d2fe1a081d0a087af2006cd3c6eb844941f8e0ac49fd48e08b4cb176af881e8","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-02T15:14:37Z","title_canon_sha256":"aae0c05de013b2b4f422af0abb72861825887fff25cd00f4dd5b98479e54893a"},"schema_version":"1.0","source":{"id":"1309.0435","kind":"arxiv","version":1}},"canonical_sha256":"b8ef3d5613238840c4f7e51ea1427fe24407979fb6dbeca39ede774ef4a3f393","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8ef3d5613238840c4f7e51ea1427fe24407979fb6dbeca39ede774ef4a3f393","first_computed_at":"2026-05-18T03:14:27.309567Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:14:27.309567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hRipyIM6OPps5zzGXD6Z857D4EJ4gIRA13UB7S1sUR9gDHgIr7TD1HUqFaMpO26XMzTEOO80iCUU74+AoxFLAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:14:27.309999Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.0435","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:246b8f20567d53b323604fc3eacb6bb3a6796b30fd2ddac81ccb9f256fe8a92d","sha256:fbf3c044b5952860e69c1866f714ceb0975113e192773a4b077594fff6931201"],"state_sha256":"3264cb94c05bcc9e2c6d1b3528b7a6fde0423c8e29978a3a26254f6375899f0d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D1ZTbyr1azsHA+8S2KX9hHGsKDRMjRI1JR/YegTnyPV9CkNYDBkaNv5CJHNL/JZ34e2TbbMkv20rajWLc5rsDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T00:25:05.873439Z","bundle_sha256":"9695dc7287f85c9d110865df7029e04fe6d88a80512c85dbee12ee1b79fea8e6"}}