{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:C5ZE7FNHMMO75BKACXSFTLWZ4Q","short_pith_number":"pith:C5ZE7FNH","schema_version":"1.0","canonical_sha256":"17724f95a7631dfe854015e459aed9e43d5696f04db72986d80a9aab4cbc53d9","source":{"kind":"arxiv","id":"2004.05738","version":1},"attestation_state":"computed","paper":{"title":"Lower Bound for Succinct Range Minimum Query","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Huacheng Yu, Mingmou Liu","submitted_at":"2020-04-13T01:20:51Z","abstract_excerpt":"Given an integer array $A[1..n]$, the Range Minimum Query problem (RMQ) asks to preprocess $A$ into a data structure, supporting RMQ queries: given $a,b\\in [1,n]$, return the index $i\\in[a,b]$ that minimizes $A[i]$, i.e., $\\mathrm{argmin}_{i\\in[a,b]} A[i]$. This problem has a classic solution using $O(n)$ space and $O(1)$ query time by Gabow, Bentley, Tarjan (STOC, 1984) and Harel, Tarjan (SICOMP, 1984). The best known data structure by Fischer, Heun (SICOMP, 2011) and Navarro, Sadakane (TALG, 2014) uses $2n+n/(\\frac{\\log n}{t})^t+\\tilde{O}(n^{3/4})$ bits and answers queries in $O(t)$ time, as"},"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":"2004.05738","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-04-13T01:20:51Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"79a3242dcbebc3de761e4fd95139f208d9f87a2b896ec03ffae396b546ed4323","abstract_canon_sha256":"024866b42f9bdb48acf74a238257dac5e4f6dffabb7a1159b8d81b9cf6ff60ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:28:58.129151Z","signature_b64":"h4DRSj2gfaKcTwx+o5TDVqd1wgnKDAjfw8jKPAhftmK/L3DKQvKTkP8JcyEZxee2h7mfhaky826us3jiaL4kAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17724f95a7631dfe854015e459aed9e43d5696f04db72986d80a9aab4cbc53d9","last_reissued_at":"2026-07-05T03:28:58.128745Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:28:58.128745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower Bound for Succinct Range Minimum Query","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Huacheng Yu, Mingmou Liu","submitted_at":"2020-04-13T01:20:51Z","abstract_excerpt":"Given an integer array $A[1..n]$, the Range Minimum Query problem (RMQ) asks to preprocess $A$ into a data structure, supporting RMQ queries: given $a,b\\in [1,n]$, return the index $i\\in[a,b]$ that minimizes $A[i]$, i.e., $\\mathrm{argmin}_{i\\in[a,b]} A[i]$. This problem has a classic solution using $O(n)$ space and $O(1)$ query time by Gabow, Bentley, Tarjan (STOC, 1984) and Harel, Tarjan (SICOMP, 1984). The best known data structure by Fischer, Heun (SICOMP, 2011) and Navarro, Sadakane (TALG, 2014) uses $2n+n/(\\frac{\\log n}{t})^t+\\tilde{O}(n^{3/4})$ bits and answers queries in $O(t)$ time, as"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.05738","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2004.05738/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":"2004.05738","created_at":"2026-07-05T03:28:58.128803+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.05738v1","created_at":"2026-07-05T03:28:58.128803+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.05738","created_at":"2026-07-05T03:28:58.128803+00:00"},{"alias_kind":"pith_short_12","alias_value":"C5ZE7FNHMMO7","created_at":"2026-07-05T03:28:58.128803+00:00"},{"alias_kind":"pith_short_16","alias_value":"C5ZE7FNHMMO75BKA","created_at":"2026-07-05T03:28:58.128803+00:00"},{"alias_kind":"pith_short_8","alias_value":"C5ZE7FNH","created_at":"2026-07-05T03:28:58.128803+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/C5ZE7FNHMMO75BKACXSFTLWZ4Q","json":"https://pith.science/pith/C5ZE7FNHMMO75BKACXSFTLWZ4Q.json","graph_json":"https://pith.science/api/pith-number/C5ZE7FNHMMO75BKACXSFTLWZ4Q/graph.json","events_json":"https://pith.science/api/pith-number/C5ZE7FNHMMO75BKACXSFTLWZ4Q/events.json","paper":"https://pith.science/paper/C5ZE7FNH"},"agent_actions":{"view_html":"https://pith.science/pith/C5ZE7FNHMMO75BKACXSFTLWZ4Q","download_json":"https://pith.science/pith/C5ZE7FNHMMO75BKACXSFTLWZ4Q.json","view_paper":"https://pith.science/paper/C5ZE7FNH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.05738&json=true","fetch_graph":"https://pith.science/api/pith-number/C5ZE7FNHMMO75BKACXSFTLWZ4Q/graph.json","fetch_events":"https://pith.science/api/pith-number/C5ZE7FNHMMO75BKACXSFTLWZ4Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C5ZE7FNHMMO75BKACXSFTLWZ4Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C5ZE7FNHMMO75BKACXSFTLWZ4Q/action/storage_attestation","attest_author":"https://pith.science/pith/C5ZE7FNHMMO75BKACXSFTLWZ4Q/action/author_attestation","sign_citation":"https://pith.science/pith/C5ZE7FNHMMO75BKACXSFTLWZ4Q/action/citation_signature","submit_replication":"https://pith.science/pith/C5ZE7FNHMMO75BKACXSFTLWZ4Q/action/replication_record"}},"created_at":"2026-07-05T03:28:58.128803+00:00","updated_at":"2026-07-05T03:28:58.128803+00:00"}