{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:4HZ3T33TS7PBVLMCYCPYZLZBUF","short_pith_number":"pith:4HZ3T33T","canonical_record":{"source":{"id":"2312.16926","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2023-12-28T09:50:56Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"59dd009c56394c6d4bf8c7f1a9312f0e2427c4d92eee2e9ee6114766760da952","abstract_canon_sha256":"17b7fa9c81c789253cf158cc2de0c394e857d111cbb884f56cabe0f5b59ea3c7"},"schema_version":"1.0"},"canonical_sha256":"e1f3b9ef7397de1aad82c09f8caf21a17ada3554a53188ae8cdf034e54db20b4","source":{"kind":"arxiv","id":"2312.16926","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.16926","created_at":"2026-07-05T07:28:37Z"},{"alias_kind":"arxiv_version","alias_value":"2312.16926v1","created_at":"2026-07-05T07:28:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.16926","created_at":"2026-07-05T07:28:37Z"},{"alias_kind":"pith_short_12","alias_value":"4HZ3T33TS7PB","created_at":"2026-07-05T07:28:37Z"},{"alias_kind":"pith_short_16","alias_value":"4HZ3T33TS7PBVLMC","created_at":"2026-07-05T07:28:37Z"},{"alias_kind":"pith_short_8","alias_value":"4HZ3T33T","created_at":"2026-07-05T07:28:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:4HZ3T33TS7PBVLMCYCPYZLZBUF","target":"record","payload":{"canonical_record":{"source":{"id":"2312.16926","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2023-12-28T09:50:56Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"59dd009c56394c6d4bf8c7f1a9312f0e2427c4d92eee2e9ee6114766760da952","abstract_canon_sha256":"17b7fa9c81c789253cf158cc2de0c394e857d111cbb884f56cabe0f5b59ea3c7"},"schema_version":"1.0"},"canonical_sha256":"e1f3b9ef7397de1aad82c09f8caf21a17ada3554a53188ae8cdf034e54db20b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:28:37.108832Z","signature_b64":"+DHKeMgNlPOLxvQ67ALCJUbXw3nGI4gN8+y4Z3D4u9+defm+72Zfxrof49u9hT+9xiuqTnoQG8DSlmTz4ydZCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1f3b9ef7397de1aad82c09f8caf21a17ada3554a53188ae8cdf034e54db20b4","last_reissued_at":"2026-07-05T07:28:37.108281Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:28:37.108281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2312.16926","source_version":1,"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-05T07:28:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DE3jgZzWaaU4NkJFXrgMFJpaKZEMijFGq8MnEIGqF0ISV/hJy5d9uKU/O3ANY5o5OwbCBD8z5qFrOWpgNm1kDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T06:33:46.415826Z"},"content_sha256":"9ce9193afd440b8767575f87beaecc834eec2c923502a51e8520747ba16b65f3","schema_version":"1.0","event_id":"sha256:9ce9193afd440b8767575f87beaecc834eec2c923502a51e8520747ba16b65f3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:4HZ3T33TS7PBVLMCYCPYZLZBUF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient High-Quality Clustering for Large Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"Jieming Shi, Renchi Yang","submitted_at":"2023-12-28T09:50:56Z","abstract_excerpt":"A bipartite graph contains inter-set edges between two disjoint vertex sets, and is widely used to model real-world data, such as user-item purchase records, author-article publications, and biological interactions between drugs and proteins. k-Bipartite Graph Clustering (k-BGC) is to partition the target vertex set in a bipartite graph into k disjoint clusters. The clustering quality is important to the utility of k-BGC in various applications like social network analysis, recommendation systems, text mining, and bioinformatics, to name a few. Existing approaches to k-BGC either output cluste"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.16926","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/2312.16926/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-05T07:28:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dxLDpFlzfoNf6JD/zCyDB6OrKrjNaK/Uv1GioGNvtd4OJ7mbJwDefPLnPEV0pB2kwvRv4a+Q/+3PcORUkB9GBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T06:33:46.416340Z"},"content_sha256":"4a42d2fe5cc6a318e67e644c2a4f17f8411b26bdb6ddf253381cf758a6ab6d0a","schema_version":"1.0","event_id":"sha256:4a42d2fe5cc6a318e67e644c2a4f17f8411b26bdb6ddf253381cf758a6ab6d0a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4HZ3T33TS7PBVLMCYCPYZLZBUF/bundle.json","state_url":"https://pith.science/pith/4HZ3T33TS7PBVLMCYCPYZLZBUF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4HZ3T33TS7PBVLMCYCPYZLZBUF/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-11T06:33:46Z","links":{"resolver":"https://pith.science/pith/4HZ3T33TS7PBVLMCYCPYZLZBUF","bundle":"https://pith.science/pith/4HZ3T33TS7PBVLMCYCPYZLZBUF/bundle.json","state":"https://pith.science/pith/4HZ3T33TS7PBVLMCYCPYZLZBUF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4HZ3T33TS7PBVLMCYCPYZLZBUF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:4HZ3T33TS7PBVLMCYCPYZLZBUF","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":"17b7fa9c81c789253cf158cc2de0c394e857d111cbb884f56cabe0f5b59ea3c7","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2023-12-28T09:50:56Z","title_canon_sha256":"59dd009c56394c6d4bf8c7f1a9312f0e2427c4d92eee2e9ee6114766760da952"},"schema_version":"1.0","source":{"id":"2312.16926","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.16926","created_at":"2026-07-05T07:28:37Z"},{"alias_kind":"arxiv_version","alias_value":"2312.16926v1","created_at":"2026-07-05T07:28:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.16926","created_at":"2026-07-05T07:28:37Z"},{"alias_kind":"pith_short_12","alias_value":"4HZ3T33TS7PB","created_at":"2026-07-05T07:28:37Z"},{"alias_kind":"pith_short_16","alias_value":"4HZ3T33TS7PBVLMC","created_at":"2026-07-05T07:28:37Z"},{"alias_kind":"pith_short_8","alias_value":"4HZ3T33T","created_at":"2026-07-05T07:28:37Z"}],"graph_snapshots":[{"event_id":"sha256:4a42d2fe5cc6a318e67e644c2a4f17f8411b26bdb6ddf253381cf758a6ab6d0a","target":"graph","created_at":"2026-07-05T07:28:37Z","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/2312.16926/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A bipartite graph contains inter-set edges between two disjoint vertex sets, and is widely used to model real-world data, such as user-item purchase records, author-article publications, and biological interactions between drugs and proteins. k-Bipartite Graph Clustering (k-BGC) is to partition the target vertex set in a bipartite graph into k disjoint clusters. The clustering quality is important to the utility of k-BGC in various applications like social network analysis, recommendation systems, text mining, and bioinformatics, to name a few. Existing approaches to k-BGC either output cluste","authors_text":"Jieming Shi, Renchi Yang","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2023-12-28T09:50:56Z","title":"Efficient High-Quality Clustering for Large Bipartite Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.16926","kind":"arxiv","version":1},"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:9ce9193afd440b8767575f87beaecc834eec2c923502a51e8520747ba16b65f3","target":"record","created_at":"2026-07-05T07:28:37Z","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":"17b7fa9c81c789253cf158cc2de0c394e857d111cbb884f56cabe0f5b59ea3c7","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2023-12-28T09:50:56Z","title_canon_sha256":"59dd009c56394c6d4bf8c7f1a9312f0e2427c4d92eee2e9ee6114766760da952"},"schema_version":"1.0","source":{"id":"2312.16926","kind":"arxiv","version":1}},"canonical_sha256":"e1f3b9ef7397de1aad82c09f8caf21a17ada3554a53188ae8cdf034e54db20b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1f3b9ef7397de1aad82c09f8caf21a17ada3554a53188ae8cdf034e54db20b4","first_computed_at":"2026-07-05T07:28:37.108281Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:28:37.108281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+DHKeMgNlPOLxvQ67ALCJUbXw3nGI4gN8+y4Z3D4u9+defm+72Zfxrof49u9hT+9xiuqTnoQG8DSlmTz4ydZCA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:28:37.108832Z","signed_message":"canonical_sha256_bytes"},"source_id":"2312.16926","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9ce9193afd440b8767575f87beaecc834eec2c923502a51e8520747ba16b65f3","sha256:4a42d2fe5cc6a318e67e644c2a4f17f8411b26bdb6ddf253381cf758a6ab6d0a"],"state_sha256":"95380159e0accff60821d722a29f60f2849c91c3c4ea48d7dea4b770d7df48df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rMP9jxMl+0PyqD1Dsgzqu7GrY6NZV8nfXxMFHAsj0mqAlAkCgyXT9foNz9i5hifGU3NKWddYXUGC7TJNkuRFBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T06:33:46.422440Z","bundle_sha256":"b9e6f6a4889b5a7b4d7c8f8ba0b1a42643c76b3b32d69af4bd1b95b533e106a4"}}