{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:PFGDKEKFNZNUBYXOTMDPHRUEL3","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":"6034eeb1274a89e2d285682305af4f768eeb4b1109e6e6bebf3ec22f7cb55bdb","cross_cats_sorted":["cs.DS","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-01T17:38:12Z","title_canon_sha256":"fb13db04bac57a3d49837bb5fe174640ffa5e66467ca4312b360209c708eb581"},"schema_version":"1.0","source":{"id":"1111.0253","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.0253","created_at":"2026-05-18T04:09:24Z"},{"alias_kind":"arxiv_version","alias_value":"1111.0253v2","created_at":"2026-05-18T04:09:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0253","created_at":"2026-05-18T04:09:24Z"},{"alias_kind":"pith_short_12","alias_value":"PFGDKEKFNZNU","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PFGDKEKFNZNUBYXO","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PFGDKEKF","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:6f63d407e180fce42ee6daa8e2a6978eae9a3ae6cb3a078da8fb91158c18604f","target":"graph","created_at":"2026-05-18T04:09:24Z","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 describe two constructions of (very) dense graphs which are edge disjoint unions of large {\\em induced} matchings. The first construction exhibits graphs on $N$ vertices with ${N \\choose 2}-o(N^2)$ edges, which can be decomposed into pairwise disjoint induced matchings, each of size $N^{1-o(1)}$. The second construction provides a covering of all edges of the complete graph $K_N$ by two graphs, each being the edge disjoint union of at most $N^{2-\\delta}$ induced matchings, where $\\delta > 0.058$. This disproves (in a strong form) a conjecture of Meshulam, substantially improves a result of ","authors_text":"Ankur Moitra, Benny Sudakov, Noga Alon","cross_cats":["cs.DS","cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-01T17:38:12Z","title":"Nearly Complete Graphs Decomposable into Large Induced Matchings and their Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.0253","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:86d011a97e10b9ab0fd1ee6d097cc9b0b5db7f026b1a0caeea64ba95e00d05c8","target":"record","created_at":"2026-05-18T04:09:24Z","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":"6034eeb1274a89e2d285682305af4f768eeb4b1109e6e6bebf3ec22f7cb55bdb","cross_cats_sorted":["cs.DS","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-01T17:38:12Z","title_canon_sha256":"fb13db04bac57a3d49837bb5fe174640ffa5e66467ca4312b360209c708eb581"},"schema_version":"1.0","source":{"id":"1111.0253","kind":"arxiv","version":2}},"canonical_sha256":"794c3511456e5b40e2ee9b06f3c6845ee6756d30fa7414f6e78dc602d2d0a687","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"794c3511456e5b40e2ee9b06f3c6845ee6756d30fa7414f6e78dc602d2d0a687","first_computed_at":"2026-05-18T04:09:24.955788Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:09:24.955788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jTl0ekN4JEnUl1E8cNNQxnX+DJjTDab7vshfpxW9SBzk1K9ul4Xl5x4JJEnyCSLrJ53xaLusxxTk2INkUMl0DA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:09:24.956387Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.0253","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:86d011a97e10b9ab0fd1ee6d097cc9b0b5db7f026b1a0caeea64ba95e00d05c8","sha256:6f63d407e180fce42ee6daa8e2a6978eae9a3ae6cb3a078da8fb91158c18604f"],"state_sha256":"3b0a6a85440d61ab4310916069e178fc08edde839fe535fb13747e7afaa96499"}