{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:4BAPB5YWUTDWYOPSREQU5F2NS5","short_pith_number":"pith:4BAPB5YW","canonical_record":{"source":{"id":"2007.08324","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-07-16T13:31:54Z","cross_cats_sorted":[],"title_canon_sha256":"197b0ed8cf275614d3ec373e452df914410612358bcb27793ab8a3a96ac519a7","abstract_canon_sha256":"e59a9dbd0bac978bbc4566d1a27a1b11b2c6f72192b6a76dc46cd6a04a9852ac"},"schema_version":"1.0"},"canonical_sha256":"e040f0f716a4c76c39f289214e974d975bc9cba5ba91c90184831d52abe108cc","source":{"kind":"arxiv","id":"2007.08324","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.08324","created_at":"2026-07-05T01:19:45Z"},{"alias_kind":"arxiv_version","alias_value":"2007.08324v1","created_at":"2026-07-05T01:19:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.08324","created_at":"2026-07-05T01:19:45Z"},{"alias_kind":"pith_short_12","alias_value":"4BAPB5YWUTDW","created_at":"2026-07-05T01:19:45Z"},{"alias_kind":"pith_short_16","alias_value":"4BAPB5YWUTDWYOPS","created_at":"2026-07-05T01:19:45Z"},{"alias_kind":"pith_short_8","alias_value":"4BAPB5YW","created_at":"2026-07-05T01:19:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:4BAPB5YWUTDWYOPSREQU5F2NS5","target":"record","payload":{"canonical_record":{"source":{"id":"2007.08324","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-07-16T13:31:54Z","cross_cats_sorted":[],"title_canon_sha256":"197b0ed8cf275614d3ec373e452df914410612358bcb27793ab8a3a96ac519a7","abstract_canon_sha256":"e59a9dbd0bac978bbc4566d1a27a1b11b2c6f72192b6a76dc46cd6a04a9852ac"},"schema_version":"1.0"},"canonical_sha256":"e040f0f716a4c76c39f289214e974d975bc9cba5ba91c90184831d52abe108cc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:19:45.927200Z","signature_b64":"zyXADgop21Gd+ksaNVzm2XQ7C/OxtKYis+kbXfoSu3+anZPFr6MpmgzpnKbMW5CUNgp+YyDW2TK/IhakBKcyDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e040f0f716a4c76c39f289214e974d975bc9cba5ba91c90184831d52abe108cc","last_reissued_at":"2026-07-05T01:19:45.926839Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:19:45.926839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2007.08324","source_version":1,"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-07-05T01:19:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2cDbt6V62zsss6w4szKTn1Uu7w/+VBIfPWiMMm9+4+iBMaaT1Lz/XByYTkvxfV1coO9MmYoErzKPv8mrrXwMCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T09:50:26.351066Z"},"content_sha256":"d6ae5186b5ee03f21e26c23782a0b1cc4c017040e3b4c78c3c1b42be7073a932","schema_version":"1.0","event_id":"sha256:d6ae5186b5ee03f21e26c23782a0b1cc4c017040e3b4c78c3c1b42be7073a932"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:4BAPB5YWUTDWYOPSREQU5F2NS5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The mod $k$ chromatic index of graphs is $O(k)$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"F\\'abio Botler, Lucas Colucci, Yoshiharu Kohayakawa","submitted_at":"2020-07-16T13:31:54Z","abstract_excerpt":"Let $\\chi'_k(G)$ denote the minimum number of colors needed to color the edges of a graph $G$ in a way that the subgraph spanned by the edges of each color has all degrees congruent to $1 \\pmod k$. Scott [{\\em Discrete Math. 175}, 1-3 (1997), 289--291] proved that $\\chi'_k(G)\\leq5k^2\\log k$, and thus settled a question of Pyber [{\\em Sets, graphs and numbers} (1992), pp. 583--610], who had asked whether $\\chi_k'(G)$ can be bounded solely as a function of $k$. We prove that $\\chi'_k(G)=O(k)$, answering affirmatively a question of Scott."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.08324","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2007.08324/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:19:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xiwtCI+SipFGoFXJ8ZEDZL0U410cBIXaF/ISuwdatmihBoNe5iwcucV28gJtfyrCbIH1FA4hStASFumkKaXNAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T09:50:26.351796Z"},"content_sha256":"03b56f9813bcdaeea4ab376394854a27593663edc10f9bc7038e8cf8bb74b711","schema_version":"1.0","event_id":"sha256:03b56f9813bcdaeea4ab376394854a27593663edc10f9bc7038e8cf8bb74b711"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4BAPB5YWUTDWYOPSREQU5F2NS5/bundle.json","state_url":"https://pith.science/pith/4BAPB5YWUTDWYOPSREQU5F2NS5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4BAPB5YWUTDWYOPSREQU5F2NS5/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-07-05T09:50:26Z","links":{"resolver":"https://pith.science/pith/4BAPB5YWUTDWYOPSREQU5F2NS5","bundle":"https://pith.science/pith/4BAPB5YWUTDWYOPSREQU5F2NS5/bundle.json","state":"https://pith.science/pith/4BAPB5YWUTDWYOPSREQU5F2NS5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4BAPB5YWUTDWYOPSREQU5F2NS5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:4BAPB5YWUTDWYOPSREQU5F2NS5","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":"e59a9dbd0bac978bbc4566d1a27a1b11b2c6f72192b6a76dc46cd6a04a9852ac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-07-16T13:31:54Z","title_canon_sha256":"197b0ed8cf275614d3ec373e452df914410612358bcb27793ab8a3a96ac519a7"},"schema_version":"1.0","source":{"id":"2007.08324","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.08324","created_at":"2026-07-05T01:19:45Z"},{"alias_kind":"arxiv_version","alias_value":"2007.08324v1","created_at":"2026-07-05T01:19:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.08324","created_at":"2026-07-05T01:19:45Z"},{"alias_kind":"pith_short_12","alias_value":"4BAPB5YWUTDW","created_at":"2026-07-05T01:19:45Z"},{"alias_kind":"pith_short_16","alias_value":"4BAPB5YWUTDWYOPS","created_at":"2026-07-05T01:19:45Z"},{"alias_kind":"pith_short_8","alias_value":"4BAPB5YW","created_at":"2026-07-05T01:19:45Z"}],"graph_snapshots":[{"event_id":"sha256:03b56f9813bcdaeea4ab376394854a27593663edc10f9bc7038e8cf8bb74b711","target":"graph","created_at":"2026-07-05T01:19:45Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2007.08324/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $\\chi'_k(G)$ denote the minimum number of colors needed to color the edges of a graph $G$ in a way that the subgraph spanned by the edges of each color has all degrees congruent to $1 \\pmod k$. Scott [{\\em Discrete Math. 175}, 1-3 (1997), 289--291] proved that $\\chi'_k(G)\\leq5k^2\\log k$, and thus settled a question of Pyber [{\\em Sets, graphs and numbers} (1992), pp. 583--610], who had asked whether $\\chi_k'(G)$ can be bounded solely as a function of $k$. We prove that $\\chi'_k(G)=O(k)$, answering affirmatively a question of Scott.","authors_text":"F\\'abio Botler, Lucas Colucci, Yoshiharu Kohayakawa","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-07-16T13:31:54Z","title":"The mod $k$ chromatic index of graphs is $O(k)$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.08324","kind":"arxiv","version":1},"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:d6ae5186b5ee03f21e26c23782a0b1cc4c017040e3b4c78c3c1b42be7073a932","target":"record","created_at":"2026-07-05T01:19:45Z","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":"e59a9dbd0bac978bbc4566d1a27a1b11b2c6f72192b6a76dc46cd6a04a9852ac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-07-16T13:31:54Z","title_canon_sha256":"197b0ed8cf275614d3ec373e452df914410612358bcb27793ab8a3a96ac519a7"},"schema_version":"1.0","source":{"id":"2007.08324","kind":"arxiv","version":1}},"canonical_sha256":"e040f0f716a4c76c39f289214e974d975bc9cba5ba91c90184831d52abe108cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e040f0f716a4c76c39f289214e974d975bc9cba5ba91c90184831d52abe108cc","first_computed_at":"2026-07-05T01:19:45.926839Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:19:45.926839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zyXADgop21Gd+ksaNVzm2XQ7C/OxtKYis+kbXfoSu3+anZPFr6MpmgzpnKbMW5CUNgp+YyDW2TK/IhakBKcyDA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:19:45.927200Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.08324","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d6ae5186b5ee03f21e26c23782a0b1cc4c017040e3b4c78c3c1b42be7073a932","sha256:03b56f9813bcdaeea4ab376394854a27593663edc10f9bc7038e8cf8bb74b711"],"state_sha256":"64c68dba3232a654579a547e1b87768c687b3315f47944afa7351918b14033e6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NGwu0zqPxiOjHDi5Ks5JyHyW+Tw7Up1xjSNT31oDqCTQSHMsuyq5YLOE3mAOEb8tDzJQFkg9SLOQ+PmZiv0QBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T09:50:26.353813Z","bundle_sha256":"44b7080ba45a7d2afec85c34a32332168e57aed1578f88212038a545a6972ff8"}}