{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:TYDK65F67HH5NGC2KGGPLOR7YT","short_pith_number":"pith:TYDK65F6","schema_version":"1.0","canonical_sha256":"9e06af74bef9cfd6985a518cf5ba3fc4fa0fed480068ff8de2c4f3ef367da5ff","source":{"kind":"arxiv","id":"1301.6328","version":1},"attestation_state":"computed","paper":{"title":"Explicit Constructions of Quasi-Uniform Codes from Groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.GR","authors_text":"Eldho K. Thomas, Frederique Oggier","submitted_at":"2013-01-27T07:28:21Z","abstract_excerpt":"We address the question of constructing explicitly quasi-uniform codes from groups. We determine the size of the codebook, the alphabet and the minimum distance as a function of the corresponding group, both for abelian and some nonabelian groups. Potentials applications comprise the design of almost affine codes and non-linear network 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":"1301.6328","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2013-01-27T07:28:21Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"7d66f85e5c73d07eaf6f5a535a226bf98654e1d5de311c6f88bc3e45f3d4654b","abstract_canon_sha256":"afebf752bcf53a26a41fef0084649b16f837082b7b09fd854dafd1b34ef9915b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:15.747101Z","signature_b64":"QB/yBby2UHLl6XYmXYSgxEC/qGK0s8+5D6a0qoCxE5U+KNuq2qEfYwuPh3rjhx1qdnum/Z3oCufooisZtj4wDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e06af74bef9cfd6985a518cf5ba3fc4fa0fed480068ff8de2c4f3ef367da5ff","last_reissued_at":"2026-05-18T03:35:15.746419Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:15.746419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Explicit Constructions of Quasi-Uniform Codes from Groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.GR","authors_text":"Eldho K. Thomas, Frederique Oggier","submitted_at":"2013-01-27T07:28:21Z","abstract_excerpt":"We address the question of constructing explicitly quasi-uniform codes from groups. We determine the size of the codebook, the alphabet and the minimum distance as a function of the corresponding group, both for abelian and some nonabelian groups. Potentials applications comprise the design of almost affine codes and non-linear network codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6328","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":"1301.6328","created_at":"2026-05-18T03:35:15.746529+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.6328v1","created_at":"2026-05-18T03:35:15.746529+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6328","created_at":"2026-05-18T03:35:15.746529+00:00"},{"alias_kind":"pith_short_12","alias_value":"TYDK65F67HH5","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"TYDK65F67HH5NGC2","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"TYDK65F6","created_at":"2026-05-18T12:28:02.375192+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/TYDK65F67HH5NGC2KGGPLOR7YT","json":"https://pith.science/pith/TYDK65F67HH5NGC2KGGPLOR7YT.json","graph_json":"https://pith.science/api/pith-number/TYDK65F67HH5NGC2KGGPLOR7YT/graph.json","events_json":"https://pith.science/api/pith-number/TYDK65F67HH5NGC2KGGPLOR7YT/events.json","paper":"https://pith.science/paper/TYDK65F6"},"agent_actions":{"view_html":"https://pith.science/pith/TYDK65F67HH5NGC2KGGPLOR7YT","download_json":"https://pith.science/pith/TYDK65F67HH5NGC2KGGPLOR7YT.json","view_paper":"https://pith.science/paper/TYDK65F6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.6328&json=true","fetch_graph":"https://pith.science/api/pith-number/TYDK65F67HH5NGC2KGGPLOR7YT/graph.json","fetch_events":"https://pith.science/api/pith-number/TYDK65F67HH5NGC2KGGPLOR7YT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TYDK65F67HH5NGC2KGGPLOR7YT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TYDK65F67HH5NGC2KGGPLOR7YT/action/storage_attestation","attest_author":"https://pith.science/pith/TYDK65F67HH5NGC2KGGPLOR7YT/action/author_attestation","sign_citation":"https://pith.science/pith/TYDK65F67HH5NGC2KGGPLOR7YT/action/citation_signature","submit_replication":"https://pith.science/pith/TYDK65F67HH5NGC2KGGPLOR7YT/action/replication_record"}},"created_at":"2026-05-18T03:35:15.746529+00:00","updated_at":"2026-05-18T03:35:15.746529+00:00"}