{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:M34PQMV6GNPDZZNP4YMJOXZ7IZ","short_pith_number":"pith:M34PQMV6","canonical_record":{"source":{"id":"1409.4833","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-16T23:51:14Z","cross_cats_sorted":[],"title_canon_sha256":"b72536633b8907cf9ab998de61f845fe9644604b1f1e8c5ff1dd1222c7f9020a","abstract_canon_sha256":"54648a6613bc5291a1f3506faf85cbe2024eac9e2d3448db19f1d527b8307ada"},"schema_version":"1.0"},"canonical_sha256":"66f8f832be335e3ce5afe618975f3f465c2dad9c3c7553e01f8d889a785497a0","source":{"kind":"arxiv","id":"1409.4833","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.4833","created_at":"2026-05-18T01:23:38Z"},{"alias_kind":"arxiv_version","alias_value":"1409.4833v2","created_at":"2026-05-18T01:23:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.4833","created_at":"2026-05-18T01:23:38Z"},{"alias_kind":"pith_short_12","alias_value":"M34PQMV6GNPD","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"M34PQMV6GNPDZZNP","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"M34PQMV6","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:M34PQMV6GNPDZZNP4YMJOXZ7IZ","target":"record","payload":{"canonical_record":{"source":{"id":"1409.4833","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-16T23:51:14Z","cross_cats_sorted":[],"title_canon_sha256":"b72536633b8907cf9ab998de61f845fe9644604b1f1e8c5ff1dd1222c7f9020a","abstract_canon_sha256":"54648a6613bc5291a1f3506faf85cbe2024eac9e2d3448db19f1d527b8307ada"},"schema_version":"1.0"},"canonical_sha256":"66f8f832be335e3ce5afe618975f3f465c2dad9c3c7553e01f8d889a785497a0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:38.801501Z","signature_b64":"PRSpBqPB9oZYZhXXgekphiiLZOXn6AyEjpZ/Fg35MUwBgR4eb5mFAYuWoa1RDseQrfJMy887Ad58XVJFHMnwAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66f8f832be335e3ce5afe618975f3f465c2dad9c3c7553e01f8d889a785497a0","last_reissued_at":"2026-05-18T01:23:38.800783Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:38.800783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.4833","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-05-18T01:23:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A/QVC7XX/y2nKDhBiDBO0Hjb7ifIvT5baz+9Vgqzp3y4ZVOAwG7e6yMEXf8NNGPYJKOWLlqV8PvVIP3/H4qxCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:38:24.122541Z"},"content_sha256":"4bf1107ad8e8d8aabce8fd562c02fa59d72c956f1b3515f0960bfbb4f3464df4","schema_version":"1.0","event_id":"sha256:4bf1107ad8e8d8aabce8fd562c02fa59d72c956f1b3515f0960bfbb4f3464df4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:M34PQMV6GNPDZZNP4YMJOXZ7IZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multipartite hypergraphs achieving equality in Ryser's conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ian M. Wanless, J\\'anos Bar\\'at, Ron Aharoni","submitted_at":"2014-09-16T23:51:14Z","abstract_excerpt":"A famous conjecture of Ryser is that in an $r$-partite hypergraph the covering number is at most $r-1$ times the matching number. If true, this is known to be sharp for $r$ for which there exists a projective plane of order $r-1$. We show that the conjecture, if true, is also sharp for the smallest previously open value, namely $r=7$. For $r\\in\\{6,7\\}$, we find the minimal number $f(r)$ of edges in an intersecting $r$-partite hypergraph that has covering number at least $r-1$. We find that $f(r)$ is achieved only by linear hypergraphs for $r\\le5$, but that this is not the case for $r\\in\\{6,7\\}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.4833","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":""},"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-05-18T01:23:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S3KOGKN5JjoL1YW5u41NgtTdhg2jVZg7vd81Ppp2fxoGmfB7rOfuhv7icb4L0jr3h0pcZ9GNV9AOtWqqZWaXBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:38:24.123222Z"},"content_sha256":"e63bc8287e302545e7dddcffda59bbe24addda374723f6577c85c6620cb10520","schema_version":"1.0","event_id":"sha256:e63bc8287e302545e7dddcffda59bbe24addda374723f6577c85c6620cb10520"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M34PQMV6GNPDZZNP4YMJOXZ7IZ/bundle.json","state_url":"https://pith.science/pith/M34PQMV6GNPDZZNP4YMJOXZ7IZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M34PQMV6GNPDZZNP4YMJOXZ7IZ/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-05-26T21:38:24Z","links":{"resolver":"https://pith.science/pith/M34PQMV6GNPDZZNP4YMJOXZ7IZ","bundle":"https://pith.science/pith/M34PQMV6GNPDZZNP4YMJOXZ7IZ/bundle.json","state":"https://pith.science/pith/M34PQMV6GNPDZZNP4YMJOXZ7IZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M34PQMV6GNPDZZNP4YMJOXZ7IZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:M34PQMV6GNPDZZNP4YMJOXZ7IZ","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":"54648a6613bc5291a1f3506faf85cbe2024eac9e2d3448db19f1d527b8307ada","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-16T23:51:14Z","title_canon_sha256":"b72536633b8907cf9ab998de61f845fe9644604b1f1e8c5ff1dd1222c7f9020a"},"schema_version":"1.0","source":{"id":"1409.4833","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.4833","created_at":"2026-05-18T01:23:38Z"},{"alias_kind":"arxiv_version","alias_value":"1409.4833v2","created_at":"2026-05-18T01:23:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.4833","created_at":"2026-05-18T01:23:38Z"},{"alias_kind":"pith_short_12","alias_value":"M34PQMV6GNPD","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"M34PQMV6GNPDZZNP","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"M34PQMV6","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:e63bc8287e302545e7dddcffda59bbe24addda374723f6577c85c6620cb10520","target":"graph","created_at":"2026-05-18T01:23:38Z","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"},"paper":{"abstract_excerpt":"A famous conjecture of Ryser is that in an $r$-partite hypergraph the covering number is at most $r-1$ times the matching number. If true, this is known to be sharp for $r$ for which there exists a projective plane of order $r-1$. We show that the conjecture, if true, is also sharp for the smallest previously open value, namely $r=7$. For $r\\in\\{6,7\\}$, we find the minimal number $f(r)$ of edges in an intersecting $r$-partite hypergraph that has covering number at least $r-1$. We find that $f(r)$ is achieved only by linear hypergraphs for $r\\le5$, but that this is not the case for $r\\in\\{6,7\\}","authors_text":"Ian M. Wanless, J\\'anos Bar\\'at, Ron Aharoni","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-16T23:51:14Z","title":"Multipartite hypergraphs achieving equality in Ryser's conjecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.4833","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:4bf1107ad8e8d8aabce8fd562c02fa59d72c956f1b3515f0960bfbb4f3464df4","target":"record","created_at":"2026-05-18T01:23:38Z","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":"54648a6613bc5291a1f3506faf85cbe2024eac9e2d3448db19f1d527b8307ada","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-16T23:51:14Z","title_canon_sha256":"b72536633b8907cf9ab998de61f845fe9644604b1f1e8c5ff1dd1222c7f9020a"},"schema_version":"1.0","source":{"id":"1409.4833","kind":"arxiv","version":2}},"canonical_sha256":"66f8f832be335e3ce5afe618975f3f465c2dad9c3c7553e01f8d889a785497a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"66f8f832be335e3ce5afe618975f3f465c2dad9c3c7553e01f8d889a785497a0","first_computed_at":"2026-05-18T01:23:38.800783Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:38.800783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PRSpBqPB9oZYZhXXgekphiiLZOXn6AyEjpZ/Fg35MUwBgR4eb5mFAYuWoa1RDseQrfJMy887Ad58XVJFHMnwAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:38.801501Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.4833","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4bf1107ad8e8d8aabce8fd562c02fa59d72c956f1b3515f0960bfbb4f3464df4","sha256:e63bc8287e302545e7dddcffda59bbe24addda374723f6577c85c6620cb10520"],"state_sha256":"34ac12fba07ee7fc5913d0fd9b27d128aaa7f0f254bed41dd2f632fd0345701f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OjMLbgVyndYm7iAnFQOpQnwksbAwsZff3jkEYg9+KUkgF5udWZHpVCweJuF94JOu9zk6OUwiDGm8srOrzjuMDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:38:24.126571Z","bundle_sha256":"633fb16bd24e61ae3d80da12241a0aa47bb86d4b2f1f8b4c6c0285f94ee105a8"}}