{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:RZAYCGK53D3DYVWJ6X4SRDIGHF","short_pith_number":"pith:RZAYCGK5","canonical_record":{"source":{"id":"1604.04169","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-14T14:39:56Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"dffb68dcfee5693f9ea43e1604b7628a29f9a7318a41a88f06cc81cd4e60813b","abstract_canon_sha256":"c9f4e0f230fa294397dd21a76df4ea975c901d6d8c382642ee1da92719668471"},"schema_version":"1.0"},"canonical_sha256":"8e4181195dd8f63c56c9f5f9288d06395a083fa9b51100012824156a162f7c50","source":{"kind":"arxiv","id":"1604.04169","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.04169","created_at":"2026-05-18T01:17:06Z"},{"alias_kind":"arxiv_version","alias_value":"1604.04169v1","created_at":"2026-05-18T01:17:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04169","created_at":"2026-05-18T01:17:06Z"},{"alias_kind":"pith_short_12","alias_value":"RZAYCGK53D3D","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RZAYCGK53D3DYVWJ","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RZAYCGK5","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:RZAYCGK53D3DYVWJ6X4SRDIGHF","target":"record","payload":{"canonical_record":{"source":{"id":"1604.04169","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-14T14:39:56Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"dffb68dcfee5693f9ea43e1604b7628a29f9a7318a41a88f06cc81cd4e60813b","abstract_canon_sha256":"c9f4e0f230fa294397dd21a76df4ea975c901d6d8c382642ee1da92719668471"},"schema_version":"1.0"},"canonical_sha256":"8e4181195dd8f63c56c9f5f9288d06395a083fa9b51100012824156a162f7c50","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:06.350567Z","signature_b64":"BwJ7N+6HhDOVjHEZ4kZGvC7oxZ8cuwl4M9SHRKkeB+HtJsrDMqwNeEts5b7xi5GwH/teIYPmRzdJPlwsgxTNBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e4181195dd8f63c56c9f5f9288d06395a083fa9b51100012824156a162f7c50","last_reissued_at":"2026-05-18T01:17:06.349810Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:06.349810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.04169","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-05-18T01:17:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kJnuazh1b9lMGIAxEvaknKLTa9bOs89FjaI+qpXxB2e6UnVqUm4tqLTJgYcxTxEJJgPtaYn1TdbQc+MpGst+Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T16:38:59.911660Z"},"content_sha256":"0a9e463eb314c82360ba6def9e375382c7915772e2caa9227aea8ce744d9aa14","schema_version":"1.0","event_id":"sha256:0a9e463eb314c82360ba6def9e375382c7915772e2caa9227aea8ce744d9aa14"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:RZAYCGK53D3DYVWJ6X4SRDIGHF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Deterministic Annealing Approach to the Multiple Traveling Salesmen and Related Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"math.OC","authors_text":"Brian Roehl, Mayank Baranwal, Srinivasa M. Salapaka","submitted_at":"2016-04-14T14:39:56Z","abstract_excerpt":"This paper presents a novel and efficient heuristic framework for approximating the solutions to the multiple traveling salesmen problem (m-TSP) and other variants on the TSP. The approach adopted in this paper is an extension of the Maximum-Entropy-Principle (MEP) and the Deterministic Annealing (DA) algorithm. The framework is presented as a general tool that can be suitably adapted to a number of variants on the basic TSP. Additionally, unlike most other heuristics for the TSP, the framework presented in this paper is independent of the edges defined between any two pairs of nodes. This mak"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04169","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"},"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-05-18T01:17:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZJZPKGYxee3eswaSknrhSN7QvVfu8VBETlT+qwsdXKzPy5sg3QfG5JOCEYJ4o8hcaKrLAAo6vxU5DvJJbxs2CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T16:38:59.912010Z"},"content_sha256":"16d98f826ba160bf8ff3d7bac9820e972444679b226dc29799e4494d02f7f305","schema_version":"1.0","event_id":"sha256:16d98f826ba160bf8ff3d7bac9820e972444679b226dc29799e4494d02f7f305"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RZAYCGK53D3DYVWJ6X4SRDIGHF/bundle.json","state_url":"https://pith.science/pith/RZAYCGK53D3DYVWJ6X4SRDIGHF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RZAYCGK53D3DYVWJ6X4SRDIGHF/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-06-23T16:38:59Z","links":{"resolver":"https://pith.science/pith/RZAYCGK53D3DYVWJ6X4SRDIGHF","bundle":"https://pith.science/pith/RZAYCGK53D3DYVWJ6X4SRDIGHF/bundle.json","state":"https://pith.science/pith/RZAYCGK53D3DYVWJ6X4SRDIGHF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RZAYCGK53D3DYVWJ6X4SRDIGHF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:RZAYCGK53D3DYVWJ6X4SRDIGHF","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":"c9f4e0f230fa294397dd21a76df4ea975c901d6d8c382642ee1da92719668471","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-14T14:39:56Z","title_canon_sha256":"dffb68dcfee5693f9ea43e1604b7628a29f9a7318a41a88f06cc81cd4e60813b"},"schema_version":"1.0","source":{"id":"1604.04169","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.04169","created_at":"2026-05-18T01:17:06Z"},{"alias_kind":"arxiv_version","alias_value":"1604.04169v1","created_at":"2026-05-18T01:17:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04169","created_at":"2026-05-18T01:17:06Z"},{"alias_kind":"pith_short_12","alias_value":"RZAYCGK53D3D","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RZAYCGK53D3DYVWJ","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RZAYCGK5","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:16d98f826ba160bf8ff3d7bac9820e972444679b226dc29799e4494d02f7f305","target":"graph","created_at":"2026-05-18T01:17:06Z","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"},"paper":{"abstract_excerpt":"This paper presents a novel and efficient heuristic framework for approximating the solutions to the multiple traveling salesmen problem (m-TSP) and other variants on the TSP. The approach adopted in this paper is an extension of the Maximum-Entropy-Principle (MEP) and the Deterministic Annealing (DA) algorithm. The framework is presented as a general tool that can be suitably adapted to a number of variants on the basic TSP. Additionally, unlike most other heuristics for the TSP, the framework presented in this paper is independent of the edges defined between any two pairs of nodes. This mak","authors_text":"Brian Roehl, Mayank Baranwal, Srinivasa M. Salapaka","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-14T14:39:56Z","title":"A Deterministic Annealing Approach to the Multiple Traveling Salesmen and Related Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04169","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:0a9e463eb314c82360ba6def9e375382c7915772e2caa9227aea8ce744d9aa14","target":"record","created_at":"2026-05-18T01:17:06Z","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":"c9f4e0f230fa294397dd21a76df4ea975c901d6d8c382642ee1da92719668471","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-14T14:39:56Z","title_canon_sha256":"dffb68dcfee5693f9ea43e1604b7628a29f9a7318a41a88f06cc81cd4e60813b"},"schema_version":"1.0","source":{"id":"1604.04169","kind":"arxiv","version":1}},"canonical_sha256":"8e4181195dd8f63c56c9f5f9288d06395a083fa9b51100012824156a162f7c50","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e4181195dd8f63c56c9f5f9288d06395a083fa9b51100012824156a162f7c50","first_computed_at":"2026-05-18T01:17:06.349810Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:06.349810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BwJ7N+6HhDOVjHEZ4kZGvC7oxZ8cuwl4M9SHRKkeB+HtJsrDMqwNeEts5b7xi5GwH/teIYPmRzdJPlwsgxTNBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:06.350567Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.04169","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0a9e463eb314c82360ba6def9e375382c7915772e2caa9227aea8ce744d9aa14","sha256:16d98f826ba160bf8ff3d7bac9820e972444679b226dc29799e4494d02f7f305"],"state_sha256":"7fab01a89fd0e863364b837c4edc45b0bebff19fdd205350b4ea21960884d808"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KZxGomjvCNf3KRdzjM7mR80/52djIuRNJEuA/Ieep2r2bz1vTQvoCDlrNJhbDbg43+Tl2dfMPNU5jP2U90DjBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T16:38:59.914004Z","bundle_sha256":"2a5fbfa81454d3caec49554205ed9f3d7bead4fb147ab6ee3848c964bafddf14"}}