{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:PFGDKEKFNZNUBYXOTMDPHRUEL3","short_pith_number":"pith:PFGDKEKF","schema_version":"1.0","canonical_sha256":"794c3511456e5b40e2ee9b06f3c6845ee6756d30fa7414f6e78dc602d2d0a687","source":{"kind":"arxiv","id":"1111.0253","version":2},"attestation_state":"computed","paper":{"title":"Nearly Complete Graphs Decomposable into Large Induced Matchings and their Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Ankur Moitra, Benny Sudakov, Noga Alon","submitted_at":"2011-11-01T17:38:12Z","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 "},"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":"1111.0253","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-01T17:38:12Z","cross_cats_sorted":["cs.DS","cs.IT","math.IT"],"title_canon_sha256":"fb13db04bac57a3d49837bb5fe174640ffa5e66467ca4312b360209c708eb581","abstract_canon_sha256":"6034eeb1274a89e2d285682305af4f768eeb4b1109e6e6bebf3ec22f7cb55bdb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:24.956387Z","signature_b64":"jTl0ekN4JEnUl1E8cNNQxnX+DJjTDab7vshfpxW9SBzk1K9ul4Xl5x4JJEnyCSLrJ53xaLusxxTk2INkUMl0DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"794c3511456e5b40e2ee9b06f3c6845ee6756d30fa7414f6e78dc602d2d0a687","last_reissued_at":"2026-05-18T04:09:24.955788Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:24.955788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nearly Complete Graphs Decomposable into Large Induced Matchings and their Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Ankur Moitra, Benny Sudakov, Noga Alon","submitted_at":"2011-11-01T17:38:12Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.0253","kind":"arxiv","version":2},"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":"1111.0253","created_at":"2026-05-18T04:09:24.955867+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.0253v2","created_at":"2026-05-18T04:09:24.955867+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0253","created_at":"2026-05-18T04:09:24.955867+00:00"},{"alias_kind":"pith_short_12","alias_value":"PFGDKEKFNZNU","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"PFGDKEKFNZNUBYXO","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"PFGDKEKF","created_at":"2026-05-18T12:26:39.201973+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/PFGDKEKFNZNUBYXOTMDPHRUEL3","json":"https://pith.science/pith/PFGDKEKFNZNUBYXOTMDPHRUEL3.json","graph_json":"https://pith.science/api/pith-number/PFGDKEKFNZNUBYXOTMDPHRUEL3/graph.json","events_json":"https://pith.science/api/pith-number/PFGDKEKFNZNUBYXOTMDPHRUEL3/events.json","paper":"https://pith.science/paper/PFGDKEKF"},"agent_actions":{"view_html":"https://pith.science/pith/PFGDKEKFNZNUBYXOTMDPHRUEL3","download_json":"https://pith.science/pith/PFGDKEKFNZNUBYXOTMDPHRUEL3.json","view_paper":"https://pith.science/paper/PFGDKEKF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.0253&json=true","fetch_graph":"https://pith.science/api/pith-number/PFGDKEKFNZNUBYXOTMDPHRUEL3/graph.json","fetch_events":"https://pith.science/api/pith-number/PFGDKEKFNZNUBYXOTMDPHRUEL3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PFGDKEKFNZNUBYXOTMDPHRUEL3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PFGDKEKFNZNUBYXOTMDPHRUEL3/action/storage_attestation","attest_author":"https://pith.science/pith/PFGDKEKFNZNUBYXOTMDPHRUEL3/action/author_attestation","sign_citation":"https://pith.science/pith/PFGDKEKFNZNUBYXOTMDPHRUEL3/action/citation_signature","submit_replication":"https://pith.science/pith/PFGDKEKFNZNUBYXOTMDPHRUEL3/action/replication_record"}},"created_at":"2026-05-18T04:09:24.955867+00:00","updated_at":"2026-05-18T04:09:24.955867+00:00"}