{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:6WJVDM3VOOUXRUZLI5B223YRG3","short_pith_number":"pith:6WJVDM3V","canonical_record":{"source":{"id":"2601.22002","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2026-01-29T17:12:46Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"fa7ea1ba75428013a2c8ee3348e568df725787f7e69f5c14286ee8e88d834550","abstract_canon_sha256":"cb79855f0642aa9df7a60d56a819c0024a5725f78487d7348e8bb0a9f3f15756"},"schema_version":"1.0"},"canonical_sha256":"f59351b37573a978d32b4743ad6f1136fc8d2618d01cd9925b9b095cb2ad36eb","source":{"kind":"arxiv","id":"2601.22002","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.22002","created_at":"2026-06-23T01:12:00Z"},{"alias_kind":"arxiv_version","alias_value":"2601.22002v4","created_at":"2026-06-23T01:12:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.22002","created_at":"2026-06-23T01:12:00Z"},{"alias_kind":"pith_short_12","alias_value":"6WJVDM3VOOUX","created_at":"2026-06-23T01:12:00Z"},{"alias_kind":"pith_short_16","alias_value":"6WJVDM3VOOUXRUZL","created_at":"2026-06-23T01:12:00Z"},{"alias_kind":"pith_short_8","alias_value":"6WJVDM3V","created_at":"2026-06-23T01:12:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:6WJVDM3VOOUXRUZLI5B223YRG3","target":"record","payload":{"canonical_record":{"source":{"id":"2601.22002","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2026-01-29T17:12:46Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"fa7ea1ba75428013a2c8ee3348e568df725787f7e69f5c14286ee8e88d834550","abstract_canon_sha256":"cb79855f0642aa9df7a60d56a819c0024a5725f78487d7348e8bb0a9f3f15756"},"schema_version":"1.0"},"canonical_sha256":"f59351b37573a978d32b4743ad6f1136fc8d2618d01cd9925b9b095cb2ad36eb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T01:12:00.617677Z","signature_b64":"R98aO/UybbMGFGu4evehLcflBGkhzaKpsSwj0IkUJkjncOcFQO2//fuxT+5m+2tZdXKDlTBXGb5+q1wQZxJuBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f59351b37573a978d32b4743ad6f1136fc8d2618d01cd9925b9b095cb2ad36eb","last_reissued_at":"2026-06-23T01:12:00.617065Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T01:12:00.617065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2601.22002","source_version":4,"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-06-23T01:12:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PdSBoDaQeuii7KvR5CENU3qgyGH1exUEi/JIv8HGp5d//kSf1QgtYzorhG3liq+zziNOAPTQSZC+HUTxmAL9Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T23:34:12.656585Z"},"content_sha256":"f15729ad6d75fbbad39358f9805b47ba04bcbf5fb599696ade2d775ecfee6298","schema_version":"1.0","event_id":"sha256:f15729ad6d75fbbad39358f9805b47ba04bcbf5fb599696ade2d775ecfee6298"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:6WJVDM3VOOUXRUZLI5B223YRG3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rate-Distortion Optimization for Transformer Inference","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"A rate-distortion framework lets transformers compress intermediate representations to cut inference bitrate while preserving accuracy.","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.LG","authors_text":"Alon Harell, Anderson de Andrade, Ivan V. Baji\\'c","submitted_at":"2026-01-29T17:12:46Z","abstract_excerpt":"Transformers achieve superior performance on many tasks, but impose heavy compute and memory requirements during inference. This inference can be made more efficient by partitioning the process across multiple devices, which, in turn, requires compressing its intermediate representations. We introduce a principled rate-distortion-based framework for lossy compression that learns compact encodings that explicitly trade bitrate for accuracy. Experiments on language benchmarks show that the simplest of the proposed codecs achieves substantial rate savings, outperforming more complex methods. We c"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"The simplest of the proposed codecs achieves substantial rate savings, outperforming more complex methods, and empirical rates for different architectures and tasks are driven by the derived information-theoretic bounds on achievable rate.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the learned compression of intermediate representations preserves downstream task accuracy sufficiently for the rate-distortion tradeoff to remain useful in practice, without the paper specifying how accuracy degradation is measured across all possible splits.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A rate-distortion framework for lossy compression of transformer representations yields substantial bitrate savings on language tasks while preserving accuracy, with observed rates aligning to derived information-theoretic bounds.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A rate-distortion framework lets transformers compress intermediate representations to cut inference bitrate while preserving accuracy.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"bf84b1fc1ca63fdbbe079415e43a42c07a33c16567d31ab5aae73e59596eefc4"},"source":{"id":"2601.22002","kind":"arxiv","version":4},"verdict":{"id":"6994b3bb-3359-4393-bcb9-963e940c8b6b","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-16T09:59:19.961201Z","strongest_claim":"The simplest of the proposed codecs achieves substantial rate savings, outperforming more complex methods, and empirical rates for different architectures and tasks are driven by the derived information-theoretic bounds on achievable rate.","one_line_summary":"A rate-distortion framework for lossy compression of transformer representations yields substantial bitrate savings on language tasks while preserving accuracy, with observed rates aligning to derived information-theoretic bounds.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the learned compression of intermediate representations preserves downstream task accuracy sufficiently for the rate-distortion tradeoff to remain useful in practice, without the paper specifying how accuracy degradation is measured across all possible splits.","pith_extraction_headline":"A rate-distortion framework lets transformers compress intermediate representations to cut inference bitrate while preserving accuracy."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2601.22002/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":"6994b3bb-3359-4393-bcb9-963e940c8b6b"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-23T01:12:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a1SfXh6LyfqnR9daXtjzMtVzWiNXC9gE48dBqjhjvQscPxsOss/RubFwMZ204mzih2gvEcz0A6MdFtWYw5hRBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T23:34:12.657823Z"},"content_sha256":"9a2b097d02cd04636176e78b0bf93a2c568f8f078a284152d7017284d12bb541","schema_version":"1.0","event_id":"sha256:9a2b097d02cd04636176e78b0bf93a2c568f8f078a284152d7017284d12bb541"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6WJVDM3VOOUXRUZLI5B223YRG3/bundle.json","state_url":"https://pith.science/pith/6WJVDM3VOOUXRUZLI5B223YRG3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6WJVDM3VOOUXRUZLI5B223YRG3/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-04T23:34:12Z","links":{"resolver":"https://pith.science/pith/6WJVDM3VOOUXRUZLI5B223YRG3","bundle":"https://pith.science/pith/6WJVDM3VOOUXRUZLI5B223YRG3/bundle.json","state":"https://pith.science/pith/6WJVDM3VOOUXRUZLI5B223YRG3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6WJVDM3VOOUXRUZLI5B223YRG3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:6WJVDM3VOOUXRUZLI5B223YRG3","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":"cb79855f0642aa9df7a60d56a819c0024a5725f78487d7348e8bb0a9f3f15756","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2026-01-29T17:12:46Z","title_canon_sha256":"fa7ea1ba75428013a2c8ee3348e568df725787f7e69f5c14286ee8e88d834550"},"schema_version":"1.0","source":{"id":"2601.22002","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.22002","created_at":"2026-06-23T01:12:00Z"},{"alias_kind":"arxiv_version","alias_value":"2601.22002v4","created_at":"2026-06-23T01:12:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.22002","created_at":"2026-06-23T01:12:00Z"},{"alias_kind":"pith_short_12","alias_value":"6WJVDM3VOOUX","created_at":"2026-06-23T01:12:00Z"},{"alias_kind":"pith_short_16","alias_value":"6WJVDM3VOOUXRUZL","created_at":"2026-06-23T01:12:00Z"},{"alias_kind":"pith_short_8","alias_value":"6WJVDM3V","created_at":"2026-06-23T01:12:00Z"}],"graph_snapshots":[{"event_id":"sha256:9a2b097d02cd04636176e78b0bf93a2c568f8f078a284152d7017284d12bb541","target":"graph","created_at":"2026-06-23T01:12:00Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"The simplest of the proposed codecs achieves substantial rate savings, outperforming more complex methods, and empirical rates for different architectures and tasks are driven by the derived information-theoretic bounds on achievable rate."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the learned compression of intermediate representations preserves downstream task accuracy sufficiently for the rate-distortion tradeoff to remain useful in practice, without the paper specifying how accuracy degradation is measured across all possible splits."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A rate-distortion framework for lossy compression of transformer representations yields substantial bitrate savings on language tasks while preserving accuracy, with observed rates aligning to derived information-theoretic bounds."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A rate-distortion framework lets transformers compress intermediate representations to cut inference bitrate while preserving accuracy."}],"snapshot_sha256":"bf84b1fc1ca63fdbbe079415e43a42c07a33c16567d31ab5aae73e59596eefc4"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2601.22002/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Transformers achieve superior performance on many tasks, but impose heavy compute and memory requirements during inference. This inference can be made more efficient by partitioning the process across multiple devices, which, in turn, requires compressing its intermediate representations. We introduce a principled rate-distortion-based framework for lossy compression that learns compact encodings that explicitly trade bitrate for accuracy. Experiments on language benchmarks show that the simplest of the proposed codecs achieves substantial rate savings, outperforming more complex methods. We c","authors_text":"Alon Harell, Anderson de Andrade, Ivan V. Baji\\'c","cross_cats":["cs.IT","math.IT"],"headline":"A rate-distortion framework lets transformers compress intermediate representations to cut inference bitrate while preserving accuracy.","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2026-01-29T17:12:46Z","title":"Rate-Distortion Optimization for Transformer Inference"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.22002","kind":"arxiv","version":4},"verdict":{"created_at":"2026-05-16T09:59:19.961201Z","id":"6994b3bb-3359-4393-bcb9-963e940c8b6b","model_set":{"reader":"grok-4.3"},"one_line_summary":"A rate-distortion framework for lossy compression of transformer representations yields substantial bitrate savings on language tasks while preserving accuracy, with observed rates aligning to derived information-theoretic bounds.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A rate-distortion framework lets transformers compress intermediate representations to cut inference bitrate while preserving accuracy.","strongest_claim":"The simplest of the proposed codecs achieves substantial rate savings, outperforming more complex methods, and empirical rates for different architectures and tasks are driven by the derived information-theoretic bounds on achievable rate.","weakest_assumption":"That the learned compression of intermediate representations preserves downstream task accuracy sufficiently for the rate-distortion tradeoff to remain useful in practice, without the paper specifying how accuracy degradation is measured across all possible splits."}},"verdict_id":"6994b3bb-3359-4393-bcb9-963e940c8b6b"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f15729ad6d75fbbad39358f9805b47ba04bcbf5fb599696ade2d775ecfee6298","target":"record","created_at":"2026-06-23T01:12:00Z","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":"cb79855f0642aa9df7a60d56a819c0024a5725f78487d7348e8bb0a9f3f15756","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2026-01-29T17:12:46Z","title_canon_sha256":"fa7ea1ba75428013a2c8ee3348e568df725787f7e69f5c14286ee8e88d834550"},"schema_version":"1.0","source":{"id":"2601.22002","kind":"arxiv","version":4}},"canonical_sha256":"f59351b37573a978d32b4743ad6f1136fc8d2618d01cd9925b9b095cb2ad36eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f59351b37573a978d32b4743ad6f1136fc8d2618d01cd9925b9b095cb2ad36eb","first_computed_at":"2026-06-23T01:12:00.617065Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-23T01:12:00.617065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R98aO/UybbMGFGu4evehLcflBGkhzaKpsSwj0IkUJkjncOcFQO2//fuxT+5m+2tZdXKDlTBXGb5+q1wQZxJuBQ==","signature_status":"signed_v1","signed_at":"2026-06-23T01:12:00.617677Z","signed_message":"canonical_sha256_bytes"},"source_id":"2601.22002","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f15729ad6d75fbbad39358f9805b47ba04bcbf5fb599696ade2d775ecfee6298","sha256:9a2b097d02cd04636176e78b0bf93a2c568f8f078a284152d7017284d12bb541"],"state_sha256":"c86f7718bc45a441da6536e615f2ee8e10b8b5bc55862a886f6073e0ec0ab521"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kCyfld9GCjNiHyNF+IQk98XGgW5ghCo1FpfHy7pWd18D62nd3bZI0p8MmubSvd7RyYJFhadZb87k7huGYGqEAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T23:34:12.666056Z","bundle_sha256":"d28d3a8ad8843b2673ed0a64b180e55d07858f65e1211fd20e17c18a94f96c11"}}