{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:KWSLYMNP53T5TR7CEB4UHXJW4C","short_pith_number":"pith:KWSLYMNP","canonical_record":{"source":{"id":"1602.02186","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-05T23:12:13Z","cross_cats_sorted":[],"title_canon_sha256":"439532018e922f72c4aa5ced5a2f4db033a141ea3d0d5b01b987436c4acd7b79","abstract_canon_sha256":"c3a245d9b36c77dabe44b619687ffc14dd290b23313c705f14cd0e33779894f2"},"schema_version":"1.0"},"canonical_sha256":"55a4bc31afeee7d9c7e2207943dd36e0ad135429f58d3557e51b95f80b3dc100","source":{"kind":"arxiv","id":"1602.02186","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.02186","created_at":"2026-05-18T01:21:10Z"},{"alias_kind":"arxiv_version","alias_value":"1602.02186v1","created_at":"2026-05-18T01:21:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02186","created_at":"2026-05-18T01:21:10Z"},{"alias_kind":"pith_short_12","alias_value":"KWSLYMNP53T5","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"KWSLYMNP53T5TR7C","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"KWSLYMNP","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:KWSLYMNP53T5TR7CEB4UHXJW4C","target":"record","payload":{"canonical_record":{"source":{"id":"1602.02186","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-05T23:12:13Z","cross_cats_sorted":[],"title_canon_sha256":"439532018e922f72c4aa5ced5a2f4db033a141ea3d0d5b01b987436c4acd7b79","abstract_canon_sha256":"c3a245d9b36c77dabe44b619687ffc14dd290b23313c705f14cd0e33779894f2"},"schema_version":"1.0"},"canonical_sha256":"55a4bc31afeee7d9c7e2207943dd36e0ad135429f58d3557e51b95f80b3dc100","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:10.711928Z","signature_b64":"qur3gHMWJcdxPwefWfOE1Ts/kzUDQdTpiFA/u2QzRK9UBV3OTZy6dbecPDhTQ4isuMIqB2SrpCHl0+HcKX1vCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55a4bc31afeee7d9c7e2207943dd36e0ad135429f58d3557e51b95f80b3dc100","last_reissued_at":"2026-05-18T01:21:10.711224Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:10.711224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.02186","source_version":1,"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:21:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BBdEW6zhIg6qRcdKpminFwwwMhOD8egOObmqenyhErqtALGSsX8NCmL5IxQPKBa58TLur3kLCrlNYq5nFsIcBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T02:08:20.225592Z"},"content_sha256":"53019b32a7078e16c841c066a73289f187e475f083955db7b68bafbfde331424","schema_version":"1.0","event_id":"sha256:53019b32a7078e16c841c066a73289f187e475f083955db7b68bafbfde331424"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:KWSLYMNP53T5TR7CEB4UHXJW4C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Endomorphisms of The Hamming Graph and Related Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Artur Schaefer","submitted_at":"2016-02-05T23:12:13Z","abstract_excerpt":"In this paper we determine all singular endomorphisms of the Hamming graph and other related graphs. The Hamming graph has vertices $\\mathbb{Z}^{m}_n$ where two vertices are adjacent, if their Hamming distance is $1$. We show that its singular endomorphisms are uniform (each kernel has the same size) and that they are induced by Latin hypercubes (which essentially determines the number of singular endomorphisms). However, we do the same for its complement and some related graphs where the Hamming distance is allowed to be one of $1,...,k$, for some $1\\leq k\\leq m-1$. Ultimately, we consider th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02186","kind":"arxiv","version":1},"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:21:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"54j2Rt2F6BlkM+uwoaBqxhrwme9zfct5kGjPVVk+Iw2f+ZrlHcTN+JLrDJSVxCZmHf+razYcW1QqcacWJdAECw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T02:08:20.225931Z"},"content_sha256":"ea4725375121a9e1caed001699520e2f79d8e9d078c39409e82669ab9f1715ab","schema_version":"1.0","event_id":"sha256:ea4725375121a9e1caed001699520e2f79d8e9d078c39409e82669ab9f1715ab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KWSLYMNP53T5TR7CEB4UHXJW4C/bundle.json","state_url":"https://pith.science/pith/KWSLYMNP53T5TR7CEB4UHXJW4C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KWSLYMNP53T5TR7CEB4UHXJW4C/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-06-27T02:08:20Z","links":{"resolver":"https://pith.science/pith/KWSLYMNP53T5TR7CEB4UHXJW4C","bundle":"https://pith.science/pith/KWSLYMNP53T5TR7CEB4UHXJW4C/bundle.json","state":"https://pith.science/pith/KWSLYMNP53T5TR7CEB4UHXJW4C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KWSLYMNP53T5TR7CEB4UHXJW4C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:KWSLYMNP53T5TR7CEB4UHXJW4C","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":"c3a245d9b36c77dabe44b619687ffc14dd290b23313c705f14cd0e33779894f2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-05T23:12:13Z","title_canon_sha256":"439532018e922f72c4aa5ced5a2f4db033a141ea3d0d5b01b987436c4acd7b79"},"schema_version":"1.0","source":{"id":"1602.02186","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.02186","created_at":"2026-05-18T01:21:10Z"},{"alias_kind":"arxiv_version","alias_value":"1602.02186v1","created_at":"2026-05-18T01:21:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02186","created_at":"2026-05-18T01:21:10Z"},{"alias_kind":"pith_short_12","alias_value":"KWSLYMNP53T5","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"KWSLYMNP53T5TR7C","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"KWSLYMNP","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:ea4725375121a9e1caed001699520e2f79d8e9d078c39409e82669ab9f1715ab","target":"graph","created_at":"2026-05-18T01:21:10Z","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":"In this paper we determine all singular endomorphisms of the Hamming graph and other related graphs. The Hamming graph has vertices $\\mathbb{Z}^{m}_n$ where two vertices are adjacent, if their Hamming distance is $1$. We show that its singular endomorphisms are uniform (each kernel has the same size) and that they are induced by Latin hypercubes (which essentially determines the number of singular endomorphisms). However, we do the same for its complement and some related graphs where the Hamming distance is allowed to be one of $1,...,k$, for some $1\\leq k\\leq m-1$. Ultimately, we consider th","authors_text":"Artur Schaefer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-05T23:12:13Z","title":"Endomorphisms of The Hamming Graph and Related Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02186","kind":"arxiv","version":1},"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:53019b32a7078e16c841c066a73289f187e475f083955db7b68bafbfde331424","target":"record","created_at":"2026-05-18T01:21:10Z","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":"c3a245d9b36c77dabe44b619687ffc14dd290b23313c705f14cd0e33779894f2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-05T23:12:13Z","title_canon_sha256":"439532018e922f72c4aa5ced5a2f4db033a141ea3d0d5b01b987436c4acd7b79"},"schema_version":"1.0","source":{"id":"1602.02186","kind":"arxiv","version":1}},"canonical_sha256":"55a4bc31afeee7d9c7e2207943dd36e0ad135429f58d3557e51b95f80b3dc100","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"55a4bc31afeee7d9c7e2207943dd36e0ad135429f58d3557e51b95f80b3dc100","first_computed_at":"2026-05-18T01:21:10.711224Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:10.711224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qur3gHMWJcdxPwefWfOE1Ts/kzUDQdTpiFA/u2QzRK9UBV3OTZy6dbecPDhTQ4isuMIqB2SrpCHl0+HcKX1vCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:10.711928Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.02186","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53019b32a7078e16c841c066a73289f187e475f083955db7b68bafbfde331424","sha256:ea4725375121a9e1caed001699520e2f79d8e9d078c39409e82669ab9f1715ab"],"state_sha256":"3fc31a8d1fa9f0833c8312aa2af72da7391b6d94afe831e659b318a67dfc84ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nox8BzrdlpQ+r6r5BYKWkcAmkntkBlGLMsdLObXnft9My5FEYTP1h6tGrXkpPZ9yCPMaqZF+rMfUzXocSgjDCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T02:08:20.227793Z","bundle_sha256":"3dff60248fa7ddb045b3f771fa12fe0db4ca39ba7642c4fde93ab8e7cc8b80eb"}}