{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:3UNFAIOSL6E33DA7NQYZSJAJAB","short_pith_number":"pith:3UNFAIOS","schema_version":"1.0","canonical_sha256":"dd1a5021d25f89bd8c1f6c31992409007b7c216939bdafabe8f42e0fa08cb608","source":{"kind":"arxiv","id":"1107.2231","version":1},"attestation_state":"computed","paper":{"title":"Partial match queries in random quadtrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"math.PR","authors_text":"Henning Sulzbach, Nicolas Broutin, Ralph Neininger","submitted_at":"2011-07-12T10:08:58Z","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"},"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":"1107.2231","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-07-12T10:08:58Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"962052cfeca9245d68db4e1fe933a16a04fbc7283df5f2a7ea3b58adbd977251","abstract_canon_sha256":"f1b2b039bebf1c86eb5b437ea7bc9c73081f7f0f705656b21374289eca54cf2e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:25.008953Z","signature_b64":"3UWkqd7eMWTDMg9CrYFBLcQazAhkOIR8wUz1GpLHYwEPi6OtK+11Nn9ERbGjcpiwCwKJ2zypcFbiYnTPaUvpAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd1a5021d25f89bd8c1f6c31992409007b7c216939bdafabe8f42e0fa08cb608","last_reissued_at":"2026-05-18T04:18:25.008365Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:25.008365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partial match queries in random quadtrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"math.PR","authors_text":"Henning Sulzbach, Nicolas Broutin, Ralph Neininger","submitted_at":"2011-07-12T10:08:58Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2231","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":"1107.2231","created_at":"2026-05-18T04:18:25.008459+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.2231v1","created_at":"2026-05-18T04:18:25.008459+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2231","created_at":"2026-05-18T04:18:25.008459+00:00"},{"alias_kind":"pith_short_12","alias_value":"3UNFAIOSL6E3","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"3UNFAIOSL6E33DA7","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"3UNFAIOS","created_at":"2026-05-18T12:26:20.644004+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/3UNFAIOSL6E33DA7NQYZSJAJAB","json":"https://pith.science/pith/3UNFAIOSL6E33DA7NQYZSJAJAB.json","graph_json":"https://pith.science/api/pith-number/3UNFAIOSL6E33DA7NQYZSJAJAB/graph.json","events_json":"https://pith.science/api/pith-number/3UNFAIOSL6E33DA7NQYZSJAJAB/events.json","paper":"https://pith.science/paper/3UNFAIOS"},"agent_actions":{"view_html":"https://pith.science/pith/3UNFAIOSL6E33DA7NQYZSJAJAB","download_json":"https://pith.science/pith/3UNFAIOSL6E33DA7NQYZSJAJAB.json","view_paper":"https://pith.science/paper/3UNFAIOS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.2231&json=true","fetch_graph":"https://pith.science/api/pith-number/3UNFAIOSL6E33DA7NQYZSJAJAB/graph.json","fetch_events":"https://pith.science/api/pith-number/3UNFAIOSL6E33DA7NQYZSJAJAB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3UNFAIOSL6E33DA7NQYZSJAJAB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3UNFAIOSL6E33DA7NQYZSJAJAB/action/storage_attestation","attest_author":"https://pith.science/pith/3UNFAIOSL6E33DA7NQYZSJAJAB/action/author_attestation","sign_citation":"https://pith.science/pith/3UNFAIOSL6E33DA7NQYZSJAJAB/action/citation_signature","submit_replication":"https://pith.science/pith/3UNFAIOSL6E33DA7NQYZSJAJAB/action/replication_record"}},"created_at":"2026-05-18T04:18:25.008459+00:00","updated_at":"2026-05-18T04:18:25.008459+00:00"}