{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:ZXPAXYND2VJ64R3DR4QP527DTO","short_pith_number":"pith:ZXPAXYND","canonical_record":{"source":{"id":"2502.05741","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2025-02-09T01:57:17Z","cross_cats_sorted":[],"title_canon_sha256":"cd69119e7af09c25c00fb9d1d609e88c93e9f2e4351fcabb4e5acf5d8e5a0f40","abstract_canon_sha256":"4905fb73deca7904ee16fc9e9e9620446fb835600502b173f7a253f8c4567ae7"},"schema_version":"1.0"},"canonical_sha256":"cdde0be1a3d553ee47638f20feebe39bb049b60ac509ca978d8f19463ed235df","source":{"kind":"arxiv","id":"2502.05741","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.05741","created_at":"2026-07-05T10:37:44Z"},{"alias_kind":"arxiv_version","alias_value":"2502.05741v2","created_at":"2026-07-05T10:37:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.05741","created_at":"2026-07-05T10:37:44Z"},{"alias_kind":"pith_short_12","alias_value":"ZXPAXYND2VJ6","created_at":"2026-07-05T10:37:44Z"},{"alias_kind":"pith_short_16","alias_value":"ZXPAXYND2VJ64R3D","created_at":"2026-07-05T10:37:44Z"},{"alias_kind":"pith_short_8","alias_value":"ZXPAXYND","created_at":"2026-07-05T10:37:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:ZXPAXYND2VJ64R3DR4QP527DTO","target":"record","payload":{"canonical_record":{"source":{"id":"2502.05741","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2025-02-09T01:57:17Z","cross_cats_sorted":[],"title_canon_sha256":"cd69119e7af09c25c00fb9d1d609e88c93e9f2e4351fcabb4e5acf5d8e5a0f40","abstract_canon_sha256":"4905fb73deca7904ee16fc9e9e9620446fb835600502b173f7a253f8c4567ae7"},"schema_version":"1.0"},"canonical_sha256":"cdde0be1a3d553ee47638f20feebe39bb049b60ac509ca978d8f19463ed235df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:37:44.149967Z","signature_b64":"1D0nGSs4lA2RaqyHbhhhA3xk9sObFkSNajvcY9S4aDrju1d9txXyhIJbDOmYZCk8DxTdygpwRC6XangkpCxoDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdde0be1a3d553ee47638f20feebe39bb049b60ac509ca978d8f19463ed235df","last_reissued_at":"2026-07-05T10:37:44.149392Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:37:44.149392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.05741","source_version":2,"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-05T10:37:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I9DA998a241U2p3xA+Rxjp6BNWymCzCKvzCfkecR7+ypuxFcWoK6jroE7odvjaS/0EN9TMvJcZMwixUtq9IzCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T07:12:27.745263Z"},"content_sha256":"bff6039b75542114552e408545b70df39ee60653fdea246ed23cf6c1b9a92d9f","schema_version":"1.0","event_id":"sha256:bff6039b75542114552e408545b70df39ee60653fdea246ed23cf6c1b9a92d9f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:ZXPAXYND2VJ64R3DR4QP527DTO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear Attention Modeling for Learned Image Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Donghui Feng, Guo Lu, Hongwei Hu, Li Song, Ronghua Wu, Shen Wang, Zhengxue Cheng","submitted_at":"2025-02-09T01:57:17Z","abstract_excerpt":"Recent years, learned image compression has made tremendous progress to achieve impressive coding efficiency. Its coding gain mainly comes from non-linear neural network-based transform and learnable entropy modeling. However, most studies focus on a strong backbone, and few studies consider a low complexity design. In this paper, we propose LALIC, a linear attention modeling for learned image compression. Specially, we propose to use Bi-RWKV blocks, by utilizing the Spatial Mix and Channel Mix modules to achieve more compact feature extraction, and apply the Conv based Omni-Shift module to ad"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.05741","kind":"arxiv","version":2},"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/2502.05741/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-05T10:37:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KAHf3+Jrt7RC87Iv6+hdzTXgqiKL/AAiCyvK1P+YzYK/JK5JlMC2a1Oh8zUV+2zvvaoFilqfNWCrdhu5mgwJBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T07:12:27.745863Z"},"content_sha256":"4922b1243ddd6ac3dda9ae943d17c693d6b051df3ac2a962110dba4ca5c6ba20","schema_version":"1.0","event_id":"sha256:4922b1243ddd6ac3dda9ae943d17c693d6b051df3ac2a962110dba4ca5c6ba20"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZXPAXYND2VJ64R3DR4QP527DTO/bundle.json","state_url":"https://pith.science/pith/ZXPAXYND2VJ64R3DR4QP527DTO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZXPAXYND2VJ64R3DR4QP527DTO/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-09T07:12:27Z","links":{"resolver":"https://pith.science/pith/ZXPAXYND2VJ64R3DR4QP527DTO","bundle":"https://pith.science/pith/ZXPAXYND2VJ64R3DR4QP527DTO/bundle.json","state":"https://pith.science/pith/ZXPAXYND2VJ64R3DR4QP527DTO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZXPAXYND2VJ64R3DR4QP527DTO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:ZXPAXYND2VJ64R3DR4QP527DTO","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":"4905fb73deca7904ee16fc9e9e9620446fb835600502b173f7a253f8c4567ae7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2025-02-09T01:57:17Z","title_canon_sha256":"cd69119e7af09c25c00fb9d1d609e88c93e9f2e4351fcabb4e5acf5d8e5a0f40"},"schema_version":"1.0","source":{"id":"2502.05741","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.05741","created_at":"2026-07-05T10:37:44Z"},{"alias_kind":"arxiv_version","alias_value":"2502.05741v2","created_at":"2026-07-05T10:37:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.05741","created_at":"2026-07-05T10:37:44Z"},{"alias_kind":"pith_short_12","alias_value":"ZXPAXYND2VJ6","created_at":"2026-07-05T10:37:44Z"},{"alias_kind":"pith_short_16","alias_value":"ZXPAXYND2VJ64R3D","created_at":"2026-07-05T10:37:44Z"},{"alias_kind":"pith_short_8","alias_value":"ZXPAXYND","created_at":"2026-07-05T10:37:44Z"}],"graph_snapshots":[{"event_id":"sha256:4922b1243ddd6ac3dda9ae943d17c693d6b051df3ac2a962110dba4ca5c6ba20","target":"graph","created_at":"2026-07-05T10:37:44Z","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/2502.05741/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Recent years, learned image compression has made tremendous progress to achieve impressive coding efficiency. Its coding gain mainly comes from non-linear neural network-based transform and learnable entropy modeling. However, most studies focus on a strong backbone, and few studies consider a low complexity design. In this paper, we propose LALIC, a linear attention modeling for learned image compression. Specially, we propose to use Bi-RWKV blocks, by utilizing the Spatial Mix and Channel Mix modules to achieve more compact feature extraction, and apply the Conv based Omni-Shift module to ad","authors_text":"Donghui Feng, Guo Lu, Hongwei Hu, Li Song, Ronghua Wu, Shen Wang, Zhengxue Cheng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2025-02-09T01:57:17Z","title":"Linear Attention Modeling for Learned Image Compression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.05741","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:bff6039b75542114552e408545b70df39ee60653fdea246ed23cf6c1b9a92d9f","target":"record","created_at":"2026-07-05T10:37:44Z","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":"4905fb73deca7904ee16fc9e9e9620446fb835600502b173f7a253f8c4567ae7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2025-02-09T01:57:17Z","title_canon_sha256":"cd69119e7af09c25c00fb9d1d609e88c93e9f2e4351fcabb4e5acf5d8e5a0f40"},"schema_version":"1.0","source":{"id":"2502.05741","kind":"arxiv","version":2}},"canonical_sha256":"cdde0be1a3d553ee47638f20feebe39bb049b60ac509ca978d8f19463ed235df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cdde0be1a3d553ee47638f20feebe39bb049b60ac509ca978d8f19463ed235df","first_computed_at":"2026-07-05T10:37:44.149392Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:37:44.149392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1D0nGSs4lA2RaqyHbhhhA3xk9sObFkSNajvcY9S4aDrju1d9txXyhIJbDOmYZCk8DxTdygpwRC6XangkpCxoDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:37:44.149967Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.05741","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bff6039b75542114552e408545b70df39ee60653fdea246ed23cf6c1b9a92d9f","sha256:4922b1243ddd6ac3dda9ae943d17c693d6b051df3ac2a962110dba4ca5c6ba20"],"state_sha256":"01bd876b8ddc1d00b418746ddd277b6439cb42de5324180d2476a25c5a05f94f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M6mXB7FH6odPmoc8vkzNKS0Pm1ijUA4hgw5tk4s9C8Ay/3GTiuHvFCsp/oeij4f/3TXZclbg6PI7liKaTFjHDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T07:12:27.751738Z","bundle_sha256":"4d5652411d99443ec0e6b690f2940752b9bbe930aa2e4381a59f9675ed4d5a29"}}