{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:6FVUYKFDDUSJKKEYOS4QXTJXLT","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":"cf3578bb7b532f0a12087517a965d63ff1f8dac24ee3eaede3ad5ac71c8162e0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-24T16:27:55Z","title_canon_sha256":"fee5dea631cc5f997cea8f5f7dd400492ae0239b887d21004af5e76a72ff9d80"},"schema_version":"1.0","source":{"id":"1512.07852","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.07852","created_at":"2026-05-18T01:23:47Z"},{"alias_kind":"arxiv_version","alias_value":"1512.07852v1","created_at":"2026-05-18T01:23:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.07852","created_at":"2026-05-18T01:23:47Z"},{"alias_kind":"pith_short_12","alias_value":"6FVUYKFDDUSJ","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6FVUYKFDDUSJKKEY","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6FVUYKFD","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:2e4fac2b54291b34cb52dcf0725b27d6d404972c43d164a2d852cee65533c3d8","target":"graph","created_at":"2026-05-18T01:23:47Z","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 call a graph $G$ an $(r,t)$-Ruzsa-Szemer\\'edi graph if its edge set can be partitioned into $t$ edge-disjoint induced matchings, each of size $r$. These graphs were introduced in 1978 and has been extensively studied since then. In this paper, we consider the case when $r=cn$. For $c>1/4$, we determine the maximum possible $t$ which is a constant depending only on $c$. On the other hand, when $c=1/4$, there could be as many as $\\Omega(\\log n)$ induced matchings. We prove that this bound is tight up to a constant factor. Finally, when $c$ is fixed strictly between $1/5$ and $1/4$, we give a ","authors_text":"Benny Sudakov, Hao Huang, Jacob Fox","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-24T16:27:55Z","title":"On graphs decomposable into induced matchings of linear sizes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.07852","kind":"arxiv","version":1},"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:cb660da33a1e951b17f676b02d90a59f67297b3b2bee0c65942e41f60c519763","target":"record","created_at":"2026-05-18T01:23:47Z","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":"cf3578bb7b532f0a12087517a965d63ff1f8dac24ee3eaede3ad5ac71c8162e0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-24T16:27:55Z","title_canon_sha256":"fee5dea631cc5f997cea8f5f7dd400492ae0239b887d21004af5e76a72ff9d80"},"schema_version":"1.0","source":{"id":"1512.07852","kind":"arxiv","version":1}},"canonical_sha256":"f16b4c28a31d2495289874b90bcd375ceddad2781a0f879536eff2d359399a89","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f16b4c28a31d2495289874b90bcd375ceddad2781a0f879536eff2d359399a89","first_computed_at":"2026-05-18T01:23:47.647031Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:47.647031Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vUBPsHkO69E76z7lJzMWeQS+wsJrM6m1qTcN8a6Orz/6mUJ3kNEm5tHKA5qbYp4M3U34VYMe2oh3gbW5t/PzCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:47.647770Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.07852","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cb660da33a1e951b17f676b02d90a59f67297b3b2bee0c65942e41f60c519763","sha256:2e4fac2b54291b34cb52dcf0725b27d6d404972c43d164a2d852cee65533c3d8"],"state_sha256":"e5540cf90fd6d841b4281bfd56ef76b0ed294f86c8635f6b9e4791d711fcd637"}