{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:JSZ3V6WT6D6AIDTYSMYEEHYIIE","short_pith_number":"pith:JSZ3V6WT","schema_version":"1.0","canonical_sha256":"4cb3bafad3f0fc040e789330421f084111ad35670a5d2c636f732c4af8265731","source":{"kind":"arxiv","id":"1402.0177","version":1},"attestation_state":"computed","paper":{"title":"Computing the local metric dimension of a graph from the local metric dimension of primary subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carlos Garc\\'ia G\\'omez, Gabriel A. Barrag\\'an-Ram\\'irez, Juan A. Rodr\\'iguez-Vel\\'azquez","submitted_at":"2014-02-02T11:37:39Z","abstract_excerpt":"For an ordered subset $W = \\{w_1, w_2,\\dots w_k\\}$ of vertices and a vertex $u$ in a connected graph $G$, the representation of $u$ with respect to $W$ is the ordered $k$-tuple $ r(u|W)=(d(v,w_1), d(v,w_2),\\dots,$ $d(v,w_k))$, where $d(x,y)$ represents the distance between the vertices $x$ and $y$. The set $W$ is a local metric generator for $G$ if every two adjacent vertices of $G$ have distinct representations. A minimum local metric generator is called a \\emph{local metric basis} for $G$ and its cardinality the \\emph{local metric dimension} of G. We show that the computation of the local me"},"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":"1402.0177","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-02T11:37:39Z","cross_cats_sorted":[],"title_canon_sha256":"96ca490fb48e8ba13fd79d0521edd3fa5bc268be050642605fb46c3e2f5d06e8","abstract_canon_sha256":"f707babed4f65da91c02857f04cadb7fa29c3df1734f468136da1d47402172c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:57.118586Z","signature_b64":"lITBTilgwtVHrpcmLW9Fd6ow0FVqnda5/fcCCVU2MCB8mpn27CZ4bpX2Brhn4wDFmqEXSFvbUTVWwa3xJlp9BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4cb3bafad3f0fc040e789330421f084111ad35670a5d2c636f732c4af8265731","last_reissued_at":"2026-05-18T01:33:57.118225Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:57.118225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing the local metric dimension of a graph from the local metric dimension of primary subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carlos Garc\\'ia G\\'omez, Gabriel A. Barrag\\'an-Ram\\'irez, Juan A. Rodr\\'iguez-Vel\\'azquez","submitted_at":"2014-02-02T11:37:39Z","abstract_excerpt":"For an ordered subset $W = \\{w_1, w_2,\\dots w_k\\}$ of vertices and a vertex $u$ in a connected graph $G$, the representation of $u$ with respect to $W$ is the ordered $k$-tuple $ r(u|W)=(d(v,w_1), d(v,w_2),\\dots,$ $d(v,w_k))$, where $d(x,y)$ represents the distance between the vertices $x$ and $y$. The set $W$ is a local metric generator for $G$ if every two adjacent vertices of $G$ have distinct representations. A minimum local metric generator is called a \\emph{local metric basis} for $G$ and its cardinality the \\emph{local metric dimension} of G. We show that the computation of the local me"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.0177","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":""},"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":"1402.0177","created_at":"2026-05-18T01:33:57.118279+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.0177v1","created_at":"2026-05-18T01:33:57.118279+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0177","created_at":"2026-05-18T01:33:57.118279+00:00"},{"alias_kind":"pith_short_12","alias_value":"JSZ3V6WT6D6A","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"JSZ3V6WT6D6AIDTY","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"JSZ3V6WT","created_at":"2026-05-18T12:28:35.611951+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/JSZ3V6WT6D6AIDTYSMYEEHYIIE","json":"https://pith.science/pith/JSZ3V6WT6D6AIDTYSMYEEHYIIE.json","graph_json":"https://pith.science/api/pith-number/JSZ3V6WT6D6AIDTYSMYEEHYIIE/graph.json","events_json":"https://pith.science/api/pith-number/JSZ3V6WT6D6AIDTYSMYEEHYIIE/events.json","paper":"https://pith.science/paper/JSZ3V6WT"},"agent_actions":{"view_html":"https://pith.science/pith/JSZ3V6WT6D6AIDTYSMYEEHYIIE","download_json":"https://pith.science/pith/JSZ3V6WT6D6AIDTYSMYEEHYIIE.json","view_paper":"https://pith.science/paper/JSZ3V6WT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.0177&json=true","fetch_graph":"https://pith.science/api/pith-number/JSZ3V6WT6D6AIDTYSMYEEHYIIE/graph.json","fetch_events":"https://pith.science/api/pith-number/JSZ3V6WT6D6AIDTYSMYEEHYIIE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JSZ3V6WT6D6AIDTYSMYEEHYIIE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JSZ3V6WT6D6AIDTYSMYEEHYIIE/action/storage_attestation","attest_author":"https://pith.science/pith/JSZ3V6WT6D6AIDTYSMYEEHYIIE/action/author_attestation","sign_citation":"https://pith.science/pith/JSZ3V6WT6D6AIDTYSMYEEHYIIE/action/citation_signature","submit_replication":"https://pith.science/pith/JSZ3V6WT6D6AIDTYSMYEEHYIIE/action/replication_record"}},"created_at":"2026-05-18T01:33:57.118279+00:00","updated_at":"2026-05-18T01:33:57.118279+00:00"}