{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LC7OTUEM22LNJVJO7HUNCRECOT","short_pith_number":"pith:LC7OTUEM","canonical_record":{"source":{"id":"1701.00019","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-12-30T21:34:45Z","cross_cats_sorted":[],"title_canon_sha256":"cd0ad1412c3674470cd16149be9c0477c1ccf42580076812c84a0a4dbc8178ca","abstract_canon_sha256":"6db31472820b57aeb83f9b9191442120977c984314ee9e09b93ed12b4337238a"},"schema_version":"1.0"},"canonical_sha256":"58bee9d08cd696d4d52ef9e8d1448274c49478722914620a6f9fb5503866f8d2","source":{"kind":"arxiv","id":"1701.00019","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.00019","created_at":"2026-05-18T00:53:39Z"},{"alias_kind":"arxiv_version","alias_value":"1701.00019v1","created_at":"2026-05-18T00:53:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.00019","created_at":"2026-05-18T00:53:39Z"},{"alias_kind":"pith_short_12","alias_value":"LC7OTUEM22LN","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LC7OTUEM22LNJVJO","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LC7OTUEM","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LC7OTUEM22LNJVJO7HUNCRECOT","target":"record","payload":{"canonical_record":{"source":{"id":"1701.00019","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-12-30T21:34:45Z","cross_cats_sorted":[],"title_canon_sha256":"cd0ad1412c3674470cd16149be9c0477c1ccf42580076812c84a0a4dbc8178ca","abstract_canon_sha256":"6db31472820b57aeb83f9b9191442120977c984314ee9e09b93ed12b4337238a"},"schema_version":"1.0"},"canonical_sha256":"58bee9d08cd696d4d52ef9e8d1448274c49478722914620a6f9fb5503866f8d2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:39.629293Z","signature_b64":"p7Q4pEIfRRNvry9zjDsbRNcML9cVagltNAt7mvvPHrOpETVlSxqTFgHwrA12TRYJeDRXW1wib2fHltcg8qD/Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58bee9d08cd696d4d52ef9e8d1448274c49478722914620a6f9fb5503866f8d2","last_reissued_at":"2026-05-18T00:53:39.628836Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:39.628836Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.00019","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-18T00:53:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wKYNUrQsw/9i8EfQOOgV68JHe2BnUDXCAS2aDd85kh+mTIm3Txz4RzG8SFe3yGWSGSaWrsqS7Gj57WU5t0NnAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:24:18.483373Z"},"content_sha256":"10ceeefd002d4a36f46806a440a98bfcd8abe85d5a2e302d125e7e1f4a273aed","schema_version":"1.0","event_id":"sha256:10ceeefd002d4a36f46806a440a98bfcd8abe85d5a2e302d125e7e1f4a273aed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LC7OTUEM22LNJVJO7HUNCRECOT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Technical Report: Optimal Surveillance of Dynamic Parades using Teams of Aerial Robots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Kostas Alexis","submitted_at":"2016-12-30T21:34:45Z","abstract_excerpt":"This technical report addresses the problem of optimal surveillance of the route followed by a dynamic parade using a team of aerial robots. The dynamic parade is considered to take place within an urban environment, it is discretized and at every iteration, the algorithm computes the best possible placing of the aerial robotic team members, subject to their camera model and the occlusions arising from the environment. As the parade route is only as well covered as its least-covered point, the optimization objective is to place the aerial robots such that they maximize the minimum coverage ove"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.00019","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-18T00:53:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wf1AXeCS42Qcwqo8HEacXSiV/zYNrSRW8H2PEWgSaJTnh7D2M1xXFpK+wKFB79WQcCRM/aRH3L+A1S210g/5CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:24:18.484001Z"},"content_sha256":"dd3be7ec349f279ecd9007eb854d56b44eb13eee2d54c984598a7628566a5140","schema_version":"1.0","event_id":"sha256:dd3be7ec349f279ecd9007eb854d56b44eb13eee2d54c984598a7628566a5140"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LC7OTUEM22LNJVJO7HUNCRECOT/bundle.json","state_url":"https://pith.science/pith/LC7OTUEM22LNJVJO7HUNCRECOT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LC7OTUEM22LNJVJO7HUNCRECOT/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-30T07:24:18Z","links":{"resolver":"https://pith.science/pith/LC7OTUEM22LNJVJO7HUNCRECOT","bundle":"https://pith.science/pith/LC7OTUEM22LNJVJO7HUNCRECOT/bundle.json","state":"https://pith.science/pith/LC7OTUEM22LNJVJO7HUNCRECOT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LC7OTUEM22LNJVJO7HUNCRECOT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LC7OTUEM22LNJVJO7HUNCRECOT","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":"6db31472820b57aeb83f9b9191442120977c984314ee9e09b93ed12b4337238a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-12-30T21:34:45Z","title_canon_sha256":"cd0ad1412c3674470cd16149be9c0477c1ccf42580076812c84a0a4dbc8178ca"},"schema_version":"1.0","source":{"id":"1701.00019","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.00019","created_at":"2026-05-18T00:53:39Z"},{"alias_kind":"arxiv_version","alias_value":"1701.00019v1","created_at":"2026-05-18T00:53:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.00019","created_at":"2026-05-18T00:53:39Z"},{"alias_kind":"pith_short_12","alias_value":"LC7OTUEM22LN","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LC7OTUEM22LNJVJO","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LC7OTUEM","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:dd3be7ec349f279ecd9007eb854d56b44eb13eee2d54c984598a7628566a5140","target":"graph","created_at":"2026-05-18T00:53:39Z","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 addresses the problem of optimal surveillance of the route followed by a dynamic parade using a team of aerial robots. The dynamic parade is considered to take place within an urban environment, it is discretized and at every iteration, the algorithm computes the best possible placing of the aerial robotic team members, subject to their camera model and the occlusions arising from the environment. As the parade route is only as well covered as its least-covered point, the optimization objective is to place the aerial robots such that they maximize the minimum coverage ove","authors_text":"Kostas Alexis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-12-30T21:34:45Z","title":"Technical Report: Optimal Surveillance of Dynamic Parades using Teams of Aerial Robots"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.00019","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:10ceeefd002d4a36f46806a440a98bfcd8abe85d5a2e302d125e7e1f4a273aed","target":"record","created_at":"2026-05-18T00:53:39Z","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":"6db31472820b57aeb83f9b9191442120977c984314ee9e09b93ed12b4337238a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-12-30T21:34:45Z","title_canon_sha256":"cd0ad1412c3674470cd16149be9c0477c1ccf42580076812c84a0a4dbc8178ca"},"schema_version":"1.0","source":{"id":"1701.00019","kind":"arxiv","version":1}},"canonical_sha256":"58bee9d08cd696d4d52ef9e8d1448274c49478722914620a6f9fb5503866f8d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"58bee9d08cd696d4d52ef9e8d1448274c49478722914620a6f9fb5503866f8d2","first_computed_at":"2026-05-18T00:53:39.628836Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:39.628836Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p7Q4pEIfRRNvry9zjDsbRNcML9cVagltNAt7mvvPHrOpETVlSxqTFgHwrA12TRYJeDRXW1wib2fHltcg8qD/Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:39.629293Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.00019","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:10ceeefd002d4a36f46806a440a98bfcd8abe85d5a2e302d125e7e1f4a273aed","sha256:dd3be7ec349f279ecd9007eb854d56b44eb13eee2d54c984598a7628566a5140"],"state_sha256":"5e6cbd3d359421979316291cb899d7dcdd2a9eb40941a00c99d46c79e253185a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8NM861TbHmprGpLqs5zBEqBGKs7sqeXQ3MlfuyD7nNJRvpMrfCN5jl9RionxYxkWBNpkG69+52pcaFXazjLhBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:24:18.487307Z","bundle_sha256":"2a19e45bd5efc4524ca180687c9f8a89904e56f2e91f02782be8e9b2b9be3af3"}}