{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:LSGVW3DHIPSHGDQ5WVJM5E46OP","short_pith_number":"pith:LSGVW3DH","schema_version":"1.0","canonical_sha256":"5c8d5b6c6743e4730e1db552ce939e73f806e4fe29dff555626a457ae8855eec","source":{"kind":"arxiv","id":"2505.19642","version":1},"attestation_state":"computed","paper":{"title":"On the weak $k$-metric dimension of Hamming graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dorota Kuziak, Elena Fernandez, Ismael G. Yero, Manuel Mu\\~noz-Marquez, Sandi Klavzar","submitted_at":"2025-05-26T07:59:45Z","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"},"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":"2505.19642","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-26T07:59:45Z","cross_cats_sorted":[],"title_canon_sha256":"d63ba436ce1d7265697743628513e70e69f3a8972c740fed0380be192be15c0e","abstract_canon_sha256":"bcec6813e20da53dc6d5ddbd411ca02effd189391b2ddb5dc7d02c7fa104f913"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:09:33.913399Z","signature_b64":"Vt29ERWWkwVrUY+C2fkIucX1njo7l2+ketgF94y5DrnzKdptV5oaiZxWy2ogBU9ZZPJoLzb9MdSFqygSKBQdDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c8d5b6c6743e4730e1db552ce939e73f806e4fe29dff555626a457ae8855eec","last_reissued_at":"2026-07-05T11:09:33.912894Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:09:33.912894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the weak $k$-metric dimension of Hamming graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dorota Kuziak, Elena Fernandez, Ismael G. Yero, Manuel Mu\\~noz-Marquez, Sandi Klavzar","submitted_at":"2025-05-26T07:59:45Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.19642","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.19642/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2505.19642","created_at":"2026-07-05T11:09:33.912954+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.19642v1","created_at":"2026-07-05T11:09:33.912954+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.19642","created_at":"2026-07-05T11:09:33.912954+00:00"},{"alias_kind":"pith_short_12","alias_value":"LSGVW3DHIPSH","created_at":"2026-07-05T11:09:33.912954+00:00"},{"alias_kind":"pith_short_16","alias_value":"LSGVW3DHIPSHGDQ5","created_at":"2026-07-05T11:09:33.912954+00:00"},{"alias_kind":"pith_short_8","alias_value":"LSGVW3DH","created_at":"2026-07-05T11:09:33.912954+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/LSGVW3DHIPSHGDQ5WVJM5E46OP","json":"https://pith.science/pith/LSGVW3DHIPSHGDQ5WVJM5E46OP.json","graph_json":"https://pith.science/api/pith-number/LSGVW3DHIPSHGDQ5WVJM5E46OP/graph.json","events_json":"https://pith.science/api/pith-number/LSGVW3DHIPSHGDQ5WVJM5E46OP/events.json","paper":"https://pith.science/paper/LSGVW3DH"},"agent_actions":{"view_html":"https://pith.science/pith/LSGVW3DHIPSHGDQ5WVJM5E46OP","download_json":"https://pith.science/pith/LSGVW3DHIPSHGDQ5WVJM5E46OP.json","view_paper":"https://pith.science/paper/LSGVW3DH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.19642&json=true","fetch_graph":"https://pith.science/api/pith-number/LSGVW3DHIPSHGDQ5WVJM5E46OP/graph.json","fetch_events":"https://pith.science/api/pith-number/LSGVW3DHIPSHGDQ5WVJM5E46OP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LSGVW3DHIPSHGDQ5WVJM5E46OP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LSGVW3DHIPSHGDQ5WVJM5E46OP/action/storage_attestation","attest_author":"https://pith.science/pith/LSGVW3DHIPSHGDQ5WVJM5E46OP/action/author_attestation","sign_citation":"https://pith.science/pith/LSGVW3DHIPSHGDQ5WVJM5E46OP/action/citation_signature","submit_replication":"https://pith.science/pith/LSGVW3DHIPSHGDQ5WVJM5E46OP/action/replication_record"}},"created_at":"2026-07-05T11:09:33.912954+00:00","updated_at":"2026-07-05T11:09:33.912954+00:00"}