{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:WTOQL6UZCLUJNZ2KLXJRPPAK2L","short_pith_number":"pith:WTOQL6UZ","canonical_record":{"source":{"id":"1201.6012","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-29T04:12:48Z","cross_cats_sorted":["math.AC","math.CO","math.IT"],"title_canon_sha256":"dc12ba8acb9d168a18d865b958f9c255bef1f6887d60a4461550f99338a595a0","abstract_canon_sha256":"1229f15625fe6682f25c43550f8758fd745ef5a8da29d462594d78f6ebad91ab"},"schema_version":"1.0"},"canonical_sha256":"b4dd05fa9912e896e74a5dd317bc0ad2e4aea97c47cef4d21fbd0e98f3aad112","source":{"kind":"arxiv","id":"1201.6012","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.6012","created_at":"2026-05-18T04:03:34Z"},{"alias_kind":"arxiv_version","alias_value":"1201.6012v1","created_at":"2026-05-18T04:03:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.6012","created_at":"2026-05-18T04:03:34Z"},{"alias_kind":"pith_short_12","alias_value":"WTOQL6UZCLUJ","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"WTOQL6UZCLUJNZ2K","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"WTOQL6UZ","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:WTOQL6UZCLUJNZ2KLXJRPPAK2L","target":"record","payload":{"canonical_record":{"source":{"id":"1201.6012","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-29T04:12:48Z","cross_cats_sorted":["math.AC","math.CO","math.IT"],"title_canon_sha256":"dc12ba8acb9d168a18d865b958f9c255bef1f6887d60a4461550f99338a595a0","abstract_canon_sha256":"1229f15625fe6682f25c43550f8758fd745ef5a8da29d462594d78f6ebad91ab"},"schema_version":"1.0"},"canonical_sha256":"b4dd05fa9912e896e74a5dd317bc0ad2e4aea97c47cef4d21fbd0e98f3aad112","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:34.003309Z","signature_b64":"/SV84nl2voPodwyB3z4DQeZ94VZYWRQj81GyomE4+9Gl8MK2uj0+9cCAY8vxx09+Tjz/u1OKnwjsI0C2Dti1CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4dd05fa9912e896e74a5dd317bc0ad2e4aea97c47cef4d21fbd0e98f3aad112","last_reissued_at":"2026-05-18T04:03:34.002541Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:34.002541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.6012","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-18T04:03:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7d2B7PjMsAVLwzvUcEiHFVclqxB+gU786LObiAlBin1q99+tozcNYeaPe3B3/RdfCfnefJt55mOBXXytsMb6Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:32:09.325283Z"},"content_sha256":"973cdfae866c5cc9fc146ac66a530533603156d58077ced11af8d47574420ea7","schema_version":"1.0","event_id":"sha256:973cdfae866c5cc9fc146ac66a530533603156d58077ced11af8d47574420ea7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:WTOQL6UZCLUJNZ2KLXJRPPAK2L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Construction of quasi-cyclic self-dual codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Heisook Lee, Jon-Lark Kim, Sunghyu Han, Yoonjin Lee","submitted_at":"2012-01-29T04:12:48Z","abstract_excerpt":"There is a one-to-one correspondence between $\\ell$-quasi-cyclic codes over a finite field $\\mathbb F_q$ and linear codes over a ring $R = \\mathbb F_q[Y]/(Y^m-1)$. Using this correspondence, we prove that every $\\ell$-quasi-cyclic self-dual code of length $m\\ell$ over a finite field $\\mathbb F_q$ can be obtained by the {\\it building-up} construction, provided that char $(\\mathbb F_q)=2$ or $q \\equiv 1 \\pmod 4$, $m$ is a prime $p$, and $q$ is a primitive element of $\\mathbb F_p$. We determine possible weight enumerators of a binary $\\ell$-quasi-cyclic self-dual code of length $p\\ell$ (with $p$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.6012","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-18T04:03:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I7mbhsn9aXhGls+Qzob66JFk5tE0RhNdZ6vW46gCqVIKGqqcKbftnmYMvEePSuSW8OFzgjP5TzZgP5/p/nDtDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:32:09.325663Z"},"content_sha256":"257e68498608a70b834a6b29981f865b45d456d877d68aaf34a731ebb3b49ded","schema_version":"1.0","event_id":"sha256:257e68498608a70b834a6b29981f865b45d456d877d68aaf34a731ebb3b49ded"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WTOQL6UZCLUJNZ2KLXJRPPAK2L/bundle.json","state_url":"https://pith.science/pith/WTOQL6UZCLUJNZ2KLXJRPPAK2L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WTOQL6UZCLUJNZ2KLXJRPPAK2L/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-06-01T23:32:09Z","links":{"resolver":"https://pith.science/pith/WTOQL6UZCLUJNZ2KLXJRPPAK2L","bundle":"https://pith.science/pith/WTOQL6UZCLUJNZ2KLXJRPPAK2L/bundle.json","state":"https://pith.science/pith/WTOQL6UZCLUJNZ2KLXJRPPAK2L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WTOQL6UZCLUJNZ2KLXJRPPAK2L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:WTOQL6UZCLUJNZ2KLXJRPPAK2L","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":"1229f15625fe6682f25c43550f8758fd745ef5a8da29d462594d78f6ebad91ab","cross_cats_sorted":["math.AC","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-29T04:12:48Z","title_canon_sha256":"dc12ba8acb9d168a18d865b958f9c255bef1f6887d60a4461550f99338a595a0"},"schema_version":"1.0","source":{"id":"1201.6012","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.6012","created_at":"2026-05-18T04:03:34Z"},{"alias_kind":"arxiv_version","alias_value":"1201.6012v1","created_at":"2026-05-18T04:03:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.6012","created_at":"2026-05-18T04:03:34Z"},{"alias_kind":"pith_short_12","alias_value":"WTOQL6UZCLUJ","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"WTOQL6UZCLUJNZ2K","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"WTOQL6UZ","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:257e68498608a70b834a6b29981f865b45d456d877d68aaf34a731ebb3b49ded","target":"graph","created_at":"2026-05-18T04:03:34Z","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":"There is a one-to-one correspondence between $\\ell$-quasi-cyclic codes over a finite field $\\mathbb F_q$ and linear codes over a ring $R = \\mathbb F_q[Y]/(Y^m-1)$. Using this correspondence, we prove that every $\\ell$-quasi-cyclic self-dual code of length $m\\ell$ over a finite field $\\mathbb F_q$ can be obtained by the {\\it building-up} construction, provided that char $(\\mathbb F_q)=2$ or $q \\equiv 1 \\pmod 4$, $m$ is a prime $p$, and $q$ is a primitive element of $\\mathbb F_p$. We determine possible weight enumerators of a binary $\\ell$-quasi-cyclic self-dual code of length $p\\ell$ (with $p$ ","authors_text":"Heisook Lee, Jon-Lark Kim, Sunghyu Han, Yoonjin Lee","cross_cats":["math.AC","math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-29T04:12:48Z","title":"Construction of quasi-cyclic self-dual codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.6012","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:973cdfae866c5cc9fc146ac66a530533603156d58077ced11af8d47574420ea7","target":"record","created_at":"2026-05-18T04:03:34Z","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":"1229f15625fe6682f25c43550f8758fd745ef5a8da29d462594d78f6ebad91ab","cross_cats_sorted":["math.AC","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-29T04:12:48Z","title_canon_sha256":"dc12ba8acb9d168a18d865b958f9c255bef1f6887d60a4461550f99338a595a0"},"schema_version":"1.0","source":{"id":"1201.6012","kind":"arxiv","version":1}},"canonical_sha256":"b4dd05fa9912e896e74a5dd317bc0ad2e4aea97c47cef4d21fbd0e98f3aad112","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b4dd05fa9912e896e74a5dd317bc0ad2e4aea97c47cef4d21fbd0e98f3aad112","first_computed_at":"2026-05-18T04:03:34.002541Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:03:34.002541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/SV84nl2voPodwyB3z4DQeZ94VZYWRQj81GyomE4+9Gl8MK2uj0+9cCAY8vxx09+Tjz/u1OKnwjsI0C2Dti1CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:03:34.003309Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.6012","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:973cdfae866c5cc9fc146ac66a530533603156d58077ced11af8d47574420ea7","sha256:257e68498608a70b834a6b29981f865b45d456d877d68aaf34a731ebb3b49ded"],"state_sha256":"1b4ce00d184563d0c35946250982bceb9cb55b0895138324e1a86e04e71c8062"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7VzMz0dG9FaTtTQweY+MuZvDKRICKdvlSvCnNYnTz7ZD8Js52wk5mdC6vhgJTvZJVv4qlNMO1ZvHofI72Up+Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T23:32:09.327595Z","bundle_sha256":"77794086a106b76c36b09c301b9d04d2ee0b0ee3acd0c06851a13e28d18b3d84"}}