{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:DI2O66K2M2YATHZDJPQ6WUVIEG","short_pith_number":"pith:DI2O66K2","schema_version":"1.0","canonical_sha256":"1a34ef795a66b0099f234be1eb52a821b974bd63c1bb89659880a9252a617511","source":{"kind":"arxiv","id":"2001.04132","version":2},"attestation_state":"computed","paper":{"title":"Ryser's Conjecture for $t$-intersecting hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anurag Bishnoi, Patrick Morris, Shagnik Das, Tibor Szab\\'o","submitted_at":"2020-01-13T10:12:54Z","abstract_excerpt":"A well-known conjecture, often attributed to Ryser, states that the cover number of an $r$-partite $r$-uniform hypergraph is at most $r - 1$ times larger than its matching number. Despite considerable effort, particularly in the intersecting case, this conjecture remains wide open, motivating the pursuit of variants of the original conjecture. Recently, Bustamante and Stein and, independently, Kir\\'{a}ly and T\\'{o}thm\\'{e}r\\'{e}sz considered the problem under the assumption that the hypergraph is $t$-intersecting, conjecturing that the cover number $\\tau(\\mathcal{H})$ of such a hypergraph $\\ma"},"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":"2001.04132","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-01-13T10:12:54Z","cross_cats_sorted":[],"title_canon_sha256":"3e2bd30137588287c5544451e30adb8db128d9c94accdeb9f91a343845a3a8e6","abstract_canon_sha256":"95006ca5f128b1b9911892c1736e8c46957bd5278c60d20066293286f407cfd1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:54:42.300597Z","signature_b64":"jCdpipaFZ2UbtUpV1r1WW1qspc0qA0Gr25UkhkZlTrJdq+XmfRbyosJT2f7YKr5rbY0czZYsYhq6DSOeSVDbCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a34ef795a66b0099f234be1eb52a821b974bd63c1bb89659880a9252a617511","last_reissued_at":"2026-07-05T01:54:42.300164Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:54:42.300164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ryser's Conjecture for $t$-intersecting hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anurag Bishnoi, Patrick Morris, Shagnik Das, Tibor Szab\\'o","submitted_at":"2020-01-13T10:12:54Z","abstract_excerpt":"A well-known conjecture, often attributed to Ryser, states that the cover number of an $r$-partite $r$-uniform hypergraph is at most $r - 1$ times larger than its matching number. Despite considerable effort, particularly in the intersecting case, this conjecture remains wide open, motivating the pursuit of variants of the original conjecture. Recently, Bustamante and Stein and, independently, Kir\\'{a}ly and T\\'{o}thm\\'{e}r\\'{e}sz considered the problem under the assumption that the hypergraph is $t$-intersecting, conjecturing that the cover number $\\tau(\\mathcal{H})$ of such a hypergraph $\\ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.04132","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/2001.04132/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":"2001.04132","created_at":"2026-07-05T01:54:42.300227+00:00"},{"alias_kind":"arxiv_version","alias_value":"2001.04132v2","created_at":"2026-07-05T01:54:42.300227+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.04132","created_at":"2026-07-05T01:54:42.300227+00:00"},{"alias_kind":"pith_short_12","alias_value":"DI2O66K2M2YA","created_at":"2026-07-05T01:54:42.300227+00:00"},{"alias_kind":"pith_short_16","alias_value":"DI2O66K2M2YATHZD","created_at":"2026-07-05T01:54:42.300227+00:00"},{"alias_kind":"pith_short_8","alias_value":"DI2O66K2","created_at":"2026-07-05T01:54:42.300227+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/DI2O66K2M2YATHZDJPQ6WUVIEG","json":"https://pith.science/pith/DI2O66K2M2YATHZDJPQ6WUVIEG.json","graph_json":"https://pith.science/api/pith-number/DI2O66K2M2YATHZDJPQ6WUVIEG/graph.json","events_json":"https://pith.science/api/pith-number/DI2O66K2M2YATHZDJPQ6WUVIEG/events.json","paper":"https://pith.science/paper/DI2O66K2"},"agent_actions":{"view_html":"https://pith.science/pith/DI2O66K2M2YATHZDJPQ6WUVIEG","download_json":"https://pith.science/pith/DI2O66K2M2YATHZDJPQ6WUVIEG.json","view_paper":"https://pith.science/paper/DI2O66K2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2001.04132&json=true","fetch_graph":"https://pith.science/api/pith-number/DI2O66K2M2YATHZDJPQ6WUVIEG/graph.json","fetch_events":"https://pith.science/api/pith-number/DI2O66K2M2YATHZDJPQ6WUVIEG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DI2O66K2M2YATHZDJPQ6WUVIEG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DI2O66K2M2YATHZDJPQ6WUVIEG/action/storage_attestation","attest_author":"https://pith.science/pith/DI2O66K2M2YATHZDJPQ6WUVIEG/action/author_attestation","sign_citation":"https://pith.science/pith/DI2O66K2M2YATHZDJPQ6WUVIEG/action/citation_signature","submit_replication":"https://pith.science/pith/DI2O66K2M2YATHZDJPQ6WUVIEG/action/replication_record"}},"created_at":"2026-07-05T01:54:42.300227+00:00","updated_at":"2026-07-05T01:54:42.300227+00:00"}