{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:DQTDQA2TNXHDO3WYIUZ2JYYQ7Z","short_pith_number":"pith:DQTDQA2T","schema_version":"1.0","canonical_sha256":"1c263803536dce376ed84533a4e310fe6ab8d9e9d12f40012031ef15db867469","source":{"kind":"arxiv","id":"math/0508575","version":2},"attestation_state":"computed","paper":{"title":"Perfect single error-correcting codes in the Johnson Scheme","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel M. Gordon","submitted_at":"2005-08-29T17:11:08Z","abstract_excerpt":"Delsarte conjectured in 1973 that there are no nontrivial pefect codes in the Johnson scheme. Etzion and Schwartz recently showed that perfect codes must be k-regular for large k, and used this to show that there are no perfect codes correcting single errors in J(n,w) for n <= 50000. In this paper we show that there are no perfect single error-correcting codes for n <= 2^250."},"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":"math/0508575","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2005-08-29T17:11:08Z","cross_cats_sorted":[],"title_canon_sha256":"24b93c9c0d67385c9d1fd4845a44535ec833be96a9d49392b63db9410100d6b8","abstract_canon_sha256":"afe9f6cb7abed90b9f049b3be4762c39dce249f72816ee2b0e964e148048f3dd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:44.939281Z","signature_b64":"l9nmqijr86kOcTyE2ND6pUfikazijBSrv1C9cbvJTB2YcfZTTaULQT2raQcG2u+/k1nx8tLdjCSLU8trx+ScBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c263803536dce376ed84533a4e310fe6ab8d9e9d12f40012031ef15db867469","last_reissued_at":"2026-05-18T00:57:44.938756Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:44.938756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Perfect single error-correcting codes in the Johnson Scheme","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel M. Gordon","submitted_at":"2005-08-29T17:11:08Z","abstract_excerpt":"Delsarte conjectured in 1973 that there are no nontrivial pefect codes in the Johnson scheme. Etzion and Schwartz recently showed that perfect codes must be k-regular for large k, and used this to show that there are no perfect codes correcting single errors in J(n,w) for n <= 50000. In this paper we show that there are no perfect single error-correcting codes for n <= 2^250."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0508575","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":"math/0508575","created_at":"2026-05-18T00:57:44.938830+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0508575v2","created_at":"2026-05-18T00:57:44.938830+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0508575","created_at":"2026-05-18T00:57:44.938830+00:00"},{"alias_kind":"pith_short_12","alias_value":"DQTDQA2TNXHD","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_16","alias_value":"DQTDQA2TNXHDO3WY","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_8","alias_value":"DQTDQA2T","created_at":"2026-05-18T12:25:53.335082+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/DQTDQA2TNXHDO3WYIUZ2JYYQ7Z","json":"https://pith.science/pith/DQTDQA2TNXHDO3WYIUZ2JYYQ7Z.json","graph_json":"https://pith.science/api/pith-number/DQTDQA2TNXHDO3WYIUZ2JYYQ7Z/graph.json","events_json":"https://pith.science/api/pith-number/DQTDQA2TNXHDO3WYIUZ2JYYQ7Z/events.json","paper":"https://pith.science/paper/DQTDQA2T"},"agent_actions":{"view_html":"https://pith.science/pith/DQTDQA2TNXHDO3WYIUZ2JYYQ7Z","download_json":"https://pith.science/pith/DQTDQA2TNXHDO3WYIUZ2JYYQ7Z.json","view_paper":"https://pith.science/paper/DQTDQA2T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0508575&json=true","fetch_graph":"https://pith.science/api/pith-number/DQTDQA2TNXHDO3WYIUZ2JYYQ7Z/graph.json","fetch_events":"https://pith.science/api/pith-number/DQTDQA2TNXHDO3WYIUZ2JYYQ7Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DQTDQA2TNXHDO3WYIUZ2JYYQ7Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DQTDQA2TNXHDO3WYIUZ2JYYQ7Z/action/storage_attestation","attest_author":"https://pith.science/pith/DQTDQA2TNXHDO3WYIUZ2JYYQ7Z/action/author_attestation","sign_citation":"https://pith.science/pith/DQTDQA2TNXHDO3WYIUZ2JYYQ7Z/action/citation_signature","submit_replication":"https://pith.science/pith/DQTDQA2TNXHDO3WYIUZ2JYYQ7Z/action/replication_record"}},"created_at":"2026-05-18T00:57:44.938830+00:00","updated_at":"2026-05-18T00:57:44.938830+00:00"}