{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FUGFF6CK42Y5PA34VJ6NJ4DVOK","short_pith_number":"pith:FUGFF6CK","schema_version":"1.0","canonical_sha256":"2d0c52f84ae6b1d7837caa7cd4f075728e99369949efd766049445133923b370","source":{"kind":"arxiv","id":"1708.00665","version":1},"attestation_state":"computed","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":"Farhad Shirani, Mohsen Heidari, Sandeep Pradhan","submitted_at":"2017-08-02T09:33:07Z","abstract_excerpt":"A new class of structured codes called Quasi Group Codes (QGC) is introduced. A QGC is a subset of a group code. In contrast with group codes, QGCs are not closed under group addition. The parameters of the QGC can be chosen such that the size of $\\mathcal{C}+\\mathcal{C}$ is equal to any number between $|\\mathcal{C}|$ and $|\\mathcal{C}|^2$ . We analyze the performance of a specific class of QGCs. This class of QGCs is constructed by assigning single-letter distributions to the indices of the codewords in a group code. Then, the QGC is defined as the set of codewords whose index is in the typic"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1708.00665","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-02T09:33:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3f3c0dc221f2b3fca20628a889b87285702f2a73bec9d5216eb29bc1fe2d8f20","abstract_canon_sha256":"95e5955eb48ff61d42c031904901aac97aaf2ae2c094f6c97784d94898f5f37d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:45.077617Z","signature_b64":"UkmpBpikVWYP+uckrsVdz2n1ZDvTWht0A9HZOBFse3XMiCtPZvttoPZVvAjzmRFTOMj9DoFQXpaB/3Xk7QV3Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d0c52f84ae6b1d7837caa7cd4f075728e99369949efd766049445133923b370","last_reissued_at":"2026-05-18T00:38:45.077009Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:45.077009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"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":"Farhad Shirani, Mohsen Heidari, Sandeep Pradhan","submitted_at":"2017-08-02T09:33:07Z","abstract_excerpt":"A new class of structured codes called Quasi Group Codes (QGC) is introduced. A QGC is a subset of a group code. In contrast with group codes, QGCs are not closed under group addition. The parameters of the QGC can be chosen such that the size of $\\mathcal{C}+\\mathcal{C}$ is equal to any number between $|\\mathcal{C}|$ and $|\\mathcal{C}|^2$ . We analyze the performance of a specific class of QGCs. This class of QGCs is constructed by assigning single-letter distributions to the indices of the codewords in a group code. Then, the QGC is defined as the set of codewords whose index is in the typic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00665","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1708.00665","created_at":"2026-05-18T00:38:45.077100+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.00665v1","created_at":"2026-05-18T00:38:45.077100+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00665","created_at":"2026-05-18T00:38:45.077100+00:00"},{"alias_kind":"pith_short_12","alias_value":"FUGFF6CK42Y5","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FUGFF6CK42Y5PA34","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FUGFF6CK","created_at":"2026-05-18T12:31:15.632608+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FUGFF6CK42Y5PA34VJ6NJ4DVOK","json":"https://pith.science/pith/FUGFF6CK42Y5PA34VJ6NJ4DVOK.json","graph_json":"https://pith.science/api/pith-number/FUGFF6CK42Y5PA34VJ6NJ4DVOK/graph.json","events_json":"https://pith.science/api/pith-number/FUGFF6CK42Y5PA34VJ6NJ4DVOK/events.json","paper":"https://pith.science/paper/FUGFF6CK"},"agent_actions":{"view_html":"https://pith.science/pith/FUGFF6CK42Y5PA34VJ6NJ4DVOK","download_json":"https://pith.science/pith/FUGFF6CK42Y5PA34VJ6NJ4DVOK.json","view_paper":"https://pith.science/paper/FUGFF6CK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.00665&json=true","fetch_graph":"https://pith.science/api/pith-number/FUGFF6CK42Y5PA34VJ6NJ4DVOK/graph.json","fetch_events":"https://pith.science/api/pith-number/FUGFF6CK42Y5PA34VJ6NJ4DVOK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FUGFF6CK42Y5PA34VJ6NJ4DVOK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FUGFF6CK42Y5PA34VJ6NJ4DVOK/action/storage_attestation","attest_author":"https://pith.science/pith/FUGFF6CK42Y5PA34VJ6NJ4DVOK/action/author_attestation","sign_citation":"https://pith.science/pith/FUGFF6CK42Y5PA34VJ6NJ4DVOK/action/citation_signature","submit_replication":"https://pith.science/pith/FUGFF6CK42Y5PA34VJ6NJ4DVOK/action/replication_record"}},"created_at":"2026-05-18T00:38:45.077100+00:00","updated_at":"2026-05-18T00:38:45.077100+00:00"}