{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:6BNB6JP73UMMYDTFWLY5ZLOVP7","short_pith_number":"pith:6BNB6JP7","schema_version":"1.0","canonical_sha256":"f05a1f25ffdd18cc0e65b2f1dcadd57ffabe6f7d6de071c5aace38522220bd8b","source":{"kind":"arxiv","id":"2011.01129","version":2},"attestation_state":"computed","paper":{"title":"Multi-Agent Reinforcement Learning for Visibility-based Persistent Monitoring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.RO","authors_text":"Amrish Baskaran, Jingxi Chen, Pratap Tokekar, Zhongshun Zhang","submitted_at":"2020-11-02T17:05:40Z","abstract_excerpt":"The Visibility-based Persistent Monitoring (VPM) problem seeks to find a set of trajectories (or controllers) for robots to persistently monitor a changing environment. Each robot has a sensor, such as a camera, with a limited field-of-view that is obstructed by obstacles in the environment. The robots may need to coordinate with each other to ensure no point in the environment is left unmonitored for long periods of time. We model the problem such that there is a penalty that accrues every time step if a point is left unmonitored. However, the dynamics of the penalty are unknown to us. We pre"},"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":"2011.01129","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-11-02T17:05:40Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"d4d21d65a68a6810fca61529d0498e5de2fcfc5dbade9c73f20332fd0488d8ce","abstract_canon_sha256":"728e63e308070e148b3a739be0efb39196c069e6bb6c1f92809dce4dcb1174aa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:20:33.423990Z","signature_b64":"j5fv1PTSy91vXr+525E9VXiaQhd6tyQyQI0rbakbllhIcCl+JmnfpWvyQH9D51IoObiWUe2fp2lm053lkMKODw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f05a1f25ffdd18cc0e65b2f1dcadd57ffabe6f7d6de071c5aace38522220bd8b","last_reissued_at":"2026-07-05T03:20:33.423596Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:20:33.423596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Agent Reinforcement Learning for Visibility-based Persistent Monitoring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.RO","authors_text":"Amrish Baskaran, Jingxi Chen, Pratap Tokekar, Zhongshun Zhang","submitted_at":"2020-11-02T17:05:40Z","abstract_excerpt":"The Visibility-based Persistent Monitoring (VPM) problem seeks to find a set of trajectories (or controllers) for robots to persistently monitor a changing environment. Each robot has a sensor, such as a camera, with a limited field-of-view that is obstructed by obstacles in the environment. The robots may need to coordinate with each other to ensure no point in the environment is left unmonitored for long periods of time. We model the problem such that there is a penalty that accrues every time step if a point is left unmonitored. However, the dynamics of the penalty are unknown to us. We pre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.01129","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.01129/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2011.01129","created_at":"2026-07-05T03:20:33.423659+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.01129v2","created_at":"2026-07-05T03:20:33.423659+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.01129","created_at":"2026-07-05T03:20:33.423659+00:00"},{"alias_kind":"pith_short_12","alias_value":"6BNB6JP73UMM","created_at":"2026-07-05T03:20:33.423659+00:00"},{"alias_kind":"pith_short_16","alias_value":"6BNB6JP73UMMYDTF","created_at":"2026-07-05T03:20:33.423659+00:00"},{"alias_kind":"pith_short_8","alias_value":"6BNB6JP7","created_at":"2026-07-05T03:20:33.423659+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.14846","citing_title":"Progressive Sentences: Combining the Benefits of Word and Sentence Learning","ref_index":29,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6BNB6JP73UMMYDTFWLY5ZLOVP7","json":"https://pith.science/pith/6BNB6JP73UMMYDTFWLY5ZLOVP7.json","graph_json":"https://pith.science/api/pith-number/6BNB6JP73UMMYDTFWLY5ZLOVP7/graph.json","events_json":"https://pith.science/api/pith-number/6BNB6JP73UMMYDTFWLY5ZLOVP7/events.json","paper":"https://pith.science/paper/6BNB6JP7"},"agent_actions":{"view_html":"https://pith.science/pith/6BNB6JP73UMMYDTFWLY5ZLOVP7","download_json":"https://pith.science/pith/6BNB6JP73UMMYDTFWLY5ZLOVP7.json","view_paper":"https://pith.science/paper/6BNB6JP7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.01129&json=true","fetch_graph":"https://pith.science/api/pith-number/6BNB6JP73UMMYDTFWLY5ZLOVP7/graph.json","fetch_events":"https://pith.science/api/pith-number/6BNB6JP73UMMYDTFWLY5ZLOVP7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6BNB6JP73UMMYDTFWLY5ZLOVP7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6BNB6JP73UMMYDTFWLY5ZLOVP7/action/storage_attestation","attest_author":"https://pith.science/pith/6BNB6JP73UMMYDTFWLY5ZLOVP7/action/author_attestation","sign_citation":"https://pith.science/pith/6BNB6JP73UMMYDTFWLY5ZLOVP7/action/citation_signature","submit_replication":"https://pith.science/pith/6BNB6JP73UMMYDTFWLY5ZLOVP7/action/replication_record"}},"created_at":"2026-07-05T03:20:33.423659+00:00","updated_at":"2026-07-05T03:20:33.423659+00:00"}