{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:YD4IJH6KHHVF3TUOMGSON2LF4Y","short_pith_number":"pith:YD4IJH6K","canonical_record":{"source":{"id":"1112.2326","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-11T07:12:44Z","cross_cats_sorted":[],"title_canon_sha256":"3ffec780d3588a6f947b7ebdee50bfd1a2270b091d6214afc36cf5ddc54dcefa","abstract_canon_sha256":"3dfffebddc838d12482ae2fd28b834c894acc6c8a312f5b513c5ad07beec6e9a"},"schema_version":"1.0"},"canonical_sha256":"c0f8849fca39ea5dce8e61a4e6e965e6312a901416bf6d61527a90cc6dcace21","source":{"kind":"arxiv","id":"1112.2326","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.2326","created_at":"2026-05-18T04:06:34Z"},{"alias_kind":"arxiv_version","alias_value":"1112.2326v1","created_at":"2026-05-18T04:06:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.2326","created_at":"2026-05-18T04:06:34Z"},{"alias_kind":"pith_short_12","alias_value":"YD4IJH6KHHVF","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YD4IJH6KHHVF3TUO","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YD4IJH6K","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:YD4IJH6KHHVF3TUOMGSON2LF4Y","target":"record","payload":{"canonical_record":{"source":{"id":"1112.2326","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-11T07:12:44Z","cross_cats_sorted":[],"title_canon_sha256":"3ffec780d3588a6f947b7ebdee50bfd1a2270b091d6214afc36cf5ddc54dcefa","abstract_canon_sha256":"3dfffebddc838d12482ae2fd28b834c894acc6c8a312f5b513c5ad07beec6e9a"},"schema_version":"1.0"},"canonical_sha256":"c0f8849fca39ea5dce8e61a4e6e965e6312a901416bf6d61527a90cc6dcace21","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:06:34.803757Z","signature_b64":"INWC1/O5IuOQr+vr5/2p//mg796DehI3TNLxYlPmABBRlCzHEpLwREfFPNQbFAXYRmsAPBn8KWynueIDm6fyCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0f8849fca39ea5dce8e61a4e6e965e6312a901416bf6d61527a90cc6dcace21","last_reissued_at":"2026-05-18T04:06:34.802961Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:06:34.802961Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.2326","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:06:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m9wgwbGm4LlksLXW+WkIVJVlj0vfFLYxXnnHji5Z25aBwg5OstO3wTpEcUjO78ubO7keYsYvF/u3C9SZkvKHDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T02:40:43.222099Z"},"content_sha256":"a91dc64c2fafdbe67fdb72b7e24fc9152b8264eb7945a7110462801c142eab38","schema_version":"1.0","event_id":"sha256:a91dc64c2fafdbe67fdb72b7e24fc9152b8264eb7945a7110462801c142eab38"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:YD4IJH6KHHVF3TUOMGSON2LF4Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Relations between Metric Dimension and Domination Number of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Behnaz Omoomi, Behrooz Bagheri Gh., Mohsen Jannesari","submitted_at":"2011-12-11T07:12:44Z","abstract_excerpt":"A set $W\\subseteq V(G)$ is called a resolving set, if for each two distinct vertices $u,v\\in V(G)$ there exists $w\\in W$ such that $d(u,w)\\neq d(v,w)$, where $d(x,y)$ is the distance between the vertices $x$ and $y$. The minimum cardinality of a resolving set for $G$ is called the metric dimension of $G$, and denoted by $\\beta(G)$. In this paper, we prove that in a connected graph $G$ of order $n$, $\\beta(G)\\leq n-\\gamma(G)$, where $\\gamma(G)$ is the domination number of $G$, and the equality holds if and only if $G$ is a complete graph or a complete bipartite graph $K_{s,t}$, $ s,t\\geq 2$. Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.2326","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:06:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6eZtGSyTFK47W+lACT2crnX2rH2QsxmZU0LQXzEIZbXDXX5fp8OrCBshb/+ZiQ9YCaxs7ZssxXWzJ4UA8EbXAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T02:40:43.222485Z"},"content_sha256":"77af1c6e4d2af2478099bd72481577b34bbc3d2016b7d016eacb5d61c1000378","schema_version":"1.0","event_id":"sha256:77af1c6e4d2af2478099bd72481577b34bbc3d2016b7d016eacb5d61c1000378"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YD4IJH6KHHVF3TUOMGSON2LF4Y/bundle.json","state_url":"https://pith.science/pith/YD4IJH6KHHVF3TUOMGSON2LF4Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YD4IJH6KHHVF3TUOMGSON2LF4Y/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-26T02:40:43Z","links":{"resolver":"https://pith.science/pith/YD4IJH6KHHVF3TUOMGSON2LF4Y","bundle":"https://pith.science/pith/YD4IJH6KHHVF3TUOMGSON2LF4Y/bundle.json","state":"https://pith.science/pith/YD4IJH6KHHVF3TUOMGSON2LF4Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YD4IJH6KHHVF3TUOMGSON2LF4Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:YD4IJH6KHHVF3TUOMGSON2LF4Y","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":"3dfffebddc838d12482ae2fd28b834c894acc6c8a312f5b513c5ad07beec6e9a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-11T07:12:44Z","title_canon_sha256":"3ffec780d3588a6f947b7ebdee50bfd1a2270b091d6214afc36cf5ddc54dcefa"},"schema_version":"1.0","source":{"id":"1112.2326","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.2326","created_at":"2026-05-18T04:06:34Z"},{"alias_kind":"arxiv_version","alias_value":"1112.2326v1","created_at":"2026-05-18T04:06:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.2326","created_at":"2026-05-18T04:06:34Z"},{"alias_kind":"pith_short_12","alias_value":"YD4IJH6KHHVF","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YD4IJH6KHHVF3TUO","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YD4IJH6K","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:77af1c6e4d2af2478099bd72481577b34bbc3d2016b7d016eacb5d61c1000378","target":"graph","created_at":"2026-05-18T04:06:34Z","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":"A set $W\\subseteq V(G)$ is called a resolving set, if for each two distinct vertices $u,v\\in V(G)$ there exists $w\\in W$ such that $d(u,w)\\neq d(v,w)$, where $d(x,y)$ is the distance between the vertices $x$ and $y$. The minimum cardinality of a resolving set for $G$ is called the metric dimension of $G$, and denoted by $\\beta(G)$. In this paper, we prove that in a connected graph $G$ of order $n$, $\\beta(G)\\leq n-\\gamma(G)$, where $\\gamma(G)$ is the domination number of $G$, and the equality holds if and only if $G$ is a complete graph or a complete bipartite graph $K_{s,t}$, $ s,t\\geq 2$. Th","authors_text":"Behnaz Omoomi, Behrooz Bagheri Gh., Mohsen Jannesari","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-11T07:12:44Z","title":"Relations between Metric Dimension and Domination Number of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.2326","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:a91dc64c2fafdbe67fdb72b7e24fc9152b8264eb7945a7110462801c142eab38","target":"record","created_at":"2026-05-18T04:06:34Z","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":"3dfffebddc838d12482ae2fd28b834c894acc6c8a312f5b513c5ad07beec6e9a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-11T07:12:44Z","title_canon_sha256":"3ffec780d3588a6f947b7ebdee50bfd1a2270b091d6214afc36cf5ddc54dcefa"},"schema_version":"1.0","source":{"id":"1112.2326","kind":"arxiv","version":1}},"canonical_sha256":"c0f8849fca39ea5dce8e61a4e6e965e6312a901416bf6d61527a90cc6dcace21","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c0f8849fca39ea5dce8e61a4e6e965e6312a901416bf6d61527a90cc6dcace21","first_computed_at":"2026-05-18T04:06:34.802961Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:06:34.802961Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"INWC1/O5IuOQr+vr5/2p//mg796DehI3TNLxYlPmABBRlCzHEpLwREfFPNQbFAXYRmsAPBn8KWynueIDm6fyCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:06:34.803757Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.2326","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a91dc64c2fafdbe67fdb72b7e24fc9152b8264eb7945a7110462801c142eab38","sha256:77af1c6e4d2af2478099bd72481577b34bbc3d2016b7d016eacb5d61c1000378"],"state_sha256":"508eba31927aafeff232fc729a1c864654c93fe88aef4b264755898befd6102c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sj/vO5c08aHA26DQihRy8Hz/JlQVpHNGql6LXjxhKek0sY0IUVhofqk2XuyHDYiizafLg+psRskhU5/pfv3uCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T02:40:43.224670Z","bundle_sha256":"e520f049e4504ffdbad6af729444f52fc5199d72fd0bd9bc841a6300d9f5384b"}}