{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:YLKQKRSSI4P2I4GUENEU7QNO3S","short_pith_number":"pith:YLKQKRSS","schema_version":"1.0","canonical_sha256":"c2d5054652471fa470d423494fc1aedcbfad5326f412a4fa6221ac670b9e1945","source":{"kind":"arxiv","id":"2404.14243","version":1},"attestation_state":"computed","paper":{"title":"Turbo-CF: Matrix Decomposition-Free Graph Filtering for Fast Recommendation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.IT","cs.LG","cs.SI","math.IT"],"primary_cat":"cs.IR","authors_text":"Jin-Duk Park, Won-Yong Shin, Yong-Min Shin","submitted_at":"2024-04-22T14:56:36Z","abstract_excerpt":"A series of graph filtering (GF)-based collaborative filtering (CF) showcases state-of-the-art performance on the recommendation accuracy by using a low-pass filter (LPF) without a training process. However, conventional GF-based CF approaches mostly perform matrix decomposition on the item-item similarity graph to realize the ideal LPF, which results in a non-trivial computational cost and thus makes them less practical in scenarios where rapid recommendations are essential. In this paper, we propose Turbo-CF, a GF-based CF method that is both training-free and matrix decomposition-free. Turb"},"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":"2404.14243","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2024-04-22T14:56:36Z","cross_cats_sorted":["cs.AI","cs.IT","cs.LG","cs.SI","math.IT"],"title_canon_sha256":"28d69e8dc51f22634464fc3131900537dae5dd3152669451dff8d59da0958fcf","abstract_canon_sha256":"470d91e9c7e565aba1205db705e57728afcfe4293996829b659f5ecfc048725d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:10:44.217407Z","signature_b64":"IXPH9mSVlLp7PtUectqzTsVGjD8kFWLUH85ZBTYF8dvpNjgMVuliEroO93WoKr7+1wLRD0ijNOU4VbEJKnbXCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2d5054652471fa470d423494fc1aedcbfad5326f412a4fa6221ac670b9e1945","last_reissued_at":"2026-07-05T08:10:44.216957Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:10:44.216957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Turbo-CF: Matrix Decomposition-Free Graph Filtering for Fast Recommendation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.IT","cs.LG","cs.SI","math.IT"],"primary_cat":"cs.IR","authors_text":"Jin-Duk Park, Won-Yong Shin, Yong-Min Shin","submitted_at":"2024-04-22T14:56:36Z","abstract_excerpt":"A series of graph filtering (GF)-based collaborative filtering (CF) showcases state-of-the-art performance on the recommendation accuracy by using a low-pass filter (LPF) without a training process. However, conventional GF-based CF approaches mostly perform matrix decomposition on the item-item similarity graph to realize the ideal LPF, which results in a non-trivial computational cost and thus makes them less practical in scenarios where rapid recommendations are essential. In this paper, we propose Turbo-CF, a GF-based CF method that is both training-free and matrix decomposition-free. Turb"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.14243","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2404.14243/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2404.14243","created_at":"2026-07-05T08:10:44.217008+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.14243v1","created_at":"2026-07-05T08:10:44.217008+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.14243","created_at":"2026-07-05T08:10:44.217008+00:00"},{"alias_kind":"pith_short_12","alias_value":"YLKQKRSSI4P2","created_at":"2026-07-05T08:10:44.217008+00:00"},{"alias_kind":"pith_short_16","alias_value":"YLKQKRSSI4P2I4GU","created_at":"2026-07-05T08:10:44.217008+00:00"},{"alias_kind":"pith_short_8","alias_value":"YLKQKRSS","created_at":"2026-07-05T08:10:44.217008+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.10247","citing_title":"DualSpectralCF: Training-Free Sign-Aware Spectral Collaborative Filtering","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YLKQKRSSI4P2I4GUENEU7QNO3S","json":"https://pith.science/pith/YLKQKRSSI4P2I4GUENEU7QNO3S.json","graph_json":"https://pith.science/api/pith-number/YLKQKRSSI4P2I4GUENEU7QNO3S/graph.json","events_json":"https://pith.science/api/pith-number/YLKQKRSSI4P2I4GUENEU7QNO3S/events.json","paper":"https://pith.science/paper/YLKQKRSS"},"agent_actions":{"view_html":"https://pith.science/pith/YLKQKRSSI4P2I4GUENEU7QNO3S","download_json":"https://pith.science/pith/YLKQKRSSI4P2I4GUENEU7QNO3S.json","view_paper":"https://pith.science/paper/YLKQKRSS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.14243&json=true","fetch_graph":"https://pith.science/api/pith-number/YLKQKRSSI4P2I4GUENEU7QNO3S/graph.json","fetch_events":"https://pith.science/api/pith-number/YLKQKRSSI4P2I4GUENEU7QNO3S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YLKQKRSSI4P2I4GUENEU7QNO3S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YLKQKRSSI4P2I4GUENEU7QNO3S/action/storage_attestation","attest_author":"https://pith.science/pith/YLKQKRSSI4P2I4GUENEU7QNO3S/action/author_attestation","sign_citation":"https://pith.science/pith/YLKQKRSSI4P2I4GUENEU7QNO3S/action/citation_signature","submit_replication":"https://pith.science/pith/YLKQKRSSI4P2I4GUENEU7QNO3S/action/replication_record"}},"created_at":"2026-07-05T08:10:44.217008+00:00","updated_at":"2026-07-05T08:10:44.217008+00:00"}