{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:MKWXMXPWIFSOY5HFGIELE2KYH4","short_pith_number":"pith:MKWXMXPW","canonical_record":{"source":{"id":"1602.01215","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-03T07:39:56Z","cross_cats_sorted":[],"title_canon_sha256":"5527acefa037636c928b028da987e5e570c7fcf5a2f41d51a57dcf1d449c8d69","abstract_canon_sha256":"aecbb9aa76d34057e5de086a671e0adff86b1c5462055631bfa0c1b297b27e60"},"schema_version":"1.0"},"canonical_sha256":"62ad765df64164ec74e53208b269583f0beb7b6c4bee447b548d6c69fc701724","source":{"kind":"arxiv","id":"1602.01215","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01215","created_at":"2026-05-18T01:04:09Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01215v2","created_at":"2026-05-18T01:04:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01215","created_at":"2026-05-18T01:04:09Z"},{"alias_kind":"pith_short_12","alias_value":"MKWXMXPWIFSO","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MKWXMXPWIFSOY5HF","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MKWXMXPW","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:MKWXMXPWIFSOY5HFGIELE2KYH4","target":"record","payload":{"canonical_record":{"source":{"id":"1602.01215","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-03T07:39:56Z","cross_cats_sorted":[],"title_canon_sha256":"5527acefa037636c928b028da987e5e570c7fcf5a2f41d51a57dcf1d449c8d69","abstract_canon_sha256":"aecbb9aa76d34057e5de086a671e0adff86b1c5462055631bfa0c1b297b27e60"},"schema_version":"1.0"},"canonical_sha256":"62ad765df64164ec74e53208b269583f0beb7b6c4bee447b548d6c69fc701724","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:09.251890Z","signature_b64":"mxN68zIHPF42G13z5dNVcPNMfQJ90OdnuxBSZgY+gEzUqhn4Dv27wsx65WeMBITmL5U2AnJ8z6vAfQJZPVWqBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62ad765df64164ec74e53208b269583f0beb7b6c4bee447b548d6c69fc701724","last_reissued_at":"2026-05-18T01:04:09.251279Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:09.251279Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.01215","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-18T01:04:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"69CfMwJ9sJ5654HsP0kwRA9fDU3Qnjesar2QrbBoFqbc/yr9fgJcGav+jeJNxx7k+xoDH5lSbx82o7N54pOfBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:18:12.612067Z"},"content_sha256":"19126b45dccc81a01469cc477824789ee3e2e2e28f105cb3395f489dd359f66a","schema_version":"1.0","event_id":"sha256:19126b45dccc81a01469cc477824789ee3e2e2e28f105cb3395f489dd359f66a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:MKWXMXPWIFSOY5HFGIELE2KYH4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximal $m$-distance sets containing the representation of the Hamming graph $H(n,m)$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chika Yamamoto, Hiroshi Nozaki, Rina Hayashi, Saori Adachi","submitted_at":"2016-02-03T07:39:56Z","abstract_excerpt":"A set $X$ in the Euclidean space $\\mathbb{R}^d$ is called an $m$-distance set if the set of Euclidean distances between two distinct points in $X$ has size $m$. An $m$-distance set $X$ in $\\mathbb{R}^d$ is said to be maximal if there does not exist a vector $x$ in $\\mathbb{R}^d$ such that the union of $X$ and $\\{x\\}$ still has only $m$ distances. Bannai--Sato--Shigezumi (2012) investigated the maximal $m$-distance sets which contain the Euclidean representation of the Johnson graph $J(n,m)$. In this paper, we consider the same problem for the Hamming graph $H(n,m)$. The Euclidean representatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01215","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-18T01:04:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iBt1tPnj5QwhT0ZuDI0VkwUlLZDhSKx+RWasM/wk3FSph3V+azCmKI7f4YIoBQwZK0q24xRU4hno3quy2v9nCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:18:12.612742Z"},"content_sha256":"fa15b254d0c145745444561dd3f155d63cbb7c3b4f54aabe4f43d3d09d79df59","schema_version":"1.0","event_id":"sha256:fa15b254d0c145745444561dd3f155d63cbb7c3b4f54aabe4f43d3d09d79df59"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MKWXMXPWIFSOY5HFGIELE2KYH4/bundle.json","state_url":"https://pith.science/pith/MKWXMXPWIFSOY5HFGIELE2KYH4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MKWXMXPWIFSOY5HFGIELE2KYH4/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-27T21:18:12Z","links":{"resolver":"https://pith.science/pith/MKWXMXPWIFSOY5HFGIELE2KYH4","bundle":"https://pith.science/pith/MKWXMXPWIFSOY5HFGIELE2KYH4/bundle.json","state":"https://pith.science/pith/MKWXMXPWIFSOY5HFGIELE2KYH4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MKWXMXPWIFSOY5HFGIELE2KYH4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MKWXMXPWIFSOY5HFGIELE2KYH4","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":"aecbb9aa76d34057e5de086a671e0adff86b1c5462055631bfa0c1b297b27e60","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-03T07:39:56Z","title_canon_sha256":"5527acefa037636c928b028da987e5e570c7fcf5a2f41d51a57dcf1d449c8d69"},"schema_version":"1.0","source":{"id":"1602.01215","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01215","created_at":"2026-05-18T01:04:09Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01215v2","created_at":"2026-05-18T01:04:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01215","created_at":"2026-05-18T01:04:09Z"},{"alias_kind":"pith_short_12","alias_value":"MKWXMXPWIFSO","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MKWXMXPWIFSOY5HF","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MKWXMXPW","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:fa15b254d0c145745444561dd3f155d63cbb7c3b4f54aabe4f43d3d09d79df59","target":"graph","created_at":"2026-05-18T01:04:09Z","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":"A set $X$ in the Euclidean space $\\mathbb{R}^d$ is called an $m$-distance set if the set of Euclidean distances between two distinct points in $X$ has size $m$. An $m$-distance set $X$ in $\\mathbb{R}^d$ is said to be maximal if there does not exist a vector $x$ in $\\mathbb{R}^d$ such that the union of $X$ and $\\{x\\}$ still has only $m$ distances. Bannai--Sato--Shigezumi (2012) investigated the maximal $m$-distance sets which contain the Euclidean representation of the Johnson graph $J(n,m)$. In this paper, we consider the same problem for the Hamming graph $H(n,m)$. The Euclidean representatio","authors_text":"Chika Yamamoto, Hiroshi Nozaki, Rina Hayashi, Saori Adachi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-03T07:39:56Z","title":"Maximal $m$-distance sets containing the representation of the Hamming graph $H(n,m)$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01215","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:19126b45dccc81a01469cc477824789ee3e2e2e28f105cb3395f489dd359f66a","target":"record","created_at":"2026-05-18T01:04:09Z","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":"aecbb9aa76d34057e5de086a671e0adff86b1c5462055631bfa0c1b297b27e60","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-03T07:39:56Z","title_canon_sha256":"5527acefa037636c928b028da987e5e570c7fcf5a2f41d51a57dcf1d449c8d69"},"schema_version":"1.0","source":{"id":"1602.01215","kind":"arxiv","version":2}},"canonical_sha256":"62ad765df64164ec74e53208b269583f0beb7b6c4bee447b548d6c69fc701724","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"62ad765df64164ec74e53208b269583f0beb7b6c4bee447b548d6c69fc701724","first_computed_at":"2026-05-18T01:04:09.251279Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:09.251279Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mxN68zIHPF42G13z5dNVcPNMfQJ90OdnuxBSZgY+gEzUqhn4Dv27wsx65WeMBITmL5U2AnJ8z6vAfQJZPVWqBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:09.251890Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.01215","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:19126b45dccc81a01469cc477824789ee3e2e2e28f105cb3395f489dd359f66a","sha256:fa15b254d0c145745444561dd3f155d63cbb7c3b4f54aabe4f43d3d09d79df59"],"state_sha256":"360f1ceaee6ec88c5c051c62088657b82f6abbaab8c4850d81ac921f664666aa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z+pqBKY6xgnmJm+2c2IwRHvsHlTQs8JYWIye+5MoRxsDvV7LquI6ui+Ut2PSPlFBe0FRBXfF8P3jamFA793MCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T21:18:12.616138Z","bundle_sha256":"6d193e38f8601e4147b56311ec9732eca9b01d29ff6e73d6c5d577a89008c6d1"}}