{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LUFA7Z6CNGLXU3MQ2AMR4GH3IB","short_pith_number":"pith:LUFA7Z6C","schema_version":"1.0","canonical_sha256":"5d0a0fe7c269977a6d90d0191e18fb40467feea5bcabe61ad97f69117bd0b7a9","source":{"kind":"arxiv","id":"1505.06155","version":1},"attestation_state":"computed","paper":{"title":"The local metric dimension of strong product graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gabriel A. Barragan-Ramirez, Juan A. Rodriguez-Velazquez","submitted_at":"2015-05-22T17:24:05Z","abstract_excerpt":"A vertex $v\\in V(G)$ is said to distinguish two vertices $x,y\\in V(G)$ of a nontrivial connected graph $G$ if the distance from $v$ to $x$ is different from the distance from $v$ to $y$. A set $S\\subset V(G)$ is a local metric generator for $G$ if every two adjacent vertices of $G$ are distinguished by some vertex of $S$. A local metric generator with the minimum cardinality is called a local metric basis for $G$ and its cardinality, the local metric dimension of $G$. It is known that the problem of computing the local metric dimension of a graph is NP-Complete. In this paper we study the prob"},"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":"1505.06155","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-22T17:24:05Z","cross_cats_sorted":[],"title_canon_sha256":"431c1674d23a61117dc391ef8c53a8744f609fe98c149113fe881a01f350399c","abstract_canon_sha256":"c7c4dbde38df5852669dff93cd3f0d29c8084a57d1f8d8958278900c612ea800"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:48.913305Z","signature_b64":"SH0BUckcP/ufPsp0vBJi7Umt5QT9PJ/YdZ33HPnHBL8RFhKiFpFxu9HjG/JCzoT8aa9oORHj+rhyCifQMAHVDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d0a0fe7c269977a6d90d0191e18fb40467feea5bcabe61ad97f69117bd0b7a9","last_reissued_at":"2026-05-18T02:03:48.912559Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:48.912559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The local metric dimension of strong product graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gabriel A. Barragan-Ramirez, Juan A. Rodriguez-Velazquez","submitted_at":"2015-05-22T17:24:05Z","abstract_excerpt":"A vertex $v\\in V(G)$ is said to distinguish two vertices $x,y\\in V(G)$ of a nontrivial connected graph $G$ if the distance from $v$ to $x$ is different from the distance from $v$ to $y$. A set $S\\subset V(G)$ is a local metric generator for $G$ if every two adjacent vertices of $G$ are distinguished by some vertex of $S$. A local metric generator with the minimum cardinality is called a local metric basis for $G$ and its cardinality, the local metric dimension of $G$. It is known that the problem of computing the local metric dimension of a graph is NP-Complete. In this paper we study the prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06155","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":"1505.06155","created_at":"2026-05-18T02:03:48.912667+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.06155v1","created_at":"2026-05-18T02:03:48.912667+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06155","created_at":"2026-05-18T02:03:48.912667+00:00"},{"alias_kind":"pith_short_12","alias_value":"LUFA7Z6CNGLX","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LUFA7Z6CNGLXU3MQ","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LUFA7Z6C","created_at":"2026-05-18T12:29:29.992203+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/LUFA7Z6CNGLXU3MQ2AMR4GH3IB","json":"https://pith.science/pith/LUFA7Z6CNGLXU3MQ2AMR4GH3IB.json","graph_json":"https://pith.science/api/pith-number/LUFA7Z6CNGLXU3MQ2AMR4GH3IB/graph.json","events_json":"https://pith.science/api/pith-number/LUFA7Z6CNGLXU3MQ2AMR4GH3IB/events.json","paper":"https://pith.science/paper/LUFA7Z6C"},"agent_actions":{"view_html":"https://pith.science/pith/LUFA7Z6CNGLXU3MQ2AMR4GH3IB","download_json":"https://pith.science/pith/LUFA7Z6CNGLXU3MQ2AMR4GH3IB.json","view_paper":"https://pith.science/paper/LUFA7Z6C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.06155&json=true","fetch_graph":"https://pith.science/api/pith-number/LUFA7Z6CNGLXU3MQ2AMR4GH3IB/graph.json","fetch_events":"https://pith.science/api/pith-number/LUFA7Z6CNGLXU3MQ2AMR4GH3IB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LUFA7Z6CNGLXU3MQ2AMR4GH3IB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LUFA7Z6CNGLXU3MQ2AMR4GH3IB/action/storage_attestation","attest_author":"https://pith.science/pith/LUFA7Z6CNGLXU3MQ2AMR4GH3IB/action/author_attestation","sign_citation":"https://pith.science/pith/LUFA7Z6CNGLXU3MQ2AMR4GH3IB/action/citation_signature","submit_replication":"https://pith.science/pith/LUFA7Z6CNGLXU3MQ2AMR4GH3IB/action/replication_record"}},"created_at":"2026-05-18T02:03:48.912667+00:00","updated_at":"2026-05-18T02:03:48.912667+00:00"}