{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:7WFECPXTKSQBCNK56M2N6KWIST","short_pith_number":"pith:7WFECPXT","canonical_record":{"source":{"id":"2608.10687","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-08-11T09:11:34Z","cross_cats_sorted":[],"title_canon_sha256":"83c35389536d3c64c4a3dc8ad16cb0587739f621b3c4cc7e4be5851d6260d172","abstract_canon_sha256":"56f3dad9259b64497d1229dc4752980adbc909d6d1cf5472e80b7631ef9a64c7"},"schema_version":"1.0"},"canonical_sha256":"fd8a413ef354a011355df334df2ac894e05347dff8242288262e3737c0d75e85","source":{"kind":"arxiv","id":"2608.10687","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.10687","created_at":"2026-08-12T01:23:02Z"},{"alias_kind":"arxiv_version","alias_value":"2608.10687v1","created_at":"2026-08-12T01:23:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.10687","created_at":"2026-08-12T01:23:02Z"},{"alias_kind":"pith_short_12","alias_value":"7WFECPXTKSQB","created_at":"2026-08-12T01:23:02Z"},{"alias_kind":"pith_short_16","alias_value":"7WFECPXTKSQBCNK5","created_at":"2026-08-12T01:23:02Z"},{"alias_kind":"pith_short_8","alias_value":"7WFECPXT","created_at":"2026-08-12T01:23:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:7WFECPXTKSQBCNK56M2N6KWIST","target":"record","payload":{"canonical_record":{"source":{"id":"2608.10687","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-08-11T09:11:34Z","cross_cats_sorted":[],"title_canon_sha256":"83c35389536d3c64c4a3dc8ad16cb0587739f621b3c4cc7e4be5851d6260d172","abstract_canon_sha256":"56f3dad9259b64497d1229dc4752980adbc909d6d1cf5472e80b7631ef9a64c7"},"schema_version":"1.0"},"canonical_sha256":"fd8a413ef354a011355df334df2ac894e05347dff8242288262e3737c0d75e85","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-12T01:23:02.675240Z","signature_b64":"uXAic+LE8XVTrok56Ut8rWTFkhUM25WIJt39vs0RTCC5Ee5DNjHFgT90J1T9DAtfvKbphSfxEp0Wk4AxaekWCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd8a413ef354a011355df334df2ac894e05347dff8242288262e3737c0d75e85","last_reissued_at":"2026-08-12T01:23:02.670773Z","signature_status":"signed_v1","first_computed_at":"2026-08-12T01:23:02.670773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2608.10687","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-08-12T01:23:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eXYQLXdeGGjeFkWZ+zv15dPp7EGJ23Nz/yVu6rM+LHb+D6BF1wtDRJQ3fWYXbGDlJmHDDIS+ynTG83H87SwyCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T06:38:07.061180Z"},"content_sha256":"e9a0a5606e0a6c5caa66ee97535701f761346684f1c137cf59c91e82d4612238","schema_version":"1.0","event_id":"sha256:e9a0a5606e0a6c5caa66ee97535701f761346684f1c137cf59c91e82d4612238"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:7WFECPXTKSQBCNK56M2N6KWIST","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counterexamples to two conjectures on modular edge colorings of graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Baoyindureng Wu, Chunqiang Guo","submitted_at":"2026-08-11T09:11:34Z","abstract_excerpt":"For an integer $k\\geq2$, let $\\chi_k'(G)$ denote the minimum number of colors in an edge-coloring of a graph $G$ such that every nonzero degree in each color subgraph is congruent to $1\\pmod{k}$. A graph is a $0_k$-graph if every vertex degree is divisible by $k$. We disprove a conjecture of Berthe et al.\\ (On modular edge colorings of graphs, SIAM J. Discrete Math. 40 (2026) 897--904), which states that $\\chi_k'(G)\\leq k+o(k)$ for every $0_k$-graph $G$. We prove a lower bound for $0_k$-graphs with degree set $\\{k,2k\\}$ and a specified vertex partition. With a suitable choice of the part sizes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.10687","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/2608.10687/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-08-12T01:23:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p3GXJbgipdQH3a5L+ScKWuVrNYi/jmKvzWsk7XR+d61sVQHv9yARvP0MZsEg+yUJxbvcW7YtFIa6TjAB8XaICw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T06:38:07.061778Z"},"content_sha256":"d9d4da2d64de0d68a3bb7b329175038f9342c378cbdb62cd10e569bbf49912a8","schema_version":"1.0","event_id":"sha256:d9d4da2d64de0d68a3bb7b329175038f9342c378cbdb62cd10e569bbf49912a8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7WFECPXTKSQBCNK56M2N6KWIST/bundle.json","state_url":"https://pith.science/pith/7WFECPXTKSQBCNK56M2N6KWIST/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7WFECPXTKSQBCNK56M2N6KWIST/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-08-13T06:38:07Z","links":{"resolver":"https://pith.science/pith/7WFECPXTKSQBCNK56M2N6KWIST","bundle":"https://pith.science/pith/7WFECPXTKSQBCNK56M2N6KWIST/bundle.json","state":"https://pith.science/pith/7WFECPXTKSQBCNK56M2N6KWIST/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7WFECPXTKSQBCNK56M2N6KWIST/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:7WFECPXTKSQBCNK56M2N6KWIST","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":"56f3dad9259b64497d1229dc4752980adbc909d6d1cf5472e80b7631ef9a64c7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-08-11T09:11:34Z","title_canon_sha256":"83c35389536d3c64c4a3dc8ad16cb0587739f621b3c4cc7e4be5851d6260d172"},"schema_version":"1.0","source":{"id":"2608.10687","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.10687","created_at":"2026-08-12T01:23:02Z"},{"alias_kind":"arxiv_version","alias_value":"2608.10687v1","created_at":"2026-08-12T01:23:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.10687","created_at":"2026-08-12T01:23:02Z"},{"alias_kind":"pith_short_12","alias_value":"7WFECPXTKSQB","created_at":"2026-08-12T01:23:02Z"},{"alias_kind":"pith_short_16","alias_value":"7WFECPXTKSQBCNK5","created_at":"2026-08-12T01:23:02Z"},{"alias_kind":"pith_short_8","alias_value":"7WFECPXT","created_at":"2026-08-12T01:23:02Z"}],"graph_snapshots":[{"event_id":"sha256:d9d4da2d64de0d68a3bb7b329175038f9342c378cbdb62cd10e569bbf49912a8","target":"graph","created_at":"2026-08-12T01:23:02Z","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/2608.10687/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For an integer $k\\geq2$, let $\\chi_k'(G)$ denote the minimum number of colors in an edge-coloring of a graph $G$ such that every nonzero degree in each color subgraph is congruent to $1\\pmod{k}$. A graph is a $0_k$-graph if every vertex degree is divisible by $k$. We disprove a conjecture of Berthe et al.\\ (On modular edge colorings of graphs, SIAM J. Discrete Math. 40 (2026) 897--904), which states that $\\chi_k'(G)\\leq k+o(k)$ for every $0_k$-graph $G$. We prove a lower bound for $0_k$-graphs with degree set $\\{k,2k\\}$ and a specified vertex partition. With a suitable choice of the part sizes","authors_text":"Baoyindureng Wu, Chunqiang Guo","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-08-11T09:11:34Z","title":"Counterexamples to two conjectures on modular edge colorings of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.10687","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:e9a0a5606e0a6c5caa66ee97535701f761346684f1c137cf59c91e82d4612238","target":"record","created_at":"2026-08-12T01:23:02Z","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":"56f3dad9259b64497d1229dc4752980adbc909d6d1cf5472e80b7631ef9a64c7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-08-11T09:11:34Z","title_canon_sha256":"83c35389536d3c64c4a3dc8ad16cb0587739f621b3c4cc7e4be5851d6260d172"},"schema_version":"1.0","source":{"id":"2608.10687","kind":"arxiv","version":1}},"canonical_sha256":"fd8a413ef354a011355df334df2ac894e05347dff8242288262e3737c0d75e85","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd8a413ef354a011355df334df2ac894e05347dff8242288262e3737c0d75e85","first_computed_at":"2026-08-12T01:23:02.670773Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-12T01:23:02.670773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uXAic+LE8XVTrok56Ut8rWTFkhUM25WIJt39vs0RTCC5Ee5DNjHFgT90J1T9DAtfvKbphSfxEp0Wk4AxaekWCw==","signature_status":"signed_v1","signed_at":"2026-08-12T01:23:02.675240Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.10687","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e9a0a5606e0a6c5caa66ee97535701f761346684f1c137cf59c91e82d4612238","sha256:d9d4da2d64de0d68a3bb7b329175038f9342c378cbdb62cd10e569bbf49912a8"],"state_sha256":"b3e4487b9f51d41326db079a0b0fd20feb5e0e05c98d1ec25af2456d00843f2f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dhNM9beZe+paEr868x6gAzFl8rxLWXyS9t2FRO412+HZjXOdXDCkw+1s4Oyl13qbpJoxavszhBzjX5mfzqeCBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T06:38:07.067124Z","bundle_sha256":"d9f3659400d78f459b4e38f93cf578bf8d66a312ee73baa1a0e09a5092b98177"}}