{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DSMRJAHQX6N2XBM3TBAKLYH63O","short_pith_number":"pith:DSMRJAHQ","schema_version":"1.0","canonical_sha256":"1c991480f0bf9bab859b9840a5e0fedbb6e749b330e1820e21c4c5ef4f1e1476","source":{"kind":"arxiv","id":"1709.03949","version":1},"attestation_state":"computed","paper":{"title":"Skyline Queries in O(1) time?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Andreas Kosmatopoulos, Apostolos N. Papadopoulos, Dimitrios Tsoumakos, Katerina Doka, Kostas Tsichlas, Spyros Sioutas","submitted_at":"2017-09-12T16:51:28Z","abstract_excerpt":"The skyline of a set $P$ of points ($SKY(P)$) consists of the \"best\" points with respect to minimization or maximization of the attribute values. A point $p$ dominates another point $q$ if $p$ is as good as $q$ in all dimensions and it is strictly better than $q$ in at least one dimension. In this work, we focus on the static $2$-d space and provide expected performance guarantees for $3$-sided Range Skyline Queries on the Grid, where $N$ is the cardinality of $P$, $B$ the size of a disk block, and $R$ the capacity of main memory. We present the MLR-tree, which offers optimal expected cost for"},"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":"1709.03949","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-09-12T16:51:28Z","cross_cats_sorted":[],"title_canon_sha256":"0c27c9003709fac1db3dbf8b52c6c36263db1ec8bfefb2daca17b1e74cfb553e","abstract_canon_sha256":"68cb5a77251cf676a1640d389d9a00ef0c55bebd12adb11f3e7f77456d8ea729"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:28.944313Z","signature_b64":"vX5VRzYkZs+9E5iJXmsltqx85z9y8C8jjfAe38O5SlTypsRDVMwMXzqReRYrpmaL4+hch0Ji+N3SqP/NQUNvBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c991480f0bf9bab859b9840a5e0fedbb6e749b330e1820e21c4c5ef4f1e1476","last_reissued_at":"2026-05-18T00:35:28.943623Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:28.943623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Skyline Queries in O(1) time?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Andreas Kosmatopoulos, Apostolos N. Papadopoulos, Dimitrios Tsoumakos, Katerina Doka, Kostas Tsichlas, Spyros Sioutas","submitted_at":"2017-09-12T16:51:28Z","abstract_excerpt":"The skyline of a set $P$ of points ($SKY(P)$) consists of the \"best\" points with respect to minimization or maximization of the attribute values. A point $p$ dominates another point $q$ if $p$ is as good as $q$ in all dimensions and it is strictly better than $q$ in at least one dimension. In this work, we focus on the static $2$-d space and provide expected performance guarantees for $3$-sided Range Skyline Queries on the Grid, where $N$ is the cardinality of $P$, $B$ the size of a disk block, and $R$ the capacity of main memory. We present the MLR-tree, which offers optimal expected cost for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.03949","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":"1709.03949","created_at":"2026-05-18T00:35:28.943737+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.03949v1","created_at":"2026-05-18T00:35:28.943737+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.03949","created_at":"2026-05-18T00:35:28.943737+00:00"},{"alias_kind":"pith_short_12","alias_value":"DSMRJAHQX6N2","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"DSMRJAHQX6N2XBM3","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"DSMRJAHQ","created_at":"2026-05-18T12:31:12.930513+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/DSMRJAHQX6N2XBM3TBAKLYH63O","json":"https://pith.science/pith/DSMRJAHQX6N2XBM3TBAKLYH63O.json","graph_json":"https://pith.science/api/pith-number/DSMRJAHQX6N2XBM3TBAKLYH63O/graph.json","events_json":"https://pith.science/api/pith-number/DSMRJAHQX6N2XBM3TBAKLYH63O/events.json","paper":"https://pith.science/paper/DSMRJAHQ"},"agent_actions":{"view_html":"https://pith.science/pith/DSMRJAHQX6N2XBM3TBAKLYH63O","download_json":"https://pith.science/pith/DSMRJAHQX6N2XBM3TBAKLYH63O.json","view_paper":"https://pith.science/paper/DSMRJAHQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.03949&json=true","fetch_graph":"https://pith.science/api/pith-number/DSMRJAHQX6N2XBM3TBAKLYH63O/graph.json","fetch_events":"https://pith.science/api/pith-number/DSMRJAHQX6N2XBM3TBAKLYH63O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DSMRJAHQX6N2XBM3TBAKLYH63O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DSMRJAHQX6N2XBM3TBAKLYH63O/action/storage_attestation","attest_author":"https://pith.science/pith/DSMRJAHQX6N2XBM3TBAKLYH63O/action/author_attestation","sign_citation":"https://pith.science/pith/DSMRJAHQX6N2XBM3TBAKLYH63O/action/citation_signature","submit_replication":"https://pith.science/pith/DSMRJAHQX6N2XBM3TBAKLYH63O/action/replication_record"}},"created_at":"2026-05-18T00:35:28.943737+00:00","updated_at":"2026-05-18T00:35:28.943737+00:00"}