{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:OMXKOKFCOGTA3GPC6ZHJGNMOJU","short_pith_number":"pith:OMXKOKFC","schema_version":"1.0","canonical_sha256":"732ea728a271a60d99e2f64e93358e4d0f32a7285009537d66c2fef2e345623e","source":{"kind":"arxiv","id":"1402.2663","version":1},"attestation_state":"computed","paper":{"title":"Closed formulae for the strong metric dimension of lexicographic product graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dorota Kuziak, Ismael G. Yero, Juan A. Rodriguez-Velazquez","submitted_at":"2014-02-11T21:08:25Z","abstract_excerpt":"Given a connected graph $G$, a vertex $w\\in V(G)$ strongly resolves two vertices $u,v\\in V(G)$ if there exists some shortest $u-w$ path containing $v$ or some shortest $v-w$ path containing $u$. A set $S$ of vertices is a strong metric generator for $G$ if every pair of vertices of $G$ is strongly resolved by some vertex of $S$. The smallest cardinality of a strong metric generator for $G$ is called the strong metric dimension of $G$. In this paper we obtain several relationships between the strong metric dimension of the lexicographic product of graphs and the strong metric dimension of its f"},"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.2663","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-11T21:08:25Z","cross_cats_sorted":[],"title_canon_sha256":"d24ee2ccdb8eb93bf0cccfe1e126a255e579f764aad5abc450c4de01d1f93316","abstract_canon_sha256":"957a9f43cf75ba4728e1a98e564f22a784920afa47956d50a697549b709ead5c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:17.713127Z","signature_b64":"DAdNMNKbVsOF4CZ+bQQu8GiSWF/x4LOUocZj5NuKKZy5MmQXIHiC6KPfYkP7TUYO+UHw+Ky9cPNX/H00YMpoAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"732ea728a271a60d99e2f64e93358e4d0f32a7285009537d66c2fef2e345623e","last_reissued_at":"2026-05-18T02:59:17.712537Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:17.712537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Closed formulae for the strong metric dimension of lexicographic product graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dorota Kuziak, Ismael G. Yero, Juan A. Rodriguez-Velazquez","submitted_at":"2014-02-11T21:08:25Z","abstract_excerpt":"Given a connected graph $G$, a vertex $w\\in V(G)$ strongly resolves two vertices $u,v\\in V(G)$ if there exists some shortest $u-w$ path containing $v$ or some shortest $v-w$ path containing $u$. A set $S$ of vertices is a strong metric generator for $G$ if every pair of vertices of $G$ is strongly resolved by some vertex of $S$. The smallest cardinality of a strong metric generator for $G$ is called the strong metric dimension of $G$. In this paper we obtain several relationships between the strong metric dimension of the lexicographic product of graphs and the strong metric dimension of its f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2663","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.2663","created_at":"2026-05-18T02:59:17.712623+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.2663v1","created_at":"2026-05-18T02:59:17.712623+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2663","created_at":"2026-05-18T02:59:17.712623+00:00"},{"alias_kind":"pith_short_12","alias_value":"OMXKOKFCOGTA","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"OMXKOKFCOGTA3GPC","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"OMXKOKFC","created_at":"2026-05-18T12:28:41.024544+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/OMXKOKFCOGTA3GPC6ZHJGNMOJU","json":"https://pith.science/pith/OMXKOKFCOGTA3GPC6ZHJGNMOJU.json","graph_json":"https://pith.science/api/pith-number/OMXKOKFCOGTA3GPC6ZHJGNMOJU/graph.json","events_json":"https://pith.science/api/pith-number/OMXKOKFCOGTA3GPC6ZHJGNMOJU/events.json","paper":"https://pith.science/paper/OMXKOKFC"},"agent_actions":{"view_html":"https://pith.science/pith/OMXKOKFCOGTA3GPC6ZHJGNMOJU","download_json":"https://pith.science/pith/OMXKOKFCOGTA3GPC6ZHJGNMOJU.json","view_paper":"https://pith.science/paper/OMXKOKFC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.2663&json=true","fetch_graph":"https://pith.science/api/pith-number/OMXKOKFCOGTA3GPC6ZHJGNMOJU/graph.json","fetch_events":"https://pith.science/api/pith-number/OMXKOKFCOGTA3GPC6ZHJGNMOJU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OMXKOKFCOGTA3GPC6ZHJGNMOJU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OMXKOKFCOGTA3GPC6ZHJGNMOJU/action/storage_attestation","attest_author":"https://pith.science/pith/OMXKOKFCOGTA3GPC6ZHJGNMOJU/action/author_attestation","sign_citation":"https://pith.science/pith/OMXKOKFCOGTA3GPC6ZHJGNMOJU/action/citation_signature","submit_replication":"https://pith.science/pith/OMXKOKFCOGTA3GPC6ZHJGNMOJU/action/replication_record"}},"created_at":"2026-05-18T02:59:17.712623+00:00","updated_at":"2026-05-18T02:59:17.712623+00:00"}