{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6GGY5W7IHMKVQSJUENFP7AZ3C4","short_pith_number":"pith:6GGY5W7I","canonical_record":{"source":{"id":"1611.09296","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-28T19:25:04Z","cross_cats_sorted":["cs.CC","cs.DM","cs.NI","math.CO"],"title_canon_sha256":"adbccebf1fd53f74455932a9a94512bd76c06b12b65645b998d7586d230e102b","abstract_canon_sha256":"815e96fc9f0acef77b7155a7b77cb074c6c39f812f85614f3988ec21b7c9627b"},"schema_version":"1.0"},"canonical_sha256":"f18d8edbe83b15584934234aff833b1713f99d68ef2e10fc65f670eb4551dca4","source":{"kind":"arxiv","id":"1611.09296","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.09296","created_at":"2026-05-18T00:39:18Z"},{"alias_kind":"arxiv_version","alias_value":"1611.09296v3","created_at":"2026-05-18T00:39:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09296","created_at":"2026-05-18T00:39:18Z"},{"alias_kind":"pith_short_12","alias_value":"6GGY5W7IHMKV","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6GGY5W7IHMKVQSJU","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6GGY5W7I","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6GGY5W7IHMKVQSJUENFP7AZ3C4","target":"record","payload":{"canonical_record":{"source":{"id":"1611.09296","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-28T19:25:04Z","cross_cats_sorted":["cs.CC","cs.DM","cs.NI","math.CO"],"title_canon_sha256":"adbccebf1fd53f74455932a9a94512bd76c06b12b65645b998d7586d230e102b","abstract_canon_sha256":"815e96fc9f0acef77b7155a7b77cb074c6c39f812f85614f3988ec21b7c9627b"},"schema_version":"1.0"},"canonical_sha256":"f18d8edbe83b15584934234aff833b1713f99d68ef2e10fc65f670eb4551dca4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:18.126384Z","signature_b64":"El95kJIMUxTAwB9l5B5+rxqPNzhAic84Oh8ZeP0f2ZeXl2KnXE+cJM7RfABVdiGw9fmHsZvnLP4iVK2FJoxOCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f18d8edbe83b15584934234aff833b1713f99d68ef2e10fc65f670eb4551dca4","last_reissued_at":"2026-05-18T00:39:18.125832Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:18.125832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.09296","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-18T00:39:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GKA/nUUciOHngWelOLVpoQMJpjriQUkWH3Y/sZfR7GR0gUgldii0LcEjme5N0eSxbdLx+ngADsnEpEAnQ8oSBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:59:36.561474Z"},"content_sha256":"da60b4832e8dc428c514adc03a95e797e3e932ba56124924f185362bf47ae095","schema_version":"1.0","event_id":"sha256:da60b4832e8dc428c514adc03a95e797e3e932ba56124924f185362bf47ae095"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6GGY5W7IHMKVQSJUENFP7AZ3C4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Congestion-Free Rerouting of Flows on DAGs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","cs.NI","math.CO"],"primary_cat":"cs.DS","authors_text":"Saeed Akhoondian Amiri, Sebastian Wiederrecht, Stefan Schmid, Szymon Dudycz","submitted_at":"2016-11-28T19:25:04Z","abstract_excerpt":"Changing a given configuration in a graph into another one is known as a re- configuration problem. Such problems have recently received much interest in the context of algorithmic graph theory. We initiate the theoretical study of the following reconfiguration problem: How to reroute $k$ unsplittable flows of a certain demand in a capacitated network from their current paths to their respective new paths, in a congestion-free manner? This problem finds immediate applications, e.g., in traffic engineering in computer networks. We show that the problem is generally NP-hard already for $k = 2$ f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09296","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-18T00:39:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U1FX8MBqVKnXYX1SO7JngAF509BVoxyItkwQjd4mVPTAhDZA0ICtm8fMW1HFuYsAZJnIl9Ql2q0tvggU9EzbAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:59:36.562107Z"},"content_sha256":"48adec831e4963ab196bbe6a408d56b75d9b9708f1b5e624736dd04f661e45b1","schema_version":"1.0","event_id":"sha256:48adec831e4963ab196bbe6a408d56b75d9b9708f1b5e624736dd04f661e45b1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6GGY5W7IHMKVQSJUENFP7AZ3C4/bundle.json","state_url":"https://pith.science/pith/6GGY5W7IHMKVQSJUENFP7AZ3C4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6GGY5W7IHMKVQSJUENFP7AZ3C4/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-27T08:59:36Z","links":{"resolver":"https://pith.science/pith/6GGY5W7IHMKVQSJUENFP7AZ3C4","bundle":"https://pith.science/pith/6GGY5W7IHMKVQSJUENFP7AZ3C4/bundle.json","state":"https://pith.science/pith/6GGY5W7IHMKVQSJUENFP7AZ3C4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6GGY5W7IHMKVQSJUENFP7AZ3C4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6GGY5W7IHMKVQSJUENFP7AZ3C4","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":"815e96fc9f0acef77b7155a7b77cb074c6c39f812f85614f3988ec21b7c9627b","cross_cats_sorted":["cs.CC","cs.DM","cs.NI","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-28T19:25:04Z","title_canon_sha256":"adbccebf1fd53f74455932a9a94512bd76c06b12b65645b998d7586d230e102b"},"schema_version":"1.0","source":{"id":"1611.09296","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.09296","created_at":"2026-05-18T00:39:18Z"},{"alias_kind":"arxiv_version","alias_value":"1611.09296v3","created_at":"2026-05-18T00:39:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09296","created_at":"2026-05-18T00:39:18Z"},{"alias_kind":"pith_short_12","alias_value":"6GGY5W7IHMKV","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6GGY5W7IHMKVQSJU","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6GGY5W7I","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:48adec831e4963ab196bbe6a408d56b75d9b9708f1b5e624736dd04f661e45b1","target":"graph","created_at":"2026-05-18T00:39:18Z","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":"Changing a given configuration in a graph into another one is known as a re- configuration problem. Such problems have recently received much interest in the context of algorithmic graph theory. We initiate the theoretical study of the following reconfiguration problem: How to reroute $k$ unsplittable flows of a certain demand in a capacitated network from their current paths to their respective new paths, in a congestion-free manner? This problem finds immediate applications, e.g., in traffic engineering in computer networks. We show that the problem is generally NP-hard already for $k = 2$ f","authors_text":"Saeed Akhoondian Amiri, Sebastian Wiederrecht, Stefan Schmid, Szymon Dudycz","cross_cats":["cs.CC","cs.DM","cs.NI","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-28T19:25:04Z","title":"Congestion-Free Rerouting of Flows on DAGs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09296","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:da60b4832e8dc428c514adc03a95e797e3e932ba56124924f185362bf47ae095","target":"record","created_at":"2026-05-18T00:39:18Z","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":"815e96fc9f0acef77b7155a7b77cb074c6c39f812f85614f3988ec21b7c9627b","cross_cats_sorted":["cs.CC","cs.DM","cs.NI","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-28T19:25:04Z","title_canon_sha256":"adbccebf1fd53f74455932a9a94512bd76c06b12b65645b998d7586d230e102b"},"schema_version":"1.0","source":{"id":"1611.09296","kind":"arxiv","version":3}},"canonical_sha256":"f18d8edbe83b15584934234aff833b1713f99d68ef2e10fc65f670eb4551dca4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f18d8edbe83b15584934234aff833b1713f99d68ef2e10fc65f670eb4551dca4","first_computed_at":"2026-05-18T00:39:18.125832Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:18.125832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"El95kJIMUxTAwB9l5B5+rxqPNzhAic84Oh8ZeP0f2ZeXl2KnXE+cJM7RfABVdiGw9fmHsZvnLP4iVK2FJoxOCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:18.126384Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.09296","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da60b4832e8dc428c514adc03a95e797e3e932ba56124924f185362bf47ae095","sha256:48adec831e4963ab196bbe6a408d56b75d9b9708f1b5e624736dd04f661e45b1"],"state_sha256":"2ce470558e284c736f11b88329cb050086f34ac82966601229a472d6f42e0fa1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BQPkN2TCYD3bBxD+6awdh/YuljSmiqPe3dkIIWVZprXmA7efhJXNY8wt0b/FznipUPwAWuj6A9FLzJIRe0ChCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T08:59:36.565520Z","bundle_sha256":"2c8349f98db9e169cbfa5b1155d564eaf3b88fc79e92e9c5cbbabf9beca5f594"}}