{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:WUET4Z2NOE2UXJMNDDZP73EE45","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":"98035f5ad3713711f1b96a3895448074e2b6f90bb0be40245af707d0f9e06ee4","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-18T09:28:23Z","title_canon_sha256":"6b0f6575944a22f98715c31883f098898afe7ac4a020c586e27138b940a903e4"},"schema_version":"1.0","source":{"id":"1509.05559","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05559","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05559v1","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05559","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"pith_short_12","alias_value":"WUET4Z2NOE2U","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WUET4Z2NOE2UXJMN","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WUET4Z2N","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:11257cf8809422797397ff1ab47f7e7b5d3ac401284630c11daf95bdd85eaa22","target":"graph","created_at":"2026-05-18T01:32:42Z","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 consider the problem of finding, for two pairs $(s_1,t_1)$ and $(s_2,t_2)$ of vertices in an undirected graphs, an $(s_1,t_1)$-path $P_1$ and an $(s_2,t_2)$-path $P_2$ such that $P_1$ and $P_2$ share no edges and the length of each $P_i$ satisfies $L_i$, where $L_i \\in \\{ \\le k_i, \\; = k_i, \\; \\ge k_i, \\; \\le \\infty\\}$.\n  We regard $k_1$ and $k_2$ as parameters and investigate the parameterized complexity of the above problem when at least one of $P_1$ and $P_2$ has a length constraint (note that $L_i = \"\\le \\infty\"$ indicates that $P_i$ has no length constraint). For the nine different cas","authors_text":"Junjie Ye, Leizhen Cai","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-18T09:28:23Z","title":"Finding Two Edge-Disjoint Paths with Length Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05559","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:3d902cfd93bd30c75cde76a8c40954f76581988ae33e0328bf46dc0baeceea9b","target":"record","created_at":"2026-05-18T01:32:42Z","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":"98035f5ad3713711f1b96a3895448074e2b6f90bb0be40245af707d0f9e06ee4","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-18T09:28:23Z","title_canon_sha256":"6b0f6575944a22f98715c31883f098898afe7ac4a020c586e27138b940a903e4"},"schema_version":"1.0","source":{"id":"1509.05559","kind":"arxiv","version":1}},"canonical_sha256":"b5093e674d71354ba58d18f2ffec84e749bdbdeab8726fc038f541118071b66a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b5093e674d71354ba58d18f2ffec84e749bdbdeab8726fc038f541118071b66a","first_computed_at":"2026-05-18T01:32:42.857121Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:42.857121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VfGIikM1SPbOfT0K4MxxDH/ClaGWJ2ITnTdZ+7U0SOUXcBrS88KT4+Yy1ZkVgiS9QLASBVW8csxFudDW/LPfAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:42.857703Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.05559","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d902cfd93bd30c75cde76a8c40954f76581988ae33e0328bf46dc0baeceea9b","sha256:11257cf8809422797397ff1ab47f7e7b5d3ac401284630c11daf95bdd85eaa22"],"state_sha256":"7db8e5e48b58dfcb2e8956b45921c79efb6b5be0251c8d02d22a7e640c681331"}