{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:4GI5VPMHRUHZ2Z6BQZ2BKGCMND","short_pith_number":"pith:4GI5VPMH","canonical_record":{"source":{"id":"2411.16281","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-11-25T11:02:44Z","cross_cats_sorted":[],"title_canon_sha256":"83a56a0cd22d28bf57e1445ac4f5a26ab8c96db34886b1ed8a9843c878fb4e3a","abstract_canon_sha256":"680ec346f2b2850a245a5e0221ad84f88cd770aa6c7a244a47b2fadaedad2674"},"schema_version":"1.0"},"canonical_sha256":"e191dabd878d0f9d67c1867415184c68d24d77bb1c695a2df488b71d195a9865","source":{"kind":"arxiv","id":"2411.16281","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.16281","created_at":"2026-07-05T10:26:11Z"},{"alias_kind":"arxiv_version","alias_value":"2411.16281v2","created_at":"2026-07-05T10:26:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.16281","created_at":"2026-07-05T10:26:11Z"},{"alias_kind":"pith_short_12","alias_value":"4GI5VPMHRUHZ","created_at":"2026-07-05T10:26:11Z"},{"alias_kind":"pith_short_16","alias_value":"4GI5VPMHRUHZ2Z6B","created_at":"2026-07-05T10:26:11Z"},{"alias_kind":"pith_short_8","alias_value":"4GI5VPMH","created_at":"2026-07-05T10:26:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:4GI5VPMHRUHZ2Z6BQZ2BKGCMND","target":"record","payload":{"canonical_record":{"source":{"id":"2411.16281","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-11-25T11:02:44Z","cross_cats_sorted":[],"title_canon_sha256":"83a56a0cd22d28bf57e1445ac4f5a26ab8c96db34886b1ed8a9843c878fb4e3a","abstract_canon_sha256":"680ec346f2b2850a245a5e0221ad84f88cd770aa6c7a244a47b2fadaedad2674"},"schema_version":"1.0"},"canonical_sha256":"e191dabd878d0f9d67c1867415184c68d24d77bb1c695a2df488b71d195a9865","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:26:11.191075Z","signature_b64":"/Khuklr2WB/aU5prNqiessRaZuBoLVDwj0kmzP4+r37uB1EMSgjH0XjdzPdMvwCLc/7BhsvOI5tUVkBTKLOTAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e191dabd878d0f9d67c1867415184c68d24d77bb1c695a2df488b71d195a9865","last_reissued_at":"2026-07-05T10:26:11.190215Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:26:11.190215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.16281","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-07-05T10:26:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jQXHiEhYvLPOJeorkqJ1ryCZ7OEtQNtFoOTYHSyQpFqXLh+q+ooIohgQafLTfJn1HKkzKgH/dqZxbAxA3AfwDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T23:34:10.108936Z"},"content_sha256":"b99e0a50981a68a1a23a429fd5e1a72a7e94042575e199748327bd07f146798a","schema_version":"1.0","event_id":"sha256:b99e0a50981a68a1a23a429fd5e1a72a7e94042575e199748327bd07f146798a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:4GI5VPMHRUHZ2Z6BQZ2BKGCMND","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Range Minimum Queries on the Ultra-Wide Word RAM","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Inge Li G{\\o}rtz, M\\'aximo P\\'erez L\\'opez, Philip Bille, Tord Stordalen","submitted_at":"2024-11-25T11:02:44Z","abstract_excerpt":"We consider the dynamic range minimum problem on the ultra-wide word RAM model of computation. This model extends the classic $w$-bit word RAM model with special ultrawords of length $w^2$ bits that support standard arithmetic and boolean operation and scattered memory access operations that can access $w$ (non-contiguous) locations in memory. The ultra-wide word RAM model captures (and idealizes) modern vector processor architectures.\n  Our main result is a linear space data structure that supports range minimum queries and updates in $O(\\log \\log \\log n)$ time. This exponentially improves th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.16281","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/2411.16281/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-05T10:26:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cm8zkUzPcG6XS02YLrXLi09L6LbOd31JmGG2l2MQ5RxnbdIGfiQWPCjj5xRmB24NZaU08bLop1uI2LlkXqnuCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T23:34:10.109378Z"},"content_sha256":"419341b70b467fdad7ddf7ac8d5e978c37d304eec092655ff6e50b03642e6fb8","schema_version":"1.0","event_id":"sha256:419341b70b467fdad7ddf7ac8d5e978c37d304eec092655ff6e50b03642e6fb8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4GI5VPMHRUHZ2Z6BQZ2BKGCMND/bundle.json","state_url":"https://pith.science/pith/4GI5VPMHRUHZ2Z6BQZ2BKGCMND/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4GI5VPMHRUHZ2Z6BQZ2BKGCMND/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-12T23:34:10Z","links":{"resolver":"https://pith.science/pith/4GI5VPMHRUHZ2Z6BQZ2BKGCMND","bundle":"https://pith.science/pith/4GI5VPMHRUHZ2Z6BQZ2BKGCMND/bundle.json","state":"https://pith.science/pith/4GI5VPMHRUHZ2Z6BQZ2BKGCMND/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4GI5VPMHRUHZ2Z6BQZ2BKGCMND/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:4GI5VPMHRUHZ2Z6BQZ2BKGCMND","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":"680ec346f2b2850a245a5e0221ad84f88cd770aa6c7a244a47b2fadaedad2674","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-11-25T11:02:44Z","title_canon_sha256":"83a56a0cd22d28bf57e1445ac4f5a26ab8c96db34886b1ed8a9843c878fb4e3a"},"schema_version":"1.0","source":{"id":"2411.16281","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.16281","created_at":"2026-07-05T10:26:11Z"},{"alias_kind":"arxiv_version","alias_value":"2411.16281v2","created_at":"2026-07-05T10:26:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.16281","created_at":"2026-07-05T10:26:11Z"},{"alias_kind":"pith_short_12","alias_value":"4GI5VPMHRUHZ","created_at":"2026-07-05T10:26:11Z"},{"alias_kind":"pith_short_16","alias_value":"4GI5VPMHRUHZ2Z6B","created_at":"2026-07-05T10:26:11Z"},{"alias_kind":"pith_short_8","alias_value":"4GI5VPMH","created_at":"2026-07-05T10:26:11Z"}],"graph_snapshots":[{"event_id":"sha256:419341b70b467fdad7ddf7ac8d5e978c37d304eec092655ff6e50b03642e6fb8","target":"graph","created_at":"2026-07-05T10:26:11Z","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/2411.16281/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the dynamic range minimum problem on the ultra-wide word RAM model of computation. This model extends the classic $w$-bit word RAM model with special ultrawords of length $w^2$ bits that support standard arithmetic and boolean operation and scattered memory access operations that can access $w$ (non-contiguous) locations in memory. The ultra-wide word RAM model captures (and idealizes) modern vector processor architectures.\n  Our main result is a linear space data structure that supports range minimum queries and updates in $O(\\log \\log \\log n)$ time. This exponentially improves th","authors_text":"Inge Li G{\\o}rtz, M\\'aximo P\\'erez L\\'opez, Philip Bille, Tord Stordalen","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-11-25T11:02:44Z","title":"Dynamic Range Minimum Queries on the Ultra-Wide Word RAM"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.16281","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:b99e0a50981a68a1a23a429fd5e1a72a7e94042575e199748327bd07f146798a","target":"record","created_at":"2026-07-05T10:26:11Z","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":"680ec346f2b2850a245a5e0221ad84f88cd770aa6c7a244a47b2fadaedad2674","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-11-25T11:02:44Z","title_canon_sha256":"83a56a0cd22d28bf57e1445ac4f5a26ab8c96db34886b1ed8a9843c878fb4e3a"},"schema_version":"1.0","source":{"id":"2411.16281","kind":"arxiv","version":2}},"canonical_sha256":"e191dabd878d0f9d67c1867415184c68d24d77bb1c695a2df488b71d195a9865","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e191dabd878d0f9d67c1867415184c68d24d77bb1c695a2df488b71d195a9865","first_computed_at":"2026-07-05T10:26:11.190215Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:26:11.190215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/Khuklr2WB/aU5prNqiessRaZuBoLVDwj0kmzP4+r37uB1EMSgjH0XjdzPdMvwCLc/7BhsvOI5tUVkBTKLOTAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:26:11.191075Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.16281","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b99e0a50981a68a1a23a429fd5e1a72a7e94042575e199748327bd07f146798a","sha256:419341b70b467fdad7ddf7ac8d5e978c37d304eec092655ff6e50b03642e6fb8"],"state_sha256":"2eba358f4428fb23c382b8118623fdb6d67c3fe667cf9dfafda1a27fe4f6f23c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wRRsU6f8Yid0oWxWveRXQ0li14yEvABvAqMN9HT1NEScGlSL1N3LoW/WUK8p5YLtlZGY1EENsq3weRWU50HcDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T23:34:10.112431Z","bundle_sha256":"4e482976f981682f868adb21df29f35708e74d49d13386f8a238062e3bf5caa4"}}