{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:PPK75B564JHVLY6GRD6334FPSZ","short_pith_number":"pith:PPK75B56","canonical_record":{"source":{"id":"2205.12104","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2022-05-24T14:29:57Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"c8cba189c7572c891db48d0509b41297c3d70c3aec24fd9db6d2fd2a6e00bfb9","abstract_canon_sha256":"ad8acb5868e19e35ba13b36eced324a5d477369242162b6630a1fadcc71ea5b0"},"schema_version":"1.0"},"canonical_sha256":"7bd5fe87bee24f55e3c688fdbdf0af9663472cf78f97c4fc67a4b163ea730e84","source":{"kind":"arxiv","id":"2205.12104","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.12104","created_at":"2026-07-05T05:45:28Z"},{"alias_kind":"arxiv_version","alias_value":"2205.12104v2","created_at":"2026-07-05T05:45:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.12104","created_at":"2026-07-05T05:45:28Z"},{"alias_kind":"pith_short_12","alias_value":"PPK75B564JHV","created_at":"2026-07-05T05:45:28Z"},{"alias_kind":"pith_short_16","alias_value":"PPK75B564JHVLY6G","created_at":"2026-07-05T05:45:28Z"},{"alias_kind":"pith_short_8","alias_value":"PPK75B56","created_at":"2026-07-05T05:45:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:PPK75B564JHVLY6GRD6334FPSZ","target":"record","payload":{"canonical_record":{"source":{"id":"2205.12104","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2022-05-24T14:29:57Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"c8cba189c7572c891db48d0509b41297c3d70c3aec24fd9db6d2fd2a6e00bfb9","abstract_canon_sha256":"ad8acb5868e19e35ba13b36eced324a5d477369242162b6630a1fadcc71ea5b0"},"schema_version":"1.0"},"canonical_sha256":"7bd5fe87bee24f55e3c688fdbdf0af9663472cf78f97c4fc67a4b163ea730e84","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:45:28.637782Z","signature_b64":"uA/SXx1W716dYth0UMOXo/5P46llJ1BrfbYff8Fo6e6SQy05+cnXT8A9yGZ5gezbMGhaDCF8hSTo9WzovnkPAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7bd5fe87bee24f55e3c688fdbdf0af9663472cf78f97c4fc67a4b163ea730e84","last_reissued_at":"2026-07-05T05:45:28.635033Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:45:28.635033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2205.12104","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:45:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KIxzQV/kGbNMbJmf75S1iFv9kXMczmKDrILCPAC8MzbBdXEQLbfaZUvBqzXMxH26rO1WJtEu+e1wP4r+IYgNCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:15:37.997039Z"},"content_sha256":"5fcd087e4384404276f54c1211654e3157d98b00972802317826def0f0532e53","schema_version":"1.0","event_id":"sha256:5fcd087e4384404276f54c1211654e3157d98b00972802317826def0f0532e53"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:PPK75B564JHVLY6GRD6334FPSZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimax Optimal Clustering of Bipartite Graphs with a Generalized Power Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Guillaume Braun, Hemant Tyagi","submitted_at":"2022-05-24T14:29:57Z","abstract_excerpt":"Clustering bipartite graphs is a fundamental task in network analysis. In the high-dimensional regime where the number of rows $n_1$ and the number of columns $n_2$ of the associated adjacency matrix are of different order, existing methods derived from the ones used for symmetric graphs can come with sub-optimal guarantees. Due to increasing number of applications for bipartite graphs in the high dimensional regime, it is of fundamental importance to design optimal algorithms for this setting. The recent work of Ndaoud et al. (2022) improves the existing upper-bound for the misclustering rate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.12104","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/2205.12104/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:45:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cYeiVef0Pb7iu9N6+uKsT4/gNYKUT6LP2Vmbz/U2kYed7l2WNO1Hgqds9lv7s5kPRPBsgfjej2IXDt6NFHIiBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:15:37.997459Z"},"content_sha256":"414c6c8ece0d199050f71c67950a23f6aa93aeb5bda0ce593df3c3a811179ac4","schema_version":"1.0","event_id":"sha256:414c6c8ece0d199050f71c67950a23f6aa93aeb5bda0ce593df3c3a811179ac4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PPK75B564JHVLY6GRD6334FPSZ/bundle.json","state_url":"https://pith.science/pith/PPK75B564JHVLY6GRD6334FPSZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PPK75B564JHVLY6GRD6334FPSZ/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-07-06T18:15:37Z","links":{"resolver":"https://pith.science/pith/PPK75B564JHVLY6GRD6334FPSZ","bundle":"https://pith.science/pith/PPK75B564JHVLY6GRD6334FPSZ/bundle.json","state":"https://pith.science/pith/PPK75B564JHVLY6GRD6334FPSZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PPK75B564JHVLY6GRD6334FPSZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:PPK75B564JHVLY6GRD6334FPSZ","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":"ad8acb5868e19e35ba13b36eced324a5d477369242162b6630a1fadcc71ea5b0","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2022-05-24T14:29:57Z","title_canon_sha256":"c8cba189c7572c891db48d0509b41297c3d70c3aec24fd9db6d2fd2a6e00bfb9"},"schema_version":"1.0","source":{"id":"2205.12104","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.12104","created_at":"2026-07-05T05:45:28Z"},{"alias_kind":"arxiv_version","alias_value":"2205.12104v2","created_at":"2026-07-05T05:45:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.12104","created_at":"2026-07-05T05:45:28Z"},{"alias_kind":"pith_short_12","alias_value":"PPK75B564JHV","created_at":"2026-07-05T05:45:28Z"},{"alias_kind":"pith_short_16","alias_value":"PPK75B564JHVLY6G","created_at":"2026-07-05T05:45:28Z"},{"alias_kind":"pith_short_8","alias_value":"PPK75B56","created_at":"2026-07-05T05:45:28Z"}],"graph_snapshots":[{"event_id":"sha256:414c6c8ece0d199050f71c67950a23f6aa93aeb5bda0ce593df3c3a811179ac4","target":"graph","created_at":"2026-07-05T05:45:28Z","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/2205.12104/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Clustering bipartite graphs is a fundamental task in network analysis. In the high-dimensional regime where the number of rows $n_1$ and the number of columns $n_2$ of the associated adjacency matrix are of different order, existing methods derived from the ones used for symmetric graphs can come with sub-optimal guarantees. Due to increasing number of applications for bipartite graphs in the high dimensional regime, it is of fundamental importance to design optimal algorithms for this setting. The recent work of Ndaoud et al. (2022) improves the existing upper-bound for the misclustering rate","authors_text":"Guillaume Braun, Hemant Tyagi","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2022-05-24T14:29:57Z","title":"Minimax Optimal Clustering of Bipartite Graphs with a Generalized Power Method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.12104","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:5fcd087e4384404276f54c1211654e3157d98b00972802317826def0f0532e53","target":"record","created_at":"2026-07-05T05:45:28Z","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":"ad8acb5868e19e35ba13b36eced324a5d477369242162b6630a1fadcc71ea5b0","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2022-05-24T14:29:57Z","title_canon_sha256":"c8cba189c7572c891db48d0509b41297c3d70c3aec24fd9db6d2fd2a6e00bfb9"},"schema_version":"1.0","source":{"id":"2205.12104","kind":"arxiv","version":2}},"canonical_sha256":"7bd5fe87bee24f55e3c688fdbdf0af9663472cf78f97c4fc67a4b163ea730e84","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7bd5fe87bee24f55e3c688fdbdf0af9663472cf78f97c4fc67a4b163ea730e84","first_computed_at":"2026-07-05T05:45:28.635033Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:45:28.635033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uA/SXx1W716dYth0UMOXo/5P46llJ1BrfbYff8Fo6e6SQy05+cnXT8A9yGZ5gezbMGhaDCF8hSTo9WzovnkPAw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:45:28.637782Z","signed_message":"canonical_sha256_bytes"},"source_id":"2205.12104","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5fcd087e4384404276f54c1211654e3157d98b00972802317826def0f0532e53","sha256:414c6c8ece0d199050f71c67950a23f6aa93aeb5bda0ce593df3c3a811179ac4"],"state_sha256":"e568d5023a0fb15cbf90e2dc4a54321eb182932e34f862b227bf7ffac5c4a429"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WKJ4isU4nNsWfXsO0IHQxo4Sq/R3bV4KUQZusNbjre843bc8xSb6tEGyUVPIJHJQ069bSoop26zW5wHldwKuBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T18:15:37.999543Z","bundle_sha256":"243bbe0c943024b698ef4bcdc335d3ca11dc9c416b8a65b4b75cf3ebbf9b540d"}}