{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:QMNXBWCPCUSZKDEZAEXISR5NRF","short_pith_number":"pith:QMNXBWCP","schema_version":"1.0","canonical_sha256":"831b70d84f1525950c99012e8947ad8949b7c7d60ccbdcda1ceb6fdaacef7fcd","source":{"kind":"arxiv","id":"2206.00006","version":2},"attestation_state":"computed","paper":{"title":"COIN: Co-Cluster Infomax for Bipartite Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Baoyu Jing, Hanghang Tong, Yada Zhu, Yuchen Yan","submitted_at":"2022-05-31T10:20:07Z","abstract_excerpt":"Bipartite graphs are powerful data structures to model interactions between two types of nodes, which have been used in a variety of applications, such as recommender systems, information retrieval, and drug discovery. A fundamental challenge for bipartite graphs is how to learn informative node embeddings. Despite the success of recent self-supervised learning methods on bipartite graphs, their objectives are discriminating instance-wise positive and negative node pairs, which could contain cluster-level errors. In this paper, we introduce a novel co-cluster infomax (COIN) framework, which ca"},"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":"2206.00006","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-05-31T10:20:07Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"9a6138799d2c5a85a7bbaaecb99a90b2eedcafdb79d8090a00d8b33ede30048e","abstract_canon_sha256":"d555224923362def6dbc5c89eca5ba2adad9a2b4116d69d54d5a3ca6ca0fc1de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:12:44.397568Z","signature_b64":"/2ajScZHMQxr7drgO9/6Ok3HNzCXKzvBTVDWnZtd2WUWDtcIMaY03hAQQJtFy8UL3WKmTv7UuDOD5Dv8k+I8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"831b70d84f1525950c99012e8947ad8949b7c7d60ccbdcda1ceb6fdaacef7fcd","last_reissued_at":"2026-07-05T05:12:44.397137Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:12:44.397137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"COIN: Co-Cluster Infomax for Bipartite Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Baoyu Jing, Hanghang Tong, Yada Zhu, Yuchen Yan","submitted_at":"2022-05-31T10:20:07Z","abstract_excerpt":"Bipartite graphs are powerful data structures to model interactions between two types of nodes, which have been used in a variety of applications, such as recommender systems, information retrieval, and drug discovery. A fundamental challenge for bipartite graphs is how to learn informative node embeddings. Despite the success of recent self-supervised learning methods on bipartite graphs, their objectives are discriminating instance-wise positive and negative node pairs, which could contain cluster-level errors. In this paper, we introduce a novel co-cluster infomax (COIN) framework, which ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.00006","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/2206.00006/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":"2206.00006","created_at":"2026-07-05T05:12:44.397193+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.00006v2","created_at":"2026-07-05T05:12:44.397193+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.00006","created_at":"2026-07-05T05:12:44.397193+00:00"},{"alias_kind":"pith_short_12","alias_value":"QMNXBWCPCUSZ","created_at":"2026-07-05T05:12:44.397193+00:00"},{"alias_kind":"pith_short_16","alias_value":"QMNXBWCPCUSZKDEZ","created_at":"2026-07-05T05:12:44.397193+00:00"},{"alias_kind":"pith_short_8","alias_value":"QMNXBWCP","created_at":"2026-07-05T05:12:44.397193+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.20858","citing_title":"Mixture of Sequence: Theme-Aware Mixture-of-Experts for Long-Sequence Recommendation","ref_index":47,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QMNXBWCPCUSZKDEZAEXISR5NRF","json":"https://pith.science/pith/QMNXBWCPCUSZKDEZAEXISR5NRF.json","graph_json":"https://pith.science/api/pith-number/QMNXBWCPCUSZKDEZAEXISR5NRF/graph.json","events_json":"https://pith.science/api/pith-number/QMNXBWCPCUSZKDEZAEXISR5NRF/events.json","paper":"https://pith.science/paper/QMNXBWCP"},"agent_actions":{"view_html":"https://pith.science/pith/QMNXBWCPCUSZKDEZAEXISR5NRF","download_json":"https://pith.science/pith/QMNXBWCPCUSZKDEZAEXISR5NRF.json","view_paper":"https://pith.science/paper/QMNXBWCP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.00006&json=true","fetch_graph":"https://pith.science/api/pith-number/QMNXBWCPCUSZKDEZAEXISR5NRF/graph.json","fetch_events":"https://pith.science/api/pith-number/QMNXBWCPCUSZKDEZAEXISR5NRF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QMNXBWCPCUSZKDEZAEXISR5NRF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QMNXBWCPCUSZKDEZAEXISR5NRF/action/storage_attestation","attest_author":"https://pith.science/pith/QMNXBWCPCUSZKDEZAEXISR5NRF/action/author_attestation","sign_citation":"https://pith.science/pith/QMNXBWCPCUSZKDEZAEXISR5NRF/action/citation_signature","submit_replication":"https://pith.science/pith/QMNXBWCPCUSZKDEZAEXISR5NRF/action/replication_record"}},"created_at":"2026-07-05T05:12:44.397193+00:00","updated_at":"2026-07-05T05:12:44.397193+00:00"}