{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:42ITZYFC5OT5OXW2CRPAN6MKL2","short_pith_number":"pith:42ITZYFC","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"},"canonical_sha256":"e6913ce0a2eba7d75eda145e06f98a5e8619a6c4d0dd511024bc33150d981a4a","source":{"kind":"arxiv","id":"1707.02899","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.02899","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"arxiv_version","alias_value":"1707.02899v2","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02899","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"pith_short_12","alias_value":"42ITZYFC5OT5","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"42ITZYFC5OT5OXW2","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"42ITZYFC","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:42ITZYFC5OT5OXW2CRPAN6MKL2","target":"record","payload":{"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"},"canonical_sha256":"e6913ce0a2eba7d75eda145e06f98a5e8619a6c4d0dd511024bc33150d981a4a","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"},"source_kind":"arxiv","source_id":"1707.02899","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:22:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X0Ef4lkPqvjGRly9qaAwn8VPF9PAM5m2YZV3Py5dEHZlfzniAYOdeUqwEkIAisfsuZCKuHcMYyQIlzKWY7giDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T07:56:11.441922Z"},"content_sha256":"4bcb1c49ed6444eac1fb6d029284be46b5993522b211e645f65ce54a06c3e48e","schema_version":"1.0","event_id":"sha256:4bcb1c49ed6444eac1fb6d029284be46b5993522b211e645f65ce54a06c3e48e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:42ITZYFC5OT5OXW2CRPAN6MKL2","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:22:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JBdvGexxWGO+klil8hb0EvvKnDi5o4FAG4TwJgsNr/EkkeXQFVk5vuYuUF/8oHZdYg5rrIKItVS1b9ka4F8YDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T07:56:11.442245Z"},"content_sha256":"f502a970a3c0b5bb2c61e450d18efc33d981ff3213189685a27e161a3d72b398","schema_version":"1.0","event_id":"sha256:f502a970a3c0b5bb2c61e450d18efc33d981ff3213189685a27e161a3d72b398"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/42ITZYFC5OT5OXW2CRPAN6MKL2/bundle.json","state_url":"https://pith.science/pith/42ITZYFC5OT5OXW2CRPAN6MKL2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/42ITZYFC5OT5OXW2CRPAN6MKL2/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-26T07:56:11Z","links":{"resolver":"https://pith.science/pith/42ITZYFC5OT5OXW2CRPAN6MKL2","bundle":"https://pith.science/pith/42ITZYFC5OT5OXW2CRPAN6MKL2/bundle.json","state":"https://pith.science/pith/42ITZYFC5OT5OXW2CRPAN6MKL2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/42ITZYFC5OT5OXW2CRPAN6MKL2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:42ITZYFC5OT5OXW2CRPAN6MKL2","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e7156a5fb2742a16139cbf5add3c79db18453b452109e8225d64484b6835f669","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-10T15:12:04Z","title_canon_sha256":"26db5a74ef9539f35de843d61dc54ebe13f045ca39e5f23b85b072df306731c5"},"schema_version":"1.0","source":{"id":"1707.02899","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.02899","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"arxiv_version","alias_value":"1707.02899v2","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02899","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"pith_short_12","alias_value":"42ITZYFC5OT5","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"42ITZYFC5OT5OXW2","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"42ITZYFC","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:f502a970a3c0b5bb2c61e450d18efc33d981ff3213189685a27e161a3d72b398","target":"graph","created_at":"2026-05-18T00:22:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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$, ","authors_text":"Robert F. Bailey","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-10T15:12:04Z","title":"On the metric dimension of incidence graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02899","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4bcb1c49ed6444eac1fb6d029284be46b5993522b211e645f65ce54a06c3e48e","target":"record","created_at":"2026-05-18T00:22:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e7156a5fb2742a16139cbf5add3c79db18453b452109e8225d64484b6835f669","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-10T15:12:04Z","title_canon_sha256":"26db5a74ef9539f35de843d61dc54ebe13f045ca39e5f23b85b072df306731c5"},"schema_version":"1.0","source":{"id":"1707.02899","kind":"arxiv","version":2}},"canonical_sha256":"e6913ce0a2eba7d75eda145e06f98a5e8619a6c4d0dd511024bc33150d981a4a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6913ce0a2eba7d75eda145e06f98a5e8619a6c4d0dd511024bc33150d981a4a","first_computed_at":"2026-05-18T00:22:16.120674Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:16.120674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fUWVeu2ylYDBtx+CGcRr4lleIc6vZ7Bfgu616D0K4AbOCxqie8R9wY78AtrOA0bpzWiCfs7SHJMpIg03O5BRAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:16.121358Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.02899","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4bcb1c49ed6444eac1fb6d029284be46b5993522b211e645f65ce54a06c3e48e","sha256:f502a970a3c0b5bb2c61e450d18efc33d981ff3213189685a27e161a3d72b398"],"state_sha256":"a7849698bbdeb53e22b5e447ee0af08a2048ce96fa0f4638aed90ea6db1d4497"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JhlWIcW1m46qVL9Q+yWR29JIzFwWt8J0JgamrTQtkLui9/I9bwA0uAhJI2W+3h+valgcBp3Eu9DXMqk0TBVDAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T07:56:11.444070Z","bundle_sha256":"6887c505c36a8a4c8f956c03fec48313f3a22fb07122986aa09f36dc3187ce64"}}