{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:VJCLJWGWEMKSK4H2A5UDUJSAZK","short_pith_number":"pith:VJCLJWGW","canonical_record":{"source":{"id":"1403.8127","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-31T18:55:52Z","cross_cats_sorted":[],"title_canon_sha256":"e9997993285c16a6143e270cceeab5bc098e61f0ce16a9ccb7dc65a2aa4b14d4","abstract_canon_sha256":"629a2ce0c1e9b6381fef30675d552ea13a965990ca2de0b38442fd068f0562b8"},"schema_version":"1.0"},"canonical_sha256":"aa44b4d8d623152570fa07683a2640ca87d00bad4078b770ba145f51be12df3b","source":{"kind":"arxiv","id":"1403.8127","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.8127","created_at":"2026-05-18T02:55:11Z"},{"alias_kind":"arxiv_version","alias_value":"1403.8127v1","created_at":"2026-05-18T02:55:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.8127","created_at":"2026-05-18T02:55:11Z"},{"alias_kind":"pith_short_12","alias_value":"VJCLJWGWEMKS","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"VJCLJWGWEMKSK4H2","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"VJCLJWGW","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:VJCLJWGWEMKSK4H2A5UDUJSAZK","target":"record","payload":{"canonical_record":{"source":{"id":"1403.8127","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-31T18:55:52Z","cross_cats_sorted":[],"title_canon_sha256":"e9997993285c16a6143e270cceeab5bc098e61f0ce16a9ccb7dc65a2aa4b14d4","abstract_canon_sha256":"629a2ce0c1e9b6381fef30675d552ea13a965990ca2de0b38442fd068f0562b8"},"schema_version":"1.0"},"canonical_sha256":"aa44b4d8d623152570fa07683a2640ca87d00bad4078b770ba145f51be12df3b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:11.779375Z","signature_b64":"TzGLW2vyX8VxDis/dh8mififj5eOT/T/0nhWpjz1Vy/9tc2IyeaK537ksEtb9z8rW6BAFKrJpmIyQLOybQ12Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa44b4d8d623152570fa07683a2640ca87d00bad4078b770ba145f51be12df3b","last_reissued_at":"2026-05-18T02:55:11.778934Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:11.778934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.8127","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-05-18T02:55:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5k2i4yo15xBVg/bnNpZ3496ydyGbEAL/XuxZlEiG9xgBeCoIywybW7eWbD9mZNuXh0BLzs9MqAQCUOMNhBv2Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:09:57.834564Z"},"content_sha256":"b3a59d03b2007ceca768121fafa826ccba99bdc5831c406e50d32c710fd5c305","schema_version":"1.0","event_id":"sha256:b3a59d03b2007ceca768121fafa826ccba99bdc5831c406e50d32c710fd5c305"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:VJCLJWGWEMKSK4H2A5UDUJSAZK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coloring Digraphs with Forbidden Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Ma, Wenan Zang, Zhibin Chen","submitted_at":"2014-03-31T18:55:52Z","abstract_excerpt":"Let $k$ and $r$ be two integers with $k \\ge 2$ and $k\\ge r \\ge 1$. In this paper we show that (1) if a strongly connected digraph $D$ contains no directed cycle of length $1$ modulo $k$, then $D$ is $k$-colorable; and (2) if a digraph $D$ contains no directed cycle of length $r$ modulo $k$, then $D$ can be vertex-colored with $k$ colors so that each color class induces an acyclic subdigraph in $D$. The first result gives an affirmative answer to a question posed by Tuza in 1992, and the second implies the following strong form of a conjecture of Diwan, Kenkre and Vishwanathan: If an undirected"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.8127","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":""},"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-18T02:55:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fc7d0fGEpp9v9aFgy8V0W9g5QIFilz8us/8MbSoCheXEZ8o8hmf0eDX2Vp5FMqWsxJiFihxuTK87t7Alk3vdCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:09:57.835236Z"},"content_sha256":"3c880edd1460fc8e4db3d67f71bcfa3ccc4e9f0ce5823250255760e1efd449e6","schema_version":"1.0","event_id":"sha256:3c880edd1460fc8e4db3d67f71bcfa3ccc4e9f0ce5823250255760e1efd449e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VJCLJWGWEMKSK4H2A5UDUJSAZK/bundle.json","state_url":"https://pith.science/pith/VJCLJWGWEMKSK4H2A5UDUJSAZK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VJCLJWGWEMKSK4H2A5UDUJSAZK/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-27T13:09:57Z","links":{"resolver":"https://pith.science/pith/VJCLJWGWEMKSK4H2A5UDUJSAZK","bundle":"https://pith.science/pith/VJCLJWGWEMKSK4H2A5UDUJSAZK/bundle.json","state":"https://pith.science/pith/VJCLJWGWEMKSK4H2A5UDUJSAZK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VJCLJWGWEMKSK4H2A5UDUJSAZK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:VJCLJWGWEMKSK4H2A5UDUJSAZK","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":"629a2ce0c1e9b6381fef30675d552ea13a965990ca2de0b38442fd068f0562b8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-31T18:55:52Z","title_canon_sha256":"e9997993285c16a6143e270cceeab5bc098e61f0ce16a9ccb7dc65a2aa4b14d4"},"schema_version":"1.0","source":{"id":"1403.8127","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.8127","created_at":"2026-05-18T02:55:11Z"},{"alias_kind":"arxiv_version","alias_value":"1403.8127v1","created_at":"2026-05-18T02:55:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.8127","created_at":"2026-05-18T02:55:11Z"},{"alias_kind":"pith_short_12","alias_value":"VJCLJWGWEMKS","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"VJCLJWGWEMKSK4H2","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"VJCLJWGW","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:3c880edd1460fc8e4db3d67f71bcfa3ccc4e9f0ce5823250255760e1efd449e6","target":"graph","created_at":"2026-05-18T02:55: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 $k$ and $r$ be two integers with $k \\ge 2$ and $k\\ge r \\ge 1$. In this paper we show that (1) if a strongly connected digraph $D$ contains no directed cycle of length $1$ modulo $k$, then $D$ is $k$-colorable; and (2) if a digraph $D$ contains no directed cycle of length $r$ modulo $k$, then $D$ can be vertex-colored with $k$ colors so that each color class induces an acyclic subdigraph in $D$. The first result gives an affirmative answer to a question posed by Tuza in 1992, and the second implies the following strong form of a conjecture of Diwan, Kenkre and Vishwanathan: If an undirected","authors_text":"Jie Ma, Wenan Zang, Zhibin Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-31T18:55:52Z","title":"Coloring Digraphs with Forbidden Cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.8127","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:b3a59d03b2007ceca768121fafa826ccba99bdc5831c406e50d32c710fd5c305","target":"record","created_at":"2026-05-18T02:55: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":"629a2ce0c1e9b6381fef30675d552ea13a965990ca2de0b38442fd068f0562b8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-31T18:55:52Z","title_canon_sha256":"e9997993285c16a6143e270cceeab5bc098e61f0ce16a9ccb7dc65a2aa4b14d4"},"schema_version":"1.0","source":{"id":"1403.8127","kind":"arxiv","version":1}},"canonical_sha256":"aa44b4d8d623152570fa07683a2640ca87d00bad4078b770ba145f51be12df3b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa44b4d8d623152570fa07683a2640ca87d00bad4078b770ba145f51be12df3b","first_computed_at":"2026-05-18T02:55:11.778934Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:55:11.778934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TzGLW2vyX8VxDis/dh8mififj5eOT/T/0nhWpjz1Vy/9tc2IyeaK537ksEtb9z8rW6BAFKrJpmIyQLOybQ12Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:55:11.779375Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.8127","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3a59d03b2007ceca768121fafa826ccba99bdc5831c406e50d32c710fd5c305","sha256:3c880edd1460fc8e4db3d67f71bcfa3ccc4e9f0ce5823250255760e1efd449e6"],"state_sha256":"4c68c79844d1c86851923713bea1491f93d4918f4029d9ac3dd49c597e5e00ba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V2DV06qoY8tng4XQZfzh2S+55GudnPqYMkOq5lEwoo2s4ptbDMpDO6pdx/1r5QxgBK++Sc9HLuOUngnUg8EqAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T13:09:57.838529Z","bundle_sha256":"f0a15528114a5f1b5816e6fdfb72bb3e3c62bd9da30dc02ca01ffa52d16ddd05"}}