{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:3UNFAIOSL6E33DA7NQYZSJAJAB","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":"f1b2b039bebf1c86eb5b437ea7bc9c73081f7f0f705656b21374289eca54cf2e","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-07-12T10:08:58Z","title_canon_sha256":"962052cfeca9245d68db4e1fe933a16a04fbc7283df5f2a7ea3b58adbd977251"},"schema_version":"1.0","source":{"id":"1107.2231","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.2231","created_at":"2026-05-18T04:18:25Z"},{"alias_kind":"arxiv_version","alias_value":"1107.2231v1","created_at":"2026-05-18T04:18:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2231","created_at":"2026-05-18T04:18:25Z"},{"alias_kind":"pith_short_12","alias_value":"3UNFAIOSL6E3","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"3UNFAIOSL6E33DA7","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"3UNFAIOS","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:67e19fe11c923e6df7494e56f6abf0e107da0ca41fbc7a8f55fafc2210f834d9","target":"graph","created_at":"2026-05-18T04:18:25Z","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":"We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the traditional model where the data consist of independent and uniform points in the unit square. For this model, in a structure on $n$ points, it is known that the number of nodes $C_n(\\xi)$ to visit in order to report the items matching an independent and uniformly on $[0,1]$ random query $\\xi$ satisfies $\\Ec{C_n(\\xi)}\\sim \\kappa n^{\\beta}$, where $\\kappa$ and $\\beta$ are explicit constants. We develop an approach based on the analysis of the cos","authors_text":"Henning Sulzbach, Nicolas Broutin, Ralph Neininger","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-07-12T10:08:58Z","title":"Partial match queries in random quadtrees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2231","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:d478dba0b19a4a910599a309c4aeca0c085e2b9ebc084872dd9c88d6252c5807","target":"record","created_at":"2026-05-18T04:18:25Z","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":"f1b2b039bebf1c86eb5b437ea7bc9c73081f7f0f705656b21374289eca54cf2e","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-07-12T10:08:58Z","title_canon_sha256":"962052cfeca9245d68db4e1fe933a16a04fbc7283df5f2a7ea3b58adbd977251"},"schema_version":"1.0","source":{"id":"1107.2231","kind":"arxiv","version":1}},"canonical_sha256":"dd1a5021d25f89bd8c1f6c31992409007b7c216939bdafabe8f42e0fa08cb608","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd1a5021d25f89bd8c1f6c31992409007b7c216939bdafabe8f42e0fa08cb608","first_computed_at":"2026-05-18T04:18:25.008365Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:18:25.008365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3UWkqd7eMWTDMg9CrYFBLcQazAhkOIR8wUz1GpLHYwEPi6OtK+11Nn9ERbGjcpiwCwKJ2zypcFbiYnTPaUvpAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:18:25.008953Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.2231","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d478dba0b19a4a910599a309c4aeca0c085e2b9ebc084872dd9c88d6252c5807","sha256:67e19fe11c923e6df7494e56f6abf0e107da0ca41fbc7a8f55fafc2210f834d9"],"state_sha256":"0c3ce01245719c1ad84191041323e0cc9b413d850cfba9100ce63d7d7dcd2c31"}