{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ZUSVGKXJ6G7EJOUODB7GRSORZG","short_pith_number":"pith:ZUSVGKXJ","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"},"canonical_sha256":"cd25532ae9f1be44ba8e187e68c9d1c98afdbff12a593b430fb839b6f191fff6","source":{"kind":"arxiv","id":"1204.2900","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.2900","created_at":"2026-05-18T02:54:56Z"},{"alias_kind":"arxiv_version","alias_value":"1204.2900v2","created_at":"2026-05-18T02:54:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.2900","created_at":"2026-05-18T02:54:56Z"},{"alias_kind":"pith_short_12","alias_value":"ZUSVGKXJ6G7E","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZUSVGKXJ6G7EJOUO","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZUSVGKXJ","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ZUSVGKXJ6G7EJOUODB7GRSORZG","target":"record","payload":{"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"},"canonical_sha256":"cd25532ae9f1be44ba8e187e68c9d1c98afdbff12a593b430fb839b6f191fff6","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"},"source_kind":"arxiv","source_id":"1204.2900","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:54:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Le9eH2yCQJgHeYCq8ZmAf/S9g7jRF5kqpsauuBYdWnyuQWHg8EFthg5zy88J1jHMHXCGlXQsaxR5i4uXFJYnCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:44:09.278999Z"},"content_sha256":"19f8bd36c655622a2b4a3a319211002f6c915868ebc7558a8c9a1351a0860ca4","schema_version":"1.0","event_id":"sha256:19f8bd36c655622a2b4a3a319211002f6c915868ebc7558a8c9a1351a0860ca4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ZUSVGKXJ6G7EJOUODB7GRSORZG","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:54:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3K5gCD3aAJQxXQ9mW9BUdJWnPjUH62QNDg2rHyH1FIj1l8x658YhXqOtD2P9xpgo73ah8uqborh+21JaQuY/Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:44:09.279760Z"},"content_sha256":"45b83f692b40c657443d33edf80a1c91fef933155024176f786262d2eb98d504","schema_version":"1.0","event_id":"sha256:45b83f692b40c657443d33edf80a1c91fef933155024176f786262d2eb98d504"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZUSVGKXJ6G7EJOUODB7GRSORZG/bundle.json","state_url":"https://pith.science/pith/ZUSVGKXJ6G7EJOUODB7GRSORZG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZUSVGKXJ6G7EJOUODB7GRSORZG/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T09:44:09Z","links":{"resolver":"https://pith.science/pith/ZUSVGKXJ6G7EJOUODB7GRSORZG","bundle":"https://pith.science/pith/ZUSVGKXJ6G7EJOUODB7GRSORZG/bundle.json","state":"https://pith.science/pith/ZUSVGKXJ6G7EJOUODB7GRSORZG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZUSVGKXJ6G7EJOUODB7GRSORZG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ZUSVGKXJ6G7EJOUODB7GRSORZG","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":"964af7b4d62a142e84aaf13e0d8f073a7e142eb288b87deded9d140c04d27ce8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-13T07:08:54Z","title_canon_sha256":"69b6d04a54f8567419fdad7626e41bf9ba3c6e38cf81c3dcadfdc9cba3262b04"},"schema_version":"1.0","source":{"id":"1204.2900","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.2900","created_at":"2026-05-18T02:54:56Z"},{"alias_kind":"arxiv_version","alias_value":"1204.2900v2","created_at":"2026-05-18T02:54:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.2900","created_at":"2026-05-18T02:54:56Z"},{"alias_kind":"pith_short_12","alias_value":"ZUSVGKXJ6G7E","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZUSVGKXJ6G7EJOUO","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZUSVGKXJ","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:45b83f692b40c657443d33edf80a1c91fef933155024176f786262d2eb98d504","target":"graph","created_at":"2026-05-18T02:54:56Z","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":"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.","authors_text":"Cheryl E. Praeger, Neil I. Gillespie","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-13T07:08:54Z","title":"Diagonally Neighbour Transitive Codes and Frequency Permutation Arrays"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.2900","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:19f8bd36c655622a2b4a3a319211002f6c915868ebc7558a8c9a1351a0860ca4","target":"record","created_at":"2026-05-18T02:54:56Z","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":"964af7b4d62a142e84aaf13e0d8f073a7e142eb288b87deded9d140c04d27ce8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-13T07:08:54Z","title_canon_sha256":"69b6d04a54f8567419fdad7626e41bf9ba3c6e38cf81c3dcadfdc9cba3262b04"},"schema_version":"1.0","source":{"id":"1204.2900","kind":"arxiv","version":2}},"canonical_sha256":"cd25532ae9f1be44ba8e187e68c9d1c98afdbff12a593b430fb839b6f191fff6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd25532ae9f1be44ba8e187e68c9d1c98afdbff12a593b430fb839b6f191fff6","first_computed_at":"2026-05-18T02:54:56.560006Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:56.560006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+iDYd/mlvxmp6PsWHRupB6Ov5l5S9oQ3O42F3HPNtzYlIXcAhYY1C3U7MsrNGD+ty67uWGfC8aq4jpiyNo86Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:56.560548Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.2900","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:19f8bd36c655622a2b4a3a319211002f6c915868ebc7558a8c9a1351a0860ca4","sha256:45b83f692b40c657443d33edf80a1c91fef933155024176f786262d2eb98d504"],"state_sha256":"77d7460096f8205bdc44c12b86925e8ee443b5e36858cfef4d27bfe5f5028bbc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xyo2dYdgt5sn2c+IzRhpNFamDwlROaHFOnpvFCksQ12UKZKzksJL4c/w0yotHUK3sX7Pqw3B7696D2tnFCW2BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T09:44:09.283852Z","bundle_sha256":"1f45f865a4749a0c392a8abc935749428933fa6cc3b2075cab5c79aefc116ff0"}}