{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:OMXKOKFCOGTA3GPC6ZHJGNMOJU","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"957a9f43cf75ba4728e1a98e564f22a784920afa47956d50a697549b709ead5c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-11T21:08:25Z","title_canon_sha256":"d24ee2ccdb8eb93bf0cccfe1e126a255e579f764aad5abc450c4de01d1f93316"},"schema_version":"1.0","source":{"id":"1402.2663","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2663","created_at":"2026-05-18T02:59:17Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2663v1","created_at":"2026-05-18T02:59:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2663","created_at":"2026-05-18T02:59:17Z"},{"alias_kind":"pith_short_12","alias_value":"OMXKOKFCOGTA","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"OMXKOKFCOGTA3GPC","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"OMXKOKFC","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:ba1a4397fa095638a8157086ab07d993350b35aa55d902bb2df81592c82b04e3","target":"graph","created_at":"2026-05-18T02:59:17Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Dorota Kuziak, Ismael G. Yero, Juan A. Rodriguez-Velazquez","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-11T21:08:25Z","title":"Closed formulae for the strong metric dimension of lexicographic product graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2663","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:abd69b836f5212944e7c4ceeb9c4bf4e107e2d892e0f34d9d7ef0a71d5b1adbf","target":"record","created_at":"2026-05-18T02:59:17Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"957a9f43cf75ba4728e1a98e564f22a784920afa47956d50a697549b709ead5c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-11T21:08:25Z","title_canon_sha256":"d24ee2ccdb8eb93bf0cccfe1e126a255e579f764aad5abc450c4de01d1f93316"},"schema_version":"1.0","source":{"id":"1402.2663","kind":"arxiv","version":1}},"canonical_sha256":"732ea728a271a60d99e2f64e93358e4d0f32a7285009537d66c2fef2e345623e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"732ea728a271a60d99e2f64e93358e4d0f32a7285009537d66c2fef2e345623e","first_computed_at":"2026-05-18T02:59:17.712537Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:59:17.712537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DAdNMNKbVsOF4CZ+bQQu8GiSWF/x4LOUocZj5NuKKZy5MmQXIHiC6KPfYkP7TUYO+UHw+Ky9cPNX/H00YMpoAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:59:17.713127Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.2663","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:abd69b836f5212944e7c4ceeb9c4bf4e107e2d892e0f34d9d7ef0a71d5b1adbf","sha256:ba1a4397fa095638a8157086ab07d993350b35aa55d902bb2df81592c82b04e3"],"state_sha256":"267a46c9c9162dc341dd9801cfc3fa2f470edca389ff142311af305030201cda"}