{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:2RC5KJSND2SJLHNYCQD4ZWFAWG","short_pith_number":"pith:2RC5KJSN","canonical_record":{"source":{"id":"1103.3588","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-18T10:16:33Z","cross_cats_sorted":[],"title_canon_sha256":"7a5d146ac700c2af6f2e6a27fa467a00219f38ff64cc94b836827f73369a1683","abstract_canon_sha256":"76b0c925f34f4a2756ee55884b9e7fafe57d6d8b6af6be76dc5caf17c5f0050d"},"schema_version":"1.0"},"canonical_sha256":"d445d5264d1ea4959db81407ccd8a0b1878a382a616eaad8428d7170e33944b3","source":{"kind":"arxiv","id":"1103.3588","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.3588","created_at":"2026-05-18T04:26:32Z"},{"alias_kind":"arxiv_version","alias_value":"1103.3588v1","created_at":"2026-05-18T04:26:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.3588","created_at":"2026-05-18T04:26:32Z"},{"alias_kind":"pith_short_12","alias_value":"2RC5KJSND2SJ","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2RC5KJSND2SJLHNY","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2RC5KJSN","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:2RC5KJSND2SJLHNYCQD4ZWFAWG","target":"record","payload":{"canonical_record":{"source":{"id":"1103.3588","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-18T10:16:33Z","cross_cats_sorted":[],"title_canon_sha256":"7a5d146ac700c2af6f2e6a27fa467a00219f38ff64cc94b836827f73369a1683","abstract_canon_sha256":"76b0c925f34f4a2756ee55884b9e7fafe57d6d8b6af6be76dc5caf17c5f0050d"},"schema_version":"1.0"},"canonical_sha256":"d445d5264d1ea4959db81407ccd8a0b1878a382a616eaad8428d7170e33944b3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:26:32.316883Z","signature_b64":"ORUx1kwtvoyGNAoiUb7w4qfbWE69UPnUxUDo1uT4OXYwIYtTfdf1i+feEXs1l+9xGgIsax+DrqwInuybL1svCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d445d5264d1ea4959db81407ccd8a0b1878a382a616eaad8428d7170e33944b3","last_reissued_at":"2026-05-18T04:26:32.316411Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:26:32.316411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.3588","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-18T04:26:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3UBG5SAHMb6Pgz6P/uNloxe60R5XWEBbGd2CuEsvBKkMPbkLB1LZki5V9mQuuMQRxpgDLGBFA2Vj94evYButCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T10:23:39.421964Z"},"content_sha256":"1e41fe0246bf1725cd78bb9a6786b5b669d0e59471359834cdcd15bcf360fd42","schema_version":"1.0","event_id":"sha256:1e41fe0246bf1725cd78bb9a6786b5b669d0e59471359834cdcd15bcf360fd42"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:2RC5KJSND2SJLHNYCQD4ZWFAWG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Characterization of n-Vertex Graphs with Metric Dimension n-3","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Behnaz Omoomi, Mohsen Jannesari","submitted_at":"2011-03-18T10:16:33Z","abstract_excerpt":"For an ordered set $W=\\{w_1,w_2,...,w_k\\}$ of vertices and a vertex $v$ in a connected graph $G$, the ordered $k$-vector $r(v|W):=(d(v,w_1),d(v,w_2),...,d(v,w_k))$ is called the (metric) representation of $v$ with respect to $W$, where $d(x,y)$ is the distance between the vertices $x$ and $y$. The set $W$ is called a resolving set for $G$ if distinct vertices of $G$ have distinct representations with respect to $W$. The minimum cardinality of a resolving set for $G$ is its metric dimension. In this paper, we characterize all graphs of order $n$ with metric dimension $n-3$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.3588","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-18T04:26:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cdkmgabo6bCJHj0B5YAELQLVnrhssC5qK9zekQRIBwpRf24R2t++luVPBR1m8V9LUW52aSbIu9IB49kfZCPSBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T10:23:39.422358Z"},"content_sha256":"d81de92d7e93caa86f3b0ad7ee4454118f21900bad1d72dfb685798df7732e68","schema_version":"1.0","event_id":"sha256:d81de92d7e93caa86f3b0ad7ee4454118f21900bad1d72dfb685798df7732e68"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2RC5KJSND2SJLHNYCQD4ZWFAWG/bundle.json","state_url":"https://pith.science/pith/2RC5KJSND2SJLHNYCQD4ZWFAWG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2RC5KJSND2SJLHNYCQD4ZWFAWG/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-26T10:23:39Z","links":{"resolver":"https://pith.science/pith/2RC5KJSND2SJLHNYCQD4ZWFAWG","bundle":"https://pith.science/pith/2RC5KJSND2SJLHNYCQD4ZWFAWG/bundle.json","state":"https://pith.science/pith/2RC5KJSND2SJLHNYCQD4ZWFAWG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2RC5KJSND2SJLHNYCQD4ZWFAWG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:2RC5KJSND2SJLHNYCQD4ZWFAWG","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":"76b0c925f34f4a2756ee55884b9e7fafe57d6d8b6af6be76dc5caf17c5f0050d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-18T10:16:33Z","title_canon_sha256":"7a5d146ac700c2af6f2e6a27fa467a00219f38ff64cc94b836827f73369a1683"},"schema_version":"1.0","source":{"id":"1103.3588","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.3588","created_at":"2026-05-18T04:26:32Z"},{"alias_kind":"arxiv_version","alias_value":"1103.3588v1","created_at":"2026-05-18T04:26:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.3588","created_at":"2026-05-18T04:26:32Z"},{"alias_kind":"pith_short_12","alias_value":"2RC5KJSND2SJ","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2RC5KJSND2SJLHNY","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2RC5KJSN","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:d81de92d7e93caa86f3b0ad7ee4454118f21900bad1d72dfb685798df7732e68","target":"graph","created_at":"2026-05-18T04:26:32Z","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":"For an ordered set $W=\\{w_1,w_2,...,w_k\\}$ of vertices and a vertex $v$ in a connected graph $G$, the ordered $k$-vector $r(v|W):=(d(v,w_1),d(v,w_2),...,d(v,w_k))$ is called the (metric) representation of $v$ with respect to $W$, where $d(x,y)$ is the distance between the vertices $x$ and $y$. The set $W$ is called a resolving set for $G$ if distinct vertices of $G$ have distinct representations with respect to $W$. The minimum cardinality of a resolving set for $G$ is its metric dimension. In this paper, we characterize all graphs of order $n$ with metric dimension $n-3$.","authors_text":"Behnaz Omoomi, Mohsen Jannesari","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-18T10:16:33Z","title":"Characterization of n-Vertex Graphs with Metric Dimension n-3"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.3588","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:1e41fe0246bf1725cd78bb9a6786b5b669d0e59471359834cdcd15bcf360fd42","target":"record","created_at":"2026-05-18T04:26:32Z","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":"76b0c925f34f4a2756ee55884b9e7fafe57d6d8b6af6be76dc5caf17c5f0050d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-18T10:16:33Z","title_canon_sha256":"7a5d146ac700c2af6f2e6a27fa467a00219f38ff64cc94b836827f73369a1683"},"schema_version":"1.0","source":{"id":"1103.3588","kind":"arxiv","version":1}},"canonical_sha256":"d445d5264d1ea4959db81407ccd8a0b1878a382a616eaad8428d7170e33944b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d445d5264d1ea4959db81407ccd8a0b1878a382a616eaad8428d7170e33944b3","first_computed_at":"2026-05-18T04:26:32.316411Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:26:32.316411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ORUx1kwtvoyGNAoiUb7w4qfbWE69UPnUxUDo1uT4OXYwIYtTfdf1i+feEXs1l+9xGgIsax+DrqwInuybL1svCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:26:32.316883Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.3588","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e41fe0246bf1725cd78bb9a6786b5b669d0e59471359834cdcd15bcf360fd42","sha256:d81de92d7e93caa86f3b0ad7ee4454118f21900bad1d72dfb685798df7732e68"],"state_sha256":"097cc6beab9bb0e60098c9c65b01c6b1b74c8f91aac779bed7e65fe70c52806c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rtI8erJ4729QgR+dgmKAQTCs08kQlhAyoQIeY+yi57QlaOn43DugZ6WC8qbfvrCqW4TANNnYj2xmY+a9XOZeCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T10:23:39.424354Z","bundle_sha256":"42a7ddc04cf6359757c3658282bb698a04827fa921bc9502ad1be0b8364b5d5a"}}