{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:42ITZYFC5OT5OXW2CRPAN6MKL2","short_pith_number":"pith:42ITZYFC","schema_version":"1.0","canonical_sha256":"e6913ce0a2eba7d75eda145e06f98a5e8619a6c4d0dd511024bc33150d981a4a","source":{"kind":"arxiv","id":"1707.02899","version":2},"attestation_state":"computed","paper":{"title":"On the metric dimension of incidence graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Robert F. Bailey","submitted_at":"2017-07-10T15:12:04Z","abstract_excerpt":"A 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 metric dimension $\\mu(\\Gamma)$ is the smallest size of a resolving set for $\\Gamma$. We consider the metric dimension of two families of incidence graphs: incidence graphs of symmetric designs, and incidence graphs of symmetric transversal designs (i.e. symmetric nets). These graphs are the bipartite distance-regular graphs of diameter $3$, and the bipartite, antipodal distance-regular graphs of diameter $4$, "},"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":"1707.02899","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-10T15:12:04Z","cross_cats_sorted":[],"title_canon_sha256":"26db5a74ef9539f35de843d61dc54ebe13f045ca39e5f23b85b072df306731c5","abstract_canon_sha256":"e7156a5fb2742a16139cbf5add3c79db18453b452109e8225d64484b6835f669"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:16.121358Z","signature_b64":"fUWVeu2ylYDBtx+CGcRr4lleIc6vZ7Bfgu616D0K4AbOCxqie8R9wY78AtrOA0bpzWiCfs7SHJMpIg03O5BRAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6913ce0a2eba7d75eda145e06f98a5e8619a6c4d0dd511024bc33150d981a4a","last_reissued_at":"2026-05-18T00:22:16.120674Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:16.120674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the metric dimension of incidence graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Robert F. Bailey","submitted_at":"2017-07-10T15:12:04Z","abstract_excerpt":"A 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 metric dimension $\\mu(\\Gamma)$ is the smallest size of a resolving set for $\\Gamma$. We consider the metric dimension of two families of incidence graphs: incidence graphs of symmetric designs, and incidence graphs of symmetric transversal designs (i.e. symmetric nets). These graphs are the bipartite distance-regular graphs of diameter $3$, and the bipartite, antipodal distance-regular graphs of diameter $4$, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02899","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":"1707.02899","created_at":"2026-05-18T00:22:16.120783+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.02899v2","created_at":"2026-05-18T00:22:16.120783+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02899","created_at":"2026-05-18T00:22:16.120783+00:00"},{"alias_kind":"pith_short_12","alias_value":"42ITZYFC5OT5","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"42ITZYFC5OT5OXW2","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"42ITZYFC","created_at":"2026-05-18T12:30:58.224056+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/42ITZYFC5OT5OXW2CRPAN6MKL2","json":"https://pith.science/pith/42ITZYFC5OT5OXW2CRPAN6MKL2.json","graph_json":"https://pith.science/api/pith-number/42ITZYFC5OT5OXW2CRPAN6MKL2/graph.json","events_json":"https://pith.science/api/pith-number/42ITZYFC5OT5OXW2CRPAN6MKL2/events.json","paper":"https://pith.science/paper/42ITZYFC"},"agent_actions":{"view_html":"https://pith.science/pith/42ITZYFC5OT5OXW2CRPAN6MKL2","download_json":"https://pith.science/pith/42ITZYFC5OT5OXW2CRPAN6MKL2.json","view_paper":"https://pith.science/paper/42ITZYFC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.02899&json=true","fetch_graph":"https://pith.science/api/pith-number/42ITZYFC5OT5OXW2CRPAN6MKL2/graph.json","fetch_events":"https://pith.science/api/pith-number/42ITZYFC5OT5OXW2CRPAN6MKL2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/42ITZYFC5OT5OXW2CRPAN6MKL2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/42ITZYFC5OT5OXW2CRPAN6MKL2/action/storage_attestation","attest_author":"https://pith.science/pith/42ITZYFC5OT5OXW2CRPAN6MKL2/action/author_attestation","sign_citation":"https://pith.science/pith/42ITZYFC5OT5OXW2CRPAN6MKL2/action/citation_signature","submit_replication":"https://pith.science/pith/42ITZYFC5OT5OXW2CRPAN6MKL2/action/replication_record"}},"created_at":"2026-05-18T00:22:16.120783+00:00","updated_at":"2026-05-18T00:22:16.120783+00:00"}