{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:UWJLNOB4L5JF6RB2QIGLMZ5PIZ","short_pith_number":"pith:UWJLNOB4","canonical_record":{"source":{"id":"2508.02280","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2025-08-04T10:51:20Z","cross_cats_sorted":[],"title_canon_sha256":"c7736afd023646ad1924c62c051bf69e7eb911ad6794538a4c04c12d202d188e","abstract_canon_sha256":"c608ff3b14d5e5953d2add3a0835acde74859439204a406b94cd03787a367725"},"schema_version":"1.0"},"canonical_sha256":"a592b6b83c5f525f443a820cb667af465202ba5cdb974412ebd8877b9f3f9ae3","source":{"kind":"arxiv","id":"2508.02280","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.02280","created_at":"2026-07-05T11:48:11Z"},{"alias_kind":"arxiv_version","alias_value":"2508.02280v1","created_at":"2026-07-05T11:48:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.02280","created_at":"2026-07-05T11:48:11Z"},{"alias_kind":"pith_short_12","alias_value":"UWJLNOB4L5JF","created_at":"2026-07-05T11:48:11Z"},{"alias_kind":"pith_short_16","alias_value":"UWJLNOB4L5JF6RB2","created_at":"2026-07-05T11:48:11Z"},{"alias_kind":"pith_short_8","alias_value":"UWJLNOB4","created_at":"2026-07-05T11:48:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:UWJLNOB4L5JF6RB2QIGLMZ5PIZ","target":"record","payload":{"canonical_record":{"source":{"id":"2508.02280","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2025-08-04T10:51:20Z","cross_cats_sorted":[],"title_canon_sha256":"c7736afd023646ad1924c62c051bf69e7eb911ad6794538a4c04c12d202d188e","abstract_canon_sha256":"c608ff3b14d5e5953d2add3a0835acde74859439204a406b94cd03787a367725"},"schema_version":"1.0"},"canonical_sha256":"a592b6b83c5f525f443a820cb667af465202ba5cdb974412ebd8877b9f3f9ae3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:48:11.509877Z","signature_b64":"mw59KJT9ezCthjP/vTaK61TzrCym9u/CYYTcmr67ybx6y2DcsTWX6kdm34F9oWv8vPBIiqm40wzAcWM7vHKwBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a592b6b83c5f525f443a820cb667af465202ba5cdb974412ebd8877b9f3f9ae3","last_reissued_at":"2026-07-05T11:48:11.509263Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:48:11.509263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2508.02280","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-05T11:48:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ge2ogcQ+5Ar5ecMxBD1hfVquLG9YYGQNlch1BCkNKaRfuqMkEJ1Hgyh3xwkxU6UGqcDUixJwOJhAQPzAQYlMCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T08:35:08.038352Z"},"content_sha256":"f6e5f4a4ac88250fd27c33422951c7edd0fdd05efddeaef93cbe31e7cf6891c4","schema_version":"1.0","event_id":"sha256:f6e5f4a4ac88250fd27c33422951c7edd0fdd05efddeaef93cbe31e7cf6891c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:UWJLNOB4L5JF6RB2QIGLMZ5PIZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"OnPair: Short Strings Compression for Fast Random Access","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Francesco Gargiulo, Rossano Venturini","submitted_at":"2025-08-04T10:51:20Z","abstract_excerpt":"We present OnPair, a dictionary-based compression algorithm designed to meet the needs of in-memory database systems that require both high compression and fast random access. Existing methods either achieve strong compression ratios at significant computational and memory cost (e.g., BPE) or prioritize speed at the expense of compression quality (e.g., FSST). OnPair bridges this gap by employing a cache-friendly dictionary construction technique that incrementally merges frequent adjacent substrings in a single sequential pass over a data sample. This enables fast, memory-efficient training w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.02280","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/2508.02280/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-05T11:48:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2bQ8Eq3NCrHf0G6CecCItFKWM1BHdOVDozbzUViiz5mZER/TamhnlJYsxIqtjhXcgsIhIVKtdrn3wHIh672WDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T08:35:08.039188Z"},"content_sha256":"33635072af42f2f38eab7832210440eaebd63df15f402484eb37485e2657e434","schema_version":"1.0","event_id":"sha256:33635072af42f2f38eab7832210440eaebd63df15f402484eb37485e2657e434"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UWJLNOB4L5JF6RB2QIGLMZ5PIZ/bundle.json","state_url":"https://pith.science/pith/UWJLNOB4L5JF6RB2QIGLMZ5PIZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UWJLNOB4L5JF6RB2QIGLMZ5PIZ/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-05T08:35:08Z","links":{"resolver":"https://pith.science/pith/UWJLNOB4L5JF6RB2QIGLMZ5PIZ","bundle":"https://pith.science/pith/UWJLNOB4L5JF6RB2QIGLMZ5PIZ/bundle.json","state":"https://pith.science/pith/UWJLNOB4L5JF6RB2QIGLMZ5PIZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UWJLNOB4L5JF6RB2QIGLMZ5PIZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:UWJLNOB4L5JF6RB2QIGLMZ5PIZ","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":"c608ff3b14d5e5953d2add3a0835acde74859439204a406b94cd03787a367725","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2025-08-04T10:51:20Z","title_canon_sha256":"c7736afd023646ad1924c62c051bf69e7eb911ad6794538a4c04c12d202d188e"},"schema_version":"1.0","source":{"id":"2508.02280","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.02280","created_at":"2026-07-05T11:48:11Z"},{"alias_kind":"arxiv_version","alias_value":"2508.02280v1","created_at":"2026-07-05T11:48:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.02280","created_at":"2026-07-05T11:48:11Z"},{"alias_kind":"pith_short_12","alias_value":"UWJLNOB4L5JF","created_at":"2026-07-05T11:48:11Z"},{"alias_kind":"pith_short_16","alias_value":"UWJLNOB4L5JF6RB2","created_at":"2026-07-05T11:48:11Z"},{"alias_kind":"pith_short_8","alias_value":"UWJLNOB4","created_at":"2026-07-05T11:48:11Z"}],"graph_snapshots":[{"event_id":"sha256:33635072af42f2f38eab7832210440eaebd63df15f402484eb37485e2657e434","target":"graph","created_at":"2026-07-05T11:48: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/2508.02280/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present OnPair, a dictionary-based compression algorithm designed to meet the needs of in-memory database systems that require both high compression and fast random access. Existing methods either achieve strong compression ratios at significant computational and memory cost (e.g., BPE) or prioritize speed at the expense of compression quality (e.g., FSST). OnPair bridges this gap by employing a cache-friendly dictionary construction technique that incrementally merges frequent adjacent substrings in a single sequential pass over a data sample. This enables fast, memory-efficient training w","authors_text":"Francesco Gargiulo, Rossano Venturini","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2025-08-04T10:51:20Z","title":"OnPair: Short Strings Compression for Fast Random Access"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.02280","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:f6e5f4a4ac88250fd27c33422951c7edd0fdd05efddeaef93cbe31e7cf6891c4","target":"record","created_at":"2026-07-05T11:48: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":"c608ff3b14d5e5953d2add3a0835acde74859439204a406b94cd03787a367725","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2025-08-04T10:51:20Z","title_canon_sha256":"c7736afd023646ad1924c62c051bf69e7eb911ad6794538a4c04c12d202d188e"},"schema_version":"1.0","source":{"id":"2508.02280","kind":"arxiv","version":1}},"canonical_sha256":"a592b6b83c5f525f443a820cb667af465202ba5cdb974412ebd8877b9f3f9ae3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a592b6b83c5f525f443a820cb667af465202ba5cdb974412ebd8877b9f3f9ae3","first_computed_at":"2026-07-05T11:48:11.509263Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:48:11.509263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mw59KJT9ezCthjP/vTaK61TzrCym9u/CYYTcmr67ybx6y2DcsTWX6kdm34F9oWv8vPBIiqm40wzAcWM7vHKwBw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:48:11.509877Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.02280","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f6e5f4a4ac88250fd27c33422951c7edd0fdd05efddeaef93cbe31e7cf6891c4","sha256:33635072af42f2f38eab7832210440eaebd63df15f402484eb37485e2657e434"],"state_sha256":"4ec3b1192f63f468c525e9b96791ec7b6758ec77d2fa6a16eaacf92cada9921c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gkF0HG0VNTPDuHaBbxryai/5Gz8BT1NqkwPqKfG10NapRGcEl+jxecl2/+hhgMTeEg7q1BdcG09//m2xNxyJBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T08:35:08.044868Z","bundle_sha256":"57005c5835d13f2b56e8832a3f602277994bd28e4e2a0695c1b8578b9b9edd7d"}}