{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:C5ZE7FNHMMO75BKACXSFTLWZ4Q","short_pith_number":"pith:C5ZE7FNH","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"},"canonical_sha256":"17724f95a7631dfe854015e459aed9e43d5696f04db72986d80a9aab4cbc53d9","source":{"kind":"arxiv","id":"2004.05738","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.05738","created_at":"2026-07-05T03:28:58Z"},{"alias_kind":"arxiv_version","alias_value":"2004.05738v1","created_at":"2026-07-05T03:28:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.05738","created_at":"2026-07-05T03:28:58Z"},{"alias_kind":"pith_short_12","alias_value":"C5ZE7FNHMMO7","created_at":"2026-07-05T03:28:58Z"},{"alias_kind":"pith_short_16","alias_value":"C5ZE7FNHMMO75BKA","created_at":"2026-07-05T03:28:58Z"},{"alias_kind":"pith_short_8","alias_value":"C5ZE7FNH","created_at":"2026-07-05T03:28:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:C5ZE7FNHMMO75BKACXSFTLWZ4Q","target":"record","payload":{"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"},"canonical_sha256":"17724f95a7631dfe854015e459aed9e43d5696f04db72986d80a9aab4cbc53d9","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"},"source_kind":"arxiv","source_id":"2004.05738","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-07-05T03:28:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6eTgZIUbq9/iNN2AoRWQoWzUbfEbM1FsaiJURz4YitypHlUsT6dIiW3BcnLgDKV7Z3EKyZlb14SY/SFObqRABQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T06:03:37.012329Z"},"content_sha256":"6f134c5680590ac5bf91023ccd02af27bda60ca50690bc10a89c99d3530968a7","schema_version":"1.0","event_id":"sha256:6f134c5680590ac5bf91023ccd02af27bda60ca50690bc10a89c99d3530968a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:C5ZE7FNHMMO75BKACXSFTLWZ4Q","target":"graph","payload":{"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"},"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-07-05T03:28:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dy3kb/1AiI5/AwYsXtoToRHtUqekiFGNg0hQRviYnTUx3s2QA4EPVLfVzpMWMMuvT20A+gek+xaoNnIs5qB+Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T06:03:37.012823Z"},"content_sha256":"d1098a046f40a7c3328fa87025c597a4c810db7b427b40877f1a97ac67157277","schema_version":"1.0","event_id":"sha256:d1098a046f40a7c3328fa87025c597a4c810db7b427b40877f1a97ac67157277"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C5ZE7FNHMMO75BKACXSFTLWZ4Q/bundle.json","state_url":"https://pith.science/pith/C5ZE7FNHMMO75BKACXSFTLWZ4Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C5ZE7FNHMMO75BKACXSFTLWZ4Q/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-08-01T06:03:37Z","links":{"resolver":"https://pith.science/pith/C5ZE7FNHMMO75BKACXSFTLWZ4Q","bundle":"https://pith.science/pith/C5ZE7FNHMMO75BKACXSFTLWZ4Q/bundle.json","state":"https://pith.science/pith/C5ZE7FNHMMO75BKACXSFTLWZ4Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C5ZE7FNHMMO75BKACXSFTLWZ4Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:C5ZE7FNHMMO75BKACXSFTLWZ4Q","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":"024866b42f9bdb48acf74a238257dac5e4f6dffabb7a1159b8d81b9cf6ff60ce","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-04-13T01:20:51Z","title_canon_sha256":"79a3242dcbebc3de761e4fd95139f208d9f87a2b896ec03ffae396b546ed4323"},"schema_version":"1.0","source":{"id":"2004.05738","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.05738","created_at":"2026-07-05T03:28:58Z"},{"alias_kind":"arxiv_version","alias_value":"2004.05738v1","created_at":"2026-07-05T03:28:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.05738","created_at":"2026-07-05T03:28:58Z"},{"alias_kind":"pith_short_12","alias_value":"C5ZE7FNHMMO7","created_at":"2026-07-05T03:28:58Z"},{"alias_kind":"pith_short_16","alias_value":"C5ZE7FNHMMO75BKA","created_at":"2026-07-05T03:28:58Z"},{"alias_kind":"pith_short_8","alias_value":"C5ZE7FNH","created_at":"2026-07-05T03:28:58Z"}],"graph_snapshots":[{"event_id":"sha256:d1098a046f40a7c3328fa87025c597a4c810db7b427b40877f1a97ac67157277","target":"graph","created_at":"2026-07-05T03:28:58Z","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/2004.05738/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Huacheng Yu, Mingmou Liu","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-04-13T01:20:51Z","title":"Lower Bound for Succinct Range Minimum Query"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.05738","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:6f134c5680590ac5bf91023ccd02af27bda60ca50690bc10a89c99d3530968a7","target":"record","created_at":"2026-07-05T03:28:58Z","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":"024866b42f9bdb48acf74a238257dac5e4f6dffabb7a1159b8d81b9cf6ff60ce","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-04-13T01:20:51Z","title_canon_sha256":"79a3242dcbebc3de761e4fd95139f208d9f87a2b896ec03ffae396b546ed4323"},"schema_version":"1.0","source":{"id":"2004.05738","kind":"arxiv","version":1}},"canonical_sha256":"17724f95a7631dfe854015e459aed9e43d5696f04db72986d80a9aab4cbc53d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17724f95a7631dfe854015e459aed9e43d5696f04db72986d80a9aab4cbc53d9","first_computed_at":"2026-07-05T03:28:58.128745Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:28:58.128745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h4DRSj2gfaKcTwx+o5TDVqd1wgnKDAjfw8jKPAhftmK/L3DKQvKTkP8JcyEZxee2h7mfhaky826us3jiaL4kAw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:28:58.129151Z","signed_message":"canonical_sha256_bytes"},"source_id":"2004.05738","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f134c5680590ac5bf91023ccd02af27bda60ca50690bc10a89c99d3530968a7","sha256:d1098a046f40a7c3328fa87025c597a4c810db7b427b40877f1a97ac67157277"],"state_sha256":"33b4e85fd4d93580dc5d1bd9f62d976ee9036dd6a89c63ea3e72195b780f2afc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uUISAKcNmBciHDXMxmWJybxVlQVXQ0Bft9RVICCB94zJPnV4sSzKiEdJy+UdhZWv6eGzR5S5OTZOAC/QMfACCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T06:03:37.017706Z","bundle_sha256":"a32590c9fba5a778fa5cedc34b3756f4ab64ee877d91248f91b25905cecba9d2"}}