{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:O5Y7SK2U6FWOZFVJBZYOHVBXON","short_pith_number":"pith:O5Y7SK2U","schema_version":"1.0","canonical_sha256":"7771f92b54f16cec96a90e70e3d437735844f964bc56ff2d69df2bb19d4b6cbe","source":{"kind":"arxiv","id":"1207.2341","version":1},"attestation_state":"computed","paper":{"title":"I/O-Efficient Dynamic Planar Range Skyline Queries","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Casper Kejlberg-Rasmussen, Konstantinos Tsakalidis, Kostas Tsichlas","submitted_at":"2012-07-10T13:32:12Z","abstract_excerpt":"We present the first fully dynamic worst case I/O-efficient data structures that support planar orthogonal \\textit{3-sided range skyline reporting queries} in $\\bigO (\\log_{2B^\\epsilon} n + \\frac{t}{B^{1-\\epsilon}})$ I/Os and updates in $\\bigO (\\log_{2B^\\epsilon} n)$ I/Os, using $\\bigO (\\frac{n}{B^{1-\\epsilon}})$ blocks of space, for $n$ input planar points, $t$ reported points, and parameter $0 \\leq \\epsilon \\leq 1$. We obtain the result by extending Sundar's priority queues with attrition to support the operations \\textsc{DeleteMin} and \\textsc{CatenateAndAttrite} in $\\bigO (1)$ worst case I"},"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":"1207.2341","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2012-07-10T13:32:12Z","cross_cats_sorted":[],"title_canon_sha256":"69a452d8556220ed107f7226c8b21a52e327221eb5f269a4d95f7844eb9f2c39","abstract_canon_sha256":"e88b4b2551db2e01c80ce15bf7c01a32a64229b0b7d45de6fa37a181c822610c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:24.345673Z","signature_b64":"+JOyNHpzygvM6m8sajEBXu0+3g0YxFAX+p2BoTmMKQ8RvMKl1KXpTdueY1DoPwcl4QQMaPLsk5zby3Z+plQSBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7771f92b54f16cec96a90e70e3d437735844f964bc56ff2d69df2bb19d4b6cbe","last_reissued_at":"2026-05-18T03:51:24.345095Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:24.345095Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"I/O-Efficient Dynamic Planar Range Skyline Queries","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Casper Kejlberg-Rasmussen, Konstantinos Tsakalidis, Kostas Tsichlas","submitted_at":"2012-07-10T13:32:12Z","abstract_excerpt":"We present the first fully dynamic worst case I/O-efficient data structures that support planar orthogonal \\textit{3-sided range skyline reporting queries} in $\\bigO (\\log_{2B^\\epsilon} n + \\frac{t}{B^{1-\\epsilon}})$ I/Os and updates in $\\bigO (\\log_{2B^\\epsilon} n)$ I/Os, using $\\bigO (\\frac{n}{B^{1-\\epsilon}})$ blocks of space, for $n$ input planar points, $t$ reported points, and parameter $0 \\leq \\epsilon \\leq 1$. We obtain the result by extending Sundar's priority queues with attrition to support the operations \\textsc{DeleteMin} and \\textsc{CatenateAndAttrite} in $\\bigO (1)$ worst case I"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.2341","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":"1207.2341","created_at":"2026-05-18T03:51:24.345191+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.2341v1","created_at":"2026-05-18T03:51:24.345191+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2341","created_at":"2026-05-18T03:51:24.345191+00:00"},{"alias_kind":"pith_short_12","alias_value":"O5Y7SK2U6FWO","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"O5Y7SK2U6FWOZFVJ","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"O5Y7SK2U","created_at":"2026-05-18T12:27:16.716162+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/O5Y7SK2U6FWOZFVJBZYOHVBXON","json":"https://pith.science/pith/O5Y7SK2U6FWOZFVJBZYOHVBXON.json","graph_json":"https://pith.science/api/pith-number/O5Y7SK2U6FWOZFVJBZYOHVBXON/graph.json","events_json":"https://pith.science/api/pith-number/O5Y7SK2U6FWOZFVJBZYOHVBXON/events.json","paper":"https://pith.science/paper/O5Y7SK2U"},"agent_actions":{"view_html":"https://pith.science/pith/O5Y7SK2U6FWOZFVJBZYOHVBXON","download_json":"https://pith.science/pith/O5Y7SK2U6FWOZFVJBZYOHVBXON.json","view_paper":"https://pith.science/paper/O5Y7SK2U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.2341&json=true","fetch_graph":"https://pith.science/api/pith-number/O5Y7SK2U6FWOZFVJBZYOHVBXON/graph.json","fetch_events":"https://pith.science/api/pith-number/O5Y7SK2U6FWOZFVJBZYOHVBXON/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O5Y7SK2U6FWOZFVJBZYOHVBXON/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O5Y7SK2U6FWOZFVJBZYOHVBXON/action/storage_attestation","attest_author":"https://pith.science/pith/O5Y7SK2U6FWOZFVJBZYOHVBXON/action/author_attestation","sign_citation":"https://pith.science/pith/O5Y7SK2U6FWOZFVJBZYOHVBXON/action/citation_signature","submit_replication":"https://pith.science/pith/O5Y7SK2U6FWOZFVJBZYOHVBXON/action/replication_record"}},"created_at":"2026-05-18T03:51:24.345191+00:00","updated_at":"2026-05-18T03:51:24.345191+00:00"}