{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:E6KEQHUBZSX7ZPOAVPRQ7LRL5F","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":"663fb61c916beab6d7da72e5579b9e53955796f64f949b3ad32a36e2c07e5365","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-02-07T03:36:00Z","title_canon_sha256":"27efce210e51243104e5eb7bf6456ef73a154a0a9501fcc6ec9ef12a533cc0bf"},"schema_version":"1.0","source":{"id":"1202.1342","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.1342","created_at":"2026-05-18T03:05:28Z"},{"alias_kind":"arxiv_version","alias_value":"1202.1342v5","created_at":"2026-05-18T03:05:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1342","created_at":"2026-05-18T03:05:28Z"},{"alias_kind":"pith_short_12","alias_value":"E6KEQHUBZSX7","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"E6KEQHUBZSX7ZPOA","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"E6KEQHUB","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:6c61f8ee9af58b1832e29eaa4548aa614df8ca2eb042f2678c591039b7cbd6fc","target":"graph","created_at":"2026-05-18T03:05:28Z","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 (quadtrees 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 a random query $\\xi$, independent and uniformly distributed on $[0,1]$, satisfies $\\mathbf {E}[{C_n(\\xi )}]\\sim\\kappa n^{\\beta}$, where $\\kappa$ and $\\beta$ are explicit constants. We develop an approach based o","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":"2012-02-07T03:36:00Z","title":"A limit process for partial match queries in random quadtrees and $2$-d trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.1342","kind":"arxiv","version":5},"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:04facd8d44428c13a948ee01aacb64e0816a6ba3c00cbb21dec80d60d4824ada","target":"record","created_at":"2026-05-18T03:05:28Z","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":"663fb61c916beab6d7da72e5579b9e53955796f64f949b3ad32a36e2c07e5365","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-02-07T03:36:00Z","title_canon_sha256":"27efce210e51243104e5eb7bf6456ef73a154a0a9501fcc6ec9ef12a533cc0bf"},"schema_version":"1.0","source":{"id":"1202.1342","kind":"arxiv","version":5}},"canonical_sha256":"2794481e81ccaffcbdc0abe30fae2be949cdb1d8ca8e4d8515331f467e3295d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2794481e81ccaffcbdc0abe30fae2be949cdb1d8ca8e4d8515331f467e3295d8","first_computed_at":"2026-05-18T03:05:28.574912Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:28.574912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fhPOdOh8CbcvG8dC5b3tDxHeC+pzUSfXcmWA07caQDDUbx8BfpnIU+DngJoLAOcOtfX+fzrg5rstK5NGiS/ADg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:28.575735Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.1342","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04facd8d44428c13a948ee01aacb64e0816a6ba3c00cbb21dec80d60d4824ada","sha256:6c61f8ee9af58b1832e29eaa4548aa614df8ca2eb042f2678c591039b7cbd6fc"],"state_sha256":"b9894941f83a05cd342119e0cacdab3040ad7440f4da0749722776562574fa0e"}