{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:UUUF73RQG76RWGMM4BCWMF2OSZ","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":"dc28cb3810c5ea542e2fedfb3b93963a7efc14b5c4e570f971d1662b44cc9589","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2021-11-03T16:11:22Z","title_canon_sha256":"f5adb46c8cae0beef3fd8dd353adb42a139db94a933d3032a61fc70b3e98d718"},"schema_version":"1.0","source":{"id":"2111.02318","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.02318","created_at":"2026-07-05T03:55:30Z"},{"alias_kind":"arxiv_version","alias_value":"2111.02318v2","created_at":"2026-07-05T03:55:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.02318","created_at":"2026-07-05T03:55:30Z"},{"alias_kind":"pith_short_12","alias_value":"UUUF73RQG76R","created_at":"2026-07-05T03:55:30Z"},{"alias_kind":"pith_short_16","alias_value":"UUUF73RQG76RWGMM","created_at":"2026-07-05T03:55:30Z"},{"alias_kind":"pith_short_8","alias_value":"UUUF73RQ","created_at":"2026-07-05T03:55:30Z"}],"graph_snapshots":[{"event_id":"sha256:7904048246c77a86f9486d82baf2788d9dcf84b3cc63ae43025407e7a1ba6a53","target":"graph","created_at":"2026-07-05T03:55:30Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2111.02318/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Mingmou Liu","cross_cats":["cs.CC"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2021-11-03T16:11:22Z","title":"Nearly Tight Lower Bounds for Succinct Range Minimum Query"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.02318","kind":"arxiv","version":2},"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:ef001caa3cc05638aa766e8ef1dccea693ad326925afcec81055954916bd6d78","target":"record","created_at":"2026-07-05T03:55:30Z","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":"dc28cb3810c5ea542e2fedfb3b93963a7efc14b5c4e570f971d1662b44cc9589","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2021-11-03T16:11:22Z","title_canon_sha256":"f5adb46c8cae0beef3fd8dd353adb42a139db94a933d3032a61fc70b3e98d718"},"schema_version":"1.0","source":{"id":"2111.02318","kind":"arxiv","version":2}},"canonical_sha256":"a5285fee3037fd1b198ce04566174e966336781f8f87a697eb8a89df1f8e646b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a5285fee3037fd1b198ce04566174e966336781f8f87a697eb8a89df1f8e646b","first_computed_at":"2026-07-05T03:55:30.968884Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:55:30.968884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+mCtKB2B9mjkN0NQXeSNyRYmwrFwmNm5IDjWMtWtQim+dhw8vyi+pR7lzNrlJOuGOOD4vvqBf1eB0uFfH4SGCg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:55:30.969399Z","signed_message":"canonical_sha256_bytes"},"source_id":"2111.02318","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ef001caa3cc05638aa766e8ef1dccea693ad326925afcec81055954916bd6d78","sha256:7904048246c77a86f9486d82baf2788d9dcf84b3cc63ae43025407e7a1ba6a53"],"state_sha256":"b388bdb9ec9ada79e46acc7f27cda6ceaf274a6c4918525f8b1e4346ca488efa"}