{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:WNUR3YPZVNWF7DXVCDXZMS6DW2","short_pith_number":"pith:WNUR3YPZ","canonical_record":{"source":{"id":"2302.00243","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-02-01T04:58:39Z","cross_cats_sorted":[],"title_canon_sha256":"30b4ba0049ab1ac03febf98d72e512c81b666a4bbf0ad675563bb89b3a7c385d","abstract_canon_sha256":"9d336f6a316f90f31d23d300bf8973584c5feb266fdaca1b9118762ed0d9351e"},"schema_version":"1.0"},"canonical_sha256":"b3691de1f9ab6c5f8ef510ef964bc3b68586cb98b8c6bcb9834a872a8b8c5152","source":{"kind":"arxiv","id":"2302.00243","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.00243","created_at":"2026-07-05T05:38:01Z"},{"alias_kind":"arxiv_version","alias_value":"2302.00243v1","created_at":"2026-07-05T05:38:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.00243","created_at":"2026-07-05T05:38:01Z"},{"alias_kind":"pith_short_12","alias_value":"WNUR3YPZVNWF","created_at":"2026-07-05T05:38:01Z"},{"alias_kind":"pith_short_16","alias_value":"WNUR3YPZVNWF7DXV","created_at":"2026-07-05T05:38:01Z"},{"alias_kind":"pith_short_8","alias_value":"WNUR3YPZ","created_at":"2026-07-05T05:38:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:WNUR3YPZVNWF7DXVCDXZMS6DW2","target":"record","payload":{"canonical_record":{"source":{"id":"2302.00243","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-02-01T04:58:39Z","cross_cats_sorted":[],"title_canon_sha256":"30b4ba0049ab1ac03febf98d72e512c81b666a4bbf0ad675563bb89b3a7c385d","abstract_canon_sha256":"9d336f6a316f90f31d23d300bf8973584c5feb266fdaca1b9118762ed0d9351e"},"schema_version":"1.0"},"canonical_sha256":"b3691de1f9ab6c5f8ef510ef964bc3b68586cb98b8c6bcb9834a872a8b8c5152","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:38:01.212791Z","signature_b64":"7qThshLmj9kzXYzmgLeEAmwR8SaQLqWGH/xEu9EBP35fMIwmhVTy0CoqW9t8KAYDLdAMrNwWot+sltN+udoYDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3691de1f9ab6c5f8ef510ef964bc3b68586cb98b8c6bcb9834a872a8b8c5152","last_reissued_at":"2026-07-05T05:38:01.212386Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:38:01.212386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2302.00243","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-05T05:38:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YvmBJPEmps+NcniSd2hM/LqtCGxlWtde3/T/bgHfZ5Egnj+rt5RxJegPLIaO1u6izuI3EtVReazaTuIvQHJqBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T15:33:27.966810Z"},"content_sha256":"b091f15b05234a575e5ecb3326596d70c5ac3293ee20b18f4ef21f0bc9f04746","schema_version":"1.0","event_id":"sha256:b091f15b05234a575e5ecb3326596d70c5ac3293ee20b18f4ef21f0bc9f04746"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:WNUR3YPZVNWF7DXVCDXZMS6DW2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Agility and Target Distribution in the Dynamic Stochastic Traveling Salesman Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Aviv Adler, Oren Gal, Sertac Karaman","submitted_at":"2023-02-01T04:58:39Z","abstract_excerpt":"An important variant of the classic Traveling Salesman Problem (TSP) is the Dynamic TSP, in which a system with dynamic constraints is tasked with visiting a set of n target locations (in any order) in the shortest amount of time. Such tasks arise naturally in many robotic motion planning problems, particularly in exploration, surveillance and reconnaissance, and classical TSP algorithms on graphs are typically inapplicable in this setting. An important question about such problems is: if the target points are random, what is the length of the tour (either in expectation or as a concentration "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.00243","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/2302.00243/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-05T05:38:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UL/sEdwRjIdYSUq90qYIZlWZnUIo2IRvw/9T8Flr/hn1+QHoAdTrPWjkmIeRUyYWuK3PSnIHcyGbKaUsFIQDBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T15:33:27.967171Z"},"content_sha256":"d77c04a702d86a50894012daa8b218ee7974a416b4ddaf7fb5147e37b172b4f2","schema_version":"1.0","event_id":"sha256:d77c04a702d86a50894012daa8b218ee7974a416b4ddaf7fb5147e37b172b4f2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WNUR3YPZVNWF7DXVCDXZMS6DW2/bundle.json","state_url":"https://pith.science/pith/WNUR3YPZVNWF7DXVCDXZMS6DW2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WNUR3YPZVNWF7DXVCDXZMS6DW2/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-07-07T15:33:27Z","links":{"resolver":"https://pith.science/pith/WNUR3YPZVNWF7DXVCDXZMS6DW2","bundle":"https://pith.science/pith/WNUR3YPZVNWF7DXVCDXZMS6DW2/bundle.json","state":"https://pith.science/pith/WNUR3YPZVNWF7DXVCDXZMS6DW2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WNUR3YPZVNWF7DXVCDXZMS6DW2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:WNUR3YPZVNWF7DXVCDXZMS6DW2","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":"9d336f6a316f90f31d23d300bf8973584c5feb266fdaca1b9118762ed0d9351e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-02-01T04:58:39Z","title_canon_sha256":"30b4ba0049ab1ac03febf98d72e512c81b666a4bbf0ad675563bb89b3a7c385d"},"schema_version":"1.0","source":{"id":"2302.00243","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.00243","created_at":"2026-07-05T05:38:01Z"},{"alias_kind":"arxiv_version","alias_value":"2302.00243v1","created_at":"2026-07-05T05:38:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.00243","created_at":"2026-07-05T05:38:01Z"},{"alias_kind":"pith_short_12","alias_value":"WNUR3YPZVNWF","created_at":"2026-07-05T05:38:01Z"},{"alias_kind":"pith_short_16","alias_value":"WNUR3YPZVNWF7DXV","created_at":"2026-07-05T05:38:01Z"},{"alias_kind":"pith_short_8","alias_value":"WNUR3YPZ","created_at":"2026-07-05T05:38:01Z"}],"graph_snapshots":[{"event_id":"sha256:d77c04a702d86a50894012daa8b218ee7974a416b4ddaf7fb5147e37b172b4f2","target":"graph","created_at":"2026-07-05T05:38:01Z","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/2302.00243/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"An important variant of the classic Traveling Salesman Problem (TSP) is the Dynamic TSP, in which a system with dynamic constraints is tasked with visiting a set of n target locations (in any order) in the shortest amount of time. Such tasks arise naturally in many robotic motion planning problems, particularly in exploration, surveillance and reconnaissance, and classical TSP algorithms on graphs are typically inapplicable in this setting. An important question about such problems is: if the target points are random, what is the length of the tour (either in expectation or as a concentration ","authors_text":"Aviv Adler, Oren Gal, Sertac Karaman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-02-01T04:58:39Z","title":"Agility and Target Distribution in the Dynamic Stochastic Traveling Salesman Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.00243","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:b091f15b05234a575e5ecb3326596d70c5ac3293ee20b18f4ef21f0bc9f04746","target":"record","created_at":"2026-07-05T05:38:01Z","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":"9d336f6a316f90f31d23d300bf8973584c5feb266fdaca1b9118762ed0d9351e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-02-01T04:58:39Z","title_canon_sha256":"30b4ba0049ab1ac03febf98d72e512c81b666a4bbf0ad675563bb89b3a7c385d"},"schema_version":"1.0","source":{"id":"2302.00243","kind":"arxiv","version":1}},"canonical_sha256":"b3691de1f9ab6c5f8ef510ef964bc3b68586cb98b8c6bcb9834a872a8b8c5152","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b3691de1f9ab6c5f8ef510ef964bc3b68586cb98b8c6bcb9834a872a8b8c5152","first_computed_at":"2026-07-05T05:38:01.212386Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:38:01.212386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7qThshLmj9kzXYzmgLeEAmwR8SaQLqWGH/xEu9EBP35fMIwmhVTy0CoqW9t8KAYDLdAMrNwWot+sltN+udoYDA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:38:01.212791Z","signed_message":"canonical_sha256_bytes"},"source_id":"2302.00243","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b091f15b05234a575e5ecb3326596d70c5ac3293ee20b18f4ef21f0bc9f04746","sha256:d77c04a702d86a50894012daa8b218ee7974a416b4ddaf7fb5147e37b172b4f2"],"state_sha256":"b6fc9e1f106451a1ee63e8172ddd62e85a93b7afa7fa16331b0e938b36f7b3cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g1PuKWu6H80ZTwHM7dMqwctTYvvu1aK0OTIVzZ2qZgfa2C9la7hmgjMwLrughUyq/nGAPlV3zlJjnBtpAN1DDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T15:33:27.969263Z","bundle_sha256":"bdf9f5fbf3c0469724c47e845460f631a5da78cf7d7fcc949507e4fa8fed0370"}}