{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:NEMVIQSAKTJR2BDIIDA6VM7XGS","short_pith_number":"pith:NEMVIQSA","schema_version":"1.0","canonical_sha256":"691954424054d31d046840c1eab3f7348c680988cc100e423072fc26b5409e67","source":{"kind":"arxiv","id":"2209.08420","version":1},"attestation_state":"computed","paper":{"title":"Robust and Efficient Sorting with Offset-Value Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Goetz Graefe, Thanh Do","submitted_at":"2022-09-17T22:49:56Z","abstract_excerpt":"Sorting and searching are large parts of database query processing, e.g., in the forms of index creation, index maintenance, and index lookup; and comparing pairs of keys is a substantial part of the effort in sorting and searching. We have worked on simple, efficient implementations of decades-old, neglected, effective techniques for fast comparisons and fast sorting, in particular offset-value coding. In the process, we happened upon its mutually beneficial relationship with prefix truncation in run files as well as the duality of compression techniques in row- and column-format storage stru"},"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":"2209.08420","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2022-09-17T22:49:56Z","cross_cats_sorted":[],"title_canon_sha256":"bef7d830b876c3fba453e1a21d35ea1b8c15a1eafd614573e100fa53f704cf11","abstract_canon_sha256":"45b92e26b55be57a4f21b3ba87d83869fbbd3778674efec9c760b6f5b426bdad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:58:41.043613Z","signature_b64":"nCNiMDEuaFCR/R0yuP7/KUOwGH4yWY3qGx8/u8hKcpEIS/uEQllfguB3CZVUY9Y6OMOcu2qNF1ohb9cjlYupAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"691954424054d31d046840c1eab3f7348c680988cc100e423072fc26b5409e67","last_reissued_at":"2026-07-05T04:58:41.043076Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:58:41.043076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust and Efficient Sorting with Offset-Value Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Goetz Graefe, Thanh Do","submitted_at":"2022-09-17T22:49:56Z","abstract_excerpt":"Sorting and searching are large parts of database query processing, e.g., in the forms of index creation, index maintenance, and index lookup; and comparing pairs of keys is a substantial part of the effort in sorting and searching. We have worked on simple, efficient implementations of decades-old, neglected, effective techniques for fast comparisons and fast sorting, in particular offset-value coding. In the process, we happened upon its mutually beneficial relationship with prefix truncation in run files as well as the duality of compression techniques in row- and column-format storage stru"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.08420","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/2209.08420/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":"2209.08420","created_at":"2026-07-05T04:58:41.043133+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.08420v1","created_at":"2026-07-05T04:58:41.043133+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.08420","created_at":"2026-07-05T04:58:41.043133+00:00"},{"alias_kind":"pith_short_12","alias_value":"NEMVIQSAKTJR","created_at":"2026-07-05T04:58:41.043133+00:00"},{"alias_kind":"pith_short_16","alias_value":"NEMVIQSAKTJR2BDI","created_at":"2026-07-05T04:58:41.043133+00:00"},{"alias_kind":"pith_short_8","alias_value":"NEMVIQSA","created_at":"2026-07-05T04:58:41.043133+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/NEMVIQSAKTJR2BDIIDA6VM7XGS","json":"https://pith.science/pith/NEMVIQSAKTJR2BDIIDA6VM7XGS.json","graph_json":"https://pith.science/api/pith-number/NEMVIQSAKTJR2BDIIDA6VM7XGS/graph.json","events_json":"https://pith.science/api/pith-number/NEMVIQSAKTJR2BDIIDA6VM7XGS/events.json","paper":"https://pith.science/paper/NEMVIQSA"},"agent_actions":{"view_html":"https://pith.science/pith/NEMVIQSAKTJR2BDIIDA6VM7XGS","download_json":"https://pith.science/pith/NEMVIQSAKTJR2BDIIDA6VM7XGS.json","view_paper":"https://pith.science/paper/NEMVIQSA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.08420&json=true","fetch_graph":"https://pith.science/api/pith-number/NEMVIQSAKTJR2BDIIDA6VM7XGS/graph.json","fetch_events":"https://pith.science/api/pith-number/NEMVIQSAKTJR2BDIIDA6VM7XGS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NEMVIQSAKTJR2BDIIDA6VM7XGS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NEMVIQSAKTJR2BDIIDA6VM7XGS/action/storage_attestation","attest_author":"https://pith.science/pith/NEMVIQSAKTJR2BDIIDA6VM7XGS/action/author_attestation","sign_citation":"https://pith.science/pith/NEMVIQSAKTJR2BDIIDA6VM7XGS/action/citation_signature","submit_replication":"https://pith.science/pith/NEMVIQSAKTJR2BDIIDA6VM7XGS/action/replication_record"}},"created_at":"2026-07-05T04:58:41.043133+00:00","updated_at":"2026-07-05T04:58:41.043133+00:00"}