{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5UWOQ6AN6FV5GIGFNZV2BURVIX","short_pith_number":"pith:5UWOQ6AN","canonical_record":{"source":{"id":"1706.06940","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-21T14:50:32Z","cross_cats_sorted":[],"title_canon_sha256":"740dba2f85353351986583b17308b4be006c6b411a9c33766541f94fc112e57e","abstract_canon_sha256":"b9c0baa370e1c960b2c682810d890965a9664a37b1f5cdd0de3a811f5cd122e2"},"schema_version":"1.0"},"canonical_sha256":"ed2ce8780df16bd320c56e6ba0d23545d52b9acb4f8a915c3755e3a2dd6d3752","source":{"kind":"arxiv","id":"1706.06940","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.06940","created_at":"2026-05-18T00:40:34Z"},{"alias_kind":"arxiv_version","alias_value":"1706.06940v2","created_at":"2026-05-18T00:40:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.06940","created_at":"2026-05-18T00:40:34Z"},{"alias_kind":"pith_short_12","alias_value":"5UWOQ6AN6FV5","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5UWOQ6AN6FV5GIGF","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5UWOQ6AN","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5UWOQ6AN6FV5GIGFNZV2BURVIX","target":"record","payload":{"canonical_record":{"source":{"id":"1706.06940","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-21T14:50:32Z","cross_cats_sorted":[],"title_canon_sha256":"740dba2f85353351986583b17308b4be006c6b411a9c33766541f94fc112e57e","abstract_canon_sha256":"b9c0baa370e1c960b2c682810d890965a9664a37b1f5cdd0de3a811f5cd122e2"},"schema_version":"1.0"},"canonical_sha256":"ed2ce8780df16bd320c56e6ba0d23545d52b9acb4f8a915c3755e3a2dd6d3752","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:34.712571Z","signature_b64":"mOectWZGsJiUw9PY9KJqzs4inkAejm0zjxxZJXejISUQqCdd1AxavsfhT1SaQJFkVYn0HDkY6xLBcIEDig68Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed2ce8780df16bd320c56e6ba0d23545d52b9acb4f8a915c3755e3a2dd6d3752","last_reissued_at":"2026-05-18T00:40:34.711883Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:34.711883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.06940","source_version":2,"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-05-18T00:40:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dTgVylVVCUYkwVXoadGc5GlVMlrjSyFOUW88CA7du/U4LC0Oxk4wzAIuyr3tYnTNoF4ztZFWObagM5pgsBa9CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:18:22.254378Z"},"content_sha256":"dd57a64c43ef3e8a35ecfc81006a36ac83e396320b6f2e62c2ad2cccfd5302b4","schema_version":"1.0","event_id":"sha256:dd57a64c43ef3e8a35ecfc81006a36ac83e396320b6f2e62c2ad2cccfd5302b4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5UWOQ6AN6FV5GIGFNZV2BURVIX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster batched range minimum queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Szymon Grabowski, Tomasz Kowalski","submitted_at":"2017-06-21T14:50:32Z","abstract_excerpt":"Range Minimum Query (RMQ) is an important building brick of many compressed data structures and string matching algorithms. Although this problem is essentially solved in theory, with sophisticated data structures allowing for constant time queries, there are scenarios in which the number of queries, $q$, is rather small and given beforehand, which encourages to use a simpler approach. A recent work by Alzamel et al. starts with contracting the input array to a much shorter one, with its size proportional to $q$. In this work, we build upon their solution, speeding up handling small batches of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.06940","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":""},"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-05-18T00:40:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V5LIJgx3kC9dJ2jBc5mq87UZjdE1bXAFnjFxGYVExkV3uCavKhqkN4D2Ek0DGHJlP/AU49Ux4OYDsXQYlPbKBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:18:22.254734Z"},"content_sha256":"31e03199fd7ba8e9c2de11dbb633ec720b49c55a18f94927e179578ef363d22e","schema_version":"1.0","event_id":"sha256:31e03199fd7ba8e9c2de11dbb633ec720b49c55a18f94927e179578ef363d22e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5UWOQ6AN6FV5GIGFNZV2BURVIX/bundle.json","state_url":"https://pith.science/pith/5UWOQ6AN6FV5GIGFNZV2BURVIX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5UWOQ6AN6FV5GIGFNZV2BURVIX/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-06-03T19:18:22Z","links":{"resolver":"https://pith.science/pith/5UWOQ6AN6FV5GIGFNZV2BURVIX","bundle":"https://pith.science/pith/5UWOQ6AN6FV5GIGFNZV2BURVIX/bundle.json","state":"https://pith.science/pith/5UWOQ6AN6FV5GIGFNZV2BURVIX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5UWOQ6AN6FV5GIGFNZV2BURVIX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5UWOQ6AN6FV5GIGFNZV2BURVIX","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":"b9c0baa370e1c960b2c682810d890965a9664a37b1f5cdd0de3a811f5cd122e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-21T14:50:32Z","title_canon_sha256":"740dba2f85353351986583b17308b4be006c6b411a9c33766541f94fc112e57e"},"schema_version":"1.0","source":{"id":"1706.06940","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.06940","created_at":"2026-05-18T00:40:34Z"},{"alias_kind":"arxiv_version","alias_value":"1706.06940v2","created_at":"2026-05-18T00:40:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.06940","created_at":"2026-05-18T00:40:34Z"},{"alias_kind":"pith_short_12","alias_value":"5UWOQ6AN6FV5","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5UWOQ6AN6FV5GIGF","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5UWOQ6AN","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:31e03199fd7ba8e9c2de11dbb633ec720b49c55a18f94927e179578ef363d22e","target":"graph","created_at":"2026-05-18T00:40:34Z","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"},"paper":{"abstract_excerpt":"Range Minimum Query (RMQ) is an important building brick of many compressed data structures and string matching algorithms. Although this problem is essentially solved in theory, with sophisticated data structures allowing for constant time queries, there are scenarios in which the number of queries, $q$, is rather small and given beforehand, which encourages to use a simpler approach. A recent work by Alzamel et al. starts with contracting the input array to a much shorter one, with its size proportional to $q$. In this work, we build upon their solution, speeding up handling small batches of","authors_text":"Szymon Grabowski, Tomasz Kowalski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-21T14:50:32Z","title":"Faster batched range minimum queries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.06940","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:dd57a64c43ef3e8a35ecfc81006a36ac83e396320b6f2e62c2ad2cccfd5302b4","target":"record","created_at":"2026-05-18T00:40:34Z","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":"b9c0baa370e1c960b2c682810d890965a9664a37b1f5cdd0de3a811f5cd122e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-21T14:50:32Z","title_canon_sha256":"740dba2f85353351986583b17308b4be006c6b411a9c33766541f94fc112e57e"},"schema_version":"1.0","source":{"id":"1706.06940","kind":"arxiv","version":2}},"canonical_sha256":"ed2ce8780df16bd320c56e6ba0d23545d52b9acb4f8a915c3755e3a2dd6d3752","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ed2ce8780df16bd320c56e6ba0d23545d52b9acb4f8a915c3755e3a2dd6d3752","first_computed_at":"2026-05-18T00:40:34.711883Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:34.711883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mOectWZGsJiUw9PY9KJqzs4inkAejm0zjxxZJXejISUQqCdd1AxavsfhT1SaQJFkVYn0HDkY6xLBcIEDig68Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:34.712571Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.06940","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd57a64c43ef3e8a35ecfc81006a36ac83e396320b6f2e62c2ad2cccfd5302b4","sha256:31e03199fd7ba8e9c2de11dbb633ec720b49c55a18f94927e179578ef363d22e"],"state_sha256":"1780f77165a7a093724c07af426bfbf8b249fab5f9336ddb156addd8d3e13a44"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L3u7y2l94VdhR+dvb+5yjPaObiLYtEHhMPk8zUX23qkoxbwbh4CvoReGLYqcca/aMvf4a3WsriHspCk34elIDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T19:18:22.256810Z","bundle_sha256":"2b2727b0980c8689f2d1ffd8f28c7cfa70c652c64d22a3626265b9dc9c320ed7"}}