{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:6XSWVLC36JU6ZBTL6WS7LB3F2W","short_pith_number":"pith:6XSWVLC3","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"},"canonical_sha256":"f5e56aac5bf269ec866bf5a5f58765d58238c2c3a56e5706d71184cc18567449","source":{"kind":"arxiv","id":"2110.10095","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.10095","created_at":"2026-07-05T05:09:13Z"},{"alias_kind":"arxiv_version","alias_value":"2110.10095v3","created_at":"2026-07-05T05:09:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.10095","created_at":"2026-07-05T05:09:13Z"},{"alias_kind":"pith_short_12","alias_value":"6XSWVLC36JU6","created_at":"2026-07-05T05:09:13Z"},{"alias_kind":"pith_short_16","alias_value":"6XSWVLC36JU6ZBTL","created_at":"2026-07-05T05:09:13Z"},{"alias_kind":"pith_short_8","alias_value":"6XSWVLC3","created_at":"2026-07-05T05:09:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:6XSWVLC36JU6ZBTL6WS7LB3F2W","target":"record","payload":{"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"},"canonical_sha256":"f5e56aac5bf269ec866bf5a5f58765d58238c2c3a56e5706d71184cc18567449","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"},"source_kind":"arxiv","source_id":"2110.10095","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-05T05:09:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gBlgXZiZjlPOdR5692i3bkWVvDS5xqV6mzigpMZPoQXWpdua/qVxSDLmjCOwHDAwEK+HwEqdjU+KI9OcaHpNBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T12:01:52.149066Z"},"content_sha256":"6fbde5408c69847a1ebd68bc8501789af748fd22841275f320aa0765a647d053","schema_version":"1.0","event_id":"sha256:6fbde5408c69847a1ebd68bc8501789af748fd22841275f320aa0765a647d053"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:6XSWVLC36JU6ZBTL6WS7LB3F2W","target":"graph","payload":{"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"},"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-05T05:09:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ErsYh1nDy/IDBwzhjQY1YQ+hIgiC+grMNwWo5kGkwhBhYHhiKrwrdePF5uomYiR3Uh0TH2sW+fSpHORHL5lrAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T12:01:52.149461Z"},"content_sha256":"2fe3a26ff9a6a7f20a27c0fb5a8edd0411201015684390e8eed65de84080f9c0","schema_version":"1.0","event_id":"sha256:2fe3a26ff9a6a7f20a27c0fb5a8edd0411201015684390e8eed65de84080f9c0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6XSWVLC36JU6ZBTL6WS7LB3F2W/bundle.json","state_url":"https://pith.science/pith/6XSWVLC36JU6ZBTL6WS7LB3F2W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6XSWVLC36JU6ZBTL6WS7LB3F2W/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-06T12:01:52Z","links":{"resolver":"https://pith.science/pith/6XSWVLC36JU6ZBTL6WS7LB3F2W","bundle":"https://pith.science/pith/6XSWVLC36JU6ZBTL6WS7LB3F2W/bundle.json","state":"https://pith.science/pith/6XSWVLC36JU6ZBTL6WS7LB3F2W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6XSWVLC36JU6ZBTL6WS7LB3F2W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:6XSWVLC36JU6ZBTL6WS7LB3F2W","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":"abb538bf9dbaec3c73ca34444fc382c1e3756233827e81bb25c0b911d093d3fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-10-19T16:48:24Z","title_canon_sha256":"eefa8947c0fa41988a9f6ecf492fa8fba8ab34fd4a62b22ee1c33c085d29af08"},"schema_version":"1.0","source":{"id":"2110.10095","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.10095","created_at":"2026-07-05T05:09:13Z"},{"alias_kind":"arxiv_version","alias_value":"2110.10095v3","created_at":"2026-07-05T05:09:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.10095","created_at":"2026-07-05T05:09:13Z"},{"alias_kind":"pith_short_12","alias_value":"6XSWVLC36JU6","created_at":"2026-07-05T05:09:13Z"},{"alias_kind":"pith_short_16","alias_value":"6XSWVLC36JU6ZBTL","created_at":"2026-07-05T05:09:13Z"},{"alias_kind":"pith_short_8","alias_value":"6XSWVLC3","created_at":"2026-07-05T05:09:13Z"}],"graph_snapshots":[{"event_id":"sha256:2fe3a26ff9a6a7f20a27c0fb5a8edd0411201015684390e8eed65de84080f9c0","target":"graph","created_at":"2026-07-05T05:09:13Z","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/2110.10095/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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)}(","authors_text":"Abdul Basit, Daniel McGinnis, Henry Simmons, Matt Sinnwell, Shira Zerbib","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-10-19T16:48:24Z","title":"Improved bounds on a generalization of Tuza's conjecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.10095","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:6fbde5408c69847a1ebd68bc8501789af748fd22841275f320aa0765a647d053","target":"record","created_at":"2026-07-05T05:09:13Z","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":"abb538bf9dbaec3c73ca34444fc382c1e3756233827e81bb25c0b911d093d3fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-10-19T16:48:24Z","title_canon_sha256":"eefa8947c0fa41988a9f6ecf492fa8fba8ab34fd4a62b22ee1c33c085d29af08"},"schema_version":"1.0","source":{"id":"2110.10095","kind":"arxiv","version":3}},"canonical_sha256":"f5e56aac5bf269ec866bf5a5f58765d58238c2c3a56e5706d71184cc18567449","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f5e56aac5bf269ec866bf5a5f58765d58238c2c3a56e5706d71184cc18567449","first_computed_at":"2026-07-05T05:09:13.466680Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:09:13.466680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hGTSjbo/bTGHjoQ/jRjAm358sfhO0rqb8gZkDh8q12EM6Oc0JZGcLuZ0rSFvsM6hoOUfjpvKsvqAFJaxtzg1Aw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:09:13.467165Z","signed_message":"canonical_sha256_bytes"},"source_id":"2110.10095","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6fbde5408c69847a1ebd68bc8501789af748fd22841275f320aa0765a647d053","sha256:2fe3a26ff9a6a7f20a27c0fb5a8edd0411201015684390e8eed65de84080f9c0"],"state_sha256":"1670b5648750096bd014a56e12c906e3c69daa4993dbccd635dd1774762fa12a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"onYcZn9XRkgolwgv0l6bKJ4PeRSDCRtBwMZlHsWetEazYV7WWjOIZdtRC5NrwYdr50eUSGC+Lts0iK1khCTkCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T12:01:52.151383Z","bundle_sha256":"e7a4bdbc6552cff63454a93c7c3224076d9e3b7da175dc619333866faf37638d"}}