{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SUTJLLJZDXTHTRKNUYSL26ACN5","short_pith_number":"pith:SUTJLLJZ","schema_version":"1.0","canonical_sha256":"952695ad391de679c54da624bd78026f45d0c0b608659462f89b57c9033ce1d3","source":{"kind":"arxiv","id":"1505.03962","version":3},"attestation_state":"computed","paper":{"title":"Deciding 4-colorability of planar triangulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Martin Loebl","submitted_at":"2015-05-15T05:35:37Z","abstract_excerpt":"We show, without using the Four Color Theorem, that for each planar triangulation, the number of its proper vertex colorings by 4 colors is a determinant and thus can be calculated in a polynomial time. In particular, we can efficiently decide if the number is non-zero."},"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":"1505.03962","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-15T05:35:37Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"2d9918c40b1c555b187504d8bfd6495640cb69b83a3a5420613e7b8be62b80c1","abstract_canon_sha256":"063a23bf3ffca4770807e01386d346691bdb71926d0d016cffe6db0c73cd6e19"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:25.477687Z","signature_b64":"4//mKJFvFRIru/eX13TnMPipdu56Ck4RoGCZDOB4hQslQfftX3Y+/mRbkDaVjsmDgxw8YB7xIPJD5PkIBLmFBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"952695ad391de679c54da624bd78026f45d0c0b608659462f89b57c9033ce1d3","last_reissued_at":"2026-05-18T01:18:25.477186Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:25.477186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deciding 4-colorability of planar triangulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Martin Loebl","submitted_at":"2015-05-15T05:35:37Z","abstract_excerpt":"We show, without using the Four Color Theorem, that for each planar triangulation, the number of its proper vertex colorings by 4 colors is a determinant and thus can be calculated in a polynomial time. In particular, we can efficiently decide if the number is non-zero."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.03962","kind":"arxiv","version":3},"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":"1505.03962","created_at":"2026-05-18T01:18:25.477258+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.03962v3","created_at":"2026-05-18T01:18:25.477258+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.03962","created_at":"2026-05-18T01:18:25.477258+00:00"},{"alias_kind":"pith_short_12","alias_value":"SUTJLLJZDXTH","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"SUTJLLJZDXTHTRKN","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"SUTJLLJZ","created_at":"2026-05-18T12:29:42.218222+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/SUTJLLJZDXTHTRKNUYSL26ACN5","json":"https://pith.science/pith/SUTJLLJZDXTHTRKNUYSL26ACN5.json","graph_json":"https://pith.science/api/pith-number/SUTJLLJZDXTHTRKNUYSL26ACN5/graph.json","events_json":"https://pith.science/api/pith-number/SUTJLLJZDXTHTRKNUYSL26ACN5/events.json","paper":"https://pith.science/paper/SUTJLLJZ"},"agent_actions":{"view_html":"https://pith.science/pith/SUTJLLJZDXTHTRKNUYSL26ACN5","download_json":"https://pith.science/pith/SUTJLLJZDXTHTRKNUYSL26ACN5.json","view_paper":"https://pith.science/paper/SUTJLLJZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.03962&json=true","fetch_graph":"https://pith.science/api/pith-number/SUTJLLJZDXTHTRKNUYSL26ACN5/graph.json","fetch_events":"https://pith.science/api/pith-number/SUTJLLJZDXTHTRKNUYSL26ACN5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SUTJLLJZDXTHTRKNUYSL26ACN5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SUTJLLJZDXTHTRKNUYSL26ACN5/action/storage_attestation","attest_author":"https://pith.science/pith/SUTJLLJZDXTHTRKNUYSL26ACN5/action/author_attestation","sign_citation":"https://pith.science/pith/SUTJLLJZDXTHTRKNUYSL26ACN5/action/citation_signature","submit_replication":"https://pith.science/pith/SUTJLLJZDXTHTRKNUYSL26ACN5/action/replication_record"}},"created_at":"2026-05-18T01:18:25.477258+00:00","updated_at":"2026-05-18T01:18:25.477258+00:00"}