{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:MARD4NLYIQMHX2HUNMR72CYMQI","short_pith_number":"pith:MARD4NLY","canonical_record":{"source":{"id":"1203.1584","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-07T19:48:21Z","cross_cats_sorted":[],"title_canon_sha256":"0022c507a95173c463c042b9a2f638b44b613b090bb6260275a168498267d527","abstract_canon_sha256":"bade576cb2e0ca38fcd6fd3f0081e5639dcd3034a49265fbc332cce621bbb956"},"schema_version":"1.0"},"canonical_sha256":"60223e357844187be8f46b23fd0b0c82196dbaa89467a456bda558c4aa288ded","source":{"kind":"arxiv","id":"1203.1584","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.1584","created_at":"2026-05-18T04:00:26Z"},{"alias_kind":"arxiv_version","alias_value":"1203.1584v2","created_at":"2026-05-18T04:00:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.1584","created_at":"2026-05-18T04:00:26Z"},{"alias_kind":"pith_short_12","alias_value":"MARD4NLYIQMH","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MARD4NLYIQMHX2HU","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MARD4NLY","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:MARD4NLYIQMHX2HUNMR72CYMQI","target":"record","payload":{"canonical_record":{"source":{"id":"1203.1584","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-07T19:48:21Z","cross_cats_sorted":[],"title_canon_sha256":"0022c507a95173c463c042b9a2f638b44b613b090bb6260275a168498267d527","abstract_canon_sha256":"bade576cb2e0ca38fcd6fd3f0081e5639dcd3034a49265fbc332cce621bbb956"},"schema_version":"1.0"},"canonical_sha256":"60223e357844187be8f46b23fd0b0c82196dbaa89467a456bda558c4aa288ded","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:26.213061Z","signature_b64":"Gd2eNat9NAnSgE1j8v6TQKaHExPiBZaDVuJlDZpf16ldNs0PMvLb6Tg8HOiz9Y1hXjM8VNiBBuIoU4TvnBXMBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60223e357844187be8f46b23fd0b0c82196dbaa89467a456bda558c4aa288ded","last_reissued_at":"2026-05-18T04:00:26.212614Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:26.212614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.1584","source_version":2,"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:00:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ons7Qzgyxx18OfcoCsmwR/XtSoUAYnk/TAhYCggilWH9cHMk16Ag0AAoFyFYDfRZa4ayvgBHB2Kgp5sgRRcPCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T16:07:52.176616Z"},"content_sha256":"1adf70498b84867acd394119cc5708728381a3ccea473d976cc06f90daf9ab26","schema_version":"1.0","event_id":"sha256:1adf70498b84867acd394119cc5708728381a3ccea473d976cc06f90daf9ab26"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:MARD4NLYIQMHX2HUNMR72CYMQI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Extremal Graph Theory for Metric Dimension and Girth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mohsen Jannesari","submitted_at":"2012-03-07T19:48:21Z","abstract_excerpt":"A set $W\\subseteq V(G)$ is called a resolving set for $G$, 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, it is proved that in a connected graph $G$ of order $n$ which has a cycle, $\\beta(G)\\leq n-g(G)+2$, where $g(G)$ is the length of a shortest cycle in $G$, and the equality holds if and only if $G$ is a cycle, a complete graph or a complete bip"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.1584","kind":"arxiv","version":2},"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:00:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oD35RtQlMDrzd00dV8WqCOlzbDgUFmDR+rRuJ3krdp8yCR0/GCj6Liunc81Z5xTGERymqYU5619fTvyhuzwdBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T16:07:52.176942Z"},"content_sha256":"d056da3cc4c36f2ef128ed2b0d2cf8d8f6cabfa2d5a2eb96e9bb66e86d9f0969","schema_version":"1.0","event_id":"sha256:d056da3cc4c36f2ef128ed2b0d2cf8d8f6cabfa2d5a2eb96e9bb66e86d9f0969"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MARD4NLYIQMHX2HUNMR72CYMQI/bundle.json","state_url":"https://pith.science/pith/MARD4NLYIQMHX2HUNMR72CYMQI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MARD4NLYIQMHX2HUNMR72CYMQI/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-30T16:07:52Z","links":{"resolver":"https://pith.science/pith/MARD4NLYIQMHX2HUNMR72CYMQI","bundle":"https://pith.science/pith/MARD4NLYIQMHX2HUNMR72CYMQI/bundle.json","state":"https://pith.science/pith/MARD4NLYIQMHX2HUNMR72CYMQI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MARD4NLYIQMHX2HUNMR72CYMQI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:MARD4NLYIQMHX2HUNMR72CYMQI","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":"bade576cb2e0ca38fcd6fd3f0081e5639dcd3034a49265fbc332cce621bbb956","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-07T19:48:21Z","title_canon_sha256":"0022c507a95173c463c042b9a2f638b44b613b090bb6260275a168498267d527"},"schema_version":"1.0","source":{"id":"1203.1584","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.1584","created_at":"2026-05-18T04:00:26Z"},{"alias_kind":"arxiv_version","alias_value":"1203.1584v2","created_at":"2026-05-18T04:00:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.1584","created_at":"2026-05-18T04:00:26Z"},{"alias_kind":"pith_short_12","alias_value":"MARD4NLYIQMH","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MARD4NLYIQMHX2HU","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MARD4NLY","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:d056da3cc4c36f2ef128ed2b0d2cf8d8f6cabfa2d5a2eb96e9bb66e86d9f0969","target":"graph","created_at":"2026-05-18T04:00:26Z","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 for $G$, 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, it is proved that in a connected graph $G$ of order $n$ which has a cycle, $\\beta(G)\\leq n-g(G)+2$, where $g(G)$ is the length of a shortest cycle in $G$, and the equality holds if and only if $G$ is a cycle, a complete graph or a complete bip","authors_text":"Mohsen Jannesari","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-07T19:48:21Z","title":"Extremal Graph Theory for Metric Dimension and Girth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.1584","kind":"arxiv","version":2},"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:1adf70498b84867acd394119cc5708728381a3ccea473d976cc06f90daf9ab26","target":"record","created_at":"2026-05-18T04:00:26Z","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":"bade576cb2e0ca38fcd6fd3f0081e5639dcd3034a49265fbc332cce621bbb956","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-07T19:48:21Z","title_canon_sha256":"0022c507a95173c463c042b9a2f638b44b613b090bb6260275a168498267d527"},"schema_version":"1.0","source":{"id":"1203.1584","kind":"arxiv","version":2}},"canonical_sha256":"60223e357844187be8f46b23fd0b0c82196dbaa89467a456bda558c4aa288ded","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"60223e357844187be8f46b23fd0b0c82196dbaa89467a456bda558c4aa288ded","first_computed_at":"2026-05-18T04:00:26.212614Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:00:26.212614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gd2eNat9NAnSgE1j8v6TQKaHExPiBZaDVuJlDZpf16ldNs0PMvLb6Tg8HOiz9Y1hXjM8VNiBBuIoU4TvnBXMBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:00:26.213061Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.1584","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1adf70498b84867acd394119cc5708728381a3ccea473d976cc06f90daf9ab26","sha256:d056da3cc4c36f2ef128ed2b0d2cf8d8f6cabfa2d5a2eb96e9bb66e86d9f0969"],"state_sha256":"acda400c55508243ce885b91939b0732f8b91e3021a51f6d3148bc3e6690aa5d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3mF+Itig8sKPErSsOrEBqH9JjWdOR3qMEoZpFlZzFO69BCH7wPPnhtfqDPhWD07azDW6MkxmqI4neCupdPq8BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T16:07:52.178725Z","bundle_sha256":"db9f1b7bce9a55f760e1cb5d8330b13bc928047e3e97fed5d937c1551b847252"}}