{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:HKZJ3COTCFY6RIUGRWNYJ5ZG6D","short_pith_number":"pith:HKZJ3COT","schema_version":"1.0","canonical_sha256":"3ab29d89d31171e8a2868d9b84f726f0e987ecc3d771f0c3f09d85dee4a969ea","source":{"kind":"arxiv","id":"2606.28611","version":1},"attestation_state":"computed","paper":{"title":"Structure of Cayley Codes","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Cheryl E. Praeger, Daniel Rademacher, Vishnuram Arumugam","submitted_at":"2026-06-26T21:11:11Z","abstract_excerpt":"Cayley codes, introduced by Kaufman and Wigderson, are linear codes constructed from a Cayley graph and a smaller linear code. We explore general properties of the class of Cayley codes for finite groups. In particular we give a reduction to Cayley codes for connected Cayley graphs that maintains code properties such as rate, minimum distance and symmetry. Also, for a given Cayley code, we identify a family of symmetric Cayley codes, each associated with a normal edge-transitive Cayley graph, such that the given Cayley code embeds into the direct sum of the symmetric Cayley codes. We analyse s"},"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":"2606.28611","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-26T21:11:11Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"ea61cd0b91193c08f0be0fd7ec7dddd742494e0d496ed7796e24a6520640ea9b","abstract_canon_sha256":"91a0f07256a3a8112ccd1a61fcf04cdcc53af693a8906b181831d677c6e8579c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T00:15:20.547990Z","signature_b64":"12fTLZM25zCUL2t6IIRatkQI3Zj7IomM5YzHnB5ZFPRxe1IrCnx7zNsfqCOZnqcoLEeD6fDVqDzGkxlF8CTjAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ab29d89d31171e8a2868d9b84f726f0e987ecc3d771f0c3f09d85dee4a969ea","last_reissued_at":"2026-06-30T00:15:20.547598Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T00:15:20.547598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structure of Cayley Codes","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Cheryl E. Praeger, Daniel Rademacher, Vishnuram Arumugam","submitted_at":"2026-06-26T21:11:11Z","abstract_excerpt":"Cayley codes, introduced by Kaufman and Wigderson, are linear codes constructed from a Cayley graph and a smaller linear code. We explore general properties of the class of Cayley codes for finite groups. In particular we give a reduction to Cayley codes for connected Cayley graphs that maintains code properties such as rate, minimum distance and symmetry. Also, for a given Cayley code, we identify a family of symmetric Cayley codes, each associated with a normal edge-transitive Cayley graph, such that the given Cayley code embeds into the direct sum of the symmetric Cayley codes. We analyse s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.28611","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.28611/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.28611","created_at":"2026-06-30T00:15:20.547655+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.28611v1","created_at":"2026-06-30T00:15:20.547655+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.28611","created_at":"2026-06-30T00:15:20.547655+00:00"},{"alias_kind":"pith_short_12","alias_value":"HKZJ3COTCFY6","created_at":"2026-06-30T00:15:20.547655+00:00"},{"alias_kind":"pith_short_16","alias_value":"HKZJ3COTCFY6RIUG","created_at":"2026-06-30T00:15:20.547655+00:00"},{"alias_kind":"pith_short_8","alias_value":"HKZJ3COT","created_at":"2026-06-30T00:15:20.547655+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/HKZJ3COTCFY6RIUGRWNYJ5ZG6D","json":"https://pith.science/pith/HKZJ3COTCFY6RIUGRWNYJ5ZG6D.json","graph_json":"https://pith.science/api/pith-number/HKZJ3COTCFY6RIUGRWNYJ5ZG6D/graph.json","events_json":"https://pith.science/api/pith-number/HKZJ3COTCFY6RIUGRWNYJ5ZG6D/events.json","paper":"https://pith.science/paper/HKZJ3COT"},"agent_actions":{"view_html":"https://pith.science/pith/HKZJ3COTCFY6RIUGRWNYJ5ZG6D","download_json":"https://pith.science/pith/HKZJ3COTCFY6RIUGRWNYJ5ZG6D.json","view_paper":"https://pith.science/paper/HKZJ3COT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.28611&json=true","fetch_graph":"https://pith.science/api/pith-number/HKZJ3COTCFY6RIUGRWNYJ5ZG6D/graph.json","fetch_events":"https://pith.science/api/pith-number/HKZJ3COTCFY6RIUGRWNYJ5ZG6D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HKZJ3COTCFY6RIUGRWNYJ5ZG6D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HKZJ3COTCFY6RIUGRWNYJ5ZG6D/action/storage_attestation","attest_author":"https://pith.science/pith/HKZJ3COTCFY6RIUGRWNYJ5ZG6D/action/author_attestation","sign_citation":"https://pith.science/pith/HKZJ3COTCFY6RIUGRWNYJ5ZG6D/action/citation_signature","submit_replication":"https://pith.science/pith/HKZJ3COTCFY6RIUGRWNYJ5ZG6D/action/replication_record"}},"created_at":"2026-06-30T00:15:20.547655+00:00","updated_at":"2026-06-30T00:15:20.547655+00:00"}