{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:TRLHXIO7TCPSOJCOBMAQVXAAKH","short_pith_number":"pith:TRLHXIO7","canonical_record":{"source":{"id":"1908.04425","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-08-12T22:24:19Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"e55eb89b5a903398054637e758e8d7f3d75f4725037bd2d9d672c7387b0eaebb","abstract_canon_sha256":"70081b5fd0d8c67a726735014a5498fcacb2809ff288be2148002ed970544117"},"schema_version":"1.0"},"canonical_sha256":"9c567ba1df989f27244e0b010adc0051c5f5a43f6f65f452b9c95d8f3c4299de","source":{"kind":"arxiv","id":"1908.04425","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.04425","created_at":"2026-07-05T01:44:45Z"},{"alias_kind":"arxiv_version","alias_value":"1908.04425v3","created_at":"2026-07-05T01:44:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04425","created_at":"2026-07-05T01:44:45Z"},{"alias_kind":"pith_short_12","alias_value":"TRLHXIO7TCPS","created_at":"2026-07-05T01:44:45Z"},{"alias_kind":"pith_short_16","alias_value":"TRLHXIO7TCPSOJCO","created_at":"2026-07-05T01:44:45Z"},{"alias_kind":"pith_short_8","alias_value":"TRLHXIO7","created_at":"2026-07-05T01:44:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:TRLHXIO7TCPSOJCOBMAQVXAAKH","target":"record","payload":{"canonical_record":{"source":{"id":"1908.04425","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-08-12T22:24:19Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"e55eb89b5a903398054637e758e8d7f3d75f4725037bd2d9d672c7387b0eaebb","abstract_canon_sha256":"70081b5fd0d8c67a726735014a5498fcacb2809ff288be2148002ed970544117"},"schema_version":"1.0"},"canonical_sha256":"9c567ba1df989f27244e0b010adc0051c5f5a43f6f65f452b9c95d8f3c4299de","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:44:45.062035Z","signature_b64":"v1GlKt8bRfV5SR4CZLcC17GhQjwySXg+q40f0/qTBXV1Qe5drYkRixYn6NeKqwtn7WMUby4JEtFQ8s5/+gljCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c567ba1df989f27244e0b010adc0051c5f5a43f6f65f452b9c95d8f3c4299de","last_reissued_at":"2026-07-05T01:44:45.061683Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:44:45.061683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.04425","source_version":3,"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-07-05T01:44:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JYvA+znqRDLEfSCp29cuEAop5T//8JhIaNJWb5otkPBtJ0zr7z/5PkfBbnOGp915EcYzeyekQddQA1vJEoCiAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T05:23:59.155845Z"},"content_sha256":"b1e03e1ba34a7836dfe7841f05d439bd7a2ab279660d30df4dc63b84b67cbff9","schema_version":"1.0","event_id":"sha256:b1e03e1ba34a7836dfe7841f05d439bd7a2ab279660d30df4dc63b84b67cbff9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:TRLHXIO7TCPSOJCOBMAQVXAAKH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A sub-modular receding horizon solution for mobile multi-agent persistent monitoring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.MA","authors_text":"Navid Rezazadeh, Solmaz S. Kia","submitted_at":"2019-08-12T22:24:19Z","abstract_excerpt":"We study the problem of persistent monitoring of a finite number of inter-connected geographical nodes by a group of heterogeneous mobile agents. We assign to each geographical node a concave and increasing reward function that resets to zero after an agent's visit. Then, we design the optimal dispatch policy of which nodes to visit at what time and by what agent by finding a policy set that maximizes a utility that is defined as the total reward collected at visit times. We show that this optimization problem is NP-hard and its computational complexity increases exponentially with the number "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.04425","kind":"arxiv","version":3},"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/1908.04425/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"},"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-07-05T01:44:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EaEvA3nPBGvjFwkyODAw2yDzv/OwvFgRuOKWFqTUOvgni381BdtvLOjVf6H70Cpzi1DnjnezaqzdbkcMJFZQCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T05:23:59.156374Z"},"content_sha256":"cbde49c571957dc27c9c2f0379d5d1700728a47dced16c1be26c28a01c9cad28","schema_version":"1.0","event_id":"sha256:cbde49c571957dc27c9c2f0379d5d1700728a47dced16c1be26c28a01c9cad28"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TRLHXIO7TCPSOJCOBMAQVXAAKH/bundle.json","state_url":"https://pith.science/pith/TRLHXIO7TCPSOJCOBMAQVXAAKH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TRLHXIO7TCPSOJCOBMAQVXAAKH/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-08-16T05:23:59Z","links":{"resolver":"https://pith.science/pith/TRLHXIO7TCPSOJCOBMAQVXAAKH","bundle":"https://pith.science/pith/TRLHXIO7TCPSOJCOBMAQVXAAKH/bundle.json","state":"https://pith.science/pith/TRLHXIO7TCPSOJCOBMAQVXAAKH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TRLHXIO7TCPSOJCOBMAQVXAAKH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TRLHXIO7TCPSOJCOBMAQVXAAKH","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":"70081b5fd0d8c67a726735014a5498fcacb2809ff288be2148002ed970544117","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-08-12T22:24:19Z","title_canon_sha256":"e55eb89b5a903398054637e758e8d7f3d75f4725037bd2d9d672c7387b0eaebb"},"schema_version":"1.0","source":{"id":"1908.04425","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.04425","created_at":"2026-07-05T01:44:45Z"},{"alias_kind":"arxiv_version","alias_value":"1908.04425v3","created_at":"2026-07-05T01:44:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04425","created_at":"2026-07-05T01:44:45Z"},{"alias_kind":"pith_short_12","alias_value":"TRLHXIO7TCPS","created_at":"2026-07-05T01:44:45Z"},{"alias_kind":"pith_short_16","alias_value":"TRLHXIO7TCPSOJCO","created_at":"2026-07-05T01:44:45Z"},{"alias_kind":"pith_short_8","alias_value":"TRLHXIO7","created_at":"2026-07-05T01:44:45Z"}],"graph_snapshots":[{"event_id":"sha256:cbde49c571957dc27c9c2f0379d5d1700728a47dced16c1be26c28a01c9cad28","target":"graph","created_at":"2026-07-05T01:44:45Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.04425/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the problem of persistent monitoring of a finite number of inter-connected geographical nodes by a group of heterogeneous mobile agents. We assign to each geographical node a concave and increasing reward function that resets to zero after an agent's visit. Then, we design the optimal dispatch policy of which nodes to visit at what time and by what agent by finding a policy set that maximizes a utility that is defined as the total reward collected at visit times. We show that this optimization problem is NP-hard and its computational complexity increases exponentially with the number ","authors_text":"Navid Rezazadeh, Solmaz S. Kia","cross_cats":["cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-08-12T22:24:19Z","title":"A sub-modular receding horizon solution for mobile multi-agent persistent monitoring"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.04425","kind":"arxiv","version":3},"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:b1e03e1ba34a7836dfe7841f05d439bd7a2ab279660d30df4dc63b84b67cbff9","target":"record","created_at":"2026-07-05T01:44:45Z","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":"70081b5fd0d8c67a726735014a5498fcacb2809ff288be2148002ed970544117","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-08-12T22:24:19Z","title_canon_sha256":"e55eb89b5a903398054637e758e8d7f3d75f4725037bd2d9d672c7387b0eaebb"},"schema_version":"1.0","source":{"id":"1908.04425","kind":"arxiv","version":3}},"canonical_sha256":"9c567ba1df989f27244e0b010adc0051c5f5a43f6f65f452b9c95d8f3c4299de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9c567ba1df989f27244e0b010adc0051c5f5a43f6f65f452b9c95d8f3c4299de","first_computed_at":"2026-07-05T01:44:45.061683Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:44:45.061683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v1GlKt8bRfV5SR4CZLcC17GhQjwySXg+q40f0/qTBXV1Qe5drYkRixYn6NeKqwtn7WMUby4JEtFQ8s5/+gljCg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:44:45.062035Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.04425","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b1e03e1ba34a7836dfe7841f05d439bd7a2ab279660d30df4dc63b84b67cbff9","sha256:cbde49c571957dc27c9c2f0379d5d1700728a47dced16c1be26c28a01c9cad28"],"state_sha256":"6cc708731668a1924365c68306765213ffeed766d02368cac1526a473a3cffc9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z2sP3C+gRktE8iZdqOE5cVrUHb8QfdjLG8LM+GdVPtHIfilW4meOOJMA7niAsB6iX4xcTx31Wm3oIY95EgQWCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T05:23:59.161489Z","bundle_sha256":"92a9e02fa5c3bf97fcda226303d4d7a43a4a315685646126342b953ed15f269f"}}