{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:TZ2T34ZVZSAFC2OLY4CG4VOG7W","short_pith_number":"pith:TZ2T34ZV","canonical_record":{"source":{"id":"1707.09349","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-07-28T17:45:33Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"57f3eb86f8a6cf36282030d27b2ecd78f4a67323218e36b88ecd16b0edb9b885","abstract_canon_sha256":"908a9b07cd0e2be046e4f5dcd2ca68183d659e382d046b1c5d577d03123402b9"},"schema_version":"1.0"},"canonical_sha256":"9e753df335cc805169cbc7046e55c6fdb6c96a3cd7fd3502aa29e5b270713f6e","source":{"kind":"arxiv","id":"1707.09349","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.09349","created_at":"2026-05-18T00:39:16Z"},{"alias_kind":"arxiv_version","alias_value":"1707.09349v1","created_at":"2026-05-18T00:39:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.09349","created_at":"2026-05-18T00:39:16Z"},{"alias_kind":"pith_short_12","alias_value":"TZ2T34ZVZSAF","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TZ2T34ZVZSAFC2OL","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TZ2T34ZV","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:TZ2T34ZVZSAFC2OLY4CG4VOG7W","target":"record","payload":{"canonical_record":{"source":{"id":"1707.09349","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-07-28T17:45:33Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"57f3eb86f8a6cf36282030d27b2ecd78f4a67323218e36b88ecd16b0edb9b885","abstract_canon_sha256":"908a9b07cd0e2be046e4f5dcd2ca68183d659e382d046b1c5d577d03123402b9"},"schema_version":"1.0"},"canonical_sha256":"9e753df335cc805169cbc7046e55c6fdb6c96a3cd7fd3502aa29e5b270713f6e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:16.431084Z","signature_b64":"WW3yOfBl5eR9sSKGhmwPyo5glgKz3dxOYUOrTJUmJFIEpzpNkxYi39auf6fQA5gwFrPLbCf/oEZq9vZJANUiCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e753df335cc805169cbc7046e55c6fdb6c96a3cd7fd3502aa29e5b270713f6e","last_reissued_at":"2026-05-18T00:39:16.430412Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:16.430412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.09349","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-18T00:39:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4vhyJnmbmqssANKKIJv28D0pzt7m3cx4ngKxy4x66YzMpMKXJy/wsGutMhWSg91RhN1kf5/nEf5LYhqJryX7Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:19:36.480862Z"},"content_sha256":"cf082444a9aaa3d0c51cdd5842acd12223eefa8296446f33e917f8a2cf69ba86","schema_version":"1.0","event_id":"sha256:cf082444a9aaa3d0c51cdd5842acd12223eefa8296446f33e917f8a2cf69ba86"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:TZ2T34ZVZSAFC2OLY4CG4VOG7W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Out-degree reducing partitions of digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Anders Yeo, Fr\\'ed\\'eric Havet, Joergen Bang-Jensen, St\\'ephane Bessy","submitted_at":"2017-07-28T17:45:33Z","abstract_excerpt":"Let $k$ be a fixed integer. We determine the complexity of finding a $p$-partition $(V_1, \\dots, V_p)$ of the vertex set of a given digraph such that the maximum out-degree of each of the digraphs induced by $V_i$, ($1\\leq i\\leq p$) is at least $k$ smaller than the maximum out-degree of $D$. We show that this problem is polynomial-time solvable when $p\\geq 2k$ and ${\\cal NP}$-complete otherwise. The result for $k=1$ and $p=2$ answers a question posed in \\cite{bangTCS636}. We also determine, for all fixed non-negative integers $k_1,k_2,p$, the complexity of deciding whether a given digraph of m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.09349","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-18T00:39:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bcYdP6IZqUQIBey4HNWqvq2PAMZZuYDrXZ1t/EX4LCvWvi0Ly8nYD1i98SovLwlEHV/kl9xE9sTXtZlrhlzOBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:19:36.481202Z"},"content_sha256":"602ecea02c8453a29628eb9163719eddc6e95c93bb18af8c41eb381ee92beaba","schema_version":"1.0","event_id":"sha256:602ecea02c8453a29628eb9163719eddc6e95c93bb18af8c41eb381ee92beaba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TZ2T34ZVZSAFC2OLY4CG4VOG7W/bundle.json","state_url":"https://pith.science/pith/TZ2T34ZVZSAFC2OLY4CG4VOG7W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TZ2T34ZVZSAFC2OLY4CG4VOG7W/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-01T08:19:36Z","links":{"resolver":"https://pith.science/pith/TZ2T34ZVZSAFC2OLY4CG4VOG7W","bundle":"https://pith.science/pith/TZ2T34ZVZSAFC2OLY4CG4VOG7W/bundle.json","state":"https://pith.science/pith/TZ2T34ZVZSAFC2OLY4CG4VOG7W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TZ2T34ZVZSAFC2OLY4CG4VOG7W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TZ2T34ZVZSAFC2OLY4CG4VOG7W","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":"908a9b07cd0e2be046e4f5dcd2ca68183d659e382d046b1c5d577d03123402b9","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-07-28T17:45:33Z","title_canon_sha256":"57f3eb86f8a6cf36282030d27b2ecd78f4a67323218e36b88ecd16b0edb9b885"},"schema_version":"1.0","source":{"id":"1707.09349","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.09349","created_at":"2026-05-18T00:39:16Z"},{"alias_kind":"arxiv_version","alias_value":"1707.09349v1","created_at":"2026-05-18T00:39:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.09349","created_at":"2026-05-18T00:39:16Z"},{"alias_kind":"pith_short_12","alias_value":"TZ2T34ZVZSAF","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TZ2T34ZVZSAFC2OL","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TZ2T34ZV","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:602ecea02c8453a29628eb9163719eddc6e95c93bb18af8c41eb381ee92beaba","target":"graph","created_at":"2026-05-18T00:39:16Z","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$ be a fixed integer. We determine the complexity of finding a $p$-partition $(V_1, \\dots, V_p)$ of the vertex set of a given digraph such that the maximum out-degree of each of the digraphs induced by $V_i$, ($1\\leq i\\leq p$) is at least $k$ smaller than the maximum out-degree of $D$. We show that this problem is polynomial-time solvable when $p\\geq 2k$ and ${\\cal NP}$-complete otherwise. The result for $k=1$ and $p=2$ answers a question posed in \\cite{bangTCS636}. We also determine, for all fixed non-negative integers $k_1,k_2,p$, the complexity of deciding whether a given digraph of m","authors_text":"Anders Yeo, Fr\\'ed\\'eric Havet, Joergen Bang-Jensen, St\\'ephane Bessy","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-07-28T17:45:33Z","title":"Out-degree reducing partitions of digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.09349","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:cf082444a9aaa3d0c51cdd5842acd12223eefa8296446f33e917f8a2cf69ba86","target":"record","created_at":"2026-05-18T00:39:16Z","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":"908a9b07cd0e2be046e4f5dcd2ca68183d659e382d046b1c5d577d03123402b9","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-07-28T17:45:33Z","title_canon_sha256":"57f3eb86f8a6cf36282030d27b2ecd78f4a67323218e36b88ecd16b0edb9b885"},"schema_version":"1.0","source":{"id":"1707.09349","kind":"arxiv","version":1}},"canonical_sha256":"9e753df335cc805169cbc7046e55c6fdb6c96a3cd7fd3502aa29e5b270713f6e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e753df335cc805169cbc7046e55c6fdb6c96a3cd7fd3502aa29e5b270713f6e","first_computed_at":"2026-05-18T00:39:16.430412Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:16.430412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WW3yOfBl5eR9sSKGhmwPyo5glgKz3dxOYUOrTJUmJFIEpzpNkxYi39auf6fQA5gwFrPLbCf/oEZq9vZJANUiCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:16.431084Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.09349","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf082444a9aaa3d0c51cdd5842acd12223eefa8296446f33e917f8a2cf69ba86","sha256:602ecea02c8453a29628eb9163719eddc6e95c93bb18af8c41eb381ee92beaba"],"state_sha256":"923535f1aced8a006dedb5f0eb35ec56cf751140f73f1ab4db5ce0827ca07933"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DFOEhyphRqznz602f6fWjzy+tkYX+DDdpOoyA+gnqwnjh4/VIEDXY65B+XYdbKDnaCptou0gTCvxhCZ9gt9xAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T08:19:36.483196Z","bundle_sha256":"7cd0bcdf66f065cd3ba6a80ebcf2d5fa120db02934ed68ef50c3ed4f248b3011"}}