{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OUCVXISARE5TY4MDTYW3V2I6ML","short_pith_number":"pith:OUCVXISA","schema_version":"1.0","canonical_sha256":"75055ba240893b3c71839e2dbae91e62e393f94f14be7564dbe1dbe016f5dda8","source":{"kind":"arxiv","id":"1708.04396","version":1},"attestation_state":"computed","paper":{"title":"BiRank: Towards Ranking on Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Dingxian Wang, Ming Gao, Min-Yen Kan, Xiangnan He","submitted_at":"2017-08-15T05:09:44Z","abstract_excerpt":"The bipartite graph is a ubiquitous data structure that can model the relationship between two entity types: for instance, users and items, queries and webpages. In this paper, we study the problem of ranking vertices of a bipartite graph, based on the graph's link structure as well as prior information about vertices (which we term a query vector). We present a new solution, BiRank, which iteratively assigns scores to vertices and finally converges to a unique stationary ranking. In contrast to the traditional random walk-based methods, BiRank iterates towards optimizing a regularization func"},"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":"1708.04396","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-08-15T05:09:44Z","cross_cats_sorted":[],"title_canon_sha256":"569018b1722231c4fcd571366fb45be71c616a95eb64c2f4fbb748767ab64512","abstract_canon_sha256":"c69e9a0ad8f8763b67164799dccee452a6a31fe29fbf0f3731434c1e76012639"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:59.436193Z","signature_b64":"XqC99sM9XuwJg78ptCfgsntoHCDoyMcd5bx+2JckC9dzjA+pDR7m1J/3J57mfz/mBjbK8ziEhWp0nZuZYmymCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75055ba240893b3c71839e2dbae91e62e393f94f14be7564dbe1dbe016f5dda8","last_reissued_at":"2026-05-18T00:37:59.435625Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:59.435625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"BiRank: Towards Ranking on Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Dingxian Wang, Ming Gao, Min-Yen Kan, Xiangnan He","submitted_at":"2017-08-15T05:09:44Z","abstract_excerpt":"The bipartite graph is a ubiquitous data structure that can model the relationship between two entity types: for instance, users and items, queries and webpages. In this paper, we study the problem of ranking vertices of a bipartite graph, based on the graph's link structure as well as prior information about vertices (which we term a query vector). We present a new solution, BiRank, which iteratively assigns scores to vertices and finally converges to a unique stationary ranking. In contrast to the traditional random walk-based methods, BiRank iterates towards optimizing a regularization func"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04396","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":"1708.04396","created_at":"2026-05-18T00:37:59.435727+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.04396v1","created_at":"2026-05-18T00:37:59.435727+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04396","created_at":"2026-05-18T00:37:59.435727+00:00"},{"alias_kind":"pith_short_12","alias_value":"OUCVXISARE5T","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"OUCVXISARE5TY4MD","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"OUCVXISA","created_at":"2026-05-18T12:31:34.259226+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/OUCVXISARE5TY4MDTYW3V2I6ML","json":"https://pith.science/pith/OUCVXISARE5TY4MDTYW3V2I6ML.json","graph_json":"https://pith.science/api/pith-number/OUCVXISARE5TY4MDTYW3V2I6ML/graph.json","events_json":"https://pith.science/api/pith-number/OUCVXISARE5TY4MDTYW3V2I6ML/events.json","paper":"https://pith.science/paper/OUCVXISA"},"agent_actions":{"view_html":"https://pith.science/pith/OUCVXISARE5TY4MDTYW3V2I6ML","download_json":"https://pith.science/pith/OUCVXISARE5TY4MDTYW3V2I6ML.json","view_paper":"https://pith.science/paper/OUCVXISA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.04396&json=true","fetch_graph":"https://pith.science/api/pith-number/OUCVXISARE5TY4MDTYW3V2I6ML/graph.json","fetch_events":"https://pith.science/api/pith-number/OUCVXISARE5TY4MDTYW3V2I6ML/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OUCVXISARE5TY4MDTYW3V2I6ML/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OUCVXISARE5TY4MDTYW3V2I6ML/action/storage_attestation","attest_author":"https://pith.science/pith/OUCVXISARE5TY4MDTYW3V2I6ML/action/author_attestation","sign_citation":"https://pith.science/pith/OUCVXISARE5TY4MDTYW3V2I6ML/action/citation_signature","submit_replication":"https://pith.science/pith/OUCVXISARE5TY4MDTYW3V2I6ML/action/replication_record"}},"created_at":"2026-05-18T00:37:59.435727+00:00","updated_at":"2026-05-18T00:37:59.435727+00:00"}