{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:AUC4UKNKVF6AAZKKCJBIVU7OFH","short_pith_number":"pith:AUC4UKNK","schema_version":"1.0","canonical_sha256":"0505ca29aaa97c00654a12428ad3ee29fa4c4b3385352342069d2306b70cc87d","source":{"kind":"arxiv","id":"2011.02100","version":2},"attestation_state":"computed","paper":{"title":"Deoscillated Graph Collaborative Filtering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CY"],"primary_cat":"cs.IR","authors_text":"Fei Jiang, Jiawei Zhang, Lin Meng, Philip S. Yu, Zhiwei Liu","submitted_at":"2020-11-04T02:26:53Z","abstract_excerpt":"Collaborative Filtering (CF) signals are crucial for a Recommender System~(RS) model to learn user and item embeddings. High-order information can alleviate the cold-start issue of CF-based methods, which is modelled through propagating the information over the user-item bipartite graph. Recent Graph Neural Networks~(GNNs) propose to stack multiple aggregation layers to propagate high-order signals. However, the oscillation problem, varying locality of bipartite graph, and the fix propagation pattern spoil the ability of multi-layer structure to propagate information. The oscillation problem r"},"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":"2011.02100","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2020-11-04T02:26:53Z","cross_cats_sorted":["cs.CY"],"title_canon_sha256":"f4b94ab10a0d4feed246baed59f44e49bee584fbe4ab2733c69458532c5bafb4","abstract_canon_sha256":"df0b84361080a97d96d5013d097f5d674caa6e5f67e60dc7c3b238e6d22c3903"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:44:16.465537Z","signature_b64":"EKQeU/giugeaXSSKGowubi5b2uetWUilZiN745RZrRYFlqzBULB1e9ElOe/QtRyqcHyapZHv9gQrKGiV81f5Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0505ca29aaa97c00654a12428ad3ee29fa4c4b3385352342069d2306b70cc87d","last_reissued_at":"2026-07-05T02:44:16.465048Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:44:16.465048Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deoscillated Graph Collaborative Filtering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CY"],"primary_cat":"cs.IR","authors_text":"Fei Jiang, Jiawei Zhang, Lin Meng, Philip S. Yu, Zhiwei Liu","submitted_at":"2020-11-04T02:26:53Z","abstract_excerpt":"Collaborative Filtering (CF) signals are crucial for a Recommender System~(RS) model to learn user and item embeddings. High-order information can alleviate the cold-start issue of CF-based methods, which is modelled through propagating the information over the user-item bipartite graph. Recent Graph Neural Networks~(GNNs) propose to stack multiple aggregation layers to propagate high-order signals. However, the oscillation problem, varying locality of bipartite graph, and the fix propagation pattern spoil the ability of multi-layer structure to propagate information. The oscillation problem r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.02100","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.02100/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":"2011.02100","created_at":"2026-07-05T02:44:16.465108+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.02100v2","created_at":"2026-07-05T02:44:16.465108+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.02100","created_at":"2026-07-05T02:44:16.465108+00:00"},{"alias_kind":"pith_short_12","alias_value":"AUC4UKNKVF6A","created_at":"2026-07-05T02:44:16.465108+00:00"},{"alias_kind":"pith_short_16","alias_value":"AUC4UKNKVF6AAZKK","created_at":"2026-07-05T02:44:16.465108+00:00"},{"alias_kind":"pith_short_8","alias_value":"AUC4UKNK","created_at":"2026-07-05T02:44:16.465108+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.19028","citing_title":"Learning Posterior Predictive Distributions for Node Classification from Synthetic Graph Priors","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AUC4UKNKVF6AAZKKCJBIVU7OFH","json":"https://pith.science/pith/AUC4UKNKVF6AAZKKCJBIVU7OFH.json","graph_json":"https://pith.science/api/pith-number/AUC4UKNKVF6AAZKKCJBIVU7OFH/graph.json","events_json":"https://pith.science/api/pith-number/AUC4UKNKVF6AAZKKCJBIVU7OFH/events.json","paper":"https://pith.science/paper/AUC4UKNK"},"agent_actions":{"view_html":"https://pith.science/pith/AUC4UKNKVF6AAZKKCJBIVU7OFH","download_json":"https://pith.science/pith/AUC4UKNKVF6AAZKKCJBIVU7OFH.json","view_paper":"https://pith.science/paper/AUC4UKNK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.02100&json=true","fetch_graph":"https://pith.science/api/pith-number/AUC4UKNKVF6AAZKKCJBIVU7OFH/graph.json","fetch_events":"https://pith.science/api/pith-number/AUC4UKNKVF6AAZKKCJBIVU7OFH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AUC4UKNKVF6AAZKKCJBIVU7OFH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AUC4UKNKVF6AAZKKCJBIVU7OFH/action/storage_attestation","attest_author":"https://pith.science/pith/AUC4UKNKVF6AAZKKCJBIVU7OFH/action/author_attestation","sign_citation":"https://pith.science/pith/AUC4UKNKVF6AAZKKCJBIVU7OFH/action/citation_signature","submit_replication":"https://pith.science/pith/AUC4UKNKVF6AAZKKCJBIVU7OFH/action/replication_record"}},"created_at":"2026-07-05T02:44:16.465108+00:00","updated_at":"2026-07-05T02:44:16.465108+00:00"}