{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:6VMNGC6GP63XNFSDBHFAGSDEEN","short_pith_number":"pith:6VMNGC6G","schema_version":"1.0","canonical_sha256":"f558d30bc67fb776964309ca034864237e1465db455e424badc254750bb596c6","source":{"kind":"arxiv","id":"1101.2360","version":1},"attestation_state":"computed","paper":{"title":"Minimum Covering with Travel Cost","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Christiane Schmidt, Joseph S. B. Mitchell, Sandor P. Fekete","submitted_at":"2011-01-12T13:50:10Z","abstract_excerpt":"Given a polygon and a visibility range, the Myopic Watchman Problem with Discrete Vision (MWPDV) asks for a closed path P and a set of scan points S, such that (i) every point of the polygon is within visibility range of a scan point; and (ii) path length plus weighted sum of scan number along the tour is minimized. Alternatively, the bicriteria problem (ii') aims at minimizing both scan number and tour length. We consider both lawn mowing (in which tour and scan points may leave P) and milling (in which tour, scan points and visibility must stay within P) variants for the MWPDV; even for simp"},"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":"1101.2360","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-01-12T13:50:10Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"135e400ccb6c77753fe0de541cc8d0cf72d00c0cd96644a5f2e51d35d674c3ef","abstract_canon_sha256":"e64dca002a36a2e904168da65dc77121060dc4e0afca559b80b38b8ca8809add"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:58.254901Z","signature_b64":"im9zj3Lrlri03H2ytWuD9LTTNX6uYTFKTSOiFQIimcMfxz9IDMexixNojzphJjQryiofonK5JVXumul4p0OFAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f558d30bc67fb776964309ca034864237e1465db455e424badc254750bb596c6","last_reissued_at":"2026-05-18T02:22:58.254296Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:58.254296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum Covering with Travel Cost","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Christiane Schmidt, Joseph S. B. Mitchell, Sandor P. Fekete","submitted_at":"2011-01-12T13:50:10Z","abstract_excerpt":"Given a polygon and a visibility range, the Myopic Watchman Problem with Discrete Vision (MWPDV) asks for a closed path P and a set of scan points S, such that (i) every point of the polygon is within visibility range of a scan point; and (ii) path length plus weighted sum of scan number along the tour is minimized. Alternatively, the bicriteria problem (ii') aims at minimizing both scan number and tour length. We consider both lawn mowing (in which tour and scan points may leave P) and milling (in which tour, scan points and visibility must stay within P) variants for the MWPDV; even for simp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.2360","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1101.2360","created_at":"2026-05-18T02:22:58.254401+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.2360v1","created_at":"2026-05-18T02:22:58.254401+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.2360","created_at":"2026-05-18T02:22:58.254401+00:00"},{"alias_kind":"pith_short_12","alias_value":"6VMNGC6GP63X","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"6VMNGC6GP63XNFSD","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"6VMNGC6G","created_at":"2026-05-18T12:26:22.705136+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/6VMNGC6GP63XNFSDBHFAGSDEEN","json":"https://pith.science/pith/6VMNGC6GP63XNFSDBHFAGSDEEN.json","graph_json":"https://pith.science/api/pith-number/6VMNGC6GP63XNFSDBHFAGSDEEN/graph.json","events_json":"https://pith.science/api/pith-number/6VMNGC6GP63XNFSDBHFAGSDEEN/events.json","paper":"https://pith.science/paper/6VMNGC6G"},"agent_actions":{"view_html":"https://pith.science/pith/6VMNGC6GP63XNFSDBHFAGSDEEN","download_json":"https://pith.science/pith/6VMNGC6GP63XNFSDBHFAGSDEEN.json","view_paper":"https://pith.science/paper/6VMNGC6G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.2360&json=true","fetch_graph":"https://pith.science/api/pith-number/6VMNGC6GP63XNFSDBHFAGSDEEN/graph.json","fetch_events":"https://pith.science/api/pith-number/6VMNGC6GP63XNFSDBHFAGSDEEN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6VMNGC6GP63XNFSDBHFAGSDEEN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6VMNGC6GP63XNFSDBHFAGSDEEN/action/storage_attestation","attest_author":"https://pith.science/pith/6VMNGC6GP63XNFSDBHFAGSDEEN/action/author_attestation","sign_citation":"https://pith.science/pith/6VMNGC6GP63XNFSDBHFAGSDEEN/action/citation_signature","submit_replication":"https://pith.science/pith/6VMNGC6GP63XNFSDBHFAGSDEEN/action/replication_record"}},"created_at":"2026-05-18T02:22:58.254401+00:00","updated_at":"2026-05-18T02:22:58.254401+00:00"}