{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:RXTPP6BQC5XZILU6HMZ6W52NGP","short_pith_number":"pith:RXTPP6BQ","schema_version":"1.0","canonical_sha256":"8de6f7f830176f942e9e3b33eb774d33e1aa7da505fad0854bebb2239f84182e","source":{"kind":"arxiv","id":"0908.2741","version":3},"attestation_state":"computed","paper":{"title":"B-Rank: A top N Recommendation Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"physics.data-an","authors_text":"Marcel Blattner","submitted_at":"2009-08-19T12:53:33Z","abstract_excerpt":"In this paper B-Rank, an efficient ranking algorithm for recommender systems, is proposed. B-Rank is based on a random walk model on hypergraphs. Depending on the setup, B-Rank outperforms other state of the art algorithms in terms of precision, recall (19% - 50%), and inter list diversity (20% - 60%). B-Rank captures well the difference between popular and niche objects. The proposed algorithm produces very promising results for sparse and dense voting matrices. Furthermore, a recommendation list update algorithm is introduced,to cope with new votes. This technique significantly reduces compu"},"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":"0908.2741","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.data-an","submitted_at":"2009-08-19T12:53:33Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"e37d912f87af58c37c14cfd9fee3588dc756edb9b10fb599e07e052c0b622e88","abstract_canon_sha256":"d60dfd017d274d2a13adaa233bec93edb432aa9b0ff8f7bfcf9010bd33798e76"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:45.382892Z","signature_b64":"OQnQEv1BDyAcAGFcV/c3HYcApVpXflwLdVfe5P4DCj9KciFneNU9piSpxdp0VgWfS7rhy3gaOAK+zf3pYU92Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8de6f7f830176f942e9e3b33eb774d33e1aa7da505fad0854bebb2239f84182e","last_reissued_at":"2026-05-18T03:56:45.382176Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:45.382176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"B-Rank: A top N Recommendation Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"physics.data-an","authors_text":"Marcel Blattner","submitted_at":"2009-08-19T12:53:33Z","abstract_excerpt":"In this paper B-Rank, an efficient ranking algorithm for recommender systems, is proposed. B-Rank is based on a random walk model on hypergraphs. Depending on the setup, B-Rank outperforms other state of the art algorithms in terms of precision, recall (19% - 50%), and inter list diversity (20% - 60%). B-Rank captures well the difference between popular and niche objects. The proposed algorithm produces very promising results for sparse and dense voting matrices. Furthermore, a recommendation list update algorithm is introduced,to cope with new votes. This technique significantly reduces compu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0908.2741","kind":"arxiv","version":3},"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":"0908.2741","created_at":"2026-05-18T03:56:45.382294+00:00"},{"alias_kind":"arxiv_version","alias_value":"0908.2741v3","created_at":"2026-05-18T03:56:45.382294+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0908.2741","created_at":"2026-05-18T03:56:45.382294+00:00"},{"alias_kind":"pith_short_12","alias_value":"RXTPP6BQC5XZ","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"RXTPP6BQC5XZILU6","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"RXTPP6BQ","created_at":"2026-05-18T12:26:01.383474+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/RXTPP6BQC5XZILU6HMZ6W52NGP","json":"https://pith.science/pith/RXTPP6BQC5XZILU6HMZ6W52NGP.json","graph_json":"https://pith.science/api/pith-number/RXTPP6BQC5XZILU6HMZ6W52NGP/graph.json","events_json":"https://pith.science/api/pith-number/RXTPP6BQC5XZILU6HMZ6W52NGP/events.json","paper":"https://pith.science/paper/RXTPP6BQ"},"agent_actions":{"view_html":"https://pith.science/pith/RXTPP6BQC5XZILU6HMZ6W52NGP","download_json":"https://pith.science/pith/RXTPP6BQC5XZILU6HMZ6W52NGP.json","view_paper":"https://pith.science/paper/RXTPP6BQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0908.2741&json=true","fetch_graph":"https://pith.science/api/pith-number/RXTPP6BQC5XZILU6HMZ6W52NGP/graph.json","fetch_events":"https://pith.science/api/pith-number/RXTPP6BQC5XZILU6HMZ6W52NGP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RXTPP6BQC5XZILU6HMZ6W52NGP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RXTPP6BQC5XZILU6HMZ6W52NGP/action/storage_attestation","attest_author":"https://pith.science/pith/RXTPP6BQC5XZILU6HMZ6W52NGP/action/author_attestation","sign_citation":"https://pith.science/pith/RXTPP6BQC5XZILU6HMZ6W52NGP/action/citation_signature","submit_replication":"https://pith.science/pith/RXTPP6BQC5XZILU6HMZ6W52NGP/action/replication_record"}},"created_at":"2026-05-18T03:56:45.382294+00:00","updated_at":"2026-05-18T03:56:45.382294+00:00"}