{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:2A6VAVOGPZOO64677S5JASWNA5","short_pith_number":"pith:2A6VAVOG","schema_version":"1.0","canonical_sha256":"d03d5055c67e5cef73dffcba904acd0755a5df60a81375cf7e4cf6e24ebc956f","source":{"kind":"arxiv","id":"1312.4973","version":1},"attestation_state":"computed","paper":{"title":"The metric dimension of small distance-regular and strongly regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Robert F. Bailey","submitted_at":"2013-12-17T21:05:42Z","abstract_excerpt":"A {\\em resolving set} for a graph $\\Gamma$ is a collection of vertices $S$, chosen so that for each vertex $v$, the list of distances from $v$ to the members of $S$ uniquely specifies $v$. The {\\em metric dimension} of $\\Gamma$ is the smallest size of a resolving set for $\\Gamma$.\n  A graph is {\\em distance-regular} if, for any two vertices $u,v$ at each distance $i$, the number of neighbours of $v$ at each possible distance from $u$ (i.e. $i-1$, $i$ or $i+1$) depends only on the distance $i$, and not on the choice of vertices $u,v$. The class of distance-regular graphs includes all distance-t"},"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":"1312.4973","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-17T21:05:42Z","cross_cats_sorted":[],"title_canon_sha256":"e9e08f160ed3bae38e24a82314211307c87ed67be3645001a35623c95b139989","abstract_canon_sha256":"2d1bb2a164052d30775c41949f77ea509ee0ec8b59f767ed95b57400ae8577d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:16.677548Z","signature_b64":"yYEyfwszxj0ZnVCjKu48eM+p7qMgetqIoDHGeAV23jO3PPzGfYgwKZprQ+Md71nmmPTcbas1KgMzMIFHecGGCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d03d5055c67e5cef73dffcba904acd0755a5df60a81375cf7e4cf6e24ebc956f","last_reissued_at":"2026-05-18T03:04:16.676860Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:16.676860Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The metric dimension of small distance-regular and strongly regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Robert F. Bailey","submitted_at":"2013-12-17T21:05:42Z","abstract_excerpt":"A {\\em resolving set} for a graph $\\Gamma$ is a collection of vertices $S$, chosen so that for each vertex $v$, the list of distances from $v$ to the members of $S$ uniquely specifies $v$. The {\\em metric dimension} of $\\Gamma$ is the smallest size of a resolving set for $\\Gamma$.\n  A graph is {\\em distance-regular} if, for any two vertices $u,v$ at each distance $i$, the number of neighbours of $v$ at each possible distance from $u$ (i.e. $i-1$, $i$ or $i+1$) depends only on the distance $i$, and not on the choice of vertices $u,v$. The class of distance-regular graphs includes all distance-t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4973","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":"1312.4973","created_at":"2026-05-18T03:04:16.676971+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.4973v1","created_at":"2026-05-18T03:04:16.676971+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4973","created_at":"2026-05-18T03:04:16.676971+00:00"},{"alias_kind":"pith_short_12","alias_value":"2A6VAVOGPZOO","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"2A6VAVOGPZOO6467","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"2A6VAVOG","created_at":"2026-05-18T12:27:30.460161+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/2A6VAVOGPZOO64677S5JASWNA5","json":"https://pith.science/pith/2A6VAVOGPZOO64677S5JASWNA5.json","graph_json":"https://pith.science/api/pith-number/2A6VAVOGPZOO64677S5JASWNA5/graph.json","events_json":"https://pith.science/api/pith-number/2A6VAVOGPZOO64677S5JASWNA5/events.json","paper":"https://pith.science/paper/2A6VAVOG"},"agent_actions":{"view_html":"https://pith.science/pith/2A6VAVOGPZOO64677S5JASWNA5","download_json":"https://pith.science/pith/2A6VAVOGPZOO64677S5JASWNA5.json","view_paper":"https://pith.science/paper/2A6VAVOG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.4973&json=true","fetch_graph":"https://pith.science/api/pith-number/2A6VAVOGPZOO64677S5JASWNA5/graph.json","fetch_events":"https://pith.science/api/pith-number/2A6VAVOGPZOO64677S5JASWNA5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2A6VAVOGPZOO64677S5JASWNA5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2A6VAVOGPZOO64677S5JASWNA5/action/storage_attestation","attest_author":"https://pith.science/pith/2A6VAVOGPZOO64677S5JASWNA5/action/author_attestation","sign_citation":"https://pith.science/pith/2A6VAVOGPZOO64677S5JASWNA5/action/citation_signature","submit_replication":"https://pith.science/pith/2A6VAVOGPZOO64677S5JASWNA5/action/replication_record"}},"created_at":"2026-05-18T03:04:16.676971+00:00","updated_at":"2026-05-18T03:04:16.676971+00:00"}