{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:UUUF73RQG76RWGMM4BCWMF2OSZ","short_pith_number":"pith:UUUF73RQ","schema_version":"1.0","canonical_sha256":"a5285fee3037fd1b198ce04566174e966336781f8f87a697eb8a89df1f8e646b","source":{"kind":"arxiv","id":"2111.02318","version":2},"attestation_state":"computed","paper":{"title":"Nearly Tight Lower Bounds for Succinct Range Minimum Query","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Mingmou Liu","submitted_at":"2021-11-03T16:11:22Z","abstract_excerpt":"Given an array of distinct integers $A[1\\ldots n]$, the Range Minimum Query (RMQ) problem requires us to construct a data structure from $A$, supporting the RMQ query: given an interval $[a,b]\\subseteq[1,n]$, return the index of the minimum element in subarray $A[a\\ldots b]$, i.e. return $\\text{argmin}_{i\\in[a,b]}A[i]$. The fundamental problem has a long history. The textbook solution which uses $O(n)$ words of space and $O(1)$ time by Gabow, Bentley, Tarjan (STOC 1984) and Harel, Tarjan (SICOMP 1984) dates back to 1980s. The state-of-the-art solution is presented by Fischer, Heun (SICOMP 2011"},"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":"2111.02318","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2021-11-03T16:11:22Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"f5adb46c8cae0beef3fd8dd353adb42a139db94a933d3032a61fc70b3e98d718","abstract_canon_sha256":"dc28cb3810c5ea542e2fedfb3b93963a7efc14b5c4e570f971d1662b44cc9589"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:55:30.969399Z","signature_b64":"+mCtKB2B9mjkN0NQXeSNyRYmwrFwmNm5IDjWMtWtQim+dhw8vyi+pR7lzNrlJOuGOOD4vvqBf1eB0uFfH4SGCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5285fee3037fd1b198ce04566174e966336781f8f87a697eb8a89df1f8e646b","last_reissued_at":"2026-07-05T03:55:30.968884Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:55:30.968884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nearly Tight Lower Bounds for Succinct Range Minimum Query","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Mingmou Liu","submitted_at":"2021-11-03T16:11:22Z","abstract_excerpt":"Given an array of distinct integers $A[1\\ldots n]$, the Range Minimum Query (RMQ) problem requires us to construct a data structure from $A$, supporting the RMQ query: given an interval $[a,b]\\subseteq[1,n]$, return the index of the minimum element in subarray $A[a\\ldots b]$, i.e. return $\\text{argmin}_{i\\in[a,b]}A[i]$. The fundamental problem has a long history. The textbook solution which uses $O(n)$ words of space and $O(1)$ time by Gabow, Bentley, Tarjan (STOC 1984) and Harel, Tarjan (SICOMP 1984) dates back to 1980s. The state-of-the-art solution is presented by Fischer, Heun (SICOMP 2011"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.02318","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2111.02318/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2111.02318","created_at":"2026-07-05T03:55:30.968948+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.02318v2","created_at":"2026-07-05T03:55:30.968948+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.02318","created_at":"2026-07-05T03:55:30.968948+00:00"},{"alias_kind":"pith_short_12","alias_value":"UUUF73RQG76R","created_at":"2026-07-05T03:55:30.968948+00:00"},{"alias_kind":"pith_short_16","alias_value":"UUUF73RQG76RWGMM","created_at":"2026-07-05T03:55:30.968948+00:00"},{"alias_kind":"pith_short_8","alias_value":"UUUF73RQ","created_at":"2026-07-05T03:55:30.968948+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/UUUF73RQG76RWGMM4BCWMF2OSZ","json":"https://pith.science/pith/UUUF73RQG76RWGMM4BCWMF2OSZ.json","graph_json":"https://pith.science/api/pith-number/UUUF73RQG76RWGMM4BCWMF2OSZ/graph.json","events_json":"https://pith.science/api/pith-number/UUUF73RQG76RWGMM4BCWMF2OSZ/events.json","paper":"https://pith.science/paper/UUUF73RQ"},"agent_actions":{"view_html":"https://pith.science/pith/UUUF73RQG76RWGMM4BCWMF2OSZ","download_json":"https://pith.science/pith/UUUF73RQG76RWGMM4BCWMF2OSZ.json","view_paper":"https://pith.science/paper/UUUF73RQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.02318&json=true","fetch_graph":"https://pith.science/api/pith-number/UUUF73RQG76RWGMM4BCWMF2OSZ/graph.json","fetch_events":"https://pith.science/api/pith-number/UUUF73RQG76RWGMM4BCWMF2OSZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UUUF73RQG76RWGMM4BCWMF2OSZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UUUF73RQG76RWGMM4BCWMF2OSZ/action/storage_attestation","attest_author":"https://pith.science/pith/UUUF73RQG76RWGMM4BCWMF2OSZ/action/author_attestation","sign_citation":"https://pith.science/pith/UUUF73RQG76RWGMM4BCWMF2OSZ/action/citation_signature","submit_replication":"https://pith.science/pith/UUUF73RQG76RWGMM4BCWMF2OSZ/action/replication_record"}},"created_at":"2026-07-05T03:55:30.968948+00:00","updated_at":"2026-07-05T03:55:30.968948+00:00"}