{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:YQ6GBECZUP7GSKI2N2MVJ5YLT3","short_pith_number":"pith:YQ6GBECZ","schema_version":"1.0","canonical_sha256":"c43c609059a3fe69291a6e9954f70b9ee9d98fecd5d917599db10dd0d2b42064","source":{"kind":"arxiv","id":"1206.1906","version":1},"attestation_state":"computed","paper":{"title":"On the fractional metric dimension of corona product graphs and lexicographic product graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kaishun Wang, Min Feng","submitted_at":"2012-06-09T04:45:29Z","abstract_excerpt":"A vertex $x$ in a graph $G$ resolves two vertices $u$, $v$ of $G$ if the distance between $u$ and $x$ is not equal to the distance between $v$ and $x$. A function $g$ from the vertex set of $G$ to $[0,1]$ is a resolving function of $G$ if $g(R_G\\{u,v\\})\\geq 1$ for any two distinct vertices $u$ and $v$, where $R_G\\{u,v\\}$ is the set of vertices resolving $u$ and $v$. The real number $\\sum_{v\\in V(G)}g(v)$ is the weight of $g$. The minimum weight of all resolving functions for $G$ is called the fractional metric dimension of $G$, denoted by $\\dim_f(G)$. In this paper we reduce the problem of com"},"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":"1206.1906","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-09T04:45:29Z","cross_cats_sorted":[],"title_canon_sha256":"1df4c44bb2a50f9edd306ab5d425fa3cf5831feac1308481d01238f0ee25048b","abstract_canon_sha256":"b71dea8d44c2820db6b309ffcd82b47c27012a3061e20f51d5206eb2a256f1d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:10.789962Z","signature_b64":"kM3RMLIMZt6sBz35ARi3WsD9RMu94OBba8iAOKqwRjudmt9tGlhSYZZwoC9EB23JwthQsdG5ndnJEiTGAaaKBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c43c609059a3fe69291a6e9954f70b9ee9d98fecd5d917599db10dd0d2b42064","last_reissued_at":"2026-05-18T02:25:10.789507Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:10.789507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the fractional metric dimension of corona product graphs and lexicographic product graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kaishun Wang, Min Feng","submitted_at":"2012-06-09T04:45:29Z","abstract_excerpt":"A vertex $x$ in a graph $G$ resolves two vertices $u$, $v$ of $G$ if the distance between $u$ and $x$ is not equal to the distance between $v$ and $x$. A function $g$ from the vertex set of $G$ to $[0,1]$ is a resolving function of $G$ if $g(R_G\\{u,v\\})\\geq 1$ for any two distinct vertices $u$ and $v$, where $R_G\\{u,v\\}$ is the set of vertices resolving $u$ and $v$. The real number $\\sum_{v\\in V(G)}g(v)$ is the weight of $g$. The minimum weight of all resolving functions for $G$ is called the fractional metric dimension of $G$, denoted by $\\dim_f(G)$. In this paper we reduce the problem of com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.1906","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":"1206.1906","created_at":"2026-05-18T02:25:10.789578+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.1906v1","created_at":"2026-05-18T02:25:10.789578+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.1906","created_at":"2026-05-18T02:25:10.789578+00:00"},{"alias_kind":"pith_short_12","alias_value":"YQ6GBECZUP7G","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"YQ6GBECZUP7GSKI2","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"YQ6GBECZ","created_at":"2026-05-18T12:27:30.460161+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/YQ6GBECZUP7GSKI2N2MVJ5YLT3","json":"https://pith.science/pith/YQ6GBECZUP7GSKI2N2MVJ5YLT3.json","graph_json":"https://pith.science/api/pith-number/YQ6GBECZUP7GSKI2N2MVJ5YLT3/graph.json","events_json":"https://pith.science/api/pith-number/YQ6GBECZUP7GSKI2N2MVJ5YLT3/events.json","paper":"https://pith.science/paper/YQ6GBECZ"},"agent_actions":{"view_html":"https://pith.science/pith/YQ6GBECZUP7GSKI2N2MVJ5YLT3","download_json":"https://pith.science/pith/YQ6GBECZUP7GSKI2N2MVJ5YLT3.json","view_paper":"https://pith.science/paper/YQ6GBECZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.1906&json=true","fetch_graph":"https://pith.science/api/pith-number/YQ6GBECZUP7GSKI2N2MVJ5YLT3/graph.json","fetch_events":"https://pith.science/api/pith-number/YQ6GBECZUP7GSKI2N2MVJ5YLT3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YQ6GBECZUP7GSKI2N2MVJ5YLT3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YQ6GBECZUP7GSKI2N2MVJ5YLT3/action/storage_attestation","attest_author":"https://pith.science/pith/YQ6GBECZUP7GSKI2N2MVJ5YLT3/action/author_attestation","sign_citation":"https://pith.science/pith/YQ6GBECZUP7GSKI2N2MVJ5YLT3/action/citation_signature","submit_replication":"https://pith.science/pith/YQ6GBECZUP7GSKI2N2MVJ5YLT3/action/replication_record"}},"created_at":"2026-05-18T02:25:10.789578+00:00","updated_at":"2026-05-18T02:25:10.789578+00:00"}