{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:JEHD5EQSB2DPGWGACULG6OQBXD","short_pith_number":"pith:JEHD5EQS","canonical_record":{"source":{"id":"1301.7482","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-01-31T00:33:24Z","cross_cats_sorted":[],"title_canon_sha256":"44fbf85feed1895b08fe1f71e51d1a095020ca420931abfa50e10d4ad2e4262e","abstract_canon_sha256":"56a13260ff4f907a21ec5a96d3c67ecf355b194a174e8c14ae3273e988732166"},"schema_version":"1.0"},"canonical_sha256":"490e3e92120e86f358c015166f3a01b8c8fe16e68899a515cd1cb07bbb6cc13f","source":{"kind":"arxiv","id":"1301.7482","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.7482","created_at":"2026-05-18T03:34:49Z"},{"alias_kind":"arxiv_version","alias_value":"1301.7482v1","created_at":"2026-05-18T03:34:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7482","created_at":"2026-05-18T03:34:49Z"},{"alias_kind":"pith_short_12","alias_value":"JEHD5EQSB2DP","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JEHD5EQSB2DPGWGA","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JEHD5EQS","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:JEHD5EQSB2DPGWGACULG6OQBXD","target":"record","payload":{"canonical_record":{"source":{"id":"1301.7482","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-01-31T00:33:24Z","cross_cats_sorted":[],"title_canon_sha256":"44fbf85feed1895b08fe1f71e51d1a095020ca420931abfa50e10d4ad2e4262e","abstract_canon_sha256":"56a13260ff4f907a21ec5a96d3c67ecf355b194a174e8c14ae3273e988732166"},"schema_version":"1.0"},"canonical_sha256":"490e3e92120e86f358c015166f3a01b8c8fe16e68899a515cd1cb07bbb6cc13f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:49.412205Z","signature_b64":"CAYI5AfyyZQrvY9xNOMV0dJGksFTYF2rDoYEQBCfMqDrK1VfhtZ1PEl7zXx7SlWvgOKTnVCLhNoSvV2BL32ZCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"490e3e92120e86f358c015166f3a01b8c8fe16e68899a515cd1cb07bbb6cc13f","last_reissued_at":"2026-05-18T03:34:49.411659Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:49.411659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.7482","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-18T03:34:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N+XfFa5sLxnVLnHtM5PEz8zMb4vTETpBZMXXKsHh8KCKvzfQLP4QMsgBTeExcHjldhDXEDEGjFGNKRZubVOdAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:33:11.032686Z"},"content_sha256":"1ec4b369fc03741d874b6793e9305feba5901276ccc98a621005561af99006ff","schema_version":"1.0","event_id":"sha256:1ec4b369fc03741d874b6793e9305feba5901276ccc98a621005561af99006ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:JEHD5EQSB2DPGWGACULG6OQBXD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Technical Report: A Receding Horizon Algorithm for Informative Path Planning with Temporal Logic Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Austin Jones, Calin Belta, Mac Schwager","submitted_at":"2013-01-31T00:33:24Z","abstract_excerpt":"This technical report is an extended version of the paper 'A Receding Horizon Algorithm for Informative Path Planning with Temporal Logic Constraints' accepted to the 2013 IEEE International Conference on Robotics and Automation (ICRA). This paper considers the problem of finding the most informative path for a sensing robot under temporal logic constraints, a richer set of constraints than have previously been considered in information gathering. An algorithm for informative path planning is presented that leverages tools from information theory and formal control synthesis, and is proven to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.7482","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-18T03:34:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hg1fkofpu36hTzlVcenqiWGAKZin1nCwk1Ausi1um6V1fk/2/BX6/sNH3sadjCrIaVz907w0fnCBMbi8w55TDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:33:11.033041Z"},"content_sha256":"4ea1825ba0ad8df5bb90ba9688204300810b8675fd757efa272b0b71d5e9d781","schema_version":"1.0","event_id":"sha256:4ea1825ba0ad8df5bb90ba9688204300810b8675fd757efa272b0b71d5e9d781"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JEHD5EQSB2DPGWGACULG6OQBXD/bundle.json","state_url":"https://pith.science/pith/JEHD5EQSB2DPGWGACULG6OQBXD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JEHD5EQSB2DPGWGACULG6OQBXD/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-31T06:33:11Z","links":{"resolver":"https://pith.science/pith/JEHD5EQSB2DPGWGACULG6OQBXD","bundle":"https://pith.science/pith/JEHD5EQSB2DPGWGACULG6OQBXD/bundle.json","state":"https://pith.science/pith/JEHD5EQSB2DPGWGACULG6OQBXD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JEHD5EQSB2DPGWGACULG6OQBXD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:JEHD5EQSB2DPGWGACULG6OQBXD","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":"56a13260ff4f907a21ec5a96d3c67ecf355b194a174e8c14ae3273e988732166","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-01-31T00:33:24Z","title_canon_sha256":"44fbf85feed1895b08fe1f71e51d1a095020ca420931abfa50e10d4ad2e4262e"},"schema_version":"1.0","source":{"id":"1301.7482","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.7482","created_at":"2026-05-18T03:34:49Z"},{"alias_kind":"arxiv_version","alias_value":"1301.7482v1","created_at":"2026-05-18T03:34:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7482","created_at":"2026-05-18T03:34:49Z"},{"alias_kind":"pith_short_12","alias_value":"JEHD5EQSB2DP","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JEHD5EQSB2DPGWGA","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JEHD5EQS","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:4ea1825ba0ad8df5bb90ba9688204300810b8675fd757efa272b0b71d5e9d781","target":"graph","created_at":"2026-05-18T03:34:49Z","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 technical report is an extended version of the paper 'A Receding Horizon Algorithm for Informative Path Planning with Temporal Logic Constraints' accepted to the 2013 IEEE International Conference on Robotics and Automation (ICRA). This paper considers the problem of finding the most informative path for a sensing robot under temporal logic constraints, a richer set of constraints than have previously been considered in information gathering. An algorithm for informative path planning is presented that leverages tools from information theory and formal control synthesis, and is proven to ","authors_text":"Austin Jones, Calin Belta, Mac Schwager","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-01-31T00:33:24Z","title":"Technical Report: A Receding Horizon Algorithm for Informative Path Planning with Temporal Logic Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.7482","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:1ec4b369fc03741d874b6793e9305feba5901276ccc98a621005561af99006ff","target":"record","created_at":"2026-05-18T03:34:49Z","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":"56a13260ff4f907a21ec5a96d3c67ecf355b194a174e8c14ae3273e988732166","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-01-31T00:33:24Z","title_canon_sha256":"44fbf85feed1895b08fe1f71e51d1a095020ca420931abfa50e10d4ad2e4262e"},"schema_version":"1.0","source":{"id":"1301.7482","kind":"arxiv","version":1}},"canonical_sha256":"490e3e92120e86f358c015166f3a01b8c8fe16e68899a515cd1cb07bbb6cc13f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"490e3e92120e86f358c015166f3a01b8c8fe16e68899a515cd1cb07bbb6cc13f","first_computed_at":"2026-05-18T03:34:49.411659Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:34:49.411659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CAYI5AfyyZQrvY9xNOMV0dJGksFTYF2rDoYEQBCfMqDrK1VfhtZ1PEl7zXx7SlWvgOKTnVCLhNoSvV2BL32ZCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:34:49.412205Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.7482","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ec4b369fc03741d874b6793e9305feba5901276ccc98a621005561af99006ff","sha256:4ea1825ba0ad8df5bb90ba9688204300810b8675fd757efa272b0b71d5e9d781"],"state_sha256":"9648c20b683a243767b027f0da2417397f5fc305e660416eb0da9c7b4e571503"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uvR0B0w5otGfcFYcSjVBysZv79zk2bPtbUKn3JaEp/x1of75pdDU1bq6pPRtPZ1rD2os+cTD52nGuH9+6PoECg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T06:33:11.036306Z","bundle_sha256":"a981a3e1896e4288b82d9851e048aacaf1592d730e73a1e33a71db6bd7e10f1a"}}