{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:XJHP7S6OBSSFIBQFDB7CALAPUB","short_pith_number":"pith:XJHP7S6O","canonical_record":{"source":{"id":"1612.03246","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-12-10T03:34:19Z","cross_cats_sorted":[],"title_canon_sha256":"3cd2424fc657fd6b7ce1bb22648e141e2d85ee0fdbf60fb2c901944b08f9285a","abstract_canon_sha256":"c512434eb79cf9f3c9d406eebf3aa82feee80152e483c3a28e556023996f4ea2"},"schema_version":"1.0"},"canonical_sha256":"ba4effcbce0ca4540605187e202c0fa045b61a041615043436d6d34588542759","source":{"kind":"arxiv","id":"1612.03246","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.03246","created_at":"2026-05-18T00:55:19Z"},{"alias_kind":"arxiv_version","alias_value":"1612.03246v1","created_at":"2026-05-18T00:55:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.03246","created_at":"2026-05-18T00:55:19Z"},{"alias_kind":"pith_short_12","alias_value":"XJHP7S6OBSSF","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XJHP7S6OBSSFIBQF","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XJHP7S6O","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:XJHP7S6OBSSFIBQFDB7CALAPUB","target":"record","payload":{"canonical_record":{"source":{"id":"1612.03246","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-12-10T03:34:19Z","cross_cats_sorted":[],"title_canon_sha256":"3cd2424fc657fd6b7ce1bb22648e141e2d85ee0fdbf60fb2c901944b08f9285a","abstract_canon_sha256":"c512434eb79cf9f3c9d406eebf3aa82feee80152e483c3a28e556023996f4ea2"},"schema_version":"1.0"},"canonical_sha256":"ba4effcbce0ca4540605187e202c0fa045b61a041615043436d6d34588542759","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:19.850445Z","signature_b64":"J5JHbCYxmSod9rf7gEXIiciV7jpBNfxe27UU7AoZ+2/STnlEroGTODhUlLyxClZQlHgMuH26oDPW0oNun3doCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba4effcbce0ca4540605187e202c0fa045b61a041615043436d6d34588542759","last_reissued_at":"2026-05-18T00:55:19.849862Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:19.849862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.03246","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:55:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mmH3k4t34qXlIFljPTzTuCLkYMgO/tJQxzy/dL2HBr52VhD0cI4hgjJStlFfbaM1xc3vy+L+dpeuo2LGsDsiDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:01:08.341080Z"},"content_sha256":"58b9a6981d0e821ad839dc0787b5d02548357e534076a09cabfe2b63a7ded485","schema_version":"1.0","event_id":"sha256:58b9a6981d0e821ad839dc0787b5d02548357e534076a09cabfe2b63a7ded485"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:XJHP7S6OBSSFIBQFDB7CALAPUB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithms for Visibility-Based Monitoring with Robot Teams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Ashish Kumar Budhiraja, Pratap Tokekar, Vijay Kumar","submitted_at":"2016-12-10T03:34:19Z","abstract_excerpt":"We study the problem of planning paths for a team of robots for visually monitoring an environment. Our work is motivated by surveillance and persistent monitoring applications. We are given a set of target points in a polygonal environment that must be monitored using robots with cameras. The goal is to compute paths for all robots such that every target is visible from at least one path. In its general form, this problem is NP-hard as it generalizes the Art Gallery Problem and the Watchman Route Problem. We study two versions: (i) a geometric version in \\emph{street polygons} for which we gi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.03246","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:55:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z06czCRzF2v4/izKudxudz0BXTfOzy+twTMQo17no4Ol5Q13Etd9yUqVzref77W8g88v+AduroMKJUjgnLBBAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:01:08.341727Z"},"content_sha256":"586858f7b215adccafef3324fcfb2dd913e81c3a21458f3686c6a9fefca8a23f","schema_version":"1.0","event_id":"sha256:586858f7b215adccafef3324fcfb2dd913e81c3a21458f3686c6a9fefca8a23f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XJHP7S6OBSSFIBQFDB7CALAPUB/bundle.json","state_url":"https://pith.science/pith/XJHP7S6OBSSFIBQFDB7CALAPUB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XJHP7S6OBSSFIBQFDB7CALAPUB/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-25T12:01:08Z","links":{"resolver":"https://pith.science/pith/XJHP7S6OBSSFIBQFDB7CALAPUB","bundle":"https://pith.science/pith/XJHP7S6OBSSFIBQFDB7CALAPUB/bundle.json","state":"https://pith.science/pith/XJHP7S6OBSSFIBQFDB7CALAPUB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XJHP7S6OBSSFIBQFDB7CALAPUB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XJHP7S6OBSSFIBQFDB7CALAPUB","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":"c512434eb79cf9f3c9d406eebf3aa82feee80152e483c3a28e556023996f4ea2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-12-10T03:34:19Z","title_canon_sha256":"3cd2424fc657fd6b7ce1bb22648e141e2d85ee0fdbf60fb2c901944b08f9285a"},"schema_version":"1.0","source":{"id":"1612.03246","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.03246","created_at":"2026-05-18T00:55:19Z"},{"alias_kind":"arxiv_version","alias_value":"1612.03246v1","created_at":"2026-05-18T00:55:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.03246","created_at":"2026-05-18T00:55:19Z"},{"alias_kind":"pith_short_12","alias_value":"XJHP7S6OBSSF","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XJHP7S6OBSSFIBQF","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XJHP7S6O","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:586858f7b215adccafef3324fcfb2dd913e81c3a21458f3686c6a9fefca8a23f","target":"graph","created_at":"2026-05-18T00:55:19Z","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 study the problem of planning paths for a team of robots for visually monitoring an environment. Our work is motivated by surveillance and persistent monitoring applications. We are given a set of target points in a polygonal environment that must be monitored using robots with cameras. The goal is to compute paths for all robots such that every target is visible from at least one path. In its general form, this problem is NP-hard as it generalizes the Art Gallery Problem and the Watchman Route Problem. We study two versions: (i) a geometric version in \\emph{street polygons} for which we gi","authors_text":"Ashish Kumar Budhiraja, Pratap Tokekar, Vijay Kumar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-12-10T03:34:19Z","title":"Algorithms for Visibility-Based Monitoring with Robot Teams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.03246","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:58b9a6981d0e821ad839dc0787b5d02548357e534076a09cabfe2b63a7ded485","target":"record","created_at":"2026-05-18T00:55:19Z","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":"c512434eb79cf9f3c9d406eebf3aa82feee80152e483c3a28e556023996f4ea2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-12-10T03:34:19Z","title_canon_sha256":"3cd2424fc657fd6b7ce1bb22648e141e2d85ee0fdbf60fb2c901944b08f9285a"},"schema_version":"1.0","source":{"id":"1612.03246","kind":"arxiv","version":1}},"canonical_sha256":"ba4effcbce0ca4540605187e202c0fa045b61a041615043436d6d34588542759","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ba4effcbce0ca4540605187e202c0fa045b61a041615043436d6d34588542759","first_computed_at":"2026-05-18T00:55:19.849862Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:19.849862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"J5JHbCYxmSod9rf7gEXIiciV7jpBNfxe27UU7AoZ+2/STnlEroGTODhUlLyxClZQlHgMuH26oDPW0oNun3doCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:19.850445Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.03246","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:58b9a6981d0e821ad839dc0787b5d02548357e534076a09cabfe2b63a7ded485","sha256:586858f7b215adccafef3324fcfb2dd913e81c3a21458f3686c6a9fefca8a23f"],"state_sha256":"72954e1b6dbc5ff9877483be98dc524f5ddfa8e4c2928da8bb1bf6b9cf0b6ae5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oFk/+Xmz6A/i8KiMdS8GvNLZJ1C8HZsbOfxYCEfsMVxkHHrYTL+MtNHMpaulu0maNE2UHj3nCBNkDnXCgWBjAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T12:01:08.344613Z","bundle_sha256":"3075d9e194d780d0bc2be64cc687efcf8d2c2d8cff8649189578c83b2b9e5eec"}}