{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:BDUVCFDXGFAYEIQ6Z33ZTYZSKF","short_pith_number":"pith:BDUVCFDX","schema_version":"1.0","canonical_sha256":"08e9511477314182221ecef799e332517964a4bcf742fb3968be680b416f4c74","source":{"kind":"arxiv","id":"1409.6165","version":1},"attestation_state":"computed","paper":{"title":"More on the bipartite decomposition of random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hao Huang, Noga Alon, Tom Bohman","submitted_at":"2014-09-22T13:20:25Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1409.6165","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-22T13:20:25Z","cross_cats_sorted":[],"title_canon_sha256":"5a5a802d54f79dc3d5373dfc25da41611f147d0deffa434b959f635a05d9ff02","abstract_canon_sha256":"c45ee34200d8644611cd5a8753dc663a21f227e6f9db0ded3d228dd0ab94db8b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:13.690090Z","signature_b64":"qyLic0Go8b0D4COlhgYUHL7O2qcPY6EE617lzoeX4h2Tvt2WNJn52zODXjhf//P29fj8DvWnHtbPuKymP8NHAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08e9511477314182221ecef799e332517964a4bcf742fb3968be680b416f4c74","last_reissued_at":"2026-05-18T02:42:13.689572Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:13.689572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"More on the bipartite decomposition of random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hao Huang, Noga Alon, Tom Bohman","submitted_at":"2014-09-22T13:20:25Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.6165","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":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1409.6165","created_at":"2026-05-18T02:42:13.689652+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.6165v1","created_at":"2026-05-18T02:42:13.689652+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.6165","created_at":"2026-05-18T02:42:13.689652+00:00"},{"alias_kind":"pith_short_12","alias_value":"BDUVCFDXGFAY","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"BDUVCFDXGFAYEIQ6","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"BDUVCFDX","created_at":"2026-05-18T12:28:22.404517+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BDUVCFDXGFAYEIQ6Z33ZTYZSKF","json":"https://pith.science/pith/BDUVCFDXGFAYEIQ6Z33ZTYZSKF.json","graph_json":"https://pith.science/api/pith-number/BDUVCFDXGFAYEIQ6Z33ZTYZSKF/graph.json","events_json":"https://pith.science/api/pith-number/BDUVCFDXGFAYEIQ6Z33ZTYZSKF/events.json","paper":"https://pith.science/paper/BDUVCFDX"},"agent_actions":{"view_html":"https://pith.science/pith/BDUVCFDXGFAYEIQ6Z33ZTYZSKF","download_json":"https://pith.science/pith/BDUVCFDXGFAYEIQ6Z33ZTYZSKF.json","view_paper":"https://pith.science/paper/BDUVCFDX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.6165&json=true","fetch_graph":"https://pith.science/api/pith-number/BDUVCFDXGFAYEIQ6Z33ZTYZSKF/graph.json","fetch_events":"https://pith.science/api/pith-number/BDUVCFDXGFAYEIQ6Z33ZTYZSKF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BDUVCFDXGFAYEIQ6Z33ZTYZSKF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BDUVCFDXGFAYEIQ6Z33ZTYZSKF/action/storage_attestation","attest_author":"https://pith.science/pith/BDUVCFDXGFAYEIQ6Z33ZTYZSKF/action/author_attestation","sign_citation":"https://pith.science/pith/BDUVCFDXGFAYEIQ6Z33ZTYZSKF/action/citation_signature","submit_replication":"https://pith.science/pith/BDUVCFDXGFAYEIQ6Z33ZTYZSKF/action/replication_record"}},"created_at":"2026-05-18T02:42:13.689652+00:00","updated_at":"2026-05-18T02:42:13.689652+00:00"}