{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EQCBLLVLQD6PE3TMRN7YT45JRO","short_pith_number":"pith:EQCBLLVL","schema_version":"1.0","canonical_sha256":"240415aeab80fcf26e6c8b7f89f3a98ba4e674a5623160221799db3404534944","source":{"kind":"arxiv","id":"1809.00320","version":2},"attestation_state":"computed","paper":{"title":"Network Alignment by Discrete Ollivier-Ricci Flow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.SI","authors_text":"Chien-Chun Ni, Jie Gao, Xianfeng David Gu, Yu-Yao Lin","submitted_at":"2018-09-02T09:42:02Z","abstract_excerpt":"In this paper, we consider the problem of approximately aligning/matching two graphs. Given two graphs $G_{1}=(V_{1},E_{1})$ and $G_{2}=(V_{2},E_{2})$, the objective is to map nodes $u, v \\in G_1$ to nodes $u',v'\\in G_2$ such that when $u, v$ have an edge in $G_1$, very likely their corresponding nodes $u', v'$ in $G_2$ are connected as well. This problem with subgraph isomorphism as a special case has extra challenges when we consider matching complex networks exhibiting the small world phenomena. In this work, we propose to use `Ricci flow metric', to define the distance between two nodes in"},"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":"1809.00320","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-09-02T09:42:02Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"b1324454793aa8c4ff243089335c806c24b663a43732c3c066e44cdcc6ed3731","abstract_canon_sha256":"87f4d982efd7666387b3ab2f875768aabcd2048b5e5459d6abd121926b9748a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:15.839762Z","signature_b64":"sT3HHimvXQ1aTOcr70PUeAYOUhPaLguLVue6ifV1R2rVC5+p+CREQBxgIxkbKcZp1Uf/wS1EMBAEgsLGQajFCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"240415aeab80fcf26e6c8b7f89f3a98ba4e674a5623160221799db3404534944","last_reissued_at":"2026-05-18T00:06:15.839108Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:15.839108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Network Alignment by Discrete Ollivier-Ricci Flow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.SI","authors_text":"Chien-Chun Ni, Jie Gao, Xianfeng David Gu, Yu-Yao Lin","submitted_at":"2018-09-02T09:42:02Z","abstract_excerpt":"In this paper, we consider the problem of approximately aligning/matching two graphs. Given two graphs $G_{1}=(V_{1},E_{1})$ and $G_{2}=(V_{2},E_{2})$, the objective is to map nodes $u, v \\in G_1$ to nodes $u',v'\\in G_2$ such that when $u, v$ have an edge in $G_1$, very likely their corresponding nodes $u', v'$ in $G_2$ are connected as well. This problem with subgraph isomorphism as a special case has extra challenges when we consider matching complex networks exhibiting the small world phenomena. In this work, we propose to use `Ricci flow metric', to define the distance between two nodes in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.00320","kind":"arxiv","version":2},"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":"1809.00320","created_at":"2026-05-18T00:06:15.839204+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.00320v2","created_at":"2026-05-18T00:06:15.839204+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.00320","created_at":"2026-05-18T00:06:15.839204+00:00"},{"alias_kind":"pith_short_12","alias_value":"EQCBLLVLQD6P","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EQCBLLVLQD6PE3TM","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EQCBLLVL","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/EQCBLLVLQD6PE3TMRN7YT45JRO","json":"https://pith.science/pith/EQCBLLVLQD6PE3TMRN7YT45JRO.json","graph_json":"https://pith.science/api/pith-number/EQCBLLVLQD6PE3TMRN7YT45JRO/graph.json","events_json":"https://pith.science/api/pith-number/EQCBLLVLQD6PE3TMRN7YT45JRO/events.json","paper":"https://pith.science/paper/EQCBLLVL"},"agent_actions":{"view_html":"https://pith.science/pith/EQCBLLVLQD6PE3TMRN7YT45JRO","download_json":"https://pith.science/pith/EQCBLLVLQD6PE3TMRN7YT45JRO.json","view_paper":"https://pith.science/paper/EQCBLLVL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.00320&json=true","fetch_graph":"https://pith.science/api/pith-number/EQCBLLVLQD6PE3TMRN7YT45JRO/graph.json","fetch_events":"https://pith.science/api/pith-number/EQCBLLVLQD6PE3TMRN7YT45JRO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EQCBLLVLQD6PE3TMRN7YT45JRO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EQCBLLVLQD6PE3TMRN7YT45JRO/action/storage_attestation","attest_author":"https://pith.science/pith/EQCBLLVLQD6PE3TMRN7YT45JRO/action/author_attestation","sign_citation":"https://pith.science/pith/EQCBLLVLQD6PE3TMRN7YT45JRO/action/citation_signature","submit_replication":"https://pith.science/pith/EQCBLLVLQD6PE3TMRN7YT45JRO/action/replication_record"}},"created_at":"2026-05-18T00:06:15.839204+00:00","updated_at":"2026-05-18T00:06:15.839204+00:00"}