{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:A4CDXIQLF5ZFHPXHXBMCEGNPCW","short_pith_number":"pith:A4CDXIQL","schema_version":"1.0","canonical_sha256":"07043ba20b2f7253bee7b8582219af15a1e6890f87e2217a5c4625a0fae91cac","source":{"kind":"arxiv","id":"1402.5305","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1402.5305","created_at":"2026-05-18T02:58:22.627083+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.5305v1","created_at":"2026-05-18T02:58:22.627083+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5305","created_at":"2026-05-18T02:58:22.627083+00:00"},{"alias_kind":"pith_short_12","alias_value":"A4CDXIQLF5ZF","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"A4CDXIQLF5ZFHPXH","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"A4CDXIQL","created_at":"2026-05-18T12:28:19.803747+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/A4CDXIQLF5ZFHPXHXBMCEGNPCW","json":"https://pith.science/pith/A4CDXIQLF5ZFHPXHXBMCEGNPCW.json","graph_json":"https://pith.science/api/pith-number/A4CDXIQLF5ZFHPXHXBMCEGNPCW/graph.json","events_json":"https://pith.science/api/pith-number/A4CDXIQLF5ZFHPXHXBMCEGNPCW/events.json","paper":"https://pith.science/paper/A4CDXIQL"},"agent_actions":{"view_html":"https://pith.science/pith/A4CDXIQLF5ZFHPXHXBMCEGNPCW","download_json":"https://pith.science/pith/A4CDXIQLF5ZFHPXHXBMCEGNPCW.json","view_paper":"https://pith.science/paper/A4CDXIQL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.5305&json=true","fetch_graph":"https://pith.science/api/pith-number/A4CDXIQLF5ZFHPXHXBMCEGNPCW/graph.json","fetch_events":"https://pith.science/api/pith-number/A4CDXIQLF5ZFHPXHXBMCEGNPCW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A4CDXIQLF5ZFHPXHXBMCEGNPCW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A4CDXIQLF5ZFHPXHXBMCEGNPCW/action/storage_attestation","attest_author":"https://pith.science/pith/A4CDXIQLF5ZFHPXHXBMCEGNPCW/action/author_attestation","sign_citation":"https://pith.science/pith/A4CDXIQLF5ZFHPXHXBMCEGNPCW/action/citation_signature","submit_replication":"https://pith.science/pith/A4CDXIQLF5ZFHPXHXBMCEGNPCW/action/replication_record"}},"created_at":"2026-05-18T02:58:22.627083+00:00","updated_at":"2026-05-18T02:58:22.627083+00:00"}