{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:BB7JPTWFOZ6D7655UZMEBEM5GA","short_pith_number":"pith:BB7JPTWF","schema_version":"1.0","canonical_sha256":"087e97cec5767c3ffbbda65840919d300da1b1b8a195ecfa3353c1cd2910bc19","source":{"kind":"arxiv","id":"1502.03695","version":1},"attestation_state":"computed","paper":{"title":"Even pairs in square-free Berge graphs with no odd prism","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fr\\'ed\\'eric Maffray","submitted_at":"2015-02-12T15:09:57Z","abstract_excerpt":"We consider the class of Berge graphs that contain no odd prism and no square (cycle on four vertices). We prove that every graph G in this class either is a clique or has an even pair, as conjectured by Everett and Reed. This result is used to devise a polynomial-time algorithm to color optimally every graph in this class."},"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":"1502.03695","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-12T15:09:57Z","cross_cats_sorted":[],"title_canon_sha256":"cd9b5267cba622f1c9bcb18ca152dfaba575c71841b4865b6968e93e15612d6d","abstract_canon_sha256":"bcdf4c958ba912d7dd91813b68f61d4edf24696f148a2863ffa713b9a4a1abb9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:17.023835Z","signature_b64":"l/FUhL3SSrWPpLCvXrFYyxTXskzwPzlCQvhY775WLVOMFDO3C+zNx0DrBeEsXF66XYI4WSFD+SzCHbBBbmWgDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"087e97cec5767c3ffbbda65840919d300da1b1b8a195ecfa3353c1cd2910bc19","last_reissued_at":"2026-05-18T02:27:17.023113Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:17.023113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Even pairs in square-free Berge graphs with no odd prism","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fr\\'ed\\'eric Maffray","submitted_at":"2015-02-12T15:09:57Z","abstract_excerpt":"We consider the class of Berge graphs that contain no odd prism and no square (cycle on four vertices). We prove that every graph G in this class either is a clique or has an even pair, as conjectured by Everett and Reed. This result is used to devise a polynomial-time algorithm to color optimally every graph in this class."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03695","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":"1502.03695","created_at":"2026-05-18T02:27:17.023224+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.03695v1","created_at":"2026-05-18T02:27:17.023224+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03695","created_at":"2026-05-18T02:27:17.023224+00:00"},{"alias_kind":"pith_short_12","alias_value":"BB7JPTWFOZ6D","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BB7JPTWFOZ6D7655","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BB7JPTWF","created_at":"2026-05-18T12:29:14.074870+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/BB7JPTWFOZ6D7655UZMEBEM5GA","json":"https://pith.science/pith/BB7JPTWFOZ6D7655UZMEBEM5GA.json","graph_json":"https://pith.science/api/pith-number/BB7JPTWFOZ6D7655UZMEBEM5GA/graph.json","events_json":"https://pith.science/api/pith-number/BB7JPTWFOZ6D7655UZMEBEM5GA/events.json","paper":"https://pith.science/paper/BB7JPTWF"},"agent_actions":{"view_html":"https://pith.science/pith/BB7JPTWFOZ6D7655UZMEBEM5GA","download_json":"https://pith.science/pith/BB7JPTWFOZ6D7655UZMEBEM5GA.json","view_paper":"https://pith.science/paper/BB7JPTWF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.03695&json=true","fetch_graph":"https://pith.science/api/pith-number/BB7JPTWFOZ6D7655UZMEBEM5GA/graph.json","fetch_events":"https://pith.science/api/pith-number/BB7JPTWFOZ6D7655UZMEBEM5GA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BB7JPTWFOZ6D7655UZMEBEM5GA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BB7JPTWFOZ6D7655UZMEBEM5GA/action/storage_attestation","attest_author":"https://pith.science/pith/BB7JPTWFOZ6D7655UZMEBEM5GA/action/author_attestation","sign_citation":"https://pith.science/pith/BB7JPTWFOZ6D7655UZMEBEM5GA/action/citation_signature","submit_replication":"https://pith.science/pith/BB7JPTWFOZ6D7655UZMEBEM5GA/action/replication_record"}},"created_at":"2026-05-18T02:27:17.023224+00:00","updated_at":"2026-05-18T02:27:17.023224+00:00"}