{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ARH2ZI3XTAFTUFFTK7PYFZ4WAS","short_pith_number":"pith:ARH2ZI3X","schema_version":"1.0","canonical_sha256":"044faca377980b3a14b357df82e79604b277db8e725ba93f7a4762d76ce4f38f","source":{"kind":"arxiv","id":"1604.05262","version":1},"attestation_state":"computed","paper":{"title":"A note on the double-critical graph conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander Yu, Hao Huang","submitted_at":"2016-04-18T17:40:52Z","abstract_excerpt":"A connected $n$-chromatic graph $G$ is double-critical if for all the edges $xy$ of $G$, the graph $G-x-y$ is $(n-2)$-chromatic. In 1966, Erd\\H os and Lov\\'asz conjectured that the only double-critical $n$-chromatic graph is $K_n$. This conjecture remains unresolved for $n \\ge 6.$ In this short note, we verify this conjecture for claw-free graphs $G$ of chromatic number $6$."},"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":"1604.05262","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-18T17:40:52Z","cross_cats_sorted":[],"title_canon_sha256":"ce535cb64954a67c6849a05b75101aa943774d1c3ed87444c16e2c5758ed3723","abstract_canon_sha256":"38b31158bed8365cfd7d9d05a516a8cca5cbe404853e5b9e36e8d5a6fdc237a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:55.129341Z","signature_b64":"Xdo8PZuRPEc+9+i5IrdjCd9vVP/dn6KebglgozTL/YA7FFrpg88b1RA/LL3oqsYHzGaZrnGE/oZyYehVRqRWBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"044faca377980b3a14b357df82e79604b277db8e725ba93f7a4762d76ce4f38f","last_reissued_at":"2026-05-18T01:16:55.128465Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:55.128465Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on the double-critical graph conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander Yu, Hao Huang","submitted_at":"2016-04-18T17:40:52Z","abstract_excerpt":"A connected $n$-chromatic graph $G$ is double-critical if for all the edges $xy$ of $G$, the graph $G-x-y$ is $(n-2)$-chromatic. In 1966, Erd\\H os and Lov\\'asz conjectured that the only double-critical $n$-chromatic graph is $K_n$. This conjecture remains unresolved for $n \\ge 6.$ In this short note, we verify this conjecture for claw-free graphs $G$ of chromatic number $6$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.05262","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":"1604.05262","created_at":"2026-05-18T01:16:55.128617+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.05262v1","created_at":"2026-05-18T01:16:55.128617+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.05262","created_at":"2026-05-18T01:16:55.128617+00:00"},{"alias_kind":"pith_short_12","alias_value":"ARH2ZI3XTAFT","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"ARH2ZI3XTAFTUFFT","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"ARH2ZI3X","created_at":"2026-05-18T12:30:07.202191+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/ARH2ZI3XTAFTUFFTK7PYFZ4WAS","json":"https://pith.science/pith/ARH2ZI3XTAFTUFFTK7PYFZ4WAS.json","graph_json":"https://pith.science/api/pith-number/ARH2ZI3XTAFTUFFTK7PYFZ4WAS/graph.json","events_json":"https://pith.science/api/pith-number/ARH2ZI3XTAFTUFFTK7PYFZ4WAS/events.json","paper":"https://pith.science/paper/ARH2ZI3X"},"agent_actions":{"view_html":"https://pith.science/pith/ARH2ZI3XTAFTUFFTK7PYFZ4WAS","download_json":"https://pith.science/pith/ARH2ZI3XTAFTUFFTK7PYFZ4WAS.json","view_paper":"https://pith.science/paper/ARH2ZI3X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.05262&json=true","fetch_graph":"https://pith.science/api/pith-number/ARH2ZI3XTAFTUFFTK7PYFZ4WAS/graph.json","fetch_events":"https://pith.science/api/pith-number/ARH2ZI3XTAFTUFFTK7PYFZ4WAS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ARH2ZI3XTAFTUFFTK7PYFZ4WAS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ARH2ZI3XTAFTUFFTK7PYFZ4WAS/action/storage_attestation","attest_author":"https://pith.science/pith/ARH2ZI3XTAFTUFFTK7PYFZ4WAS/action/author_attestation","sign_citation":"https://pith.science/pith/ARH2ZI3XTAFTUFFTK7PYFZ4WAS/action/citation_signature","submit_replication":"https://pith.science/pith/ARH2ZI3XTAFTUFFTK7PYFZ4WAS/action/replication_record"}},"created_at":"2026-05-18T01:16:55.128617+00:00","updated_at":"2026-05-18T01:16:55.128617+00:00"}