{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:6APEY7JCDTM3D5Z2EMAS66IY5C","short_pith_number":"pith:6APEY7JC","schema_version":"1.0","canonical_sha256":"f01e4c7d221cd9b1f73a23012f7918e8bf75491dac605c3e5027602d885138a0","source":{"kind":"arxiv","id":"2607.05164","version":1},"attestation_state":"computed","paper":{"title":"Approximation Algorithms for the Traveling Thief Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Heiko R\\\"oglin, Jan Eube, Kelin Luo, Sarah Sturm","submitted_at":"2026-07-06T14:47:30Z","abstract_excerpt":"The Traveling Thief Problem (TTP) combines the Traveling Salesperson Problem with the Knapsack Problem. In this problem, a finite metric space is given, and at each location an item with some profit and weight is placed. An agent seeks to collect a subset of the items. To do so, the agent must decide which items to collect and to determine a cyclic tour visiting the corresponding locations. While collecting an item yields its profit as a reward, the agent's speed decreases as more weight is picked up. The problem involves two competing objectives: maximizing the total profit of the collected i"},"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":"2607.05164","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-06T14:47:30Z","cross_cats_sorted":[],"title_canon_sha256":"4df8cda2688dc04508905c602fd69688bcdb689c867126fc5639f7e113056af1","abstract_canon_sha256":"46c200b6a55a6cc54e55d84e22d8ecc813effc3fc07f712693f62410cc5007b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T03:19:18.423258Z","signature_b64":"U2dI7NC9c0zuzYpcwDyXILOtYXtaAqtYWK9+Ay5gusPL+jWDi3JqAJSl4zuqGQczWxv+sMiMtnCH0CaNZcbADg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f01e4c7d221cd9b1f73a23012f7918e8bf75491dac605c3e5027602d885138a0","last_reissued_at":"2026-07-07T03:19:18.422834Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T03:19:18.422834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation Algorithms for the Traveling Thief Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Heiko R\\\"oglin, Jan Eube, Kelin Luo, Sarah Sturm","submitted_at":"2026-07-06T14:47:30Z","abstract_excerpt":"The Traveling Thief Problem (TTP) combines the Traveling Salesperson Problem with the Knapsack Problem. In this problem, a finite metric space is given, and at each location an item with some profit and weight is placed. An agent seeks to collect a subset of the items. To do so, the agent must decide which items to collect and to determine a cyclic tour visiting the corresponding locations. While collecting an item yields its profit as a reward, the agent's speed decreases as more weight is picked up. The problem involves two competing objectives: maximizing the total profit of the collected i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.05164","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.05164/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":"2607.05164","created_at":"2026-07-07T03:19:18.422893+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.05164v1","created_at":"2026-07-07T03:19:18.422893+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.05164","created_at":"2026-07-07T03:19:18.422893+00:00"},{"alias_kind":"pith_short_12","alias_value":"6APEY7JCDTM3","created_at":"2026-07-07T03:19:18.422893+00:00"},{"alias_kind":"pith_short_16","alias_value":"6APEY7JCDTM3D5Z2","created_at":"2026-07-07T03:19:18.422893+00:00"},{"alias_kind":"pith_short_8","alias_value":"6APEY7JC","created_at":"2026-07-07T03:19:18.422893+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/6APEY7JCDTM3D5Z2EMAS66IY5C","json":"https://pith.science/pith/6APEY7JCDTM3D5Z2EMAS66IY5C.json","graph_json":"https://pith.science/api/pith-number/6APEY7JCDTM3D5Z2EMAS66IY5C/graph.json","events_json":"https://pith.science/api/pith-number/6APEY7JCDTM3D5Z2EMAS66IY5C/events.json","paper":"https://pith.science/paper/6APEY7JC"},"agent_actions":{"view_html":"https://pith.science/pith/6APEY7JCDTM3D5Z2EMAS66IY5C","download_json":"https://pith.science/pith/6APEY7JCDTM3D5Z2EMAS66IY5C.json","view_paper":"https://pith.science/paper/6APEY7JC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.05164&json=true","fetch_graph":"https://pith.science/api/pith-number/6APEY7JCDTM3D5Z2EMAS66IY5C/graph.json","fetch_events":"https://pith.science/api/pith-number/6APEY7JCDTM3D5Z2EMAS66IY5C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6APEY7JCDTM3D5Z2EMAS66IY5C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6APEY7JCDTM3D5Z2EMAS66IY5C/action/storage_attestation","attest_author":"https://pith.science/pith/6APEY7JCDTM3D5Z2EMAS66IY5C/action/author_attestation","sign_citation":"https://pith.science/pith/6APEY7JCDTM3D5Z2EMAS66IY5C/action/citation_signature","submit_replication":"https://pith.science/pith/6APEY7JCDTM3D5Z2EMAS66IY5C/action/replication_record"}},"created_at":"2026-07-07T03:19:18.422893+00:00","updated_at":"2026-07-07T03:19:18.422893+00:00"}