{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:7WQ6YXPRFMAD3T6K7B4PV6UTDA","short_pith_number":"pith:7WQ6YXPR","schema_version":"1.0","canonical_sha256":"fda1ec5df12b003dcfcaf878fafa931830aa0036aef23792b7d9ec2786c97de7","source":{"kind":"arxiv","id":"2003.11835","version":1},"attestation_state":"computed","paper":{"title":"Succinct Dynamic Ordered Sets with Random Access","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Giulio Ermanno Pibiri, Rossano Venturini","submitted_at":"2020-03-26T11:09:39Z","abstract_excerpt":"The representation of a dynamic ordered set of $n$ integer keys drawn from a universe of size $m$ is a fundamental data structuring problem. Many solutions to this problem achieve optimal time but take polynomial space, therefore preserving time optimality in the \\emph{compressed} space regime is the problem we address in this work. For a polynomial universe $m = n^{\\Theta(1)}$, we give a solution that takes $\\textsf{EF}(n,m) + o(n)$ bits, where $\\textsf{EF}(n,m) \\leq n\\lceil \\log_2(m/n)\\rceil + 2n$ is the cost in bits of the \\emph{Elias-Fano} representation of the set, and supports random acc"},"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":"2003.11835","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-03-26T11:09:39Z","cross_cats_sorted":[],"title_canon_sha256":"7d7207048c46e898373556029f7f5f222eb4faf7b4788dee754e8d187af269a7","abstract_canon_sha256":"95a45b88fba30b5b5a0062e13a18ec9886a09dd24025569bad9533e8e95ef0f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:50:48.021366Z","signature_b64":"ott1CK2EUP0sdANJdh70vsHmAW2Nzn04YoMD0Ona/H98+0tJmrxQSb7VqMfgfYlQZEObhmbcvh5XwYf34quLDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fda1ec5df12b003dcfcaf878fafa931830aa0036aef23792b7d9ec2786c97de7","last_reissued_at":"2026-07-05T00:50:48.020980Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:50:48.020980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Succinct Dynamic Ordered Sets with Random Access","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Giulio Ermanno Pibiri, Rossano Venturini","submitted_at":"2020-03-26T11:09:39Z","abstract_excerpt":"The representation of a dynamic ordered set of $n$ integer keys drawn from a universe of size $m$ is a fundamental data structuring problem. Many solutions to this problem achieve optimal time but take polynomial space, therefore preserving time optimality in the \\emph{compressed} space regime is the problem we address in this work. For a polynomial universe $m = n^{\\Theta(1)}$, we give a solution that takes $\\textsf{EF}(n,m) + o(n)$ bits, where $\\textsf{EF}(n,m) \\leq n\\lceil \\log_2(m/n)\\rceil + 2n$ is the cost in bits of the \\emph{Elias-Fano} representation of the set, and supports random acc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.11835","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/2003.11835/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":"2003.11835","created_at":"2026-07-05T00:50:48.021038+00:00"},{"alias_kind":"arxiv_version","alias_value":"2003.11835v1","created_at":"2026-07-05T00:50:48.021038+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.11835","created_at":"2026-07-05T00:50:48.021038+00:00"},{"alias_kind":"pith_short_12","alias_value":"7WQ6YXPRFMAD","created_at":"2026-07-05T00:50:48.021038+00:00"},{"alias_kind":"pith_short_16","alias_value":"7WQ6YXPRFMAD3T6K","created_at":"2026-07-05T00:50:48.021038+00:00"},{"alias_kind":"pith_short_8","alias_value":"7WQ6YXPR","created_at":"2026-07-05T00:50:48.021038+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.09570","citing_title":"Re-thinking Memory-Bound Limitations in CGRAs","ref_index":2003,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7WQ6YXPRFMAD3T6K7B4PV6UTDA","json":"https://pith.science/pith/7WQ6YXPRFMAD3T6K7B4PV6UTDA.json","graph_json":"https://pith.science/api/pith-number/7WQ6YXPRFMAD3T6K7B4PV6UTDA/graph.json","events_json":"https://pith.science/api/pith-number/7WQ6YXPRFMAD3T6K7B4PV6UTDA/events.json","paper":"https://pith.science/paper/7WQ6YXPR"},"agent_actions":{"view_html":"https://pith.science/pith/7WQ6YXPRFMAD3T6K7B4PV6UTDA","download_json":"https://pith.science/pith/7WQ6YXPRFMAD3T6K7B4PV6UTDA.json","view_paper":"https://pith.science/paper/7WQ6YXPR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2003.11835&json=true","fetch_graph":"https://pith.science/api/pith-number/7WQ6YXPRFMAD3T6K7B4PV6UTDA/graph.json","fetch_events":"https://pith.science/api/pith-number/7WQ6YXPRFMAD3T6K7B4PV6UTDA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7WQ6YXPRFMAD3T6K7B4PV6UTDA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7WQ6YXPRFMAD3T6K7B4PV6UTDA/action/storage_attestation","attest_author":"https://pith.science/pith/7WQ6YXPRFMAD3T6K7B4PV6UTDA/action/author_attestation","sign_citation":"https://pith.science/pith/7WQ6YXPRFMAD3T6K7B4PV6UTDA/action/citation_signature","submit_replication":"https://pith.science/pith/7WQ6YXPRFMAD3T6K7B4PV6UTDA/action/replication_record"}},"created_at":"2026-07-05T00:50:48.021038+00:00","updated_at":"2026-07-05T00:50:48.021038+00:00"}