{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:BCHJJGYY3IRG24TXBJPA5P2PGA","short_pith_number":"pith:BCHJJGYY","canonical_record":{"source":{"id":"1308.3037","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-14T05:42:57Z","cross_cats_sorted":[],"title_canon_sha256":"928ee1d5549b30444412e4334abe2395e89126fbee4586047c69f737f651f158","abstract_canon_sha256":"beabb79aa0a27bc9fa9cead11f39c3a1e9ff4040692140d866c43227233f23a1"},"schema_version":"1.0"},"canonical_sha256":"088e949b18da226d72770a5e0ebf4f300f3d6025d7222950c75eeefef1b1d2a4","source":{"kind":"arxiv","id":"1308.3037","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.3037","created_at":"2026-05-18T03:15:56Z"},{"alias_kind":"arxiv_version","alias_value":"1308.3037v1","created_at":"2026-05-18T03:15:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3037","created_at":"2026-05-18T03:15:56Z"},{"alias_kind":"pith_short_12","alias_value":"BCHJJGYY3IRG","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"BCHJJGYY3IRG24TX","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"BCHJJGYY","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:BCHJJGYY3IRG24TXBJPA5P2PGA","target":"record","payload":{"canonical_record":{"source":{"id":"1308.3037","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-14T05:42:57Z","cross_cats_sorted":[],"title_canon_sha256":"928ee1d5549b30444412e4334abe2395e89126fbee4586047c69f737f651f158","abstract_canon_sha256":"beabb79aa0a27bc9fa9cead11f39c3a1e9ff4040692140d866c43227233f23a1"},"schema_version":"1.0"},"canonical_sha256":"088e949b18da226d72770a5e0ebf4f300f3d6025d7222950c75eeefef1b1d2a4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:56.804811Z","signature_b64":"t0zJeY0/zPoCnnZnQjTocqemsJ2Jz2xZ3JBwfwEghm4YYnPk6gG1QEx40bUHMc+0bcrMM2oOE4cokFMuLOz+CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"088e949b18da226d72770a5e0ebf4f300f3d6025d7222950c75eeefef1b1d2a4","last_reissued_at":"2026-05-18T03:15:56.804248Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:56.804248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.3037","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-05-18T03:15:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0+umVao37/t3dAdhzSsZPtMtbF1rHwJT34Fq0cjinGBACw+1BS7lX9TRcnjUlZ10mk2MmDUip6O13jdC37HjDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:26:25.279389Z"},"content_sha256":"5de455e8519a531442d02cad14b1e27d5e471faa14664095ad8e1fa0aca17511","schema_version":"1.0","event_id":"sha256:5de455e8519a531442d02cad14b1e27d5e471faa14664095ad8e1fa0aca17511"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:BCHJJGYY3IRG24TXBJPA5P2PGA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Precoloring extension involving pairs of vertices of small distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Akira Saito, Chihoko Ojima, Kazuki Sano","submitted_at":"2013-08-14T05:42:57Z","abstract_excerpt":"In this paper, we consider coloring of graphs under the assumption that some vertices are already colored. Let $G$ be an $r$-colorable graph and let $P\\subset V(G)$. Albertson [J.\\ Combin.\\ Theory Ser. B \\textbf{73} (1998), 189--194] has proved that if every pair of vertices in $P$ have distance at least four, then every $(r+1)$-coloring of $G[P]$ can be extended to an $(r+1)$-coloring of $G$, where $G[P]$ is the subgraph of $G$ induced by $P$. In this paper, we allow $P$ to have pairs of vertices of distance at most three, and investigate how the number of such pairs affects the number of col"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3037","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"},"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-05-18T03:15:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VDPADrNmxNrkG9Sqdyf7sMl7G+cud5rtb+lzrLD+ug/0KY9yZkt2arQa1BgOGfdWlmA9UYQ75vuPD8UTfgO4CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:26:25.279744Z"},"content_sha256":"040b046c2df7717d82e55aee60af73e4f649a68c5fca4f4b498f54f3fc9c30fe","schema_version":"1.0","event_id":"sha256:040b046c2df7717d82e55aee60af73e4f649a68c5fca4f4b498f54f3fc9c30fe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BCHJJGYY3IRG24TXBJPA5P2PGA/bundle.json","state_url":"https://pith.science/pith/BCHJJGYY3IRG24TXBJPA5P2PGA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BCHJJGYY3IRG24TXBJPA5P2PGA/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-05-30T08:26:25Z","links":{"resolver":"https://pith.science/pith/BCHJJGYY3IRG24TXBJPA5P2PGA","bundle":"https://pith.science/pith/BCHJJGYY3IRG24TXBJPA5P2PGA/bundle.json","state":"https://pith.science/pith/BCHJJGYY3IRG24TXBJPA5P2PGA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BCHJJGYY3IRG24TXBJPA5P2PGA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:BCHJJGYY3IRG24TXBJPA5P2PGA","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":"beabb79aa0a27bc9fa9cead11f39c3a1e9ff4040692140d866c43227233f23a1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-14T05:42:57Z","title_canon_sha256":"928ee1d5549b30444412e4334abe2395e89126fbee4586047c69f737f651f158"},"schema_version":"1.0","source":{"id":"1308.3037","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.3037","created_at":"2026-05-18T03:15:56Z"},{"alias_kind":"arxiv_version","alias_value":"1308.3037v1","created_at":"2026-05-18T03:15:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3037","created_at":"2026-05-18T03:15:56Z"},{"alias_kind":"pith_short_12","alias_value":"BCHJJGYY3IRG","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"BCHJJGYY3IRG24TX","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"BCHJJGYY","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:040b046c2df7717d82e55aee60af73e4f649a68c5fca4f4b498f54f3fc9c30fe","target":"graph","created_at":"2026-05-18T03:15:56Z","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"},"paper":{"abstract_excerpt":"In this paper, we consider coloring of graphs under the assumption that some vertices are already colored. Let $G$ be an $r$-colorable graph and let $P\\subset V(G)$. Albertson [J.\\ Combin.\\ Theory Ser. B \\textbf{73} (1998), 189--194] has proved that if every pair of vertices in $P$ have distance at least four, then every $(r+1)$-coloring of $G[P]$ can be extended to an $(r+1)$-coloring of $G$, where $G[P]$ is the subgraph of $G$ induced by $P$. In this paper, we allow $P$ to have pairs of vertices of distance at most three, and investigate how the number of such pairs affects the number of col","authors_text":"Akira Saito, Chihoko Ojima, Kazuki Sano","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-14T05:42:57Z","title":"Precoloring extension involving pairs of vertices of small distance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3037","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:5de455e8519a531442d02cad14b1e27d5e471faa14664095ad8e1fa0aca17511","target":"record","created_at":"2026-05-18T03:15:56Z","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":"beabb79aa0a27bc9fa9cead11f39c3a1e9ff4040692140d866c43227233f23a1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-14T05:42:57Z","title_canon_sha256":"928ee1d5549b30444412e4334abe2395e89126fbee4586047c69f737f651f158"},"schema_version":"1.0","source":{"id":"1308.3037","kind":"arxiv","version":1}},"canonical_sha256":"088e949b18da226d72770a5e0ebf4f300f3d6025d7222950c75eeefef1b1d2a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"088e949b18da226d72770a5e0ebf4f300f3d6025d7222950c75eeefef1b1d2a4","first_computed_at":"2026-05-18T03:15:56.804248Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:56.804248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t0zJeY0/zPoCnnZnQjTocqemsJ2Jz2xZ3JBwfwEghm4YYnPk6gG1QEx40bUHMc+0bcrMM2oOE4cokFMuLOz+CA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:56.804811Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.3037","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5de455e8519a531442d02cad14b1e27d5e471faa14664095ad8e1fa0aca17511","sha256:040b046c2df7717d82e55aee60af73e4f649a68c5fca4f4b498f54f3fc9c30fe"],"state_sha256":"7e99cbca11deb946cb0f533cb36aa2b377ef5d4bb9fbe5bea05da3d9e54a7443"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6S4dhrPMmyvkC35fbqm+brlPoF+G7aGdn55XOcCx926CI8UOqAO4g7LOBBumkkTGuGVWzwFkLKQxmONtOMWMBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:26:25.281908Z","bundle_sha256":"c3201fd5870d81a36105b82ae5791a8c56adc4ffe580f1de2569544ac0ec4e87"}}