{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5HCSDNDSU54NMPORDEMFMDOELD","short_pith_number":"pith:5HCSDNDS","schema_version":"1.0","canonical_sha256":"e9c521b472a778d63dd11918560dc458fb2b11a800064504e5bfb590f1636dd4","source":{"kind":"arxiv","id":"1611.09002","version":2},"attestation_state":"computed","paper":{"title":"A precolouring extension of Vizing's theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ant\\'onio Gir\\~ao, Ross J. Kang","submitted_at":"2016-11-28T07:03:44Z","abstract_excerpt":"Fix a palette $\\mathcal K$ of $\\Delta+1$ colours, a graph with maximum degree $\\Delta$, and a subset $M$ of the edge set with minimum distance between edges at least $9$. If the edges of $M$ are arbitrarily precoloured from $\\mathcal K$, then there is guaranteed to be a proper edge-colouring using only colours from $\\mathcal K$ that extends the precolouring on $M$ to the entire graph. This result is a first general precolouring extension form of Vizing's theorem, and it proves a conjecture of Albertson and Moore under a slightly stronger distance requirement. We also show that the condition on"},"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":"1611.09002","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-28T07:03:44Z","cross_cats_sorted":[],"title_canon_sha256":"5447bc4e7514fee86ad917bda0d8587108dd05fd91f9ee07e51ed936491687ef","abstract_canon_sha256":"d0059418a6c54af987e2657b77fae2b4d6c00abac12d2de8e66375c56e81f21c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:21.867094Z","signature_b64":"a49hQ9NBTbsIOCJS/cGkmJUZguPxGTdG6xXxx+NjzEJEZ5QSLhY5LrpkLUM4bnWq2rnZRcU9zYpMj0AmQ3kZAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9c521b472a778d63dd11918560dc458fb2b11a800064504e5bfb590f1636dd4","last_reissued_at":"2026-05-17T23:57:21.866513Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:21.866513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A precolouring extension of Vizing's theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ant\\'onio Gir\\~ao, Ross J. Kang","submitted_at":"2016-11-28T07:03:44Z","abstract_excerpt":"Fix a palette $\\mathcal K$ of $\\Delta+1$ colours, a graph with maximum degree $\\Delta$, and a subset $M$ of the edge set with minimum distance between edges at least $9$. If the edges of $M$ are arbitrarily precoloured from $\\mathcal K$, then there is guaranteed to be a proper edge-colouring using only colours from $\\mathcal K$ that extends the precolouring on $M$ to the entire graph. This result is a first general precolouring extension form of Vizing's theorem, and it proves a conjecture of Albertson and Moore under a slightly stronger distance requirement. We also show that the condition on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09002","kind":"arxiv","version":2},"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":"1611.09002","created_at":"2026-05-17T23:57:21.866603+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.09002v2","created_at":"2026-05-17T23:57:21.866603+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09002","created_at":"2026-05-17T23:57:21.866603+00:00"},{"alias_kind":"pith_short_12","alias_value":"5HCSDNDSU54N","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"5HCSDNDSU54NMPOR","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"5HCSDNDS","created_at":"2026-05-18T12:30:01.593930+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/5HCSDNDSU54NMPORDEMFMDOELD","json":"https://pith.science/pith/5HCSDNDSU54NMPORDEMFMDOELD.json","graph_json":"https://pith.science/api/pith-number/5HCSDNDSU54NMPORDEMFMDOELD/graph.json","events_json":"https://pith.science/api/pith-number/5HCSDNDSU54NMPORDEMFMDOELD/events.json","paper":"https://pith.science/paper/5HCSDNDS"},"agent_actions":{"view_html":"https://pith.science/pith/5HCSDNDSU54NMPORDEMFMDOELD","download_json":"https://pith.science/pith/5HCSDNDSU54NMPORDEMFMDOELD.json","view_paper":"https://pith.science/paper/5HCSDNDS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.09002&json=true","fetch_graph":"https://pith.science/api/pith-number/5HCSDNDSU54NMPORDEMFMDOELD/graph.json","fetch_events":"https://pith.science/api/pith-number/5HCSDNDSU54NMPORDEMFMDOELD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5HCSDNDSU54NMPORDEMFMDOELD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5HCSDNDSU54NMPORDEMFMDOELD/action/storage_attestation","attest_author":"https://pith.science/pith/5HCSDNDSU54NMPORDEMFMDOELD/action/author_attestation","sign_citation":"https://pith.science/pith/5HCSDNDSU54NMPORDEMFMDOELD/action/citation_signature","submit_replication":"https://pith.science/pith/5HCSDNDSU54NMPORDEMFMDOELD/action/replication_record"}},"created_at":"2026-05-17T23:57:21.866603+00:00","updated_at":"2026-05-17T23:57:21.866603+00:00"}