{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:2VPKO6PT3JLA6GMBJJ6JOJUDL5","short_pith_number":"pith:2VPKO6PT","schema_version":"1.0","canonical_sha256":"d55ea779f3da560f19814a7c9726835f6646a27101367d82647e8fc14bb4fd1a","source":{"kind":"arxiv","id":"1103.3570","version":1},"attestation_state":"computed","paper":{"title":"Characterization of Randomly k-Dimensional Graphs","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-18T07:56:21Z","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$. A minimum resolving set for $G$ is a basis of $G$ and its cardinality is the metric dimension of $G$. The resolving number of a connected graph $G$ is the minimum $k$, such that ever"},"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":"1103.3570","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-18T07:56:21Z","cross_cats_sorted":[],"title_canon_sha256":"cc3e572d194be1e688f3a06cf40a1724bd681b4734c2ac61e693cea83a622e17","abstract_canon_sha256":"38a54225044c6281cb609569a41950fc3891190de373aafde862a04f4508d5eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:26:32.384543Z","signature_b64":"bVSDlegYrlW+EaMPPsA9jshSqaaG/OE5zhDPXnIuDl/QBW9Xq5K1L9gWIQ41TWA0dOiEU4VQ05zTrhA36s/PCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d55ea779f3da560f19814a7c9726835f6646a27101367d82647e8fc14bb4fd1a","last_reissued_at":"2026-05-18T04:26:32.382593Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:26:32.382593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Characterization of Randomly k-Dimensional Graphs","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-18T07:56:21Z","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$. A minimum resolving set for $G$ is a basis of $G$ and its cardinality is the metric dimension of $G$. The resolving number of a connected graph $G$ is the minimum $k$, such that ever"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.3570","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":"1103.3570","created_at":"2026-05-18T04:26:32.383372+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.3570v1","created_at":"2026-05-18T04:26:32.383372+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.3570","created_at":"2026-05-18T04:26:32.383372+00:00"},{"alias_kind":"pith_short_12","alias_value":"2VPKO6PT3JLA","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"2VPKO6PT3JLA6GMB","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"2VPKO6PT","created_at":"2026-05-18T12:26:18.847500+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/2VPKO6PT3JLA6GMBJJ6JOJUDL5","json":"https://pith.science/pith/2VPKO6PT3JLA6GMBJJ6JOJUDL5.json","graph_json":"https://pith.science/api/pith-number/2VPKO6PT3JLA6GMBJJ6JOJUDL5/graph.json","events_json":"https://pith.science/api/pith-number/2VPKO6PT3JLA6GMBJJ6JOJUDL5/events.json","paper":"https://pith.science/paper/2VPKO6PT"},"agent_actions":{"view_html":"https://pith.science/pith/2VPKO6PT3JLA6GMBJJ6JOJUDL5","download_json":"https://pith.science/pith/2VPKO6PT3JLA6GMBJJ6JOJUDL5.json","view_paper":"https://pith.science/paper/2VPKO6PT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.3570&json=true","fetch_graph":"https://pith.science/api/pith-number/2VPKO6PT3JLA6GMBJJ6JOJUDL5/graph.json","fetch_events":"https://pith.science/api/pith-number/2VPKO6PT3JLA6GMBJJ6JOJUDL5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2VPKO6PT3JLA6GMBJJ6JOJUDL5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2VPKO6PT3JLA6GMBJJ6JOJUDL5/action/storage_attestation","attest_author":"https://pith.science/pith/2VPKO6PT3JLA6GMBJJ6JOJUDL5/action/author_attestation","sign_citation":"https://pith.science/pith/2VPKO6PT3JLA6GMBJJ6JOJUDL5/action/citation_signature","submit_replication":"https://pith.science/pith/2VPKO6PT3JLA6GMBJJ6JOJUDL5/action/replication_record"}},"created_at":"2026-05-18T04:26:32.383372+00:00","updated_at":"2026-05-18T04:26:32.383372+00:00"}