{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:XPGP7VWXUYUSPBBPOOLCO5KPKY","short_pith_number":"pith:XPGP7VWX","schema_version":"1.0","canonical_sha256":"bbccffd6d7a62927842f739627754f561667ce711588bcad9877c472d1d706df","source":{"kind":"arxiv","id":"1312.6840","version":3},"attestation_state":"computed","paper":{"title":"The k-metric dimension of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alejandro Estrada-Moreno, Ismael G. Yero, Juan A. Rodr\\'iguez-Vel\\'azquez","submitted_at":"2013-12-24T15:16:41Z","abstract_excerpt":"As a generalization of the concept of a metric basis, this article introduces the notion of $k$-metric basis in graphs. Given a connected graph $G=(V,E)$, a set $S\\subseteq V$ is said to be a $k$-metric generator for $G$ if the elements of any pair of different vertices of $G$ are distinguished by at least $k$ elements of $S$, i.e., for any two different vertices $u,v\\in V$, there exist at least $k$ vertices $w_1,w_2,...,w_k\\in S$ such that $d_G(u,w_i)\\ne d_G(v,w_i)$ for every $i\\in \\{1,...,k\\}$. A metric generator of minimum cardinality is called a $k$-metric basis and its cardinality the $k$"},"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":"1312.6840","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-24T15:16:41Z","cross_cats_sorted":[],"title_canon_sha256":"eac0e257a3577240caaccecfdd6ec30cab2b12c77bd157f3cdcbf7b30cbb94b2","abstract_canon_sha256":"b2c3fbab7197a905776928e5f24a911d8358c53b7ad34403b05a98f6f4dc07a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:58.823589Z","signature_b64":"l5Unn8/yT90utdtn21kk4O8+iFSGbXhun9j3FHGaTWgjh05l/C4VKi0QXx3tmrlHtsAdTfq6T6n1TOBzIxiJCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbccffd6d7a62927842f739627754f561667ce711588bcad9877c472d1d706df","last_reissued_at":"2026-05-18T02:27:58.823160Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:58.823160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The k-metric dimension of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alejandro Estrada-Moreno, Ismael G. Yero, Juan A. Rodr\\'iguez-Vel\\'azquez","submitted_at":"2013-12-24T15:16:41Z","abstract_excerpt":"As a generalization of the concept of a metric basis, this article introduces the notion of $k$-metric basis in graphs. Given a connected graph $G=(V,E)$, a set $S\\subseteq V$ is said to be a $k$-metric generator for $G$ if the elements of any pair of different vertices of $G$ are distinguished by at least $k$ elements of $S$, i.e., for any two different vertices $u,v\\in V$, there exist at least $k$ vertices $w_1,w_2,...,w_k\\in S$ such that $d_G(u,w_i)\\ne d_G(v,w_i)$ for every $i\\in \\{1,...,k\\}$. A metric generator of minimum cardinality is called a $k$-metric basis and its cardinality the $k$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.6840","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1312.6840","created_at":"2026-05-18T02:27:58.823215+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.6840v3","created_at":"2026-05-18T02:27:58.823215+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6840","created_at":"2026-05-18T02:27:58.823215+00:00"},{"alias_kind":"pith_short_12","alias_value":"XPGP7VWXUYUS","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"XPGP7VWXUYUSPBBP","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"XPGP7VWX","created_at":"2026-05-18T12:28:06.772260+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2409.12199","citing_title":"Fault Tolerant Metric Dimensions of Leafless Cacti Graphs with Application in Supply Chain Management","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XPGP7VWXUYUSPBBPOOLCO5KPKY","json":"https://pith.science/pith/XPGP7VWXUYUSPBBPOOLCO5KPKY.json","graph_json":"https://pith.science/api/pith-number/XPGP7VWXUYUSPBBPOOLCO5KPKY/graph.json","events_json":"https://pith.science/api/pith-number/XPGP7VWXUYUSPBBPOOLCO5KPKY/events.json","paper":"https://pith.science/paper/XPGP7VWX"},"agent_actions":{"view_html":"https://pith.science/pith/XPGP7VWXUYUSPBBPOOLCO5KPKY","download_json":"https://pith.science/pith/XPGP7VWXUYUSPBBPOOLCO5KPKY.json","view_paper":"https://pith.science/paper/XPGP7VWX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.6840&json=true","fetch_graph":"https://pith.science/api/pith-number/XPGP7VWXUYUSPBBPOOLCO5KPKY/graph.json","fetch_events":"https://pith.science/api/pith-number/XPGP7VWXUYUSPBBPOOLCO5KPKY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XPGP7VWXUYUSPBBPOOLCO5KPKY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XPGP7VWXUYUSPBBPOOLCO5KPKY/action/storage_attestation","attest_author":"https://pith.science/pith/XPGP7VWXUYUSPBBPOOLCO5KPKY/action/author_attestation","sign_citation":"https://pith.science/pith/XPGP7VWXUYUSPBBPOOLCO5KPKY/action/citation_signature","submit_replication":"https://pith.science/pith/XPGP7VWXUYUSPBBPOOLCO5KPKY/action/replication_record"}},"created_at":"2026-05-18T02:27:58.823215+00:00","updated_at":"2026-05-18T02:27:58.823215+00:00"}