{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:33UGUDG5STLOTSDDYZLG4YNFTO","short_pith_number":"pith:33UGUDG5","canonical_record":{"source":{"id":"1205.4171","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-18T15:04:54Z","cross_cats_sorted":[],"title_canon_sha256":"c089215998c268b89b084b43c3125f499c585b8b34aeb6711c384c4b5f770fd6","abstract_canon_sha256":"526a4bbc296bba9d2c0b0ebb045d18414f7fd65d5307fedbb474b3d86fbfc442"},"schema_version":"1.0"},"canonical_sha256":"dee86a0cdd94d6e9c863c6566e61a59bb46d45a8475957654112fc29960a3b35","source":{"kind":"arxiv","id":"1205.4171","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.4171","created_at":"2026-05-18T01:28:44Z"},{"alias_kind":"arxiv_version","alias_value":"1205.4171v3","created_at":"2026-05-18T01:28:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.4171","created_at":"2026-05-18T01:28:44Z"},{"alias_kind":"pith_short_12","alias_value":"33UGUDG5STLO","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"33UGUDG5STLOTSDD","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"33UGUDG5","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:33UGUDG5STLOTSDDYZLG4YNFTO","target":"record","payload":{"canonical_record":{"source":{"id":"1205.4171","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-18T15:04:54Z","cross_cats_sorted":[],"title_canon_sha256":"c089215998c268b89b084b43c3125f499c585b8b34aeb6711c384c4b5f770fd6","abstract_canon_sha256":"526a4bbc296bba9d2c0b0ebb045d18414f7fd65d5307fedbb474b3d86fbfc442"},"schema_version":"1.0"},"canonical_sha256":"dee86a0cdd94d6e9c863c6566e61a59bb46d45a8475957654112fc29960a3b35","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:28:44.539506Z","signature_b64":"aGAaPLkJDMhTdZne7RYQ/95U3Kgv8XOzfZXYln0bKXvtc2IfbOA5RH2oJLt4IhQ7LC50HoEsoGKBtmp3nQ1QDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dee86a0cdd94d6e9c863c6566e61a59bb46d45a8475957654112fc29960a3b35","last_reissued_at":"2026-05-18T01:28:44.539050Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:28:44.539050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.4171","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-18T01:28:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zkOO6RWzsyA0oHgWRD2+ibPkO0bKeObgpY4A67QrRWJBKO14kRVtv617vfOvbOP/OajjdTSBbkmWoeadsgOIDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:59:19.139208Z"},"content_sha256":"4a2149c62a3a738cdb8b0298f230eb725993678409ab23e2e1502e0cb43ecc31","schema_version":"1.0","event_id":"sha256:4a2149c62a3a738cdb8b0298f230eb725993678409ab23e2e1502e0cb43ecc31"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:33UGUDG5STLOTSDDYZLG4YNFTO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The distance-t chromatic index of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ross J. Kang, Tom\\'a\\v{s} Kaiser","submitted_at":"2012-05-18T15:04:54Z","abstract_excerpt":"We consider two graph colouring problems in which edges at distance at most $t$ are given distinct colours, for some fixed positive integer $t$. We obtain two upper bounds for the distance-$t$ chromatic index, the least number of colours necessary for such a colouring. One is a bound of $(2-\\eps)\\Delta^t$ for graphs of maximum degree at most $\\Delta$, where $\\eps$ is some absolute positive constant independent of $t$. The other is a bound of $O(\\Delta^t/\\log \\Delta)$ (as $\\Delta\\to\\infty$) for graphs of maximum degree at most $\\Delta$ and girth at least $2t+1$. The first bound is an analogue o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.4171","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-18T01:28:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p23iL27gbay/cgTjE9dDo/hzIEDLAADccr+GugmYR4/ZjDfGIV3lNHl5SJijCn9FwsShQKe8YlJTxD8MLOluAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:59:19.139822Z"},"content_sha256":"63d0163c4fa5a0d0ef7e21482bbc354468564e2653e8a3f7e6f8ae59ebb98bc0","schema_version":"1.0","event_id":"sha256:63d0163c4fa5a0d0ef7e21482bbc354468564e2653e8a3f7e6f8ae59ebb98bc0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/33UGUDG5STLOTSDDYZLG4YNFTO/bundle.json","state_url":"https://pith.science/pith/33UGUDG5STLOTSDDYZLG4YNFTO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/33UGUDG5STLOTSDDYZLG4YNFTO/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-05-25T18:59:19Z","links":{"resolver":"https://pith.science/pith/33UGUDG5STLOTSDDYZLG4YNFTO","bundle":"https://pith.science/pith/33UGUDG5STLOTSDDYZLG4YNFTO/bundle.json","state":"https://pith.science/pith/33UGUDG5STLOTSDDYZLG4YNFTO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/33UGUDG5STLOTSDDYZLG4YNFTO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:33UGUDG5STLOTSDDYZLG4YNFTO","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":"526a4bbc296bba9d2c0b0ebb045d18414f7fd65d5307fedbb474b3d86fbfc442","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-18T15:04:54Z","title_canon_sha256":"c089215998c268b89b084b43c3125f499c585b8b34aeb6711c384c4b5f770fd6"},"schema_version":"1.0","source":{"id":"1205.4171","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.4171","created_at":"2026-05-18T01:28:44Z"},{"alias_kind":"arxiv_version","alias_value":"1205.4171v3","created_at":"2026-05-18T01:28:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.4171","created_at":"2026-05-18T01:28:44Z"},{"alias_kind":"pith_short_12","alias_value":"33UGUDG5STLO","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"33UGUDG5STLOTSDD","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"33UGUDG5","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:63d0163c4fa5a0d0ef7e21482bbc354468564e2653e8a3f7e6f8ae59ebb98bc0","target":"graph","created_at":"2026-05-18T01:28:44Z","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":"We consider two graph colouring problems in which edges at distance at most $t$ are given distinct colours, for some fixed positive integer $t$. We obtain two upper bounds for the distance-$t$ chromatic index, the least number of colours necessary for such a colouring. One is a bound of $(2-\\eps)\\Delta^t$ for graphs of maximum degree at most $\\Delta$, where $\\eps$ is some absolute positive constant independent of $t$. The other is a bound of $O(\\Delta^t/\\log \\Delta)$ (as $\\Delta\\to\\infty$) for graphs of maximum degree at most $\\Delta$ and girth at least $2t+1$. The first bound is an analogue o","authors_text":"Ross J. Kang, Tom\\'a\\v{s} Kaiser","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-18T15:04:54Z","title":"The distance-t chromatic index of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.4171","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:4a2149c62a3a738cdb8b0298f230eb725993678409ab23e2e1502e0cb43ecc31","target":"record","created_at":"2026-05-18T01:28:44Z","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":"526a4bbc296bba9d2c0b0ebb045d18414f7fd65d5307fedbb474b3d86fbfc442","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-18T15:04:54Z","title_canon_sha256":"c089215998c268b89b084b43c3125f499c585b8b34aeb6711c384c4b5f770fd6"},"schema_version":"1.0","source":{"id":"1205.4171","kind":"arxiv","version":3}},"canonical_sha256":"dee86a0cdd94d6e9c863c6566e61a59bb46d45a8475957654112fc29960a3b35","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dee86a0cdd94d6e9c863c6566e61a59bb46d45a8475957654112fc29960a3b35","first_computed_at":"2026-05-18T01:28:44.539050Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:28:44.539050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aGAaPLkJDMhTdZne7RYQ/95U3Kgv8XOzfZXYln0bKXvtc2IfbOA5RH2oJLt4IhQ7LC50HoEsoGKBtmp3nQ1QDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:28:44.539506Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.4171","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a2149c62a3a738cdb8b0298f230eb725993678409ab23e2e1502e0cb43ecc31","sha256:63d0163c4fa5a0d0ef7e21482bbc354468564e2653e8a3f7e6f8ae59ebb98bc0"],"state_sha256":"2f4bf47b7fd1379692defdaaf0161584dc3117ffa174fec157a5c7011bc68a40"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tO4pl7qoOPpm/u7+MXlbzvf1KwXdWLw74SzgSsjcatEwzgMvbWCaCRG/lHz97KyC9AZ0oDAQZbYEV6yvsPp8BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:59:19.143520Z","bundle_sha256":"6255ca602f185dbaafc35355646fa150b40d739e05ef1ac65b7064942c8ae3ff"}}