{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:II4AERI5HZ44CZTRZHPIWCYR24","short_pith_number":"pith:II4AERI5","schema_version":"1.0","canonical_sha256":"423802451d3e79c16671c9de8b0b11d70a62a912a47d83e4a1f4c1e03a1717ab","source":{"kind":"arxiv","id":"2009.07239","version":3},"attestation_state":"computed","paper":{"title":"Generalizations and strengthenings of Ryser's conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Grace McCourt, Hannah Sheats, Louis DeBiasio, Yigal Kamel","submitted_at":"2020-09-15T17:24:54Z","abstract_excerpt":"Ryser's conjecture says that for every $r$-partite hypergraph $H$ with matching number $\\nu(H)$, the vertex cover number is at most $(r-1)\\nu(H)$. This far reaching generalization of K\\\"onig's theorem is only known to be true for $r\\leq 3$, or $\\nu(G)=1$ and $r\\leq 5$. An equivalent formulation of Ryser's conjecture is that in every $r$-edge coloring of a graph $G$ with independence number $\\alpha(G)$, there exists at most $(r-1)\\alpha(G)$ monochromatic connected subgraphs which cover the vertex set of $G$.\n  We make the case that this latter formulation of Ryser's conjecture naturally leads t"},"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":"2009.07239","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-09-15T17:24:54Z","cross_cats_sorted":[],"title_canon_sha256":"cff0a5c70291726c4c7de8713bdaa4c9d0075abf954f3ad3ccb70585760cfda5","abstract_canon_sha256":"e7ac83b42240bffebad7d75e963b8990f89a820d816e9a2561ee49a234c29fef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:28:50.567571Z","signature_b64":"SfWVRLdL7MGGMI1AvzZzYTBcAKAYVMWkmJ62fKVTbms9nh7/2Nk5pJ+o43wM6laYE3CRvGW2l+Eiar5+I4yPBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"423802451d3e79c16671c9de8b0b11d70a62a912a47d83e4a1f4c1e03a1717ab","last_reissued_at":"2026-07-05T03:28:50.567088Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:28:50.567088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalizations and strengthenings of Ryser's conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Grace McCourt, Hannah Sheats, Louis DeBiasio, Yigal Kamel","submitted_at":"2020-09-15T17:24:54Z","abstract_excerpt":"Ryser's conjecture says that for every $r$-partite hypergraph $H$ with matching number $\\nu(H)$, the vertex cover number is at most $(r-1)\\nu(H)$. This far reaching generalization of K\\\"onig's theorem is only known to be true for $r\\leq 3$, or $\\nu(G)=1$ and $r\\leq 5$. An equivalent formulation of Ryser's conjecture is that in every $r$-edge coloring of a graph $G$ with independence number $\\alpha(G)$, there exists at most $(r-1)\\alpha(G)$ monochromatic connected subgraphs which cover the vertex set of $G$.\n  We make the case that this latter formulation of Ryser's conjecture naturally leads t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.07239","kind":"arxiv","version":3},"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/2009.07239/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":"2009.07239","created_at":"2026-07-05T03:28:50.567141+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.07239v3","created_at":"2026-07-05T03:28:50.567141+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.07239","created_at":"2026-07-05T03:28:50.567141+00:00"},{"alias_kind":"pith_short_12","alias_value":"II4AERI5HZ44","created_at":"2026-07-05T03:28:50.567141+00:00"},{"alias_kind":"pith_short_16","alias_value":"II4AERI5HZ44CZTR","created_at":"2026-07-05T03:28:50.567141+00:00"},{"alias_kind":"pith_short_8","alias_value":"II4AERI5","created_at":"2026-07-05T03:28:50.567141+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/II4AERI5HZ44CZTRZHPIWCYR24","json":"https://pith.science/pith/II4AERI5HZ44CZTRZHPIWCYR24.json","graph_json":"https://pith.science/api/pith-number/II4AERI5HZ44CZTRZHPIWCYR24/graph.json","events_json":"https://pith.science/api/pith-number/II4AERI5HZ44CZTRZHPIWCYR24/events.json","paper":"https://pith.science/paper/II4AERI5"},"agent_actions":{"view_html":"https://pith.science/pith/II4AERI5HZ44CZTRZHPIWCYR24","download_json":"https://pith.science/pith/II4AERI5HZ44CZTRZHPIWCYR24.json","view_paper":"https://pith.science/paper/II4AERI5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.07239&json=true","fetch_graph":"https://pith.science/api/pith-number/II4AERI5HZ44CZTRZHPIWCYR24/graph.json","fetch_events":"https://pith.science/api/pith-number/II4AERI5HZ44CZTRZHPIWCYR24/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/II4AERI5HZ44CZTRZHPIWCYR24/action/timestamp_anchor","attest_storage":"https://pith.science/pith/II4AERI5HZ44CZTRZHPIWCYR24/action/storage_attestation","attest_author":"https://pith.science/pith/II4AERI5HZ44CZTRZHPIWCYR24/action/author_attestation","sign_citation":"https://pith.science/pith/II4AERI5HZ44CZTRZHPIWCYR24/action/citation_signature","submit_replication":"https://pith.science/pith/II4AERI5HZ44CZTRZHPIWCYR24/action/replication_record"}},"created_at":"2026-07-05T03:28:50.567141+00:00","updated_at":"2026-07-05T03:28:50.567141+00:00"}