{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:6RX2LO3BTHDWANWS4MWKTJTRGU","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":"8ec32dfcfcb68463c74a322ac88a51fcd7e78b49792e737a80a6827bac5f8ee1","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-05T12:03:47Z","title_canon_sha256":"c1481f271ba5958d5739b4c9d87ad4288ba697c3bc7cff191c1339c34369f328"},"schema_version":"1.0","source":{"id":"2502.03105","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.03105","created_at":"2026-07-05T10:09:59Z"},{"alias_kind":"arxiv_version","alias_value":"2502.03105v1","created_at":"2026-07-05T10:09:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.03105","created_at":"2026-07-05T10:09:59Z"},{"alias_kind":"pith_short_12","alias_value":"6RX2LO3BTHDW","created_at":"2026-07-05T10:09:59Z"},{"alias_kind":"pith_short_16","alias_value":"6RX2LO3BTHDWANWS","created_at":"2026-07-05T10:09:59Z"},{"alias_kind":"pith_short_8","alias_value":"6RX2LO3B","created_at":"2026-07-05T10:09:59Z"}],"graph_snapshots":[{"event_id":"sha256:11b399933aff36bb136cf0587621aeb15c2e9528d8555f91b584faf31854d0b5","target":"graph","created_at":"2026-07-05T10:09:59Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2502.03105/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $\\mathcal F_1,\\ldots, \\mathcal F_s\\subset [n]^k$ be a collection of $s$ families. In this paper, we address the following question: for which sequences $f_1,\\ldots, f_s$ the conditions $|\\ff_i|>f_i$ imply that the families contain a rainbow matching, that is, there are pairwise disjoint $F_1\\in \\ff_1,\\ldots F_s\\in \\ff_s$? We call such sequences {\\em satisfying}. Kiselev and the first author verified the conjecture of Aharoni and Howard and showed that $f_1 = \\ldots = f_s=(s-1)n^{k-1}$ is satisfying for $s>470$. This is the best possible if the restriction is uniform over all families. Howe","authors_text":"Andrey Kupavskii, Elizaveta Popova","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-05T12:03:47Z","title":"Satisfying sequences for rainbow partite matchings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.03105","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:c2dcf52ddb32f75c335e2069f65d2b6c6f2ea1da665968a4cd35f78c227027a3","target":"record","created_at":"2026-07-05T10:09:59Z","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":"8ec32dfcfcb68463c74a322ac88a51fcd7e78b49792e737a80a6827bac5f8ee1","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-05T12:03:47Z","title_canon_sha256":"c1481f271ba5958d5739b4c9d87ad4288ba697c3bc7cff191c1339c34369f328"},"schema_version":"1.0","source":{"id":"2502.03105","kind":"arxiv","version":1}},"canonical_sha256":"f46fa5bb6199c76036d2e32ca9a6713518e51cb13f917ca64485a0deb7131f42","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f46fa5bb6199c76036d2e32ca9a6713518e51cb13f917ca64485a0deb7131f42","first_computed_at":"2026-07-05T10:09:59.834342Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:09:59.834342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ivzBZB8IvyLU0X/H4Z3LM3EcfkjsynJaD8LoPJ7GI5qI8yX6iTyXCMgeB22qRFV4cZrGA57SarbRWYt9T8q9DQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:09:59.834800Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.03105","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c2dcf52ddb32f75c335e2069f65d2b6c6f2ea1da665968a4cd35f78c227027a3","sha256:11b399933aff36bb136cf0587621aeb15c2e9528d8555f91b584faf31854d0b5"],"state_sha256":"294f975f52357569bfab6bebc5e6047d045edd9b7ff5f304bb27d77bde4d7d4d"}