{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:Q6LMV4DBAGJ2UD4XAHNTDMI7GE","short_pith_number":"pith:Q6LMV4DB","canonical_record":{"source":{"id":"1609.04360","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-14T17:52:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"84a9b4a2ee3765ce00d2a4712befe94306e5a608d4cebad406ee730afc664693","abstract_canon_sha256":"8c60bc9504e0e6fc66e5d4f78a9b845cec8e2221b0d47b646169f2a666a2aed4"},"schema_version":"1.0"},"canonical_sha256":"8796caf0610193aa0f9701db31b11f31308516f9c692cd5fc1647f8b07d94fd8","source":{"kind":"arxiv","id":"1609.04360","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.04360","created_at":"2026-05-18T00:58:09Z"},{"alias_kind":"arxiv_version","alias_value":"1609.04360v1","created_at":"2026-05-18T00:58:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.04360","created_at":"2026-05-18T00:58:09Z"},{"alias_kind":"pith_short_12","alias_value":"Q6LMV4DBAGJ2","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"Q6LMV4DBAGJ2UD4X","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"Q6LMV4DB","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:Q6LMV4DBAGJ2UD4XAHNTDMI7GE","target":"record","payload":{"canonical_record":{"source":{"id":"1609.04360","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-14T17:52:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"84a9b4a2ee3765ce00d2a4712befe94306e5a608d4cebad406ee730afc664693","abstract_canon_sha256":"8c60bc9504e0e6fc66e5d4f78a9b845cec8e2221b0d47b646169f2a666a2aed4"},"schema_version":"1.0"},"canonical_sha256":"8796caf0610193aa0f9701db31b11f31308516f9c692cd5fc1647f8b07d94fd8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:09.196928Z","signature_b64":"+yUss+Ng6Z2koVQhNmOHAbp6cbHtQZ+3+CZnnVHO6LK2bRialw5wZBQDRQEo2cAuhZ+hsyNWttVSgaaYwrsLDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8796caf0610193aa0f9701db31b11f31308516f9c692cd5fc1647f8b07d94fd8","last_reissued_at":"2026-05-18T00:58:09.196428Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:09.196428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.04360","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-18T00:58:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xKbwMyB+f/Dsg5CltHgEWXPQTd9nioxeM2JJd6F62gNMlXq1+1znRVS/nb+H8wJGn8kQg7fGLgtsjt3F+GfHBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:15:14.147338Z"},"content_sha256":"83ea773069c8b0e01801889e7e751535c8acdba3919faea1b91a69244e8bf747","schema_version":"1.0","event_id":"sha256:83ea773069c8b0e01801889e7e751535c8acdba3919faea1b91a69244e8bf747"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:Q6LMV4DBAGJ2UD4XAHNTDMI7GE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How to Compute Modulo Prime-Power Sums","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mohsen Heidari, S. Sandeep Pradhan","submitted_at":"2016-09-14T17:52:26Z","abstract_excerpt":"The problem of computing modulo prime-power sums is investigated in distributed source coding as well as computation over Multiple-Access Channel (MAC). We build upon group codes and present a new class of codes called Quasi Group Codes (QGC). A QGC is a subset of a group code. These codes are not closed under the group addition. We investigate some properties of QGC's, and provide a packing and a covering bound. Next, we use these bounds to derived achievable rates for distributed source coding as well as computation over MAC. We show that strict improvements over the previously known schemes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.04360","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-18T00:58:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o2ABtNiltjzW+tqAH4cBGKHrNyEVW9snNG+1D1855XN1Vh1kTpHsNyH81DM31Hq/nxQuNc7E7sYP4MfgkdBFDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:15:14.147977Z"},"content_sha256":"2b8627356db73b24d39e24202abb5b6d8b6e655e66c5ba41ecd6e8f4fe084b94","schema_version":"1.0","event_id":"sha256:2b8627356db73b24d39e24202abb5b6d8b6e655e66c5ba41ecd6e8f4fe084b94"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q6LMV4DBAGJ2UD4XAHNTDMI7GE/bundle.json","state_url":"https://pith.science/pith/Q6LMV4DBAGJ2UD4XAHNTDMI7GE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q6LMV4DBAGJ2UD4XAHNTDMI7GE/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-07T14:15:14Z","links":{"resolver":"https://pith.science/pith/Q6LMV4DBAGJ2UD4XAHNTDMI7GE","bundle":"https://pith.science/pith/Q6LMV4DBAGJ2UD4XAHNTDMI7GE/bundle.json","state":"https://pith.science/pith/Q6LMV4DBAGJ2UD4XAHNTDMI7GE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q6LMV4DBAGJ2UD4XAHNTDMI7GE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:Q6LMV4DBAGJ2UD4XAHNTDMI7GE","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":"8c60bc9504e0e6fc66e5d4f78a9b845cec8e2221b0d47b646169f2a666a2aed4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-14T17:52:26Z","title_canon_sha256":"84a9b4a2ee3765ce00d2a4712befe94306e5a608d4cebad406ee730afc664693"},"schema_version":"1.0","source":{"id":"1609.04360","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.04360","created_at":"2026-05-18T00:58:09Z"},{"alias_kind":"arxiv_version","alias_value":"1609.04360v1","created_at":"2026-05-18T00:58:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.04360","created_at":"2026-05-18T00:58:09Z"},{"alias_kind":"pith_short_12","alias_value":"Q6LMV4DBAGJ2","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"Q6LMV4DBAGJ2UD4X","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"Q6LMV4DB","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:2b8627356db73b24d39e24202abb5b6d8b6e655e66c5ba41ecd6e8f4fe084b94","target":"graph","created_at":"2026-05-18T00:58:09Z","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":"The problem of computing modulo prime-power sums is investigated in distributed source coding as well as computation over Multiple-Access Channel (MAC). We build upon group codes and present a new class of codes called Quasi Group Codes (QGC). A QGC is a subset of a group code. These codes are not closed under the group addition. We investigate some properties of QGC's, and provide a packing and a covering bound. Next, we use these bounds to derived achievable rates for distributed source coding as well as computation over MAC. We show that strict improvements over the previously known schemes","authors_text":"Mohsen Heidari, S. Sandeep Pradhan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-14T17:52:26Z","title":"How to Compute Modulo Prime-Power Sums"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.04360","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:83ea773069c8b0e01801889e7e751535c8acdba3919faea1b91a69244e8bf747","target":"record","created_at":"2026-05-18T00:58:09Z","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":"8c60bc9504e0e6fc66e5d4f78a9b845cec8e2221b0d47b646169f2a666a2aed4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-14T17:52:26Z","title_canon_sha256":"84a9b4a2ee3765ce00d2a4712befe94306e5a608d4cebad406ee730afc664693"},"schema_version":"1.0","source":{"id":"1609.04360","kind":"arxiv","version":1}},"canonical_sha256":"8796caf0610193aa0f9701db31b11f31308516f9c692cd5fc1647f8b07d94fd8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8796caf0610193aa0f9701db31b11f31308516f9c692cd5fc1647f8b07d94fd8","first_computed_at":"2026-05-18T00:58:09.196428Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:09.196428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+yUss+Ng6Z2koVQhNmOHAbp6cbHtQZ+3+CZnnVHO6LK2bRialw5wZBQDRQEo2cAuhZ+hsyNWttVSgaaYwrsLDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:09.196928Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.04360","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83ea773069c8b0e01801889e7e751535c8acdba3919faea1b91a69244e8bf747","sha256:2b8627356db73b24d39e24202abb5b6d8b6e655e66c5ba41ecd6e8f4fe084b94"],"state_sha256":"33d205153a237a5764a6dbf1a7743a870ef4b7bdce2b77dab8e4816c6926e410"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WAIz1bHkA0zxmmIpD3JvInWiYodchiD9JvSgQTJbByrcTdZ9KCbA9HCJKG9nSkzo8w6srDMgTplXMsp4xY8yDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T14:15:14.152524Z","bundle_sha256":"0b885896adc15d2025e49ee37f743d2856c266ef2599836ebc88175720ae2668"}}