{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:BUM4X3D3VXEOSCHABWS67OY2NX","short_pith_number":"pith:BUM4X3D3","schema_version":"1.0","canonical_sha256":"0d19cbec7badc8e908e00da5efbb1a6dcd22b7460857bfa6293cb9b4fd2b885e","source":{"kind":"arxiv","id":"1305.2835","version":1},"attestation_state":"computed","paper":{"title":"Dynamic Top-$k$ Dominating Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Andreas Kosmatopoulos, Kostas Tsichlas","submitted_at":"2013-05-13T16:30:11Z","abstract_excerpt":"Let $\\mathcal{S}$ be a dataset of $n$ 2-dimensional points. The top-$k$ dominating query aims to report the $k$ points that dominate the most points in $\\mathcal{S}$. A point $p$ dominates a point $q$ iff all coordinates of $p$ are smaller than or equal to those of $q$ and at least one of them is strictly smaller. The top-$k$ dominating query combines the dominance concept of maxima queries with the ranking function of top-$k$ queries and can be used as an important tool in multi-criteria decision making systems. In this work, we propose novel algorithms for answering semi-dynamic (insertions "},"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":"1305.2835","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-05-13T16:30:11Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"eb56536c603efba551f230698601b5c71f8e960996f2b65c065948c96e8d67ce","abstract_canon_sha256":"e2db3d981ba333b198ce44e6a042155e9cc079a94770ebb5d1d05a0baa404474"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:47.112664Z","signature_b64":"QWijLJLso0KLjbxISZ5noGH9DGO4Wp6CvXLqJZd7Dx3X6Vwb/qFbUEm+HjnLjqqg2P9aGpwh+V6Zg9gf2TCIDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d19cbec7badc8e908e00da5efbb1a6dcd22b7460857bfa6293cb9b4fd2b885e","last_reissued_at":"2026-05-18T03:25:47.111970Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:47.111970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Top-$k$ Dominating Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Andreas Kosmatopoulos, Kostas Tsichlas","submitted_at":"2013-05-13T16:30:11Z","abstract_excerpt":"Let $\\mathcal{S}$ be a dataset of $n$ 2-dimensional points. The top-$k$ dominating query aims to report the $k$ points that dominate the most points in $\\mathcal{S}$. A point $p$ dominates a point $q$ iff all coordinates of $p$ are smaller than or equal to those of $q$ and at least one of them is strictly smaller. The top-$k$ dominating query combines the dominance concept of maxima queries with the ranking function of top-$k$ queries and can be used as an important tool in multi-criteria decision making systems. In this work, we propose novel algorithms for answering semi-dynamic (insertions "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.2835","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":"1305.2835","created_at":"2026-05-18T03:25:47.112093+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.2835v1","created_at":"2026-05-18T03:25:47.112093+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.2835","created_at":"2026-05-18T03:25:47.112093+00:00"},{"alias_kind":"pith_short_12","alias_value":"BUM4X3D3VXEO","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"BUM4X3D3VXEOSCHA","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"BUM4X3D3","created_at":"2026-05-18T12:27:40.988391+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/BUM4X3D3VXEOSCHABWS67OY2NX","json":"https://pith.science/pith/BUM4X3D3VXEOSCHABWS67OY2NX.json","graph_json":"https://pith.science/api/pith-number/BUM4X3D3VXEOSCHABWS67OY2NX/graph.json","events_json":"https://pith.science/api/pith-number/BUM4X3D3VXEOSCHABWS67OY2NX/events.json","paper":"https://pith.science/paper/BUM4X3D3"},"agent_actions":{"view_html":"https://pith.science/pith/BUM4X3D3VXEOSCHABWS67OY2NX","download_json":"https://pith.science/pith/BUM4X3D3VXEOSCHABWS67OY2NX.json","view_paper":"https://pith.science/paper/BUM4X3D3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.2835&json=true","fetch_graph":"https://pith.science/api/pith-number/BUM4X3D3VXEOSCHABWS67OY2NX/graph.json","fetch_events":"https://pith.science/api/pith-number/BUM4X3D3VXEOSCHABWS67OY2NX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BUM4X3D3VXEOSCHABWS67OY2NX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BUM4X3D3VXEOSCHABWS67OY2NX/action/storage_attestation","attest_author":"https://pith.science/pith/BUM4X3D3VXEOSCHABWS67OY2NX/action/author_attestation","sign_citation":"https://pith.science/pith/BUM4X3D3VXEOSCHABWS67OY2NX/action/citation_signature","submit_replication":"https://pith.science/pith/BUM4X3D3VXEOSCHABWS67OY2NX/action/replication_record"}},"created_at":"2026-05-18T03:25:47.112093+00:00","updated_at":"2026-05-18T03:25:47.112093+00:00"}