{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:URDCHCHDJBCSDIEQPIYKZEO2XR","short_pith_number":"pith:URDCHCHD","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"},"canonical_sha256":"a4462388e3484521a0907a30ac91dabc5f3b4492676deaac8f7234c3d69071d5","source":{"kind":"arxiv","id":"0705.0938","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0705.0938","created_at":"2026-05-18T03:55:23Z"},{"alias_kind":"arxiv_version","alias_value":"0705.0938v1","created_at":"2026-05-18T03:55:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0705.0938","created_at":"2026-05-18T03:55:23Z"},{"alias_kind":"pith_short_12","alias_value":"URDCHCHDJBCS","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"URDCHCHDJBCSDIEQ","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"URDCHCHD","created_at":"2026-05-18T12:25:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:URDCHCHDJBCSDIEQPIYKZEO2XR","target":"record","payload":{"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"},"canonical_sha256":"a4462388e3484521a0907a30ac91dabc5f3b4492676deaac8f7234c3d69071d5","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"},"source_kind":"arxiv","source_id":"0705.0938","source_version":1,"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-18T03:55:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nlO0lvJHB+fLxklWwwjqjNlQieawPF0xRar9WOtZyf085JZTVYR0mJ17VNwT49ucdQZhw+83JcMhG0g+yrL8Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T00:28:39.780489Z"},"content_sha256":"23710526e903aa372f081d75d8ec628a487bf90771e03950c157b3a33cd9ba69","schema_version":"1.0","event_id":"sha256:23710526e903aa372f081d75d8ec628a487bf90771e03950c157b3a33cd9ba69"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:URDCHCHDJBCSDIEQPIYKZEO2XR","target":"graph","payload":{"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"},"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-18T03:55:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sm/HmSEgZwPQYmvkk9nHF3pbTeJsGg2gszWKKXwDsJlFhEfj+A5D0V0zewnU/3dGvA9H99Tz0jeQ04KochxWAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T00:28:39.781004Z"},"content_sha256":"e3247873793a959e6d1df9279a636d2e9f46c7d5422b4a8eef9b592ff325eeb4","schema_version":"1.0","event_id":"sha256:e3247873793a959e6d1df9279a636d2e9f46c7d5422b4a8eef9b592ff325eeb4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/URDCHCHDJBCSDIEQPIYKZEO2XR/bundle.json","state_url":"https://pith.science/pith/URDCHCHDJBCSDIEQPIYKZEO2XR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/URDCHCHDJBCSDIEQPIYKZEO2XR/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-05-23T00:28:39Z","links":{"resolver":"https://pith.science/pith/URDCHCHDJBCSDIEQPIYKZEO2XR","bundle":"https://pith.science/pith/URDCHCHDJBCSDIEQPIYKZEO2XR/bundle.json","state":"https://pith.science/pith/URDCHCHDJBCSDIEQPIYKZEO2XR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/URDCHCHDJBCSDIEQPIYKZEO2XR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:URDCHCHDJBCSDIEQPIYKZEO2XR","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":"d42b53cc0639741bb8e7f9ccf99dc20bc8ba94072171444acaf109b2235aa8d0","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"2007-05-07T16:16:12Z","title_canon_sha256":"10c5ae7914231360fbee178fd2434fd659b40bc8dcbde43a20d0d7eaa93eff97"},"schema_version":"1.0","source":{"id":"0705.0938","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0705.0938","created_at":"2026-05-18T03:55:23Z"},{"alias_kind":"arxiv_version","alias_value":"0705.0938v1","created_at":"2026-05-18T03:55:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0705.0938","created_at":"2026-05-18T03:55:23Z"},{"alias_kind":"pith_short_12","alias_value":"URDCHCHDJBCS","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"URDCHCHDJBCSDIEQ","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"URDCHCHD","created_at":"2026-05-18T12:25:56Z"}],"graph_snapshots":[{"event_id":"sha256:e3247873793a959e6d1df9279a636d2e9f46c7d5422b4a8eef9b592ff325eeb4","target":"graph","created_at":"2026-05-18T03:55:23Z","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 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","authors_text":"Carlos Seara, Carmen Hernando, David R. Wood, Ignacio M. Pelayo, Merce Mora","cross_cats":[],"headline":"","license":"","primary_cat":"math.CO","submitted_at":"2007-05-07T16:16:12Z","title":"Extremal Graph Theory for Metric Dimension and Diameter"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0705.0938","kind":"arxiv","version":1},"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:23710526e903aa372f081d75d8ec628a487bf90771e03950c157b3a33cd9ba69","target":"record","created_at":"2026-05-18T03:55:23Z","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":"d42b53cc0639741bb8e7f9ccf99dc20bc8ba94072171444acaf109b2235aa8d0","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"2007-05-07T16:16:12Z","title_canon_sha256":"10c5ae7914231360fbee178fd2434fd659b40bc8dcbde43a20d0d7eaa93eff97"},"schema_version":"1.0","source":{"id":"0705.0938","kind":"arxiv","version":1}},"canonical_sha256":"a4462388e3484521a0907a30ac91dabc5f3b4492676deaac8f7234c3d69071d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a4462388e3484521a0907a30ac91dabc5f3b4492676deaac8f7234c3d69071d5","first_computed_at":"2026-05-18T03:55:23.850662Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:55:23.850662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HPEu5Wrcma9kI65b32RoNqkiEyplFGCBtjPc1tRM8PRmMlnGHMUHd7S4oTA5o0qvS0v9kZGrtHMw6s9ZBTxjBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:55:23.851428Z","signed_message":"canonical_sha256_bytes"},"source_id":"0705.0938","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:23710526e903aa372f081d75d8ec628a487bf90771e03950c157b3a33cd9ba69","sha256:e3247873793a959e6d1df9279a636d2e9f46c7d5422b4a8eef9b592ff325eeb4"],"state_sha256":"903314cfbe98c8894ba56089bd8ce6927cc5597de9a6649d989d8e619210c2a0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mDjEx3q5eYusxBDnoQeWShlNNubgF3Kf+Iea4nXUhQBttKLyINp9kGFgDU8EadM7ZJnmVtQYp+tdgo8yoehJAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T00:28:39.783516Z","bundle_sha256":"df65b22210c7830a273417b7b521bb99bb5e35e7df761a530582a703a8576fcc"}}