{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BK4FJBXWIVJ5VNVEXYC4DXFENS","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":"a00751f12799c53eced2de8b2816117545ab65fdc010c9d4ce36949cc5fa0482","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-31T17:48:23Z","title_canon_sha256":"489c34b9d8af03754c15126097a693294911ae40b7c8c72ea4ac4ef1a16d69e2"},"schema_version":"1.0","source":{"id":"1602.00291","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.00291","created_at":"2026-05-18T01:21:35Z"},{"alias_kind":"arxiv_version","alias_value":"1602.00291v1","created_at":"2026-05-18T01:21:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00291","created_at":"2026-05-18T01:21:35Z"},{"alias_kind":"pith_short_12","alias_value":"BK4FJBXWIVJ5","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BK4FJBXWIVJ5VNVE","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BK4FJBXW","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:ae0bb567369ecd0357a76bb58919357fca4bede34f40c404775b9c830182d17d","target":"graph","created_at":"2026-05-18T01:21:35Z","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":"Let $G=(V,E)$ be a connected graph, let $v\\in V$ be a vertex and let $e=uw\\in E$ be an edge. The distance between the vertex $v$ and the edge $e$ is given by $d_G(e,v)=\\min\\{d_G(u,v),d_G(w,v)\\}$. A vertex $w\\in V$ distinguishes two edges $e_1,e_2\\in E$ if $d_G(w,e_1)\\ne d_G(w,e_2)$. A set $S$ of vertices in a connected graph $G$ is an edge metric generator for $G$ if every two edges of $G$ are distinguished by some vertex of $S$. The smallest cardinality of an edge metric generator for $G$ is called the edge metric dimension and is denoted by $edim(G)$. In this article we introduce the concept","authors_text":"Aleksander Kelenc, Ismael G. Yero, Niko Tratnik","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-31T17:48:23Z","title":"Uniquely identifying the edges of a graph: the edge metric dimension"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00291","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:551f31ba82ed62fc648e6b26373aabd02d9229c1ac6cd0228adabba0fd33790a","target":"record","created_at":"2026-05-18T01:21:35Z","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":"a00751f12799c53eced2de8b2816117545ab65fdc010c9d4ce36949cc5fa0482","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-31T17:48:23Z","title_canon_sha256":"489c34b9d8af03754c15126097a693294911ae40b7c8c72ea4ac4ef1a16d69e2"},"schema_version":"1.0","source":{"id":"1602.00291","kind":"arxiv","version":1}},"canonical_sha256":"0ab85486f64553dab6a4be05c1dca46c8a8b1e5d4a88ee2fd7264aa435aa38af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ab85486f64553dab6a4be05c1dca46c8a8b1e5d4a88ee2fd7264aa435aa38af","first_computed_at":"2026-05-18T01:21:35.768728Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:35.768728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9uvF4AMsMcvh3tGaL++GckUDlHgNgNF7bY9X3b/O3l9z3Ru3VXwNVpztx1KvAfp3uHYqJ7QzZNFbgkuX0j2BCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:35.769346Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.00291","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:551f31ba82ed62fc648e6b26373aabd02d9229c1ac6cd0228adabba0fd33790a","sha256:ae0bb567369ecd0357a76bb58919357fca4bede34f40c404775b9c830182d17d"],"state_sha256":"8a62f58fe1ab84d84bd5d055022c50cd3cbf8d8acd6b853e5e78ac889439a149"}