{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:QOXQSE24533MHG7ZYA7U7JZQSV","short_pith_number":"pith:QOXQSE24","schema_version":"1.0","canonical_sha256":"83af09135ceef6c39bf9c03f4fa73095762eab330db43a5ecd18bab35194e5c0","source":{"kind":"arxiv","id":"1103.0172","version":2},"attestation_state":"computed","paper":{"title":"Inverse Queries For Multidimensional Spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Andreas Z\\\"ufle, Hans-Peter Kriegel, Matthias Renz, Nikos Mamoulis, Shiming Zhang, Thomas Bernecker, Tobias Emrich","submitted_at":"2011-03-01T14:07:04Z","abstract_excerpt":"Traditional spatial queries return, for a given query object $q$, all database objects that satisfy a given predicate, such as epsilon range and $k$-nearest neighbors. This paper defines and studies {\\em inverse} spatial queries, which, given a subset of database objects $Q$ and a query predicate, return all objects which, if used as query objects with the predicate, contain $Q$ in their result. We first show a straightforward solution for answering inverse spatial queries for any query predicate. Then, we propose a filter-and-refinement framework that can be used to improve efficiency. We sho"},"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":"1103.0172","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-03-01T14:07:04Z","cross_cats_sorted":[],"title_canon_sha256":"42fb691ebeab70fad68843c7467f1dcea43124732135090019f7711b1e860592","abstract_canon_sha256":"d9fc98530277845719a6480e6100ae726107f98496236c1db39d751f2b45eaa0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:22:49.751709Z","signature_b64":"7v4TTBSONwrgGfXsS1uBxIH8Ar2Yrg4bDvBHWH0+/J0xJtVsyxF6ylbadTyDPx2QjvEkMkCT6jdonVogiyDGCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83af09135ceef6c39bf9c03f4fa73095762eab330db43a5ecd18bab35194e5c0","last_reissued_at":"2026-05-18T04:22:49.751054Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:22:49.751054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Inverse Queries For Multidimensional Spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Andreas Z\\\"ufle, Hans-Peter Kriegel, Matthias Renz, Nikos Mamoulis, Shiming Zhang, Thomas Bernecker, Tobias Emrich","submitted_at":"2011-03-01T14:07:04Z","abstract_excerpt":"Traditional spatial queries return, for a given query object $q$, all database objects that satisfy a given predicate, such as epsilon range and $k$-nearest neighbors. This paper defines and studies {\\em inverse} spatial queries, which, given a subset of database objects $Q$ and a query predicate, return all objects which, if used as query objects with the predicate, contain $Q$ in their result. We first show a straightforward solution for answering inverse spatial queries for any query predicate. Then, we propose a filter-and-refinement framework that can be used to improve efficiency. We sho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.0172","kind":"arxiv","version":2},"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":"1103.0172","created_at":"2026-05-18T04:22:49.751165+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.0172v2","created_at":"2026-05-18T04:22:49.751165+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.0172","created_at":"2026-05-18T04:22:49.751165+00:00"},{"alias_kind":"pith_short_12","alias_value":"QOXQSE24533M","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"QOXQSE24533MHG7Z","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"QOXQSE24","created_at":"2026-05-18T12:26:39.201973+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/QOXQSE24533MHG7ZYA7U7JZQSV","json":"https://pith.science/pith/QOXQSE24533MHG7ZYA7U7JZQSV.json","graph_json":"https://pith.science/api/pith-number/QOXQSE24533MHG7ZYA7U7JZQSV/graph.json","events_json":"https://pith.science/api/pith-number/QOXQSE24533MHG7ZYA7U7JZQSV/events.json","paper":"https://pith.science/paper/QOXQSE24"},"agent_actions":{"view_html":"https://pith.science/pith/QOXQSE24533MHG7ZYA7U7JZQSV","download_json":"https://pith.science/pith/QOXQSE24533MHG7ZYA7U7JZQSV.json","view_paper":"https://pith.science/paper/QOXQSE24","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.0172&json=true","fetch_graph":"https://pith.science/api/pith-number/QOXQSE24533MHG7ZYA7U7JZQSV/graph.json","fetch_events":"https://pith.science/api/pith-number/QOXQSE24533MHG7ZYA7U7JZQSV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QOXQSE24533MHG7ZYA7U7JZQSV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QOXQSE24533MHG7ZYA7U7JZQSV/action/storage_attestation","attest_author":"https://pith.science/pith/QOXQSE24533MHG7ZYA7U7JZQSV/action/author_attestation","sign_citation":"https://pith.science/pith/QOXQSE24533MHG7ZYA7U7JZQSV/action/citation_signature","submit_replication":"https://pith.science/pith/QOXQSE24533MHG7ZYA7U7JZQSV/action/replication_record"}},"created_at":"2026-05-18T04:22:49.751165+00:00","updated_at":"2026-05-18T04:22:49.751165+00:00"}