{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:XOAMZ6MBVQOFJSYVVWBLJIYAMD","short_pith_number":"pith:XOAMZ6MB","schema_version":"1.0","canonical_sha256":"bb80ccf981ac1c54cb15ad82b4a30060c37dab894e13e1bfd3ffc11c6db4b7a0","source":{"kind":"arxiv","id":"1809.08900","version":1},"attestation_state":"computed","paper":{"title":"Edge metric dimension of some graph operations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ismael G. Yero, Iztok Peterin","submitted_at":"2018-09-24T13:18:13Z","abstract_excerpt":"Let $G=(V, E)$ be a connected graph. Given a vertex $v\\in V$ and an edge $e=uw\\in E$, the distance between $v$ and $e$ is defined as $d_G(e,v)=\\min\\{d_G(u,v),d_G(w,v)\\}$. A nonempty set $S\\subset V$ is an edge metric generator for $G$ if for any two edges $e_1,e_2\\in E$ there is a vertex $w\\in S$ such that $d_G(w,e_1)\\ne d_G(w,e_2)$. The minimum cardinality of any edge metric generator for a graph $G$ is the edge metric dimension of $G$. The edge metric dimension of the join, lexicographic and corona product of graphs is studied in this article."},"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":"1809.08900","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-24T13:18:13Z","cross_cats_sorted":[],"title_canon_sha256":"51e47217d7f10413de553546f916097b992884e062bdb81d21339a567166e02c","abstract_canon_sha256":"cca7471595acdff51982bfcf0496934a3e19e7d7adca1599b80f592dc8d5ebb5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:03.250686Z","signature_b64":"P6FfhTg9RNZmQQzLbPMlvakIH2azplcwZHNNRou3WN8vF4fiJZ4gBPPi9NKII0rs5HO1MMVKuL2YlBECsZp3Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb80ccf981ac1c54cb15ad82b4a30060c37dab894e13e1bfd3ffc11c6db4b7a0","last_reissued_at":"2026-05-18T00:05:03.250239Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:03.250239Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Edge metric dimension of some graph operations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ismael G. Yero, Iztok Peterin","submitted_at":"2018-09-24T13:18:13Z","abstract_excerpt":"Let $G=(V, E)$ be a connected graph. Given a vertex $v\\in V$ and an edge $e=uw\\in E$, the distance between $v$ and $e$ is defined as $d_G(e,v)=\\min\\{d_G(u,v),d_G(w,v)\\}$. A nonempty set $S\\subset V$ is an edge metric generator for $G$ if for any two edges $e_1,e_2\\in E$ there is a vertex $w\\in S$ such that $d_G(w,e_1)\\ne d_G(w,e_2)$. The minimum cardinality of any edge metric generator for a graph $G$ is the edge metric dimension of $G$. The edge metric dimension of the join, lexicographic and corona product of graphs is studied in this article."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08900","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":"1809.08900","created_at":"2026-05-18T00:05:03.250310+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.08900v1","created_at":"2026-05-18T00:05:03.250310+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08900","created_at":"2026-05-18T00:05:03.250310+00:00"},{"alias_kind":"pith_short_12","alias_value":"XOAMZ6MBVQOF","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"XOAMZ6MBVQOFJSYV","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"XOAMZ6MB","created_at":"2026-05-18T12:33:01.666342+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/XOAMZ6MBVQOFJSYVVWBLJIYAMD","json":"https://pith.science/pith/XOAMZ6MBVQOFJSYVVWBLJIYAMD.json","graph_json":"https://pith.science/api/pith-number/XOAMZ6MBVQOFJSYVVWBLJIYAMD/graph.json","events_json":"https://pith.science/api/pith-number/XOAMZ6MBVQOFJSYVVWBLJIYAMD/events.json","paper":"https://pith.science/paper/XOAMZ6MB"},"agent_actions":{"view_html":"https://pith.science/pith/XOAMZ6MBVQOFJSYVVWBLJIYAMD","download_json":"https://pith.science/pith/XOAMZ6MBVQOFJSYVVWBLJIYAMD.json","view_paper":"https://pith.science/paper/XOAMZ6MB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.08900&json=true","fetch_graph":"https://pith.science/api/pith-number/XOAMZ6MBVQOFJSYVVWBLJIYAMD/graph.json","fetch_events":"https://pith.science/api/pith-number/XOAMZ6MBVQOFJSYVVWBLJIYAMD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XOAMZ6MBVQOFJSYVVWBLJIYAMD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XOAMZ6MBVQOFJSYVVWBLJIYAMD/action/storage_attestation","attest_author":"https://pith.science/pith/XOAMZ6MBVQOFJSYVVWBLJIYAMD/action/author_attestation","sign_citation":"https://pith.science/pith/XOAMZ6MBVQOFJSYVVWBLJIYAMD/action/citation_signature","submit_replication":"https://pith.science/pith/XOAMZ6MBVQOFJSYVVWBLJIYAMD/action/replication_record"}},"created_at":"2026-05-18T00:05:03.250310+00:00","updated_at":"2026-05-18T00:05:03.250310+00:00"}