{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:BCHJJGYY3IRG24TXBJPA5P2PGA","short_pith_number":"pith:BCHJJGYY","schema_version":"1.0","canonical_sha256":"088e949b18da226d72770a5e0ebf4f300f3d6025d7222950c75eeefef1b1d2a4","source":{"kind":"arxiv","id":"1308.3037","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1308.3037","created_at":"2026-05-18T03:15:56.804350+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.3037v1","created_at":"2026-05-18T03:15:56.804350+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3037","created_at":"2026-05-18T03:15:56.804350+00:00"},{"alias_kind":"pith_short_12","alias_value":"BCHJJGYY3IRG","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"BCHJJGYY3IRG24TX","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"BCHJJGYY","created_at":"2026-05-18T12:27:38.830355+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/BCHJJGYY3IRG24TXBJPA5P2PGA","json":"https://pith.science/pith/BCHJJGYY3IRG24TXBJPA5P2PGA.json","graph_json":"https://pith.science/api/pith-number/BCHJJGYY3IRG24TXBJPA5P2PGA/graph.json","events_json":"https://pith.science/api/pith-number/BCHJJGYY3IRG24TXBJPA5P2PGA/events.json","paper":"https://pith.science/paper/BCHJJGYY"},"agent_actions":{"view_html":"https://pith.science/pith/BCHJJGYY3IRG24TXBJPA5P2PGA","download_json":"https://pith.science/pith/BCHJJGYY3IRG24TXBJPA5P2PGA.json","view_paper":"https://pith.science/paper/BCHJJGYY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.3037&json=true","fetch_graph":"https://pith.science/api/pith-number/BCHJJGYY3IRG24TXBJPA5P2PGA/graph.json","fetch_events":"https://pith.science/api/pith-number/BCHJJGYY3IRG24TXBJPA5P2PGA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BCHJJGYY3IRG24TXBJPA5P2PGA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BCHJJGYY3IRG24TXBJPA5P2PGA/action/storage_attestation","attest_author":"https://pith.science/pith/BCHJJGYY3IRG24TXBJPA5P2PGA/action/author_attestation","sign_citation":"https://pith.science/pith/BCHJJGYY3IRG24TXBJPA5P2PGA/action/citation_signature","submit_replication":"https://pith.science/pith/BCHJJGYY3IRG24TXBJPA5P2PGA/action/replication_record"}},"created_at":"2026-05-18T03:15:56.804350+00:00","updated_at":"2026-05-18T03:15:56.804350+00:00"}