{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JUKIELPOAAULFGL4G4AVD6ZEOR","short_pith_number":"pith:JUKIELPO","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"},"canonical_sha256":"4d14822dee0028b2997c370151fb24746f338c65fc74025db3231d59a1794c34","source":{"kind":"arxiv","id":"1711.00284","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.00284","created_at":"2026-07-05T00:16:29Z"},{"alias_kind":"arxiv_version","alias_value":"1711.00284v2","created_at":"2026-07-05T00:16:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00284","created_at":"2026-07-05T00:16:29Z"},{"alias_kind":"pith_short_12","alias_value":"JUKIELPOAAUL","created_at":"2026-07-05T00:16:29Z"},{"alias_kind":"pith_short_16","alias_value":"JUKIELPOAAULFGL4","created_at":"2026-07-05T00:16:29Z"},{"alias_kind":"pith_short_8","alias_value":"JUKIELPO","created_at":"2026-07-05T00:16:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JUKIELPOAAULFGL4G4AVD6ZEOR","target":"record","payload":{"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"},"canonical_sha256":"4d14822dee0028b2997c370151fb24746f338c65fc74025db3231d59a1794c34","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"},"source_kind":"arxiv","source_id":"1711.00284","source_version":2,"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-07-05T00:16:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HMlTnIg9nqfVTYG4OjifcgPRu7auF9eptzvdGGKLaAnBOZUrzaslgA6lXmXN5DVTZYlEtmaYR7lBjgVlEDkTCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T10:43:42.337989Z"},"content_sha256":"6a69c83212ed64c80bb280e9fc6735b00f4c0dc05b791a3716a2f2a96504677e","schema_version":"1.0","event_id":"sha256:6a69c83212ed64c80bb280e9fc6735b00f4c0dc05b791a3716a2f2a96504677e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JUKIELPOAAULFGL4G4AVD6ZEOR","target":"graph","payload":{"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"},"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-07-05T00:16:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ib61u+H2nh9eWadVaWYY22ctRYK2M/nhxPMGctIlfZxYpYa4m+APWnaB0j1xs/3WlwSJXb0A4AceY+RqjObCBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T10:43:42.338503Z"},"content_sha256":"0c47c1d49d83ce211a8d892013071f623c8f408b6b8709b6be19fa1423aa8e50","schema_version":"1.0","event_id":"sha256:0c47c1d49d83ce211a8d892013071f623c8f408b6b8709b6be19fa1423aa8e50"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JUKIELPOAAULFGL4G4AVD6ZEOR/bundle.json","state_url":"https://pith.science/pith/JUKIELPOAAULFGL4G4AVD6ZEOR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JUKIELPOAAULFGL4G4AVD6ZEOR/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-08-11T10:43:42Z","links":{"resolver":"https://pith.science/pith/JUKIELPOAAULFGL4G4AVD6ZEOR","bundle":"https://pith.science/pith/JUKIELPOAAULFGL4G4AVD6ZEOR/bundle.json","state":"https://pith.science/pith/JUKIELPOAAULFGL4G4AVD6ZEOR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JUKIELPOAAULFGL4G4AVD6ZEOR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JUKIELPOAAULFGL4G4AVD6ZEOR","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":"603e2112a7be6c7aa23a20b682e22af99a6677d44c78e28ab9f3e843c37d4b1d","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-01T10:55:17Z","title_canon_sha256":"dc81b91ce2c7efd8dd34e5c95c1beddbbcef1d8789b47d07f795ea4f86d9d1fc"},"schema_version":"1.0","source":{"id":"1711.00284","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.00284","created_at":"2026-07-05T00:16:29Z"},{"alias_kind":"arxiv_version","alias_value":"1711.00284v2","created_at":"2026-07-05T00:16:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00284","created_at":"2026-07-05T00:16:29Z"},{"alias_kind":"pith_short_12","alias_value":"JUKIELPOAAUL","created_at":"2026-07-05T00:16:29Z"},{"alias_kind":"pith_short_16","alias_value":"JUKIELPOAAULFGL4","created_at":"2026-07-05T00:16:29Z"},{"alias_kind":"pith_short_8","alias_value":"JUKIELPO","created_at":"2026-07-05T00:16:29Z"}],"graph_snapshots":[{"event_id":"sha256:0c47c1d49d83ce211a8d892013071f623c8f408b6b8709b6be19fa1423aa8e50","target":"graph","created_at":"2026-07-05T00:16:29Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1711.00284/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"David Holzm\\\"uller","cross_cats":["cs.CC","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-01T10:55:17Z","title":"Improved Approximation Schemes for the Restricted Shortest Path Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00284","kind":"arxiv","version":2},"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:6a69c83212ed64c80bb280e9fc6735b00f4c0dc05b791a3716a2f2a96504677e","target":"record","created_at":"2026-07-05T00:16:29Z","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":"603e2112a7be6c7aa23a20b682e22af99a6677d44c78e28ab9f3e843c37d4b1d","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-01T10:55:17Z","title_canon_sha256":"dc81b91ce2c7efd8dd34e5c95c1beddbbcef1d8789b47d07f795ea4f86d9d1fc"},"schema_version":"1.0","source":{"id":"1711.00284","kind":"arxiv","version":2}},"canonical_sha256":"4d14822dee0028b2997c370151fb24746f338c65fc74025db3231d59a1794c34","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4d14822dee0028b2997c370151fb24746f338c65fc74025db3231d59a1794c34","first_computed_at":"2026-07-05T00:16:29.671411Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:16:29.671411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xg7oTK1j5nReXwpo0rr7nu2o2EZLNrjvFuNF2paM5m8r1MunP/oNDvd9XlloIWXkKpeQ7xJo1khf4O6C2RFmCg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:16:29.671819Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.00284","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a69c83212ed64c80bb280e9fc6735b00f4c0dc05b791a3716a2f2a96504677e","sha256:0c47c1d49d83ce211a8d892013071f623c8f408b6b8709b6be19fa1423aa8e50"],"state_sha256":"28d1feba3263ff48b89e81257fd9c36054280f0e4be27cac2ce48a4c8628b995"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TQukVBpBwmvOe5m387KMbw7mravIlSL8Mf95niaq6NnkOr958ahAY0oB48O80XtLKsSlFSnun96Ty6Xqsvr6CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T10:43:42.344398Z","bundle_sha256":"bf2961395c3a9f73d7fd7a5cfa501d8e483502aa85253b641d98c3975dcadf12"}}