{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:COXBHLOA3XZZGIMFT3NGIY65QW","short_pith_number":"pith:COXBHLOA","schema_version":"1.0","canonical_sha256":"13ae13adc0ddf39321859eda6463dd85bdc2cae30094e123a3c7536836a707a0","source":{"kind":"arxiv","id":"1407.4339","version":3},"attestation_state":"computed","paper":{"title":"Extension from Precoloured Sets of Edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ant\\'onio Gir\\~ao, Gregory J. Puleo, Jan van den Heuvel, Jean-S\\'ebastien Sereni, Katherine Edwards, Ross J. Kang","submitted_at":"2014-07-16T15:18:15Z","abstract_excerpt":"We consider precolouring extension problems for proper edge-colourings of graphs and multigraphs, in an attempt to prove stronger versions of Vizing's and Shannon's bounds on the chromatic index of (multi)graphs in terms of their maximum degree $\\Delta$. We are especially interested in the following question: when is it possible to extend a precoloured matching to a colouring of all edges of a (multi)graph? This question turns out to be related to the notorious List Colouring Conjecture and other classic notions of choosability."},"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":"1407.4339","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-16T15:18:15Z","cross_cats_sorted":[],"title_canon_sha256":"2aba39f245b0da73c1c0b89aa2c846586e5f10128d0084692d87247edd3118fc","abstract_canon_sha256":"71780b3ab98f2bc0cde38b28db73f18131781a7cf0f9b8ae3ef394b53f594602"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:57.643712Z","signature_b64":"twOxmGaSDlLR77bOPqRBsWfvTyWyQxtRillNKY+zIBb13lWGruUztv2gXswUUUWzLjM4s/65XVEX3TiB5fW1Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13ae13adc0ddf39321859eda6463dd85bdc2cae30094e123a3c7536836a707a0","last_reissued_at":"2026-05-18T00:14:57.643042Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:57.643042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extension from Precoloured Sets of Edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ant\\'onio Gir\\~ao, Gregory J. Puleo, Jan van den Heuvel, Jean-S\\'ebastien Sereni, Katherine Edwards, Ross J. Kang","submitted_at":"2014-07-16T15:18:15Z","abstract_excerpt":"We consider precolouring extension problems for proper edge-colourings of graphs and multigraphs, in an attempt to prove stronger versions of Vizing's and Shannon's bounds on the chromatic index of (multi)graphs in terms of their maximum degree $\\Delta$. We are especially interested in the following question: when is it possible to extend a precoloured matching to a colouring of all edges of a (multi)graph? This question turns out to be related to the notorious List Colouring Conjecture and other classic notions of choosability."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.4339","kind":"arxiv","version":3},"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":"1407.4339","created_at":"2026-05-18T00:14:57.643154+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.4339v3","created_at":"2026-05-18T00:14:57.643154+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4339","created_at":"2026-05-18T00:14:57.643154+00:00"},{"alias_kind":"pith_short_12","alias_value":"COXBHLOA3XZZ","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"COXBHLOA3XZZGIMF","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"COXBHLOA","created_at":"2026-05-18T12:28:22.404517+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/COXBHLOA3XZZGIMFT3NGIY65QW","json":"https://pith.science/pith/COXBHLOA3XZZGIMFT3NGIY65QW.json","graph_json":"https://pith.science/api/pith-number/COXBHLOA3XZZGIMFT3NGIY65QW/graph.json","events_json":"https://pith.science/api/pith-number/COXBHLOA3XZZGIMFT3NGIY65QW/events.json","paper":"https://pith.science/paper/COXBHLOA"},"agent_actions":{"view_html":"https://pith.science/pith/COXBHLOA3XZZGIMFT3NGIY65QW","download_json":"https://pith.science/pith/COXBHLOA3XZZGIMFT3NGIY65QW.json","view_paper":"https://pith.science/paper/COXBHLOA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.4339&json=true","fetch_graph":"https://pith.science/api/pith-number/COXBHLOA3XZZGIMFT3NGIY65QW/graph.json","fetch_events":"https://pith.science/api/pith-number/COXBHLOA3XZZGIMFT3NGIY65QW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/COXBHLOA3XZZGIMFT3NGIY65QW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/COXBHLOA3XZZGIMFT3NGIY65QW/action/storage_attestation","attest_author":"https://pith.science/pith/COXBHLOA3XZZGIMFT3NGIY65QW/action/author_attestation","sign_citation":"https://pith.science/pith/COXBHLOA3XZZGIMFT3NGIY65QW/action/citation_signature","submit_replication":"https://pith.science/pith/COXBHLOA3XZZGIMFT3NGIY65QW/action/replication_record"}},"created_at":"2026-05-18T00:14:57.643154+00:00","updated_at":"2026-05-18T00:14:57.643154+00:00"}