{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:MY5UZNXQH3YB4O3KDWFOYTBPHV","short_pith_number":"pith:MY5UZNXQ","schema_version":"1.0","canonical_sha256":"663b4cb6f03ef01e3b6a1d8aec4c2f3d5e70597cdc3b2821086cbc9d9530207e","source":{"kind":"arxiv","id":"1112.2336","version":1},"attestation_state":"computed","paper":{"title":"The Spatial Nearest Neighbor Skyline Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Ahmad Baraani-Dastgerdi, Nasrin Mazaheri Soudani","submitted_at":"2011-12-11T08:43:54Z","abstract_excerpt":"User preference queries are very important in spatial databases. With the help of these queries, one can found best location among points saved in database. In many situation users evaluate quality of a location with its distance from its nearest neighbor among a special set of points. There has been less attention about evaluating a location with its distance to nearest neighbors in spatial user preference queries. This problem has application in many domains such as service recommendation systems and investment planning. Related works in this field are based on top-k queries. The problem wit"},"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":"1112.2336","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-12-11T08:43:54Z","cross_cats_sorted":[],"title_canon_sha256":"adc211f01df541234ad92d25e5bf73dcd1c4ad544279254ed7f197828d7dc940","abstract_canon_sha256":"a2fc2e2c600eceba37fc35e552622be01a2549021075aa46ddf632a2741ec77b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:06:34.760668Z","signature_b64":"T0/BF/D/i3613dOolrVK4rPCjIICF9XNbfPKovUsMOv9kxAmttlSLSYkgH46ss4DGAyhBsGBEHGVAuTQR7cfCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"663b4cb6f03ef01e3b6a1d8aec4c2f3d5e70597cdc3b2821086cbc9d9530207e","last_reissued_at":"2026-05-18T04:06:34.760052Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:06:34.760052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Spatial Nearest Neighbor Skyline Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Ahmad Baraani-Dastgerdi, Nasrin Mazaheri Soudani","submitted_at":"2011-12-11T08:43:54Z","abstract_excerpt":"User preference queries are very important in spatial databases. With the help of these queries, one can found best location among points saved in database. In many situation users evaluate quality of a location with its distance from its nearest neighbor among a special set of points. There has been less attention about evaluating a location with its distance to nearest neighbors in spatial user preference queries. This problem has application in many domains such as service recommendation systems and investment planning. Related works in this field are based on top-k queries. The problem wit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.2336","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":"1112.2336","created_at":"2026-05-18T04:06:34.760156+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.2336v1","created_at":"2026-05-18T04:06:34.760156+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.2336","created_at":"2026-05-18T04:06:34.760156+00:00"},{"alias_kind":"pith_short_12","alias_value":"MY5UZNXQH3YB","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"MY5UZNXQH3YB4O3K","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"MY5UZNXQ","created_at":"2026-05-18T12:26:37.096874+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/MY5UZNXQH3YB4O3KDWFOYTBPHV","json":"https://pith.science/pith/MY5UZNXQH3YB4O3KDWFOYTBPHV.json","graph_json":"https://pith.science/api/pith-number/MY5UZNXQH3YB4O3KDWFOYTBPHV/graph.json","events_json":"https://pith.science/api/pith-number/MY5UZNXQH3YB4O3KDWFOYTBPHV/events.json","paper":"https://pith.science/paper/MY5UZNXQ"},"agent_actions":{"view_html":"https://pith.science/pith/MY5UZNXQH3YB4O3KDWFOYTBPHV","download_json":"https://pith.science/pith/MY5UZNXQH3YB4O3KDWFOYTBPHV.json","view_paper":"https://pith.science/paper/MY5UZNXQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.2336&json=true","fetch_graph":"https://pith.science/api/pith-number/MY5UZNXQH3YB4O3KDWFOYTBPHV/graph.json","fetch_events":"https://pith.science/api/pith-number/MY5UZNXQH3YB4O3KDWFOYTBPHV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MY5UZNXQH3YB4O3KDWFOYTBPHV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MY5UZNXQH3YB4O3KDWFOYTBPHV/action/storage_attestation","attest_author":"https://pith.science/pith/MY5UZNXQH3YB4O3KDWFOYTBPHV/action/author_attestation","sign_citation":"https://pith.science/pith/MY5UZNXQH3YB4O3KDWFOYTBPHV/action/citation_signature","submit_replication":"https://pith.science/pith/MY5UZNXQH3YB4O3KDWFOYTBPHV/action/replication_record"}},"created_at":"2026-05-18T04:06:34.760156+00:00","updated_at":"2026-05-18T04:06:34.760156+00:00"}