{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ETT33HS2I42M4ULUGQCPLHNFPL","short_pith_number":"pith:ETT33HS2","canonical_record":{"source":{"id":"1605.01866","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-06T09:21:02Z","cross_cats_sorted":[],"title_canon_sha256":"6c7d87ff9ebb0c129fdd89337781513acf1136b405ba535d15662ba35cb269dd","abstract_canon_sha256":"a46d0046f3c3ad851e0c3a11e260d1bd41915eb9a47989433f90f1a31dbc0f08"},"schema_version":"1.0"},"canonical_sha256":"24e7bd9e5a4734ce51743404f59da57afefebd629d4a9364dede6e66e4acfb3f","source":{"kind":"arxiv","id":"1605.01866","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.01866","created_at":"2026-05-18T01:15:31Z"},{"alias_kind":"arxiv_version","alias_value":"1605.01866v1","created_at":"2026-05-18T01:15:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01866","created_at":"2026-05-18T01:15:31Z"},{"alias_kind":"pith_short_12","alias_value":"ETT33HS2I42M","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"ETT33HS2I42M4ULU","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"ETT33HS2","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ETT33HS2I42M4ULUGQCPLHNFPL","target":"record","payload":{"canonical_record":{"source":{"id":"1605.01866","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-06T09:21:02Z","cross_cats_sorted":[],"title_canon_sha256":"6c7d87ff9ebb0c129fdd89337781513acf1136b405ba535d15662ba35cb269dd","abstract_canon_sha256":"a46d0046f3c3ad851e0c3a11e260d1bd41915eb9a47989433f90f1a31dbc0f08"},"schema_version":"1.0"},"canonical_sha256":"24e7bd9e5a4734ce51743404f59da57afefebd629d4a9364dede6e66e4acfb3f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:31.097470Z","signature_b64":"+IuYcndeJLVeSQxAfVQoBPW915ZX2iAUXCQ9LhQvtctR3poOA4ikxl/lE/IbDFcls4zTkAauNDePGKn2yVqaDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24e7bd9e5a4734ce51743404f59da57afefebd629d4a9364dede6e66e4acfb3f","last_reissued_at":"2026-05-18T01:15:31.096803Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:31.096803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.01866","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-18T01:15:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bcfpMsfGy0DW4dmdas/yG3bIQcpg6gwgEpI2vlrlx2t/ox0ekR2y1M17ysUVw6ZAf3R0h4/y5eRymPOhHkWOAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T08:08:21.552282Z"},"content_sha256":"b7328f4d4697796a7773365d48f43997a0aa206d7333e7d3b1eefcae39382cf5","schema_version":"1.0","event_id":"sha256:b7328f4d4697796a7773365d48f43997a0aa206d7333e7d3b1eefcae39382cf5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ETT33HS2I42M4ULUGQCPLHNFPL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Routing with Congestion in Acyclic Digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"D\\'aniel Marx, Roman Rabinovich, Saeed Akhoondian Amiri, Stephan Kreutzer","submitted_at":"2016-05-06T09:21:02Z","abstract_excerpt":"We study the version of the $k$-disjoint paths problem where $k$ demand pairs $(s_1,t_1)$, $\\dots$, $(s_k,t_k)$ are specified in the input and the paths in the solution are allowed to intersect, but such that no vertex is on more than $c$ paths. We show that on directed acyclic graphs the problem is solvable in time $n^{O(d)}$ if we allow congestion $k-d$ for $k$ paths. Furthermore, we show that, under a suitable complexity theoretic assumption, the problem cannot be solved in time $f(k)n^{o(d/\\log d)}$ for any computable function $f$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01866","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-18T01:15:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WaoSGtdQ+0VodCVeZmZqOwKRTCSFbevF2kfoejFzTir3jfHjzRKY9YnjT4cFnk4fHGJsekBGgve4SVFDpoL7CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T08:08:21.552879Z"},"content_sha256":"90ed9ff44ce4770e1c53671a14e31607a42b7a98b3e89c253729a68647903c6a","schema_version":"1.0","event_id":"sha256:90ed9ff44ce4770e1c53671a14e31607a42b7a98b3e89c253729a68647903c6a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ETT33HS2I42M4ULUGQCPLHNFPL/bundle.json","state_url":"https://pith.science/pith/ETT33HS2I42M4ULUGQCPLHNFPL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ETT33HS2I42M4ULUGQCPLHNFPL/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-19T08:08:21Z","links":{"resolver":"https://pith.science/pith/ETT33HS2I42M4ULUGQCPLHNFPL","bundle":"https://pith.science/pith/ETT33HS2I42M4ULUGQCPLHNFPL/bundle.json","state":"https://pith.science/pith/ETT33HS2I42M4ULUGQCPLHNFPL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ETT33HS2I42M4ULUGQCPLHNFPL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ETT33HS2I42M4ULUGQCPLHNFPL","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":"a46d0046f3c3ad851e0c3a11e260d1bd41915eb9a47989433f90f1a31dbc0f08","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-06T09:21:02Z","title_canon_sha256":"6c7d87ff9ebb0c129fdd89337781513acf1136b405ba535d15662ba35cb269dd"},"schema_version":"1.0","source":{"id":"1605.01866","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.01866","created_at":"2026-05-18T01:15:31Z"},{"alias_kind":"arxiv_version","alias_value":"1605.01866v1","created_at":"2026-05-18T01:15:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01866","created_at":"2026-05-18T01:15:31Z"},{"alias_kind":"pith_short_12","alias_value":"ETT33HS2I42M","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"ETT33HS2I42M4ULU","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"ETT33HS2","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:90ed9ff44ce4770e1c53671a14e31607a42b7a98b3e89c253729a68647903c6a","target":"graph","created_at":"2026-05-18T01:15:31Z","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":"We study the version of the $k$-disjoint paths problem where $k$ demand pairs $(s_1,t_1)$, $\\dots$, $(s_k,t_k)$ are specified in the input and the paths in the solution are allowed to intersect, but such that no vertex is on more than $c$ paths. We show that on directed acyclic graphs the problem is solvable in time $n^{O(d)}$ if we allow congestion $k-d$ for $k$ paths. Furthermore, we show that, under a suitable complexity theoretic assumption, the problem cannot be solved in time $f(k)n^{o(d/\\log d)}$ for any computable function $f$.","authors_text":"D\\'aniel Marx, Roman Rabinovich, Saeed Akhoondian Amiri, Stephan Kreutzer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-06T09:21:02Z","title":"Routing with Congestion in Acyclic Digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01866","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:b7328f4d4697796a7773365d48f43997a0aa206d7333e7d3b1eefcae39382cf5","target":"record","created_at":"2026-05-18T01:15:31Z","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":"a46d0046f3c3ad851e0c3a11e260d1bd41915eb9a47989433f90f1a31dbc0f08","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-06T09:21:02Z","title_canon_sha256":"6c7d87ff9ebb0c129fdd89337781513acf1136b405ba535d15662ba35cb269dd"},"schema_version":"1.0","source":{"id":"1605.01866","kind":"arxiv","version":1}},"canonical_sha256":"24e7bd9e5a4734ce51743404f59da57afefebd629d4a9364dede6e66e4acfb3f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"24e7bd9e5a4734ce51743404f59da57afefebd629d4a9364dede6e66e4acfb3f","first_computed_at":"2026-05-18T01:15:31.096803Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:31.096803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+IuYcndeJLVeSQxAfVQoBPW915ZX2iAUXCQ9LhQvtctR3poOA4ikxl/lE/IbDFcls4zTkAauNDePGKn2yVqaDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:31.097470Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.01866","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b7328f4d4697796a7773365d48f43997a0aa206d7333e7d3b1eefcae39382cf5","sha256:90ed9ff44ce4770e1c53671a14e31607a42b7a98b3e89c253729a68647903c6a"],"state_sha256":"a092c06acdb1ac5f489c4fa7b496bac3688d5caeec424a0eef77fbec29913827"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oMOme0hgVIzo8T/nwu8Ci+Ag/t8u0pqJvLO+FhFpmXrsHOQKLLQ0uZ+1NCDdRcCFaVjnFzXHxyKBXtaOc56WCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T08:08:21.555734Z","bundle_sha256":"0c3f1da50e4f3e3bb0d48764a65c259143738b7e952abb94b0494df2f3ce388f"}}