{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:NCSVVGZVPFBH6LTZGJ34IN2KYQ","short_pith_number":"pith:NCSVVGZV","canonical_record":{"source":{"id":"1209.5805","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2012-09-26T01:18:33Z","cross_cats_sorted":["cs.RO","math.OC"],"title_canon_sha256":"6199f5192b7cc8f91b8267dba4e270a92ec8abd903349ddba2d4cc3569a2a3b5","abstract_canon_sha256":"dea8741adbf4d456e44c691d73fef9ef80e611fae42f9c513768a40cf68ada30"},"schema_version":"1.0"},"canonical_sha256":"68a55a9b3579427f2e793277c4374ac42676cf8f7245e0224c4ceea66767e1e3","source":{"kind":"arxiv","id":"1209.5805","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.5805","created_at":"2026-05-18T03:41:19Z"},{"alias_kind":"arxiv_version","alias_value":"1209.5805v2","created_at":"2026-05-18T03:41:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.5805","created_at":"2026-05-18T03:41:19Z"},{"alias_kind":"pith_short_12","alias_value":"NCSVVGZVPFBH","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NCSVVGZVPFBH6LTZ","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NCSVVGZV","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:NCSVVGZVPFBH6LTZGJ34IN2KYQ","target":"record","payload":{"canonical_record":{"source":{"id":"1209.5805","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2012-09-26T01:18:33Z","cross_cats_sorted":["cs.RO","math.OC"],"title_canon_sha256":"6199f5192b7cc8f91b8267dba4e270a92ec8abd903349ddba2d4cc3569a2a3b5","abstract_canon_sha256":"dea8741adbf4d456e44c691d73fef9ef80e611fae42f9c513768a40cf68ada30"},"schema_version":"1.0"},"canonical_sha256":"68a55a9b3579427f2e793277c4374ac42676cf8f7245e0224c4ceea66767e1e3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:19.930038Z","signature_b64":"saENIOmKsw+e2cM/X1iexdsCoFoUc85nN6niASqzE0Zwh1KaVl1+b5sskiuAXTxB0SA7NPWDbiqAf3MoEibgCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68a55a9b3579427f2e793277c4374ac42676cf8f7245e0224c4ceea66767e1e3","last_reissued_at":"2026-05-18T03:41:19.929553Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:19.929553Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.5805","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-18T03:41:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KIdhhiekNm0Zgp9pazRnpbEFJ7Q2sS9kJsC1uzHhTVRuQ9/IR5CWttccbwJr0qfrN79I6YP3NvovrEtDovAuCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T07:22:28.719835Z"},"content_sha256":"1aef6a6536341f8db6fb0f4efdb2d45a0fc22e5e354aa191fb40acf11a2743e3","schema_version":"1.0","event_id":"sha256:1aef6a6536341f8db6fb0f4efdb2d45a0fc22e5e354aa191fb40acf11a2743e3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:NCSVVGZVPFBH6LTZGJ34IN2KYQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Memoryless Control Design for Persistent Surveillance under Safety Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO","math.OC"],"primary_cat":"cs.SY","authors_text":"Eduardo Arvelo, Eric Kim, Nuno C. Martins","submitted_at":"2012-09-26T01:18:33Z","abstract_excerpt":"This paper deals with the design of time-invariant memoryless control policies for robots that move in a finite two- dimensional lattice and are tasked with persistent surveillance of an area in which there are forbidden regions. We model each robot as a controlled Markov chain whose state comprises its position in the lattice and the direction of motion. The goal is to find the minimum number of robots and an associated time-invariant memoryless control policy that guarantees that the largest number of states are persistently surveilled without ever visiting a forbidden state. We propose a de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.5805","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-18T03:41:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vFjr0FIbLOR/lZ1DAyF4jFbiLddEDiqjKvEtNf9WqEihtwy/CXed19jiRsIK16X6rT9uYUiFsFhWhYKb1VRmCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T07:22:28.720282Z"},"content_sha256":"a32e35e7f245018f3c8c35b9d6c12465eeea304528d2ecf14b2cc2f26ec152df","schema_version":"1.0","event_id":"sha256:a32e35e7f245018f3c8c35b9d6c12465eeea304528d2ecf14b2cc2f26ec152df"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NCSVVGZVPFBH6LTZGJ34IN2KYQ/bundle.json","state_url":"https://pith.science/pith/NCSVVGZVPFBH6LTZGJ34IN2KYQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NCSVVGZVPFBH6LTZGJ34IN2KYQ/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-06-04T07:22:28Z","links":{"resolver":"https://pith.science/pith/NCSVVGZVPFBH6LTZGJ34IN2KYQ","bundle":"https://pith.science/pith/NCSVVGZVPFBH6LTZGJ34IN2KYQ/bundle.json","state":"https://pith.science/pith/NCSVVGZVPFBH6LTZGJ34IN2KYQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NCSVVGZVPFBH6LTZGJ34IN2KYQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:NCSVVGZVPFBH6LTZGJ34IN2KYQ","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":"dea8741adbf4d456e44c691d73fef9ef80e611fae42f9c513768a40cf68ada30","cross_cats_sorted":["cs.RO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2012-09-26T01:18:33Z","title_canon_sha256":"6199f5192b7cc8f91b8267dba4e270a92ec8abd903349ddba2d4cc3569a2a3b5"},"schema_version":"1.0","source":{"id":"1209.5805","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.5805","created_at":"2026-05-18T03:41:19Z"},{"alias_kind":"arxiv_version","alias_value":"1209.5805v2","created_at":"2026-05-18T03:41:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.5805","created_at":"2026-05-18T03:41:19Z"},{"alias_kind":"pith_short_12","alias_value":"NCSVVGZVPFBH","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NCSVVGZVPFBH6LTZ","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NCSVVGZV","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:a32e35e7f245018f3c8c35b9d6c12465eeea304528d2ecf14b2cc2f26ec152df","target":"graph","created_at":"2026-05-18T03:41: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":"This paper deals with the design of time-invariant memoryless control policies for robots that move in a finite two- dimensional lattice and are tasked with persistent surveillance of an area in which there are forbidden regions. We model each robot as a controlled Markov chain whose state comprises its position in the lattice and the direction of motion. The goal is to find the minimum number of robots and an associated time-invariant memoryless control policy that guarantees that the largest number of states are persistently surveilled without ever visiting a forbidden state. We propose a de","authors_text":"Eduardo Arvelo, Eric Kim, Nuno C. Martins","cross_cats":["cs.RO","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2012-09-26T01:18:33Z","title":"Memoryless Control Design for Persistent Surveillance under Safety Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.5805","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:1aef6a6536341f8db6fb0f4efdb2d45a0fc22e5e354aa191fb40acf11a2743e3","target":"record","created_at":"2026-05-18T03:41: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":"dea8741adbf4d456e44c691d73fef9ef80e611fae42f9c513768a40cf68ada30","cross_cats_sorted":["cs.RO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2012-09-26T01:18:33Z","title_canon_sha256":"6199f5192b7cc8f91b8267dba4e270a92ec8abd903349ddba2d4cc3569a2a3b5"},"schema_version":"1.0","source":{"id":"1209.5805","kind":"arxiv","version":2}},"canonical_sha256":"68a55a9b3579427f2e793277c4374ac42676cf8f7245e0224c4ceea66767e1e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"68a55a9b3579427f2e793277c4374ac42676cf8f7245e0224c4ceea66767e1e3","first_computed_at":"2026-05-18T03:41:19.929553Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:19.929553Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"saENIOmKsw+e2cM/X1iexdsCoFoUc85nN6niASqzE0Zwh1KaVl1+b5sskiuAXTxB0SA7NPWDbiqAf3MoEibgCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:19.930038Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.5805","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1aef6a6536341f8db6fb0f4efdb2d45a0fc22e5e354aa191fb40acf11a2743e3","sha256:a32e35e7f245018f3c8c35b9d6c12465eeea304528d2ecf14b2cc2f26ec152df"],"state_sha256":"611d061c1d5ea4c7bb9a4cc058a25354a838e6694a9cf4dc3ff616811464d67f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5P/EQfwm3PXzy6h0KG/hv7cwG1WHh+InkdxvJWvtvMXpaBLYZjhwuzfLEyE7MS3c2Tm+aX8EM35DkBOtoOKxDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T07:22:28.724125Z","bundle_sha256":"c354c37aa835e389d6f41fad6fe4f7cc4c2e9c39f5e836d036613e289b213b2c"}}