{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5KYFJLK6HJPS6OUO2J4E6KEPMP","short_pith_number":"pith:5KYFJLK6","canonical_record":{"source":{"id":"1709.04027","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-12T19:10:13Z","cross_cats_sorted":[],"title_canon_sha256":"45bafddef4c95973ba772d568473ae14fa0aad65240a54c0d53db3044cf6a49b","abstract_canon_sha256":"a77d081b1896eaa71920125cf25c23634e789bd3610406946e3d9f1113e54ac0"},"schema_version":"1.0"},"canonical_sha256":"eab054ad5e3a5f2f3a8ed2784f288f63cfee79efd15f7d2f1ec68d9b13f15ea3","source":{"kind":"arxiv","id":"1709.04027","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.04027","created_at":"2026-05-18T00:11:11Z"},{"alias_kind":"arxiv_version","alias_value":"1709.04027v3","created_at":"2026-05-18T00:11:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.04027","created_at":"2026-05-18T00:11:11Z"},{"alias_kind":"pith_short_12","alias_value":"5KYFJLK6HJPS","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5KYFJLK6HJPS6OUO","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5KYFJLK6","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5KYFJLK6HJPS6OUO2J4E6KEPMP","target":"record","payload":{"canonical_record":{"source":{"id":"1709.04027","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-12T19:10:13Z","cross_cats_sorted":[],"title_canon_sha256":"45bafddef4c95973ba772d568473ae14fa0aad65240a54c0d53db3044cf6a49b","abstract_canon_sha256":"a77d081b1896eaa71920125cf25c23634e789bd3610406946e3d9f1113e54ac0"},"schema_version":"1.0"},"canonical_sha256":"eab054ad5e3a5f2f3a8ed2784f288f63cfee79efd15f7d2f1ec68d9b13f15ea3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:11.534617Z","signature_b64":"OguPrr8GCXxAK+nEaG6LzYIAzyXMhow/XWCr7D0uGpCzuF52xlJ1b3nxCFCLX/fiQFJrbZfvPm3nn7XyUyC/Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eab054ad5e3a5f2f3a8ed2784f288f63cfee79efd15f7d2f1ec68d9b13f15ea3","last_reissued_at":"2026-05-18T00:11:11.533918Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:11.533918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.04027","source_version":3,"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-18T00:11:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gHlcblA6RwUre2EqzvPeAcUWN1anvVDodNvu2zVTn/4FZKiwN/Sk6bYVurvFwWnGcQxOvLrOlVNt/U5RKaCZDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:53:45.410971Z"},"content_sha256":"106bcc96bfef5082d5ce4731e34e904130b6af1d83e5ed0b13e364c34111c3de","schema_version":"1.0","event_id":"sha256:106bcc96bfef5082d5ce4731e34e904130b6af1d83e5ed0b13e364c34111c3de"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5KYFJLK6HJPS6OUO2J4E6KEPMP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"List-edge-colouring planar graphs with precoloured edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gregory J. Puleo, Jessica McDonald, Joshua Harrelson","submitted_at":"2017-09-12T19:10:13Z","abstract_excerpt":"Let $G$ be a simple planar graph of maximum degree $\\Delta$, let $t$ be a positive integer, and let $L$ be an edge list assignment on $G$ with $|L(e)| \\geq \\Delta+t$ for all $e \\in E(G)$. We prove that if $H$ is a subgraph of $G$ that has been $L$-edge-coloured, then the edge-precolouring can be extended to an $L$-edge-colouring of $G$, provided that $H$ has maximum degree $d\\leq t$ and either $d \\leq t-4$ or $\\Delta$ is large enough ($\\Delta \\geq 16+d$ suffices). If $d>t$, there are examples for any choice of $\\Delta$ where the extension is impossible."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.04027","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"},"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-18T00:11:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DNCvV6il/eWuS49JaXtWWEXlPnwMPbVBEG561HcE0SX+AXO9dACq/OlUpFPB/FLxaejY6uNN/a6kNwUzc4IsCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:53:45.411699Z"},"content_sha256":"45bdceedf185551e64ee20a0b3ba9a1878f0634c16963131020f4e4525ab42ac","schema_version":"1.0","event_id":"sha256:45bdceedf185551e64ee20a0b3ba9a1878f0634c16963131020f4e4525ab42ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5KYFJLK6HJPS6OUO2J4E6KEPMP/bundle.json","state_url":"https://pith.science/pith/5KYFJLK6HJPS6OUO2J4E6KEPMP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5KYFJLK6HJPS6OUO2J4E6KEPMP/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-06-08T20:53:45Z","links":{"resolver":"https://pith.science/pith/5KYFJLK6HJPS6OUO2J4E6KEPMP","bundle":"https://pith.science/pith/5KYFJLK6HJPS6OUO2J4E6KEPMP/bundle.json","state":"https://pith.science/pith/5KYFJLK6HJPS6OUO2J4E6KEPMP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5KYFJLK6HJPS6OUO2J4E6KEPMP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5KYFJLK6HJPS6OUO2J4E6KEPMP","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":"a77d081b1896eaa71920125cf25c23634e789bd3610406946e3d9f1113e54ac0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-12T19:10:13Z","title_canon_sha256":"45bafddef4c95973ba772d568473ae14fa0aad65240a54c0d53db3044cf6a49b"},"schema_version":"1.0","source":{"id":"1709.04027","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.04027","created_at":"2026-05-18T00:11:11Z"},{"alias_kind":"arxiv_version","alias_value":"1709.04027v3","created_at":"2026-05-18T00:11:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.04027","created_at":"2026-05-18T00:11:11Z"},{"alias_kind":"pith_short_12","alias_value":"5KYFJLK6HJPS","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5KYFJLK6HJPS6OUO","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5KYFJLK6","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:45bdceedf185551e64ee20a0b3ba9a1878f0634c16963131020f4e4525ab42ac","target":"graph","created_at":"2026-05-18T00:11:11Z","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":"Let $G$ be a simple planar graph of maximum degree $\\Delta$, let $t$ be a positive integer, and let $L$ be an edge list assignment on $G$ with $|L(e)| \\geq \\Delta+t$ for all $e \\in E(G)$. We prove that if $H$ is a subgraph of $G$ that has been $L$-edge-coloured, then the edge-precolouring can be extended to an $L$-edge-colouring of $G$, provided that $H$ has maximum degree $d\\leq t$ and either $d \\leq t-4$ or $\\Delta$ is large enough ($\\Delta \\geq 16+d$ suffices). If $d>t$, there are examples for any choice of $\\Delta$ where the extension is impossible.","authors_text":"Gregory J. Puleo, Jessica McDonald, Joshua Harrelson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-12T19:10:13Z","title":"List-edge-colouring planar graphs with precoloured edges"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.04027","kind":"arxiv","version":3},"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:106bcc96bfef5082d5ce4731e34e904130b6af1d83e5ed0b13e364c34111c3de","target":"record","created_at":"2026-05-18T00:11:11Z","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":"a77d081b1896eaa71920125cf25c23634e789bd3610406946e3d9f1113e54ac0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-12T19:10:13Z","title_canon_sha256":"45bafddef4c95973ba772d568473ae14fa0aad65240a54c0d53db3044cf6a49b"},"schema_version":"1.0","source":{"id":"1709.04027","kind":"arxiv","version":3}},"canonical_sha256":"eab054ad5e3a5f2f3a8ed2784f288f63cfee79efd15f7d2f1ec68d9b13f15ea3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eab054ad5e3a5f2f3a8ed2784f288f63cfee79efd15f7d2f1ec68d9b13f15ea3","first_computed_at":"2026-05-18T00:11:11.533918Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:11.533918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OguPrr8GCXxAK+nEaG6LzYIAzyXMhow/XWCr7D0uGpCzuF52xlJ1b3nxCFCLX/fiQFJrbZfvPm3nn7XyUyC/Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:11.534617Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.04027","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:106bcc96bfef5082d5ce4731e34e904130b6af1d83e5ed0b13e364c34111c3de","sha256:45bdceedf185551e64ee20a0b3ba9a1878f0634c16963131020f4e4525ab42ac"],"state_sha256":"331ac0eb4c1c4c271fcfac41833e8ac8f6ae5c247a72ba2aa2563de9ae6dcb2b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/niqQNG91hrY88LMeNOpVkxjywAgDF2FR5EANP7U/79VYEV+rGb1nmc4q6ImwO0yR74ia1aE5Q9DW2Rd76dkDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T20:53:45.415902Z","bundle_sha256":"aaead2e8f2a22a173fa1c587920e8a6188126372c98cbe88f1dce63971b90472"}}