{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SFURRFMBKZGY5WG3VROC2EAT2G","short_pith_number":"pith:SFURRFMB","schema_version":"1.0","canonical_sha256":"9169189581564d8ed8dbac5c2d1013d1a104383b3dd36ea407d6a3f2f5f1d1bd","source":{"kind":"arxiv","id":"1507.00173","version":2},"attestation_state":"computed","paper":{"title":"$t$-perfection in $P_5$-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Elke Fuchs, Henning Bruhn","submitted_at":"2015-07-01T10:14:19Z","abstract_excerpt":"A graph is called $t$-perfect if its stable set polytope is fully described by non-negativity, edge and odd-cycle constraints. We characterise $P_5$-free $t$-perfect graphs in terms of forbidden $t$-minors. Moreover, we show that $P_5$-free $t$-perfect graphs can always be coloured with three colours, and that they can be recognised in polynomial time."},"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":"1507.00173","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-01T10:14:19Z","cross_cats_sorted":[],"title_canon_sha256":"687bbeaeb6731fd14da2d00a122f5bdffdb5222dcf3edac23f9bf838055381d6","abstract_canon_sha256":"b465f86d0cd4d653ad40dfdefbea4a3d8d06a24622fd3537d7f3f1efe8c391ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:42.358507Z","signature_b64":"mScKie/znDjP7uCQ56150Xfu1ofTdOV/nZrzlzZcZloVeYhHyt9CjYoVimCKWb92iZ5LzOoOz5wLRIh035MPAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9169189581564d8ed8dbac5c2d1013d1a104383b3dd36ea407d6a3f2f5f1d1bd","last_reissued_at":"2026-05-18T01:01:42.358094Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:42.358094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$t$-perfection in $P_5$-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Elke Fuchs, Henning Bruhn","submitted_at":"2015-07-01T10:14:19Z","abstract_excerpt":"A graph is called $t$-perfect if its stable set polytope is fully described by non-negativity, edge and odd-cycle constraints. We characterise $P_5$-free $t$-perfect graphs in terms of forbidden $t$-minors. Moreover, we show that $P_5$-free $t$-perfect graphs can always be coloured with three colours, and that they can be recognised in polynomial time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.00173","kind":"arxiv","version":2},"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":"1507.00173","created_at":"2026-05-18T01:01:42.358159+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.00173v2","created_at":"2026-05-18T01:01:42.358159+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00173","created_at":"2026-05-18T01:01:42.358159+00:00"},{"alias_kind":"pith_short_12","alias_value":"SFURRFMBKZGY","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"SFURRFMBKZGY5WG3","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"SFURRFMB","created_at":"2026-05-18T12:29:39.896362+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/SFURRFMBKZGY5WG3VROC2EAT2G","json":"https://pith.science/pith/SFURRFMBKZGY5WG3VROC2EAT2G.json","graph_json":"https://pith.science/api/pith-number/SFURRFMBKZGY5WG3VROC2EAT2G/graph.json","events_json":"https://pith.science/api/pith-number/SFURRFMBKZGY5WG3VROC2EAT2G/events.json","paper":"https://pith.science/paper/SFURRFMB"},"agent_actions":{"view_html":"https://pith.science/pith/SFURRFMBKZGY5WG3VROC2EAT2G","download_json":"https://pith.science/pith/SFURRFMBKZGY5WG3VROC2EAT2G.json","view_paper":"https://pith.science/paper/SFURRFMB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.00173&json=true","fetch_graph":"https://pith.science/api/pith-number/SFURRFMBKZGY5WG3VROC2EAT2G/graph.json","fetch_events":"https://pith.science/api/pith-number/SFURRFMBKZGY5WG3VROC2EAT2G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SFURRFMBKZGY5WG3VROC2EAT2G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SFURRFMBKZGY5WG3VROC2EAT2G/action/storage_attestation","attest_author":"https://pith.science/pith/SFURRFMBKZGY5WG3VROC2EAT2G/action/author_attestation","sign_citation":"https://pith.science/pith/SFURRFMBKZGY5WG3VROC2EAT2G/action/citation_signature","submit_replication":"https://pith.science/pith/SFURRFMBKZGY5WG3VROC2EAT2G/action/replication_record"}},"created_at":"2026-05-18T01:01:42.358159+00:00","updated_at":"2026-05-18T01:01:42.358159+00:00"}