{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:TNJDA7J3A3AZHBDWKQQKWY77XJ","short_pith_number":"pith:TNJDA7J3","canonical_record":{"source":{"id":"1411.6581","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-24T19:27:44Z","cross_cats_sorted":[],"title_canon_sha256":"a672eb54a71ee9f20a2a4929190ea57a18fff27bf84a2f63a70c446b8bd28b0d","abstract_canon_sha256":"2dd76041f6fa2359f91960449b23f8138117e0d92ad0934f2738a397227fc79c"},"schema_version":"1.0"},"canonical_sha256":"9b52307d3b06c19384765420ab63ffba42a337de8cb572df9d306983067350d7","source":{"kind":"arxiv","id":"1411.6581","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.6581","created_at":"2026-05-18T01:49:31Z"},{"alias_kind":"arxiv_version","alias_value":"1411.6581v2","created_at":"2026-05-18T01:49:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6581","created_at":"2026-05-18T01:49:31Z"},{"alias_kind":"pith_short_12","alias_value":"TNJDA7J3A3AZ","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TNJDA7J3A3AZHBDW","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TNJDA7J3","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:TNJDA7J3A3AZHBDWKQQKWY77XJ","target":"record","payload":{"canonical_record":{"source":{"id":"1411.6581","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-24T19:27:44Z","cross_cats_sorted":[],"title_canon_sha256":"a672eb54a71ee9f20a2a4929190ea57a18fff27bf84a2f63a70c446b8bd28b0d","abstract_canon_sha256":"2dd76041f6fa2359f91960449b23f8138117e0d92ad0934f2738a397227fc79c"},"schema_version":"1.0"},"canonical_sha256":"9b52307d3b06c19384765420ab63ffba42a337de8cb572df9d306983067350d7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:49:31.358404Z","signature_b64":"mjpYa3vmRW3blFXkTe2NN3pUOBn5wcYPxzL8WZTXfuSEsLkIdcndgcuIuqt7qCbRRlSMZZnmZpZp0jt8DU+XDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b52307d3b06c19384765420ab63ffba42a337de8cb572df9d306983067350d7","last_reissued_at":"2026-05-18T01:49:31.357659Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:49:31.357659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.6581","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-18T01:49:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5AIUV8nfZn8F/IKYLdFzLaMQ9PH0qdqOh+8zGjm0NiC/jYj4mm64BSXMylwBu7DUXsT8/VM+gLLEXUJaxk1TCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:09:43.673987Z"},"content_sha256":"223ff21b2fc65534bd90ce369ed2ad8d283e48db1082c5931cf5526892e6791e","schema_version":"1.0","event_id":"sha256:223ff21b2fc65534bd90ce369ed2ad8d283e48db1082c5931cf5526892e6791e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:TNJDA7J3A3AZHBDWKQQKWY77XJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Encodings for Range Top-k, Selection, and Min-Max","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Patrick K. Nicholson, Pawel Gawrychowski","submitted_at":"2014-11-24T19:27:44Z","abstract_excerpt":"We consider encoding problems for range queries on arrays. In these problems the goal is to store a structure capable of recovering the answer to all queries that occupies the information theoretic minimum space possible, to within lower order terms. As input, we are given an array $A[1..n]$, and a fixed parameter $k \\in [1,n]$. A range top-$k$ query on an arbitrary range $[i,j] \\subseteq [1,n]$ asks us to return the ordered set of indices $\\{\\ell_1, ..., \\ell_{k}\\}$ such that $A[\\ell_m]$ is the $m$-th largest element in $A[i..j]$, for $1 \\le m \\le k$. A range selection query for an arbitrary "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6581","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-18T01:49:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G5yMI5e0tPFy4pvW6OUXkUp+k7vcsXV3G0wGcHssKjkeli3QdsvR/33BoMsj56zu6/hchVGZPQFP0fN1QGC3DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:09:43.674339Z"},"content_sha256":"11d934c14785a8e5397a3e25704f2e3629b6ff12e40b4f682ee97497e3ae1177","schema_version":"1.0","event_id":"sha256:11d934c14785a8e5397a3e25704f2e3629b6ff12e40b4f682ee97497e3ae1177"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TNJDA7J3A3AZHBDWKQQKWY77XJ/bundle.json","state_url":"https://pith.science/pith/TNJDA7J3A3AZHBDWKQQKWY77XJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TNJDA7J3A3AZHBDWKQQKWY77XJ/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-02T08:09:43Z","links":{"resolver":"https://pith.science/pith/TNJDA7J3A3AZHBDWKQQKWY77XJ","bundle":"https://pith.science/pith/TNJDA7J3A3AZHBDWKQQKWY77XJ/bundle.json","state":"https://pith.science/pith/TNJDA7J3A3AZHBDWKQQKWY77XJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TNJDA7J3A3AZHBDWKQQKWY77XJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:TNJDA7J3A3AZHBDWKQQKWY77XJ","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":"2dd76041f6fa2359f91960449b23f8138117e0d92ad0934f2738a397227fc79c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-24T19:27:44Z","title_canon_sha256":"a672eb54a71ee9f20a2a4929190ea57a18fff27bf84a2f63a70c446b8bd28b0d"},"schema_version":"1.0","source":{"id":"1411.6581","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.6581","created_at":"2026-05-18T01:49:31Z"},{"alias_kind":"arxiv_version","alias_value":"1411.6581v2","created_at":"2026-05-18T01:49:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6581","created_at":"2026-05-18T01:49:31Z"},{"alias_kind":"pith_short_12","alias_value":"TNJDA7J3A3AZ","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TNJDA7J3A3AZHBDW","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TNJDA7J3","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:11d934c14785a8e5397a3e25704f2e3629b6ff12e40b4f682ee97497e3ae1177","target":"graph","created_at":"2026-05-18T01:49:31Z","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 encoding problems for range queries on arrays. In these problems the goal is to store a structure capable of recovering the answer to all queries that occupies the information theoretic minimum space possible, to within lower order terms. As input, we are given an array $A[1..n]$, and a fixed parameter $k \\in [1,n]$. A range top-$k$ query on an arbitrary range $[i,j] \\subseteq [1,n]$ asks us to return the ordered set of indices $\\{\\ell_1, ..., \\ell_{k}\\}$ such that $A[\\ell_m]$ is the $m$-th largest element in $A[i..j]$, for $1 \\le m \\le k$. A range selection query for an arbitrary ","authors_text":"Patrick K. Nicholson, Pawel Gawrychowski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-24T19:27:44Z","title":"Optimal Encodings for Range Top-k, Selection, and Min-Max"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6581","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:223ff21b2fc65534bd90ce369ed2ad8d283e48db1082c5931cf5526892e6791e","target":"record","created_at":"2026-05-18T01:49:31Z","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":"2dd76041f6fa2359f91960449b23f8138117e0d92ad0934f2738a397227fc79c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-24T19:27:44Z","title_canon_sha256":"a672eb54a71ee9f20a2a4929190ea57a18fff27bf84a2f63a70c446b8bd28b0d"},"schema_version":"1.0","source":{"id":"1411.6581","kind":"arxiv","version":2}},"canonical_sha256":"9b52307d3b06c19384765420ab63ffba42a337de8cb572df9d306983067350d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b52307d3b06c19384765420ab63ffba42a337de8cb572df9d306983067350d7","first_computed_at":"2026-05-18T01:49:31.357659Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:49:31.357659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mjpYa3vmRW3blFXkTe2NN3pUOBn5wcYPxzL8WZTXfuSEsLkIdcndgcuIuqt7qCbRRlSMZZnmZpZp0jt8DU+XDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:49:31.358404Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.6581","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:223ff21b2fc65534bd90ce369ed2ad8d283e48db1082c5931cf5526892e6791e","sha256:11d934c14785a8e5397a3e25704f2e3629b6ff12e40b4f682ee97497e3ae1177"],"state_sha256":"ddd228790149a8eef0b6bf2294d276646515ab25e355735d482b990e54ad9de3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0uJSMQKRgzk2f4WSv0qnYHEuOdyP1oKIJY8NRufm+p6V8qnuEpNfqp4B1oICSc2ctB/SGE3SA7wUfvF7AdvvBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T08:09:43.676121Z","bundle_sha256":"c516d63c3abddee0927f507d5e057bca48b3e6275f02351f57978a6e0493592b"}}