{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:4KQUKOIT4LIU7JVHR3FT2OLF4F","short_pith_number":"pith:4KQUKOIT","schema_version":"1.0","canonical_sha256":"e2a1453913e2d14fa6a78ecb3d3965e156ef1059ee0d0c852341d8845623fdec","source":{"kind":"arxiv","id":"1304.7959","version":2},"attestation_state":"computed","paper":{"title":"Optimal Planar Orthogonal Skyline Counting Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gerth St{\\o}lting Brodal, Kasper Green Larsen","submitted_at":"2013-04-30T11:43:28Z","abstract_excerpt":"The skyline of a set of points in the plane is the subset of maximal points, where a point $(x,y)$ is maximal if no other point $(x',y')$ satisfies $x'\\ge x$ and $y'\\ge Y$. We consider the problem of preprocessing a set $P$ of $n$ points into a space efficient static data structure supporting orthogonal skyline counting queries, i.e. given a query rectangle $R$ to report the size of the skyline of $P$ intersected with $R$. We present a data structure for storing n points with integer coordinates having query time $O(\\lg n/\\lg\\lg n)$ and space usage $O(n)$. The model of computation is a unit co"},"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":"1304.7959","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-30T11:43:28Z","cross_cats_sorted":[],"title_canon_sha256":"f487d4c6f85919991748ae0b2a1af9d35ea92b2f77f8e8e618345f6c69ec9adf","abstract_canon_sha256":"4b792f91a88de6743c4221ccd0adb27ffbdc72c6e252a568f3b6e75243c2f402"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:17.574702Z","signature_b64":"+hBmDKiPphOwNzrc2Su6CaygibGZDOOowR65oSdKcSlRxn9ULZnKc/X1eJmg8imDfEZnHYxZ8H3nYYkeLyirDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2a1453913e2d14fa6a78ecb3d3965e156ef1059ee0d0c852341d8845623fdec","last_reissued_at":"2026-05-18T02:53:17.574046Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:17.574046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Planar Orthogonal Skyline Counting Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gerth St{\\o}lting Brodal, Kasper Green Larsen","submitted_at":"2013-04-30T11:43:28Z","abstract_excerpt":"The skyline of a set of points in the plane is the subset of maximal points, where a point $(x,y)$ is maximal if no other point $(x',y')$ satisfies $x'\\ge x$ and $y'\\ge Y$. We consider the problem of preprocessing a set $P$ of $n$ points into a space efficient static data structure supporting orthogonal skyline counting queries, i.e. given a query rectangle $R$ to report the size of the skyline of $P$ intersected with $R$. We present a data structure for storing n points with integer coordinates having query time $O(\\lg n/\\lg\\lg n)$ and space usage $O(n)$. The model of computation is a unit co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7959","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":"1304.7959","created_at":"2026-05-18T02:53:17.574160+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.7959v2","created_at":"2026-05-18T02:53:17.574160+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7959","created_at":"2026-05-18T02:53:17.574160+00:00"},{"alias_kind":"pith_short_12","alias_value":"4KQUKOIT4LIU","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"4KQUKOIT4LIU7JVH","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"4KQUKOIT","created_at":"2026-05-18T12:27:34.582898+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/4KQUKOIT4LIU7JVHR3FT2OLF4F","json":"https://pith.science/pith/4KQUKOIT4LIU7JVHR3FT2OLF4F.json","graph_json":"https://pith.science/api/pith-number/4KQUKOIT4LIU7JVHR3FT2OLF4F/graph.json","events_json":"https://pith.science/api/pith-number/4KQUKOIT4LIU7JVHR3FT2OLF4F/events.json","paper":"https://pith.science/paper/4KQUKOIT"},"agent_actions":{"view_html":"https://pith.science/pith/4KQUKOIT4LIU7JVHR3FT2OLF4F","download_json":"https://pith.science/pith/4KQUKOIT4LIU7JVHR3FT2OLF4F.json","view_paper":"https://pith.science/paper/4KQUKOIT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.7959&json=true","fetch_graph":"https://pith.science/api/pith-number/4KQUKOIT4LIU7JVHR3FT2OLF4F/graph.json","fetch_events":"https://pith.science/api/pith-number/4KQUKOIT4LIU7JVHR3FT2OLF4F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4KQUKOIT4LIU7JVHR3FT2OLF4F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4KQUKOIT4LIU7JVHR3FT2OLF4F/action/storage_attestation","attest_author":"https://pith.science/pith/4KQUKOIT4LIU7JVHR3FT2OLF4F/action/author_attestation","sign_citation":"https://pith.science/pith/4KQUKOIT4LIU7JVHR3FT2OLF4F/action/citation_signature","submit_replication":"https://pith.science/pith/4KQUKOIT4LIU7JVHR3FT2OLF4F/action/replication_record"}},"created_at":"2026-05-18T02:53:17.574160+00:00","updated_at":"2026-05-18T02:53:17.574160+00:00"}