{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:URDCHCHDJBCSDIEQPIYKZEO2XR","short_pith_number":"pith:URDCHCHD","schema_version":"1.0","canonical_sha256":"a4462388e3484521a0907a30ac91dabc5f3b4492676deaac8f7234c3d69071d5","source":{"kind":"arxiv","id":"0705.0938","version":1},"attestation_state":"computed","paper":{"title":"Extremal Graph Theory for Metric Dimension and Diameter","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carlos Seara, Carmen Hernando, David R. Wood, Ignacio M. Pelayo, Merce Mora","submitted_at":"2007-05-07T16:16:12Z","abstract_excerpt":"A set of vertices $S$ \\emph{resolves} a connected graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The \\emph{metric dimension} of $G$ is the minimum cardinality of a resolving set of $G$. Let $\\mathcal{G}_{\\beta,D}$ be the set of graphs with metric dimension $\\beta$ and diameter $D$. It is well-known that the minimum order of a graph in $\\mathcal{G}_{\\beta,D}$ is exactly $\\beta+D$. The first contribution of this paper is to characterise the graphs in $\\mathcal{G}_{\\beta,D}$ with order $\\beta+D$ for all values of $\\beta$ and $D$. Such a charact"},"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":"0705.0938","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2007-05-07T16:16:12Z","cross_cats_sorted":[],"title_canon_sha256":"10c5ae7914231360fbee178fd2434fd659b40bc8dcbde43a20d0d7eaa93eff97","abstract_canon_sha256":"d42b53cc0639741bb8e7f9ccf99dc20bc8ba94072171444acaf109b2235aa8d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:23.851428Z","signature_b64":"HPEu5Wrcma9kI65b32RoNqkiEyplFGCBtjPc1tRM8PRmMlnGHMUHd7S4oTA5o0qvS0v9kZGrtHMw6s9ZBTxjBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4462388e3484521a0907a30ac91dabc5f3b4492676deaac8f7234c3d69071d5","last_reissued_at":"2026-05-18T03:55:23.850662Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:23.850662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extremal Graph Theory for Metric Dimension and Diameter","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carlos Seara, Carmen Hernando, David R. Wood, Ignacio M. Pelayo, Merce Mora","submitted_at":"2007-05-07T16:16:12Z","abstract_excerpt":"A set of vertices $S$ \\emph{resolves} a connected graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The \\emph{metric dimension} of $G$ is the minimum cardinality of a resolving set of $G$. Let $\\mathcal{G}_{\\beta,D}$ be the set of graphs with metric dimension $\\beta$ and diameter $D$. It is well-known that the minimum order of a graph in $\\mathcal{G}_{\\beta,D}$ is exactly $\\beta+D$. The first contribution of this paper is to characterise the graphs in $\\mathcal{G}_{\\beta,D}$ with order $\\beta+D$ for all values of $\\beta$ and $D$. Such a charact"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0705.0938","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0705.0938","created_at":"2026-05-18T03:55:23.850783+00:00"},{"alias_kind":"arxiv_version","alias_value":"0705.0938v1","created_at":"2026-05-18T03:55:23.850783+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0705.0938","created_at":"2026-05-18T03:55:23.850783+00:00"},{"alias_kind":"pith_short_12","alias_value":"URDCHCHDJBCS","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_16","alias_value":"URDCHCHDJBCSDIEQ","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_8","alias_value":"URDCHCHD","created_at":"2026-05-18T12:25:56.245647+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/URDCHCHDJBCSDIEQPIYKZEO2XR","json":"https://pith.science/pith/URDCHCHDJBCSDIEQPIYKZEO2XR.json","graph_json":"https://pith.science/api/pith-number/URDCHCHDJBCSDIEQPIYKZEO2XR/graph.json","events_json":"https://pith.science/api/pith-number/URDCHCHDJBCSDIEQPIYKZEO2XR/events.json","paper":"https://pith.science/paper/URDCHCHD"},"agent_actions":{"view_html":"https://pith.science/pith/URDCHCHDJBCSDIEQPIYKZEO2XR","download_json":"https://pith.science/pith/URDCHCHDJBCSDIEQPIYKZEO2XR.json","view_paper":"https://pith.science/paper/URDCHCHD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0705.0938&json=true","fetch_graph":"https://pith.science/api/pith-number/URDCHCHDJBCSDIEQPIYKZEO2XR/graph.json","fetch_events":"https://pith.science/api/pith-number/URDCHCHDJBCSDIEQPIYKZEO2XR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/URDCHCHDJBCSDIEQPIYKZEO2XR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/URDCHCHDJBCSDIEQPIYKZEO2XR/action/storage_attestation","attest_author":"https://pith.science/pith/URDCHCHDJBCSDIEQPIYKZEO2XR/action/author_attestation","sign_citation":"https://pith.science/pith/URDCHCHDJBCSDIEQPIYKZEO2XR/action/citation_signature","submit_replication":"https://pith.science/pith/URDCHCHDJBCSDIEQPIYKZEO2XR/action/replication_record"}},"created_at":"2026-05-18T03:55:23.850783+00:00","updated_at":"2026-05-18T03:55:23.850783+00:00"}