{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JUKIELPOAAULFGL4G4AVD6ZEOR","short_pith_number":"pith:JUKIELPO","schema_version":"1.0","canonical_sha256":"4d14822dee0028b2997c370151fb24746f338c65fc74025db3231d59a1794c34","source":{"kind":"arxiv","id":"1711.00284","version":2},"attestation_state":"computed","paper":{"title":"Improved Approximation Schemes for the Restricted Shortest Path Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"David Holzm\\\"uller","submitted_at":"2017-11-01T10:55:17Z","abstract_excerpt":"The Restricted Shortest Path (RSP) problem, also known as the Delay-Constrained Least-Cost (DCLC) problem, is an NP-hard bicriteria optimization problem on graphs with $n$ vertices and $m$ edges. In a graph where each edge is assigned a cost and a delay, the goal is to find a min-cost path which does not exceed a delay bound. In this paper, we present improved approximation schemes for RSP on several graph classes. For planar graphs, undirected graphs with positive integer resource (= delay) values, and graphs with $m \\in \\Omega(n \\log n)$, we obtain $(1 + \\varepsilon)$-approximations in time "},"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":"1711.00284","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-01T10:55:17Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"dc81b91ce2c7efd8dd34e5c95c1beddbbcef1d8789b47d07f795ea4f86d9d1fc","abstract_canon_sha256":"603e2112a7be6c7aa23a20b682e22af99a6677d44c78e28ab9f3e843c37d4b1d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:16:29.671819Z","signature_b64":"xg7oTK1j5nReXwpo0rr7nu2o2EZLNrjvFuNF2paM5m8r1MunP/oNDvd9XlloIWXkKpeQ7xJo1khf4O6C2RFmCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d14822dee0028b2997c370151fb24746f338c65fc74025db3231d59a1794c34","last_reissued_at":"2026-07-05T00:16:29.671411Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:16:29.671411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Approximation Schemes for the Restricted Shortest Path Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"David Holzm\\\"uller","submitted_at":"2017-11-01T10:55:17Z","abstract_excerpt":"The Restricted Shortest Path (RSP) problem, also known as the Delay-Constrained Least-Cost (DCLC) problem, is an NP-hard bicriteria optimization problem on graphs with $n$ vertices and $m$ edges. In a graph where each edge is assigned a cost and a delay, the goal is to find a min-cost path which does not exceed a delay bound. In this paper, we present improved approximation schemes for RSP on several graph classes. For planar graphs, undirected graphs with positive integer resource (= delay) values, and graphs with $m \\in \\Omega(n \\log n)$, we obtain $(1 + \\varepsilon)$-approximations in time "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00284","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1711.00284/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1711.00284","created_at":"2026-07-05T00:16:29.671467+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.00284v2","created_at":"2026-07-05T00:16:29.671467+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00284","created_at":"2026-07-05T00:16:29.671467+00:00"},{"alias_kind":"pith_short_12","alias_value":"JUKIELPOAAUL","created_at":"2026-07-05T00:16:29.671467+00:00"},{"alias_kind":"pith_short_16","alias_value":"JUKIELPOAAULFGL4","created_at":"2026-07-05T00:16:29.671467+00:00"},{"alias_kind":"pith_short_8","alias_value":"JUKIELPO","created_at":"2026-07-05T00:16:29.671467+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.26882","citing_title":"Approximating the Network Design Problem for Potential-Based Flows","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JUKIELPOAAULFGL4G4AVD6ZEOR","json":"https://pith.science/pith/JUKIELPOAAULFGL4G4AVD6ZEOR.json","graph_json":"https://pith.science/api/pith-number/JUKIELPOAAULFGL4G4AVD6ZEOR/graph.json","events_json":"https://pith.science/api/pith-number/JUKIELPOAAULFGL4G4AVD6ZEOR/events.json","paper":"https://pith.science/paper/JUKIELPO"},"agent_actions":{"view_html":"https://pith.science/pith/JUKIELPOAAULFGL4G4AVD6ZEOR","download_json":"https://pith.science/pith/JUKIELPOAAULFGL4G4AVD6ZEOR.json","view_paper":"https://pith.science/paper/JUKIELPO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.00284&json=true","fetch_graph":"https://pith.science/api/pith-number/JUKIELPOAAULFGL4G4AVD6ZEOR/graph.json","fetch_events":"https://pith.science/api/pith-number/JUKIELPOAAULFGL4G4AVD6ZEOR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JUKIELPOAAULFGL4G4AVD6ZEOR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JUKIELPOAAULFGL4G4AVD6ZEOR/action/storage_attestation","attest_author":"https://pith.science/pith/JUKIELPOAAULFGL4G4AVD6ZEOR/action/author_attestation","sign_citation":"https://pith.science/pith/JUKIELPOAAULFGL4G4AVD6ZEOR/action/citation_signature","submit_replication":"https://pith.science/pith/JUKIELPOAAULFGL4G4AVD6ZEOR/action/replication_record"}},"created_at":"2026-07-05T00:16:29.671467+00:00","updated_at":"2026-07-05T00:16:29.671467+00:00"}