{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:TKBST5JNIATEVDGMARVLW2TEXA","short_pith_number":"pith:TKBST5JN","schema_version":"1.0","canonical_sha256":"9a8329f52d40264a8ccc046abb6a64b80664adc0fb131997907c73e53db974df","source":{"kind":"arxiv","id":"2310.07156","version":1},"attestation_state":"computed","paper":{"title":"Solving Travelling Thief Problems using Coordination Based Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Abdul Sattar, Conrad Sanderson, M.A. Hakim Newton, Majid Namazi","submitted_at":"2023-10-11T03:03:50Z","abstract_excerpt":"A travelling thief problem (TTP) is a proxy to real-life problems such as postal collection. TTP comprises an entanglement of a travelling salesman problem (TSP) and a knapsack problem (KP) since items of KP are scattered over cities of TSP, and a thief has to visit cities to collect items. In TTP, city selection and item selection decisions need close coordination since the thief's travelling speed depends on the knapsack's weight and the order of visiting cities affects the order of item collection. Existing TTP solvers deal with city selection and item selection separately, keeping decision"},"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":"2310.07156","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2023-10-11T03:03:50Z","cross_cats_sorted":[],"title_canon_sha256":"d9314895f7417f41e0c3ba6a5112f44cda237af3e6aaf9c96bd1e3fc1de5f14f","abstract_canon_sha256":"bb8546607d34e8db0864f343d8877c94cd110458bb562228d0f8fcb96dad3322"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:07:17.725482Z","signature_b64":"Kv2b6g5G/LXzU6okN46TTCXVNyOXkfeRKWtrcs4D9yC9A+Ool+igzths4o7qmoT4GR5/1TZH7HeseF7PX6cHAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a8329f52d40264a8ccc046abb6a64b80664adc0fb131997907c73e53db974df","last_reissued_at":"2026-07-05T07:07:17.724940Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:07:17.724940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving Travelling Thief Problems using Coordination Based Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Abdul Sattar, Conrad Sanderson, M.A. Hakim Newton, Majid Namazi","submitted_at":"2023-10-11T03:03:50Z","abstract_excerpt":"A travelling thief problem (TTP) is a proxy to real-life problems such as postal collection. TTP comprises an entanglement of a travelling salesman problem (TSP) and a knapsack problem (KP) since items of KP are scattered over cities of TSP, and a thief has to visit cities to collect items. In TTP, city selection and item selection decisions need close coordination since the thief's travelling speed depends on the knapsack's weight and the order of visiting cities affects the order of item collection. Existing TTP solvers deal with city selection and item selection separately, keeping decision"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.07156","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/2310.07156/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":"2310.07156","created_at":"2026-07-05T07:07:17.725025+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.07156v1","created_at":"2026-07-05T07:07:17.725025+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.07156","created_at":"2026-07-05T07:07:17.725025+00:00"},{"alias_kind":"pith_short_12","alias_value":"TKBST5JNIATE","created_at":"2026-07-05T07:07:17.725025+00:00"},{"alias_kind":"pith_short_16","alias_value":"TKBST5JNIATEVDGM","created_at":"2026-07-05T07:07:17.725025+00:00"},{"alias_kind":"pith_short_8","alias_value":"TKBST5JN","created_at":"2026-07-05T07:07:17.725025+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/TKBST5JNIATEVDGMARVLW2TEXA","json":"https://pith.science/pith/TKBST5JNIATEVDGMARVLW2TEXA.json","graph_json":"https://pith.science/api/pith-number/TKBST5JNIATEVDGMARVLW2TEXA/graph.json","events_json":"https://pith.science/api/pith-number/TKBST5JNIATEVDGMARVLW2TEXA/events.json","paper":"https://pith.science/paper/TKBST5JN"},"agent_actions":{"view_html":"https://pith.science/pith/TKBST5JNIATEVDGMARVLW2TEXA","download_json":"https://pith.science/pith/TKBST5JNIATEVDGMARVLW2TEXA.json","view_paper":"https://pith.science/paper/TKBST5JN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.07156&json=true","fetch_graph":"https://pith.science/api/pith-number/TKBST5JNIATEVDGMARVLW2TEXA/graph.json","fetch_events":"https://pith.science/api/pith-number/TKBST5JNIATEVDGMARVLW2TEXA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TKBST5JNIATEVDGMARVLW2TEXA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TKBST5JNIATEVDGMARVLW2TEXA/action/storage_attestation","attest_author":"https://pith.science/pith/TKBST5JNIATEVDGMARVLW2TEXA/action/author_attestation","sign_citation":"https://pith.science/pith/TKBST5JNIATEVDGMARVLW2TEXA/action/citation_signature","submit_replication":"https://pith.science/pith/TKBST5JNIATEVDGMARVLW2TEXA/action/replication_record"}},"created_at":"2026-07-05T07:07:17.725025+00:00","updated_at":"2026-07-05T07:07:17.725025+00:00"}