{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:OUCVXISARE5TY4MDTYW3V2I6ML","short_pith_number":"pith:OUCVXISA","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"},"canonical_sha256":"75055ba240893b3c71839e2dbae91e62e393f94f14be7564dbe1dbe016f5dda8","source":{"kind":"arxiv","id":"1708.04396","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.04396","created_at":"2026-05-18T00:37:59Z"},{"alias_kind":"arxiv_version","alias_value":"1708.04396v1","created_at":"2026-05-18T00:37:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04396","created_at":"2026-05-18T00:37:59Z"},{"alias_kind":"pith_short_12","alias_value":"OUCVXISARE5T","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OUCVXISARE5TY4MD","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OUCVXISA","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:OUCVXISARE5TY4MDTYW3V2I6ML","target":"record","payload":{"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"},"canonical_sha256":"75055ba240893b3c71839e2dbae91e62e393f94f14be7564dbe1dbe016f5dda8","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"},"source_kind":"arxiv","source_id":"1708.04396","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:37:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uDx2OWCs8Rs89Y4XL8awrRIi1Zh4nWknk8nqTaSbac5tShoATKT9JoTFUZv1W3GnqtNxHrFXKj9LdzCoHFXhBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:17:34.030748Z"},"content_sha256":"5c91e30742a0f3b4cc869c93ea409be34c9350c0218270ff15c7e0031048d10f","schema_version":"1.0","event_id":"sha256:5c91e30742a0f3b4cc869c93ea409be34c9350c0218270ff15c7e0031048d10f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:OUCVXISARE5TY4MDTYW3V2I6ML","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:37:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1QsKovFsKnflFDuc29lnetOkb2b6UDi+wOQvJVcw9DWnVBV4bMy6ZSC58zhINA13bgMh8tYTN/YpIqRD8CzrAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:17:34.031101Z"},"content_sha256":"25d5517921c45d5255ddb088edd398dbe4330084380faca28e8112531734895f","schema_version":"1.0","event_id":"sha256:25d5517921c45d5255ddb088edd398dbe4330084380faca28e8112531734895f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OUCVXISARE5TY4MDTYW3V2I6ML/bundle.json","state_url":"https://pith.science/pith/OUCVXISARE5TY4MDTYW3V2I6ML/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OUCVXISARE5TY4MDTYW3V2I6ML/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T06:17:34Z","links":{"resolver":"https://pith.science/pith/OUCVXISARE5TY4MDTYW3V2I6ML","bundle":"https://pith.science/pith/OUCVXISARE5TY4MDTYW3V2I6ML/bundle.json","state":"https://pith.science/pith/OUCVXISARE5TY4MDTYW3V2I6ML/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OUCVXISARE5TY4MDTYW3V2I6ML/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OUCVXISARE5TY4MDTYW3V2I6ML","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c69e9a0ad8f8763b67164799dccee452a6a31fe29fbf0f3731434c1e76012639","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-08-15T05:09:44Z","title_canon_sha256":"569018b1722231c4fcd571366fb45be71c616a95eb64c2f4fbb748767ab64512"},"schema_version":"1.0","source":{"id":"1708.04396","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.04396","created_at":"2026-05-18T00:37:59Z"},{"alias_kind":"arxiv_version","alias_value":"1708.04396v1","created_at":"2026-05-18T00:37:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04396","created_at":"2026-05-18T00:37:59Z"},{"alias_kind":"pith_short_12","alias_value":"OUCVXISARE5T","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OUCVXISARE5TY4MD","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OUCVXISA","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:25d5517921c45d5255ddb088edd398dbe4330084380faca28e8112531734895f","target":"graph","created_at":"2026-05-18T00:37:59Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Dingxian Wang, Ming Gao, Min-Yen Kan, Xiangnan He","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-08-15T05:09:44Z","title":"BiRank: Towards Ranking on Bipartite Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04396","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5c91e30742a0f3b4cc869c93ea409be34c9350c0218270ff15c7e0031048d10f","target":"record","created_at":"2026-05-18T00:37:59Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c69e9a0ad8f8763b67164799dccee452a6a31fe29fbf0f3731434c1e76012639","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-08-15T05:09:44Z","title_canon_sha256":"569018b1722231c4fcd571366fb45be71c616a95eb64c2f4fbb748767ab64512"},"schema_version":"1.0","source":{"id":"1708.04396","kind":"arxiv","version":1}},"canonical_sha256":"75055ba240893b3c71839e2dbae91e62e393f94f14be7564dbe1dbe016f5dda8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75055ba240893b3c71839e2dbae91e62e393f94f14be7564dbe1dbe016f5dda8","first_computed_at":"2026-05-18T00:37:59.435625Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:59.435625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XqC99sM9XuwJg78ptCfgsntoHCDoyMcd5bx+2JckC9dzjA+pDR7m1J/3J57mfz/mBjbK8ziEhWp0nZuZYmymCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:59.436193Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.04396","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c91e30742a0f3b4cc869c93ea409be34c9350c0218270ff15c7e0031048d10f","sha256:25d5517921c45d5255ddb088edd398dbe4330084380faca28e8112531734895f"],"state_sha256":"3e54530ded79c3b7e96fed079f46937af46ed97bf77e72a46ac94b4f462b3629"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8E2pTlJQyaA9j/ejjdBvlFUQuEYbQRFx5LZ8qK+rl8qsOLJ3Dbz9UrHP9/jcMcWXkNNt3iXp383zOLAzP8LzAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T06:17:34.033186Z","bundle_sha256":"2c6a0b0ec517fb82ba45e59dfc02c58b4052bce3dfa7df31d68e702664d0a96b"}}