{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AKIZPDAEVHFMTNHL4UHDHHDER6","short_pith_number":"pith:AKIZPDAE","schema_version":"1.0","canonical_sha256":"0291978c04a9cac9b4ebe50e339c648f9ffa0ae60a8b86e7ba44ce10506e92d5","source":{"kind":"arxiv","id":"1710.04999","version":1},"attestation_state":"computed","paper":{"title":"Matrix-Product Constructions for Hermitian Self-Orthogonal Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.RA"],"primary_cat":"cs.IT","authors_text":"Somphong Jitman, Todsapol Mankean","submitted_at":"2017-10-13T16:43:49Z","abstract_excerpt":"Self-orthogonal codes have been of interest due to there rich algebraic structures and wide applications. Euclidean self-orthogonal codes have been quite well studied in literature. Here, we have focused on Hermitian self-orthogonal codes. Constructions of such codes have been given based on the well-known matrix-product construction for linear codes. Criterion for the underlying matrix and the input codes required in such constructions have been determined. In many cases, the Hermitian self-orthogonality of the input codes and the assumption that the underlying matrix is unitary can be relaxe"},"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":"1710.04999","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-13T16:43:49Z","cross_cats_sorted":["math.IT","math.RA"],"title_canon_sha256":"70627c1810ca46f42668364718c45daa319ec48dcd0f4df1d05b6e82f3c6021f","abstract_canon_sha256":"617392800fb84323470bbd5c1d41d029ec2b83ce8fab01b801c642be9651a1c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:56.053961Z","signature_b64":"fGrxlYQb1kcL21VqRD2ymRJeObw3tQb+X0hsH3aWL+iGu+VvCNpq4jf1jnQKTL9qDoMzqQYIKswNOfjZ5x02Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0291978c04a9cac9b4ebe50e339c648f9ffa0ae60a8b86e7ba44ce10506e92d5","last_reissued_at":"2026-05-18T00:32:56.053302Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:56.053302Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matrix-Product Constructions for Hermitian Self-Orthogonal Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.RA"],"primary_cat":"cs.IT","authors_text":"Somphong Jitman, Todsapol Mankean","submitted_at":"2017-10-13T16:43:49Z","abstract_excerpt":"Self-orthogonal codes have been of interest due to there rich algebraic structures and wide applications. Euclidean self-orthogonal codes have been quite well studied in literature. Here, we have focused on Hermitian self-orthogonal codes. Constructions of such codes have been given based on the well-known matrix-product construction for linear codes. Criterion for the underlying matrix and the input codes required in such constructions have been determined. In many cases, the Hermitian self-orthogonality of the input codes and the assumption that the underlying matrix is unitary can be relaxe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.04999","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":"1710.04999","created_at":"2026-05-18T00:32:56.053421+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.04999v1","created_at":"2026-05-18T00:32:56.053421+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.04999","created_at":"2026-05-18T00:32:56.053421+00:00"},{"alias_kind":"pith_short_12","alias_value":"AKIZPDAEVHFM","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"AKIZPDAEVHFMTNHL","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"AKIZPDAE","created_at":"2026-05-18T12:31:05.417338+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/AKIZPDAEVHFMTNHL4UHDHHDER6","json":"https://pith.science/pith/AKIZPDAEVHFMTNHL4UHDHHDER6.json","graph_json":"https://pith.science/api/pith-number/AKIZPDAEVHFMTNHL4UHDHHDER6/graph.json","events_json":"https://pith.science/api/pith-number/AKIZPDAEVHFMTNHL4UHDHHDER6/events.json","paper":"https://pith.science/paper/AKIZPDAE"},"agent_actions":{"view_html":"https://pith.science/pith/AKIZPDAEVHFMTNHL4UHDHHDER6","download_json":"https://pith.science/pith/AKIZPDAEVHFMTNHL4UHDHHDER6.json","view_paper":"https://pith.science/paper/AKIZPDAE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.04999&json=true","fetch_graph":"https://pith.science/api/pith-number/AKIZPDAEVHFMTNHL4UHDHHDER6/graph.json","fetch_events":"https://pith.science/api/pith-number/AKIZPDAEVHFMTNHL4UHDHHDER6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AKIZPDAEVHFMTNHL4UHDHHDER6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AKIZPDAEVHFMTNHL4UHDHHDER6/action/storage_attestation","attest_author":"https://pith.science/pith/AKIZPDAEVHFMTNHL4UHDHHDER6/action/author_attestation","sign_citation":"https://pith.science/pith/AKIZPDAEVHFMTNHL4UHDHHDER6/action/citation_signature","submit_replication":"https://pith.science/pith/AKIZPDAEVHFMTNHL4UHDHHDER6/action/replication_record"}},"created_at":"2026-05-18T00:32:56.053421+00:00","updated_at":"2026-05-18T00:32:56.053421+00:00"}