{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YUE7YFDNYXJQQF6P63Y5SGEIZW","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":"7087429e623fc808cc661dd0e90a6dd59e0cbea614fd3092b828f58f448189c1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-10-26T17:08:43Z","title_canon_sha256":"3013448bcbbbfe307f92e11504a41bd4a220df69b39769cb5b1ba23ee919e6c8"},"schema_version":"1.0","source":{"id":"1810.11421","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.11421","created_at":"2026-05-17T23:55:33Z"},{"alias_kind":"arxiv_version","alias_value":"1810.11421v2","created_at":"2026-05-17T23:55:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11421","created_at":"2026-05-17T23:55:33Z"},{"alias_kind":"pith_short_12","alias_value":"YUE7YFDNYXJQ","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YUE7YFDNYXJQQF6P","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YUE7YFDN","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:708deb268d7ec3d831c8530c5c4babf7218c74533844001fc0ffb37e8ebe966f","target":"graph","created_at":"2026-05-17T23:55:33Z","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"},"paper":{"abstract_excerpt":"Many common graph data mining tasks take the form of identifying dense subgraphs (e.g. clustering, clique-finding, etc). In biological applications, the natural model for these dense substructures is often a complete bipartite graph (biclique), and the problem requires enumerating all maximal bicliques (instead of just identifying the largest or densest). The best known algorithm in general graphs is due to Dias et al., and runs in time O(M |V|^4 ), where M is the number of maximal induced bicliques (MIBs) in the graph. When the graph being searched is itself bipartite, Zhang et al. give a fas","authors_text":"Andrew van der Poel, Blair D. Sullivan, Kyle Kloster","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-10-26T17:08:43Z","title":"Mining Maximal Induced Bicliques using Odd Cycle Transversals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11421","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:0261cc92d01891401735161eab996f13165627b47fc83009c7212257aef0c8fd","target":"record","created_at":"2026-05-17T23:55:33Z","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":"7087429e623fc808cc661dd0e90a6dd59e0cbea614fd3092b828f58f448189c1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-10-26T17:08:43Z","title_canon_sha256":"3013448bcbbbfe307f92e11504a41bd4a220df69b39769cb5b1ba23ee919e6c8"},"schema_version":"1.0","source":{"id":"1810.11421","kind":"arxiv","version":2}},"canonical_sha256":"c509fc146dc5d30817cff6f1d91888cd9e20e285764c8aaf1f12360b302c1955","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c509fc146dc5d30817cff6f1d91888cd9e20e285764c8aaf1f12360b302c1955","first_computed_at":"2026-05-17T23:55:33.972840Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:33.972840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+9wpEzvD42QzJ/ZyRfXLQFbB7xezzGqFsYZK4xqoVh3tPAMNM3nYXtIl5JPRI5XICA83wcDqPMukfi1yCL1YCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:33.973501Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.11421","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0261cc92d01891401735161eab996f13165627b47fc83009c7212257aef0c8fd","sha256:708deb268d7ec3d831c8530c5c4babf7218c74533844001fc0ffb37e8ebe966f"],"state_sha256":"72aa018935146914185a75230e8384917c4df9bdef970bc6cf01f0491996c971"}