{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:QCHLGAYTCRJB7C5AWVSJI6HHVN","short_pith_number":"pith:QCHLGAYT","canonical_record":{"source":{"id":"1208.3384","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-08-16T14:42:38Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"724347d0b2de3018909161ca8892c51f0067a16001e6cd3e00bf300a5d8cd8d3","abstract_canon_sha256":"efed66489dbcdab7f652f6f4e395775894072cf097ad268ed149cde1db99a8a6"},"schema_version":"1.0"},"canonical_sha256":"808eb3031314521f8ba0b5649478e7ab71d27d010844ca8ededbd2f257f21951","source":{"kind":"arxiv","id":"1208.3384","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.3384","created_at":"2026-05-18T02:21:01Z"},{"alias_kind":"arxiv_version","alias_value":"1208.3384v3","created_at":"2026-05-18T02:21:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.3384","created_at":"2026-05-18T02:21:01Z"},{"alias_kind":"pith_short_12","alias_value":"QCHLGAYTCRJB","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QCHLGAYTCRJB7C5A","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QCHLGAYT","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:QCHLGAYTCRJB7C5AWVSJI6HHVN","target":"record","payload":{"canonical_record":{"source":{"id":"1208.3384","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-08-16T14:42:38Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"724347d0b2de3018909161ca8892c51f0067a16001e6cd3e00bf300a5d8cd8d3","abstract_canon_sha256":"efed66489dbcdab7f652f6f4e395775894072cf097ad268ed149cde1db99a8a6"},"schema_version":"1.0"},"canonical_sha256":"808eb3031314521f8ba0b5649478e7ab71d27d010844ca8ededbd2f257f21951","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:01.077907Z","signature_b64":"WnKEk8dYJ1woYj5ACTGWjDqeWmM8/ggmtjFMIAC+3EMbhujSgbNVJHN2XkymBeC7+ok/w4b66LTBAdF6cH4MDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"808eb3031314521f8ba0b5649478e7ab71d27d010844ca8ededbd2f257f21951","last_reissued_at":"2026-05-18T02:21:01.077418Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:01.077418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.3384","source_version":3,"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-18T02:21:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P8i2T97lZ+tVZu/r+V/U6uNvOMXkPK/8LDfjY9qNMW6dj6nFQVhBWIbPoo7F1LdSSBB3jwvvNfNVm3Oy5JXvDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:19:08.540962Z"},"content_sha256":"fe5eec3ce906b1dcddb291cff31a2a369542ff851525293508c7bc45487d6ac1","schema_version":"1.0","event_id":"sha256:fe5eec3ce906b1dcddb291cff31a2a369542ff851525293508c7bc45487d6ac1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:QCHLGAYTCRJB7C5AWVSJI6HHVN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Range Searching with Semialgebraic Sets II","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Jiri Matousek, Micha Sharir, Pankaj K. Agarwal","submitted_at":"2012-08-16T14:42:38Z","abstract_excerpt":"Let $P$ be a set of $n$ points in $\\R^d$. We present a linear-size data structure for answering range queries on $P$ with constant-complexity semialgebraic sets as ranges, in time close to $O(n^{1-1/d})$. It essentially matches the performance of similar structures for simplex range searching, and, for $d\\ge 5$, significantly improves earlier solutions by the first two authors obtained in~1994. This almost settles a long-standing open problem in range searching.\n  The data structure is based on the polynomial-partitioning technique of Guth and Katz [arXiv:1011.4105], which shows that for a par"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.3384","kind":"arxiv","version":3},"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-18T02:21:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gZQptq+aX6qAUD8sQkMMwZ5wMg7TfHWqHDqcGVv4hiYry/vkZtZImKPbrkL50mASm5TKD4NeTiVgSYo3oxs9CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:19:08.541336Z"},"content_sha256":"dab7cfae9ba9a5e601635cba7e923abe6f04f69da0542a514a125a1252d8b049","schema_version":"1.0","event_id":"sha256:dab7cfae9ba9a5e601635cba7e923abe6f04f69da0542a514a125a1252d8b049"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QCHLGAYTCRJB7C5AWVSJI6HHVN/bundle.json","state_url":"https://pith.science/pith/QCHLGAYTCRJB7C5AWVSJI6HHVN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QCHLGAYTCRJB7C5AWVSJI6HHVN/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-05-27T11:19:08Z","links":{"resolver":"https://pith.science/pith/QCHLGAYTCRJB7C5AWVSJI6HHVN","bundle":"https://pith.science/pith/QCHLGAYTCRJB7C5AWVSJI6HHVN/bundle.json","state":"https://pith.science/pith/QCHLGAYTCRJB7C5AWVSJI6HHVN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QCHLGAYTCRJB7C5AWVSJI6HHVN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:QCHLGAYTCRJB7C5AWVSJI6HHVN","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":"efed66489dbcdab7f652f6f4e395775894072cf097ad268ed149cde1db99a8a6","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-08-16T14:42:38Z","title_canon_sha256":"724347d0b2de3018909161ca8892c51f0067a16001e6cd3e00bf300a5d8cd8d3"},"schema_version":"1.0","source":{"id":"1208.3384","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.3384","created_at":"2026-05-18T02:21:01Z"},{"alias_kind":"arxiv_version","alias_value":"1208.3384v3","created_at":"2026-05-18T02:21:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.3384","created_at":"2026-05-18T02:21:01Z"},{"alias_kind":"pith_short_12","alias_value":"QCHLGAYTCRJB","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QCHLGAYTCRJB7C5A","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QCHLGAYT","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:dab7cfae9ba9a5e601635cba7e923abe6f04f69da0542a514a125a1252d8b049","target":"graph","created_at":"2026-05-18T02:21:01Z","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":"Let $P$ be a set of $n$ points in $\\R^d$. We present a linear-size data structure for answering range queries on $P$ with constant-complexity semialgebraic sets as ranges, in time close to $O(n^{1-1/d})$. It essentially matches the performance of similar structures for simplex range searching, and, for $d\\ge 5$, significantly improves earlier solutions by the first two authors obtained in~1994. This almost settles a long-standing open problem in range searching.\n  The data structure is based on the polynomial-partitioning technique of Guth and Katz [arXiv:1011.4105], which shows that for a par","authors_text":"Jiri Matousek, Micha Sharir, Pankaj K. Agarwal","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-08-16T14:42:38Z","title":"On Range Searching with Semialgebraic Sets II"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.3384","kind":"arxiv","version":3},"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:fe5eec3ce906b1dcddb291cff31a2a369542ff851525293508c7bc45487d6ac1","target":"record","created_at":"2026-05-18T02:21:01Z","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":"efed66489dbcdab7f652f6f4e395775894072cf097ad268ed149cde1db99a8a6","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-08-16T14:42:38Z","title_canon_sha256":"724347d0b2de3018909161ca8892c51f0067a16001e6cd3e00bf300a5d8cd8d3"},"schema_version":"1.0","source":{"id":"1208.3384","kind":"arxiv","version":3}},"canonical_sha256":"808eb3031314521f8ba0b5649478e7ab71d27d010844ca8ededbd2f257f21951","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"808eb3031314521f8ba0b5649478e7ab71d27d010844ca8ededbd2f257f21951","first_computed_at":"2026-05-18T02:21:01.077418Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:01.077418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WnKEk8dYJ1woYj5ACTGWjDqeWmM8/ggmtjFMIAC+3EMbhujSgbNVJHN2XkymBeC7+ok/w4b66LTBAdF6cH4MDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:01.077907Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.3384","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe5eec3ce906b1dcddb291cff31a2a369542ff851525293508c7bc45487d6ac1","sha256:dab7cfae9ba9a5e601635cba7e923abe6f04f69da0542a514a125a1252d8b049"],"state_sha256":"d6fb771c9fff74c2517141153e2a090408b330c237b6c6a7bda3164b4aaa37f4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y309cP0+8ACy3v/pQr8dVEivPghzxVJq7oaeauwcZFEBdOeq1VxYaHNP2GXbxSwaKt4nyrUBRlRaS5XPhzOyDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T11:19:08.544008Z","bundle_sha256":"49f66ac6d64a88bfe396ff828320f7dfbb7b689cadfd7686a221d3f1cc926f01"}}