{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KPEBMLINKEWIUBYBZXOEHBMT72","short_pith_number":"pith:KPEBMLIN","canonical_record":{"source":{"id":"1803.02798","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-07T18:17:22Z","cross_cats_sorted":[],"title_canon_sha256":"98ed2a81419fd77b648f3d17737df6e188ce45a530ee9ada3b4b4826104052b2","abstract_canon_sha256":"0191c9f0c33ada61ace9af82cbe6c5ebaa49c67108c84f561fb35247a2f008da"},"schema_version":"1.0"},"canonical_sha256":"53c8162d0d512c8a0701cddc438593feade6aba15e78ff0691aa09a3c0e02e82","source":{"kind":"arxiv","id":"1803.02798","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.02798","created_at":"2026-05-18T00:21:49Z"},{"alias_kind":"arxiv_version","alias_value":"1803.02798v1","created_at":"2026-05-18T00:21:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.02798","created_at":"2026-05-18T00:21:49Z"},{"alias_kind":"pith_short_12","alias_value":"KPEBMLINKEWI","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KPEBMLINKEWIUBYB","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KPEBMLIN","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KPEBMLINKEWIUBYBZXOEHBMT72","target":"record","payload":{"canonical_record":{"source":{"id":"1803.02798","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-07T18:17:22Z","cross_cats_sorted":[],"title_canon_sha256":"98ed2a81419fd77b648f3d17737df6e188ce45a530ee9ada3b4b4826104052b2","abstract_canon_sha256":"0191c9f0c33ada61ace9af82cbe6c5ebaa49c67108c84f561fb35247a2f008da"},"schema_version":"1.0"},"canonical_sha256":"53c8162d0d512c8a0701cddc438593feade6aba15e78ff0691aa09a3c0e02e82","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:49.220819Z","signature_b64":"PIFppZhqAbh44WITpNK1BG2Rxc/Wb4+BCEL6gzPNfCCRxkVzg/XcV28RQQ+QQWhiHpYXZLNeFj7TAVMCCNf3Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53c8162d0d512c8a0701cddc438593feade6aba15e78ff0691aa09a3c0e02e82","last_reissued_at":"2026-05-18T00:21:49.220250Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:49.220250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.02798","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:21:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VtCsrBr5ej+RrtpzKXRifaO4wDWjKgIkTa5d4bKmp+WfO4L4s1ihO7YapQPAUD6jwLomQZhIz8MvfeOvtJ2GBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T16:10:01.864155Z"},"content_sha256":"738652cad579bb3a09182625fa18d86ed2e9f879f89de95b124e379dbeefc9ed","schema_version":"1.0","event_id":"sha256:738652cad579bb3a09182625fa18d86ed2e9f879f89de95b124e379dbeefc9ed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KPEBMLINKEWIUBYBZXOEHBMT72","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Threshold-Based Control Policies for Persistent Monitoring on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Christos G. Cassandras, Nan Zhou, Sean B. Andersson, Xi Yu","submitted_at":"2018-03-07T18:17:22Z","abstract_excerpt":"We consider the optimal multi-agent persistent monitoring problem defined by a team of cooperating agents visiting a set of nodes (targets) on a graph with the objective of minimizing a measure of overall node state uncertainty. The solution to this problem involves agent trajectories defined both by the sequence of nodes to be visited by each agent and the amount of time spent at each node. Since such optimal trajectories are generally intractable, we propose a class of distributed threshold-based parametric controllers through which agent transitions from one node to the next are controlled "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.02798","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:21:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"363O23/znFNW3ZXlDqfwaHOGg2aqOeIMEi5dhaNm9I8JEaVVQknxCWztB6aIBfMZygQxZqqsey69KC0kQrGMDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T16:10:01.864520Z"},"content_sha256":"029ae7ef4e04b534f917aaee7f44e5b71d767c0cbd383752a0527aca7c48bb42","schema_version":"1.0","event_id":"sha256:029ae7ef4e04b534f917aaee7f44e5b71d767c0cbd383752a0527aca7c48bb42"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KPEBMLINKEWIUBYBZXOEHBMT72/bundle.json","state_url":"https://pith.science/pith/KPEBMLINKEWIUBYBZXOEHBMT72/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KPEBMLINKEWIUBYBZXOEHBMT72/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-07-01T16:10:01Z","links":{"resolver":"https://pith.science/pith/KPEBMLINKEWIUBYBZXOEHBMT72","bundle":"https://pith.science/pith/KPEBMLINKEWIUBYBZXOEHBMT72/bundle.json","state":"https://pith.science/pith/KPEBMLINKEWIUBYBZXOEHBMT72/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KPEBMLINKEWIUBYBZXOEHBMT72/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KPEBMLINKEWIUBYBZXOEHBMT72","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":"0191c9f0c33ada61ace9af82cbe6c5ebaa49c67108c84f561fb35247a2f008da","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-07T18:17:22Z","title_canon_sha256":"98ed2a81419fd77b648f3d17737df6e188ce45a530ee9ada3b4b4826104052b2"},"schema_version":"1.0","source":{"id":"1803.02798","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.02798","created_at":"2026-05-18T00:21:49Z"},{"alias_kind":"arxiv_version","alias_value":"1803.02798v1","created_at":"2026-05-18T00:21:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.02798","created_at":"2026-05-18T00:21:49Z"},{"alias_kind":"pith_short_12","alias_value":"KPEBMLINKEWI","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KPEBMLINKEWIUBYB","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KPEBMLIN","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:029ae7ef4e04b534f917aaee7f44e5b71d767c0cbd383752a0527aca7c48bb42","target":"graph","created_at":"2026-05-18T00:21:49Z","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 optimal multi-agent persistent monitoring problem defined by a team of cooperating agents visiting a set of nodes (targets) on a graph with the objective of minimizing a measure of overall node state uncertainty. The solution to this problem involves agent trajectories defined both by the sequence of nodes to be visited by each agent and the amount of time spent at each node. Since such optimal trajectories are generally intractable, we propose a class of distributed threshold-based parametric controllers through which agent transitions from one node to the next are controlled ","authors_text":"Christos G. Cassandras, Nan Zhou, Sean B. Andersson, Xi Yu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-07T18:17:22Z","title":"Optimal Threshold-Based Control Policies for Persistent Monitoring on Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.02798","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:738652cad579bb3a09182625fa18d86ed2e9f879f89de95b124e379dbeefc9ed","target":"record","created_at":"2026-05-18T00:21:49Z","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":"0191c9f0c33ada61ace9af82cbe6c5ebaa49c67108c84f561fb35247a2f008da","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-07T18:17:22Z","title_canon_sha256":"98ed2a81419fd77b648f3d17737df6e188ce45a530ee9ada3b4b4826104052b2"},"schema_version":"1.0","source":{"id":"1803.02798","kind":"arxiv","version":1}},"canonical_sha256":"53c8162d0d512c8a0701cddc438593feade6aba15e78ff0691aa09a3c0e02e82","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"53c8162d0d512c8a0701cddc438593feade6aba15e78ff0691aa09a3c0e02e82","first_computed_at":"2026-05-18T00:21:49.220250Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:49.220250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PIFppZhqAbh44WITpNK1BG2Rxc/Wb4+BCEL6gzPNfCCRxkVzg/XcV28RQQ+QQWhiHpYXZLNeFj7TAVMCCNf3Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:49.220819Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.02798","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:738652cad579bb3a09182625fa18d86ed2e9f879f89de95b124e379dbeefc9ed","sha256:029ae7ef4e04b534f917aaee7f44e5b71d767c0cbd383752a0527aca7c48bb42"],"state_sha256":"ac37e4c75a4fda120fbd9d3f64f5ceccc773ba883ebd0a1dead4a509dc7ad899"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6x5U/QkPOl781HLAuo1T3OFMU9/8I5E9viuxMvgJSbXRs5O1jqTK7I47P/hszF8INWfTdZNwfoE7cOvz32ofDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T16:10:01.866473Z","bundle_sha256":"af0ec2b6366736b1084e2e76944ece46bf0fefd5b15a791af417c4d96aa7cefd"}}