{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:ZUSVGKXJ6G7EJOUODB7GRSORZG","short_pith_number":"pith:ZUSVGKXJ","schema_version":"1.0","canonical_sha256":"cd25532ae9f1be44ba8e187e68c9d1c98afdbff12a593b430fb839b6f191fff6","source":{"kind":"arxiv","id":"1204.2900","version":2},"attestation_state":"computed","paper":{"title":"Diagonally Neighbour Transitive Codes and Frequency Permutation Arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cheryl E. Praeger, Neil I. Gillespie","submitted_at":"2012-04-13T07:08:54Z","abstract_excerpt":"Constant composition codes have been proposed as suitable coding schemes to solve the narrow band and impulse noise problems associated with powerline communication. In particular, a certain class of constant composition codes called frequency permutation arrays have been suggested as ideal, in some sense, for these purposes. In this paper we characterise a family of neighbour transitive codes in Hamming graphs in which frequency permutation arrays play a central rode. We also classify all the permutation codes generated by groups in this family."},"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":"1204.2900","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-13T07:08:54Z","cross_cats_sorted":[],"title_canon_sha256":"69b6d04a54f8567419fdad7626e41bf9ba3c6e38cf81c3dcadfdc9cba3262b04","abstract_canon_sha256":"964af7b4d62a142e84aaf13e0d8f073a7e142eb288b87deded9d140c04d27ce8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:56.560548Z","signature_b64":"+iDYd/mlvxmp6PsWHRupB6Ov5l5S9oQ3O42F3HPNtzYlIXcAhYY1C3U7MsrNGD+ty67uWGfC8aq4jpiyNo86Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd25532ae9f1be44ba8e187e68c9d1c98afdbff12a593b430fb839b6f191fff6","last_reissued_at":"2026-05-18T02:54:56.560006Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:56.560006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Diagonally Neighbour Transitive Codes and Frequency Permutation Arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cheryl E. Praeger, Neil I. Gillespie","submitted_at":"2012-04-13T07:08:54Z","abstract_excerpt":"Constant composition codes have been proposed as suitable coding schemes to solve the narrow band and impulse noise problems associated with powerline communication. In particular, a certain class of constant composition codes called frequency permutation arrays have been suggested as ideal, in some sense, for these purposes. In this paper we characterise a family of neighbour transitive codes in Hamming graphs in which frequency permutation arrays play a central rode. We also classify all the permutation codes generated by groups in this family."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.2900","kind":"arxiv","version":2},"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":"1204.2900","created_at":"2026-05-18T02:54:56.560097+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.2900v2","created_at":"2026-05-18T02:54:56.560097+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.2900","created_at":"2026-05-18T02:54:56.560097+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZUSVGKXJ6G7E","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZUSVGKXJ6G7EJOUO","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZUSVGKXJ","created_at":"2026-05-18T12:27:30.460161+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/ZUSVGKXJ6G7EJOUODB7GRSORZG","json":"https://pith.science/pith/ZUSVGKXJ6G7EJOUODB7GRSORZG.json","graph_json":"https://pith.science/api/pith-number/ZUSVGKXJ6G7EJOUODB7GRSORZG/graph.json","events_json":"https://pith.science/api/pith-number/ZUSVGKXJ6G7EJOUODB7GRSORZG/events.json","paper":"https://pith.science/paper/ZUSVGKXJ"},"agent_actions":{"view_html":"https://pith.science/pith/ZUSVGKXJ6G7EJOUODB7GRSORZG","download_json":"https://pith.science/pith/ZUSVGKXJ6G7EJOUODB7GRSORZG.json","view_paper":"https://pith.science/paper/ZUSVGKXJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.2900&json=true","fetch_graph":"https://pith.science/api/pith-number/ZUSVGKXJ6G7EJOUODB7GRSORZG/graph.json","fetch_events":"https://pith.science/api/pith-number/ZUSVGKXJ6G7EJOUODB7GRSORZG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZUSVGKXJ6G7EJOUODB7GRSORZG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZUSVGKXJ6G7EJOUODB7GRSORZG/action/storage_attestation","attest_author":"https://pith.science/pith/ZUSVGKXJ6G7EJOUODB7GRSORZG/action/author_attestation","sign_citation":"https://pith.science/pith/ZUSVGKXJ6G7EJOUODB7GRSORZG/action/citation_signature","submit_replication":"https://pith.science/pith/ZUSVGKXJ6G7EJOUODB7GRSORZG/action/replication_record"}},"created_at":"2026-05-18T02:54:56.560097+00:00","updated_at":"2026-05-18T02:54:56.560097+00:00"}