{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:F3JDNYDDFIL6ACQ2VLTCKGRJYC","short_pith_number":"pith:F3JDNYDD","schema_version":"1.0","canonical_sha256":"2ed236e0632a17e00a1aaae6251a29c091fd63cd7320de9784f397caa9ff8900","source":{"kind":"arxiv","id":"1707.01223","version":2},"attestation_state":"computed","paper":{"title":"Eclipse: Practicability Beyond kNN and Skyline","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Jian Pei, Jinfei Liu, Jun Luo, Li Xiong, Qiuchen Zhang","submitted_at":"2017-07-05T06:03:02Z","abstract_excerpt":"The $k$ nearest neighbor ($k$NN) query is a fundamental problem in databases. Given a set of multidimensional data points and a query point, $k$NN returns the $k$ nearest neighbors based on a scoring function such as weighted sum given an attribute weight vector. However, the attribute weight vector can be difficult to specify in practice. Skyline returns the points including all possible nearest neighbors without requiring the exact attribute weight vector or a scoring function but the number of returned points can be prohibitively large for practical use.\n  In this paper, we propose a novel "},"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":"1707.01223","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-07-05T06:03:02Z","cross_cats_sorted":[],"title_canon_sha256":"ed0efde63c8258185d6176b9378fcac6718d61e659a3a63d1d2e34ac7a5fbf7c","abstract_canon_sha256":"0c8f736f3940a39918a16d7f10bdb5bccedfc4e9b3a6662772457e0a41ed731a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:00.320807Z","signature_b64":"uIJm8ORyrw4SxTzyuIqbMHhRdWyJbbyzNQ1bI+yIGceQBlYtPW/Ri2WLFZKRY1Eo9eX6NvE4Qc7DIhy0eZvSAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ed236e0632a17e00a1aaae6251a29c091fd63cd7320de9784f397caa9ff8900","last_reissued_at":"2026-05-18T00:03:00.320312Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:00.320312Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Eclipse: Practicability Beyond kNN and Skyline","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Jian Pei, Jinfei Liu, Jun Luo, Li Xiong, Qiuchen Zhang","submitted_at":"2017-07-05T06:03:02Z","abstract_excerpt":"The $k$ nearest neighbor ($k$NN) query is a fundamental problem in databases. Given a set of multidimensional data points and a query point, $k$NN returns the $k$ nearest neighbors based on a scoring function such as weighted sum given an attribute weight vector. However, the attribute weight vector can be difficult to specify in practice. Skyline returns the points including all possible nearest neighbors without requiring the exact attribute weight vector or a scoring function but the number of returned points can be prohibitively large for practical use.\n  In this paper, we propose a novel "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01223","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":"1707.01223","created_at":"2026-05-18T00:03:00.320400+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.01223v2","created_at":"2026-05-18T00:03:00.320400+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01223","created_at":"2026-05-18T00:03:00.320400+00:00"},{"alias_kind":"pith_short_12","alias_value":"F3JDNYDDFIL6","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"F3JDNYDDFIL6ACQ2","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"F3JDNYDD","created_at":"2026-05-18T12:31:15.632608+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/F3JDNYDDFIL6ACQ2VLTCKGRJYC","json":"https://pith.science/pith/F3JDNYDDFIL6ACQ2VLTCKGRJYC.json","graph_json":"https://pith.science/api/pith-number/F3JDNYDDFIL6ACQ2VLTCKGRJYC/graph.json","events_json":"https://pith.science/api/pith-number/F3JDNYDDFIL6ACQ2VLTCKGRJYC/events.json","paper":"https://pith.science/paper/F3JDNYDD"},"agent_actions":{"view_html":"https://pith.science/pith/F3JDNYDDFIL6ACQ2VLTCKGRJYC","download_json":"https://pith.science/pith/F3JDNYDDFIL6ACQ2VLTCKGRJYC.json","view_paper":"https://pith.science/paper/F3JDNYDD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.01223&json=true","fetch_graph":"https://pith.science/api/pith-number/F3JDNYDDFIL6ACQ2VLTCKGRJYC/graph.json","fetch_events":"https://pith.science/api/pith-number/F3JDNYDDFIL6ACQ2VLTCKGRJYC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F3JDNYDDFIL6ACQ2VLTCKGRJYC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F3JDNYDDFIL6ACQ2VLTCKGRJYC/action/storage_attestation","attest_author":"https://pith.science/pith/F3JDNYDDFIL6ACQ2VLTCKGRJYC/action/author_attestation","sign_citation":"https://pith.science/pith/F3JDNYDDFIL6ACQ2VLTCKGRJYC/action/citation_signature","submit_replication":"https://pith.science/pith/F3JDNYDDFIL6ACQ2VLTCKGRJYC/action/replication_record"}},"created_at":"2026-05-18T00:03:00.320400+00:00","updated_at":"2026-05-18T00:03:00.320400+00:00"}