{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LELJ3DQY6ZMYU53QSPLMZXKAQP","short_pith_number":"pith:LELJ3DQY","schema_version":"1.0","canonical_sha256":"59169d8e18f6598a777093d6ccdd4083d3ca611289f2ee783fd320826a3797dc","source":{"kind":"arxiv","id":"1907.01032","version":2},"attestation_state":"computed","paper":{"title":"On Slicing Sorted Integer Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.IR","authors_text":"Giulio Ermanno Pibiri","submitted_at":"2019-07-01T19:33:29Z","abstract_excerpt":"Representing sorted integer sequences in small space is a central problem for large-scale retrieval systems such as Web search engines. Efficient query resolution, e.g., intersection or random access, is achieved by carefully partitioning the sequences. In this work we describe and compare two different partitioning paradigms: partitioning by cardinality and partitioning by universe. Although the ideas behind such paradigms have been known in the coding and algorithmic community since many years, inverted index compression has extensively adopted the former paradigm, whereas the latter has rec"},"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":"1907.01032","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-07-01T19:33:29Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"3c057d6974286a0a52b3f5730e05f5813acbeaffab35db708903f68bdb25bcf0","abstract_canon_sha256":"9ca3a2c2de47e8cc5fd771bd95c9af7dfa099a7dda0da34c5994006d36b18327"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:08.479656Z","signature_b64":"djgNYW8J/h80CsYGOYGJLIM/B65Sr0Q+0bo5yfo2WRP+QMwa+PFxjJrGMtOm6zZtCnu8+OMcuFnQV7OaizvAAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59169d8e18f6598a777093d6ccdd4083d3ca611289f2ee783fd320826a3797dc","last_reissued_at":"2026-05-17T23:40:08.478883Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:08.478883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Slicing Sorted Integer Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.IR","authors_text":"Giulio Ermanno Pibiri","submitted_at":"2019-07-01T19:33:29Z","abstract_excerpt":"Representing sorted integer sequences in small space is a central problem for large-scale retrieval systems such as Web search engines. Efficient query resolution, e.g., intersection or random access, is achieved by carefully partitioning the sequences. In this work we describe and compare two different partitioning paradigms: partitioning by cardinality and partitioning by universe. Although the ideas behind such paradigms have been known in the coding and algorithmic community since many years, inverted index compression has extensively adopted the former paradigm, whereas the latter has rec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.01032","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1907.01032","created_at":"2026-05-17T23:40:08.479007+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.01032v2","created_at":"2026-05-17T23:40:08.479007+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01032","created_at":"2026-05-17T23:40:08.479007+00:00"},{"alias_kind":"pith_short_12","alias_value":"LELJ3DQY6ZMY","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"LELJ3DQY6ZMYU53Q","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"LELJ3DQY","created_at":"2026-05-18T12:33:21.387695+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LELJ3DQY6ZMYU53QSPLMZXKAQP","json":"https://pith.science/pith/LELJ3DQY6ZMYU53QSPLMZXKAQP.json","graph_json":"https://pith.science/api/pith-number/LELJ3DQY6ZMYU53QSPLMZXKAQP/graph.json","events_json":"https://pith.science/api/pith-number/LELJ3DQY6ZMYU53QSPLMZXKAQP/events.json","paper":"https://pith.science/paper/LELJ3DQY"},"agent_actions":{"view_html":"https://pith.science/pith/LELJ3DQY6ZMYU53QSPLMZXKAQP","download_json":"https://pith.science/pith/LELJ3DQY6ZMYU53QSPLMZXKAQP.json","view_paper":"https://pith.science/paper/LELJ3DQY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.01032&json=true","fetch_graph":"https://pith.science/api/pith-number/LELJ3DQY6ZMYU53QSPLMZXKAQP/graph.json","fetch_events":"https://pith.science/api/pith-number/LELJ3DQY6ZMYU53QSPLMZXKAQP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LELJ3DQY6ZMYU53QSPLMZXKAQP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LELJ3DQY6ZMYU53QSPLMZXKAQP/action/storage_attestation","attest_author":"https://pith.science/pith/LELJ3DQY6ZMYU53QSPLMZXKAQP/action/author_attestation","sign_citation":"https://pith.science/pith/LELJ3DQY6ZMYU53QSPLMZXKAQP/action/citation_signature","submit_replication":"https://pith.science/pith/LELJ3DQY6ZMYU53QSPLMZXKAQP/action/replication_record"}},"created_at":"2026-05-17T23:40:08.479007+00:00","updated_at":"2026-05-17T23:40:08.479007+00:00"}