{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XJNDVDY7OFT2PVRDHBYOLF6X7S","short_pith_number":"pith:XJNDVDY7","canonical_record":{"source":{"id":"1809.06931","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-18T20:52:06Z","cross_cats_sorted":[],"title_canon_sha256":"0d7a78b0ffb7aced5325e089213ae5427b7fc15d973cfea70b8439c78901e1b4","abstract_canon_sha256":"7c181ce4a1a7fc198dbfa947151b96352c82b06ad4f4bfea6acaa91e23505b7a"},"schema_version":"1.0"},"canonical_sha256":"ba5a3a8f1f7167a7d6233870e597d7fcabd488532a83b3bb0d2eec06c701389c","source":{"kind":"arxiv","id":"1809.06931","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.06931","created_at":"2026-07-05T00:15:21Z"},{"alias_kind":"arxiv_version","alias_value":"1809.06931v3","created_at":"2026-07-05T00:15:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.06931","created_at":"2026-07-05T00:15:21Z"},{"alias_kind":"pith_short_12","alias_value":"XJNDVDY7OFT2","created_at":"2026-07-05T00:15:21Z"},{"alias_kind":"pith_short_16","alias_value":"XJNDVDY7OFT2PVRD","created_at":"2026-07-05T00:15:21Z"},{"alias_kind":"pith_short_8","alias_value":"XJNDVDY7","created_at":"2026-07-05T00:15:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XJNDVDY7OFT2PVRDHBYOLF6X7S","target":"record","payload":{"canonical_record":{"source":{"id":"1809.06931","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-18T20:52:06Z","cross_cats_sorted":[],"title_canon_sha256":"0d7a78b0ffb7aced5325e089213ae5427b7fc15d973cfea70b8439c78901e1b4","abstract_canon_sha256":"7c181ce4a1a7fc198dbfa947151b96352c82b06ad4f4bfea6acaa91e23505b7a"},"schema_version":"1.0"},"canonical_sha256":"ba5a3a8f1f7167a7d6233870e597d7fcabd488532a83b3bb0d2eec06c701389c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:15:21.985514Z","signature_b64":"H1RPfC/kiLKR+Z+t8RzS3VD0/mwsbr1FvBRLfeq+ZBhDA1YdEeglbIMVwjRWNRQwRocJRelU65zUfkxpMXTXBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba5a3a8f1f7167a7d6233870e597d7fcabd488532a83b3bb0d2eec06c701389c","last_reissued_at":"2026-07-05T00:15:21.985080Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:15:21.985080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.06931","source_version":3,"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-05T00:15:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y92ZrziNwoObf765CL6IPQkbKTxQO9EeMNMIQlkU8OhRcGAD8TG/jktvnoBjxkvFs7h56IjYPXNxfn/OuIQNCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-15T22:13:13.425529Z"},"content_sha256":"8041a13ab83e6173bf57086d0fa4cd28b726e99b207147071bf9bc38e3fde21b","schema_version":"1.0","event_id":"sha256:8041a13ab83e6173bf57086d0fa4cd28b726e99b207147071bf9bc38e3fde21b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XJNDVDY7OFT2PVRDHBYOLF6X7S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-intersecting Ryser hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anurag Bishnoi, Valentina Pepe","submitted_at":"2018-09-18T20:52:06Z","abstract_excerpt":"A famous conjecture of Ryser states that every $r$-partite hypergraph has vertex cover number at most $r - 1$ times the matching number. In recent years, hypergraphs meeting this conjectured bound, known as $r$-Ryser hypergraphs, have been studied extensively. It was recently proved by Haxell, Narins and Szab\\'{o} that all $3$-Ryser hypergraphs with matching number $\\nu > 1$ are essentially obtained by taking $\\nu$ disjoint copies of intersecting $3$-Ryser hypergraphs. Abu-Khazneh showed that such a characterisation is false for $r = 4$ by giving a computer generated example of a $4$-Ryser hyp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.06931","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/1809.06931/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-05T00:15:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xP35AlY2bpk9EGTOGpn7G3DROGdXjP5kbtVj8/U6CxzulI5gFpmdcsQlPwoUlpM7051SOdM54M8Yd/TEMnSgCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-15T22:13:13.425891Z"},"content_sha256":"fcee0bbcd5a7222cbcedcc147483fa0fa68024f08dc8b0f3775f011c09f7146b","schema_version":"1.0","event_id":"sha256:fcee0bbcd5a7222cbcedcc147483fa0fa68024f08dc8b0f3775f011c09f7146b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XJNDVDY7OFT2PVRDHBYOLF6X7S/bundle.json","state_url":"https://pith.science/pith/XJNDVDY7OFT2PVRDHBYOLF6X7S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XJNDVDY7OFT2PVRDHBYOLF6X7S/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-07-15T22:13:13Z","links":{"resolver":"https://pith.science/pith/XJNDVDY7OFT2PVRDHBYOLF6X7S","bundle":"https://pith.science/pith/XJNDVDY7OFT2PVRDHBYOLF6X7S/bundle.json","state":"https://pith.science/pith/XJNDVDY7OFT2PVRDHBYOLF6X7S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XJNDVDY7OFT2PVRDHBYOLF6X7S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XJNDVDY7OFT2PVRDHBYOLF6X7S","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":"7c181ce4a1a7fc198dbfa947151b96352c82b06ad4f4bfea6acaa91e23505b7a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-18T20:52:06Z","title_canon_sha256":"0d7a78b0ffb7aced5325e089213ae5427b7fc15d973cfea70b8439c78901e1b4"},"schema_version":"1.0","source":{"id":"1809.06931","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.06931","created_at":"2026-07-05T00:15:21Z"},{"alias_kind":"arxiv_version","alias_value":"1809.06931v3","created_at":"2026-07-05T00:15:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.06931","created_at":"2026-07-05T00:15:21Z"},{"alias_kind":"pith_short_12","alias_value":"XJNDVDY7OFT2","created_at":"2026-07-05T00:15:21Z"},{"alias_kind":"pith_short_16","alias_value":"XJNDVDY7OFT2PVRD","created_at":"2026-07-05T00:15:21Z"},{"alias_kind":"pith_short_8","alias_value":"XJNDVDY7","created_at":"2026-07-05T00:15:21Z"}],"graph_snapshots":[{"event_id":"sha256:fcee0bbcd5a7222cbcedcc147483fa0fa68024f08dc8b0f3775f011c09f7146b","target":"graph","created_at":"2026-07-05T00:15:21Z","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/1809.06931/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A famous conjecture of Ryser states that every $r$-partite hypergraph has vertex cover number at most $r - 1$ times the matching number. In recent years, hypergraphs meeting this conjectured bound, known as $r$-Ryser hypergraphs, have been studied extensively. It was recently proved by Haxell, Narins and Szab\\'{o} that all $3$-Ryser hypergraphs with matching number $\\nu > 1$ are essentially obtained by taking $\\nu$ disjoint copies of intersecting $3$-Ryser hypergraphs. Abu-Khazneh showed that such a characterisation is false for $r = 4$ by giving a computer generated example of a $4$-Ryser hyp","authors_text":"Anurag Bishnoi, Valentina Pepe","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-18T20:52:06Z","title":"Non-intersecting Ryser hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.06931","kind":"arxiv","version":3},"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:8041a13ab83e6173bf57086d0fa4cd28b726e99b207147071bf9bc38e3fde21b","target":"record","created_at":"2026-07-05T00:15:21Z","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":"7c181ce4a1a7fc198dbfa947151b96352c82b06ad4f4bfea6acaa91e23505b7a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-18T20:52:06Z","title_canon_sha256":"0d7a78b0ffb7aced5325e089213ae5427b7fc15d973cfea70b8439c78901e1b4"},"schema_version":"1.0","source":{"id":"1809.06931","kind":"arxiv","version":3}},"canonical_sha256":"ba5a3a8f1f7167a7d6233870e597d7fcabd488532a83b3bb0d2eec06c701389c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ba5a3a8f1f7167a7d6233870e597d7fcabd488532a83b3bb0d2eec06c701389c","first_computed_at":"2026-07-05T00:15:21.985080Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:15:21.985080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H1RPfC/kiLKR+Z+t8RzS3VD0/mwsbr1FvBRLfeq+ZBhDA1YdEeglbIMVwjRWNRQwRocJRelU65zUfkxpMXTXBA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:15:21.985514Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.06931","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8041a13ab83e6173bf57086d0fa4cd28b726e99b207147071bf9bc38e3fde21b","sha256:fcee0bbcd5a7222cbcedcc147483fa0fa68024f08dc8b0f3775f011c09f7146b"],"state_sha256":"429b8316e426641ec3fbdfd1bc58f1c1b748c1729f28989985d42324db27060f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8QRz2TGmQZkCDVvLICf0qCa+4VZinNFdd+rZH6p3B2wFWChhwKyfwVO1SmX3g3zwb8ySUldF3n9aWMYQASBeAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-15T22:13:13.427960Z","bundle_sha256":"4bcb44fa7ba0d6af5b96118a17b12165b3b48d820f552389edcba2900c61136d"}}