{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:6SPVEIWYYJWQEGN7CURATU2VCX","short_pith_number":"pith:6SPVEIWY","schema_version":"1.0","canonical_sha256":"f49f5222d8c26d0219bf152209d35515cc548fa2a43af3b4d9ccb8e252bc5042","source":{"kind":"arxiv","id":"1108.3887","version":1},"attestation_state":"computed","paper":{"title":"Hamming Weights in Irreducible Cyclic Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cunsheng Ding, Jing Yang","submitted_at":"2011-08-19T03:55:37Z","abstract_excerpt":"Irreducible cyclic codes are an interesting type of codes and have applications in space communications. They have been studied for decades and a lot of progress has been made. The objectives of this paper are to survey and extend earlier results on the weight distributions of irreducible cyclic codes, present a divisibility theorem and develop bounds on the weights in irreducible cyclic codes."},"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":"1108.3887","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-19T03:55:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a9eda76347a78b05e6d3c4ec3229ab6af2761e272d748d7310f459be93b8e9d3","abstract_canon_sha256":"802ea7e6f594b4715de731c286c34d23aa7442445dac6a4ed1d38a74f3cd3482"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:15:06.140258Z","signature_b64":"TKoDpZw2Ib8FxIB/qmeOLL7GQnxLS1cmcN7aCA/vVczI0paxEF+copRERuFGDz/2meXqKBEVZ1HsDSXHb3q7Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f49f5222d8c26d0219bf152209d35515cc548fa2a43af3b4d9ccb8e252bc5042","last_reissued_at":"2026-05-18T04:15:06.139601Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:15:06.139601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hamming Weights in Irreducible Cyclic Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cunsheng Ding, Jing Yang","submitted_at":"2011-08-19T03:55:37Z","abstract_excerpt":"Irreducible cyclic codes are an interesting type of codes and have applications in space communications. They have been studied for decades and a lot of progress has been made. The objectives of this paper are to survey and extend earlier results on the weight distributions of irreducible cyclic codes, present a divisibility theorem and develop bounds on the weights in irreducible cyclic codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.3887","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":"1108.3887","created_at":"2026-05-18T04:15:06.139703+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.3887v1","created_at":"2026-05-18T04:15:06.139703+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.3887","created_at":"2026-05-18T04:15:06.139703+00:00"},{"alias_kind":"pith_short_12","alias_value":"6SPVEIWYYJWQ","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"6SPVEIWYYJWQEGN7","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"6SPVEIWY","created_at":"2026-05-18T12:26:22.705136+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/6SPVEIWYYJWQEGN7CURATU2VCX","json":"https://pith.science/pith/6SPVEIWYYJWQEGN7CURATU2VCX.json","graph_json":"https://pith.science/api/pith-number/6SPVEIWYYJWQEGN7CURATU2VCX/graph.json","events_json":"https://pith.science/api/pith-number/6SPVEIWYYJWQEGN7CURATU2VCX/events.json","paper":"https://pith.science/paper/6SPVEIWY"},"agent_actions":{"view_html":"https://pith.science/pith/6SPVEIWYYJWQEGN7CURATU2VCX","download_json":"https://pith.science/pith/6SPVEIWYYJWQEGN7CURATU2VCX.json","view_paper":"https://pith.science/paper/6SPVEIWY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.3887&json=true","fetch_graph":"https://pith.science/api/pith-number/6SPVEIWYYJWQEGN7CURATU2VCX/graph.json","fetch_events":"https://pith.science/api/pith-number/6SPVEIWYYJWQEGN7CURATU2VCX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6SPVEIWYYJWQEGN7CURATU2VCX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6SPVEIWYYJWQEGN7CURATU2VCX/action/storage_attestation","attest_author":"https://pith.science/pith/6SPVEIWYYJWQEGN7CURATU2VCX/action/author_attestation","sign_citation":"https://pith.science/pith/6SPVEIWYYJWQEGN7CURATU2VCX/action/citation_signature","submit_replication":"https://pith.science/pith/6SPVEIWYYJWQEGN7CURATU2VCX/action/replication_record"}},"created_at":"2026-05-18T04:15:06.139703+00:00","updated_at":"2026-05-18T04:15:06.139703+00:00"}