{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FKYWY7SMKQ6K3HGE6RWLQ5OAHQ","short_pith_number":"pith:FKYWY7SM","schema_version":"1.0","canonical_sha256":"2ab16c7e4c543cad9cc4f46cb875c03c08f099b478b072c55caf55aad30dfecc","source":{"kind":"arxiv","id":"1812.11108","version":1},"attestation_state":"computed","paper":{"title":"Towards a constructive formalization of Perfect Graph Theorems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.LO","authors_text":"Abhishek Kr Singh, Raja Natarajan","submitted_at":"2018-12-28T16:46:37Z","abstract_excerpt":"Interaction between clique number $\\omega(G) $ and chromatic number $\\chi(G) $ of a graph is a well studied topic in graph theory. Perfect Graph Theorems are probably the most important results in this direction. Graph $G$ is called \\emph{perfect} if $\\chi(H)=\\omega(H)$ for every induced subgraph $H$ of $G$. The Strong Perfect Graph Theorem (SPGT) states that a graph is perfect if and only if it does not contain an odd hole (or an odd anti-hole) as its induced subgraph. The Weak Perfect Graph Theorem (WPGT) states that a graph is perfect if and only if its complement is perfect. In this paper,"},"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":"1812.11108","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-12-28T16:46:37Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"2d0230365c29a7ff1e0639dd146c2ab09038d5abd3a1b43f4664f433c9b6ced8","abstract_canon_sha256":"a799274546c67521f46e212fccdbaeeb3b877e99c435fb278be9124af04fc271"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:16.307181Z","signature_b64":"GY13C9yJBMpIa2a1ZUoQHnjTQI2RRlDh8bvQ2w+WOtekod0RWhN2zntN52g0sU0pKsnQ8tqb3CL5psd4EVY6Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ab16c7e4c543cad9cc4f46cb875c03c08f099b478b072c55caf55aad30dfecc","last_reissued_at":"2026-05-17T23:57:16.306821Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:16.306821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards a constructive formalization of Perfect Graph Theorems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.LO","authors_text":"Abhishek Kr Singh, Raja Natarajan","submitted_at":"2018-12-28T16:46:37Z","abstract_excerpt":"Interaction between clique number $\\omega(G) $ and chromatic number $\\chi(G) $ of a graph is a well studied topic in graph theory. Perfect Graph Theorems are probably the most important results in this direction. Graph $G$ is called \\emph{perfect} if $\\chi(H)=\\omega(H)$ for every induced subgraph $H$ of $G$. The Strong Perfect Graph Theorem (SPGT) states that a graph is perfect if and only if it does not contain an odd hole (or an odd anti-hole) as its induced subgraph. The Weak Perfect Graph Theorem (WPGT) states that a graph is perfect if and only if its complement is perfect. In this paper,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.11108","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":"1812.11108","created_at":"2026-05-17T23:57:16.306877+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.11108v1","created_at":"2026-05-17T23:57:16.306877+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.11108","created_at":"2026-05-17T23:57:16.306877+00:00"},{"alias_kind":"pith_short_12","alias_value":"FKYWY7SMKQ6K","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"FKYWY7SMKQ6K3HGE","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"FKYWY7SM","created_at":"2026-05-18T12:32:22.470017+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/FKYWY7SMKQ6K3HGE6RWLQ5OAHQ","json":"https://pith.science/pith/FKYWY7SMKQ6K3HGE6RWLQ5OAHQ.json","graph_json":"https://pith.science/api/pith-number/FKYWY7SMKQ6K3HGE6RWLQ5OAHQ/graph.json","events_json":"https://pith.science/api/pith-number/FKYWY7SMKQ6K3HGE6RWLQ5OAHQ/events.json","paper":"https://pith.science/paper/FKYWY7SM"},"agent_actions":{"view_html":"https://pith.science/pith/FKYWY7SMKQ6K3HGE6RWLQ5OAHQ","download_json":"https://pith.science/pith/FKYWY7SMKQ6K3HGE6RWLQ5OAHQ.json","view_paper":"https://pith.science/paper/FKYWY7SM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.11108&json=true","fetch_graph":"https://pith.science/api/pith-number/FKYWY7SMKQ6K3HGE6RWLQ5OAHQ/graph.json","fetch_events":"https://pith.science/api/pith-number/FKYWY7SMKQ6K3HGE6RWLQ5OAHQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FKYWY7SMKQ6K3HGE6RWLQ5OAHQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FKYWY7SMKQ6K3HGE6RWLQ5OAHQ/action/storage_attestation","attest_author":"https://pith.science/pith/FKYWY7SMKQ6K3HGE6RWLQ5OAHQ/action/author_attestation","sign_citation":"https://pith.science/pith/FKYWY7SMKQ6K3HGE6RWLQ5OAHQ/action/citation_signature","submit_replication":"https://pith.science/pith/FKYWY7SMKQ6K3HGE6RWLQ5OAHQ/action/replication_record"}},"created_at":"2026-05-17T23:57:16.306877+00:00","updated_at":"2026-05-17T23:57:16.306877+00:00"}