{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:OWF6MBZJYPUUGFLZLV5XHQWFPL","short_pith_number":"pith:OWF6MBZJ","schema_version":"1.0","canonical_sha256":"758be60729c3e94315795d7b73c2c57afb54aa51ba1fcd4b6cce7b9e72a94966","source":{"kind":"arxiv","id":"1604.06504","version":1},"attestation_state":"computed","paper":{"title":"The chromatic number of the square of subcubic planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Brent Thomas, Sogol Jahanbekam, Stephen G. Hartke","submitted_at":"2016-04-21T21:56:47Z","abstract_excerpt":"Wegner conjectured in 1977 that the square of every planar graph with maximum degree at most $3$ is $7$-colorable. We prove this conjecture using the discharging method and computational techniques to verify reducible configurations."},"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.06504","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-21T21:56:47Z","cross_cats_sorted":[],"title_canon_sha256":"5792458d17ece0930af0b5b1b0db722acf9b331bbe6ded6302d8710e2b964bab","abstract_canon_sha256":"9a8666e606afee9c5976834b99f932d596da2c17e593dd12ec0427287c9b668c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:28.898741Z","signature_b64":"gTX9Z9bIM2VdQkDcgUxVwQIvvpVunR23hUOnKZH2XhQW5X7sNO01tFvF6RykOyAaPW1FEohEJ4201RKfOxPhBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"758be60729c3e94315795d7b73c2c57afb54aa51ba1fcd4b6cce7b9e72a94966","last_reissued_at":"2026-05-18T01:16:28.898111Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:28.898111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The chromatic number of the square of subcubic planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Brent Thomas, Sogol Jahanbekam, Stephen G. Hartke","submitted_at":"2016-04-21T21:56:47Z","abstract_excerpt":"Wegner conjectured in 1977 that the square of every planar graph with maximum degree at most $3$ is $7$-colorable. We prove this conjecture using the discharging method and computational techniques to verify reducible configurations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06504","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.06504","created_at":"2026-05-18T01:16:28.898207+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.06504v1","created_at":"2026-05-18T01:16:28.898207+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06504","created_at":"2026-05-18T01:16:28.898207+00:00"},{"alias_kind":"pith_short_12","alias_value":"OWF6MBZJYPUU","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"OWF6MBZJYPUUGFLZ","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"OWF6MBZJ","created_at":"2026-05-18T12:30:36.002864+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2210.05915","citing_title":"Coloring, List Coloring, and Painting Squares of Graphs (and other related problems)","ref_index":88,"is_internal_anchor":true},{"citing_arxiv_id":"2605.04706","citing_title":"Subcubic $K_4$-minor-free graphs without crumby colorings","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OWF6MBZJYPUUGFLZLV5XHQWFPL","json":"https://pith.science/pith/OWF6MBZJYPUUGFLZLV5XHQWFPL.json","graph_json":"https://pith.science/api/pith-number/OWF6MBZJYPUUGFLZLV5XHQWFPL/graph.json","events_json":"https://pith.science/api/pith-number/OWF6MBZJYPUUGFLZLV5XHQWFPL/events.json","paper":"https://pith.science/paper/OWF6MBZJ"},"agent_actions":{"view_html":"https://pith.science/pith/OWF6MBZJYPUUGFLZLV5XHQWFPL","download_json":"https://pith.science/pith/OWF6MBZJYPUUGFLZLV5XHQWFPL.json","view_paper":"https://pith.science/paper/OWF6MBZJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.06504&json=true","fetch_graph":"https://pith.science/api/pith-number/OWF6MBZJYPUUGFLZLV5XHQWFPL/graph.json","fetch_events":"https://pith.science/api/pith-number/OWF6MBZJYPUUGFLZLV5XHQWFPL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OWF6MBZJYPUUGFLZLV5XHQWFPL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OWF6MBZJYPUUGFLZLV5XHQWFPL/action/storage_attestation","attest_author":"https://pith.science/pith/OWF6MBZJYPUUGFLZLV5XHQWFPL/action/author_attestation","sign_citation":"https://pith.science/pith/OWF6MBZJYPUUGFLZLV5XHQWFPL/action/citation_signature","submit_replication":"https://pith.science/pith/OWF6MBZJYPUUGFLZLV5XHQWFPL/action/replication_record"}},"created_at":"2026-05-18T01:16:28.898207+00:00","updated_at":"2026-05-18T01:16:28.898207+00:00"}