{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:QEJNAN2ORES5HGBCA7NOHEXKAP","short_pith_number":"pith:QEJNAN2O","canonical_record":{"source":{"id":"1103.3336","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-17T05:29:26Z","cross_cats_sorted":[],"title_canon_sha256":"5ba690a1d7a893a20100da0e7b667674c0a48aef5c6d3471246c90aa034a9c51","abstract_canon_sha256":"5c5043ae61adf4b8330f8e70e2caf0e072f8ae9679e0e0a98936bc28508b981c"},"schema_version":"1.0"},"canonical_sha256":"8112d0374e8925d3982207dae392ea03d4d9cf6dd7a355f3cd791401fd2a33fe","source":{"kind":"arxiv","id":"1103.3336","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.3336","created_at":"2026-05-18T04:26:33Z"},{"alias_kind":"arxiv_version","alias_value":"1103.3336v1","created_at":"2026-05-18T04:26:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.3336","created_at":"2026-05-18T04:26:33Z"},{"alias_kind":"pith_short_12","alias_value":"QEJNAN2ORES5","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QEJNAN2ORES5HGBC","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QEJNAN2O","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:QEJNAN2ORES5HGBCA7NOHEXKAP","target":"record","payload":{"canonical_record":{"source":{"id":"1103.3336","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-17T05:29:26Z","cross_cats_sorted":[],"title_canon_sha256":"5ba690a1d7a893a20100da0e7b667674c0a48aef5c6d3471246c90aa034a9c51","abstract_canon_sha256":"5c5043ae61adf4b8330f8e70e2caf0e072f8ae9679e0e0a98936bc28508b981c"},"schema_version":"1.0"},"canonical_sha256":"8112d0374e8925d3982207dae392ea03d4d9cf6dd7a355f3cd791401fd2a33fe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:26:33.937032Z","signature_b64":"hojjbhRqcrPu8Acu0HfX00kKqO3Xs12Il2A0vHOPRdHGOBOJeLVOC8D89lzRsdSa+wV5z+3tsA/r12mAh/71BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8112d0374e8925d3982207dae392ea03d4d9cf6dd7a355f3cd791401fd2a33fe","last_reissued_at":"2026-05-18T04:26:33.936442Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:26:33.936442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.3336","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:26:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aQvAb5ct2mMKsGcCkxS0A0XqeK7b0LULmbfMa/Gso+npHRg7Bglg0Il/wstPMYefzUilcDbUty/Ct6QJ2junBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T01:05:35.013379Z"},"content_sha256":"fae21e97443534a1fe46f1f9f77536948df22319fd50cf7e47c5078d7be79cc6","schema_version":"1.0","event_id":"sha256:fae21e97443534a1fe46f1f9f77536948df22319fd50cf7e47c5078d7be79cc6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:QEJNAN2ORES5HGBCA7NOHEXKAP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Metric Dimension of Lexicographic Product of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Behnaz Omoomi, Mohsen Jannesari","submitted_at":"2011-03-17T05:29:26Z","abstract_excerpt":"For an ordered set $W=\\{w_1,w_2,...,w_k\\}$ of vertices and a vertex $v$ in a connected graph $G$, the ordered $k$-vector $r(v|W):=(d(v,w_1),d(v,w_2),...,d(v,w_k))$ is called the (metric) representation of $v$ with respect to $W$, where $d(x,y)$ is the distance between the vertices $x$ and $y$. The set $W$ is called a resolving set for $G$ if distinct vertices of $G$ have distinct representations with respect to $W$. The minimum cardinality of a resolving set for $G$ is its metric dimension. In this paper, we study the metric dimension of the lexicographic product of graphs $G$ and $H$, $G[H]$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.3336","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:26:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QHoK3gpfrhWESMjF1wXQzAK/x7ajbVcWY1ahr3O56LneZr2krBovfQkEvw0fZRDYX2CQMCc3Zp2ts54Vd0XSCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T01:05:35.013725Z"},"content_sha256":"8d00c606e56785227f921edef880ee562074f666e463ab0baa21b7d3fa493a92","schema_version":"1.0","event_id":"sha256:8d00c606e56785227f921edef880ee562074f666e463ab0baa21b7d3fa493a92"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QEJNAN2ORES5HGBCA7NOHEXKAP/bundle.json","state_url":"https://pith.science/pith/QEJNAN2ORES5HGBCA7NOHEXKAP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QEJNAN2ORES5HGBCA7NOHEXKAP/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-26T01:05:35Z","links":{"resolver":"https://pith.science/pith/QEJNAN2ORES5HGBCA7NOHEXKAP","bundle":"https://pith.science/pith/QEJNAN2ORES5HGBCA7NOHEXKAP/bundle.json","state":"https://pith.science/pith/QEJNAN2ORES5HGBCA7NOHEXKAP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QEJNAN2ORES5HGBCA7NOHEXKAP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:QEJNAN2ORES5HGBCA7NOHEXKAP","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":"5c5043ae61adf4b8330f8e70e2caf0e072f8ae9679e0e0a98936bc28508b981c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-17T05:29:26Z","title_canon_sha256":"5ba690a1d7a893a20100da0e7b667674c0a48aef5c6d3471246c90aa034a9c51"},"schema_version":"1.0","source":{"id":"1103.3336","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.3336","created_at":"2026-05-18T04:26:33Z"},{"alias_kind":"arxiv_version","alias_value":"1103.3336v1","created_at":"2026-05-18T04:26:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.3336","created_at":"2026-05-18T04:26:33Z"},{"alias_kind":"pith_short_12","alias_value":"QEJNAN2ORES5","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QEJNAN2ORES5HGBC","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QEJNAN2O","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:8d00c606e56785227f921edef880ee562074f666e463ab0baa21b7d3fa493a92","target":"graph","created_at":"2026-05-18T04:26:33Z","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":"For an ordered set $W=\\{w_1,w_2,...,w_k\\}$ of vertices and a vertex $v$ in a connected graph $G$, the ordered $k$-vector $r(v|W):=(d(v,w_1),d(v,w_2),...,d(v,w_k))$ is called the (metric) representation of $v$ with respect to $W$, where $d(x,y)$ is the distance between the vertices $x$ and $y$. The set $W$ is called a resolving set for $G$ if distinct vertices of $G$ have distinct representations with respect to $W$. The minimum cardinality of a resolving set for $G$ is its metric dimension. In this paper, we study the metric dimension of the lexicographic product of graphs $G$ and $H$, $G[H]$.","authors_text":"Behnaz Omoomi, Mohsen Jannesari","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-17T05:29:26Z","title":"The Metric Dimension of Lexicographic Product of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.3336","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:fae21e97443534a1fe46f1f9f77536948df22319fd50cf7e47c5078d7be79cc6","target":"record","created_at":"2026-05-18T04:26:33Z","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":"5c5043ae61adf4b8330f8e70e2caf0e072f8ae9679e0e0a98936bc28508b981c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-17T05:29:26Z","title_canon_sha256":"5ba690a1d7a893a20100da0e7b667674c0a48aef5c6d3471246c90aa034a9c51"},"schema_version":"1.0","source":{"id":"1103.3336","kind":"arxiv","version":1}},"canonical_sha256":"8112d0374e8925d3982207dae392ea03d4d9cf6dd7a355f3cd791401fd2a33fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8112d0374e8925d3982207dae392ea03d4d9cf6dd7a355f3cd791401fd2a33fe","first_computed_at":"2026-05-18T04:26:33.936442Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:26:33.936442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hojjbhRqcrPu8Acu0HfX00kKqO3Xs12Il2A0vHOPRdHGOBOJeLVOC8D89lzRsdSa+wV5z+3tsA/r12mAh/71BA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:26:33.937032Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.3336","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fae21e97443534a1fe46f1f9f77536948df22319fd50cf7e47c5078d7be79cc6","sha256:8d00c606e56785227f921edef880ee562074f666e463ab0baa21b7d3fa493a92"],"state_sha256":"df884ba1b66b8f220a0275572900680fecfa7621eb627061e7e9c4c37566bb37"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EhRgI0OzlGYQhSDhsLeua4b87QydUE4Wn+t3G+glKPohgoCdtMJ88lnW7p6XZCugUDMT2q0xRJBYpsICPSQjBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T01:05:35.015727Z","bundle_sha256":"b0742395ebf98b53ad3eeb68206579c7c34cd363ebae157e088f09e0f1305f25"}}