{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:62XNVNLA22BNNRZQSYZNQVTKPV","short_pith_number":"pith:62XNVNLA","schema_version":"1.0","canonical_sha256":"f6aedab560d682d6c7309632d8566a7d6bb9f88d1cb47ce193c187e7cfdfba0e","source":{"kind":"arxiv","id":"1402.0860","version":3},"attestation_state":"computed","paper":{"title":"Decomposition of random graphs into complete bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fan Chung, Xing Peng","submitted_at":"2014-02-04T20:54:27Z","abstract_excerpt":"We consider the problem of partitioning the edge set of a graph $G$ into the minimum number $\\tau(G)$ of edge-disjoint complete bipartite subgraphs. We show that for a random graph $G$ in $G(n,p)$, for $p$ is a constant no greater than $1/2$, almost surely $\\tau(G)$ is between $n- c(\\ln_{1/p} n)^{3+\\epsilon}$ and $n - 2\\ln_{1/(1-p)} n$ for any positive constants $c$ and $\\epsilon$."},"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":"1402.0860","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-04T20:54:27Z","cross_cats_sorted":[],"title_canon_sha256":"d283391b279aab29127b6ada1b9a47e83c90e4b87714d84d48061269f4923269","abstract_canon_sha256":"5c25897c242c2f3a247000b43af11583bb4368de49484c7782a57cc1fa7babc6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:55.884444Z","signature_b64":"84mwC6EX2A+4Is/Wl7uAhOcxoaPgkoTvcjnkPNWpD+NuYIN674HozlDoQfCKKbFI11+B+UaETNec8uw+1z9UDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6aedab560d682d6c7309632d8566a7d6bb9f88d1cb47ce193c187e7cfdfba0e","last_reissued_at":"2026-05-18T01:25:55.883821Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:55.883821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decomposition of random graphs into complete bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fan Chung, Xing Peng","submitted_at":"2014-02-04T20:54:27Z","abstract_excerpt":"We consider the problem of partitioning the edge set of a graph $G$ into the minimum number $\\tau(G)$ of edge-disjoint complete bipartite subgraphs. We show that for a random graph $G$ in $G(n,p)$, for $p$ is a constant no greater than $1/2$, almost surely $\\tau(G)$ is between $n- c(\\ln_{1/p} n)^{3+\\epsilon}$ and $n - 2\\ln_{1/(1-p)} n$ for any positive constants $c$ and $\\epsilon$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.0860","kind":"arxiv","version":3},"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":"1402.0860","created_at":"2026-05-18T01:25:55.883927+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.0860v3","created_at":"2026-05-18T01:25:55.883927+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0860","created_at":"2026-05-18T01:25:55.883927+00:00"},{"alias_kind":"pith_short_12","alias_value":"62XNVNLA22BN","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"62XNVNLA22BNNRZQ","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"62XNVNLA","created_at":"2026-05-18T12:28:16.859392+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/62XNVNLA22BNNRZQSYZNQVTKPV","json":"https://pith.science/pith/62XNVNLA22BNNRZQSYZNQVTKPV.json","graph_json":"https://pith.science/api/pith-number/62XNVNLA22BNNRZQSYZNQVTKPV/graph.json","events_json":"https://pith.science/api/pith-number/62XNVNLA22BNNRZQSYZNQVTKPV/events.json","paper":"https://pith.science/paper/62XNVNLA"},"agent_actions":{"view_html":"https://pith.science/pith/62XNVNLA22BNNRZQSYZNQVTKPV","download_json":"https://pith.science/pith/62XNVNLA22BNNRZQSYZNQVTKPV.json","view_paper":"https://pith.science/paper/62XNVNLA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.0860&json=true","fetch_graph":"https://pith.science/api/pith-number/62XNVNLA22BNNRZQSYZNQVTKPV/graph.json","fetch_events":"https://pith.science/api/pith-number/62XNVNLA22BNNRZQSYZNQVTKPV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/62XNVNLA22BNNRZQSYZNQVTKPV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/62XNVNLA22BNNRZQSYZNQVTKPV/action/storage_attestation","attest_author":"https://pith.science/pith/62XNVNLA22BNNRZQSYZNQVTKPV/action/author_attestation","sign_citation":"https://pith.science/pith/62XNVNLA22BNNRZQSYZNQVTKPV/action/citation_signature","submit_replication":"https://pith.science/pith/62XNVNLA22BNNRZQSYZNQVTKPV/action/replication_record"}},"created_at":"2026-05-18T01:25:55.883927+00:00","updated_at":"2026-05-18T01:25:55.883927+00:00"}