{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QHV3NLJOLHCX6L7S2PEIRAXTKI","short_pith_number":"pith:QHV3NLJO","canonical_record":{"source":{"id":"1705.04589","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-12T14:27:28Z","cross_cats_sorted":[],"title_canon_sha256":"f10387c3858bb67b60406a068c3577a115343d4474a7321338018778949be918","abstract_canon_sha256":"60184a2b11ee3562887d4e96742e1d532adff86bcbf5d6134f830b267caf0846"},"schema_version":"1.0"},"canonical_sha256":"81ebb6ad2e59c57f2ff2d3c88882f3522be5459546d62d5257f62703d8748254","source":{"kind":"arxiv","id":"1705.04589","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.04589","created_at":"2026-05-18T00:44:37Z"},{"alias_kind":"arxiv_version","alias_value":"1705.04589v1","created_at":"2026-05-18T00:44:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.04589","created_at":"2026-05-18T00:44:37Z"},{"alias_kind":"pith_short_12","alias_value":"QHV3NLJOLHCX","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QHV3NLJOLHCX6L7S","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QHV3NLJO","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QHV3NLJOLHCX6L7S2PEIRAXTKI","target":"record","payload":{"canonical_record":{"source":{"id":"1705.04589","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-12T14:27:28Z","cross_cats_sorted":[],"title_canon_sha256":"f10387c3858bb67b60406a068c3577a115343d4474a7321338018778949be918","abstract_canon_sha256":"60184a2b11ee3562887d4e96742e1d532adff86bcbf5d6134f830b267caf0846"},"schema_version":"1.0"},"canonical_sha256":"81ebb6ad2e59c57f2ff2d3c88882f3522be5459546d62d5257f62703d8748254","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:37.715178Z","signature_b64":"Bofw1sS6+ZUJn0mChRDJOKDsy23pgGnzBSsuAKuSGkgmNMgYQoaALwqdavGCtxiiBFRLVOWoJlM7TbhMnaz0Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81ebb6ad2e59c57f2ff2d3c88882f3522be5459546d62d5257f62703d8748254","last_reissued_at":"2026-05-18T00:44:37.714761Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:37.714761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.04589","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-18T00:44:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oaqA31Fnnuhb4w9saPv7m6ebGZKVl7IG/UkO0D9nJOLuPav+0/6PRUJX5aLnTt73sbPrguLTjto29FgEe66XAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T05:45:30.090003Z"},"content_sha256":"fe04a612cd414d051722f5f417ed56211462cd59467d33424d406efee65cd63b","schema_version":"1.0","event_id":"sha256:fe04a612cd414d051722f5f417ed56211462cd59467d33424d406efee65cd63b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QHV3NLJOLHCX6L7S2PEIRAXTKI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How to answer a small batch of RMQs or LCA queries in practice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Costas S. Iliopoulos, Mai Alzamel, Panagiotis Charalampopoulos, Solon P. Pissis","submitted_at":"2017-05-12T14:27:28Z","abstract_excerpt":"In the Range Minimum Query (RMQ) problem, we are given an array $A$ of $n$ numbers and we are asked to answer queries of the following type: for indices $i$ and $j$ between $0$ and $n-1$, query $\\text{RMQ}_A(i,j)$ returns the index of a minimum element in the subarray $A[i..j]$. Answering a small batch of RMQs is a core computational task in many real-world applications, in particular due to the connection with the Lowest Common Ancestor (LCA) problem. With small batch, we mean that the number $q$ of queries is $o(n)$ and we have them all at hand. It is therefore not relevant to build an $\\Ome"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.04589","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-18T00:44:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pXx0YH4wI1pgXwH6ofq0+HKR9LGevTtT1n8hSkSxWpfM/udpeyaeQZcSBZEB+kup7yQE0AsVw7mbdTA4Y8atCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T05:45:30.090351Z"},"content_sha256":"874fcc097dc1b03505fa4986e862fe647f2f4765c27fcba4757d3c7866ad1e45","schema_version":"1.0","event_id":"sha256:874fcc097dc1b03505fa4986e862fe647f2f4765c27fcba4757d3c7866ad1e45"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QHV3NLJOLHCX6L7S2PEIRAXTKI/bundle.json","state_url":"https://pith.science/pith/QHV3NLJOLHCX6L7S2PEIRAXTKI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QHV3NLJOLHCX6L7S2PEIRAXTKI/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-24T05:45:30Z","links":{"resolver":"https://pith.science/pith/QHV3NLJOLHCX6L7S2PEIRAXTKI","bundle":"https://pith.science/pith/QHV3NLJOLHCX6L7S2PEIRAXTKI/bundle.json","state":"https://pith.science/pith/QHV3NLJOLHCX6L7S2PEIRAXTKI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QHV3NLJOLHCX6L7S2PEIRAXTKI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QHV3NLJOLHCX6L7S2PEIRAXTKI","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":"60184a2b11ee3562887d4e96742e1d532adff86bcbf5d6134f830b267caf0846","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-12T14:27:28Z","title_canon_sha256":"f10387c3858bb67b60406a068c3577a115343d4474a7321338018778949be918"},"schema_version":"1.0","source":{"id":"1705.04589","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.04589","created_at":"2026-05-18T00:44:37Z"},{"alias_kind":"arxiv_version","alias_value":"1705.04589v1","created_at":"2026-05-18T00:44:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.04589","created_at":"2026-05-18T00:44:37Z"},{"alias_kind":"pith_short_12","alias_value":"QHV3NLJOLHCX","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QHV3NLJOLHCX6L7S","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QHV3NLJO","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:874fcc097dc1b03505fa4986e862fe647f2f4765c27fcba4757d3c7866ad1e45","target":"graph","created_at":"2026-05-18T00:44:37Z","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":"In the Range Minimum Query (RMQ) problem, we are given an array $A$ of $n$ numbers and we are asked to answer queries of the following type: for indices $i$ and $j$ between $0$ and $n-1$, query $\\text{RMQ}_A(i,j)$ returns the index of a minimum element in the subarray $A[i..j]$. Answering a small batch of RMQs is a core computational task in many real-world applications, in particular due to the connection with the Lowest Common Ancestor (LCA) problem. With small batch, we mean that the number $q$ of queries is $o(n)$ and we have them all at hand. It is therefore not relevant to build an $\\Ome","authors_text":"Costas S. Iliopoulos, Mai Alzamel, Panagiotis Charalampopoulos, Solon P. Pissis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-12T14:27:28Z","title":"How to answer a small batch of RMQs or LCA queries in practice"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.04589","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:fe04a612cd414d051722f5f417ed56211462cd59467d33424d406efee65cd63b","target":"record","created_at":"2026-05-18T00:44:37Z","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":"60184a2b11ee3562887d4e96742e1d532adff86bcbf5d6134f830b267caf0846","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-12T14:27:28Z","title_canon_sha256":"f10387c3858bb67b60406a068c3577a115343d4474a7321338018778949be918"},"schema_version":"1.0","source":{"id":"1705.04589","kind":"arxiv","version":1}},"canonical_sha256":"81ebb6ad2e59c57f2ff2d3c88882f3522be5459546d62d5257f62703d8748254","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"81ebb6ad2e59c57f2ff2d3c88882f3522be5459546d62d5257f62703d8748254","first_computed_at":"2026-05-18T00:44:37.714761Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:37.714761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Bofw1sS6+ZUJn0mChRDJOKDsy23pgGnzBSsuAKuSGkgmNMgYQoaALwqdavGCtxiiBFRLVOWoJlM7TbhMnaz0Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:37.715178Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.04589","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe04a612cd414d051722f5f417ed56211462cd59467d33424d406efee65cd63b","sha256:874fcc097dc1b03505fa4986e862fe647f2f4765c27fcba4757d3c7866ad1e45"],"state_sha256":"3da4121e48194a948b1b3430f1c06d29e2e00f7abb79cc2098b2c91c96f0ac51"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZKzcnKymg0lDXVzGIalqPEhdHTfFAcIUMFwtQD5TNCPg3PUnJ/FunbV1ukpj5SlKV0br6h+DU9WDkaeie9d2AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T05:45:30.092227Z","bundle_sha256":"4e973f3dc48d17f549d84130491811b56d1c393795fea044b7b351e7a89a1fcb"}}