{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:FZ6REPS2QM7UYMPQATNTYSJUSZ","short_pith_number":"pith:FZ6REPS2","schema_version":"1.0","canonical_sha256":"2e7d123e5a833f4c31f004db3c4934964473164bd4d9cef6040d1f7f0adbeda8","source":{"kind":"arxiv","id":"2209.13311","version":1},"attestation_state":"computed","paper":{"title":"Optimal Placement of Base Stations in Border Surveillance using Limited Capacity Drones","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"A. Ram\\'irez-Vigueras, A. Stevens, F. Rodr\\'iguez, J.M. D\\'iaz-B\\'a\\~nez, J. Urrutia, M.A. Lopez, M. Haghpanah, N. Mar\\'in, O. Sol\\'e-Pi, P. Horn, S. Bereg","submitted_at":"2022-09-27T11:35:21Z","abstract_excerpt":"Imagine an island modeled as a simple polygon $\\P$ with $n$ vertices whose coastline we wish to monitor. We consider the problem of building the minimum number of refueling stations along the boundary of $\\P$ in such a way that a drone can follow a polygonal route enclosing the island without running out of fuel. A drone can fly a maximum distance $d$ between consecutive stations and is restricted to move either along the boundary of $\\P$ or its exterior (i.e., over water). We present an algorithm that, given $\\mathcal P$, finds the locations for a set of refueling stations whose cardinality i"},"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":"2209.13311","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CG","submitted_at":"2022-09-27T11:35:21Z","cross_cats_sorted":[],"title_canon_sha256":"84f84bcfc35ac2014fcc6180c28b14d8b32c881fabfe5954ee6be9e35eab411f","abstract_canon_sha256":"6e7e5b6c22b16a3f51a46e6fa08e652c030c834ac0275f21235fa99af41b27e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:01:09.223996Z","signature_b64":"IHwxS+6rMtKDj2daciG6wDTM2p/gB22s7m+o/zrZtP7F65YeMJYu5A7XaCxf7V42o+OEEXmYkU65Y6elmhrhDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e7d123e5a833f4c31f004db3c4934964473164bd4d9cef6040d1f7f0adbeda8","last_reissued_at":"2026-07-05T05:01:09.223598Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:01:09.223598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Placement of Base Stations in Border Surveillance using Limited Capacity Drones","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"A. Ram\\'irez-Vigueras, A. Stevens, F. Rodr\\'iguez, J.M. D\\'iaz-B\\'a\\~nez, J. Urrutia, M.A. Lopez, M. Haghpanah, N. Mar\\'in, O. Sol\\'e-Pi, P. Horn, S. Bereg","submitted_at":"2022-09-27T11:35:21Z","abstract_excerpt":"Imagine an island modeled as a simple polygon $\\P$ with $n$ vertices whose coastline we wish to monitor. We consider the problem of building the minimum number of refueling stations along the boundary of $\\P$ in such a way that a drone can follow a polygonal route enclosing the island without running out of fuel. A drone can fly a maximum distance $d$ between consecutive stations and is restricted to move either along the boundary of $\\P$ or its exterior (i.e., over water). We present an algorithm that, given $\\mathcal P$, finds the locations for a set of refueling stations whose cardinality i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.13311","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2209.13311/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":"2209.13311","created_at":"2026-07-05T05:01:09.223656+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.13311v1","created_at":"2026-07-05T05:01:09.223656+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.13311","created_at":"2026-07-05T05:01:09.223656+00:00"},{"alias_kind":"pith_short_12","alias_value":"FZ6REPS2QM7U","created_at":"2026-07-05T05:01:09.223656+00:00"},{"alias_kind":"pith_short_16","alias_value":"FZ6REPS2QM7UYMPQ","created_at":"2026-07-05T05:01:09.223656+00:00"},{"alias_kind":"pith_short_8","alias_value":"FZ6REPS2","created_at":"2026-07-05T05:01:09.223656+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/FZ6REPS2QM7UYMPQATNTYSJUSZ","json":"https://pith.science/pith/FZ6REPS2QM7UYMPQATNTYSJUSZ.json","graph_json":"https://pith.science/api/pith-number/FZ6REPS2QM7UYMPQATNTYSJUSZ/graph.json","events_json":"https://pith.science/api/pith-number/FZ6REPS2QM7UYMPQATNTYSJUSZ/events.json","paper":"https://pith.science/paper/FZ6REPS2"},"agent_actions":{"view_html":"https://pith.science/pith/FZ6REPS2QM7UYMPQATNTYSJUSZ","download_json":"https://pith.science/pith/FZ6REPS2QM7UYMPQATNTYSJUSZ.json","view_paper":"https://pith.science/paper/FZ6REPS2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.13311&json=true","fetch_graph":"https://pith.science/api/pith-number/FZ6REPS2QM7UYMPQATNTYSJUSZ/graph.json","fetch_events":"https://pith.science/api/pith-number/FZ6REPS2QM7UYMPQATNTYSJUSZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FZ6REPS2QM7UYMPQATNTYSJUSZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FZ6REPS2QM7UYMPQATNTYSJUSZ/action/storage_attestation","attest_author":"https://pith.science/pith/FZ6REPS2QM7UYMPQATNTYSJUSZ/action/author_attestation","sign_citation":"https://pith.science/pith/FZ6REPS2QM7UYMPQATNTYSJUSZ/action/citation_signature","submit_replication":"https://pith.science/pith/FZ6REPS2QM7UYMPQATNTYSJUSZ/action/replication_record"}},"created_at":"2026-07-05T05:01:09.223656+00:00","updated_at":"2026-07-05T05:01:09.223656+00:00"}