{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:LKQWHHFB7R6J6OYCHVQ2BLBLBY","short_pith_number":"pith:LKQWHHFB","schema_version":"1.0","canonical_sha256":"5aa1639ca1fc7c9f3b023d61a0ac2b0e18f025de909e8a4387936ca270095bcc","source":{"kind":"arxiv","id":"1701.05705","version":3},"attestation_state":"computed","paper":{"title":"Construction and nonexistence of strong external difference families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jonathan Jedwab, Shuxing Li","submitted_at":"2017-01-20T07:04:16Z","abstract_excerpt":"Strong external difference families (SEDFs) were introduced by Paterson and Stinson as a more restrictive version of external difference families. SEDFs can be used to produce optimal strong algebraic manipulation detection codes. We characterize the parameters $(v, m, k, \\lambda)$ of a nontrivial SEDF that is near-complete (satisfying $v=km+1$). We construct the first known nontrivial example of a $(v, m, k, \\lambda)$ SEDF having $m > 2$. The parameters of this example are $(243,11,22,20)$, giving a near-complete SEDF, and its group is $\\mathbb{Z}_3^5$. We provide a comprehensive framework fo"},"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":"1701.05705","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-20T07:04:16Z","cross_cats_sorted":[],"title_canon_sha256":"75b25a747921c8ecf6ceeaa332db139cf33d1f0c8125ce7eb17ad8c0fc168523","abstract_canon_sha256":"36eb34ab571996ffc5488d9ab99ad2f757f757f7564485095a70f547012c7b42"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:28.545701Z","signature_b64":"AgP7iN4Gh993pVlnBYNqReylWIEf0/TxCYQc6yOO0lLDGMuFWx/9A8bBa7FcvJbEdtpiSwlaxwTbRdE4mJDYCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5aa1639ca1fc7c9f3b023d61a0ac2b0e18f025de909e8a4387936ca270095bcc","last_reissued_at":"2026-05-18T00:30:28.545118Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:28.545118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Construction and nonexistence of strong external difference families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jonathan Jedwab, Shuxing Li","submitted_at":"2017-01-20T07:04:16Z","abstract_excerpt":"Strong external difference families (SEDFs) were introduced by Paterson and Stinson as a more restrictive version of external difference families. SEDFs can be used to produce optimal strong algebraic manipulation detection codes. We characterize the parameters $(v, m, k, \\lambda)$ of a nontrivial SEDF that is near-complete (satisfying $v=km+1$). We construct the first known nontrivial example of a $(v, m, k, \\lambda)$ SEDF having $m > 2$. The parameters of this example are $(243,11,22,20)$, giving a near-complete SEDF, and its group is $\\mathbb{Z}_3^5$. We provide a comprehensive framework fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05705","kind":"arxiv","version":3},"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":"1701.05705","created_at":"2026-05-18T00:30:28.545204+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.05705v3","created_at":"2026-05-18T00:30:28.545204+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05705","created_at":"2026-05-18T00:30:28.545204+00:00"},{"alias_kind":"pith_short_12","alias_value":"LKQWHHFB7R6J","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"LKQWHHFB7R6J6OYC","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"LKQWHHFB","created_at":"2026-05-18T12:31:28.150371+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/LKQWHHFB7R6J6OYCHVQ2BLBLBY","json":"https://pith.science/pith/LKQWHHFB7R6J6OYCHVQ2BLBLBY.json","graph_json":"https://pith.science/api/pith-number/LKQWHHFB7R6J6OYCHVQ2BLBLBY/graph.json","events_json":"https://pith.science/api/pith-number/LKQWHHFB7R6J6OYCHVQ2BLBLBY/events.json","paper":"https://pith.science/paper/LKQWHHFB"},"agent_actions":{"view_html":"https://pith.science/pith/LKQWHHFB7R6J6OYCHVQ2BLBLBY","download_json":"https://pith.science/pith/LKQWHHFB7R6J6OYCHVQ2BLBLBY.json","view_paper":"https://pith.science/paper/LKQWHHFB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.05705&json=true","fetch_graph":"https://pith.science/api/pith-number/LKQWHHFB7R6J6OYCHVQ2BLBLBY/graph.json","fetch_events":"https://pith.science/api/pith-number/LKQWHHFB7R6J6OYCHVQ2BLBLBY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LKQWHHFB7R6J6OYCHVQ2BLBLBY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LKQWHHFB7R6J6OYCHVQ2BLBLBY/action/storage_attestation","attest_author":"https://pith.science/pith/LKQWHHFB7R6J6OYCHVQ2BLBLBY/action/author_attestation","sign_citation":"https://pith.science/pith/LKQWHHFB7R6J6OYCHVQ2BLBLBY/action/citation_signature","submit_replication":"https://pith.science/pith/LKQWHHFB7R6J6OYCHVQ2BLBLBY/action/replication_record"}},"created_at":"2026-05-18T00:30:28.545204+00:00","updated_at":"2026-05-18T00:30:28.545204+00:00"}