{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:4473CXDKF2OHUOA32TY2WBA4QN","short_pith_number":"pith:4473CXDK","schema_version":"1.0","canonical_sha256":"e73fb15c6a2e9c7a381bd4f1ab041c834a3eea6760e93fc8521ced4c14981c6d","source":{"kind":"arxiv","id":"1108.2063","version":1},"attestation_state":"computed","paper":{"title":"How to Cover a Point Set with a V-Shape of Minimum Width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Boris Aronov, Muriel Dulieu","submitted_at":"2011-08-09T22:29:31Z","abstract_excerpt":"A balanced V-shape is a polygonal region in the plane contained in the union of two crossing equal-width strips. It is delimited by two pairs of parallel rays that emanate from two points x, y, are contained in the strip boundaries, and are mirror-symmetric with respect to the line xy. The width of a balanced V-shape is the width of the strips. We first present an O(n^2 log n) time algorithm to compute, given a set of n points P, a minimum-width balanced V-shape covering P. We then describe a PTAS for computing a (1+epsilon)-approximation of this V-shape in time O((n/epsilon)log n+(n/epsilon^("},"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":"1108.2063","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-08-09T22:29:31Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"46b1017b431de3bf95f0c782f7b729565e00454aa09835cba91f2703b3217fc3","abstract_canon_sha256":"362b16bfabb45fbfd09911a3bf349192ecf7b2cd0bb3e6cbb576834729c43379"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:15:49.448593Z","signature_b64":"0250wKnj65UQveHRFE+ZPPHq2o6Aw3RMwoEqm04iw/LV4cnEqV2p95oZ3XIARTx7tTQj56zX0stOO4Ix7ZP/CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e73fb15c6a2e9c7a381bd4f1ab041c834a3eea6760e93fc8521ced4c14981c6d","last_reissued_at":"2026-05-18T04:15:49.447669Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:15:49.447669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How to Cover a Point Set with a V-Shape of Minimum Width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Boris Aronov, Muriel Dulieu","submitted_at":"2011-08-09T22:29:31Z","abstract_excerpt":"A balanced V-shape is a polygonal region in the plane contained in the union of two crossing equal-width strips. It is delimited by two pairs of parallel rays that emanate from two points x, y, are contained in the strip boundaries, and are mirror-symmetric with respect to the line xy. The width of a balanced V-shape is the width of the strips. We first present an O(n^2 log n) time algorithm to compute, given a set of n points P, a minimum-width balanced V-shape covering P. We then describe a PTAS for computing a (1+epsilon)-approximation of this V-shape in time O((n/epsilon)log n+(n/epsilon^("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.2063","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":"1108.2063","created_at":"2026-05-18T04:15:49.447826+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.2063v1","created_at":"2026-05-18T04:15:49.447826+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.2063","created_at":"2026-05-18T04:15:49.447826+00:00"},{"alias_kind":"pith_short_12","alias_value":"4473CXDKF2OH","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"4473CXDKF2OHUOA3","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"4473CXDK","created_at":"2026-05-18T12:26:20.644004+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/4473CXDKF2OHUOA32TY2WBA4QN","json":"https://pith.science/pith/4473CXDKF2OHUOA32TY2WBA4QN.json","graph_json":"https://pith.science/api/pith-number/4473CXDKF2OHUOA32TY2WBA4QN/graph.json","events_json":"https://pith.science/api/pith-number/4473CXDKF2OHUOA32TY2WBA4QN/events.json","paper":"https://pith.science/paper/4473CXDK"},"agent_actions":{"view_html":"https://pith.science/pith/4473CXDKF2OHUOA32TY2WBA4QN","download_json":"https://pith.science/pith/4473CXDKF2OHUOA32TY2WBA4QN.json","view_paper":"https://pith.science/paper/4473CXDK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.2063&json=true","fetch_graph":"https://pith.science/api/pith-number/4473CXDKF2OHUOA32TY2WBA4QN/graph.json","fetch_events":"https://pith.science/api/pith-number/4473CXDKF2OHUOA32TY2WBA4QN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4473CXDKF2OHUOA32TY2WBA4QN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4473CXDKF2OHUOA32TY2WBA4QN/action/storage_attestation","attest_author":"https://pith.science/pith/4473CXDKF2OHUOA32TY2WBA4QN/action/author_attestation","sign_citation":"https://pith.science/pith/4473CXDKF2OHUOA32TY2WBA4QN/action/citation_signature","submit_replication":"https://pith.science/pith/4473CXDKF2OHUOA32TY2WBA4QN/action/replication_record"}},"created_at":"2026-05-18T04:15:49.447826+00:00","updated_at":"2026-05-18T04:15:49.447826+00:00"}