{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:6APEY7JCDTM3D5Z2EMAS66IY5C","short_pith_number":"pith:6APEY7JC","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"},"canonical_sha256":"f01e4c7d221cd9b1f73a23012f7918e8bf75491dac605c3e5027602d885138a0","source":{"kind":"arxiv","id":"2607.05164","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.05164","created_at":"2026-07-07T03:19:18Z"},{"alias_kind":"arxiv_version","alias_value":"2607.05164v1","created_at":"2026-07-07T03:19:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.05164","created_at":"2026-07-07T03:19:18Z"},{"alias_kind":"pith_short_12","alias_value":"6APEY7JCDTM3","created_at":"2026-07-07T03:19:18Z"},{"alias_kind":"pith_short_16","alias_value":"6APEY7JCDTM3D5Z2","created_at":"2026-07-07T03:19:18Z"},{"alias_kind":"pith_short_8","alias_value":"6APEY7JC","created_at":"2026-07-07T03:19:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:6APEY7JCDTM3D5Z2EMAS66IY5C","target":"record","payload":{"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"},"canonical_sha256":"f01e4c7d221cd9b1f73a23012f7918e8bf75491dac605c3e5027602d885138a0","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"},"source_kind":"arxiv","source_id":"2607.05164","source_version":1,"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-07T03:19:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AEhfi2BbMIwkT0MqXrk3mKZf3uCLwV/uykJIVCVzXqPjqRcEFq4w9RKxqmBTBampu8PqH5RO2ZvBQ1T2kaepCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T10:26:51.166034Z"},"content_sha256":"9e094f3da3df30030adb18ba8afc070455eb29f69a2625fe8560a702e35ae99f","schema_version":"1.0","event_id":"sha256:9e094f3da3df30030adb18ba8afc070455eb29f69a2625fe8560a702e35ae99f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:6APEY7JCDTM3D5Z2EMAS66IY5C","target":"graph","payload":{"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"},"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-07T03:19:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W7XM0TS4NmVignGqy3hzw7jM43UNZ0lCoBIg0hVWlyge5lh7ey++jwwc9JLYYz3mdFnOtRYKWWsFZn5sb7I2DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T10:26:51.166759Z"},"content_sha256":"99abdac878909dc82593c060e09f23ef016064e89b951df91533fe59e75e9606","schema_version":"1.0","event_id":"sha256:99abdac878909dc82593c060e09f23ef016064e89b951df91533fe59e75e9606"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6APEY7JCDTM3D5Z2EMAS66IY5C/bundle.json","state_url":"https://pith.science/pith/6APEY7JCDTM3D5Z2EMAS66IY5C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6APEY7JCDTM3D5Z2EMAS66IY5C/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-06T10:26:51Z","links":{"resolver":"https://pith.science/pith/6APEY7JCDTM3D5Z2EMAS66IY5C","bundle":"https://pith.science/pith/6APEY7JCDTM3D5Z2EMAS66IY5C/bundle.json","state":"https://pith.science/pith/6APEY7JCDTM3D5Z2EMAS66IY5C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6APEY7JCDTM3D5Z2EMAS66IY5C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:6APEY7JCDTM3D5Z2EMAS66IY5C","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":"46c200b6a55a6cc54e55d84e22d8ecc813effc3fc07f712693f62410cc5007b5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-06T14:47:30Z","title_canon_sha256":"4df8cda2688dc04508905c602fd69688bcdb689c867126fc5639f7e113056af1"},"schema_version":"1.0","source":{"id":"2607.05164","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.05164","created_at":"2026-07-07T03:19:18Z"},{"alias_kind":"arxiv_version","alias_value":"2607.05164v1","created_at":"2026-07-07T03:19:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.05164","created_at":"2026-07-07T03:19:18Z"},{"alias_kind":"pith_short_12","alias_value":"6APEY7JCDTM3","created_at":"2026-07-07T03:19:18Z"},{"alias_kind":"pith_short_16","alias_value":"6APEY7JCDTM3D5Z2","created_at":"2026-07-07T03:19:18Z"},{"alias_kind":"pith_short_8","alias_value":"6APEY7JC","created_at":"2026-07-07T03:19:18Z"}],"graph_snapshots":[{"event_id":"sha256:99abdac878909dc82593c060e09f23ef016064e89b951df91533fe59e75e9606","target":"graph","created_at":"2026-07-07T03:19:18Z","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/2607.05164/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Heiko R\\\"oglin, Jan Eube, Kelin Luo, Sarah Sturm","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-06T14:47:30Z","title":"Approximation Algorithms for the Traveling Thief Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.05164","kind":"arxiv","version":1},"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:9e094f3da3df30030adb18ba8afc070455eb29f69a2625fe8560a702e35ae99f","target":"record","created_at":"2026-07-07T03:19:18Z","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":"46c200b6a55a6cc54e55d84e22d8ecc813effc3fc07f712693f62410cc5007b5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-06T14:47:30Z","title_canon_sha256":"4df8cda2688dc04508905c602fd69688bcdb689c867126fc5639f7e113056af1"},"schema_version":"1.0","source":{"id":"2607.05164","kind":"arxiv","version":1}},"canonical_sha256":"f01e4c7d221cd9b1f73a23012f7918e8bf75491dac605c3e5027602d885138a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f01e4c7d221cd9b1f73a23012f7918e8bf75491dac605c3e5027602d885138a0","first_computed_at":"2026-07-07T03:19:18.422834Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-07T03:19:18.422834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U2dI7NC9c0zuzYpcwDyXILOtYXtaAqtYWK9+Ay5gusPL+jWDi3JqAJSl4zuqGQczWxv+sMiMtnCH0CaNZcbADg==","signature_status":"signed_v1","signed_at":"2026-07-07T03:19:18.423258Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.05164","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e094f3da3df30030adb18ba8afc070455eb29f69a2625fe8560a702e35ae99f","sha256:99abdac878909dc82593c060e09f23ef016064e89b951df91533fe59e75e9606"],"state_sha256":"4015bc6ed2e624bc996a7e4211da97692f73eb0e8155d693f0c78c416718ba74"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/q/AWqUYEcPw+t/+wQf8OSLQbQug633F56h2aBTbepJYLyu05Wu35j0f+L2tT56+uSqOCNOCdto6K2Vp8KiYBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T10:26:51.173775Z","bundle_sha256":"95b8c4b24425ee2b43f6057b1d0351c100904ed22e88a1020eb02afbda201984"}}