{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:O2FZKPLUUGPIUL36VMTPNC56DO","short_pith_number":"pith:O2FZKPLU","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"},"canonical_sha256":"768b953d74a19e8a2f7eab26f68bbe1bb889090694d6a3050f58b2b88163c520","source":{"kind":"arxiv","id":"2505.05339","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.05339","created_at":"2026-07-05T11:19:26Z"},{"alias_kind":"arxiv_version","alias_value":"2505.05339v2","created_at":"2026-07-05T11:19:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.05339","created_at":"2026-07-05T11:19:26Z"},{"alias_kind":"pith_short_12","alias_value":"O2FZKPLUUGPI","created_at":"2026-07-05T11:19:26Z"},{"alias_kind":"pith_short_16","alias_value":"O2FZKPLUUGPIUL36","created_at":"2026-07-05T11:19:26Z"},{"alias_kind":"pith_short_8","alias_value":"O2FZKPLU","created_at":"2026-07-05T11:19:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:O2FZKPLUUGPIUL36VMTPNC56DO","target":"record","payload":{"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"},"canonical_sha256":"768b953d74a19e8a2f7eab26f68bbe1bb889090694d6a3050f58b2b88163c520","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"},"source_kind":"arxiv","source_id":"2505.05339","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:19:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DCQDFWQk8P0fq6RAvv3TFrrJrD3g+hzJzn6RT1H7ei6c+5PnUJVKLTMkXYVBRm3NqLWXYsKO4Z6V/8yW8u8nAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T22:56:03.670326Z"},"content_sha256":"0af9f2d550d3d09fb98778643406fd80cb877ae1276c3b7b3b38a1b7aa6408d2","schema_version":"1.0","event_id":"sha256:0af9f2d550d3d09fb98778643406fd80cb877ae1276c3b7b3b38a1b7aa6408d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:O2FZKPLUUGPIUL36VMTPNC56DO","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:19:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vuCEWwneDflYiAEb2lqnC+UKtFyX8vNIxz6ljsuU2xLPCZDDj0kbKzTKVUa5iBU4labYqt5yBLFbGfM/Bq4dAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T22:56:03.670872Z"},"content_sha256":"4586020246a7cb91d1e0a3b1abc7b2caf9b0c07305989169cb9062896f9bc386","schema_version":"1.0","event_id":"sha256:4586020246a7cb91d1e0a3b1abc7b2caf9b0c07305989169cb9062896f9bc386"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O2FZKPLUUGPIUL36VMTPNC56DO/bundle.json","state_url":"https://pith.science/pith/O2FZKPLUUGPIUL36VMTPNC56DO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O2FZKPLUUGPIUL36VMTPNC56DO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-09T22:56:03Z","links":{"resolver":"https://pith.science/pith/O2FZKPLUUGPIUL36VMTPNC56DO","bundle":"https://pith.science/pith/O2FZKPLUUGPIUL36VMTPNC56DO/bundle.json","state":"https://pith.science/pith/O2FZKPLUUGPIUL36VMTPNC56DO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O2FZKPLUUGPIUL36VMTPNC56DO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:O2FZKPLUUGPIUL36VMTPNC56DO","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":"778a1f397821565ff3a49558dcd933ed4664c874c778c7f865851dcfa8d67cd2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-08T15:28:47Z","title_canon_sha256":"383b9073695c62cbdf966b97a1421d1b46047d97fd8d7f62bcfa836e75ed78d2"},"schema_version":"1.0","source":{"id":"2505.05339","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.05339","created_at":"2026-07-05T11:19:26Z"},{"alias_kind":"arxiv_version","alias_value":"2505.05339v2","created_at":"2026-07-05T11:19:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.05339","created_at":"2026-07-05T11:19:26Z"},{"alias_kind":"pith_short_12","alias_value":"O2FZKPLUUGPI","created_at":"2026-07-05T11:19:26Z"},{"alias_kind":"pith_short_16","alias_value":"O2FZKPLUUGPIUL36","created_at":"2026-07-05T11:19:26Z"},{"alias_kind":"pith_short_8","alias_value":"O2FZKPLU","created_at":"2026-07-05T11:19:26Z"}],"graph_snapshots":[{"event_id":"sha256:4586020246a7cb91d1e0a3b1abc7b2caf9b0c07305989169cb9062896f9bc386","target":"graph","created_at":"2026-07-05T11:19:26Z","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/2505.05339/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Alexander Clow, Bojan Mohar, Penny Haxell","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-08T15:28:47Z","title":"A Counterexample to a Conjecture of Lov\\'asz"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.05339","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:0af9f2d550d3d09fb98778643406fd80cb877ae1276c3b7b3b38a1b7aa6408d2","target":"record","created_at":"2026-07-05T11:19:26Z","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":"778a1f397821565ff3a49558dcd933ed4664c874c778c7f865851dcfa8d67cd2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-08T15:28:47Z","title_canon_sha256":"383b9073695c62cbdf966b97a1421d1b46047d97fd8d7f62bcfa836e75ed78d2"},"schema_version":"1.0","source":{"id":"2505.05339","kind":"arxiv","version":2}},"canonical_sha256":"768b953d74a19e8a2f7eab26f68bbe1bb889090694d6a3050f58b2b88163c520","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"768b953d74a19e8a2f7eab26f68bbe1bb889090694d6a3050f58b2b88163c520","first_computed_at":"2026-07-05T11:19:26.835637Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:19:26.835637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TTYiGfLpfyNz7CXZrJiUrQouSfnqQDvRAWV27+lev6GO3pHd3KtJ9fr+aULmJyE59be4bYFfG9Eedlal2hk8DQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:19:26.836103Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.05339","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0af9f2d550d3d09fb98778643406fd80cb877ae1276c3b7b3b38a1b7aa6408d2","sha256:4586020246a7cb91d1e0a3b1abc7b2caf9b0c07305989169cb9062896f9bc386"],"state_sha256":"3ca33c74afac25bd4bd3613bab1d6e48355fbe7a7bbcd7a82edf30dc37acda69"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mep895oBci4ktubhzEG8pHODC3P5wWhM0IvPLwxXzfMeW99Vgl8BJnKo9Oe1MZjDaWn7tklZKD+3nn0VmxnLDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T22:56:03.674987Z","bundle_sha256":"9c4c3c5fb812e17191370b0c15321fbb20fc6efca1379ddd976e52953dde1c0e"}}