{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:62XNVNLA22BNNRZQSYZNQVTKPV","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":"5c25897c242c2f3a247000b43af11583bb4368de49484c7782a57cc1fa7babc6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-04T20:54:27Z","title_canon_sha256":"d283391b279aab29127b6ada1b9a47e83c90e4b87714d84d48061269f4923269"},"schema_version":"1.0","source":{"id":"1402.0860","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.0860","created_at":"2026-05-18T01:25:55Z"},{"alias_kind":"arxiv_version","alias_value":"1402.0860v3","created_at":"2026-05-18T01:25:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0860","created_at":"2026-05-18T01:25:55Z"},{"alias_kind":"pith_short_12","alias_value":"62XNVNLA22BN","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"62XNVNLA22BNNRZQ","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"62XNVNLA","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:e89a9d754a5f537e4cb3fd587ff2bbcddd792d1414c4077c0767128c024024a9","target":"graph","created_at":"2026-05-18T01:25:55Z","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":"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$.","authors_text":"Fan Chung, Xing Peng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-04T20:54:27Z","title":"Decomposition of random graphs into complete bipartite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.0860","kind":"arxiv","version":3},"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:5f701da76e374b1c5aed4c2455fed189b2d89a08d821792ceec1173d30ac74ea","target":"record","created_at":"2026-05-18T01:25:55Z","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":"5c25897c242c2f3a247000b43af11583bb4368de49484c7782a57cc1fa7babc6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-04T20:54:27Z","title_canon_sha256":"d283391b279aab29127b6ada1b9a47e83c90e4b87714d84d48061269f4923269"},"schema_version":"1.0","source":{"id":"1402.0860","kind":"arxiv","version":3}},"canonical_sha256":"f6aedab560d682d6c7309632d8566a7d6bb9f88d1cb47ce193c187e7cfdfba0e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6aedab560d682d6c7309632d8566a7d6bb9f88d1cb47ce193c187e7cfdfba0e","first_computed_at":"2026-05-18T01:25:55.883821Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:55.883821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"84mwC6EX2A+4Is/Wl7uAhOcxoaPgkoTvcjnkPNWpD+NuYIN674HozlDoQfCKKbFI11+B+UaETNec8uw+1z9UDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:55.884444Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.0860","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f701da76e374b1c5aed4c2455fed189b2d89a08d821792ceec1173d30ac74ea","sha256:e89a9d754a5f537e4cb3fd587ff2bbcddd792d1414c4077c0767128c024024a9"],"state_sha256":"1107ac507eddd931300eb53f6ccf08b19f8279a0cabe7a1abb1d189ab6b3d090"}