{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:M25QEYEMROAOFRPEUDNN77UWVI","short_pith_number":"pith:M25QEYEM","canonical_record":{"source":{"id":"1305.1598","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-07T18:13:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2eebbf990e1eaa028634a7ffacc94f294ec7d0e2ea1b65ea99083eb8d71470e3","abstract_canon_sha256":"898aee5676f63f7216ed0c14bac69bd5f200a6aea031997f9642c1c4e9bbc3be"},"schema_version":"1.0"},"canonical_sha256":"66bb02608c8b80e2c5e4a0dadffe96aa1280fe357217f944a53ce965f0bac5bf","source":{"kind":"arxiv","id":"1305.1598","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.1598","created_at":"2026-05-18T03:26:21Z"},{"alias_kind":"arxiv_version","alias_value":"1305.1598v1","created_at":"2026-05-18T03:26:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1598","created_at":"2026-05-18T03:26:21Z"},{"alias_kind":"pith_short_12","alias_value":"M25QEYEMROAO","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"M25QEYEMROAOFRPE","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"M25QEYEM","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:M25QEYEMROAOFRPEUDNN77UWVI","target":"record","payload":{"canonical_record":{"source":{"id":"1305.1598","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-07T18:13:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2eebbf990e1eaa028634a7ffacc94f294ec7d0e2ea1b65ea99083eb8d71470e3","abstract_canon_sha256":"898aee5676f63f7216ed0c14bac69bd5f200a6aea031997f9642c1c4e9bbc3be"},"schema_version":"1.0"},"canonical_sha256":"66bb02608c8b80e2c5e4a0dadffe96aa1280fe357217f944a53ce965f0bac5bf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:21.214506Z","signature_b64":"iMcU/ksdyPGkUkyNg0SMmbYGQJ3F0zA4VxoDeEdmhF42evz3VCeeuZe8Lz/Q98n214FJtEBypEctJFQA4bReDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66bb02608c8b80e2c5e4a0dadffe96aa1280fe357217f944a53ce965f0bac5bf","last_reissued_at":"2026-05-18T03:26:21.213715Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:21.213715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.1598","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-05-18T03:26:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zgLZiYGsdEVePkAaTyfgW0HEpbJnihGDrGQxCXoSNk8p+/jnLlMPBSW5WvfTapO7q5xZ8wpH52yqn7pIM77nAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T11:02:57.795483Z"},"content_sha256":"a6c076f00e6a10ebb57af455a165285a539694977361fd03b046549d63d2d808","schema_version":"1.0","event_id":"sha256:a6c076f00e6a10ebb57af455a165285a539694977361fd03b046549d63d2d808"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:M25QEYEMROAOFRPEUDNN77UWVI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Abelian Group Codes for Source Coding and Channel Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aria G. Sahebi, S. Sandeep Pradhan","submitted_at":"2013-05-07T18:13:41Z","abstract_excerpt":"In this paper, we study the asymptotic performance of Abelian group codes for the lossy source coding problem for arbitrary discrete (finite alphabet) memoryless sources as well as the channel coding problem for arbitrary discrete (finite alphabet) memoryless channels. For the source coding problem, we derive an achievable rate-distortion function that is characterized in a single-letter information-theoretic form using the ensemble of Abelian group codes. When the underlying group is a field, it simplifies to the symmetric rate-distortion function. Similarly, for the channel coding problem, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1598","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":""},"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-05-18T03:26:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NIVwqSpiILWHkFSSYqIrqYkIs+Hkj+N/FIuvJQzuNx3D4cP+8YZqNFtW7EWYnya2xY+zU3hM2HYZLDG9p9VpCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T11:02:57.796060Z"},"content_sha256":"c09ecc264f657bb4fe25f24963219d1785053e4f2fd223714902a5aadd6d00d0","schema_version":"1.0","event_id":"sha256:c09ecc264f657bb4fe25f24963219d1785053e4f2fd223714902a5aadd6d00d0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M25QEYEMROAOFRPEUDNN77UWVI/bundle.json","state_url":"https://pith.science/pith/M25QEYEMROAOFRPEUDNN77UWVI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M25QEYEMROAOFRPEUDNN77UWVI/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-06-07T11:02:57Z","links":{"resolver":"https://pith.science/pith/M25QEYEMROAOFRPEUDNN77UWVI","bundle":"https://pith.science/pith/M25QEYEMROAOFRPEUDNN77UWVI/bundle.json","state":"https://pith.science/pith/M25QEYEMROAOFRPEUDNN77UWVI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M25QEYEMROAOFRPEUDNN77UWVI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:M25QEYEMROAOFRPEUDNN77UWVI","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":"898aee5676f63f7216ed0c14bac69bd5f200a6aea031997f9642c1c4e9bbc3be","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-07T18:13:41Z","title_canon_sha256":"2eebbf990e1eaa028634a7ffacc94f294ec7d0e2ea1b65ea99083eb8d71470e3"},"schema_version":"1.0","source":{"id":"1305.1598","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.1598","created_at":"2026-05-18T03:26:21Z"},{"alias_kind":"arxiv_version","alias_value":"1305.1598v1","created_at":"2026-05-18T03:26:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1598","created_at":"2026-05-18T03:26:21Z"},{"alias_kind":"pith_short_12","alias_value":"M25QEYEMROAO","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"M25QEYEMROAOFRPE","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"M25QEYEM","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:c09ecc264f657bb4fe25f24963219d1785053e4f2fd223714902a5aadd6d00d0","target":"graph","created_at":"2026-05-18T03:26:21Z","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"},"paper":{"abstract_excerpt":"In this paper, we study the asymptotic performance of Abelian group codes for the lossy source coding problem for arbitrary discrete (finite alphabet) memoryless sources as well as the channel coding problem for arbitrary discrete (finite alphabet) memoryless channels. For the source coding problem, we derive an achievable rate-distortion function that is characterized in a single-letter information-theoretic form using the ensemble of Abelian group codes. When the underlying group is a field, it simplifies to the symmetric rate-distortion function. Similarly, for the channel coding problem, w","authors_text":"Aria G. Sahebi, S. Sandeep Pradhan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-07T18:13:41Z","title":"Abelian Group Codes for Source Coding and Channel Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1598","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:a6c076f00e6a10ebb57af455a165285a539694977361fd03b046549d63d2d808","target":"record","created_at":"2026-05-18T03:26:21Z","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":"898aee5676f63f7216ed0c14bac69bd5f200a6aea031997f9642c1c4e9bbc3be","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-07T18:13:41Z","title_canon_sha256":"2eebbf990e1eaa028634a7ffacc94f294ec7d0e2ea1b65ea99083eb8d71470e3"},"schema_version":"1.0","source":{"id":"1305.1598","kind":"arxiv","version":1}},"canonical_sha256":"66bb02608c8b80e2c5e4a0dadffe96aa1280fe357217f944a53ce965f0bac5bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"66bb02608c8b80e2c5e4a0dadffe96aa1280fe357217f944a53ce965f0bac5bf","first_computed_at":"2026-05-18T03:26:21.213715Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:21.213715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iMcU/ksdyPGkUkyNg0SMmbYGQJ3F0zA4VxoDeEdmhF42evz3VCeeuZe8Lz/Q98n214FJtEBypEctJFQA4bReDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:21.214506Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.1598","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a6c076f00e6a10ebb57af455a165285a539694977361fd03b046549d63d2d808","sha256:c09ecc264f657bb4fe25f24963219d1785053e4f2fd223714902a5aadd6d00d0"],"state_sha256":"7f8931c49f3fa88e2c59ffb1927c07e1d641b4900804afca20d1a0b82315c53b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n+7+Bml5WM3x+R7H4wEt1YD3h49arWb8SRt0vNfaLljL68+H3aId8JFzHx3YuTYuiaKwoTmQguZhgUdTX/PbCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T11:02:57.798988Z","bundle_sha256":"213ba183179b6a1b33dfc4dd23bd4c19a55fa955dbf9483a9fce9c75a33bec3e"}}