{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:A4CDXIQLF5ZFHPXHXBMCEGNPCW","short_pith_number":"pith:A4CDXIQL","canonical_record":{"source":{"id":"1402.5305","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-21T14:39:17Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"d2843d87b0a3947dc0616f55ab2eb0f9369c3e280d5046c79dd46e257ff9517e","abstract_canon_sha256":"a98fd7a774934d6e9ef291f386a86b8b727ac3803161720e2d6628d9d75da7b0"},"schema_version":"1.0"},"canonical_sha256":"07043ba20b2f7253bee7b8582219af15a1e6890f87e2217a5c4625a0fae91cac","source":{"kind":"arxiv","id":"1402.5305","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.5305","created_at":"2026-05-18T02:58:22Z"},{"alias_kind":"arxiv_version","alias_value":"1402.5305v1","created_at":"2026-05-18T02:58:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5305","created_at":"2026-05-18T02:58:22Z"},{"alias_kind":"pith_short_12","alias_value":"A4CDXIQLF5ZF","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"A4CDXIQLF5ZFHPXH","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"A4CDXIQL","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:A4CDXIQLF5ZFHPXHXBMCEGNPCW","target":"record","payload":{"canonical_record":{"source":{"id":"1402.5305","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-21T14:39:17Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"d2843d87b0a3947dc0616f55ab2eb0f9369c3e280d5046c79dd46e257ff9517e","abstract_canon_sha256":"a98fd7a774934d6e9ef291f386a86b8b727ac3803161720e2d6628d9d75da7b0"},"schema_version":"1.0"},"canonical_sha256":"07043ba20b2f7253bee7b8582219af15a1e6890f87e2217a5c4625a0fae91cac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:22.627494Z","signature_b64":"YzckyXZNYweLDh5iTrT18/SFGH0igrjwl/DAXLhuxEuis8Psc8R9NmHUIYv8T9MXbKH+RUEMCgK5Npc/9k0uAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07043ba20b2f7253bee7b8582219af15a1e6890f87e2217a5c4625a0fae91cac","last_reissued_at":"2026-05-18T02:58:22.627011Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:22.627011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.5305","source_version":1,"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:58:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r0R4SRpzHGqrJwgLEx02mm+Y+wLYEEbUj+wEfLRTDfcs4SZCeH0IG95OvHDJCDafP1kXiBdDimoSudlwJKY5Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:20:49.346542Z"},"content_sha256":"732cc5f282112c52dd62c6d9c4a82916a1a318f1be177bddf7e8654350c0fd6b","schema_version":"1.0","event_id":"sha256:732cc5f282112c52dd62c6d9c4a82916a1a318f1be177bddf7e8654350c0fd6b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:A4CDXIQLF5ZFHPXHXBMCEGNPCW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Twisted Permutation Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Cheryl E. Praeger, Neil I. Gillespie, Pablo Spiga","submitted_at":"2014-02-21T14:39:17Z","abstract_excerpt":"We introduce twisted permutation codes, which are frequency permutation arrays analogous to repetition permutation codes, namely, codes obtained from the repetition construction applied to a permutation code. In particular, we show that a lower bound for the minimum distance of a twisted permutation code is the minimum distance of a repetition permutation code. We give examples where this bound is tight, but more importantly, we give examples of twisted permutation codes with minimum distance strictly greater than this lower bound."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5305","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"},"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:58:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XM31RGWCR0/d6LfE8hrD/3xOoaY3gQFyFQxT+DP2LEMJV4Dkw58Ru+Glq4ITJbZ7Lcxq2T/NCAV6Z5V9AwG7Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:20:49.347048Z"},"content_sha256":"bccc104242f46fd250b0238340ad6b93ec5f42e50d7b040cba1f15278a6d9bdc","schema_version":"1.0","event_id":"sha256:bccc104242f46fd250b0238340ad6b93ec5f42e50d7b040cba1f15278a6d9bdc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A4CDXIQLF5ZFHPXHXBMCEGNPCW/bundle.json","state_url":"https://pith.science/pith/A4CDXIQLF5ZFHPXHXBMCEGNPCW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A4CDXIQLF5ZFHPXHXBMCEGNPCW/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-26T08:20:49Z","links":{"resolver":"https://pith.science/pith/A4CDXIQLF5ZFHPXHXBMCEGNPCW","bundle":"https://pith.science/pith/A4CDXIQLF5ZFHPXHXBMCEGNPCW/bundle.json","state":"https://pith.science/pith/A4CDXIQLF5ZFHPXHXBMCEGNPCW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A4CDXIQLF5ZFHPXHXBMCEGNPCW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:A4CDXIQLF5ZFHPXHXBMCEGNPCW","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":"a98fd7a774934d6e9ef291f386a86b8b727ac3803161720e2d6628d9d75da7b0","cross_cats_sorted":["math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-21T14:39:17Z","title_canon_sha256":"d2843d87b0a3947dc0616f55ab2eb0f9369c3e280d5046c79dd46e257ff9517e"},"schema_version":"1.0","source":{"id":"1402.5305","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.5305","created_at":"2026-05-18T02:58:22Z"},{"alias_kind":"arxiv_version","alias_value":"1402.5305v1","created_at":"2026-05-18T02:58:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5305","created_at":"2026-05-18T02:58:22Z"},{"alias_kind":"pith_short_12","alias_value":"A4CDXIQLF5ZF","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"A4CDXIQLF5ZFHPXH","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"A4CDXIQL","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:bccc104242f46fd250b0238340ad6b93ec5f42e50d7b040cba1f15278a6d9bdc","target":"graph","created_at":"2026-05-18T02:58:22Z","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":"We introduce twisted permutation codes, which are frequency permutation arrays analogous to repetition permutation codes, namely, codes obtained from the repetition construction applied to a permutation code. In particular, we show that a lower bound for the minimum distance of a twisted permutation code is the minimum distance of a repetition permutation code. We give examples where this bound is tight, but more importantly, we give examples of twisted permutation codes with minimum distance strictly greater than this lower bound.","authors_text":"Cheryl E. Praeger, Neil I. Gillespie, Pablo Spiga","cross_cats":["math.GR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-21T14:39:17Z","title":"Twisted Permutation Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5305","kind":"arxiv","version":1},"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:732cc5f282112c52dd62c6d9c4a82916a1a318f1be177bddf7e8654350c0fd6b","target":"record","created_at":"2026-05-18T02:58:22Z","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":"a98fd7a774934d6e9ef291f386a86b8b727ac3803161720e2d6628d9d75da7b0","cross_cats_sorted":["math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-21T14:39:17Z","title_canon_sha256":"d2843d87b0a3947dc0616f55ab2eb0f9369c3e280d5046c79dd46e257ff9517e"},"schema_version":"1.0","source":{"id":"1402.5305","kind":"arxiv","version":1}},"canonical_sha256":"07043ba20b2f7253bee7b8582219af15a1e6890f87e2217a5c4625a0fae91cac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"07043ba20b2f7253bee7b8582219af15a1e6890f87e2217a5c4625a0fae91cac","first_computed_at":"2026-05-18T02:58:22.627011Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:58:22.627011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YzckyXZNYweLDh5iTrT18/SFGH0igrjwl/DAXLhuxEuis8Psc8R9NmHUIYv8T9MXbKH+RUEMCgK5Npc/9k0uAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:58:22.627494Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.5305","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:732cc5f282112c52dd62c6d9c4a82916a1a318f1be177bddf7e8654350c0fd6b","sha256:bccc104242f46fd250b0238340ad6b93ec5f42e50d7b040cba1f15278a6d9bdc"],"state_sha256":"56ed515ee61b7ac323574ae3195987c3b390660bd0db37a1896cffb3854137e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MYA9Ttyu2zKrG14tUwL3UQf/Ej19xnCERT5Fr5Kcd4ofDkFNEdZAz3t8WMc1UC03thvheJin9Xmva90EKKEGBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T08:20:49.352332Z","bundle_sha256":"88d32f4490190533bfdedbb62026f787a14f9299303506d2eee6b885faf4f828"}}