{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:6XSWVLC36JU6ZBTL6WS7LB3F2W","short_pith_number":"pith:6XSWVLC3","schema_version":"1.0","canonical_sha256":"f5e56aac5bf269ec866bf5a5f58765d58238c2c3a56e5706d71184cc18567449","source":{"kind":"arxiv","id":"2110.10095","version":3},"attestation_state":"computed","paper":{"title":"Improved bounds on a generalization of Tuza's conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abdul Basit, Daniel McGinnis, Henry Simmons, Matt Sinnwell, Shira Zerbib","submitted_at":"2021-10-19T16:48:24Z","abstract_excerpt":"For an $r$-uniform hypergraph $H$, let $\\nu^{(m)}(H)$ denote the maximum size of a set~$M$ of edges in $H$ such that every two edges in $M$ intersect in less than $m$ vertices, and let $\\tau^{(m)}(H)$ denote the minimum size of a collection $C$ of $m$-sets of vertices such that every edge in $H$ contains an element of $C$. The fractional analogues of these parameters are denoted by $\\nu^{*(m)}(H)$ and $\\tau^{*(m)}(H)$, respectively. Generalizing a famous conjecture of Tuza on covering triangles in a graph, Aharoni and Zerbib conjectured that for every $r$-uniform hypergraph $H$, $\\tau^{(r-1)}("},"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":"2110.10095","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-10-19T16:48:24Z","cross_cats_sorted":[],"title_canon_sha256":"eefa8947c0fa41988a9f6ecf492fa8fba8ab34fd4a62b22ee1c33c085d29af08","abstract_canon_sha256":"abb538bf9dbaec3c73ca34444fc382c1e3756233827e81bb25c0b911d093d3fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:09:13.467165Z","signature_b64":"hGTSjbo/bTGHjoQ/jRjAm358sfhO0rqb8gZkDh8q12EM6Oc0JZGcLuZ0rSFvsM6hoOUfjpvKsvqAFJaxtzg1Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5e56aac5bf269ec866bf5a5f58765d58238c2c3a56e5706d71184cc18567449","last_reissued_at":"2026-07-05T05:09:13.466680Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:09:13.466680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved bounds on a generalization of Tuza's conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abdul Basit, Daniel McGinnis, Henry Simmons, Matt Sinnwell, Shira Zerbib","submitted_at":"2021-10-19T16:48:24Z","abstract_excerpt":"For an $r$-uniform hypergraph $H$, let $\\nu^{(m)}(H)$ denote the maximum size of a set~$M$ of edges in $H$ such that every two edges in $M$ intersect in less than $m$ vertices, and let $\\tau^{(m)}(H)$ denote the minimum size of a collection $C$ of $m$-sets of vertices such that every edge in $H$ contains an element of $C$. The fractional analogues of these parameters are denoted by $\\nu^{*(m)}(H)$ and $\\tau^{*(m)}(H)$, respectively. Generalizing a famous conjecture of Tuza on covering triangles in a graph, Aharoni and Zerbib conjectured that for every $r$-uniform hypergraph $H$, $\\tau^{(r-1)}("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.10095","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/2110.10095/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":"2110.10095","created_at":"2026-07-05T05:09:13.466740+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.10095v3","created_at":"2026-07-05T05:09:13.466740+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.10095","created_at":"2026-07-05T05:09:13.466740+00:00"},{"alias_kind":"pith_short_12","alias_value":"6XSWVLC36JU6","created_at":"2026-07-05T05:09:13.466740+00:00"},{"alias_kind":"pith_short_16","alias_value":"6XSWVLC36JU6ZBTL","created_at":"2026-07-05T05:09:13.466740+00:00"},{"alias_kind":"pith_short_8","alias_value":"6XSWVLC3","created_at":"2026-07-05T05:09:13.466740+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/6XSWVLC36JU6ZBTL6WS7LB3F2W","json":"https://pith.science/pith/6XSWVLC36JU6ZBTL6WS7LB3F2W.json","graph_json":"https://pith.science/api/pith-number/6XSWVLC36JU6ZBTL6WS7LB3F2W/graph.json","events_json":"https://pith.science/api/pith-number/6XSWVLC36JU6ZBTL6WS7LB3F2W/events.json","paper":"https://pith.science/paper/6XSWVLC3"},"agent_actions":{"view_html":"https://pith.science/pith/6XSWVLC36JU6ZBTL6WS7LB3F2W","download_json":"https://pith.science/pith/6XSWVLC36JU6ZBTL6WS7LB3F2W.json","view_paper":"https://pith.science/paper/6XSWVLC3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.10095&json=true","fetch_graph":"https://pith.science/api/pith-number/6XSWVLC36JU6ZBTL6WS7LB3F2W/graph.json","fetch_events":"https://pith.science/api/pith-number/6XSWVLC36JU6ZBTL6WS7LB3F2W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6XSWVLC36JU6ZBTL6WS7LB3F2W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6XSWVLC36JU6ZBTL6WS7LB3F2W/action/storage_attestation","attest_author":"https://pith.science/pith/6XSWVLC36JU6ZBTL6WS7LB3F2W/action/author_attestation","sign_citation":"https://pith.science/pith/6XSWVLC36JU6ZBTL6WS7LB3F2W/action/citation_signature","submit_replication":"https://pith.science/pith/6XSWVLC36JU6ZBTL6WS7LB3F2W/action/replication_record"}},"created_at":"2026-07-05T05:09:13.466740+00:00","updated_at":"2026-07-05T05:09:13.466740+00:00"}