{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:2VHXEKVS5W3OD4ESSZLJ6457GH","short_pith_number":"pith:2VHXEKVS","schema_version":"1.0","canonical_sha256":"d54f722ab2edb6e1f09296569f73bf31e0c7ecddef1b920f019564496bd969ad","source":{"kind":"arxiv","id":"1309.5390","version":1},"attestation_state":"computed","paper":{"title":"Information Acquisition with Sensing Robots: Algorithms and Error Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO","math.DS","math.OC"],"primary_cat":"cs.SY","authors_text":"George J. Pappas, Jerome Le Ny, Kostas Daniilidis, Nikolay Atanasov","submitted_at":"2013-09-20T21:04:39Z","abstract_excerpt":"Utilizing the capabilities of configurable sensing systems requires addressing difficult information gathering problems. Near-optimal approaches exist for sensing systems without internal states. However, when it comes to optimizing the trajectories of mobile sensors the solutions are often greedy and rarely provide performance guarantees. Notably, under linear Gaussian assumptions, the problem becomes deterministic and can be solved off-line. Approaches based on submodularity have been applied by ignoring the sensor dynamics and greedily selecting informative locations in the environment. Thi"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1309.5390","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-09-20T21:04:39Z","cross_cats_sorted":["cs.RO","math.DS","math.OC"],"title_canon_sha256":"e6a2b9d37f50a3777549e35eaf6a5fdab52cb7a1e99faf12689ff36496654fd8","abstract_canon_sha256":"168109bc0dafb8fce07c531c463a8b19eae573d16dae4bbb83b6ea3e6c1b9ee6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:45.820367Z","signature_b64":"IVINM7oZUNzw/ZJX62HUCCNJM0soWLPlBBSto3DV3XR3TFCNI1u68ktIKphI88Xba1h/Jo3NE7595dyOsgz3Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d54f722ab2edb6e1f09296569f73bf31e0c7ecddef1b920f019564496bd969ad","last_reissued_at":"2026-05-18T03:12:45.819521Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:45.819521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Information Acquisition with Sensing Robots: Algorithms and Error Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO","math.DS","math.OC"],"primary_cat":"cs.SY","authors_text":"George J. Pappas, Jerome Le Ny, Kostas Daniilidis, Nikolay Atanasov","submitted_at":"2013-09-20T21:04:39Z","abstract_excerpt":"Utilizing the capabilities of configurable sensing systems requires addressing difficult information gathering problems. Near-optimal approaches exist for sensing systems without internal states. However, when it comes to optimizing the trajectories of mobile sensors the solutions are often greedy and rarely provide performance guarantees. Notably, under linear Gaussian assumptions, the problem becomes deterministic and can be solved off-line. Approaches based on submodularity have been applied by ignoring the sensor dynamics and greedily selecting informative locations in the environment. Thi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5390","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1309.5390","created_at":"2026-05-18T03:12:45.819646+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.5390v1","created_at":"2026-05-18T03:12:45.819646+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5390","created_at":"2026-05-18T03:12:45.819646+00:00"},{"alias_kind":"pith_short_12","alias_value":"2VHXEKVS5W3O","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"2VHXEKVS5W3OD4ES","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"2VHXEKVS","created_at":"2026-05-18T12:27:32.513160+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2VHXEKVS5W3OD4ESSZLJ6457GH","json":"https://pith.science/pith/2VHXEKVS5W3OD4ESSZLJ6457GH.json","graph_json":"https://pith.science/api/pith-number/2VHXEKVS5W3OD4ESSZLJ6457GH/graph.json","events_json":"https://pith.science/api/pith-number/2VHXEKVS5W3OD4ESSZLJ6457GH/events.json","paper":"https://pith.science/paper/2VHXEKVS"},"agent_actions":{"view_html":"https://pith.science/pith/2VHXEKVS5W3OD4ESSZLJ6457GH","download_json":"https://pith.science/pith/2VHXEKVS5W3OD4ESSZLJ6457GH.json","view_paper":"https://pith.science/paper/2VHXEKVS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.5390&json=true","fetch_graph":"https://pith.science/api/pith-number/2VHXEKVS5W3OD4ESSZLJ6457GH/graph.json","fetch_events":"https://pith.science/api/pith-number/2VHXEKVS5W3OD4ESSZLJ6457GH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2VHXEKVS5W3OD4ESSZLJ6457GH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2VHXEKVS5W3OD4ESSZLJ6457GH/action/storage_attestation","attest_author":"https://pith.science/pith/2VHXEKVS5W3OD4ESSZLJ6457GH/action/author_attestation","sign_citation":"https://pith.science/pith/2VHXEKVS5W3OD4ESSZLJ6457GH/action/citation_signature","submit_replication":"https://pith.science/pith/2VHXEKVS5W3OD4ESSZLJ6457GH/action/replication_record"}},"created_at":"2026-05-18T03:12:45.819646+00:00","updated_at":"2026-05-18T03:12:45.819646+00:00"}