{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:AH7ID4XYPWYQLMJ3VU4YB64LN5","short_pith_number":"pith:AH7ID4XY","canonical_record":{"source":{"id":"1208.5855","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2012-08-29T08:13:24Z","cross_cats_sorted":[],"title_canon_sha256":"f9350f55937843ddc381c375722376a73a5a0464c2647791384e438fa163e373","abstract_canon_sha256":"95e0cae1f9b9b197245658af9046fe4b95f00a221a2ba3491a312a6834735eea"},"schema_version":"1.0"},"canonical_sha256":"01fe81f2f87db105b13bad3980fb8b6f627127082db7df963977557601307d2a","source":{"kind":"arxiv","id":"1208.5855","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.5855","created_at":"2026-05-18T03:46:48Z"},{"alias_kind":"arxiv_version","alias_value":"1208.5855v1","created_at":"2026-05-18T03:46:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.5855","created_at":"2026-05-18T03:46:48Z"},{"alias_kind":"pith_short_12","alias_value":"AH7ID4XYPWYQ","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"AH7ID4XYPWYQLMJ3","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"AH7ID4XY","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:AH7ID4XYPWYQLMJ3VU4YB64LN5","target":"record","payload":{"canonical_record":{"source":{"id":"1208.5855","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2012-08-29T08:13:24Z","cross_cats_sorted":[],"title_canon_sha256":"f9350f55937843ddc381c375722376a73a5a0464c2647791384e438fa163e373","abstract_canon_sha256":"95e0cae1f9b9b197245658af9046fe4b95f00a221a2ba3491a312a6834735eea"},"schema_version":"1.0"},"canonical_sha256":"01fe81f2f87db105b13bad3980fb8b6f627127082db7df963977557601307d2a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:48.531124Z","signature_b64":"3solhc8DL0UEZkZNiOiFHEv/MmgW2JfNmKdEzU5o7NYkaPJYXAmnxkCmwKIePo3jzj8xpgoSTbfPD4Haw3faDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01fe81f2f87db105b13bad3980fb8b6f627127082db7df963977557601307d2a","last_reissued_at":"2026-05-18T03:46:48.530207Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:48.530207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.5855","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:46:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pfdpw+ncy8m0NV3hXmYdaHvUOB1YXQ2SZxSVWDG2KO/0Ltdz5jswRGiVwSQUdDiuXWuv/t8vdnBo9FG5189tCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:27:49.935511Z"},"content_sha256":"3077761f14eda833fbd5615adb3eb190aefd4a4bac0ea959a309ee9e5b04c337","schema_version":"1.0","event_id":"sha256:3077761f14eda833fbd5615adb3eb190aefd4a4bac0ea959a309ee9e5b04c337"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:AH7ID4XYPWYQLMJ3VU4YB64LN5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Attraction-Based Receding Horizon Path Planning with Temporal Logic Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Ivana Cerna, Jana Tumova, Jiri Barnat, Maria Svorenova","submitted_at":"2012-08-29T08:13:24Z","abstract_excerpt":"Our goal in this paper is to plan the motion of a robot in a partitioned environment with dynamically changing, locally sensed rewards. We assume that arbitrary assumptions on the reward dynamics can be given. The robot aims to accomplish a high-level temporal logic surveillance mission and to locally optimize the collection of the rewards in the visited regions. These two objectives often conflict and only a compromise between them can be reached. We address this issue by taking into consideration a user-defined preference function that captures the trade-off between the importance of collect"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.5855","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:46:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xIj0Si5jcOkx3KizlqDvkNXLOULFu5OniEPldkMC4QhM70tSjQTAZ//r2dS5zEYCEQApUWkfJG+c0I7GhW92CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:27:49.936269Z"},"content_sha256":"08e120c330394d665ea8879395fd5fddf6667b581e3c1bbe73c075d12bd50c2f","schema_version":"1.0","event_id":"sha256:08e120c330394d665ea8879395fd5fddf6667b581e3c1bbe73c075d12bd50c2f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AH7ID4XYPWYQLMJ3VU4YB64LN5/bundle.json","state_url":"https://pith.science/pith/AH7ID4XYPWYQLMJ3VU4YB64LN5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AH7ID4XYPWYQLMJ3VU4YB64LN5/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-08T19:27:49Z","links":{"resolver":"https://pith.science/pith/AH7ID4XYPWYQLMJ3VU4YB64LN5","bundle":"https://pith.science/pith/AH7ID4XYPWYQLMJ3VU4YB64LN5/bundle.json","state":"https://pith.science/pith/AH7ID4XYPWYQLMJ3VU4YB64LN5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AH7ID4XYPWYQLMJ3VU4YB64LN5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:AH7ID4XYPWYQLMJ3VU4YB64LN5","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":"95e0cae1f9b9b197245658af9046fe4b95f00a221a2ba3491a312a6834735eea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2012-08-29T08:13:24Z","title_canon_sha256":"f9350f55937843ddc381c375722376a73a5a0464c2647791384e438fa163e373"},"schema_version":"1.0","source":{"id":"1208.5855","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.5855","created_at":"2026-05-18T03:46:48Z"},{"alias_kind":"arxiv_version","alias_value":"1208.5855v1","created_at":"2026-05-18T03:46:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.5855","created_at":"2026-05-18T03:46:48Z"},{"alias_kind":"pith_short_12","alias_value":"AH7ID4XYPWYQ","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"AH7ID4XYPWYQLMJ3","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"AH7ID4XY","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:08e120c330394d665ea8879395fd5fddf6667b581e3c1bbe73c075d12bd50c2f","target":"graph","created_at":"2026-05-18T03:46:48Z","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":"Our goal in this paper is to plan the motion of a robot in a partitioned environment with dynamically changing, locally sensed rewards. We assume that arbitrary assumptions on the reward dynamics can be given. The robot aims to accomplish a high-level temporal logic surveillance mission and to locally optimize the collection of the rewards in the visited regions. These two objectives often conflict and only a compromise between them can be reached. We address this issue by taking into consideration a user-defined preference function that captures the trade-off between the importance of collect","authors_text":"Ivana Cerna, Jana Tumova, Jiri Barnat, Maria Svorenova","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2012-08-29T08:13:24Z","title":"Attraction-Based Receding Horizon Path Planning with Temporal Logic Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.5855","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:3077761f14eda833fbd5615adb3eb190aefd4a4bac0ea959a309ee9e5b04c337","target":"record","created_at":"2026-05-18T03:46:48Z","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":"95e0cae1f9b9b197245658af9046fe4b95f00a221a2ba3491a312a6834735eea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2012-08-29T08:13:24Z","title_canon_sha256":"f9350f55937843ddc381c375722376a73a5a0464c2647791384e438fa163e373"},"schema_version":"1.0","source":{"id":"1208.5855","kind":"arxiv","version":1}},"canonical_sha256":"01fe81f2f87db105b13bad3980fb8b6f627127082db7df963977557601307d2a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"01fe81f2f87db105b13bad3980fb8b6f627127082db7df963977557601307d2a","first_computed_at":"2026-05-18T03:46:48.530207Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:46:48.530207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3solhc8DL0UEZkZNiOiFHEv/MmgW2JfNmKdEzU5o7NYkaPJYXAmnxkCmwKIePo3jzj8xpgoSTbfPD4Haw3faDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:46:48.531124Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.5855","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3077761f14eda833fbd5615adb3eb190aefd4a4bac0ea959a309ee9e5b04c337","sha256:08e120c330394d665ea8879395fd5fddf6667b581e3c1bbe73c075d12bd50c2f"],"state_sha256":"00475cc13a9ce5db1ef511e535d827b3b98125d91619705a2c3dc6c5e9d95b46"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HEzEbD2hhmG51g2amZbGuCGIT72mig15EInbjKvwJviSK2S8RB48HEvKOMWEeOCxm9U4+J5uDLPEL2cc+TKCCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T19:27:49.940360Z","bundle_sha256":"6c46070c3a66400d6e231ff7ec8beffaf3ee77868e7bea25e746d49da10c7192"}}