{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:QMNXBWCPCUSZKDEZAEXISR5NRF","short_pith_number":"pith:QMNXBWCP","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"},"canonical_sha256":"831b70d84f1525950c99012e8947ad8949b7c7d60ccbdcda1ceb6fdaacef7fcd","source":{"kind":"arxiv","id":"2206.00006","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.00006","created_at":"2026-07-05T05:12:44Z"},{"alias_kind":"arxiv_version","alias_value":"2206.00006v2","created_at":"2026-07-05T05:12:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.00006","created_at":"2026-07-05T05:12:44Z"},{"alias_kind":"pith_short_12","alias_value":"QMNXBWCPCUSZ","created_at":"2026-07-05T05:12:44Z"},{"alias_kind":"pith_short_16","alias_value":"QMNXBWCPCUSZKDEZ","created_at":"2026-07-05T05:12:44Z"},{"alias_kind":"pith_short_8","alias_value":"QMNXBWCP","created_at":"2026-07-05T05:12:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:QMNXBWCPCUSZKDEZAEXISR5NRF","target":"record","payload":{"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"},"canonical_sha256":"831b70d84f1525950c99012e8947ad8949b7c7d60ccbdcda1ceb6fdaacef7fcd","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"},"source_kind":"arxiv","source_id":"2206.00006","source_version":2,"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-07-05T05:12:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AHMkGb3IMfOWEc42VMFJzXN0RR5g00P8lI8rqjraFK1C/kEGUSAX0eigWxR+t8ZiVpfEwq5S0kcHN+LRPIkfBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T02:38:09.725244Z"},"content_sha256":"47eb65cec936dddb237cc70a7ade1ac0bce69525b0572022938e7d297abdfdb1","schema_version":"1.0","event_id":"sha256:47eb65cec936dddb237cc70a7ade1ac0bce69525b0572022938e7d297abdfdb1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:QMNXBWCPCUSZKDEZAEXISR5NRF","target":"graph","payload":{"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"},"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-07-05T05:12:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cBSHpSJhr1wtyIZ5K0IjBKYy2rgaIrGpCyIQit/vcvlP1ozZGub1FKKGHA3DYgKMOSHCx1AD0VML8CkdOtB7BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T02:38:09.725868Z"},"content_sha256":"5099b965e8c44e90b73874290a8e0dfbfa8cb46887c5dd94ff320f2ca9d75ede","schema_version":"1.0","event_id":"sha256:5099b965e8c44e90b73874290a8e0dfbfa8cb46887c5dd94ff320f2ca9d75ede"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QMNXBWCPCUSZKDEZAEXISR5NRF/bundle.json","state_url":"https://pith.science/pith/QMNXBWCPCUSZKDEZAEXISR5NRF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QMNXBWCPCUSZKDEZAEXISR5NRF/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-08-14T02:38:09Z","links":{"resolver":"https://pith.science/pith/QMNXBWCPCUSZKDEZAEXISR5NRF","bundle":"https://pith.science/pith/QMNXBWCPCUSZKDEZAEXISR5NRF/bundle.json","state":"https://pith.science/pith/QMNXBWCPCUSZKDEZAEXISR5NRF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QMNXBWCPCUSZKDEZAEXISR5NRF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:QMNXBWCPCUSZKDEZAEXISR5NRF","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":"d555224923362def6dbc5c89eca5ba2adad9a2b4116d69d54d5a3ca6ca0fc1de","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-05-31T10:20:07Z","title_canon_sha256":"9a6138799d2c5a85a7bbaaecb99a90b2eedcafdb79d8090a00d8b33ede30048e"},"schema_version":"1.0","source":{"id":"2206.00006","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.00006","created_at":"2026-07-05T05:12:44Z"},{"alias_kind":"arxiv_version","alias_value":"2206.00006v2","created_at":"2026-07-05T05:12:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.00006","created_at":"2026-07-05T05:12:44Z"},{"alias_kind":"pith_short_12","alias_value":"QMNXBWCPCUSZ","created_at":"2026-07-05T05:12:44Z"},{"alias_kind":"pith_short_16","alias_value":"QMNXBWCPCUSZKDEZ","created_at":"2026-07-05T05:12:44Z"},{"alias_kind":"pith_short_8","alias_value":"QMNXBWCP","created_at":"2026-07-05T05:12:44Z"}],"graph_snapshots":[{"event_id":"sha256:5099b965e8c44e90b73874290a8e0dfbfa8cb46887c5dd94ff320f2ca9d75ede","target":"graph","created_at":"2026-07-05T05:12:44Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2206.00006/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Baoyu Jing, Hanghang Tong, Yada Zhu, Yuchen Yan","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-05-31T10:20:07Z","title":"COIN: Co-Cluster Infomax for Bipartite Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.00006","kind":"arxiv","version":2},"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:47eb65cec936dddb237cc70a7ade1ac0bce69525b0572022938e7d297abdfdb1","target":"record","created_at":"2026-07-05T05:12:44Z","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":"d555224923362def6dbc5c89eca5ba2adad9a2b4116d69d54d5a3ca6ca0fc1de","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-05-31T10:20:07Z","title_canon_sha256":"9a6138799d2c5a85a7bbaaecb99a90b2eedcafdb79d8090a00d8b33ede30048e"},"schema_version":"1.0","source":{"id":"2206.00006","kind":"arxiv","version":2}},"canonical_sha256":"831b70d84f1525950c99012e8947ad8949b7c7d60ccbdcda1ceb6fdaacef7fcd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"831b70d84f1525950c99012e8947ad8949b7c7d60ccbdcda1ceb6fdaacef7fcd","first_computed_at":"2026-07-05T05:12:44.397137Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:12:44.397137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/2ajScZHMQxr7drgO9/6Ok3HNzCXKzvBTVDWnZtd2WUWDtcIMaY03hAQQJtFy8UL3WKmTv7UuDOD5Dv8k+I8BQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:12:44.397568Z","signed_message":"canonical_sha256_bytes"},"source_id":"2206.00006","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:47eb65cec936dddb237cc70a7ade1ac0bce69525b0572022938e7d297abdfdb1","sha256:5099b965e8c44e90b73874290a8e0dfbfa8cb46887c5dd94ff320f2ca9d75ede"],"state_sha256":"a95217aa57ee784c6b99fdc6d820078ccccb6eaec356ef1bf06f0a9e4c8c3b5c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H/qLrUd4Pxc0LCvk1QADnYmZRCjrGhgKqdCOmuNKrTacUlFiV5+o7PQJIaxIRNRsXsfpxhUYuZJLaADGJt5iAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T02:38:09.731320Z","bundle_sha256":"fbe4c3b57c6ce6d0265a295a9cdc72c946b7cf37d6b20572b52dcc5b141e3e52"}}