{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:R62GHSIE3KCN4UQG2ERZAVKVBP","short_pith_number":"pith:R62GHSIE","canonical_record":{"source":{"id":"1701.01044","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-04T15:16:49Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"034a422cebe8cbc9192ff3a5343d82eaf1786180ae4cc513d98fdff60aa2dc7c","abstract_canon_sha256":"e22e2f10c9ea128850e15b45ee4fc940f043f134c48a24af15abcefdb28f420a"},"schema_version":"1.0"},"canonical_sha256":"8fb463c904da84de5206d1239055550bc5858da9ec317ff564e7fb1255a3ffe6","source":{"kind":"arxiv","id":"1701.01044","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.01044","created_at":"2026-05-18T00:53:21Z"},{"alias_kind":"arxiv_version","alias_value":"1701.01044v1","created_at":"2026-05-18T00:53:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.01044","created_at":"2026-05-18T00:53:21Z"},{"alias_kind":"pith_short_12","alias_value":"R62GHSIE3KCN","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"R62GHSIE3KCN4UQG","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"R62GHSIE","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:R62GHSIE3KCN4UQG2ERZAVKVBP","target":"record","payload":{"canonical_record":{"source":{"id":"1701.01044","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-04T15:16:49Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"034a422cebe8cbc9192ff3a5343d82eaf1786180ae4cc513d98fdff60aa2dc7c","abstract_canon_sha256":"e22e2f10c9ea128850e15b45ee4fc940f043f134c48a24af15abcefdb28f420a"},"schema_version":"1.0"},"canonical_sha256":"8fb463c904da84de5206d1239055550bc5858da9ec317ff564e7fb1255a3ffe6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:21.607151Z","signature_b64":"3rqq/JewDDStlFe3B/JwJBztVaqvUuZKj4EVNAFV3cGusjICaO6l3q3bslh7y2xeuhormz5mXGEV6D4tMpJ0BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fb463c904da84de5206d1239055550bc5858da9ec317ff564e7fb1255a3ffe6","last_reissued_at":"2026-05-18T00:53:21.606746Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:21.606746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.01044","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-18T00:53:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OwfZLqVd6cZjIutLwzxN/4NJl4AaayHkkiOA7UEG+b6Qhde38avPnYA7r7FDHlN3FzGADDNlX8YSACitLBDWDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T18:23:19.011842Z"},"content_sha256":"2b05d89ba465286f48f0611d2b09cfb53a505ac2d91ee62fff843267c0f89f91","schema_version":"1.0","event_id":"sha256:2b05d89ba465286f48f0611d2b09cfb53a505ac2d91ee62fff843267c0f89f91"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:R62GHSIE3KCN4UQG2ERZAVKVBP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Generalization of Quasi-twisted Codes: Multi-twisted codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ajdin Halilovic, Nuh Aydin","submitted_at":"2017-01-04T15:16:49Z","abstract_excerpt":"Cyclic codes and their various generalizations, such as quasi-twisted (QT) codes, have a special place in algebraic coding theory. Among other things, many of the best-known or optimal codes have been obtained from these classes. In this work we introduce a new generalization of QT codes that we call multi-twisted (MT) codes and study some of their basic properties. Presenting several methods of constructing codes in this class and obtaining bounds on the minimum distances, we show that there exist codes with good parameters in this class that cannot be obtained as QT or constacyclic codes. Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.01044","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-18T00:53:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CgTbkEK4SYmmZkBzRAKiXIxCl/m3a6KnApVV8qLZaNy5PytewxHnTAEAb/2F3JlfOEchORK4K2I4a5/wce1SAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T18:23:19.012187Z"},"content_sha256":"3f15688d3326af0a3a191dda92507bea7eab2a98b22ed9935b7f6080c126dd2b","schema_version":"1.0","event_id":"sha256:3f15688d3326af0a3a191dda92507bea7eab2a98b22ed9935b7f6080c126dd2b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R62GHSIE3KCN4UQG2ERZAVKVBP/bundle.json","state_url":"https://pith.science/pith/R62GHSIE3KCN4UQG2ERZAVKVBP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R62GHSIE3KCN4UQG2ERZAVKVBP/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-07-01T18:23:19Z","links":{"resolver":"https://pith.science/pith/R62GHSIE3KCN4UQG2ERZAVKVBP","bundle":"https://pith.science/pith/R62GHSIE3KCN4UQG2ERZAVKVBP/bundle.json","state":"https://pith.science/pith/R62GHSIE3KCN4UQG2ERZAVKVBP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R62GHSIE3KCN4UQG2ERZAVKVBP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:R62GHSIE3KCN4UQG2ERZAVKVBP","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":"e22e2f10c9ea128850e15b45ee4fc940f043f134c48a24af15abcefdb28f420a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-04T15:16:49Z","title_canon_sha256":"034a422cebe8cbc9192ff3a5343d82eaf1786180ae4cc513d98fdff60aa2dc7c"},"schema_version":"1.0","source":{"id":"1701.01044","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.01044","created_at":"2026-05-18T00:53:21Z"},{"alias_kind":"arxiv_version","alias_value":"1701.01044v1","created_at":"2026-05-18T00:53:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.01044","created_at":"2026-05-18T00:53:21Z"},{"alias_kind":"pith_short_12","alias_value":"R62GHSIE3KCN","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"R62GHSIE3KCN4UQG","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"R62GHSIE","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:3f15688d3326af0a3a191dda92507bea7eab2a98b22ed9935b7f6080c126dd2b","target":"graph","created_at":"2026-05-18T00:53:21Z","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":"Cyclic codes and their various generalizations, such as quasi-twisted (QT) codes, have a special place in algebraic coding theory. Among other things, many of the best-known or optimal codes have been obtained from these classes. In this work we introduce a new generalization of QT codes that we call multi-twisted (MT) codes and study some of their basic properties. Presenting several methods of constructing codes in this class and obtaining bounds on the minimum distances, we show that there exist codes with good parameters in this class that cannot be obtained as QT or constacyclic codes. Th","authors_text":"Ajdin Halilovic, Nuh Aydin","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-04T15:16:49Z","title":"A Generalization of Quasi-twisted Codes: Multi-twisted codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.01044","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:2b05d89ba465286f48f0611d2b09cfb53a505ac2d91ee62fff843267c0f89f91","target":"record","created_at":"2026-05-18T00:53:21Z","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":"e22e2f10c9ea128850e15b45ee4fc940f043f134c48a24af15abcefdb28f420a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-04T15:16:49Z","title_canon_sha256":"034a422cebe8cbc9192ff3a5343d82eaf1786180ae4cc513d98fdff60aa2dc7c"},"schema_version":"1.0","source":{"id":"1701.01044","kind":"arxiv","version":1}},"canonical_sha256":"8fb463c904da84de5206d1239055550bc5858da9ec317ff564e7fb1255a3ffe6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8fb463c904da84de5206d1239055550bc5858da9ec317ff564e7fb1255a3ffe6","first_computed_at":"2026-05-18T00:53:21.606746Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:21.606746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3rqq/JewDDStlFe3B/JwJBztVaqvUuZKj4EVNAFV3cGusjICaO6l3q3bslh7y2xeuhormz5mXGEV6D4tMpJ0BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:21.607151Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.01044","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b05d89ba465286f48f0611d2b09cfb53a505ac2d91ee62fff843267c0f89f91","sha256:3f15688d3326af0a3a191dda92507bea7eab2a98b22ed9935b7f6080c126dd2b"],"state_sha256":"f467dbcc75cb526ec4081d5044d009e9a742db53725aa44b8d56e12fd6435cad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"px2pUni6G9O2h0OpC296z7zdZqZmOOVpZgTIeEj45nGXjO2qBqcEoGhR9gQw+nkjUm+ThGnZIQ/08PR5weT6BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T18:23:19.014118Z","bundle_sha256":"91dc2cdea129b68e3a4bd734e06f2605dca55328e3f70853c7791a0c77f2a3c0"}}