{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:APITU2AMYHKA6EIFMLO3HLD2OA","short_pith_number":"pith:APITU2AM","schema_version":"1.0","canonical_sha256":"03d13a680cc1d40f110562ddb3ac7a7023e64366f82ea871253ecc05313e6d72","source":{"kind":"arxiv","id":"1708.01335","version":1},"attestation_state":"computed","paper":{"title":"Compact, Provably-Good LPs for Orienteering and Regret-Bounded Vehicle Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chaitanya Swamy, Zachary Friggstad","submitted_at":"2017-08-04T00:06:38Z","abstract_excerpt":"We develop polynomial-size LP-relaxations for {\\em orienteering} and the {\\em regret-bounded vehicle routing problem} (\\rvrp) and devise suitable LP-rounding algorithms that lead to various new insights and approximation results for these problems. In orienteering, the goal is to find a maximum-reward $r$-rooted path, possibly ending at a specified node, of length at most some given budget $B$. In \\rvrp, the goal is to find the minimum number of $r$-rooted paths of {\\em regret} at most a given bound $R$ that cover all nodes, where the regret of an $r$-$v$ path is its length $-$ $c_{rv}$.\n  For"},"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":"1708.01335","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-04T00:06:38Z","cross_cats_sorted":[],"title_canon_sha256":"757e99f9dd4e53749721b6cbcfecb611580edc85239a59733f5bed26fd30d574","abstract_canon_sha256":"2c0637e98d75bcb1690fbb6fb5f807bfb1a8061100b4311b28f2a9c3fb86879e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:37.646049Z","signature_b64":"/r8o7r7LuYQznzCAuDzekM/tgW0ohyffnEN9lNbxR8ViivDoxzNlYA3v2WTCqYY9LjV1Px/X+WFZPVxQeL7dCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03d13a680cc1d40f110562ddb3ac7a7023e64366f82ea871253ecc05313e6d72","last_reissued_at":"2026-05-18T00:38:37.645486Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:37.645486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compact, Provably-Good LPs for Orienteering and Regret-Bounded Vehicle Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chaitanya Swamy, Zachary Friggstad","submitted_at":"2017-08-04T00:06:38Z","abstract_excerpt":"We develop polynomial-size LP-relaxations for {\\em orienteering} and the {\\em regret-bounded vehicle routing problem} (\\rvrp) and devise suitable LP-rounding algorithms that lead to various new insights and approximation results for these problems. In orienteering, the goal is to find a maximum-reward $r$-rooted path, possibly ending at a specified node, of length at most some given budget $B$. In \\rvrp, the goal is to find the minimum number of $r$-rooted paths of {\\em regret} at most a given bound $R$ that cover all nodes, where the regret of an $r$-$v$ path is its length $-$ $c_{rv}$.\n  For"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01335","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":"1708.01335","created_at":"2026-05-18T00:38:37.645580+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.01335v1","created_at":"2026-05-18T00:38:37.645580+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01335","created_at":"2026-05-18T00:38:37.645580+00:00"},{"alias_kind":"pith_short_12","alias_value":"APITU2AMYHKA","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"APITU2AMYHKA6EIF","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"APITU2AM","created_at":"2026-05-18T12:31:05.417338+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/APITU2AMYHKA6EIFMLO3HLD2OA","json":"https://pith.science/pith/APITU2AMYHKA6EIFMLO3HLD2OA.json","graph_json":"https://pith.science/api/pith-number/APITU2AMYHKA6EIFMLO3HLD2OA/graph.json","events_json":"https://pith.science/api/pith-number/APITU2AMYHKA6EIFMLO3HLD2OA/events.json","paper":"https://pith.science/paper/APITU2AM"},"agent_actions":{"view_html":"https://pith.science/pith/APITU2AMYHKA6EIFMLO3HLD2OA","download_json":"https://pith.science/pith/APITU2AMYHKA6EIFMLO3HLD2OA.json","view_paper":"https://pith.science/paper/APITU2AM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.01335&json=true","fetch_graph":"https://pith.science/api/pith-number/APITU2AMYHKA6EIFMLO3HLD2OA/graph.json","fetch_events":"https://pith.science/api/pith-number/APITU2AMYHKA6EIFMLO3HLD2OA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/APITU2AMYHKA6EIFMLO3HLD2OA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/APITU2AMYHKA6EIFMLO3HLD2OA/action/storage_attestation","attest_author":"https://pith.science/pith/APITU2AMYHKA6EIFMLO3HLD2OA/action/author_attestation","sign_citation":"https://pith.science/pith/APITU2AMYHKA6EIFMLO3HLD2OA/action/citation_signature","submit_replication":"https://pith.science/pith/APITU2AMYHKA6EIFMLO3HLD2OA/action/replication_record"}},"created_at":"2026-05-18T00:38:37.645580+00:00","updated_at":"2026-05-18T00:38:37.645580+00:00"}