{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:VLUBKBIRXGR7HQ5AWHY7EYSHGA","short_pith_number":"pith:VLUBKBIR","canonical_record":{"source":{"id":"1808.03496","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-10T11:48:30Z","cross_cats_sorted":[],"title_canon_sha256":"f06b048fa6b383223f9a260c17849b25f8347ee61971e0061dd3985927b7c090","abstract_canon_sha256":"b35212d402d40f8f9679eb9e5e29f8094f4db0d9adb0bb06dfd8bd55e2b753f6"},"schema_version":"1.0"},"canonical_sha256":"aae8150511b9a3f3c3a0b1f1f2624730336abc9131a8e2e91ecec8f9c39e828f","source":{"kind":"arxiv","id":"1808.03496","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.03496","created_at":"2026-05-18T00:08:24Z"},{"alias_kind":"arxiv_version","alias_value":"1808.03496v1","created_at":"2026-05-18T00:08:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03496","created_at":"2026-05-18T00:08:24Z"},{"alias_kind":"pith_short_12","alias_value":"VLUBKBIRXGR7","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VLUBKBIRXGR7HQ5A","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VLUBKBIR","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:VLUBKBIRXGR7HQ5AWHY7EYSHGA","target":"record","payload":{"canonical_record":{"source":{"id":"1808.03496","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-10T11:48:30Z","cross_cats_sorted":[],"title_canon_sha256":"f06b048fa6b383223f9a260c17849b25f8347ee61971e0061dd3985927b7c090","abstract_canon_sha256":"b35212d402d40f8f9679eb9e5e29f8094f4db0d9adb0bb06dfd8bd55e2b753f6"},"schema_version":"1.0"},"canonical_sha256":"aae8150511b9a3f3c3a0b1f1f2624730336abc9131a8e2e91ecec8f9c39e828f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:24.863474Z","signature_b64":"xH2E8JIVO+J+GN10mz6S6gMPpImcXbsc7HYY+a9VjkwJlkKUeIbuUczKxyVgxsOndx4ZzOy7nHQWU4noowBUCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aae8150511b9a3f3c3a0b1f1f2624730336abc9131a8e2e91ecec8f9c39e828f","last_reissued_at":"2026-05-18T00:08:24.862918Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:24.862918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.03496","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:08:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kmAF7OjdJpanZL+h+IcXAnHfuieJtZFDlVVIVW8uTrMjNIz4KC/m14paOJX1YVPs5cAMEdts5bSNj5AsZVqECA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T17:00:09.246807Z"},"content_sha256":"e5e13191dc0652d15358e34fa598b24ded27abb0feaa955a1caa4353ce02849f","schema_version":"1.0","event_id":"sha256:e5e13191dc0652d15358e34fa598b24ded27abb0feaa955a1caa4353ce02849f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:VLUBKBIRXGR7HQ5AWHY7EYSHGA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Power of Cut-Based Parameters for Computing Edge Disjoint Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Robert Ganian, Sebastian Ordyniak","submitted_at":"2018-08-10T11:48:30Z","abstract_excerpt":"This paper revisits the classical Edge Disjoint Paths (EDP) problem, where one is given an undirected graph $G$ and a set of terminal pairs $P$ and asks whether $G$ contains a set of pairwise edge-disjoint paths connecting every terminal pair in $P$. Our aim is to identify structural properties (parameters) of graphs which allow the efficient solution of EDP without restricting the placement of terminals in $P$ in any way. In this setting, EDP is known to remain NP-hard even on extremely restricted graph classes, such as graphs with a vertex cover of size $3$.\n  We present three results which "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03496","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:08:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BM7vBItnY2EOeWJqByiaDRpDacpEyiSqrrjEvxnpmHRJakrVOhG4e+tk4SK9BroDpKyubDuRzSTLugVtePeTBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T17:00:09.247157Z"},"content_sha256":"913b590c39f001085591ce0963cc13fe92ea07e73e8f98322ad130ee673357f7","schema_version":"1.0","event_id":"sha256:913b590c39f001085591ce0963cc13fe92ea07e73e8f98322ad130ee673357f7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VLUBKBIRXGR7HQ5AWHY7EYSHGA/bundle.json","state_url":"https://pith.science/pith/VLUBKBIRXGR7HQ5AWHY7EYSHGA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VLUBKBIRXGR7HQ5AWHY7EYSHGA/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-27T17:00:09Z","links":{"resolver":"https://pith.science/pith/VLUBKBIRXGR7HQ5AWHY7EYSHGA","bundle":"https://pith.science/pith/VLUBKBIRXGR7HQ5AWHY7EYSHGA/bundle.json","state":"https://pith.science/pith/VLUBKBIRXGR7HQ5AWHY7EYSHGA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VLUBKBIRXGR7HQ5AWHY7EYSHGA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VLUBKBIRXGR7HQ5AWHY7EYSHGA","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":"b35212d402d40f8f9679eb9e5e29f8094f4db0d9adb0bb06dfd8bd55e2b753f6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-10T11:48:30Z","title_canon_sha256":"f06b048fa6b383223f9a260c17849b25f8347ee61971e0061dd3985927b7c090"},"schema_version":"1.0","source":{"id":"1808.03496","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.03496","created_at":"2026-05-18T00:08:24Z"},{"alias_kind":"arxiv_version","alias_value":"1808.03496v1","created_at":"2026-05-18T00:08:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03496","created_at":"2026-05-18T00:08:24Z"},{"alias_kind":"pith_short_12","alias_value":"VLUBKBIRXGR7","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VLUBKBIRXGR7HQ5A","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VLUBKBIR","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:913b590c39f001085591ce0963cc13fe92ea07e73e8f98322ad130ee673357f7","target":"graph","created_at":"2026-05-18T00:08:24Z","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":"This paper revisits the classical Edge Disjoint Paths (EDP) problem, where one is given an undirected graph $G$ and a set of terminal pairs $P$ and asks whether $G$ contains a set of pairwise edge-disjoint paths connecting every terminal pair in $P$. Our aim is to identify structural properties (parameters) of graphs which allow the efficient solution of EDP without restricting the placement of terminals in $P$ in any way. In this setting, EDP is known to remain NP-hard even on extremely restricted graph classes, such as graphs with a vertex cover of size $3$.\n  We present three results which ","authors_text":"Robert Ganian, Sebastian Ordyniak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-10T11:48:30Z","title":"The Power of Cut-Based Parameters for Computing Edge Disjoint Paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03496","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:e5e13191dc0652d15358e34fa598b24ded27abb0feaa955a1caa4353ce02849f","target":"record","created_at":"2026-05-18T00:08:24Z","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":"b35212d402d40f8f9679eb9e5e29f8094f4db0d9adb0bb06dfd8bd55e2b753f6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-10T11:48:30Z","title_canon_sha256":"f06b048fa6b383223f9a260c17849b25f8347ee61971e0061dd3985927b7c090"},"schema_version":"1.0","source":{"id":"1808.03496","kind":"arxiv","version":1}},"canonical_sha256":"aae8150511b9a3f3c3a0b1f1f2624730336abc9131a8e2e91ecec8f9c39e828f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aae8150511b9a3f3c3a0b1f1f2624730336abc9131a8e2e91ecec8f9c39e828f","first_computed_at":"2026-05-18T00:08:24.862918Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:24.862918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xH2E8JIVO+J+GN10mz6S6gMPpImcXbsc7HYY+a9VjkwJlkKUeIbuUczKxyVgxsOndx4ZzOy7nHQWU4noowBUCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:24.863474Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.03496","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e5e13191dc0652d15358e34fa598b24ded27abb0feaa955a1caa4353ce02849f","sha256:913b590c39f001085591ce0963cc13fe92ea07e73e8f98322ad130ee673357f7"],"state_sha256":"91cbe78704e576e1b63c1c2b41d79d6017d5194d078f1fa9f93a0c29cdce83e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p3fow8RyaAaS4cWBNZgw3eED1BRpBcDmGuM8cUhiAMbx6xEQJ/zJN6UQlphSh/pCf8f8YvkBXHdvNOeyd5dcAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T17:00:09.249117Z","bundle_sha256":"db71d476e98850866db20a17e834b7784d94fb5321caaa723e8dd1c3ecc66d26"}}