{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MYABKTCAZ63PSQNWBQC5AAZJC4","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":"ca175df69c52794ca6c59755fcf987627289c0e9c82ca694d443be74b48ec937","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-05T19:27:36Z","title_canon_sha256":"8bd987750ce52c85b3710cb5ad516468a9aa69c55bc3f7a670a5c03894f716e9"},"schema_version":"1.0","source":{"id":"1601.00943","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.00943","created_at":"2026-05-18T00:50:09Z"},{"alias_kind":"arxiv_version","alias_value":"1601.00943v2","created_at":"2026-05-18T00:50:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.00943","created_at":"2026-05-18T00:50:09Z"},{"alias_kind":"pith_short_12","alias_value":"MYABKTCAZ63P","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MYABKTCAZ63PSQNW","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MYABKTCA","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:111142c9c736857c83a3f8d90c8d7e0a690ed5f645f2cfd2caf82eca8283ca93","target":"graph","created_at":"2026-05-18T00:50:09Z","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":"Let $f(n)$ be the smallest number such that every collection of $n$ matchings, each of size at least $f(n)$, in a bipartite graph, has a full rainbow matching. Generalizing famous conjectures of Ryser, Brualdi and Stein, Aharoni and Berger conjectured that $f(n)=n+1$ for every $n>1$. Clemens and Ehrenm{\\\"u}ller proved that $f(n) \\le \\frac{3}{2}n +o(n)$. We show that the $o(n)$ term can be reduced to a constant, namely $f(n) \\le \\lceil \\frac{3}{2}n \\rceil+1$.","authors_text":"Dani Kotlar, Ran Ziv, Ron Aharoni","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-05T19:27:36Z","title":"Representation of large matchings in bipartite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.00943","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:d5dfe93b715d3318656d7dee280aa1b837869454571bf756d761b00b010cdb1a","target":"record","created_at":"2026-05-18T00:50:09Z","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":"ca175df69c52794ca6c59755fcf987627289c0e9c82ca694d443be74b48ec937","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-05T19:27:36Z","title_canon_sha256":"8bd987750ce52c85b3710cb5ad516468a9aa69c55bc3f7a670a5c03894f716e9"},"schema_version":"1.0","source":{"id":"1601.00943","kind":"arxiv","version":2}},"canonical_sha256":"6600154c40cfb6f941b60c05d00329172d269f6e31a498b1c29a3f6a74d243a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6600154c40cfb6f941b60c05d00329172d269f6e31a498b1c29a3f6a74d243a4","first_computed_at":"2026-05-18T00:50:09.810950Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:09.810950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MP7Vwtihd92erbNg2Bk2Mr7/yKRoe4/LUvizmo2m4/rBSkVpv1WbRLzcqccJll0/TNtsXsFFdjVO7tr0kB/iAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:09.811480Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.00943","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d5dfe93b715d3318656d7dee280aa1b837869454571bf756d761b00b010cdb1a","sha256:111142c9c736857c83a3f8d90c8d7e0a690ed5f645f2cfd2caf82eca8283ca93"],"state_sha256":"c066e730f56927d24b703e6d5f89a0f2aaa1d6af16c908a3bbf5eac4906e1b56"}