{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:LSGVW3DHIPSHGDQ5WVJM5E46OP","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":"bcec6813e20da53dc6d5ddbd411ca02effd189391b2ddb5dc7d02c7fa104f913","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-26T07:59:45Z","title_canon_sha256":"d63ba436ce1d7265697743628513e70e69f3a8972c740fed0380be192be15c0e"},"schema_version":"1.0","source":{"id":"2505.19642","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.19642","created_at":"2026-07-05T11:09:33Z"},{"alias_kind":"arxiv_version","alias_value":"2505.19642v1","created_at":"2026-07-05T11:09:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.19642","created_at":"2026-07-05T11:09:33Z"},{"alias_kind":"pith_short_12","alias_value":"LSGVW3DHIPSH","created_at":"2026-07-05T11:09:33Z"},{"alias_kind":"pith_short_16","alias_value":"LSGVW3DHIPSHGDQ5","created_at":"2026-07-05T11:09:33Z"},{"alias_kind":"pith_short_8","alias_value":"LSGVW3DH","created_at":"2026-07-05T11:09:33Z"}],"graph_snapshots":[{"event_id":"sha256:2e1aa373c117b4172badf1b4af2c064db5aeebe2090b79a20c707c1f989edde0","target":"graph","created_at":"2026-07-05T11:09:33Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2505.19642/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a connected graph $G$, a set of vertices $X\\subset V(G)$ is a weak $k$-resolving set of $G$ if for each two vertices $y,z\\in V(G)$, the sum of the values $|d_G(y,x)-d_G(z,x)|$ over all $x\\in X$ is at least $k$, where $d_G(u,v)$ stands for the length of a shortest path between $u$ and $v$. The cardinality of a smallest weak $k$-resolving set of $G$ is the weak $k$-metric dimension of $G$, and is denoted by $\\mathrm{wdim}_k(G)$. In this paper, $\\mathrm{wdim}_k(K_n\\,\\square\\,K_n)$ is determined for every $n\\ge 3$ and every $2\\le k\\le 2n$. An improvement of a known integer linear programming","authors_text":"Dorota Kuziak, Elena Fernandez, Ismael G. Yero, Manuel Mu\\~noz-Marquez, Sandi Klavzar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-26T07:59:45Z","title":"On the weak $k$-metric dimension of Hamming graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.19642","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:e29b5e1eaf5c1284d5b799e61059d5900de4f985e07f7e510eef2ba1843b80f8","target":"record","created_at":"2026-07-05T11:09:33Z","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":"bcec6813e20da53dc6d5ddbd411ca02effd189391b2ddb5dc7d02c7fa104f913","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-26T07:59:45Z","title_canon_sha256":"d63ba436ce1d7265697743628513e70e69f3a8972c740fed0380be192be15c0e"},"schema_version":"1.0","source":{"id":"2505.19642","kind":"arxiv","version":1}},"canonical_sha256":"5c8d5b6c6743e4730e1db552ce939e73f806e4fe29dff555626a457ae8855eec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c8d5b6c6743e4730e1db552ce939e73f806e4fe29dff555626a457ae8855eec","first_computed_at":"2026-07-05T11:09:33.912894Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:09:33.912894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Vt29ERWWkwVrUY+C2fkIucX1njo7l2+ketgF94y5DrnzKdptV5oaiZxWy2ogBU9ZZPJoLzb9MdSFqygSKBQdDA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:09:33.913399Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.19642","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e29b5e1eaf5c1284d5b799e61059d5900de4f985e07f7e510eef2ba1843b80f8","sha256:2e1aa373c117b4172badf1b4af2c064db5aeebe2090b79a20c707c1f989edde0"],"state_sha256":"bf10cf75f531546ed85c9bd6d6a7e19900b47d2404e360e2a6652a5b0b1b229a"}