{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:MARD4NLYIQMHX2HUNMR72CYMQI","short_pith_number":"pith:MARD4NLY","schema_version":"1.0","canonical_sha256":"60223e357844187be8f46b23fd0b0c82196dbaa89467a456bda558c4aa288ded","source":{"kind":"arxiv","id":"1203.1584","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1203.1584","created_at":"2026-05-18T04:00:26.212674+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.1584v2","created_at":"2026-05-18T04:00:26.212674+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.1584","created_at":"2026-05-18T04:00:26.212674+00:00"},{"alias_kind":"pith_short_12","alias_value":"MARD4NLYIQMH","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"MARD4NLYIQMHX2HU","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"MARD4NLY","created_at":"2026-05-18T12:27:14.488303+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/MARD4NLYIQMHX2HUNMR72CYMQI","json":"https://pith.science/pith/MARD4NLYIQMHX2HUNMR72CYMQI.json","graph_json":"https://pith.science/api/pith-number/MARD4NLYIQMHX2HUNMR72CYMQI/graph.json","events_json":"https://pith.science/api/pith-number/MARD4NLYIQMHX2HUNMR72CYMQI/events.json","paper":"https://pith.science/paper/MARD4NLY"},"agent_actions":{"view_html":"https://pith.science/pith/MARD4NLYIQMHX2HUNMR72CYMQI","download_json":"https://pith.science/pith/MARD4NLYIQMHX2HUNMR72CYMQI.json","view_paper":"https://pith.science/paper/MARD4NLY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.1584&json=true","fetch_graph":"https://pith.science/api/pith-number/MARD4NLYIQMHX2HUNMR72CYMQI/graph.json","fetch_events":"https://pith.science/api/pith-number/MARD4NLYIQMHX2HUNMR72CYMQI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MARD4NLYIQMHX2HUNMR72CYMQI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MARD4NLYIQMHX2HUNMR72CYMQI/action/storage_attestation","attest_author":"https://pith.science/pith/MARD4NLYIQMHX2HUNMR72CYMQI/action/author_attestation","sign_citation":"https://pith.science/pith/MARD4NLYIQMHX2HUNMR72CYMQI/action/citation_signature","submit_replication":"https://pith.science/pith/MARD4NLYIQMHX2HUNMR72CYMQI/action/replication_record"}},"created_at":"2026-05-18T04:00:26.212674+00:00","updated_at":"2026-05-18T04:00:26.212674+00:00"}