{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RXEYAYFWH7FPNJH7HI736XDHTH","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":"8f06fd27791f108a9439fa199b96375df9741e740b877a42ea706b58f94caf38","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-04T10:02:06Z","title_canon_sha256":"117f5150b32f36fc4107ef36c17d27f1cc56dd757b4b278d61a0bafb843882a9"},"schema_version":"1.0","source":{"id":"1805.01693","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.01693","created_at":"2026-05-18T00:16:47Z"},{"alias_kind":"arxiv_version","alias_value":"1805.01693v1","created_at":"2026-05-18T00:16:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.01693","created_at":"2026-05-18T00:16:47Z"},{"alias_kind":"pith_short_12","alias_value":"RXEYAYFWH7FP","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RXEYAYFWH7FPNJH7","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RXEYAYFW","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:ac4c0dc705658bc4cff3ac50342f9e84374af5cc4bef1aaa8264a33b72b9fe4e","target":"graph","created_at":"2026-05-18T00:16:47Z","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":"Identifying codes in graphs have been widely studied since their introduction by Karpovsky, Chakrabarty and Levitin in 1998. In particular, there are a lot of results regarding the binary hypercubes, that is, the Hamming graphs $K_2^n$. In 2008, Gravier et al. started investigating identification in $K_q^2$. Goddard and Wash, in 2013, studied identifying codes in the general Hamming graphs $K_q^n$. They stated, for instance, that $\\gamma^{ID}(K_q^n)\\leq q^{n-1}$ for any $q$ and $n\\geq3$. Moreover, they conjectured that $\\gamma^{ID}(K_q^3)=q^2$. In this article, we show that $\\gamma^{ID}(K_q^3)","authors_text":"Tero Laihonen, Tuomo Lehtil\\\"a, Ville Junnila","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-04T10:02:06Z","title":"Solving a Conjecture on Identification in Hamming Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.01693","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:942d22feeb2750b19f4db8a9a54f5052fd6afcb29f391e7212700f1c2a900078","target":"record","created_at":"2026-05-18T00:16:47Z","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":"8f06fd27791f108a9439fa199b96375df9741e740b877a42ea706b58f94caf38","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-04T10:02:06Z","title_canon_sha256":"117f5150b32f36fc4107ef36c17d27f1cc56dd757b4b278d61a0bafb843882a9"},"schema_version":"1.0","source":{"id":"1805.01693","kind":"arxiv","version":1}},"canonical_sha256":"8dc98060b63fcaf6a4ff3a3fbf5c6799f5ccec10f3bbf8ce4f432bb2a872cf92","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8dc98060b63fcaf6a4ff3a3fbf5c6799f5ccec10f3bbf8ce4f432bb2a872cf92","first_computed_at":"2026-05-18T00:16:47.038932Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:47.038932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mxgbsmGbo79m7rKhQQJ3Amntk0bDKRfVPuqr2qrITWjveOMfARE3oL1VDKs4qy6ZlzOLPYK5pnqDT76J4BcCCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:47.039676Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.01693","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:942d22feeb2750b19f4db8a9a54f5052fd6afcb29f391e7212700f1c2a900078","sha256:ac4c0dc705658bc4cff3ac50342f9e84374af5cc4bef1aaa8264a33b72b9fe4e"],"state_sha256":"faeeba87daf1cdb601c5f14a93d17a8f0d8c49c911e17a982592cfd587442066"}