{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:FJ4DUVBYO6CILTHFHE2WCVSWS5","short_pith_number":"pith:FJ4DUVBY","schema_version":"1.0","canonical_sha256":"2a783a5438778485cce53935615656975e1e260a111f2e8e0d6e587a0f5a7324","source":{"kind":"arxiv","id":"2501.03216","version":1},"attestation_state":"computed","paper":{"title":"A note on improved bounds for hypergraph rainbow matching problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrea Freschi, Candida Bowtell, Gal Kronenberg, Jun Yan","submitted_at":"2025-01-06T18:54:53Z","abstract_excerpt":"A natural question, inspired by the famous Ryser-Brualdi-Stein Conjecture, is to determine the largest positive integer $g(r,n)$ such that every collection of $n$ matchings, each of size $n$, in an $r$-partite $r$-uniform hypergraph contains a rainbow matching of size $g(r,n)$. The parameter $g'(r,n)$ is defined identically with the exception that the host hypergraph is not required to be $r$-partite.\n  In this note, we improve the best known lower bounds on $g'(r,n)$ for all $r \\geq 4$ and the upper bounds on $g(r,n)$ for all $r \\geq 3$, provided $n$ is sufficiently large. More precisely, we "},"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":"2501.03216","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-06T18:54:53Z","cross_cats_sorted":[],"title_canon_sha256":"124ac64de9c6b2fd2817afed5ac132a4d70f323aaa60ffa2b72f84ddb5e1dcba","abstract_canon_sha256":"cedae73305033937ab338ab71f5c68cf1866c4f9b22f97bfe334045b474fe297"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:57:33.310373Z","signature_b64":"Dfo8xb4fQ8+fN5c2Be+THK+DXu8+Iit0n2AE6RMyZ1HlI0Unxd0A8FvIxqYxn/U8Qh4JkpJN4EV31ZzIKy/BBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a783a5438778485cce53935615656975e1e260a111f2e8e0d6e587a0f5a7324","last_reissued_at":"2026-07-05T09:57:33.309785Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:57:33.309785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on improved bounds for hypergraph rainbow matching problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrea Freschi, Candida Bowtell, Gal Kronenberg, Jun Yan","submitted_at":"2025-01-06T18:54:53Z","abstract_excerpt":"A natural question, inspired by the famous Ryser-Brualdi-Stein Conjecture, is to determine the largest positive integer $g(r,n)$ such that every collection of $n$ matchings, each of size $n$, in an $r$-partite $r$-uniform hypergraph contains a rainbow matching of size $g(r,n)$. The parameter $g'(r,n)$ is defined identically with the exception that the host hypergraph is not required to be $r$-partite.\n  In this note, we improve the best known lower bounds on $g'(r,n)$ for all $r \\geq 4$ and the upper bounds on $g(r,n)$ for all $r \\geq 3$, provided $n$ is sufficiently large. More precisely, we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.03216","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.03216/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2501.03216","created_at":"2026-07-05T09:57:33.309856+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.03216v1","created_at":"2026-07-05T09:57:33.309856+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.03216","created_at":"2026-07-05T09:57:33.309856+00:00"},{"alias_kind":"pith_short_12","alias_value":"FJ4DUVBYO6CI","created_at":"2026-07-05T09:57:33.309856+00:00"},{"alias_kind":"pith_short_16","alias_value":"FJ4DUVBYO6CILTHF","created_at":"2026-07-05T09:57:33.309856+00:00"},{"alias_kind":"pith_short_8","alias_value":"FJ4DUVBY","created_at":"2026-07-05T09:57:33.309856+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/FJ4DUVBYO6CILTHFHE2WCVSWS5","json":"https://pith.science/pith/FJ4DUVBYO6CILTHFHE2WCVSWS5.json","graph_json":"https://pith.science/api/pith-number/FJ4DUVBYO6CILTHFHE2WCVSWS5/graph.json","events_json":"https://pith.science/api/pith-number/FJ4DUVBYO6CILTHFHE2WCVSWS5/events.json","paper":"https://pith.science/paper/FJ4DUVBY"},"agent_actions":{"view_html":"https://pith.science/pith/FJ4DUVBYO6CILTHFHE2WCVSWS5","download_json":"https://pith.science/pith/FJ4DUVBYO6CILTHFHE2WCVSWS5.json","view_paper":"https://pith.science/paper/FJ4DUVBY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.03216&json=true","fetch_graph":"https://pith.science/api/pith-number/FJ4DUVBYO6CILTHFHE2WCVSWS5/graph.json","fetch_events":"https://pith.science/api/pith-number/FJ4DUVBYO6CILTHFHE2WCVSWS5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FJ4DUVBYO6CILTHFHE2WCVSWS5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FJ4DUVBYO6CILTHFHE2WCVSWS5/action/storage_attestation","attest_author":"https://pith.science/pith/FJ4DUVBYO6CILTHFHE2WCVSWS5/action/author_attestation","sign_citation":"https://pith.science/pith/FJ4DUVBYO6CILTHFHE2WCVSWS5/action/citation_signature","submit_replication":"https://pith.science/pith/FJ4DUVBYO6CILTHFHE2WCVSWS5/action/replication_record"}},"created_at":"2026-07-05T09:57:33.309856+00:00","updated_at":"2026-07-05T09:57:33.309856+00:00"}