{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:KEQTPRMR7BJXXREHUVZUXAXISP","short_pith_number":"pith:KEQTPRMR","schema_version":"1.0","canonical_sha256":"512137c591f8537bc487a5734b82e893ef3771a83523e852825c9a49be09db9d","source":{"kind":"arxiv","id":"1309.0641","version":2},"attestation_state":"computed","paper":{"title":"Computing the metric dimension of a graph from primary subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"D. Kuziak, I. G. Yero, J. A. Rodr\\'iguez-Vel\\'azquez","submitted_at":"2013-09-03T10:56:35Z","abstract_excerpt":"Let $G$ be a connected graph. Given an ordered set $W = \\{w_1, w_2,\\dots w_k\\}\\subseteq V(G)$ and a vertex $u\\in V(G)$, the representation of $u$ with respect to $W$ is the ordered $k$-tuple $(d(u,w_1), d(u,w_2),\\dots,$ $d(u,w_k))$, where $d(u,w_i)$ denotes the distance between $u$ and $w_i$. The set $W$ is a metric generator for $G$ if every two different vertices of $G$ have distinct representations. A minimum cardinality metric generator is called a \\emph{metric basis} of $G$ and its cardinality is called the \\emph{metric dimension} of G. It is well known that the problem of finding the met"},"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":"1309.0641","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-03T10:56:35Z","cross_cats_sorted":[],"title_canon_sha256":"553f21b42f48dea17b18709166d037fad7fe053fc8586f4357c7d618ade68359","abstract_canon_sha256":"b3ad23a6b5f3bc9b1f2c1260338513018c710bc6b79723781e0db217d03d2722"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:32.859375Z","signature_b64":"jlqTDDAECdl9ZcpmranEYSwl3yCl+yG9hZXbO0PySZqg3NtdyJ468VH2thN7ydkrfdtfHtnzqE0wwlRuJO6hCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"512137c591f8537bc487a5734b82e893ef3771a83523e852825c9a49be09db9d","last_reissued_at":"2026-05-18T02:27:32.858576Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:32.858576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing the metric dimension of a graph from primary subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"D. Kuziak, I. G. Yero, J. A. Rodr\\'iguez-Vel\\'azquez","submitted_at":"2013-09-03T10:56:35Z","abstract_excerpt":"Let $G$ be a connected graph. Given an ordered set $W = \\{w_1, w_2,\\dots w_k\\}\\subseteq V(G)$ and a vertex $u\\in V(G)$, the representation of $u$ with respect to $W$ is the ordered $k$-tuple $(d(u,w_1), d(u,w_2),\\dots,$ $d(u,w_k))$, where $d(u,w_i)$ denotes the distance between $u$ and $w_i$. The set $W$ is a metric generator for $G$ if every two different vertices of $G$ have distinct representations. A minimum cardinality metric generator is called a \\emph{metric basis} of $G$ and its cardinality is called the \\emph{metric dimension} of G. It is well known that the problem of finding the met"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.0641","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":"1309.0641","created_at":"2026-05-18T02:27:32.858698+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.0641v2","created_at":"2026-05-18T02:27:32.858698+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0641","created_at":"2026-05-18T02:27:32.858698+00:00"},{"alias_kind":"pith_short_12","alias_value":"KEQTPRMR7BJX","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"KEQTPRMR7BJXXREH","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"KEQTPRMR","created_at":"2026-05-18T12:27:49.015174+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/KEQTPRMR7BJXXREHUVZUXAXISP","json":"https://pith.science/pith/KEQTPRMR7BJXXREHUVZUXAXISP.json","graph_json":"https://pith.science/api/pith-number/KEQTPRMR7BJXXREHUVZUXAXISP/graph.json","events_json":"https://pith.science/api/pith-number/KEQTPRMR7BJXXREHUVZUXAXISP/events.json","paper":"https://pith.science/paper/KEQTPRMR"},"agent_actions":{"view_html":"https://pith.science/pith/KEQTPRMR7BJXXREHUVZUXAXISP","download_json":"https://pith.science/pith/KEQTPRMR7BJXXREHUVZUXAXISP.json","view_paper":"https://pith.science/paper/KEQTPRMR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.0641&json=true","fetch_graph":"https://pith.science/api/pith-number/KEQTPRMR7BJXXREHUVZUXAXISP/graph.json","fetch_events":"https://pith.science/api/pith-number/KEQTPRMR7BJXXREHUVZUXAXISP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KEQTPRMR7BJXXREHUVZUXAXISP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KEQTPRMR7BJXXREHUVZUXAXISP/action/storage_attestation","attest_author":"https://pith.science/pith/KEQTPRMR7BJXXREHUVZUXAXISP/action/author_attestation","sign_citation":"https://pith.science/pith/KEQTPRMR7BJXXREHUVZUXAXISP/action/citation_signature","submit_replication":"https://pith.science/pith/KEQTPRMR7BJXXREHUVZUXAXISP/action/replication_record"}},"created_at":"2026-05-18T02:27:32.858698+00:00","updated_at":"2026-05-18T02:27:32.858698+00:00"}