{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:JGIT2HFOJME7VPJEOXQAUIEHDK","short_pith_number":"pith:JGIT2HFO","canonical_record":{"source":{"id":"1512.02963","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-09T17:38:07Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"8379c377a74f438e2f2520415098924531dcfeff5dfc835c31869cdd7f853281","abstract_canon_sha256":"6ac601e6ec7fd55973f028d051f94dfa9b412ee3c7e8257543af21b27d5fb2ec"},"schema_version":"1.0"},"canonical_sha256":"49913d1cae4b09fabd2475e00a20871a919cdbb577c56dfdaede9202e1513865","source":{"kind":"arxiv","id":"1512.02963","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.02963","created_at":"2026-05-18T01:11:50Z"},{"alias_kind":"arxiv_version","alias_value":"1512.02963v2","created_at":"2026-05-18T01:11:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02963","created_at":"2026-05-18T01:11:50Z"},{"alias_kind":"pith_short_12","alias_value":"JGIT2HFOJME7","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JGIT2HFOJME7VPJE","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JGIT2HFO","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:JGIT2HFOJME7VPJEOXQAUIEHDK","target":"record","payload":{"canonical_record":{"source":{"id":"1512.02963","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-09T17:38:07Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"8379c377a74f438e2f2520415098924531dcfeff5dfc835c31869cdd7f853281","abstract_canon_sha256":"6ac601e6ec7fd55973f028d051f94dfa9b412ee3c7e8257543af21b27d5fb2ec"},"schema_version":"1.0"},"canonical_sha256":"49913d1cae4b09fabd2475e00a20871a919cdbb577c56dfdaede9202e1513865","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:50.064181Z","signature_b64":"aNxd1SBop6Ot7MtslI9q+zsjiYmyG2d4EzsYc/Dh0P12zw4i4wsltnrDINidZrAaNS1lBSdRYvQ275COdGkDBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49913d1cae4b09fabd2475e00a20871a919cdbb577c56dfdaede9202e1513865","last_reissued_at":"2026-05-18T01:11:50.063804Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:50.063804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.02963","source_version":2,"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:11:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0ntjiPVeZymp4fU6JgaaJcNK0mzaZSUUG4Y3iiShzOBVmcvGEsxQh4WkWRhwPaznl9XCt6upSCu+DDKp5MX7Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T22:24:46.895393Z"},"content_sha256":"1a4c0ad9f1ca46dc728c2126761c5b7250e9861047996abdc5a8e887f52d3529","schema_version":"1.0","event_id":"sha256:1a4c0ad9f1ca46dc728c2126761c5b7250e9861047996abdc5a8e887f52d3529"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:JGIT2HFOJME7VPJEOXQAUIEHDK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximum Scatter TSP in Doubling Metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"L\\'aszl\\'o Kozma, Tobias M\\\"omke","submitted_at":"2015-12-09T17:38:07Z","abstract_excerpt":"We study the problem of finding a tour of $n$ points in which every edge is long. More precisely, we wish to find a tour that visits every point exactly once, maximizing the length of the shortest edge in the tour. The problem is known as Maximum Scatter TSP, and was introduced by Arkin et al. (SODA 1997), motivated by applications in manufacturing and medical imaging. Arkin et al. gave a $0.5$-approximation for the metric version of the problem and showed that this is the best possible ratio achievable in polynomial time (assuming $P \\neq NP$). Arkin et al. raised the question of whether a be"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02963","kind":"arxiv","version":2},"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:11:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uKlZyz7mmQ7cUfOpwY2axzvP4c8Gc6ctyUAWL+FcW2A5V3vguwBoeXz2tlrZnZ1yQvm1myPDxMkGFdtM6dAJBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T22:24:46.896061Z"},"content_sha256":"b7e140df5d822e7067612c9531453ebabd051013c2e09115dca554f63bdd395f","schema_version":"1.0","event_id":"sha256:b7e140df5d822e7067612c9531453ebabd051013c2e09115dca554f63bdd395f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JGIT2HFOJME7VPJEOXQAUIEHDK/bundle.json","state_url":"https://pith.science/pith/JGIT2HFOJME7VPJEOXQAUIEHDK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JGIT2HFOJME7VPJEOXQAUIEHDK/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-05-24T22:24:46Z","links":{"resolver":"https://pith.science/pith/JGIT2HFOJME7VPJEOXQAUIEHDK","bundle":"https://pith.science/pith/JGIT2HFOJME7VPJEOXQAUIEHDK/bundle.json","state":"https://pith.science/pith/JGIT2HFOJME7VPJEOXQAUIEHDK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JGIT2HFOJME7VPJEOXQAUIEHDK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:JGIT2HFOJME7VPJEOXQAUIEHDK","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":"6ac601e6ec7fd55973f028d051f94dfa9b412ee3c7e8257543af21b27d5fb2ec","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-09T17:38:07Z","title_canon_sha256":"8379c377a74f438e2f2520415098924531dcfeff5dfc835c31869cdd7f853281"},"schema_version":"1.0","source":{"id":"1512.02963","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.02963","created_at":"2026-05-18T01:11:50Z"},{"alias_kind":"arxiv_version","alias_value":"1512.02963v2","created_at":"2026-05-18T01:11:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02963","created_at":"2026-05-18T01:11:50Z"},{"alias_kind":"pith_short_12","alias_value":"JGIT2HFOJME7","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JGIT2HFOJME7VPJE","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JGIT2HFO","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:b7e140df5d822e7067612c9531453ebabd051013c2e09115dca554f63bdd395f","target":"graph","created_at":"2026-05-18T01:11:50Z","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":"We study the problem of finding a tour of $n$ points in which every edge is long. More precisely, we wish to find a tour that visits every point exactly once, maximizing the length of the shortest edge in the tour. The problem is known as Maximum Scatter TSP, and was introduced by Arkin et al. (SODA 1997), motivated by applications in manufacturing and medical imaging. Arkin et al. gave a $0.5$-approximation for the metric version of the problem and showed that this is the best possible ratio achievable in polynomial time (assuming $P \\neq NP$). Arkin et al. raised the question of whether a be","authors_text":"L\\'aszl\\'o Kozma, Tobias M\\\"omke","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-09T17:38:07Z","title":"Maximum Scatter TSP in Doubling Metrics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02963","kind":"arxiv","version":2},"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:1a4c0ad9f1ca46dc728c2126761c5b7250e9861047996abdc5a8e887f52d3529","target":"record","created_at":"2026-05-18T01:11:50Z","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":"6ac601e6ec7fd55973f028d051f94dfa9b412ee3c7e8257543af21b27d5fb2ec","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-09T17:38:07Z","title_canon_sha256":"8379c377a74f438e2f2520415098924531dcfeff5dfc835c31869cdd7f853281"},"schema_version":"1.0","source":{"id":"1512.02963","kind":"arxiv","version":2}},"canonical_sha256":"49913d1cae4b09fabd2475e00a20871a919cdbb577c56dfdaede9202e1513865","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"49913d1cae4b09fabd2475e00a20871a919cdbb577c56dfdaede9202e1513865","first_computed_at":"2026-05-18T01:11:50.063804Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:50.063804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aNxd1SBop6Ot7MtslI9q+zsjiYmyG2d4EzsYc/Dh0P12zw4i4wsltnrDINidZrAaNS1lBSdRYvQ275COdGkDBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:50.064181Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.02963","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a4c0ad9f1ca46dc728c2126761c5b7250e9861047996abdc5a8e887f52d3529","sha256:b7e140df5d822e7067612c9531453ebabd051013c2e09115dca554f63bdd395f"],"state_sha256":"90373ee20e965106efbeb58097720fa5dba43047fb89ba74c26a0b74117fb982"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QCA85ZjsUYV47blnyaYNWwy8XD1jeqDm2fYk1eKb184zBHmKg3IubylduggxL9a/oh65odNpMx7D/AiB4Re4DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T22:24:46.900439Z","bundle_sha256":"e2b8694fa3062956c7e8cdfe55c35a46394e82daeeeceb0e0625e1cf0169eebe"}}