{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:O2FZKPLUUGPIUL36VMTPNC56DO","short_pith_number":"pith:O2FZKPLU","schema_version":"1.0","canonical_sha256":"768b953d74a19e8a2f7eab26f68bbe1bb889090694d6a3050f58b2b88163c520","source":{"kind":"arxiv","id":"2505.05339","version":2},"attestation_state":"computed","paper":{"title":"A Counterexample to a Conjecture of Lov\\'asz","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander Clow, Bojan Mohar, Penny Haxell","submitted_at":"2025-05-08T15:28:47Z","abstract_excerpt":"In 1975 Lov\\'{a}sz conjectured that every $r$-partite, $r$-uniform hypergraph contains $r-1$ vertices whose deletion reduces the matching number. If true, this statement would imply a well-known conjecture of Ryser from 1971, which states that every $r$-partite, $r$-uniform hypergraph has a vertex cover of size at most $r-1$ times its matching number. When $r=2$, Ryser's conjecture is simply K\\H{o}nig's theorem, and the conjecture of Lov\\'asz is an immediate corollary. Ryser's conjecture for $r=3$ was proven by Aharoni in 2001, and remains open for all $r\\geq 4$.\n  Here we show that the conjec"},"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":"2505.05339","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-08T15:28:47Z","cross_cats_sorted":[],"title_canon_sha256":"383b9073695c62cbdf966b97a1421d1b46047d97fd8d7f62bcfa836e75ed78d2","abstract_canon_sha256":"778a1f397821565ff3a49558dcd933ed4664c874c778c7f865851dcfa8d67cd2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:19:26.836103Z","signature_b64":"TTYiGfLpfyNz7CXZrJiUrQouSfnqQDvRAWV27+lev6GO3pHd3KtJ9fr+aULmJyE59be4bYFfG9Eedlal2hk8DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"768b953d74a19e8a2f7eab26f68bbe1bb889090694d6a3050f58b2b88163c520","last_reissued_at":"2026-07-05T11:19:26.835637Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:19:26.835637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Counterexample to a Conjecture of Lov\\'asz","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander Clow, Bojan Mohar, Penny Haxell","submitted_at":"2025-05-08T15:28:47Z","abstract_excerpt":"In 1975 Lov\\'{a}sz conjectured that every $r$-partite, $r$-uniform hypergraph contains $r-1$ vertices whose deletion reduces the matching number. If true, this statement would imply a well-known conjecture of Ryser from 1971, which states that every $r$-partite, $r$-uniform hypergraph has a vertex cover of size at most $r-1$ times its matching number. When $r=2$, Ryser's conjecture is simply K\\H{o}nig's theorem, and the conjecture of Lov\\'asz is an immediate corollary. Ryser's conjecture for $r=3$ was proven by Aharoni in 2001, and remains open for all $r\\geq 4$.\n  Here we show that the conjec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.05339","kind":"arxiv","version":2},"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/2505.05339/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":"2505.05339","created_at":"2026-07-05T11:19:26.835688+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.05339v2","created_at":"2026-07-05T11:19:26.835688+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.05339","created_at":"2026-07-05T11:19:26.835688+00:00"},{"alias_kind":"pith_short_12","alias_value":"O2FZKPLUUGPI","created_at":"2026-07-05T11:19:26.835688+00:00"},{"alias_kind":"pith_short_16","alias_value":"O2FZKPLUUGPIUL36","created_at":"2026-07-05T11:19:26.835688+00:00"},{"alias_kind":"pith_short_8","alias_value":"O2FZKPLU","created_at":"2026-07-05T11:19:26.835688+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.21286","citing_title":"Infinitely many counterexamples to a conjecture of Lov\\'asz","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/O2FZKPLUUGPIUL36VMTPNC56DO","json":"https://pith.science/pith/O2FZKPLUUGPIUL36VMTPNC56DO.json","graph_json":"https://pith.science/api/pith-number/O2FZKPLUUGPIUL36VMTPNC56DO/graph.json","events_json":"https://pith.science/api/pith-number/O2FZKPLUUGPIUL36VMTPNC56DO/events.json","paper":"https://pith.science/paper/O2FZKPLU"},"agent_actions":{"view_html":"https://pith.science/pith/O2FZKPLUUGPIUL36VMTPNC56DO","download_json":"https://pith.science/pith/O2FZKPLUUGPIUL36VMTPNC56DO.json","view_paper":"https://pith.science/paper/O2FZKPLU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.05339&json=true","fetch_graph":"https://pith.science/api/pith-number/O2FZKPLUUGPIUL36VMTPNC56DO/graph.json","fetch_events":"https://pith.science/api/pith-number/O2FZKPLUUGPIUL36VMTPNC56DO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O2FZKPLUUGPIUL36VMTPNC56DO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O2FZKPLUUGPIUL36VMTPNC56DO/action/storage_attestation","attest_author":"https://pith.science/pith/O2FZKPLUUGPIUL36VMTPNC56DO/action/author_attestation","sign_citation":"https://pith.science/pith/O2FZKPLUUGPIUL36VMTPNC56DO/action/citation_signature","submit_replication":"https://pith.science/pith/O2FZKPLUUGPIUL36VMTPNC56DO/action/replication_record"}},"created_at":"2026-07-05T11:19:26.835688+00:00","updated_at":"2026-07-05T11:19:26.835688+00:00"}