{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:CX4G62UXXOQWAVI4Y6FHOGWBEP","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":"caf5c8ffd58cfb5e45cde7e2ccee2ec664db5a63024f0db8a09d76e06a12d93b","cross_cats_sorted":["cs.AI","cs.IT","cs.MM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-12-21T14:24:32Z","title_canon_sha256":"fe87149d4fef2d0304498cb786d45611f4858afae5645d990cc0e3f9aab7d536"},"schema_version":"1.0","source":{"id":"2412.16642","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.16642","created_at":"2026-07-05T09:53:47Z"},{"alias_kind":"arxiv_version","alias_value":"2412.16642v2","created_at":"2026-07-05T09:53:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.16642","created_at":"2026-07-05T09:53:47Z"},{"alias_kind":"pith_short_12","alias_value":"CX4G62UXXOQW","created_at":"2026-07-05T09:53:47Z"},{"alias_kind":"pith_short_16","alias_value":"CX4G62UXXOQWAVI4","created_at":"2026-07-05T09:53:47Z"},{"alias_kind":"pith_short_8","alias_value":"CX4G62UX","created_at":"2026-07-05T09:53:47Z"}],"graph_snapshots":[{"event_id":"sha256:69029b6d1dd11feb570033d8ada144311fa6473a535821487ff2e7064b43ebd7","target":"graph","created_at":"2026-07-05T09:53:47Z","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/2412.16642/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Learning-based probabilistic models can be combined with an entropy coder for data compression. However, due to the high complexity of learning-based models, their practical application as text compressors has been largely overlooked. To address this issue, our work focuses on a low-complexity design while maintaining compression performance. We introduce a novel Learned Lossless Low-complexity Text Compression method (L3TC). Specifically, we conduct extensive experiments demonstrating that RWKV models achieve the fastest decoding speed with a moderate compression ratio, making it the most sui","authors_text":"Dajiang Zhou, Guo Lu, Junxuan Zhang, Li Song, Shihao Wang, Yan Zhao, Zhengxue Cheng","cross_cats":["cs.AI","cs.IT","cs.MM","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-12-21T14:24:32Z","title":"L3TC: Leveraging RWKV for Learned Lossless Low-Complexity Text Compression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.16642","kind":"arxiv","version":2},"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:f70186dc091586f6d63eb76362076c279e56b22a3c0a16f48534860964a9d788","target":"record","created_at":"2026-07-05T09:53:47Z","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":"caf5c8ffd58cfb5e45cde7e2ccee2ec664db5a63024f0db8a09d76e06a12d93b","cross_cats_sorted":["cs.AI","cs.IT","cs.MM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-12-21T14:24:32Z","title_canon_sha256":"fe87149d4fef2d0304498cb786d45611f4858afae5645d990cc0e3f9aab7d536"},"schema_version":"1.0","source":{"id":"2412.16642","kind":"arxiv","version":2}},"canonical_sha256":"15f86f6a97bba160551cc78a771ac123faf0e2c8cf198770c27ad9e3e11e6604","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"15f86f6a97bba160551cc78a771ac123faf0e2c8cf198770c27ad9e3e11e6604","first_computed_at":"2026-07-05T09:53:47.599657Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:53:47.599657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YK7/AEGTKdTegHjcuSahsHpY7Y/2eItI0JcTGgT6rHQPgF5mc/EgOPQY5aVldaEAsh7U0Hex/dME/TnKuEE9Dg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:53:47.600171Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.16642","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f70186dc091586f6d63eb76362076c279e56b22a3c0a16f48534860964a9d788","sha256:69029b6d1dd11feb570033d8ada144311fa6473a535821487ff2e7064b43ebd7"],"state_sha256":"c75a7736cb61c4c8dc169917bc1e88ae0d35d66a6ee6a7c1bb374588770c003f"}