{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DLUSMSPDBT2ZZYOZHR23MLJBGV","short_pith_number":"pith:DLUSMSPD","schema_version":"1.0","canonical_sha256":"1ae92649e30cf59ce1d93c75b62d21357bda69140f0383050c7939120d55eab4","source":{"kind":"arxiv","id":"1809.07553","version":2},"attestation_state":"computed","paper":{"title":"On tight $4$-designs in Hamming association schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander Gavrilyuk, Jano\\v{s} Vidali, Sho Suda","submitted_at":"2018-09-20T10:17:06Z","abstract_excerpt":"We complete the classification of tight $4$-designs in Hamming association schemes $H(n,q)$, i.e., that of tight orthogonal arrays of strength $4$, which had been open since a result by Noda (1979). To do so, we construct an association scheme attached to a tight $4$-design in $H(n,q)$ and analyze its triple intersection numbers to conclude the non-existence in all open cases."},"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":"1809.07553","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-20T10:17:06Z","cross_cats_sorted":[],"title_canon_sha256":"79f00818c86f642dcfc25058cf975e76935832297001b421563a6505ea491b44","abstract_canon_sha256":"b5668785c770a3829f1d185c0c673fa1284563f25ce6d55864359c4d6939e4bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:34.404452Z","signature_b64":"m/tMjfKMOG9Oz9LgHsTWFnPZgfuwpGYKs/uIych1hIVprkdm0ccpwxJwd/vLf5yt8deIEyOEXbBIwlxKao+5Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ae92649e30cf59ce1d93c75b62d21357bda69140f0383050c7939120d55eab4","last_reissued_at":"2026-05-17T23:40:34.403978Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:34.403978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On tight $4$-designs in Hamming association schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander Gavrilyuk, Jano\\v{s} Vidali, Sho Suda","submitted_at":"2018-09-20T10:17:06Z","abstract_excerpt":"We complete the classification of tight $4$-designs in Hamming association schemes $H(n,q)$, i.e., that of tight orthogonal arrays of strength $4$, which had been open since a result by Noda (1979). To do so, we construct an association scheme attached to a tight $4$-design in $H(n,q)$ and analyze its triple intersection numbers to conclude the non-existence in all open cases."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.07553","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":"1809.07553","created_at":"2026-05-17T23:40:34.404046+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.07553v2","created_at":"2026-05-17T23:40:34.404046+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.07553","created_at":"2026-05-17T23:40:34.404046+00:00"},{"alias_kind":"pith_short_12","alias_value":"DLUSMSPDBT2Z","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DLUSMSPDBT2ZZYOZ","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DLUSMSPD","created_at":"2026-05-18T12:32:19.392346+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/DLUSMSPDBT2ZZYOZHR23MLJBGV","json":"https://pith.science/pith/DLUSMSPDBT2ZZYOZHR23MLJBGV.json","graph_json":"https://pith.science/api/pith-number/DLUSMSPDBT2ZZYOZHR23MLJBGV/graph.json","events_json":"https://pith.science/api/pith-number/DLUSMSPDBT2ZZYOZHR23MLJBGV/events.json","paper":"https://pith.science/paper/DLUSMSPD"},"agent_actions":{"view_html":"https://pith.science/pith/DLUSMSPDBT2ZZYOZHR23MLJBGV","download_json":"https://pith.science/pith/DLUSMSPDBT2ZZYOZHR23MLJBGV.json","view_paper":"https://pith.science/paper/DLUSMSPD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.07553&json=true","fetch_graph":"https://pith.science/api/pith-number/DLUSMSPDBT2ZZYOZHR23MLJBGV/graph.json","fetch_events":"https://pith.science/api/pith-number/DLUSMSPDBT2ZZYOZHR23MLJBGV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DLUSMSPDBT2ZZYOZHR23MLJBGV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DLUSMSPDBT2ZZYOZHR23MLJBGV/action/storage_attestation","attest_author":"https://pith.science/pith/DLUSMSPDBT2ZZYOZHR23MLJBGV/action/author_attestation","sign_citation":"https://pith.science/pith/DLUSMSPDBT2ZZYOZHR23MLJBGV/action/citation_signature","submit_replication":"https://pith.science/pith/DLUSMSPDBT2ZZYOZHR23MLJBGV/action/replication_record"}},"created_at":"2026-05-17T23:40:34.404046+00:00","updated_at":"2026-05-17T23:40:34.404046+00:00"}