{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:AO7CQHLCFOPRYECBRGFNOR2HQJ","short_pith_number":"pith:AO7CQHLC","canonical_record":{"source":{"id":"1503.06133","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-03-20T16:04:20Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"802ee6419a4aa3f0fbab2ec0ab5f154242f29e3658e29bccb5c6d31ad285f5e0","abstract_canon_sha256":"a9f7fdbbd661e2778961fa3a3dc114c9cd8efe6b36544cfd9724f93e6610a9a5"},"schema_version":"1.0"},"canonical_sha256":"03be281d622b9f1c1041898ad74747826a20f1f690205c9c02e32bc564954394","source":{"kind":"arxiv","id":"1503.06133","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.06133","created_at":"2026-05-18T01:34:30Z"},{"alias_kind":"arxiv_version","alias_value":"1503.06133v2","created_at":"2026-05-18T01:34:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.06133","created_at":"2026-05-18T01:34:30Z"},{"alias_kind":"pith_short_12","alias_value":"AO7CQHLCFOPR","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AO7CQHLCFOPRYECB","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AO7CQHLC","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:AO7CQHLCFOPRYECBRGFNOR2HQJ","target":"record","payload":{"canonical_record":{"source":{"id":"1503.06133","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-03-20T16:04:20Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"802ee6419a4aa3f0fbab2ec0ab5f154242f29e3658e29bccb5c6d31ad285f5e0","abstract_canon_sha256":"a9f7fdbbd661e2778961fa3a3dc114c9cd8efe6b36544cfd9724f93e6610a9a5"},"schema_version":"1.0"},"canonical_sha256":"03be281d622b9f1c1041898ad74747826a20f1f690205c9c02e32bc564954394","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:30.889350Z","signature_b64":"qvnfgVroBsaWzVBiP05ME4XNSyuUQ5rOj6K9lNODWxNGhnV/e/ezhvOLnryQRk0OwzYuMqlVAWW5qJjz5yIrBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03be281d622b9f1c1041898ad74747826a20f1f690205c9c02e32bc564954394","last_reissued_at":"2026-05-18T01:34:30.888963Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:30.888963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.06133","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:34:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+zZUkXo+GWyt+mo/ScYIFKoyOBQledRDiWaW9JYY14c32sWlRxlBE+cWZgnT0WqNiDZu7Ae2AJED/KNYaNXaDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T15:45:28.586418Z"},"content_sha256":"5a64fdc6a1b392e4ed37c0fb7b35de941c4458be4726b40ed2d027a22a197e5b","schema_version":"1.0","event_id":"sha256:5a64fdc6a1b392e4ed37c0fb7b35de941c4458be4726b40ed2d027a22a197e5b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:AO7CQHLCFOPRYECBRGFNOR2HQJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Optimal Control Approach for the Data Harvesting Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Christos G. Cassandras, Yasaman Khazaeni","submitted_at":"2015-03-20T16:04:20Z","abstract_excerpt":"We propose a new method for trajectory planning to solve the data harvesting problem. In a two-dimensional mission space, $N$ mobile agents are tasked with the collection of data generated at $M$ stationary sources and delivery to a base aiming at minimizing expected delays. An optimal control formulation of this problem provides some initial insights regarding its solution, but it is computationally intractable, especially in the case where the data generating processes are stochastic. We propose an agent trajectory parameterization in terms of general function families which can be subsequen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.06133","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:34:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b6zmq9WxH6aOV402M+jBaJVH+hkwkgx0haqkmaG/sWZRONJHXL85pXAnt5OWpYNs+625KthTHvL0UDxn+YX+Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T15:45:28.586770Z"},"content_sha256":"6ec8d2953416a19b3bc80e155b33ac0df21bf11558f630073217352ef7e8f319","schema_version":"1.0","event_id":"sha256:6ec8d2953416a19b3bc80e155b33ac0df21bf11558f630073217352ef7e8f319"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AO7CQHLCFOPRYECBRGFNOR2HQJ/bundle.json","state_url":"https://pith.science/pith/AO7CQHLCFOPRYECBRGFNOR2HQJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AO7CQHLCFOPRYECBRGFNOR2HQJ/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-05T15:45:28Z","links":{"resolver":"https://pith.science/pith/AO7CQHLCFOPRYECBRGFNOR2HQJ","bundle":"https://pith.science/pith/AO7CQHLCFOPRYECBRGFNOR2HQJ/bundle.json","state":"https://pith.science/pith/AO7CQHLCFOPRYECBRGFNOR2HQJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AO7CQHLCFOPRYECBRGFNOR2HQJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:AO7CQHLCFOPRYECBRGFNOR2HQJ","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":"a9f7fdbbd661e2778961fa3a3dc114c9cd8efe6b36544cfd9724f93e6610a9a5","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-03-20T16:04:20Z","title_canon_sha256":"802ee6419a4aa3f0fbab2ec0ab5f154242f29e3658e29bccb5c6d31ad285f5e0"},"schema_version":"1.0","source":{"id":"1503.06133","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.06133","created_at":"2026-05-18T01:34:30Z"},{"alias_kind":"arxiv_version","alias_value":"1503.06133v2","created_at":"2026-05-18T01:34:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.06133","created_at":"2026-05-18T01:34:30Z"},{"alias_kind":"pith_short_12","alias_value":"AO7CQHLCFOPR","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AO7CQHLCFOPRYECB","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AO7CQHLC","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:6ec8d2953416a19b3bc80e155b33ac0df21bf11558f630073217352ef7e8f319","target":"graph","created_at":"2026-05-18T01:34:30Z","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 propose a new method for trajectory planning to solve the data harvesting problem. In a two-dimensional mission space, $N$ mobile agents are tasked with the collection of data generated at $M$ stationary sources and delivery to a base aiming at minimizing expected delays. An optimal control formulation of this problem provides some initial insights regarding its solution, but it is computationally intractable, especially in the case where the data generating processes are stochastic. We propose an agent trajectory parameterization in terms of general function families which can be subsequen","authors_text":"Christos G. Cassandras, Yasaman Khazaeni","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-03-20T16:04:20Z","title":"An Optimal Control Approach for the Data Harvesting Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.06133","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:5a64fdc6a1b392e4ed37c0fb7b35de941c4458be4726b40ed2d027a22a197e5b","target":"record","created_at":"2026-05-18T01:34:30Z","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":"a9f7fdbbd661e2778961fa3a3dc114c9cd8efe6b36544cfd9724f93e6610a9a5","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-03-20T16:04:20Z","title_canon_sha256":"802ee6419a4aa3f0fbab2ec0ab5f154242f29e3658e29bccb5c6d31ad285f5e0"},"schema_version":"1.0","source":{"id":"1503.06133","kind":"arxiv","version":2}},"canonical_sha256":"03be281d622b9f1c1041898ad74747826a20f1f690205c9c02e32bc564954394","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03be281d622b9f1c1041898ad74747826a20f1f690205c9c02e32bc564954394","first_computed_at":"2026-05-18T01:34:30.888963Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:30.888963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qvnfgVroBsaWzVBiP05ME4XNSyuUQ5rOj6K9lNODWxNGhnV/e/ezhvOLnryQRk0OwzYuMqlVAWW5qJjz5yIrBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:30.889350Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.06133","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a64fdc6a1b392e4ed37c0fb7b35de941c4458be4726b40ed2d027a22a197e5b","sha256:6ec8d2953416a19b3bc80e155b33ac0df21bf11558f630073217352ef7e8f319"],"state_sha256":"b36a4563e83e7f0a57bf8a524e8676a21e671c287b01ce10f1053a96609be2b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BbWIo6S3g71kWqfKilndsIVI4ALHs06JokpgnDkEwz2HTrT6YwSp7YLX6xVanKHnjOrzpEnefUxNKUTcUfenBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T15:45:28.589088Z","bundle_sha256":"86a38e28dc8f19e954275b5f15a8495ab32dcfeeec6bf5741ea58d855848f5e1"}}