{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:UZ5MTBY64UJIINRAO6A5RDQBR2","short_pith_number":"pith:UZ5MTBY6","schema_version":"1.0","canonical_sha256":"a67ac9871ee5128436207781d88e018e9c2d42cce4fc7320b2f13c1ab4e297e0","source":{"kind":"arxiv","id":"1202.1352","version":2},"attestation_state":"computed","paper":{"title":"Maximal $m$-distance sets containing the representation of the Johnson graph $J(n, m)$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eiichi Bannai, Junichi Shigezumi, Takahiro Sato","submitted_at":"2012-02-07T05:31:19Z","abstract_excerpt":"We classify the maximal $m$-distance sets in $\\mathbb{R}^{n-1}$ which contain the representation of the Johnson graph $J(n, m)$ for $m = 2, 3$. Furthermore, we determine the necessary and sufficient condition for $n$ and $m$ such that the representation of the Johnson graph $J(n, m)$ is not maximal as an $m$-distance set. Also, we classify the maximal two-distance sets in $\\mathbb{R}^{n-1}$ which contain the representation of $J(n - 1, 2)$."},"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":"1202.1352","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-07T05:31:19Z","cross_cats_sorted":[],"title_canon_sha256":"c64c9042dd0061f126a6b793cafeb5db82814fbfa316853ab36ad88c5b210d83","abstract_canon_sha256":"f953106ed6da578f3488bec28d6ef83a9950019896a3445bea1020ec31744dcb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:31.319602Z","signature_b64":"/Oa7yjxrGr398cagcWNp7hLGSOP3vKvniDklbxg9z23XZJQmIPM9NeYRO7knlSSedfMUEq/HULu8n6IMqesnDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a67ac9871ee5128436207781d88e018e9c2d42cce4fc7320b2f13c1ab4e297e0","last_reissued_at":"2026-05-18T03:46:31.318779Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:31.318779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximal $m$-distance sets containing the representation of the Johnson graph $J(n, m)$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eiichi Bannai, Junichi Shigezumi, Takahiro Sato","submitted_at":"2012-02-07T05:31:19Z","abstract_excerpt":"We classify the maximal $m$-distance sets in $\\mathbb{R}^{n-1}$ which contain the representation of the Johnson graph $J(n, m)$ for $m = 2, 3$. Furthermore, we determine the necessary and sufficient condition for $n$ and $m$ such that the representation of the Johnson graph $J(n, m)$ is not maximal as an $m$-distance set. Also, we classify the maximal two-distance sets in $\\mathbb{R}^{n-1}$ which contain the representation of $J(n - 1, 2)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.1352","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":"1202.1352","created_at":"2026-05-18T03:46:31.318901+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.1352v2","created_at":"2026-05-18T03:46:31.318901+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1352","created_at":"2026-05-18T03:46:31.318901+00:00"},{"alias_kind":"pith_short_12","alias_value":"UZ5MTBY64UJI","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"UZ5MTBY64UJIINRA","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"UZ5MTBY6","created_at":"2026-05-18T12:27:25.539911+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/UZ5MTBY64UJIINRAO6A5RDQBR2","json":"https://pith.science/pith/UZ5MTBY64UJIINRAO6A5RDQBR2.json","graph_json":"https://pith.science/api/pith-number/UZ5MTBY64UJIINRAO6A5RDQBR2/graph.json","events_json":"https://pith.science/api/pith-number/UZ5MTBY64UJIINRAO6A5RDQBR2/events.json","paper":"https://pith.science/paper/UZ5MTBY6"},"agent_actions":{"view_html":"https://pith.science/pith/UZ5MTBY64UJIINRAO6A5RDQBR2","download_json":"https://pith.science/pith/UZ5MTBY64UJIINRAO6A5RDQBR2.json","view_paper":"https://pith.science/paper/UZ5MTBY6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.1352&json=true","fetch_graph":"https://pith.science/api/pith-number/UZ5MTBY64UJIINRAO6A5RDQBR2/graph.json","fetch_events":"https://pith.science/api/pith-number/UZ5MTBY64UJIINRAO6A5RDQBR2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UZ5MTBY64UJIINRAO6A5RDQBR2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UZ5MTBY64UJIINRAO6A5RDQBR2/action/storage_attestation","attest_author":"https://pith.science/pith/UZ5MTBY64UJIINRAO6A5RDQBR2/action/author_attestation","sign_citation":"https://pith.science/pith/UZ5MTBY64UJIINRAO6A5RDQBR2/action/citation_signature","submit_replication":"https://pith.science/pith/UZ5MTBY64UJIINRAO6A5RDQBR2/action/replication_record"}},"created_at":"2026-05-18T03:46:31.318901+00:00","updated_at":"2026-05-18T03:46:31.318901+00:00"}