{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:6HHPUWOII5CIFDZHJNW3IM4AYL","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":"4913b5b2eb0d2a5ff5fea97460b1044025decac2f568ac6ca022c12ca31e66f6","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-22T11:03:51Z","title_canon_sha256":"d6b01256f5a46ceb82c81d379f08176665ebdbb6e551ba9355c58935085e0a65"},"schema_version":"1.0","source":{"id":"1109.4770","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.4770","created_at":"2026-05-18T04:03:06Z"},{"alias_kind":"arxiv_version","alias_value":"1109.4770v2","created_at":"2026-05-18T04:03:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.4770","created_at":"2026-05-18T04:03:06Z"},{"alias_kind":"pith_short_12","alias_value":"6HHPUWOII5CI","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"6HHPUWOII5CIFDZH","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"6HHPUWOI","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:163680555ecef7ea6dc727a301bd1ee65862086ad086edfd0f3af3fac4a3b801","target":"graph","created_at":"2026-05-18T04:03:06Z","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":"Revisiting an approach by Conway and Sloane we investigate a collection of optimal non-linear binary codes and represent them as (non-linear) codes over Z4. The Fourier transform will be used in order to analyze these codes, which leads to a new algebraic representation involving subgroups of the group of units in a certain ring.\n  One of our results is a new representation of Best's (10, 40, 4) code as a coset of a subgroup in the group of invertible elements of the group ring Z4[Z5]. This yields a particularly simple algebraic decoding algorithm for this code.\n  The technique at hand is furt","authors_text":"Jens Zumbr\\\"agel, Marcus Greferath","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-22T11:03:51Z","title":"On the algebraic representation of selected optimal non-linear binary codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.4770","kind":"arxiv","version":2},"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:6bbf9bca176abfce6ab7243309d6bd93686b2fb58d50904695be583061308f33","target":"record","created_at":"2026-05-18T04:03:06Z","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":"4913b5b2eb0d2a5ff5fea97460b1044025decac2f568ac6ca022c12ca31e66f6","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-22T11:03:51Z","title_canon_sha256":"d6b01256f5a46ceb82c81d379f08176665ebdbb6e551ba9355c58935085e0a65"},"schema_version":"1.0","source":{"id":"1109.4770","kind":"arxiv","version":2}},"canonical_sha256":"f1cefa59c84744828f274b6db43380c2d7cd2beb223a43e8fa388f189dc474fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f1cefa59c84744828f274b6db43380c2d7cd2beb223a43e8fa388f189dc474fa","first_computed_at":"2026-05-18T04:03:06.701862Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:03:06.701862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D7/BUeeB7tVfi9/ZfIjicZw67SkJErpyKdebrgAkEP8PRdM9XlPE7vc9CrQuesTOTW9pUJri30se5e6906q/Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:03:06.702651Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.4770","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6bbf9bca176abfce6ab7243309d6bd93686b2fb58d50904695be583061308f33","sha256:163680555ecef7ea6dc727a301bd1ee65862086ad086edfd0f3af3fac4a3b801"],"state_sha256":"e73cc77b955023b240089c5ee11df09e84bf51b9fee33bca3b49ad75a70d0196"}