{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:3CEGPTMS74G2UT67VEKCRT52EU","short_pith_number":"pith:3CEGPTMS","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"},"canonical_sha256":"d88867cd92ff0daa4fdfa91428cfba2537eee5ac4171a1012cdce7b99ff4dca0","source":{"kind":"arxiv","id":"1212.5353","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.5353","created_at":"2026-05-18T03:38:02Z"},{"alias_kind":"arxiv_version","alias_value":"1212.5353v1","created_at":"2026-05-18T03:38:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.5353","created_at":"2026-05-18T03:38:02Z"},{"alias_kind":"pith_short_12","alias_value":"3CEGPTMS74G2","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"3CEGPTMS74G2UT67","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"3CEGPTMS","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:3CEGPTMS74G2UT67VEKCRT52EU","target":"record","payload":{"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"},"canonical_sha256":"d88867cd92ff0daa4fdfa91428cfba2537eee5ac4171a1012cdce7b99ff4dca0","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"},"source_kind":"arxiv","source_id":"1212.5353","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:38:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z13zzyEn0tgvkzPYIy4rx6EIcSWt5V5zMWE9LLlGCqRCjyZ2wOW9OsszFmuBJRGi7N1ldAQvVoCwsK13e1PoCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:01:33.123217Z"},"content_sha256":"2523a9e9263ad474f6cc18db73d10be2277a63e5717a9fb001bdce3b846d6665","schema_version":"1.0","event_id":"sha256:2523a9e9263ad474f6cc18db73d10be2277a63e5717a9fb001bdce3b846d6665"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:3CEGPTMS74G2UT67VEKCRT52EU","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:38:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VVdptJedZMrrQvAN/h6rR/+iqRTzwk9zPpww7AMj7Nnmra/ODeFVPmN9oxmpUNC08J8zk8FzDSZDRGXKdcSwAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:01:33.123896Z"},"content_sha256":"497e117743c9988eee4f4b62d27dbc53edcac2d53c3853e3c04e451fa4a8093c","schema_version":"1.0","event_id":"sha256:497e117743c9988eee4f4b62d27dbc53edcac2d53c3853e3c04e451fa4a8093c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3CEGPTMS74G2UT67VEKCRT52EU/bundle.json","state_url":"https://pith.science/pith/3CEGPTMS74G2UT67VEKCRT52EU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3CEGPTMS74G2UT67VEKCRT52EU/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-07T09:01:33Z","links":{"resolver":"https://pith.science/pith/3CEGPTMS74G2UT67VEKCRT52EU","bundle":"https://pith.science/pith/3CEGPTMS74G2UT67VEKCRT52EU/bundle.json","state":"https://pith.science/pith/3CEGPTMS74G2UT67VEKCRT52EU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3CEGPTMS74G2UT67VEKCRT52EU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:3CEGPTMS74G2UT67VEKCRT52EU","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f4285deeb276e5751a6df9642c4e90f16434333453d3f74cca7a2480e620cfd9","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-12-21T07:43:55Z","title_canon_sha256":"9d7b44e06904b93b89a8fd5710eeb8550dce8a36cebd8de2c59032288ea6f1ef"},"schema_version":"1.0","source":{"id":"1212.5353","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.5353","created_at":"2026-05-18T03:38:02Z"},{"alias_kind":"arxiv_version","alias_value":"1212.5353v1","created_at":"2026-05-18T03:38:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.5353","created_at":"2026-05-18T03:38:02Z"},{"alias_kind":"pith_short_12","alias_value":"3CEGPTMS74G2","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"3CEGPTMS74G2UT67","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"3CEGPTMS","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:497e117743c9988eee4f4b62d27dbc53edcac2d53c3853e3c04e451fa4a8093c","target":"graph","created_at":"2026-05-18T03:38:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Minati De, Sasanka Roy, Subhas C. Nandy","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-12-21T07:43:55Z","title":"Convex Hull and Linear Programming in Read-only Setup with Limited Work-space"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.5353","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2523a9e9263ad474f6cc18db73d10be2277a63e5717a9fb001bdce3b846d6665","target":"record","created_at":"2026-05-18T03:38:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f4285deeb276e5751a6df9642c4e90f16434333453d3f74cca7a2480e620cfd9","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-12-21T07:43:55Z","title_canon_sha256":"9d7b44e06904b93b89a8fd5710eeb8550dce8a36cebd8de2c59032288ea6f1ef"},"schema_version":"1.0","source":{"id":"1212.5353","kind":"arxiv","version":1}},"canonical_sha256":"d88867cd92ff0daa4fdfa91428cfba2537eee5ac4171a1012cdce7b99ff4dca0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d88867cd92ff0daa4fdfa91428cfba2537eee5ac4171a1012cdce7b99ff4dca0","first_computed_at":"2026-05-18T03:38:02.145865Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:38:02.145865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z2IxA8oJDDjxEsLlA7iX8sKdYLTBEyiCDO1HlpxigXY4AJaA6nRqR8zSHOfgsgcf+nEWJ3k0nOslEGfsHca4CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:38:02.146522Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.5353","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2523a9e9263ad474f6cc18db73d10be2277a63e5717a9fb001bdce3b846d6665","sha256:497e117743c9988eee4f4b62d27dbc53edcac2d53c3853e3c04e451fa4a8093c"],"state_sha256":"aed9f7cebecce30104b5ee6806f63fce7086bbb899619d86e66641c60e8cdbe4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nxq9o/Br7fjN8K8/sU2p/+z0FmWe4QKHbFAs+KnMUCgk+z7hgClYpiuQyOEg1c5wCPC30qrli/zXpeocggDMDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T09:01:33.129418Z","bundle_sha256":"75df100042116fb7119ac66995f9dfff51084198e19f9ec9b1bbca94bab3827b"}}