{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:IMAFCWLGVE7HYYUFRGPNZXHOIP","short_pith_number":"pith:IMAFCWLG","schema_version":"1.0","canonical_sha256":"4300515966a93e7c6285899edcdcee43cff2d9dbf00e794da6e05825e8b021f8","source":{"kind":"arxiv","id":"1810.05103","version":2},"attestation_state":"computed","paper":{"title":"Linear $\\ell$-Intersection Pairs of Codes and Their Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kenza Guenda, Satanan Thipworawimon, Somphong Jitman, T. Aaron Gulliver","submitted_at":"2018-10-11T16:12:10Z","abstract_excerpt":"In this paper, a linear $\\ell$-intersection pair of codes is introduced as a generalization of linear complementary pairs of codes.\n  Two linear codes are said to be a linear $\\ell$-intersection pair if their intersection has dimension $\\ell$.\n  Characterizations and constructions of such pairs of codes are given in terms of the corresponding generator and parity-check matrices.\n  Linear $\\ell$-intersection pairs of MDS codes over $\\mathbb{F}_q$ of length up to $q+1$ are given for all possible parameters.\n  As an application, linear $\\ell$-intersection pairs of codes are used to construct enta"},"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":"1810.05103","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-11T16:12:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e6723d54efb846d50f6cae86f2b06abcb30fc045938ab7ea0c63b37883cb7898","abstract_canon_sha256":"6d5f5dcf1024a28ba56aadbf9b413a213050b5c6d551ac00788472b51c2477fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:17.800040Z","signature_b64":"b2ZpRwJAroEypDp8BBqKMl2Ogj1EJqaUpOSQhvZV5zyGeG3qrhcPilf13/1WT097xilXbT3gddGfaDn0xTKkAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4300515966a93e7c6285899edcdcee43cff2d9dbf00e794da6e05825e8b021f8","last_reissued_at":"2026-05-17T23:41:17.799556Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:17.799556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear $\\ell$-Intersection Pairs of Codes and Their Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kenza Guenda, Satanan Thipworawimon, Somphong Jitman, T. Aaron Gulliver","submitted_at":"2018-10-11T16:12:10Z","abstract_excerpt":"In this paper, a linear $\\ell$-intersection pair of codes is introduced as a generalization of linear complementary pairs of codes.\n  Two linear codes are said to be a linear $\\ell$-intersection pair if their intersection has dimension $\\ell$.\n  Characterizations and constructions of such pairs of codes are given in terms of the corresponding generator and parity-check matrices.\n  Linear $\\ell$-intersection pairs of MDS codes over $\\mathbb{F}_q$ of length up to $q+1$ are given for all possible parameters.\n  As an application, linear $\\ell$-intersection pairs of codes are used to construct enta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05103","kind":"arxiv","version":2},"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":"1810.05103","created_at":"2026-05-17T23:41:17.799638+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.05103v2","created_at":"2026-05-17T23:41:17.799638+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05103","created_at":"2026-05-17T23:41:17.799638+00:00"},{"alias_kind":"pith_short_12","alias_value":"IMAFCWLGVE7H","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"IMAFCWLGVE7HYYUF","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"IMAFCWLG","created_at":"2026-05-18T12:32:31.084164+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/IMAFCWLGVE7HYYUFRGPNZXHOIP","json":"https://pith.science/pith/IMAFCWLGVE7HYYUFRGPNZXHOIP.json","graph_json":"https://pith.science/api/pith-number/IMAFCWLGVE7HYYUFRGPNZXHOIP/graph.json","events_json":"https://pith.science/api/pith-number/IMAFCWLGVE7HYYUFRGPNZXHOIP/events.json","paper":"https://pith.science/paper/IMAFCWLG"},"agent_actions":{"view_html":"https://pith.science/pith/IMAFCWLGVE7HYYUFRGPNZXHOIP","download_json":"https://pith.science/pith/IMAFCWLGVE7HYYUFRGPNZXHOIP.json","view_paper":"https://pith.science/paper/IMAFCWLG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.05103&json=true","fetch_graph":"https://pith.science/api/pith-number/IMAFCWLGVE7HYYUFRGPNZXHOIP/graph.json","fetch_events":"https://pith.science/api/pith-number/IMAFCWLGVE7HYYUFRGPNZXHOIP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IMAFCWLGVE7HYYUFRGPNZXHOIP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IMAFCWLGVE7HYYUFRGPNZXHOIP/action/storage_attestation","attest_author":"https://pith.science/pith/IMAFCWLGVE7HYYUFRGPNZXHOIP/action/author_attestation","sign_citation":"https://pith.science/pith/IMAFCWLGVE7HYYUFRGPNZXHOIP/action/citation_signature","submit_replication":"https://pith.science/pith/IMAFCWLGVE7HYYUFRGPNZXHOIP/action/replication_record"}},"created_at":"2026-05-17T23:41:17.799638+00:00","updated_at":"2026-05-17T23:41:17.799638+00:00"}