{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XOAMZ6MBVQOFJSYVVWBLJIYAMD","short_pith_number":"pith:XOAMZ6MB","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"},"canonical_sha256":"bb80ccf981ac1c54cb15ad82b4a30060c37dab894e13e1bfd3ffc11c6db4b7a0","source":{"kind":"arxiv","id":"1809.08900","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.08900","created_at":"2026-05-18T00:05:03Z"},{"alias_kind":"arxiv_version","alias_value":"1809.08900v1","created_at":"2026-05-18T00:05:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08900","created_at":"2026-05-18T00:05:03Z"},{"alias_kind":"pith_short_12","alias_value":"XOAMZ6MBVQOF","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XOAMZ6MBVQOFJSYV","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XOAMZ6MB","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XOAMZ6MBVQOFJSYVVWBLJIYAMD","target":"record","payload":{"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"},"canonical_sha256":"bb80ccf981ac1c54cb15ad82b4a30060c37dab894e13e1bfd3ffc11c6db4b7a0","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"},"source_kind":"arxiv","source_id":"1809.08900","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-18T00:05:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s+/uY2mVT+TgK/WlojwjBGiPc1H7wXRtGlUtrMvnz7yHBPNVaNg+pkfGPWfLMbrh+eTWDCmzT8aDb/rvugsmAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T21:46:32.836300Z"},"content_sha256":"8e9c31f192181163951cba812eca7b97d7ac217f99a46a730d4e09ce53336bbe","schema_version":"1.0","event_id":"sha256:8e9c31f192181163951cba812eca7b97d7ac217f99a46a730d4e09ce53336bbe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XOAMZ6MBVQOFJSYVVWBLJIYAMD","target":"graph","payload":{"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"},"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-18T00:05:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oeQ09CiS0zj0E5tFQfu1+E7oqF6RlutHPx+KyehEc1YgwIXA3SBlF8Q7TdpSp1BY400DoZazA03iyh8mYHYYCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T21:46:32.836676Z"},"content_sha256":"ac77ee3710ea73d30f4dd8c5d0ab0643f1d0dd364f507c70e5795a583fe73f4a","schema_version":"1.0","event_id":"sha256:ac77ee3710ea73d30f4dd8c5d0ab0643f1d0dd364f507c70e5795a583fe73f4a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XOAMZ6MBVQOFJSYVVWBLJIYAMD/bundle.json","state_url":"https://pith.science/pith/XOAMZ6MBVQOFJSYVVWBLJIYAMD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XOAMZ6MBVQOFJSYVVWBLJIYAMD/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-25T21:46:32Z","links":{"resolver":"https://pith.science/pith/XOAMZ6MBVQOFJSYVVWBLJIYAMD","bundle":"https://pith.science/pith/XOAMZ6MBVQOFJSYVVWBLJIYAMD/bundle.json","state":"https://pith.science/pith/XOAMZ6MBVQOFJSYVVWBLJIYAMD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XOAMZ6MBVQOFJSYVVWBLJIYAMD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XOAMZ6MBVQOFJSYVVWBLJIYAMD","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":"cca7471595acdff51982bfcf0496934a3e19e7d7adca1599b80f592dc8d5ebb5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-24T13:18:13Z","title_canon_sha256":"51e47217d7f10413de553546f916097b992884e062bdb81d21339a567166e02c"},"schema_version":"1.0","source":{"id":"1809.08900","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.08900","created_at":"2026-05-18T00:05:03Z"},{"alias_kind":"arxiv_version","alias_value":"1809.08900v1","created_at":"2026-05-18T00:05:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08900","created_at":"2026-05-18T00:05:03Z"},{"alias_kind":"pith_short_12","alias_value":"XOAMZ6MBVQOF","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XOAMZ6MBVQOFJSYV","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XOAMZ6MB","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:ac77ee3710ea73d30f4dd8c5d0ab0643f1d0dd364f507c70e5795a583fe73f4a","target":"graph","created_at":"2026-05-18T00:05:03Z","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. 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.","authors_text":"Ismael G. Yero, Iztok Peterin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-24T13:18:13Z","title":"Edge metric dimension of some graph operations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08900","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:8e9c31f192181163951cba812eca7b97d7ac217f99a46a730d4e09ce53336bbe","target":"record","created_at":"2026-05-18T00:05:03Z","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":"cca7471595acdff51982bfcf0496934a3e19e7d7adca1599b80f592dc8d5ebb5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-24T13:18:13Z","title_canon_sha256":"51e47217d7f10413de553546f916097b992884e062bdb81d21339a567166e02c"},"schema_version":"1.0","source":{"id":"1809.08900","kind":"arxiv","version":1}},"canonical_sha256":"bb80ccf981ac1c54cb15ad82b4a30060c37dab894e13e1bfd3ffc11c6db4b7a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb80ccf981ac1c54cb15ad82b4a30060c37dab894e13e1bfd3ffc11c6db4b7a0","first_computed_at":"2026-05-18T00:05:03.250239Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:03.250239Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P6FfhTg9RNZmQQzLbPMlvakIH2azplcwZHNNRou3WN8vF4fiJZ4gBPPi9NKII0rs5HO1MMVKuL2YlBECsZp3Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:03.250686Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.08900","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e9c31f192181163951cba812eca7b97d7ac217f99a46a730d4e09ce53336bbe","sha256:ac77ee3710ea73d30f4dd8c5d0ab0643f1d0dd364f507c70e5795a583fe73f4a"],"state_sha256":"8ccc76bde0f50ccc5dfda1b4245587f900ae13d17fd0753a122ad70018fbce5e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LBkt1kmDzYKXYkV0oj5AECXf8j/7sze/++uZWit12HO5OmzSoYf3aFvhUYwU5h1kSE2pxnRIM3Nz19gbS4QZCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T21:46:32.838599Z","bundle_sha256":"d4db042bb34fb2865e6ddf8692cf86b9d2533a035856c25b3af3fb9172198939"}}