{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IMAFCWLGVE7HYYUFRGPNZXHOIP","short_pith_number":"pith:IMAFCWLG","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"},"canonical_sha256":"4300515966a93e7c6285899edcdcee43cff2d9dbf00e794da6e05825e8b021f8","source":{"kind":"arxiv","id":"1810.05103","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.05103","created_at":"2026-05-17T23:41:17Z"},{"alias_kind":"arxiv_version","alias_value":"1810.05103v2","created_at":"2026-05-17T23:41:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05103","created_at":"2026-05-17T23:41:17Z"},{"alias_kind":"pith_short_12","alias_value":"IMAFCWLGVE7H","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IMAFCWLGVE7HYYUF","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IMAFCWLG","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IMAFCWLGVE7HYYUFRGPNZXHOIP","target":"record","payload":{"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"},"canonical_sha256":"4300515966a93e7c6285899edcdcee43cff2d9dbf00e794da6e05825e8b021f8","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"},"source_kind":"arxiv","source_id":"1810.05103","source_version":2,"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-17T23:41:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LkH/Vw6ydKnDSUqJm2WXZt9e9v00XudeZKULrdKBmuIanpDPDDbNaRLk8B2YuLOwe5HWj3sUYUWvjUpGOVpTDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:32:09.482723Z"},"content_sha256":"47455fc39ce9419f940a6208982757177b4987e8f8f8f746186ee0b3246ceca3","schema_version":"1.0","event_id":"sha256:47455fc39ce9419f940a6208982757177b4987e8f8f8f746186ee0b3246ceca3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IMAFCWLGVE7HYYUFRGPNZXHOIP","target":"graph","payload":{"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"},"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-17T23:41:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PP+k+eWkMc5MBcJXxN+05/nMyVxIM1ThTOmGKGvqsYMDKVbGUuzv2a9QfEaLo3ylayt5oZOTlxSG1UofABhPAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:32:09.483385Z"},"content_sha256":"2b00e17359c1998c468e58c48c5ca124864ae2c1d018aa0527dadca30bb0f820","schema_version":"1.0","event_id":"sha256:2b00e17359c1998c468e58c48c5ca124864ae2c1d018aa0527dadca30bb0f820"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IMAFCWLGVE7HYYUFRGPNZXHOIP/bundle.json","state_url":"https://pith.science/pith/IMAFCWLGVE7HYYUFRGPNZXHOIP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IMAFCWLGVE7HYYUFRGPNZXHOIP/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-05-26T22:32:09Z","links":{"resolver":"https://pith.science/pith/IMAFCWLGVE7HYYUFRGPNZXHOIP","bundle":"https://pith.science/pith/IMAFCWLGVE7HYYUFRGPNZXHOIP/bundle.json","state":"https://pith.science/pith/IMAFCWLGVE7HYYUFRGPNZXHOIP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IMAFCWLGVE7HYYUFRGPNZXHOIP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IMAFCWLGVE7HYYUFRGPNZXHOIP","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":"6d5f5dcf1024a28ba56aadbf9b413a213050b5c6d551ac00788472b51c2477fc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-11T16:12:10Z","title_canon_sha256":"e6723d54efb846d50f6cae86f2b06abcb30fc045938ab7ea0c63b37883cb7898"},"schema_version":"1.0","source":{"id":"1810.05103","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.05103","created_at":"2026-05-17T23:41:17Z"},{"alias_kind":"arxiv_version","alias_value":"1810.05103v2","created_at":"2026-05-17T23:41:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05103","created_at":"2026-05-17T23:41:17Z"},{"alias_kind":"pith_short_12","alias_value":"IMAFCWLGVE7H","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IMAFCWLGVE7HYYUF","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IMAFCWLG","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:2b00e17359c1998c468e58c48c5ca124864ae2c1d018aa0527dadca30bb0f820","target":"graph","created_at":"2026-05-17T23:41:17Z","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":"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","authors_text":"Kenza Guenda, Satanan Thipworawimon, Somphong Jitman, T. Aaron Gulliver","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-11T16:12:10Z","title":"Linear $\\ell$-Intersection Pairs of Codes and Their Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05103","kind":"arxiv","version":2},"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:47455fc39ce9419f940a6208982757177b4987e8f8f8f746186ee0b3246ceca3","target":"record","created_at":"2026-05-17T23:41:17Z","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":"6d5f5dcf1024a28ba56aadbf9b413a213050b5c6d551ac00788472b51c2477fc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-11T16:12:10Z","title_canon_sha256":"e6723d54efb846d50f6cae86f2b06abcb30fc045938ab7ea0c63b37883cb7898"},"schema_version":"1.0","source":{"id":"1810.05103","kind":"arxiv","version":2}},"canonical_sha256":"4300515966a93e7c6285899edcdcee43cff2d9dbf00e794da6e05825e8b021f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4300515966a93e7c6285899edcdcee43cff2d9dbf00e794da6e05825e8b021f8","first_computed_at":"2026-05-17T23:41:17.799556Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:17.799556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b2ZpRwJAroEypDp8BBqKMl2Ogj1EJqaUpOSQhvZV5zyGeG3qrhcPilf13/1WT097xilXbT3gddGfaDn0xTKkAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:17.800040Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.05103","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:47455fc39ce9419f940a6208982757177b4987e8f8f8f746186ee0b3246ceca3","sha256:2b00e17359c1998c468e58c48c5ca124864ae2c1d018aa0527dadca30bb0f820"],"state_sha256":"77f3da19ab9a5280e82d7a84fc2f1633dad08b6bdc714a2f4f9ec4e179c61376"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LrcKnEv4KIYZM8bvJVwghQLQg4gS5aQhk5UQ1MsLFszI0LzjrWOIxGNVynXyR6t+1LkhPxhlNixDzKm5VLQaDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T22:32:09.486297Z","bundle_sha256":"a8018335c06a2bce08e4d83f89ce701a64b65cddc0002621e6102a50fde41f14"}}