{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:FA3RMQ2CXRDHPRUVLSNYG43GGC","short_pith_number":"pith:FA3RMQ2C","schema_version":"1.0","canonical_sha256":"2837164342bc4677c6955c9b8373663081abb05466f1477b30bb18f180a5f509","source":{"kind":"arxiv","id":"1401.0342","version":2},"attestation_state":"computed","paper":{"title":"On the complexity of computing the $k$-metric dimension of graphs","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. Rodriguez-Velazquez","submitted_at":"2014-01-01T22:44:25Z","abstract_excerpt":"Given a connected graph $G=(V,E)$, a set $S\\subseteq V$ is a $k$-metric generator for $G$ if for any two different vertices $u,v\\in V$, there exist at least $k$ vertices $w_1,...,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$-metric dimension of $G$. We study some problems regarding the complexity of some $k$-metric dimension problems. For instance, we show that the problem of computing the $k$-metric dimension of graphs is $NP$-Complete. However, the problem is solv"},"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":"1401.0342","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-01T22:44:25Z","cross_cats_sorted":[],"title_canon_sha256":"f076696b2bbc2834a70800feee55db7a369b1d07b12c588fd8761545f54e524f","abstract_canon_sha256":"2340ab6c4b2d1e90a1c23ae04f843fdbae23bd09f03748d80370cf55342f1e41"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:13.534217Z","signature_b64":"B93iaQrXtMe1Dc+2qSaZ2+yhZaG6kjR5ESoBEGxCofUgZ9bH21XFEB7CuCoUycelmb0Xdasq0wQ41UQRz/HDAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2837164342bc4677c6955c9b8373663081abb05466f1477b30bb18f180a5f509","last_reissued_at":"2026-05-18T01:29:13.533627Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:13.533627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the complexity of computing the $k$-metric dimension of graphs","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. Rodriguez-Velazquez","submitted_at":"2014-01-01T22:44:25Z","abstract_excerpt":"Given a connected graph $G=(V,E)$, a set $S\\subseteq V$ is a $k$-metric generator for $G$ if for any two different vertices $u,v\\in V$, there exist at least $k$ vertices $w_1,...,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$-metric dimension of $G$. We study some problems regarding the complexity of some $k$-metric dimension problems. For instance, we show that the problem of computing the $k$-metric dimension of graphs is $NP$-Complete. However, the problem is solv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0342","kind":"arxiv","version":2},"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":"1401.0342","created_at":"2026-05-18T01:29:13.533712+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.0342v2","created_at":"2026-05-18T01:29:13.533712+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0342","created_at":"2026-05-18T01:29:13.533712+00:00"},{"alias_kind":"pith_short_12","alias_value":"FA3RMQ2CXRDH","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"FA3RMQ2CXRDHPRUV","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"FA3RMQ2C","created_at":"2026-05-18T12:28:28.263976+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/FA3RMQ2CXRDHPRUVLSNYG43GGC","json":"https://pith.science/pith/FA3RMQ2CXRDHPRUVLSNYG43GGC.json","graph_json":"https://pith.science/api/pith-number/FA3RMQ2CXRDHPRUVLSNYG43GGC/graph.json","events_json":"https://pith.science/api/pith-number/FA3RMQ2CXRDHPRUVLSNYG43GGC/events.json","paper":"https://pith.science/paper/FA3RMQ2C"},"agent_actions":{"view_html":"https://pith.science/pith/FA3RMQ2CXRDHPRUVLSNYG43GGC","download_json":"https://pith.science/pith/FA3RMQ2CXRDHPRUVLSNYG43GGC.json","view_paper":"https://pith.science/paper/FA3RMQ2C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.0342&json=true","fetch_graph":"https://pith.science/api/pith-number/FA3RMQ2CXRDHPRUVLSNYG43GGC/graph.json","fetch_events":"https://pith.science/api/pith-number/FA3RMQ2CXRDHPRUVLSNYG43GGC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FA3RMQ2CXRDHPRUVLSNYG43GGC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FA3RMQ2CXRDHPRUVLSNYG43GGC/action/storage_attestation","attest_author":"https://pith.science/pith/FA3RMQ2CXRDHPRUVLSNYG43GGC/action/author_attestation","sign_citation":"https://pith.science/pith/FA3RMQ2CXRDHPRUVLSNYG43GGC/action/citation_signature","submit_replication":"https://pith.science/pith/FA3RMQ2CXRDHPRUVLSNYG43GGC/action/replication_record"}},"created_at":"2026-05-18T01:29:13.533712+00:00","updated_at":"2026-05-18T01:29:13.533712+00:00"}