{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NQEMRABHKZLVOOOGY7BOO5QAY3","short_pith_number":"pith:NQEMRABH","canonical_record":{"source":{"id":"1805.02156","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-06T06:19:40Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"dbef431df7c79319e3f23633cbc23303606c38ae0a065a8960887db1f1b99315","abstract_canon_sha256":"22743ddc7c9914857e19764cf01547f53e91d69cedff2197cc5eb010a90d7b14"},"schema_version":"1.0"},"canonical_sha256":"6c08c8802756575739c6c7c2e77600c6cd62f6079aa6b01d2d77669fcf13247f","source":{"kind":"arxiv","id":"1805.02156","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.02156","created_at":"2026-05-17T23:54:39Z"},{"alias_kind":"arxiv_version","alias_value":"1805.02156v2","created_at":"2026-05-17T23:54:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02156","created_at":"2026-05-17T23:54:39Z"},{"alias_kind":"pith_short_12","alias_value":"NQEMRABHKZLV","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NQEMRABHKZLVOOOG","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NQEMRABH","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NQEMRABHKZLVOOOGY7BOO5QAY3","target":"record","payload":{"canonical_record":{"source":{"id":"1805.02156","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-06T06:19:40Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"dbef431df7c79319e3f23633cbc23303606c38ae0a065a8960887db1f1b99315","abstract_canon_sha256":"22743ddc7c9914857e19764cf01547f53e91d69cedff2197cc5eb010a90d7b14"},"schema_version":"1.0"},"canonical_sha256":"6c08c8802756575739c6c7c2e77600c6cd62f6079aa6b01d2d77669fcf13247f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:39.605128Z","signature_b64":"+DreSFOmi9kMHR6cLnFnbN/zxUE+LxSmbABcXcsY4d16bJ2Z7JTX+oG74aIplHxZR2jSjZ8I8dW+rYDCodC8Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c08c8802756575739c6c7c2e77600c6cd62f6079aa6b01d2d77669fcf13247f","last_reissued_at":"2026-05-17T23:54:39.604499Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:39.604499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.02156","source_version":2,"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-17T23:54:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T8Fm5HyMpPF94iruKHCOlMQaaFkM/BOfEgb0zeEtXfv8h+sOIfuahn1K6Seislg9w4SdUyeLPeJgbjLRt+0lCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T20:06:55.056426Z"},"content_sha256":"0daa44f7d399d282dc8b20ed7c3e5b12282f6ad1435f7e99113c8391d1f95c12","schema_version":"1.0","event_id":"sha256:0daa44f7d399d282dc8b20ed7c3e5b12282f6ad1435f7e99113c8391d1f95c12"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NQEMRABHKZLVOOOGY7BOO5QAY3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tree-like distance colouring for planar graphs of sufficient girth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Ross J. Kang, Willem van Loon","submitted_at":"2018-05-06T06:19:40Z","abstract_excerpt":"Given a multigraph $G$ and a positive integer $t$, the distance-$t$ chromatic index of $G$ is the least number of colours needed for a colouring of the edges so that every pair of distinct edges connected by a path of fewer than $t$ edges must receive different colours. Let $\\pi'_t(d)$ and $\\tau'_t(d)$ be the largest values of this parameter over the class of planar multigraphs and of (simple) trees, respectively, of maximum degree $d$. We have that $\\pi'_t(d)$ is at most and at least a non-trivial constant multiple larger than $\\tau'_t(d)$. (We conjecture $\\limsup_{d\\to\\infty}\\pi'_2(d)/\\tau'_"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02156","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"},"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-17T23:54:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gHUKLphQRtANVdfUo7+UF381CGnglBDoynZB5x0HqofWXbUeSUdG6fafrj4kXPokfW7z/1FjcPwh1BG4XIPwCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T20:06:55.057061Z"},"content_sha256":"588fde3ad33c406d05382781bb38d9b169d48b24afc38d48f3b87fbb73c73afb","schema_version":"1.0","event_id":"sha256:588fde3ad33c406d05382781bb38d9b169d48b24afc38d48f3b87fbb73c73afb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NQEMRABHKZLVOOOGY7BOO5QAY3/bundle.json","state_url":"https://pith.science/pith/NQEMRABHKZLVOOOGY7BOO5QAY3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NQEMRABHKZLVOOOGY7BOO5QAY3/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-07T20:06:55Z","links":{"resolver":"https://pith.science/pith/NQEMRABHKZLVOOOGY7BOO5QAY3","bundle":"https://pith.science/pith/NQEMRABHKZLVOOOGY7BOO5QAY3/bundle.json","state":"https://pith.science/pith/NQEMRABHKZLVOOOGY7BOO5QAY3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NQEMRABHKZLVOOOGY7BOO5QAY3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NQEMRABHKZLVOOOGY7BOO5QAY3","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":"22743ddc7c9914857e19764cf01547f53e91d69cedff2197cc5eb010a90d7b14","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-06T06:19:40Z","title_canon_sha256":"dbef431df7c79319e3f23633cbc23303606c38ae0a065a8960887db1f1b99315"},"schema_version":"1.0","source":{"id":"1805.02156","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.02156","created_at":"2026-05-17T23:54:39Z"},{"alias_kind":"arxiv_version","alias_value":"1805.02156v2","created_at":"2026-05-17T23:54:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02156","created_at":"2026-05-17T23:54:39Z"},{"alias_kind":"pith_short_12","alias_value":"NQEMRABHKZLV","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NQEMRABHKZLVOOOG","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NQEMRABH","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:588fde3ad33c406d05382781bb38d9b169d48b24afc38d48f3b87fbb73c73afb","target":"graph","created_at":"2026-05-17T23:54:39Z","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":"Given a multigraph $G$ and a positive integer $t$, the distance-$t$ chromatic index of $G$ is the least number of colours needed for a colouring of the edges so that every pair of distinct edges connected by a path of fewer than $t$ edges must receive different colours. Let $\\pi'_t(d)$ and $\\tau'_t(d)$ be the largest values of this parameter over the class of planar multigraphs and of (simple) trees, respectively, of maximum degree $d$. We have that $\\pi'_t(d)$ is at most and at least a non-trivial constant multiple larger than $\\tau'_t(d)$. (We conjecture $\\limsup_{d\\to\\infty}\\pi'_2(d)/\\tau'_","authors_text":"Ross J. Kang, Willem van Loon","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-06T06:19:40Z","title":"Tree-like distance colouring for planar graphs of sufficient girth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02156","kind":"arxiv","version":2},"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:0daa44f7d399d282dc8b20ed7c3e5b12282f6ad1435f7e99113c8391d1f95c12","target":"record","created_at":"2026-05-17T23:54:39Z","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":"22743ddc7c9914857e19764cf01547f53e91d69cedff2197cc5eb010a90d7b14","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-06T06:19:40Z","title_canon_sha256":"dbef431df7c79319e3f23633cbc23303606c38ae0a065a8960887db1f1b99315"},"schema_version":"1.0","source":{"id":"1805.02156","kind":"arxiv","version":2}},"canonical_sha256":"6c08c8802756575739c6c7c2e77600c6cd62f6079aa6b01d2d77669fcf13247f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c08c8802756575739c6c7c2e77600c6cd62f6079aa6b01d2d77669fcf13247f","first_computed_at":"2026-05-17T23:54:39.604499Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:39.604499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+DreSFOmi9kMHR6cLnFnbN/zxUE+LxSmbABcXcsY4d16bJ2Z7JTX+oG74aIplHxZR2jSjZ8I8dW+rYDCodC8Bw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:39.605128Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.02156","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0daa44f7d399d282dc8b20ed7c3e5b12282f6ad1435f7e99113c8391d1f95c12","sha256:588fde3ad33c406d05382781bb38d9b169d48b24afc38d48f3b87fbb73c73afb"],"state_sha256":"5eed29773e88c721675085c087f12601a05038aef515b03b805157f9c5dbd9f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"80/JtotIZrvKEOUDCXPGi3jhXxUClHm/JFpqhp44J8e9+BRPoj/COs4MFFGbu475+KYXtPV9IpB6aBTtQBlpAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T20:06:55.060288Z","bundle_sha256":"0f06733b32b413c71266916b22c09d21d0ca8780636a656ef6baf37d8088e185"}}