{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:4KQUKOIT4LIU7JVHR3FT2OLF4F","short_pith_number":"pith:4KQUKOIT","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"},"canonical_sha256":"e2a1453913e2d14fa6a78ecb3d3965e156ef1059ee0d0c852341d8845623fdec","source":{"kind":"arxiv","id":"1304.7959","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.7959","created_at":"2026-05-18T02:53:17Z"},{"alias_kind":"arxiv_version","alias_value":"1304.7959v2","created_at":"2026-05-18T02:53:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7959","created_at":"2026-05-18T02:53:17Z"},{"alias_kind":"pith_short_12","alias_value":"4KQUKOIT4LIU","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4KQUKOIT4LIU7JVH","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4KQUKOIT","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:4KQUKOIT4LIU7JVHR3FT2OLF4F","target":"record","payload":{"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"},"canonical_sha256":"e2a1453913e2d14fa6a78ecb3d3965e156ef1059ee0d0c852341d8845623fdec","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"},"source_kind":"arxiv","source_id":"1304.7959","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:53:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R4OVN+bAmYbosWZgez2YnGvQur7hfQ4ZTjGu05L/qVejlxeb1JwRxDuY/I9nKvCDxCZhI2NV0Y6f8b17/jELDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T12:56:08.931668Z"},"content_sha256":"d887267647aadaa6004c698c040145fb5032830d4a58d9ed184070040137451d","schema_version":"1.0","event_id":"sha256:d887267647aadaa6004c698c040145fb5032830d4a58d9ed184070040137451d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:4KQUKOIT4LIU7JVHR3FT2OLF4F","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:53:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"57/EganxtZr+iMMg2VBY1I1RSnREkQYXA0fgf1oYmamgtYZIw/xO7P/LPJOHw5jynMQ/M95wzCFwvKEo6TCoBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T12:56:08.932005Z"},"content_sha256":"54a8364253794c72ff4b5b088f09d47c015091018be9b24807d962bb7d7bc9f9","schema_version":"1.0","event_id":"sha256:54a8364253794c72ff4b5b088f09d47c015091018be9b24807d962bb7d7bc9f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4KQUKOIT4LIU7JVHR3FT2OLF4F/bundle.json","state_url":"https://pith.science/pith/4KQUKOIT4LIU7JVHR3FT2OLF4F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4KQUKOIT4LIU7JVHR3FT2OLF4F/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-25T12:56:08Z","links":{"resolver":"https://pith.science/pith/4KQUKOIT4LIU7JVHR3FT2OLF4F","bundle":"https://pith.science/pith/4KQUKOIT4LIU7JVHR3FT2OLF4F/bundle.json","state":"https://pith.science/pith/4KQUKOIT4LIU7JVHR3FT2OLF4F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4KQUKOIT4LIU7JVHR3FT2OLF4F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:4KQUKOIT4LIU7JVHR3FT2OLF4F","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4b792f91a88de6743c4221ccd0adb27ffbdc72c6e252a568f3b6e75243c2f402","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-30T11:43:28Z","title_canon_sha256":"f487d4c6f85919991748ae0b2a1af9d35ea92b2f77f8e8e618345f6c69ec9adf"},"schema_version":"1.0","source":{"id":"1304.7959","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.7959","created_at":"2026-05-18T02:53:17Z"},{"alias_kind":"arxiv_version","alias_value":"1304.7959v2","created_at":"2026-05-18T02:53:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7959","created_at":"2026-05-18T02:53:17Z"},{"alias_kind":"pith_short_12","alias_value":"4KQUKOIT4LIU","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4KQUKOIT4LIU7JVH","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4KQUKOIT","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:54a8364253794c72ff4b5b088f09d47c015091018be9b24807d962bb7d7bc9f9","target":"graph","created_at":"2026-05-18T02:53:17Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Gerth St{\\o}lting Brodal, Kasper Green Larsen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-30T11:43:28Z","title":"Optimal Planar Orthogonal Skyline Counting Queries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7959","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d887267647aadaa6004c698c040145fb5032830d4a58d9ed184070040137451d","target":"record","created_at":"2026-05-18T02:53:17Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4b792f91a88de6743c4221ccd0adb27ffbdc72c6e252a568f3b6e75243c2f402","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-30T11:43:28Z","title_canon_sha256":"f487d4c6f85919991748ae0b2a1af9d35ea92b2f77f8e8e618345f6c69ec9adf"},"schema_version":"1.0","source":{"id":"1304.7959","kind":"arxiv","version":2}},"canonical_sha256":"e2a1453913e2d14fa6a78ecb3d3965e156ef1059ee0d0c852341d8845623fdec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e2a1453913e2d14fa6a78ecb3d3965e156ef1059ee0d0c852341d8845623fdec","first_computed_at":"2026-05-18T02:53:17.574046Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:17.574046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+hBmDKiPphOwNzrc2Su6CaygibGZDOOowR65oSdKcSlRxn9ULZnKc/X1eJmg8imDfEZnHYxZ8H3nYYkeLyirDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:17.574702Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.7959","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d887267647aadaa6004c698c040145fb5032830d4a58d9ed184070040137451d","sha256:54a8364253794c72ff4b5b088f09d47c015091018be9b24807d962bb7d7bc9f9"],"state_sha256":"f81d38b69a2d639083f1c98fdd4d02364387f6cda13ac4a7a24efd2834445230"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M+e7S227W2VKuSAI9a0uXScHaBNSRFCOZB0J9hPknYtCTT/25ZOfr6gsIp4Z0vilsZPS/ViZHEgg3KIZxdYMDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T12:56:08.933906Z","bundle_sha256":"aaaf1ade85aaa5416d0cac2158712705974ed93ddc5d91ebf78ce4c153dad266"}}