{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:IFOZOBQ7XZ6PA6VE2AT7A5I6QX","short_pith_number":"pith:IFOZOBQ7","canonical_record":{"source":{"id":"1204.4835","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-21T19:36:06Z","cross_cats_sorted":[],"title_canon_sha256":"054ecbb7deccea79aaff848610cb5200f7e0055ec7fe31665447b6e49dce196a","abstract_canon_sha256":"121ec148c6baf59b846d670ab9f9e25edb54be9a54e51afeda463307a4246d89"},"schema_version":"1.0"},"canonical_sha256":"415d97061fbe7cf07aa4d027f0751e85d319529af452bb0644b8ac6f681f4fd4","source":{"kind":"arxiv","id":"1204.4835","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.4835","created_at":"2026-05-18T03:57:15Z"},{"alias_kind":"arxiv_version","alias_value":"1204.4835v1","created_at":"2026-05-18T03:57:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4835","created_at":"2026-05-18T03:57:15Z"},{"alias_kind":"pith_short_12","alias_value":"IFOZOBQ7XZ6P","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IFOZOBQ7XZ6PA6VE","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IFOZOBQ7","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:IFOZOBQ7XZ6PA6VE2AT7A5I6QX","target":"record","payload":{"canonical_record":{"source":{"id":"1204.4835","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-21T19:36:06Z","cross_cats_sorted":[],"title_canon_sha256":"054ecbb7deccea79aaff848610cb5200f7e0055ec7fe31665447b6e49dce196a","abstract_canon_sha256":"121ec148c6baf59b846d670ab9f9e25edb54be9a54e51afeda463307a4246d89"},"schema_version":"1.0"},"canonical_sha256":"415d97061fbe7cf07aa4d027f0751e85d319529af452bb0644b8ac6f681f4fd4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:15.288698Z","signature_b64":"//Khij+RFc93cAlK6uMpXoVnXKEhELyfx8MIJi2rP4gNN6X6ml2EqLLcyLbuMKIg6fiXMx8B79vL/65RFdh7Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"415d97061fbe7cf07aa4d027f0751e85d319529af452bb0644b8ac6f681f4fd4","last_reissued_at":"2026-05-18T03:57:15.288233Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:15.288233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.4835","source_version":1,"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-18T03:57:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ecfmB9C1cYfinCemCdPDoK+091vvGvz0isPvks+/IWENFBs43hHxtg9Gga95QZktysTnoF7Jw+uYGzTLN1zcCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:36:47.320761Z"},"content_sha256":"5f6b47803b5aaf9c6c53d0804838b1b2f17ee859cf4e4b1bd258b1687fe2a216","schema_version":"1.0","event_id":"sha256:5f6b47803b5aaf9c6c53d0804838b1b2f17ee859cf4e4b1bd258b1687fe2a216"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:IFOZOBQ7XZ6PA6VE2AT7A5I6QX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Succinct Indices for Range Queries with applications to Orthogonal Range Maxima","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arash Farzan, J. Ian Munro, Rajeev Raman","submitted_at":"2012-04-21T19:36:06Z","abstract_excerpt":"We consider the problem of preprocessing $N$ points in 2D, each endowed with a priority, to answer the following queries: given a axis-parallel rectangle, determine the point with the largest priority in the rectangle. Using the ideas of the \\emph{effective entropy} of range maxima queries and \\emph{succinct indices} for range maxima queries, we obtain a structure that uses O(N) words and answers the above query in $O(\\log N \\log \\log N)$ time. This is a direct improvement of Chazelle's result from FOCS 1985 for this problem -- Chazelle required $O(N/\\epsilon)$ words to answer queries in $O((\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.4835","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"},"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-18T03:57:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bqSd/r6kzgVn7k/8RC2VHf0mmNYEBrt8amni3NJrVQUEWmrAkJvGJEMsbn6NxuCXV2OTiItpxZy4Ass5f74tDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:36:47.321367Z"},"content_sha256":"70f1e5733a60c42ed5a4775feb0b57a7f48d444d22c03e7f8da1a111a92018e8","schema_version":"1.0","event_id":"sha256:70f1e5733a60c42ed5a4775feb0b57a7f48d444d22c03e7f8da1a111a92018e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IFOZOBQ7XZ6PA6VE2AT7A5I6QX/bundle.json","state_url":"https://pith.science/pith/IFOZOBQ7XZ6PA6VE2AT7A5I6QX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IFOZOBQ7XZ6PA6VE2AT7A5I6QX/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-05-28T03:36:47Z","links":{"resolver":"https://pith.science/pith/IFOZOBQ7XZ6PA6VE2AT7A5I6QX","bundle":"https://pith.science/pith/IFOZOBQ7XZ6PA6VE2AT7A5I6QX/bundle.json","state":"https://pith.science/pith/IFOZOBQ7XZ6PA6VE2AT7A5I6QX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IFOZOBQ7XZ6PA6VE2AT7A5I6QX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:IFOZOBQ7XZ6PA6VE2AT7A5I6QX","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":"121ec148c6baf59b846d670ab9f9e25edb54be9a54e51afeda463307a4246d89","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-21T19:36:06Z","title_canon_sha256":"054ecbb7deccea79aaff848610cb5200f7e0055ec7fe31665447b6e49dce196a"},"schema_version":"1.0","source":{"id":"1204.4835","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.4835","created_at":"2026-05-18T03:57:15Z"},{"alias_kind":"arxiv_version","alias_value":"1204.4835v1","created_at":"2026-05-18T03:57:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4835","created_at":"2026-05-18T03:57:15Z"},{"alias_kind":"pith_short_12","alias_value":"IFOZOBQ7XZ6P","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IFOZOBQ7XZ6PA6VE","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IFOZOBQ7","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:70f1e5733a60c42ed5a4775feb0b57a7f48d444d22c03e7f8da1a111a92018e8","target":"graph","created_at":"2026-05-18T03:57:15Z","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":"We consider the problem of preprocessing $N$ points in 2D, each endowed with a priority, to answer the following queries: given a axis-parallel rectangle, determine the point with the largest priority in the rectangle. Using the ideas of the \\emph{effective entropy} of range maxima queries and \\emph{succinct indices} for range maxima queries, we obtain a structure that uses O(N) words and answers the above query in $O(\\log N \\log \\log N)$ time. This is a direct improvement of Chazelle's result from FOCS 1985 for this problem -- Chazelle required $O(N/\\epsilon)$ words to answer queries in $O((\\","authors_text":"Arash Farzan, J. Ian Munro, Rajeev Raman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-21T19:36:06Z","title":"Succinct Indices for Range Queries with applications to Orthogonal Range Maxima"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.4835","kind":"arxiv","version":1},"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:5f6b47803b5aaf9c6c53d0804838b1b2f17ee859cf4e4b1bd258b1687fe2a216","target":"record","created_at":"2026-05-18T03:57:15Z","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":"121ec148c6baf59b846d670ab9f9e25edb54be9a54e51afeda463307a4246d89","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-21T19:36:06Z","title_canon_sha256":"054ecbb7deccea79aaff848610cb5200f7e0055ec7fe31665447b6e49dce196a"},"schema_version":"1.0","source":{"id":"1204.4835","kind":"arxiv","version":1}},"canonical_sha256":"415d97061fbe7cf07aa4d027f0751e85d319529af452bb0644b8ac6f681f4fd4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"415d97061fbe7cf07aa4d027f0751e85d319529af452bb0644b8ac6f681f4fd4","first_computed_at":"2026-05-18T03:57:15.288233Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:57:15.288233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"//Khij+RFc93cAlK6uMpXoVnXKEhELyfx8MIJi2rP4gNN6X6ml2EqLLcyLbuMKIg6fiXMx8B79vL/65RFdh7Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:57:15.288698Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.4835","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f6b47803b5aaf9c6c53d0804838b1b2f17ee859cf4e4b1bd258b1687fe2a216","sha256:70f1e5733a60c42ed5a4775feb0b57a7f48d444d22c03e7f8da1a111a92018e8"],"state_sha256":"a9b94d9e5640890a1beb38865a7462712d0e1a88f71d6968865f4ca458382a57"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cik0eZ0uGWVShp8Yw1uYAPkFFFwvj7ndABPCk0oYVpt4NNYEY4al/iX3ZtqvlNJaPwZT1tPLUSpsyTW48/5MCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T03:36:47.324362Z","bundle_sha256":"000eeada4552a363498644891d4e7a1112417f612b9e6641647d62d987ba569b"}}