{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:IA5NX5542BIBZN5BDP4ZWH77E5","short_pith_number":"pith:IA5NX554","canonical_record":{"source":{"id":"2606.30282","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-29T13:24:02Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"a779ce9c722fc50299cf619627292493f5a84224c5531760a1bdc91328a0cc2a","abstract_canon_sha256":"14eba87994c176294e0a76b5f5eeb6c156fb4b661c154970a78bb7bb69d52e36"},"schema_version":"1.0"},"canonical_sha256":"403adbf7bcd0501cb7a11bf99b1fff275f1f1c6bcba15e97d32fe133d74c98fd","source":{"kind":"arxiv","id":"2606.30282","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.30282","created_at":"2026-06-30T02:17:57Z"},{"alias_kind":"arxiv_version","alias_value":"2606.30282v1","created_at":"2026-06-30T02:17:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.30282","created_at":"2026-06-30T02:17:57Z"},{"alias_kind":"pith_short_12","alias_value":"IA5NX5542BIB","created_at":"2026-06-30T02:17:57Z"},{"alias_kind":"pith_short_16","alias_value":"IA5NX5542BIBZN5B","created_at":"2026-06-30T02:17:57Z"},{"alias_kind":"pith_short_8","alias_value":"IA5NX554","created_at":"2026-06-30T02:17:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:IA5NX5542BIBZN5BDP4ZWH77E5","target":"record","payload":{"canonical_record":{"source":{"id":"2606.30282","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-29T13:24:02Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"a779ce9c722fc50299cf619627292493f5a84224c5531760a1bdc91328a0cc2a","abstract_canon_sha256":"14eba87994c176294e0a76b5f5eeb6c156fb4b661c154970a78bb7bb69d52e36"},"schema_version":"1.0"},"canonical_sha256":"403adbf7bcd0501cb7a11bf99b1fff275f1f1c6bcba15e97d32fe133d74c98fd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T02:17:57.359038Z","signature_b64":"0JX7FZfEMwvex8N1lBUBHw64vyUpnua/U6+wVevNLwte9Q0rQyjCEJ1wC3kKX74RpPEmuf0Yr0bb3SZHFSXTDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"403adbf7bcd0501cb7a11bf99b1fff275f1f1c6bcba15e97d32fe133d74c98fd","last_reissued_at":"2026-06-30T02:17:57.358285Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T02:17:57.358285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.30282","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-30T02:17:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ag+opCWJggpQQDynLCcmsFO+kLDtJDbBnfH8onrEQnmla0PhtrYqN2qfT6I6nezGvF+pxKwYjIUzWg9F6pWzBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T16:54:18.985829Z"},"content_sha256":"0a6a741de3f23c00d5c8dbf50274a5d9a47ab425b69e0ae5079c17c605c3ac84","schema_version":"1.0","event_id":"sha256:0a6a741de3f23c00d5c8dbf50274a5d9a47ab425b69e0ae5079c17c605c3ac84"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:IA5NX5542BIBZN5BDP4ZWH77E5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"List $3$-coloring $C_4$-free graphs of diameter-$2$ in polynomial-time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Yukihiro Murakami","submitted_at":"2026-06-29T13:24:02Z","abstract_excerpt":"We show that list $3$-coloring a~$C_4$-free graph of diameter-$2$ can be done in polynomial-time. Our algorithm is based on a structural characterization showing that many such graphs are not~$3$-colorable. In particular, we show that~$C_4$-free graphs of diameter-$2$ without universal vertices, where the maximum degree is at least~$17$, are not~$3$-colorable."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.30282","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.30282/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-30T02:17:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qa4x1L9k4TNipC+j+L+Awjz5Mhnd548JMA4S3iXoYIRK6zhN2QAOr1kel/er5I160QhWG+izJ/pvNvIvBVtFDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T16:54:18.986652Z"},"content_sha256":"073abc4f6e35b1047bb16eb615474ce09cf35e9d85928d02fef77557716667b3","schema_version":"1.0","event_id":"sha256:073abc4f6e35b1047bb16eb615474ce09cf35e9d85928d02fef77557716667b3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IA5NX5542BIBZN5BDP4ZWH77E5/bundle.json","state_url":"https://pith.science/pith/IA5NX5542BIBZN5BDP4ZWH77E5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IA5NX5542BIBZN5BDP4ZWH77E5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-03T16:54:18Z","links":{"resolver":"https://pith.science/pith/IA5NX5542BIBZN5BDP4ZWH77E5","bundle":"https://pith.science/pith/IA5NX5542BIBZN5BDP4ZWH77E5/bundle.json","state":"https://pith.science/pith/IA5NX5542BIBZN5BDP4ZWH77E5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IA5NX5542BIBZN5BDP4ZWH77E5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:IA5NX5542BIBZN5BDP4ZWH77E5","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":"14eba87994c176294e0a76b5f5eeb6c156fb4b661c154970a78bb7bb69d52e36","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-29T13:24:02Z","title_canon_sha256":"a779ce9c722fc50299cf619627292493f5a84224c5531760a1bdc91328a0cc2a"},"schema_version":"1.0","source":{"id":"2606.30282","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.30282","created_at":"2026-06-30T02:17:57Z"},{"alias_kind":"arxiv_version","alias_value":"2606.30282v1","created_at":"2026-06-30T02:17:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.30282","created_at":"2026-06-30T02:17:57Z"},{"alias_kind":"pith_short_12","alias_value":"IA5NX5542BIB","created_at":"2026-06-30T02:17:57Z"},{"alias_kind":"pith_short_16","alias_value":"IA5NX5542BIBZN5B","created_at":"2026-06-30T02:17:57Z"},{"alias_kind":"pith_short_8","alias_value":"IA5NX554","created_at":"2026-06-30T02:17:57Z"}],"graph_snapshots":[{"event_id":"sha256:073abc4f6e35b1047bb16eb615474ce09cf35e9d85928d02fef77557716667b3","target":"graph","created_at":"2026-06-30T02:17:57Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.30282/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We show that list $3$-coloring a~$C_4$-free graph of diameter-$2$ can be done in polynomial-time. Our algorithm is based on a structural characterization showing that many such graphs are not~$3$-colorable. In particular, we show that~$C_4$-free graphs of diameter-$2$ without universal vertices, where the maximum degree is at least~$17$, are not~$3$-colorable.","authors_text":"Yukihiro Murakami","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-29T13:24:02Z","title":"List $3$-coloring $C_4$-free graphs of diameter-$2$ in polynomial-time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.30282","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0a6a741de3f23c00d5c8dbf50274a5d9a47ab425b69e0ae5079c17c605c3ac84","target":"record","created_at":"2026-06-30T02:17:57Z","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":"14eba87994c176294e0a76b5f5eeb6c156fb4b661c154970a78bb7bb69d52e36","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-29T13:24:02Z","title_canon_sha256":"a779ce9c722fc50299cf619627292493f5a84224c5531760a1bdc91328a0cc2a"},"schema_version":"1.0","source":{"id":"2606.30282","kind":"arxiv","version":1}},"canonical_sha256":"403adbf7bcd0501cb7a11bf99b1fff275f1f1c6bcba15e97d32fe133d74c98fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"403adbf7bcd0501cb7a11bf99b1fff275f1f1c6bcba15e97d32fe133d74c98fd","first_computed_at":"2026-06-30T02:17:57.358285Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-30T02:17:57.358285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0JX7FZfEMwvex8N1lBUBHw64vyUpnua/U6+wVevNLwte9Q0rQyjCEJ1wC3kKX74RpPEmuf0Yr0bb3SZHFSXTDA==","signature_status":"signed_v1","signed_at":"2026-06-30T02:17:57.359038Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.30282","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0a6a741de3f23c00d5c8dbf50274a5d9a47ab425b69e0ae5079c17c605c3ac84","sha256:073abc4f6e35b1047bb16eb615474ce09cf35e9d85928d02fef77557716667b3"],"state_sha256":"43146d6930b950465c181693fb61cfe56c5a708005cbaee79fcd3c7af871b692"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3KJ1sX/y0Gj+INRn7S4noWYH/10EunNYxwB9GsbuhdYdImF4/juzA8jhqsjgVJEBd57Emn8FYytrj1gxWrBEBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T16:54:18.990771Z","bundle_sha256":"ce94fd7c1e6c8fac01706820d2bb539364b41cfe6d329abd6a87452eb2bbcf2c"}}