{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QHV3NLJOLHCX6L7S2PEIRAXTKI","short_pith_number":"pith:QHV3NLJO","schema_version":"1.0","canonical_sha256":"81ebb6ad2e59c57f2ff2d3c88882f3522be5459546d62d5257f62703d8748254","source":{"kind":"arxiv","id":"1705.04589","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.04589","created_at":"2026-05-18T00:44:37.714835+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.04589v1","created_at":"2026-05-18T00:44:37.714835+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.04589","created_at":"2026-05-18T00:44:37.714835+00:00"},{"alias_kind":"pith_short_12","alias_value":"QHV3NLJOLHCX","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"QHV3NLJOLHCX6L7S","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"QHV3NLJO","created_at":"2026-05-18T12:31:39.905425+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QHV3NLJOLHCX6L7S2PEIRAXTKI","json":"https://pith.science/pith/QHV3NLJOLHCX6L7S2PEIRAXTKI.json","graph_json":"https://pith.science/api/pith-number/QHV3NLJOLHCX6L7S2PEIRAXTKI/graph.json","events_json":"https://pith.science/api/pith-number/QHV3NLJOLHCX6L7S2PEIRAXTKI/events.json","paper":"https://pith.science/paper/QHV3NLJO"},"agent_actions":{"view_html":"https://pith.science/pith/QHV3NLJOLHCX6L7S2PEIRAXTKI","download_json":"https://pith.science/pith/QHV3NLJOLHCX6L7S2PEIRAXTKI.json","view_paper":"https://pith.science/paper/QHV3NLJO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.04589&json=true","fetch_graph":"https://pith.science/api/pith-number/QHV3NLJOLHCX6L7S2PEIRAXTKI/graph.json","fetch_events":"https://pith.science/api/pith-number/QHV3NLJOLHCX6L7S2PEIRAXTKI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QHV3NLJOLHCX6L7S2PEIRAXTKI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QHV3NLJOLHCX6L7S2PEIRAXTKI/action/storage_attestation","attest_author":"https://pith.science/pith/QHV3NLJOLHCX6L7S2PEIRAXTKI/action/author_attestation","sign_citation":"https://pith.science/pith/QHV3NLJOLHCX6L7S2PEIRAXTKI/action/citation_signature","submit_replication":"https://pith.science/pith/QHV3NLJOLHCX6L7S2PEIRAXTKI/action/replication_record"}},"created_at":"2026-05-18T00:44:37.714835+00:00","updated_at":"2026-05-18T00:44:37.714835+00:00"}