{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:D4XDDZNLOGWKAPSGJGBPMYYOAF","short_pith_number":"pith:D4XDDZNL","canonical_record":{"source":{"id":"1711.02076","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-06T18:43:18Z","cross_cats_sorted":[],"title_canon_sha256":"6cf29af92768dbb82a41af176c2cd68774b7a51033064e8ac2615676d9bef541","abstract_canon_sha256":"05ca50441346c12a7d85e79d9dab700cb011c7714ab4edbfd260f4c806282408"},"schema_version":"1.0"},"canonical_sha256":"1f2e31e5ab71aca03e464982f6630e0172b92f74e61601ad53ff5d2243118f4a","source":{"kind":"arxiv","id":"1711.02076","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.02076","created_at":"2026-05-18T00:31:14Z"},{"alias_kind":"arxiv_version","alias_value":"1711.02076v1","created_at":"2026-05-18T00:31:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02076","created_at":"2026-05-18T00:31:14Z"},{"alias_kind":"pith_short_12","alias_value":"D4XDDZNLOGWK","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"D4XDDZNLOGWKAPSG","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"D4XDDZNL","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:D4XDDZNLOGWKAPSGJGBPMYYOAF","target":"record","payload":{"canonical_record":{"source":{"id":"1711.02076","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-06T18:43:18Z","cross_cats_sorted":[],"title_canon_sha256":"6cf29af92768dbb82a41af176c2cd68774b7a51033064e8ac2615676d9bef541","abstract_canon_sha256":"05ca50441346c12a7d85e79d9dab700cb011c7714ab4edbfd260f4c806282408"},"schema_version":"1.0"},"canonical_sha256":"1f2e31e5ab71aca03e464982f6630e0172b92f74e61601ad53ff5d2243118f4a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:14.441593Z","signature_b64":"AJvUIWmYBoyljL4bUuL4GxCOQoHoAPqUAqdb5z+fGgK8DbJlA7S0r+QECsE6o3EV89gzyG9d6GCJiI4ZL3HNDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f2e31e5ab71aca03e464982f6630e0172b92f74e61601ad53ff5d2243118f4a","last_reissued_at":"2026-05-18T00:31:14.440970Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:14.440970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.02076","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:31:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uVg7NBHRr+3P5P41Iz7csgBhxQGYVKXheafHAjMAROFp+ms9o/M6agHx0m1eF7jUiQdRSqz+cWWxqMt4v9VLAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T18:55:08.617120Z"},"content_sha256":"130ef2da8244fd8160ca732789fdc43eaafd5613a325f7098d778909d44b0964","schema_version":"1.0","event_id":"sha256:130ef2da8244fd8160ca732789fdc43eaafd5613a325f7098d778909d44b0964"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:D4XDDZNLOGWKAPSGJGBPMYYOAF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Structural Parameterizations of the Edge Disjoint Paths Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"M. S. Ramanujan, Robert Ganian, Sebastian Ordyniak","submitted_at":"2017-11-06T18:43:18Z","abstract_excerpt":"In this paper we revisit 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 focus lies on structural parameterizations for the problem that allow for efficient (polynomial-time or fpt) algorithms. As our first result, we answer an open question stated in Fleszar, Mnich, and Spoerhase (2016), by showing that the problem can be solved in polynomial time if the input graph has a feedback vertex set of size one. We also show"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02076","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:31:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x0TuF8q8hzT1YpHInS2G8mMUzRHIjkurLpNXbfkWUB5etySbPgSjYxRyG1W3SyrnRbzutUUPNFPefbUuys/vCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T18:55:08.617473Z"},"content_sha256":"c826e8a3322dcad7778a83efdd6046acb3363284a93371bdc4736f6c78fe5c81","schema_version":"1.0","event_id":"sha256:c826e8a3322dcad7778a83efdd6046acb3363284a93371bdc4736f6c78fe5c81"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D4XDDZNLOGWKAPSGJGBPMYYOAF/bundle.json","state_url":"https://pith.science/pith/D4XDDZNLOGWKAPSGJGBPMYYOAF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D4XDDZNLOGWKAPSGJGBPMYYOAF/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-20T18:55:08Z","links":{"resolver":"https://pith.science/pith/D4XDDZNLOGWKAPSGJGBPMYYOAF","bundle":"https://pith.science/pith/D4XDDZNLOGWKAPSGJGBPMYYOAF/bundle.json","state":"https://pith.science/pith/D4XDDZNLOGWKAPSGJGBPMYYOAF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D4XDDZNLOGWKAPSGJGBPMYYOAF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:D4XDDZNLOGWKAPSGJGBPMYYOAF","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":"05ca50441346c12a7d85e79d9dab700cb011c7714ab4edbfd260f4c806282408","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-06T18:43:18Z","title_canon_sha256":"6cf29af92768dbb82a41af176c2cd68774b7a51033064e8ac2615676d9bef541"},"schema_version":"1.0","source":{"id":"1711.02076","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.02076","created_at":"2026-05-18T00:31:14Z"},{"alias_kind":"arxiv_version","alias_value":"1711.02076v1","created_at":"2026-05-18T00:31:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02076","created_at":"2026-05-18T00:31:14Z"},{"alias_kind":"pith_short_12","alias_value":"D4XDDZNLOGWK","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"D4XDDZNLOGWKAPSG","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"D4XDDZNL","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:c826e8a3322dcad7778a83efdd6046acb3363284a93371bdc4736f6c78fe5c81","target":"graph","created_at":"2026-05-18T00:31:14Z","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":"In this paper we revisit 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 focus lies on structural parameterizations for the problem that allow for efficient (polynomial-time or fpt) algorithms. As our first result, we answer an open question stated in Fleszar, Mnich, and Spoerhase (2016), by showing that the problem can be solved in polynomial time if the input graph has a feedback vertex set of size one. We also show","authors_text":"M. S. Ramanujan, Robert Ganian, Sebastian Ordyniak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-06T18:43:18Z","title":"On Structural Parameterizations of the Edge Disjoint Paths Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02076","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:130ef2da8244fd8160ca732789fdc43eaafd5613a325f7098d778909d44b0964","target":"record","created_at":"2026-05-18T00:31:14Z","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":"05ca50441346c12a7d85e79d9dab700cb011c7714ab4edbfd260f4c806282408","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-06T18:43:18Z","title_canon_sha256":"6cf29af92768dbb82a41af176c2cd68774b7a51033064e8ac2615676d9bef541"},"schema_version":"1.0","source":{"id":"1711.02076","kind":"arxiv","version":1}},"canonical_sha256":"1f2e31e5ab71aca03e464982f6630e0172b92f74e61601ad53ff5d2243118f4a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f2e31e5ab71aca03e464982f6630e0172b92f74e61601ad53ff5d2243118f4a","first_computed_at":"2026-05-18T00:31:14.440970Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:14.440970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AJvUIWmYBoyljL4bUuL4GxCOQoHoAPqUAqdb5z+fGgK8DbJlA7S0r+QECsE6o3EV89gzyG9d6GCJiI4ZL3HNDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:14.441593Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.02076","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:130ef2da8244fd8160ca732789fdc43eaafd5613a325f7098d778909d44b0964","sha256:c826e8a3322dcad7778a83efdd6046acb3363284a93371bdc4736f6c78fe5c81"],"state_sha256":"e6d8e8d886bba2780633bcf0c07a49a42e84fe988c318fd6c32bcca02653ea50"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7rKlVUiHbs9Bs/h8MBBfBiLGzqnsNSCbtvt44JzmY+xOpipAYbh36E0jO2txe67Y5reqVcCcgeXGHR5l2wdVAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T18:55:08.619435Z","bundle_sha256":"4f4c2d135dd3e5f0060aaa474be8402e59287336f28f0d80403d6fb1ff393e58"}}