{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:WUET4Z2NOE2UXJMNDDZP73EE45","short_pith_number":"pith:WUET4Z2N","schema_version":"1.0","canonical_sha256":"b5093e674d71354ba58d18f2ffec84e749bdbdeab8726fc038f541118071b66a","source":{"kind":"arxiv","id":"1509.05559","version":1},"attestation_state":"computed","paper":{"title":"Finding Two Edge-Disjoint Paths with Length Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Junjie Ye, Leizhen Cai","submitted_at":"2015-09-18T09:28:23Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1509.05559","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-18T09:28:23Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"6b0f6575944a22f98715c31883f098898afe7ac4a020c586e27138b940a903e4","abstract_canon_sha256":"98035f5ad3713711f1b96a3895448074e2b6f90bb0be40245af707d0f9e06ee4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:42.857703Z","signature_b64":"VfGIikM1SPbOfT0K4MxxDH/ClaGWJ2ITnTdZ+7U0SOUXcBrS88KT4+Yy1ZkVgiS9QLASBVW8csxFudDW/LPfAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5093e674d71354ba58d18f2ffec84e749bdbdeab8726fc038f541118071b66a","last_reissued_at":"2026-05-18T01:32:42.857121Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:42.857121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding Two Edge-Disjoint Paths with Length Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Junjie Ye, Leizhen Cai","submitted_at":"2015-09-18T09:28:23Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05559","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1509.05559","created_at":"2026-05-18T01:32:42.857200+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.05559v1","created_at":"2026-05-18T01:32:42.857200+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05559","created_at":"2026-05-18T01:32:42.857200+00:00"},{"alias_kind":"pith_short_12","alias_value":"WUET4Z2NOE2U","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"WUET4Z2NOE2UXJMN","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"WUET4Z2N","created_at":"2026-05-18T12:29:47.479230+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WUET4Z2NOE2UXJMNDDZP73EE45","json":"https://pith.science/pith/WUET4Z2NOE2UXJMNDDZP73EE45.json","graph_json":"https://pith.science/api/pith-number/WUET4Z2NOE2UXJMNDDZP73EE45/graph.json","events_json":"https://pith.science/api/pith-number/WUET4Z2NOE2UXJMNDDZP73EE45/events.json","paper":"https://pith.science/paper/WUET4Z2N"},"agent_actions":{"view_html":"https://pith.science/pith/WUET4Z2NOE2UXJMNDDZP73EE45","download_json":"https://pith.science/pith/WUET4Z2NOE2UXJMNDDZP73EE45.json","view_paper":"https://pith.science/paper/WUET4Z2N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.05559&json=true","fetch_graph":"https://pith.science/api/pith-number/WUET4Z2NOE2UXJMNDDZP73EE45/graph.json","fetch_events":"https://pith.science/api/pith-number/WUET4Z2NOE2UXJMNDDZP73EE45/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WUET4Z2NOE2UXJMNDDZP73EE45/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WUET4Z2NOE2UXJMNDDZP73EE45/action/storage_attestation","attest_author":"https://pith.science/pith/WUET4Z2NOE2UXJMNDDZP73EE45/action/author_attestation","sign_citation":"https://pith.science/pith/WUET4Z2NOE2UXJMNDDZP73EE45/action/citation_signature","submit_replication":"https://pith.science/pith/WUET4Z2NOE2UXJMNDDZP73EE45/action/replication_record"}},"created_at":"2026-05-18T01:32:42.857200+00:00","updated_at":"2026-05-18T01:32:42.857200+00:00"}