{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ZIZQP2ZXUCJY6MOR77ZWT6FE3K","short_pith_number":"pith:ZIZQP2ZX","schema_version":"1.0","canonical_sha256":"ca3307eb37a0938f31d1fff369f8a4da9fec6c2d8467456b8781aba74ecc37f8","source":{"kind":"arxiv","id":"1610.01475","version":2},"attestation_state":"computed","paper":{"title":"Bounding the order of a graph using its diameter and metric dimension: a study through tree decompositions and VC dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aline Parreau, Arnaud Mary, Florent Foucaud, Laurent Beaudou, Michael A. Henning, Peter Dankelmann","submitted_at":"2016-10-05T15:13:58Z","abstract_excerpt":"The metric dimension of a graph is the minimum size of a set of vertices such that each vertex is uniquely determined by the distances to the vertices of that set. Our aim is to upper-bound the order $n$ of a graph in terms of its diameter $d$ and metric dimension $k$. In general, the bound $n\\leq d^k+k$ is known to hold. We prove a bound of the form $n=\\mathcal{O}(kd^2)$ for trees and outerplanar graphs (for trees we determine the best possible bound and the corresponding extremal examples). More generally, for graphs having a tree decomposition of width $w$ and length $\\ell$, we obtain a bou"},"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":"1610.01475","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-05T15:13:58Z","cross_cats_sorted":[],"title_canon_sha256":"eab1febed73023c5a8c08f9502ed77ae0031aaeaf1aece86c0d54ffd32368bd6","abstract_canon_sha256":"243f2fac28b0ebfa3453d65309e8fd075fc3c87695b66eee93c6a749e11bdb4b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:19.593257Z","signature_b64":"FfGGzNq42NVpNQae3MkHiId2ji7EE+XHAYXOdGOi3ZIG8+wPq6qkCRgDWnwa+0hakAVZyUkBvOmwEx7tRtaIBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca3307eb37a0938f31d1fff369f8a4da9fec6c2d8467456b8781aba74ecc37f8","last_reissued_at":"2026-05-18T00:10:19.592461Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:19.592461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounding the order of a graph using its diameter and metric dimension: a study through tree decompositions and VC dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aline Parreau, Arnaud Mary, Florent Foucaud, Laurent Beaudou, Michael A. Henning, Peter Dankelmann","submitted_at":"2016-10-05T15:13:58Z","abstract_excerpt":"The metric dimension of a graph is the minimum size of a set of vertices such that each vertex is uniquely determined by the distances to the vertices of that set. Our aim is to upper-bound the order $n$ of a graph in terms of its diameter $d$ and metric dimension $k$. In general, the bound $n\\leq d^k+k$ is known to hold. We prove a bound of the form $n=\\mathcal{O}(kd^2)$ for trees and outerplanar graphs (for trees we determine the best possible bound and the corresponding extremal examples). More generally, for graphs having a tree decomposition of width $w$ and length $\\ell$, we obtain a bou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.01475","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":"1610.01475","created_at":"2026-05-18T00:10:19.592600+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.01475v2","created_at":"2026-05-18T00:10:19.592600+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.01475","created_at":"2026-05-18T00:10:19.592600+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZIZQP2ZXUCJY","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZIZQP2ZXUCJY6MOR","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZIZQP2ZX","created_at":"2026-05-18T12:30:53.716459+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.02949","citing_title":"Sample compression schemes for balls in structurally sparse graphs","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZIZQP2ZXUCJY6MOR77ZWT6FE3K","json":"https://pith.science/pith/ZIZQP2ZXUCJY6MOR77ZWT6FE3K.json","graph_json":"https://pith.science/api/pith-number/ZIZQP2ZXUCJY6MOR77ZWT6FE3K/graph.json","events_json":"https://pith.science/api/pith-number/ZIZQP2ZXUCJY6MOR77ZWT6FE3K/events.json","paper":"https://pith.science/paper/ZIZQP2ZX"},"agent_actions":{"view_html":"https://pith.science/pith/ZIZQP2ZXUCJY6MOR77ZWT6FE3K","download_json":"https://pith.science/pith/ZIZQP2ZXUCJY6MOR77ZWT6FE3K.json","view_paper":"https://pith.science/paper/ZIZQP2ZX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.01475&json=true","fetch_graph":"https://pith.science/api/pith-number/ZIZQP2ZXUCJY6MOR77ZWT6FE3K/graph.json","fetch_events":"https://pith.science/api/pith-number/ZIZQP2ZXUCJY6MOR77ZWT6FE3K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZIZQP2ZXUCJY6MOR77ZWT6FE3K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZIZQP2ZXUCJY6MOR77ZWT6FE3K/action/storage_attestation","attest_author":"https://pith.science/pith/ZIZQP2ZXUCJY6MOR77ZWT6FE3K/action/author_attestation","sign_citation":"https://pith.science/pith/ZIZQP2ZXUCJY6MOR77ZWT6FE3K/action/citation_signature","submit_replication":"https://pith.science/pith/ZIZQP2ZXUCJY6MOR77ZWT6FE3K/action/replication_record"}},"created_at":"2026-05-18T00:10:19.592600+00:00","updated_at":"2026-05-18T00:10:19.592600+00:00"}