{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:NEMVIQSAKTJR2BDIIDA6VM7XGS","short_pith_number":"pith:NEMVIQSA","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"},"canonical_sha256":"691954424054d31d046840c1eab3f7348c680988cc100e423072fc26b5409e67","source":{"kind":"arxiv","id":"2209.08420","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.08420","created_at":"2026-07-05T04:58:41Z"},{"alias_kind":"arxiv_version","alias_value":"2209.08420v1","created_at":"2026-07-05T04:58:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.08420","created_at":"2026-07-05T04:58:41Z"},{"alias_kind":"pith_short_12","alias_value":"NEMVIQSAKTJR","created_at":"2026-07-05T04:58:41Z"},{"alias_kind":"pith_short_16","alias_value":"NEMVIQSAKTJR2BDI","created_at":"2026-07-05T04:58:41Z"},{"alias_kind":"pith_short_8","alias_value":"NEMVIQSA","created_at":"2026-07-05T04:58:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:NEMVIQSAKTJR2BDIIDA6VM7XGS","target":"record","payload":{"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"},"canonical_sha256":"691954424054d31d046840c1eab3f7348c680988cc100e423072fc26b5409e67","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"},"source_kind":"arxiv","source_id":"2209.08420","source_version":1,"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-05T04:58:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6mMlCfY/tJ/wmxMz+GDzkxvSnqOS8OHJ4PLAIvXB2EqeEmIn1deYXsnry141axM6odBqfaGKpPDG4tYPHhBxBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T02:21:24.641061Z"},"content_sha256":"6bebdc36d35758e5bbe47fe7c727e2e22f412ed2169bc2faeb3ec33b10fdb9b5","schema_version":"1.0","event_id":"sha256:6bebdc36d35758e5bbe47fe7c727e2e22f412ed2169bc2faeb3ec33b10fdb9b5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:NEMVIQSAKTJR2BDIIDA6VM7XGS","target":"graph","payload":{"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"},"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-05T04:58:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CXC7Fx1WYxmq5+5oVTVyUfstJR4WAXq54tXTI94y8bVsQj2FX7gBr2b8jx2OwCEkHvZr8n2iz1JejUeT+FbyBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T02:21:24.641458Z"},"content_sha256":"e6293199a125cf436bec3b902341eb06d7b9199807a5376a26809341493a7083","schema_version":"1.0","event_id":"sha256:e6293199a125cf436bec3b902341eb06d7b9199807a5376a26809341493a7083"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NEMVIQSAKTJR2BDIIDA6VM7XGS/bundle.json","state_url":"https://pith.science/pith/NEMVIQSAKTJR2BDIIDA6VM7XGS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NEMVIQSAKTJR2BDIIDA6VM7XGS/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-07-10T02:21:24Z","links":{"resolver":"https://pith.science/pith/NEMVIQSAKTJR2BDIIDA6VM7XGS","bundle":"https://pith.science/pith/NEMVIQSAKTJR2BDIIDA6VM7XGS/bundle.json","state":"https://pith.science/pith/NEMVIQSAKTJR2BDIIDA6VM7XGS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NEMVIQSAKTJR2BDIIDA6VM7XGS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:NEMVIQSAKTJR2BDIIDA6VM7XGS","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":"45b92e26b55be57a4f21b3ba87d83869fbbd3778674efec9c760b6f5b426bdad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2022-09-17T22:49:56Z","title_canon_sha256":"bef7d830b876c3fba453e1a21d35ea1b8c15a1eafd614573e100fa53f704cf11"},"schema_version":"1.0","source":{"id":"2209.08420","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.08420","created_at":"2026-07-05T04:58:41Z"},{"alias_kind":"arxiv_version","alias_value":"2209.08420v1","created_at":"2026-07-05T04:58:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.08420","created_at":"2026-07-05T04:58:41Z"},{"alias_kind":"pith_short_12","alias_value":"NEMVIQSAKTJR","created_at":"2026-07-05T04:58:41Z"},{"alias_kind":"pith_short_16","alias_value":"NEMVIQSAKTJR2BDI","created_at":"2026-07-05T04:58:41Z"},{"alias_kind":"pith_short_8","alias_value":"NEMVIQSA","created_at":"2026-07-05T04:58:41Z"}],"graph_snapshots":[{"event_id":"sha256:e6293199a125cf436bec3b902341eb06d7b9199807a5376a26809341493a7083","target":"graph","created_at":"2026-07-05T04:58:41Z","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/2209.08420/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Goetz Graefe, Thanh Do","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2022-09-17T22:49:56Z","title":"Robust and Efficient Sorting with Offset-Value Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.08420","kind":"arxiv","version":1},"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:6bebdc36d35758e5bbe47fe7c727e2e22f412ed2169bc2faeb3ec33b10fdb9b5","target":"record","created_at":"2026-07-05T04:58:41Z","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":"45b92e26b55be57a4f21b3ba87d83869fbbd3778674efec9c760b6f5b426bdad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2022-09-17T22:49:56Z","title_canon_sha256":"bef7d830b876c3fba453e1a21d35ea1b8c15a1eafd614573e100fa53f704cf11"},"schema_version":"1.0","source":{"id":"2209.08420","kind":"arxiv","version":1}},"canonical_sha256":"691954424054d31d046840c1eab3f7348c680988cc100e423072fc26b5409e67","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"691954424054d31d046840c1eab3f7348c680988cc100e423072fc26b5409e67","first_computed_at":"2026-07-05T04:58:41.043076Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:58:41.043076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nCNiMDEuaFCR/R0yuP7/KUOwGH4yWY3qGx8/u8hKcpEIS/uEQllfguB3CZVUY9Y6OMOcu2qNF1ohb9cjlYupAg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:58:41.043613Z","signed_message":"canonical_sha256_bytes"},"source_id":"2209.08420","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6bebdc36d35758e5bbe47fe7c727e2e22f412ed2169bc2faeb3ec33b10fdb9b5","sha256:e6293199a125cf436bec3b902341eb06d7b9199807a5376a26809341493a7083"],"state_sha256":"d79ef56a82a366fe16db3c1dab81fc37cb3e74d923d6641b62b1cb269b227c0d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c9/B5L42AS7dUslqWIVUf7fCroRy4x64OT7lYOPs+ASqzvLeqjFHsje2rBjBw0w0uDtTgUo81DgT8CeMi6PHCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-10T02:21:24.643615Z","bundle_sha256":"f35a4132a85b9bd957a7b9fb332b645165e9735050428c1d7f26e60c78ec71a6"}}