{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:N5XLPJGJES2MMAUFEHAB5SST62","short_pith_number":"pith:N5XLPJGJ","schema_version":"1.0","canonical_sha256":"6f6eb7a4c924b4c6028521c01eca53f68d4ff523330b98cbc87b667cc1c9a9ef","source":{"kind":"arxiv","id":"1602.00668","version":2},"attestation_state":"computed","paper":{"title":"On the Structure and Efficient Computation of IsoRank Node Similarities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE"],"primary_cat":"q-bio.MN","authors_text":"Ehsan Kazemi, Matthias Grossglauser","submitted_at":"2016-02-01T20:28:40Z","abstract_excerpt":"The alignment of protein-protein interaction (PPI) networks has many applications, such as the detection of conserved biological network motifs, the prediction of protein interactions, and the reconstruction of phylogenetic trees [1, 2, 3]. IsoRank is one of the first global network alignment algorithms [4, 5, 6], where the goal is to match all (or most) of the nodes of two PPI networks. The IsoRank algorithm first computes a pairwise node similarity metric, and then generates a matching between the two node sets based on this metric. The metric is a convex combination of a structural similari"},"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":"1602.00668","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.MN","submitted_at":"2016-02-01T20:28:40Z","cross_cats_sorted":["cs.CE"],"title_canon_sha256":"9582f1b291eba66c3638a2cf69353c7e5c6024dafc4baceff8c8f3956b037a70","abstract_canon_sha256":"9d29afb9f5542c654553a43d566bbe1f5f720aa1de86ef602a12066aeca16dfb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:53.098751Z","signature_b64":"8ViEvkhQUNayY3FOZyoqHuBdmeVAlP5ejVEyFuekQjTUILDh2Y+Rl60OwSsRHDwaORIzVxEklMM8+iQ7jRn2Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f6eb7a4c924b4c6028521c01eca53f68d4ff523330b98cbc87b667cc1c9a9ef","last_reissued_at":"2026-05-18T00:22:53.098324Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:53.098324Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Structure and Efficient Computation of IsoRank Node Similarities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE"],"primary_cat":"q-bio.MN","authors_text":"Ehsan Kazemi, Matthias Grossglauser","submitted_at":"2016-02-01T20:28:40Z","abstract_excerpt":"The alignment of protein-protein interaction (PPI) networks has many applications, such as the detection of conserved biological network motifs, the prediction of protein interactions, and the reconstruction of phylogenetic trees [1, 2, 3]. IsoRank is one of the first global network alignment algorithms [4, 5, 6], where the goal is to match all (or most) of the nodes of two PPI networks. The IsoRank algorithm first computes a pairwise node similarity metric, and then generates a matching between the two node sets based on this metric. The metric is a convex combination of a structural similari"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00668","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":"1602.00668","created_at":"2026-05-18T00:22:53.098381+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.00668v2","created_at":"2026-05-18T00:22:53.098381+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00668","created_at":"2026-05-18T00:22:53.098381+00:00"},{"alias_kind":"pith_short_12","alias_value":"N5XLPJGJES2M","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"N5XLPJGJES2MMAUF","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"N5XLPJGJ","created_at":"2026-05-18T12:30:32.724797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.08880","citing_title":"Spectral Graph Matching and Regularized Quadratic Relaxations I: The Gaussian Model","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N5XLPJGJES2MMAUFEHAB5SST62","json":"https://pith.science/pith/N5XLPJGJES2MMAUFEHAB5SST62.json","graph_json":"https://pith.science/api/pith-number/N5XLPJGJES2MMAUFEHAB5SST62/graph.json","events_json":"https://pith.science/api/pith-number/N5XLPJGJES2MMAUFEHAB5SST62/events.json","paper":"https://pith.science/paper/N5XLPJGJ"},"agent_actions":{"view_html":"https://pith.science/pith/N5XLPJGJES2MMAUFEHAB5SST62","download_json":"https://pith.science/pith/N5XLPJGJES2MMAUFEHAB5SST62.json","view_paper":"https://pith.science/paper/N5XLPJGJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.00668&json=true","fetch_graph":"https://pith.science/api/pith-number/N5XLPJGJES2MMAUFEHAB5SST62/graph.json","fetch_events":"https://pith.science/api/pith-number/N5XLPJGJES2MMAUFEHAB5SST62/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N5XLPJGJES2MMAUFEHAB5SST62/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N5XLPJGJES2MMAUFEHAB5SST62/action/storage_attestation","attest_author":"https://pith.science/pith/N5XLPJGJES2MMAUFEHAB5SST62/action/author_attestation","sign_citation":"https://pith.science/pith/N5XLPJGJES2MMAUFEHAB5SST62/action/citation_signature","submit_replication":"https://pith.science/pith/N5XLPJGJES2MMAUFEHAB5SST62/action/replication_record"}},"created_at":"2026-05-18T00:22:53.098381+00:00","updated_at":"2026-05-18T00:22:53.098381+00:00"}