{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZWCV4HX7MT7RXMCKLDJXOS6XAH","short_pith_number":"pith:ZWCV4HX7","canonical_record":{"source":{"id":"1808.02545","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-07T20:30:02Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"7fc3010bae41a18946dbc2f03b07ca40032cb08ba9ffa474360c0c6c825baa0f","abstract_canon_sha256":"8c45cbb7aae1f84c4bb24640abfbc2438d734e403ec4a5a460c648917cfa5303"},"schema_version":"1.0"},"canonical_sha256":"cd855e1eff64ff1bb04a58d3774bd701cb2b1939c414f5ed91497fb6d4a88d61","source":{"kind":"arxiv","id":"1808.02545","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.02545","created_at":"2026-05-17T23:44:22Z"},{"alias_kind":"arxiv_version","alias_value":"1808.02545v2","created_at":"2026-05-17T23:44:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02545","created_at":"2026-05-17T23:44:22Z"},{"alias_kind":"pith_short_12","alias_value":"ZWCV4HX7MT7R","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZWCV4HX7MT7RXMCK","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZWCV4HX7","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZWCV4HX7MT7RXMCKLDJXOS6XAH","target":"record","payload":{"canonical_record":{"source":{"id":"1808.02545","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-07T20:30:02Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"7fc3010bae41a18946dbc2f03b07ca40032cb08ba9ffa474360c0c6c825baa0f","abstract_canon_sha256":"8c45cbb7aae1f84c4bb24640abfbc2438d734e403ec4a5a460c648917cfa5303"},"schema_version":"1.0"},"canonical_sha256":"cd855e1eff64ff1bb04a58d3774bd701cb2b1939c414f5ed91497fb6d4a88d61","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:22.509111Z","signature_b64":"/jSsGZP4Hs/0LbFHcoGVZ6M7Cp/XCaU278LNalyo8iD9r64GL9VA82BXvvfObqMCxszk3E8ad4/DJRIEAUDpAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd855e1eff64ff1bb04a58d3774bd701cb2b1939c414f5ed91497fb6d4a88d61","last_reissued_at":"2026-05-17T23:44:22.508415Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:22.508415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.02545","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-17T23:44:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S2GYvpCugqAxBLsNREiyf0h+A4SEBPJJGh5LxgunSTpkWe4UCYHdPk+vMUPgRneV/C7r2Xmo+0kb+vGhXwSKDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:39:16.240367Z"},"content_sha256":"a416df6e3d02bd7b5bd357dfa4ea081344600ce3b7062068cb84fe20950ad41c","schema_version":"1.0","event_id":"sha256:a416df6e3d02bd7b5bd357dfa4ea081344600ce3b7062068cb84fe20950ad41c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZWCV4HX7MT7RXMCKLDJXOS6XAH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Persistent Monitoring of Dynamically Changing Environments Using an Unmanned Vehicle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.DS","authors_text":"David Casbeer, Krishnamoorthy Kalyanam, Sai Krishna Kanth Hari, Satyanarayana Gupta Manyam, Sivakumar Rathinam, Swaroop Darbha","submitted_at":"2018-08-07T20:30:02Z","abstract_excerpt":"We consider the problem of planning a closed walk $\\mathcal W$ for a UAV to persistently monitor a finite number of stationary targets with equal priorities and dynamically changing properties. A UAV must physically visit the targets in order to monitor them and collect information therein. The frequency of monitoring any given target is specified by a target revisit time, $i.e.$, the maximum allowable time between any two successive visits to the target. The problem considered in this paper is the following: Given $n$ targets and $k \\geq n$ allowed visits to them, find an optimal closed walk "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.02545","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-17T23:44:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IAx3z8INwDrRmZ7IS+o06/YhUWL65YxcyINa+psKCahNca2kiPN0cigYc+VFIFPR3E8dSzQh6g+juoBPmVLaBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:39:16.241368Z"},"content_sha256":"855106243e44e9836af30293cb4d6577141aa8e3ff5a6da529eab76108052ce9","schema_version":"1.0","event_id":"sha256:855106243e44e9836af30293cb4d6577141aa8e3ff5a6da529eab76108052ce9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZWCV4HX7MT7RXMCKLDJXOS6XAH/bundle.json","state_url":"https://pith.science/pith/ZWCV4HX7MT7RXMCKLDJXOS6XAH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZWCV4HX7MT7RXMCKLDJXOS6XAH/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-30T17:39:16Z","links":{"resolver":"https://pith.science/pith/ZWCV4HX7MT7RXMCKLDJXOS6XAH","bundle":"https://pith.science/pith/ZWCV4HX7MT7RXMCKLDJXOS6XAH/bundle.json","state":"https://pith.science/pith/ZWCV4HX7MT7RXMCKLDJXOS6XAH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZWCV4HX7MT7RXMCKLDJXOS6XAH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZWCV4HX7MT7RXMCKLDJXOS6XAH","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":"8c45cbb7aae1f84c4bb24640abfbc2438d734e403ec4a5a460c648917cfa5303","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-07T20:30:02Z","title_canon_sha256":"7fc3010bae41a18946dbc2f03b07ca40032cb08ba9ffa474360c0c6c825baa0f"},"schema_version":"1.0","source":{"id":"1808.02545","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.02545","created_at":"2026-05-17T23:44:22Z"},{"alias_kind":"arxiv_version","alias_value":"1808.02545v2","created_at":"2026-05-17T23:44:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02545","created_at":"2026-05-17T23:44:22Z"},{"alias_kind":"pith_short_12","alias_value":"ZWCV4HX7MT7R","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZWCV4HX7MT7RXMCK","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZWCV4HX7","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:855106243e44e9836af30293cb4d6577141aa8e3ff5a6da529eab76108052ce9","target":"graph","created_at":"2026-05-17T23:44:22Z","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 consider the problem of planning a closed walk $\\mathcal W$ for a UAV to persistently monitor a finite number of stationary targets with equal priorities and dynamically changing properties. A UAV must physically visit the targets in order to monitor them and collect information therein. The frequency of monitoring any given target is specified by a target revisit time, $i.e.$, the maximum allowable time between any two successive visits to the target. The problem considered in this paper is the following: Given $n$ targets and $k \\geq n$ allowed visits to them, find an optimal closed walk ","authors_text":"David Casbeer, Krishnamoorthy Kalyanam, Sai Krishna Kanth Hari, Satyanarayana Gupta Manyam, Sivakumar Rathinam, Swaroop Darbha","cross_cats":["cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-07T20:30:02Z","title":"Persistent Monitoring of Dynamically Changing Environments Using an Unmanned Vehicle"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.02545","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:a416df6e3d02bd7b5bd357dfa4ea081344600ce3b7062068cb84fe20950ad41c","target":"record","created_at":"2026-05-17T23:44:22Z","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":"8c45cbb7aae1f84c4bb24640abfbc2438d734e403ec4a5a460c648917cfa5303","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-07T20:30:02Z","title_canon_sha256":"7fc3010bae41a18946dbc2f03b07ca40032cb08ba9ffa474360c0c6c825baa0f"},"schema_version":"1.0","source":{"id":"1808.02545","kind":"arxiv","version":2}},"canonical_sha256":"cd855e1eff64ff1bb04a58d3774bd701cb2b1939c414f5ed91497fb6d4a88d61","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd855e1eff64ff1bb04a58d3774bd701cb2b1939c414f5ed91497fb6d4a88d61","first_computed_at":"2026-05-17T23:44:22.508415Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:22.508415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/jSsGZP4Hs/0LbFHcoGVZ6M7Cp/XCaU278LNalyo8iD9r64GL9VA82BXvvfObqMCxszk3E8ad4/DJRIEAUDpAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:22.509111Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.02545","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a416df6e3d02bd7b5bd357dfa4ea081344600ce3b7062068cb84fe20950ad41c","sha256:855106243e44e9836af30293cb4d6577141aa8e3ff5a6da529eab76108052ce9"],"state_sha256":"8ce03ecc950dc372115d8db60a6ce046c3f0fe10de46d28e74098d7fae484ebf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P+dbmuR4cSzGaLQ2zGVoYF/keCu+OWdNc4RZAGAase2tMfFaRm4vbt7+wWgIp/XlNqUurnu/ITTJe3rGkUc6BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T17:39:16.246571Z","bundle_sha256":"f9e6b50c08ba1438f273130667a1699c05708fad63f4d5285e90b8b696095e62"}}