{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ODKIV4Y5IOJQ7OJ4DRCNFY6XUL","short_pith_number":"pith:ODKIV4Y5","canonical_record":{"source":{"id":"1611.07497","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-22T20:14:18Z","cross_cats_sorted":[],"title_canon_sha256":"8d3741280e16ec7526fb63d7dd519fd3d2a1a22f0a44242ec366360ebfb9144d","abstract_canon_sha256":"565e735152ce1bc72daea6fe52015003814546f0c83ecbfaa290e718639e9664"},"schema_version":"1.0"},"canonical_sha256":"70d48af31d43930fb93c1c44d2e3d7a2fcadda5cb9029f5849e82c590966decf","source":{"kind":"arxiv","id":"1611.07497","version":7},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.07497","created_at":"2026-07-05T00:26:54Z"},{"alias_kind":"arxiv_version","alias_value":"1611.07497v7","created_at":"2026-07-05T00:26:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07497","created_at":"2026-07-05T00:26:54Z"},{"alias_kind":"pith_short_12","alias_value":"ODKIV4Y5IOJQ","created_at":"2026-07-05T00:26:54Z"},{"alias_kind":"pith_short_16","alias_value":"ODKIV4Y5IOJQ7OJ4","created_at":"2026-07-05T00:26:54Z"},{"alias_kind":"pith_short_8","alias_value":"ODKIV4Y5","created_at":"2026-07-05T00:26:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ODKIV4Y5IOJQ7OJ4DRCNFY6XUL","target":"record","payload":{"canonical_record":{"source":{"id":"1611.07497","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-22T20:14:18Z","cross_cats_sorted":[],"title_canon_sha256":"8d3741280e16ec7526fb63d7dd519fd3d2a1a22f0a44242ec366360ebfb9144d","abstract_canon_sha256":"565e735152ce1bc72daea6fe52015003814546f0c83ecbfaa290e718639e9664"},"schema_version":"1.0"},"canonical_sha256":"70d48af31d43930fb93c1c44d2e3d7a2fcadda5cb9029f5849e82c590966decf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:26:54.886289Z","signature_b64":"Fjk/WuF+HxGDSLQNlo9w4/m/vhxWTPjh2lqUMuIuN909Qifru9CFbA3cPSkn8VROGIAqk4YdDCXnW1Bo69cuDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70d48af31d43930fb93c1c44d2e3d7a2fcadda5cb9029f5849e82c590966decf","last_reissued_at":"2026-07-05T00:26:54.885858Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:26:54.885858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.07497","source_version":7,"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:26:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SZtwmI/+USgKNbFEK2TzWopEPnyxY5P/t9wnvER6wKvPWu8orDiN9oRVzgSsT2D3EDrcO60JwiL5BXRxiEurBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T06:37:14.163376Z"},"content_sha256":"2323ff44a9cff46f02ab466e9474ba9208513a349c7dd9c0bb6bd7b053b01eae","schema_version":"1.0","event_id":"sha256:2323ff44a9cff46f02ab466e9474ba9208513a349c7dd9c0bb6bd7b053b01eae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ODKIV4Y5IOJQ7OJ4DRCNFY6XUL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A generalization of Tuza's conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ron Aharoni, Shira Zerbib","submitted_at":"2016-11-22T20:14:18Z","abstract_excerpt":"A famous conjecture of Tuza \\cite{tuza} is that the minimal number of edges needed to cover all triangles in a graph is at most twice the maximal number of edge-disjoint triangles. We propose a wider setting for this conjecture.\n  For a hypergraph $H$ let $\\nu^{(m)}(H)$ be the maximal size of a collection of edges, no two of which share $m$ or more vertices, and let $\\tau^{(m)}(H)$ be the minimal size of a collection $C$ of sets of $m$ vertices, such that every edge in $H$ contains a set from $C$. We conjecture that the maximal ratio $\\tau^{(m)}(H)/\\nu^{(m)}(H)$ is attained in hypergraphs for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07497","kind":"arxiv","version":7},"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/1611.07497/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:26:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3aYEy9Kp9Ehxoi1XXv9a7ktZLzrdaHUpHJLnU8NcZnJkMefFyDlmvz39kqBLtrDu1qmDEVaXwoCiK35DB0AFDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T06:37:14.163765Z"},"content_sha256":"84ba8a9e174b8e604ea6d588ab34b9b40006e2bdbad24cd7acad6422eb033069","schema_version":"1.0","event_id":"sha256:84ba8a9e174b8e604ea6d588ab34b9b40006e2bdbad24cd7acad6422eb033069"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ODKIV4Y5IOJQ7OJ4DRCNFY6XUL/bundle.json","state_url":"https://pith.science/pith/ODKIV4Y5IOJQ7OJ4DRCNFY6XUL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ODKIV4Y5IOJQ7OJ4DRCNFY6XUL/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-07T06:37:14Z","links":{"resolver":"https://pith.science/pith/ODKIV4Y5IOJQ7OJ4DRCNFY6XUL","bundle":"https://pith.science/pith/ODKIV4Y5IOJQ7OJ4DRCNFY6XUL/bundle.json","state":"https://pith.science/pith/ODKIV4Y5IOJQ7OJ4DRCNFY6XUL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ODKIV4Y5IOJQ7OJ4DRCNFY6XUL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ODKIV4Y5IOJQ7OJ4DRCNFY6XUL","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":"565e735152ce1bc72daea6fe52015003814546f0c83ecbfaa290e718639e9664","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-22T20:14:18Z","title_canon_sha256":"8d3741280e16ec7526fb63d7dd519fd3d2a1a22f0a44242ec366360ebfb9144d"},"schema_version":"1.0","source":{"id":"1611.07497","kind":"arxiv","version":7}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.07497","created_at":"2026-07-05T00:26:54Z"},{"alias_kind":"arxiv_version","alias_value":"1611.07497v7","created_at":"2026-07-05T00:26:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07497","created_at":"2026-07-05T00:26:54Z"},{"alias_kind":"pith_short_12","alias_value":"ODKIV4Y5IOJQ","created_at":"2026-07-05T00:26:54Z"},{"alias_kind":"pith_short_16","alias_value":"ODKIV4Y5IOJQ7OJ4","created_at":"2026-07-05T00:26:54Z"},{"alias_kind":"pith_short_8","alias_value":"ODKIV4Y5","created_at":"2026-07-05T00:26:54Z"}],"graph_snapshots":[{"event_id":"sha256:84ba8a9e174b8e604ea6d588ab34b9b40006e2bdbad24cd7acad6422eb033069","target":"graph","created_at":"2026-07-05T00:26:54Z","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/1611.07497/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A famous conjecture of Tuza \\cite{tuza} is that the minimal number of edges needed to cover all triangles in a graph is at most twice the maximal number of edge-disjoint triangles. We propose a wider setting for this conjecture.\n  For a hypergraph $H$ let $\\nu^{(m)}(H)$ be the maximal size of a collection of edges, no two of which share $m$ or more vertices, and let $\\tau^{(m)}(H)$ be the minimal size of a collection $C$ of sets of $m$ vertices, such that every edge in $H$ contains a set from $C$. We conjecture that the maximal ratio $\\tau^{(m)}(H)/\\nu^{(m)}(H)$ is attained in hypergraphs for ","authors_text":"Ron Aharoni, Shira Zerbib","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-22T20:14:18Z","title":"A generalization of Tuza's conjecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07497","kind":"arxiv","version":7},"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:2323ff44a9cff46f02ab466e9474ba9208513a349c7dd9c0bb6bd7b053b01eae","target":"record","created_at":"2026-07-05T00:26:54Z","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":"565e735152ce1bc72daea6fe52015003814546f0c83ecbfaa290e718639e9664","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-22T20:14:18Z","title_canon_sha256":"8d3741280e16ec7526fb63d7dd519fd3d2a1a22f0a44242ec366360ebfb9144d"},"schema_version":"1.0","source":{"id":"1611.07497","kind":"arxiv","version":7}},"canonical_sha256":"70d48af31d43930fb93c1c44d2e3d7a2fcadda5cb9029f5849e82c590966decf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"70d48af31d43930fb93c1c44d2e3d7a2fcadda5cb9029f5849e82c590966decf","first_computed_at":"2026-07-05T00:26:54.885858Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:26:54.885858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Fjk/WuF+HxGDSLQNlo9w4/m/vhxWTPjh2lqUMuIuN909Qifru9CFbA3cPSkn8VROGIAqk4YdDCXnW1Bo69cuDw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:26:54.886289Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.07497","source_kind":"arxiv","source_version":7}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2323ff44a9cff46f02ab466e9474ba9208513a349c7dd9c0bb6bd7b053b01eae","sha256:84ba8a9e174b8e604ea6d588ab34b9b40006e2bdbad24cd7acad6422eb033069"],"state_sha256":"a97aa2ea4cab9dfb9db5ed92b33257159640c14648dca9d364a3f9df8c39246e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MnD+5bQr9jd+tLRV+irF9CwO+kA+nt4N7f7Hb3S+8YMeDUsirZMe/j/f8qd4yrjRA5bbK239n5ui6Pp4nLCcBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T06:37:14.165927Z","bundle_sha256":"f6cf7ae96fdc615191d3445f2df7c8c5658aaac8b132edac9226c80defff8f41"}}