{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:3CEGPTMS74G2UT67VEKCRT52EU","short_pith_number":"pith:3CEGPTMS","schema_version":"1.0","canonical_sha256":"d88867cd92ff0daa4fdfa91428cfba2537eee5ac4171a1012cdce7b99ff4dca0","source":{"kind":"arxiv","id":"1212.5353","version":1},"attestation_state":"computed","paper":{"title":"Convex Hull and Linear Programming in Read-only Setup with Limited Work-space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Minati De, Sasanka Roy, Subhas C. Nandy","submitted_at":"2012-12-21T07:43:55Z","abstract_excerpt":"Prune-and-search is an important paradigm for solving many important geometric problems. We show that the general prune-and-search technique can be implemented where the objects are given in read-only memory. As examples we consider convex-hull in 2D, and linear programming in 2D and 3D. For the convex-hull problem, designing sub-quadratic algorithm in a read-only setup with sub-linear space is an open problem for a long time. We first propose a simple algorithm for this problem that runs in $O(n^{3/2+\\epsilon)}$ time and $O(n^(1/2))$ space. Next, we consider a restricted version of the proble"},"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":"1212.5353","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-12-21T07:43:55Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"9d7b44e06904b93b89a8fd5710eeb8550dce8a36cebd8de2c59032288ea6f1ef","abstract_canon_sha256":"f4285deeb276e5751a6df9642c4e90f16434333453d3f74cca7a2480e620cfd9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:02.146522Z","signature_b64":"z2IxA8oJDDjxEsLlA7iX8sKdYLTBEyiCDO1HlpxigXY4AJaA6nRqR8zSHOfgsgcf+nEWJ3k0nOslEGfsHca4CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d88867cd92ff0daa4fdfa91428cfba2537eee5ac4171a1012cdce7b99ff4dca0","last_reissued_at":"2026-05-18T03:38:02.145865Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:02.145865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convex Hull and Linear Programming in Read-only Setup with Limited Work-space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Minati De, Sasanka Roy, Subhas C. Nandy","submitted_at":"2012-12-21T07:43:55Z","abstract_excerpt":"Prune-and-search is an important paradigm for solving many important geometric problems. We show that the general prune-and-search technique can be implemented where the objects are given in read-only memory. As examples we consider convex-hull in 2D, and linear programming in 2D and 3D. For the convex-hull problem, designing sub-quadratic algorithm in a read-only setup with sub-linear space is an open problem for a long time. We first propose a simple algorithm for this problem that runs in $O(n^{3/2+\\epsilon)}$ time and $O(n^(1/2))$ space. Next, we consider a restricted version of the proble"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.5353","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":"1212.5353","created_at":"2026-05-18T03:38:02.145976+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.5353v1","created_at":"2026-05-18T03:38:02.145976+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.5353","created_at":"2026-05-18T03:38:02.145976+00:00"},{"alias_kind":"pith_short_12","alias_value":"3CEGPTMS74G2","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"3CEGPTMS74G2UT67","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"3CEGPTMS","created_at":"2026-05-18T12:26:50.516681+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/3CEGPTMS74G2UT67VEKCRT52EU","json":"https://pith.science/pith/3CEGPTMS74G2UT67VEKCRT52EU.json","graph_json":"https://pith.science/api/pith-number/3CEGPTMS74G2UT67VEKCRT52EU/graph.json","events_json":"https://pith.science/api/pith-number/3CEGPTMS74G2UT67VEKCRT52EU/events.json","paper":"https://pith.science/paper/3CEGPTMS"},"agent_actions":{"view_html":"https://pith.science/pith/3CEGPTMS74G2UT67VEKCRT52EU","download_json":"https://pith.science/pith/3CEGPTMS74G2UT67VEKCRT52EU.json","view_paper":"https://pith.science/paper/3CEGPTMS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.5353&json=true","fetch_graph":"https://pith.science/api/pith-number/3CEGPTMS74G2UT67VEKCRT52EU/graph.json","fetch_events":"https://pith.science/api/pith-number/3CEGPTMS74G2UT67VEKCRT52EU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3CEGPTMS74G2UT67VEKCRT52EU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3CEGPTMS74G2UT67VEKCRT52EU/action/storage_attestation","attest_author":"https://pith.science/pith/3CEGPTMS74G2UT67VEKCRT52EU/action/author_attestation","sign_citation":"https://pith.science/pith/3CEGPTMS74G2UT67VEKCRT52EU/action/citation_signature","submit_replication":"https://pith.science/pith/3CEGPTMS74G2UT67VEKCRT52EU/action/replication_record"}},"created_at":"2026-05-18T03:38:02.145976+00:00","updated_at":"2026-05-18T03:38:02.145976+00:00"}