{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:BDUVCFDXGFAYEIQ6Z33ZTYZSKF","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":"c45ee34200d8644611cd5a8753dc663a21f227e6f9db0ded3d228dd0ab94db8b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-22T13:20:25Z","title_canon_sha256":"5a5a802d54f79dc3d5373dfc25da41611f147d0deffa434b959f635a05d9ff02"},"schema_version":"1.0","source":{"id":"1409.6165","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.6165","created_at":"2026-05-18T02:42:13Z"},{"alias_kind":"arxiv_version","alias_value":"1409.6165v1","created_at":"2026-05-18T02:42:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.6165","created_at":"2026-05-18T02:42:13Z"},{"alias_kind":"pith_short_12","alias_value":"BDUVCFDXGFAY","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BDUVCFDXGFAYEIQ6","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BDUVCFDX","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:0caf316341f99b38be5fb5cbb6efa577e33151911abb5e06f6982e891bbf6e05","target":"graph","created_at":"2026-05-18T02:42:13Z","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":"For a graph $G=(V,E)$, let $bc(G)$ denote the minimum number of pairwise edge disjoint complete bipartite subgraphs of $G$ so that each edge of $G$ belongs to exactly one of them. It is easy to see that for every graph $G$, $bc(G) \\leq n -\\alpha(G)$, where $\\alpha(G)$ is the maximum size of an independent set of $G$. Erd\\H{o}s conjectured in the 80s that for almost every graph $G$ equality holds, i.e., that for the random graph $G(n,0.5)$, $bc(G)=n-\\alpha(G)$ with high probability, that is, with probability that tends to 1 as $n$ tends to infinity. The first author showed that this is slightly","authors_text":"Hao Huang, Noga Alon, Tom Bohman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-22T13:20:25Z","title":"More on the bipartite decomposition of random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.6165","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:272914f350c5d8c2989ecb9c65e35298c479cabc912f74badf6764afe14bcf8b","target":"record","created_at":"2026-05-18T02:42:13Z","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":"c45ee34200d8644611cd5a8753dc663a21f227e6f9db0ded3d228dd0ab94db8b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-22T13:20:25Z","title_canon_sha256":"5a5a802d54f79dc3d5373dfc25da41611f147d0deffa434b959f635a05d9ff02"},"schema_version":"1.0","source":{"id":"1409.6165","kind":"arxiv","version":1}},"canonical_sha256":"08e9511477314182221ecef799e332517964a4bcf742fb3968be680b416f4c74","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"08e9511477314182221ecef799e332517964a4bcf742fb3968be680b416f4c74","first_computed_at":"2026-05-18T02:42:13.689572Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:42:13.689572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qyLic0Go8b0D4COlhgYUHL7O2qcPY6EE617lzoeX4h2Tvt2WNJn52zODXjhf//P29fj8DvWnHtbPuKymP8NHAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:42:13.690090Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.6165","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:272914f350c5d8c2989ecb9c65e35298c479cabc912f74badf6764afe14bcf8b","sha256:0caf316341f99b38be5fb5cbb6efa577e33151911abb5e06f6982e891bbf6e05"],"state_sha256":"34872263ed0de581cf6f40a2650d1e53fa3868876fe1b28b441957bd81d2d251"}