{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:FTRSBKR7CJQKX46M67AF6FCH24","short_pith_number":"pith:FTRSBKR7","schema_version":"1.0","canonical_sha256":"2ce320aa3f1260abf3ccf7c05f1447d702a65c8d710d79431814be0c6d633375","source":{"kind":"arxiv","id":"2412.10770","version":1},"attestation_state":"computed","paper":{"title":"Learned Data Compression: Challenges and Opportunities for the Future","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.DB","authors_text":"Jianwei Liao, Jingshu Peng, Jin Li, Jun Du, Lei Chen, Qiyu Liu, Siyuan Han","submitted_at":"2024-12-14T09:47:21Z","abstract_excerpt":"Compressing integer keys is a fundamental operation among multiple communities, such as database management (DB), information retrieval (IR), and high-performance computing (HPC). Recent advances in \\emph{learned indexes} have inspired the development of \\emph{learned compressors}, which leverage simple yet compact machine learning (ML) models to compress large-scale sorted keys. The core idea behind learned compressors is to \\emph{losslessly} encode sorted keys by approximating them with \\emph{error-bounded} ML models (e.g., piecewise linear functions) and using a \\emph{residual array} to gua"},"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":"2412.10770","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2024-12-14T09:47:21Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"5eaf9b2b4b53566b9e9ba3a114a5015055980e3a13a497dcd48fa0ded50846b8","abstract_canon_sha256":"655de8de5b900581ec4e4241125f40a2e83217c4f37a43ed053fb595cf1d5017"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:49:22.018527Z","signature_b64":"R5GPaV2mvVykE7eCA5RGYT/GBObCbIilowfdragFb802cj1tBsBnQY0V2puyILvVnqCKcwRJoiA38XqDbqPmDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ce320aa3f1260abf3ccf7c05f1447d702a65c8d710d79431814be0c6d633375","last_reissued_at":"2026-07-05T09:49:22.018141Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:49:22.018141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learned Data Compression: Challenges and Opportunities for the Future","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.DB","authors_text":"Jianwei Liao, Jingshu Peng, Jin Li, Jun Du, Lei Chen, Qiyu Liu, Siyuan Han","submitted_at":"2024-12-14T09:47:21Z","abstract_excerpt":"Compressing integer keys is a fundamental operation among multiple communities, such as database management (DB), information retrieval (IR), and high-performance computing (HPC). Recent advances in \\emph{learned indexes} have inspired the development of \\emph{learned compressors}, which leverage simple yet compact machine learning (ML) models to compress large-scale sorted keys. The core idea behind learned compressors is to \\emph{losslessly} encode sorted keys by approximating them with \\emph{error-bounded} ML models (e.g., piecewise linear functions) and using a \\emph{residual array} to gua"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.10770","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/2412.10770/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":"2412.10770","created_at":"2026-07-05T09:49:22.018196+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.10770v1","created_at":"2026-07-05T09:49:22.018196+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.10770","created_at":"2026-07-05T09:49:22.018196+00:00"},{"alias_kind":"pith_short_12","alias_value":"FTRSBKR7CJQK","created_at":"2026-07-05T09:49:22.018196+00:00"},{"alias_kind":"pith_short_16","alias_value":"FTRSBKR7CJQKX46M","created_at":"2026-07-05T09:49:22.018196+00:00"},{"alias_kind":"pith_short_8","alias_value":"FTRSBKR7","created_at":"2026-07-05T09:49:22.018196+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/FTRSBKR7CJQKX46M67AF6FCH24","json":"https://pith.science/pith/FTRSBKR7CJQKX46M67AF6FCH24.json","graph_json":"https://pith.science/api/pith-number/FTRSBKR7CJQKX46M67AF6FCH24/graph.json","events_json":"https://pith.science/api/pith-number/FTRSBKR7CJQKX46M67AF6FCH24/events.json","paper":"https://pith.science/paper/FTRSBKR7"},"agent_actions":{"view_html":"https://pith.science/pith/FTRSBKR7CJQKX46M67AF6FCH24","download_json":"https://pith.science/pith/FTRSBKR7CJQKX46M67AF6FCH24.json","view_paper":"https://pith.science/paper/FTRSBKR7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.10770&json=true","fetch_graph":"https://pith.science/api/pith-number/FTRSBKR7CJQKX46M67AF6FCH24/graph.json","fetch_events":"https://pith.science/api/pith-number/FTRSBKR7CJQKX46M67AF6FCH24/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FTRSBKR7CJQKX46M67AF6FCH24/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FTRSBKR7CJQKX46M67AF6FCH24/action/storage_attestation","attest_author":"https://pith.science/pith/FTRSBKR7CJQKX46M67AF6FCH24/action/author_attestation","sign_citation":"https://pith.science/pith/FTRSBKR7CJQKX46M67AF6FCH24/action/citation_signature","submit_replication":"https://pith.science/pith/FTRSBKR7CJQKX46M67AF6FCH24/action/replication_record"}},"created_at":"2026-07-05T09:49:22.018196+00:00","updated_at":"2026-07-05T09:49:22.018196+00:00"}