{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:75TVG4XZRWOOD5UHLOBS5ALYJ4","short_pith_number":"pith:75TVG4XZ","schema_version":"1.0","canonical_sha256":"ff675372f98d9ce1f6875b832e81784f15fb89d2573f8188c683c9594ee8d83a","source":{"kind":"arxiv","id":"1402.1896","version":2},"attestation_state":"computed","paper":{"title":"Correlated Orienteering Problem and it Application to Persistent Monitoring Tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Daniela Rus, Jingjin Yu, Mac Schwager","submitted_at":"2014-02-08T22:56:50Z","abstract_excerpt":"We propose a novel non-linear extension to the Orienteering Problem (OP), called the Correlated Orienteering Problem (COP). We use COP to model the planning of informative tours for the persistent monitoring of a spatiotemporal field with time-invariant spatial correlations, in which the tours are constrained to have limited length. Our focus in this paper is QCOP a quadratic COP formulation that only looks at correlations between neighboring nodes in a node network. The main feature of QCOP is a quadratic utility function capturing the said spatial correlation. QCOP may be solved using mixed "},"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":"1402.1896","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2014-02-08T22:56:50Z","cross_cats_sorted":[],"title_canon_sha256":"b788af340434177c54856d0c58fdf037daf40e6a28322705f6baa9d35eaa2976","abstract_canon_sha256":"d516207b7e13eee766672ae8bf6e077c41e243b4321212ba548e4bb92bd6836b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:21.410937Z","signature_b64":"wdo01//gROkhrf2CBmcV3fkUJIhG4xnBk2WpWeMgi4LkuNCNjg0M8lsV/ez1vvqJdoq4NFv5iGfCI4wp9tQmDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff675372f98d9ce1f6875b832e81784f15fb89d2573f8188c683c9594ee8d83a","last_reissued_at":"2026-05-18T02:31:21.410328Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:21.410328Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Correlated Orienteering Problem and it Application to Persistent Monitoring Tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Daniela Rus, Jingjin Yu, Mac Schwager","submitted_at":"2014-02-08T22:56:50Z","abstract_excerpt":"We propose a novel non-linear extension to the Orienteering Problem (OP), called the Correlated Orienteering Problem (COP). We use COP to model the planning of informative tours for the persistent monitoring of a spatiotemporal field with time-invariant spatial correlations, in which the tours are constrained to have limited length. Our focus in this paper is QCOP a quadratic COP formulation that only looks at correlations between neighboring nodes in a node network. The main feature of QCOP is a quadratic utility function capturing the said spatial correlation. QCOP may be solved using mixed "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.1896","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1402.1896","created_at":"2026-05-18T02:31:21.410417+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.1896v2","created_at":"2026-05-18T02:31:21.410417+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.1896","created_at":"2026-05-18T02:31:21.410417+00:00"},{"alias_kind":"pith_short_12","alias_value":"75TVG4XZRWOO","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"75TVG4XZRWOOD5UH","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"75TVG4XZ","created_at":"2026-05-18T12:28:16.859392+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/75TVG4XZRWOOD5UHLOBS5ALYJ4","json":"https://pith.science/pith/75TVG4XZRWOOD5UHLOBS5ALYJ4.json","graph_json":"https://pith.science/api/pith-number/75TVG4XZRWOOD5UHLOBS5ALYJ4/graph.json","events_json":"https://pith.science/api/pith-number/75TVG4XZRWOOD5UHLOBS5ALYJ4/events.json","paper":"https://pith.science/paper/75TVG4XZ"},"agent_actions":{"view_html":"https://pith.science/pith/75TVG4XZRWOOD5UHLOBS5ALYJ4","download_json":"https://pith.science/pith/75TVG4XZRWOOD5UHLOBS5ALYJ4.json","view_paper":"https://pith.science/paper/75TVG4XZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.1896&json=true","fetch_graph":"https://pith.science/api/pith-number/75TVG4XZRWOOD5UHLOBS5ALYJ4/graph.json","fetch_events":"https://pith.science/api/pith-number/75TVG4XZRWOOD5UHLOBS5ALYJ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/75TVG4XZRWOOD5UHLOBS5ALYJ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/75TVG4XZRWOOD5UHLOBS5ALYJ4/action/storage_attestation","attest_author":"https://pith.science/pith/75TVG4XZRWOOD5UHLOBS5ALYJ4/action/author_attestation","sign_citation":"https://pith.science/pith/75TVG4XZRWOOD5UHLOBS5ALYJ4/action/citation_signature","submit_replication":"https://pith.science/pith/75TVG4XZRWOOD5UHLOBS5ALYJ4/action/replication_record"}},"created_at":"2026-05-18T02:31:21.410417+00:00","updated_at":"2026-05-18T02:31:21.410417+00:00"}