{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:F66LNXKCHH4C5IEPA2P6LQXRNX","short_pith_number":"pith:F66LNXKC","schema_version":"1.0","canonical_sha256":"2fbcb6dd4239f82ea08f069fe5c2f16dc388311bbdf03602eb7338eff804d870","source":{"kind":"arxiv","id":"1804.07136","version":1},"attestation_state":"computed","paper":{"title":"Isometric embeddings of graphs into Riemannian manifolds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.MG","authors_text":"Shiquan Ren","submitted_at":"2018-04-19T13:14:14Z","abstract_excerpt":"An isometric embedding of a graph into a metric space is an embedding of the vertices such that the smallest number of edges connecting any two vertices equals to the distance in the metric space between the images. In this paper, we study isometric embeddings of graphs into Riemannian manifolds. We give some classifications of graphs that can be isometrically embedded into certain Riemannian manifolds."},"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":"1804.07136","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2018-04-19T13:14:14Z","cross_cats_sorted":[],"title_canon_sha256":"fb6b8fc00c2ddbd59b02dddbceabd4c15f06953e7b13b82318bd2a8289eba6fb","abstract_canon_sha256":"5626aac850f2b1771b4cf7aab9c5661c44e96ac5b6c3f3fe489dc564858f848e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:01.332767Z","signature_b64":"ZyFVExDHjkbwg7Lk4aoVQUDRmXvnWuXmHulp8CTLFGWupgh+p/oUjm9pqpZV64Yph86jJm2dWyOnDOSOyRjuCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fbcb6dd4239f82ea08f069fe5c2f16dc388311bbdf03602eb7338eff804d870","last_reissued_at":"2026-05-18T00:18:01.331959Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:01.331959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Isometric embeddings of graphs into Riemannian manifolds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.MG","authors_text":"Shiquan Ren","submitted_at":"2018-04-19T13:14:14Z","abstract_excerpt":"An isometric embedding of a graph into a metric space is an embedding of the vertices such that the smallest number of edges connecting any two vertices equals to the distance in the metric space between the images. In this paper, we study isometric embeddings of graphs into Riemannian manifolds. We give some classifications of graphs that can be isometrically embedded into certain Riemannian manifolds."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.07136","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":"1804.07136","created_at":"2026-05-18T00:18:01.332086+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.07136v1","created_at":"2026-05-18T00:18:01.332086+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.07136","created_at":"2026-05-18T00:18:01.332086+00:00"},{"alias_kind":"pith_short_12","alias_value":"F66LNXKCHH4C","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"F66LNXKCHH4C5IEP","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"F66LNXKC","created_at":"2026-05-18T12:32:22.470017+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/F66LNXKCHH4C5IEPA2P6LQXRNX","json":"https://pith.science/pith/F66LNXKCHH4C5IEPA2P6LQXRNX.json","graph_json":"https://pith.science/api/pith-number/F66LNXKCHH4C5IEPA2P6LQXRNX/graph.json","events_json":"https://pith.science/api/pith-number/F66LNXKCHH4C5IEPA2P6LQXRNX/events.json","paper":"https://pith.science/paper/F66LNXKC"},"agent_actions":{"view_html":"https://pith.science/pith/F66LNXKCHH4C5IEPA2P6LQXRNX","download_json":"https://pith.science/pith/F66LNXKCHH4C5IEPA2P6LQXRNX.json","view_paper":"https://pith.science/paper/F66LNXKC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.07136&json=true","fetch_graph":"https://pith.science/api/pith-number/F66LNXKCHH4C5IEPA2P6LQXRNX/graph.json","fetch_events":"https://pith.science/api/pith-number/F66LNXKCHH4C5IEPA2P6LQXRNX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F66LNXKCHH4C5IEPA2P6LQXRNX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F66LNXKCHH4C5IEPA2P6LQXRNX/action/storage_attestation","attest_author":"https://pith.science/pith/F66LNXKCHH4C5IEPA2P6LQXRNX/action/author_attestation","sign_citation":"https://pith.science/pith/F66LNXKCHH4C5IEPA2P6LQXRNX/action/citation_signature","submit_replication":"https://pith.science/pith/F66LNXKCHH4C5IEPA2P6LQXRNX/action/replication_record"}},"created_at":"2026-05-18T00:18:01.332086+00:00","updated_at":"2026-05-18T00:18:01.332086+00:00"}