{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:6SEMWQ4GOYVOGTESL2RPBLKMIS","short_pith_number":"pith:6SEMWQ4G","schema_version":"1.0","canonical_sha256":"f488cb4386762ae34c925ea2f0ad4c44ab0e45cee510491a635ee50d10ac2722","source":{"kind":"arxiv","id":"1402.2806","version":1},"attestation_state":"computed","paper":{"title":"Coloration of $K_7^-$-minor free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boris Albar","submitted_at":"2014-02-12T12:44:06Z","abstract_excerpt":"Hadwiger's conjecture says that every $K_t$-minor free graph is $(t - 1)$-colorable. This problem has been proved for $t \\leq 6$ but remains open for $t \\geq 7$. $K_7$-minor free graphs have been proved to be $8$-colorable (Albar & Gon\\c{c}alves, 2013). We prove here that $K_7^-$-minor free graphs are $7$-colorable, where $K_7^-$ is the graph obtained from $K_7$ by removing one edge."},"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":"1402.2806","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-12T12:44:06Z","cross_cats_sorted":[],"title_canon_sha256":"f7dea75765a082641d2bf1e6000616a811ddcb1b2930e69781259ec542b4a4f8","abstract_canon_sha256":"db5426fff316b802ef13e830896ec5eab8dc1bbc29770b256733beee54d02e86"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:17.242572Z","signature_b64":"KzRpSMsl+pRd0RCjObZievFQcL3zRTN/lPV+LyRETE9WBBx8PutuLQQmpHapSRzJnp9tDdlyY+Ropqto4ossCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f488cb4386762ae34c925ea2f0ad4c44ab0e45cee510491a635ee50d10ac2722","last_reissued_at":"2026-05-18T02:59:17.241954Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:17.241954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coloration of $K_7^-$-minor free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boris Albar","submitted_at":"2014-02-12T12:44:06Z","abstract_excerpt":"Hadwiger's conjecture says that every $K_t$-minor free graph is $(t - 1)$-colorable. This problem has been proved for $t \\leq 6$ but remains open for $t \\geq 7$. $K_7$-minor free graphs have been proved to be $8$-colorable (Albar & Gon\\c{c}alves, 2013). We prove here that $K_7^-$-minor free graphs are $7$-colorable, where $K_7^-$ is the graph obtained from $K_7$ by removing one edge."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2806","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":"1402.2806","created_at":"2026-05-18T02:59:17.242033+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.2806v1","created_at":"2026-05-18T02:59:17.242033+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2806","created_at":"2026-05-18T02:59:17.242033+00:00"},{"alias_kind":"pith_short_12","alias_value":"6SEMWQ4GOYVO","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"6SEMWQ4GOYVOGTES","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"6SEMWQ4G","created_at":"2026-05-18T12:28:16.859392+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/6SEMWQ4GOYVOGTESL2RPBLKMIS","json":"https://pith.science/pith/6SEMWQ4GOYVOGTESL2RPBLKMIS.json","graph_json":"https://pith.science/api/pith-number/6SEMWQ4GOYVOGTESL2RPBLKMIS/graph.json","events_json":"https://pith.science/api/pith-number/6SEMWQ4GOYVOGTESL2RPBLKMIS/events.json","paper":"https://pith.science/paper/6SEMWQ4G"},"agent_actions":{"view_html":"https://pith.science/pith/6SEMWQ4GOYVOGTESL2RPBLKMIS","download_json":"https://pith.science/pith/6SEMWQ4GOYVOGTESL2RPBLKMIS.json","view_paper":"https://pith.science/paper/6SEMWQ4G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.2806&json=true","fetch_graph":"https://pith.science/api/pith-number/6SEMWQ4GOYVOGTESL2RPBLKMIS/graph.json","fetch_events":"https://pith.science/api/pith-number/6SEMWQ4GOYVOGTESL2RPBLKMIS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6SEMWQ4GOYVOGTESL2RPBLKMIS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6SEMWQ4GOYVOGTESL2RPBLKMIS/action/storage_attestation","attest_author":"https://pith.science/pith/6SEMWQ4GOYVOGTESL2RPBLKMIS/action/author_attestation","sign_citation":"https://pith.science/pith/6SEMWQ4GOYVOGTESL2RPBLKMIS/action/citation_signature","submit_replication":"https://pith.science/pith/6SEMWQ4GOYVOGTESL2RPBLKMIS/action/replication_record"}},"created_at":"2026-05-18T02:59:17.242033+00:00","updated_at":"2026-05-18T02:59:17.242033+00:00"}