{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:NN5AFNLLJOXKL2MDGOS3LNP3OC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c55564043e3162a46ac220889dcddcc4005dd4be2ceef6b55be568bcfeb2366a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2025-11-19T12:49:07Z","title_canon_sha256":"33a7510feabb3d4fb6f993f05dca7ad39e35f2188c4d5f18ad7e06e822e198f1"},"schema_version":"1.0","source":{"id":"2602.16996","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.16996","created_at":"2026-05-20T00:04:26Z"},{"alias_kind":"arxiv_version","alias_value":"2602.16996v6","created_at":"2026-05-20T00:04:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.16996","created_at":"2026-05-20T00:04:26Z"},{"alias_kind":"pith_short_12","alias_value":"NN5AFNLLJOXK","created_at":"2026-05-20T00:04:26Z"},{"alias_kind":"pith_short_16","alias_value":"NN5AFNLLJOXKL2MD","created_at":"2026-05-20T00:04:26Z"},{"alias_kind":"pith_short_8","alias_value":"NN5AFNLL","created_at":"2026-05-20T00:04:26Z"}],"graph_snapshots":[{"event_id":"sha256:3b254c103e056e3c16e04c6453f53ccd1f9d6b9305c93aa781def94051b755a5","target":"graph","created_at":"2026-05-20T00:04:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"After sequentially adding specific regions on an outer boundary satisfying Property A, the new outer boundary still satisfies Property A, ultimately allowing the entire given graph to be colored with four colors."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the newly introduced concepts such as primitive set, knot, valid pair group, and the three theorems correctly cover every possible planar graph configuration without gaps or unhandled cases."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A constructive framework using new graph concepts and three theorems claims to prove any planar graph is four-colorable without computer checks."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Any planar graph can be four-colored by sequentially adding regions while preserving Property A on the outer boundary."}],"snapshot_sha256":"2410ddc0c0eeac03442029659cfd80e8f730d2c33761b140c3a1b4500f273731"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"6a56d2491907cb058abc530d6ff2d8b7d8c5ef5eb79b578be43751ab53a65171"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2602.16996/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper presents a path to proving the Four-Color Theorem that differs from the traditional \"reducible configuration\" method. By introducing concepts such as \"outer boundary,\" \"primitive set,\" \"Property A,\" \"knot,\" \"valid pair group,\" and the operation of \"adding an n-point region on an interval,\" we construct a framework for gradually coloring any given planar graph. The core of this framework consists of three theorems, which ensure that after sequentially adding specific regions on an outer boundary satisfying Property A, the new outer boundary still satisfies Property A, ultimately allo","authors_text":"Dagong Ding","cross_cats":[],"headline":"Any planar graph can be four-colored by sequentially adding regions while preserving Property A on the outer boundary.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2025-11-19T12:49:07Z","title":"A Constructive Proof of the Four-Color Theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.16996","kind":"arxiv","version":6},"verdict":{"created_at":"2026-05-17T21:08:43.766014Z","id":"6ae0f86d-4dee-43e5-a24a-ecf45f0a0dee","model_set":{"reader":"grok-4.3"},"one_line_summary":"A constructive framework using new graph concepts and three theorems claims to prove any planar graph is four-colorable without computer checks.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Any planar graph can be four-colored by sequentially adding regions while preserving Property A on the outer boundary.","strongest_claim":"After sequentially adding specific regions on an outer boundary satisfying Property A, the new outer boundary still satisfies Property A, ultimately allowing the entire given graph to be colored with four colors.","weakest_assumption":"That the newly introduced concepts such as primitive set, knot, valid pair group, and the three theorems correctly cover every possible planar graph configuration without gaps or unhandled cases."}},"verdict_id":"6ae0f86d-4dee-43e5-a24a-ecf45f0a0dee"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3653a5146e8c1ad89d12b819a53193b06804faa3599cdc26dfcc9eb9a9f2285d","target":"record","created_at":"2026-05-20T00:04:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c55564043e3162a46ac220889dcddcc4005dd4be2ceef6b55be568bcfeb2366a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2025-11-19T12:49:07Z","title_canon_sha256":"33a7510feabb3d4fb6f993f05dca7ad39e35f2188c4d5f18ad7e06e822e198f1"},"schema_version":"1.0","source":{"id":"2602.16996","kind":"arxiv","version":6}},"canonical_sha256":"6b7a02b56b4baea5e98333a5b5b5fb70aedc372b01cb9d3a20d46a0cb27b5a89","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b7a02b56b4baea5e98333a5b5b5fb70aedc372b01cb9d3a20d46a0cb27b5a89","first_computed_at":"2026-05-20T00:04:26.064115Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:04:26.064115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IjOf0fxbbRE48H/U2SQyYZtbCUSyjHGZ1cl79vFjtcLa779uvpgyc7EzzjVGCa6mUsPB4RSf3MQCYrBv4S4xBA==","signature_status":"signed_v1","signed_at":"2026-05-20T00:04:26.064904Z","signed_message":"canonical_sha256_bytes"},"source_id":"2602.16996","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3653a5146e8c1ad89d12b819a53193b06804faa3599cdc26dfcc9eb9a9f2285d","sha256:3b254c103e056e3c16e04c6453f53ccd1f9d6b9305c93aa781def94051b755a5"],"state_sha256":"5c32799ea1bb77c38258ce894068dbd6a9e50f58ee97fe6b59923aa0f40cfa1d"}