{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:PT4LELEGRE6VUTTCFCOT3CXKUK","short_pith_number":"pith:PT4LELEG","canonical_record":{"source":{"id":"1311.4394","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-18T14:29:58Z","cross_cats_sorted":[],"title_canon_sha256":"3de072134c5510dee44b4bfc8c162247dda26a9df1e018e0bec838c8fe4a8af8","abstract_canon_sha256":"075ed3d571c1a81a8d929fa1ce86d559b8ba6da452811d3b3885d9260d29330a"},"schema_version":"1.0"},"canonical_sha256":"7cf8b22c86893d5a4e62289d3d8aeaa2be3f6e036567515926bd1de83f59c94d","source":{"kind":"arxiv","id":"1311.4394","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.4394","created_at":"2026-05-18T03:06:52Z"},{"alias_kind":"arxiv_version","alias_value":"1311.4394v1","created_at":"2026-05-18T03:06:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4394","created_at":"2026-05-18T03:06:52Z"},{"alias_kind":"pith_short_12","alias_value":"PT4LELEGRE6V","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"PT4LELEGRE6VUTTC","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"PT4LELEG","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:PT4LELEGRE6VUTTCFCOT3CXKUK","target":"record","payload":{"canonical_record":{"source":{"id":"1311.4394","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-18T14:29:58Z","cross_cats_sorted":[],"title_canon_sha256":"3de072134c5510dee44b4bfc8c162247dda26a9df1e018e0bec838c8fe4a8af8","abstract_canon_sha256":"075ed3d571c1a81a8d929fa1ce86d559b8ba6da452811d3b3885d9260d29330a"},"schema_version":"1.0"},"canonical_sha256":"7cf8b22c86893d5a4e62289d3d8aeaa2be3f6e036567515926bd1de83f59c94d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:52.836855Z","signature_b64":"j0PnODS2SgnoERVFFkyW4gcIW4G6FpksfR2hswwnMpB/yHnvJrirpzfPOzhe+lahE4mp79IqcclH/SAFtORsDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7cf8b22c86893d5a4e62289d3d8aeaa2be3f6e036567515926bd1de83f59c94d","last_reissued_at":"2026-05-18T03:06:52.836228Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:52.836228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.4394","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:06:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8K5jYkrXg5rwFr4SZGFZUymTvo1qQ5lK1xNh7Oo4Q5tp1dZ/xAmsU0xrNzri1SChWzzKxn/u0nls5c9I9Y/sBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T02:58:57.154072Z"},"content_sha256":"6a3585e8e20407fadbd6d4ccaa325e14bc68fb1ae675de6efbab48d51886018d","schema_version":"1.0","event_id":"sha256:6a3585e8e20407fadbd6d4ccaa325e14bc68fb1ae675de6efbab48d51886018d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:PT4LELEGRE6VUTTCFCOT3CXKUK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Encoding Range Minimum Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gonzalo Navarro, Pooya Davoodi, Rajeev Raman, S. Srinivasa Rao","submitted_at":"2013-11-18T14:29:58Z","abstract_excerpt":"We consider the problem of encoding range minimum queries (RMQs): given an array A[1..n] of distinct totally ordered values, to pre-process A and create a data structure that can answer the query RMQ(i,j), which returns the index containing the smallest element in A[i..j], without access to the array A at query time. We give a data structure whose space usage is 2n + o(n) bits, which is asymptotically optimal for worst-case data, and answers RMQs in O(1) worst-case time. This matches the previous result of Fischer and Heun [SICOMP, 2011], but is obtained in a more natural way. Furthermore, our"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4394","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:06:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hGlAgBpDWwbUBKdEglI5RLp+fD37so+6eJOR3FqRq8TaM5usyoIYlH0NQldp9EJwtahL7uOBBsCWyd8PDwCyDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T02:58:57.154752Z"},"content_sha256":"2845ad4c3b0ac8b6da6771937ca1031e4806d8378cb25f868bc1c58523df0e0f","schema_version":"1.0","event_id":"sha256:2845ad4c3b0ac8b6da6771937ca1031e4806d8378cb25f868bc1c58523df0e0f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PT4LELEGRE6VUTTCFCOT3CXKUK/bundle.json","state_url":"https://pith.science/pith/PT4LELEGRE6VUTTCFCOT3CXKUK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PT4LELEGRE6VUTTCFCOT3CXKUK/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-23T02:58:57Z","links":{"resolver":"https://pith.science/pith/PT4LELEGRE6VUTTCFCOT3CXKUK","bundle":"https://pith.science/pith/PT4LELEGRE6VUTTCFCOT3CXKUK/bundle.json","state":"https://pith.science/pith/PT4LELEGRE6VUTTCFCOT3CXKUK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PT4LELEGRE6VUTTCFCOT3CXKUK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:PT4LELEGRE6VUTTCFCOT3CXKUK","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":"075ed3d571c1a81a8d929fa1ce86d559b8ba6da452811d3b3885d9260d29330a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-18T14:29:58Z","title_canon_sha256":"3de072134c5510dee44b4bfc8c162247dda26a9df1e018e0bec838c8fe4a8af8"},"schema_version":"1.0","source":{"id":"1311.4394","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.4394","created_at":"2026-05-18T03:06:52Z"},{"alias_kind":"arxiv_version","alias_value":"1311.4394v1","created_at":"2026-05-18T03:06:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4394","created_at":"2026-05-18T03:06:52Z"},{"alias_kind":"pith_short_12","alias_value":"PT4LELEGRE6V","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"PT4LELEGRE6VUTTC","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"PT4LELEG","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:2845ad4c3b0ac8b6da6771937ca1031e4806d8378cb25f868bc1c58523df0e0f","target":"graph","created_at":"2026-05-18T03:06:52Z","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 encoding range minimum queries (RMQs): given an array A[1..n] of distinct totally ordered values, to pre-process A and create a data structure that can answer the query RMQ(i,j), which returns the index containing the smallest element in A[i..j], without access to the array A at query time. We give a data structure whose space usage is 2n + o(n) bits, which is asymptotically optimal for worst-case data, and answers RMQs in O(1) worst-case time. This matches the previous result of Fischer and Heun [SICOMP, 2011], but is obtained in a more natural way. Furthermore, our","authors_text":"Gonzalo Navarro, Pooya Davoodi, Rajeev Raman, S. Srinivasa Rao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-18T14:29:58Z","title":"Encoding Range Minimum Queries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4394","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:6a3585e8e20407fadbd6d4ccaa325e14bc68fb1ae675de6efbab48d51886018d","target":"record","created_at":"2026-05-18T03:06:52Z","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":"075ed3d571c1a81a8d929fa1ce86d559b8ba6da452811d3b3885d9260d29330a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-18T14:29:58Z","title_canon_sha256":"3de072134c5510dee44b4bfc8c162247dda26a9df1e018e0bec838c8fe4a8af8"},"schema_version":"1.0","source":{"id":"1311.4394","kind":"arxiv","version":1}},"canonical_sha256":"7cf8b22c86893d5a4e62289d3d8aeaa2be3f6e036567515926bd1de83f59c94d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7cf8b22c86893d5a4e62289d3d8aeaa2be3f6e036567515926bd1de83f59c94d","first_computed_at":"2026-05-18T03:06:52.836228Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:06:52.836228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j0PnODS2SgnoERVFFkyW4gcIW4G6FpksfR2hswwnMpB/yHnvJrirpzfPOzhe+lahE4mp79IqcclH/SAFtORsDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:06:52.836855Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.4394","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a3585e8e20407fadbd6d4ccaa325e14bc68fb1ae675de6efbab48d51886018d","sha256:2845ad4c3b0ac8b6da6771937ca1031e4806d8378cb25f868bc1c58523df0e0f"],"state_sha256":"783bbf05df9eb7af1944c25d4161a849b47b02d3835bc2a1a7bfd70c819f9b3a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qEOF1FxR4rlZdMyRgEOeCR5nZ6LuBTMaUB24OgNAdjahYUG8Yu67zg2D448YtnPhoQEp7HVcgEhugz5vd/LOAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T02:58:57.157930Z","bundle_sha256":"1a60d26b32052ea18d425c8678eee1ba0b35a231fad1f478ca21eaa4cda91bf6"}}