{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:E6EUP7RLRHXY2THYES5DK2JLRQ","short_pith_number":"pith:E6EUP7RL","schema_version":"1.0","canonical_sha256":"278947fe2b89ef8d4cf824ba35692b8c3d5736e4549bc36b64165b2c31e7ed3c","source":{"kind":"arxiv","id":"1308.2211","version":3},"attestation_state":"computed","paper":{"title":"Tuza's Conjecture for Graphs of Maximum Average Degree Less Than 7","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gregory J. Puleo","submitted_at":"2013-08-09T19:24:22Z","abstract_excerpt":"Tuza's Conjecture states that if a graph $G$ does not contain more than $k$ edge-disjoint triangles, then some set of at most $2k$ edges meets all triangles of $G$. We prove Tuza's Conjecture for all graphs $G$ having no subgraph with average degree at least $7$. As a key tool in the proof, we introduce a notion of reducible sets for Tuza's Conjecture; these are substructures which cannot occur in a minimal counterexample to Tuza's Conjecture. We also introduce weak K\\\"onig--Egerv\\'ary graphs, a generalization of the well-studied K\\\"onig--Egerv\\'ary graphs."},"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":"1308.2211","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-09T19:24:22Z","cross_cats_sorted":[],"title_canon_sha256":"0a722e447ff2e7774cda9cd6186006cc34c4f2d8d293cc848cdaa564abd00364","abstract_canon_sha256":"b08444d1ce01240515ff5d60513cc9390f167e9b18312875c048c225d3c9ef40"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:06.295792Z","signature_b64":"c/6WSYU32wtGNhn5LRxG7sU25SP2Hej28vM/oYfWUyVGN906ioyYHLgEuGwN9XjsUwGuod4AWPaZkIRAI9qrBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"278947fe2b89ef8d4cf824ba35692b8c3d5736e4549bc36b64165b2c31e7ed3c","last_reissued_at":"2026-05-18T02:19:06.295279Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:06.295279Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tuza's Conjecture for Graphs of Maximum Average Degree Less Than 7","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gregory J. Puleo","submitted_at":"2013-08-09T19:24:22Z","abstract_excerpt":"Tuza's Conjecture states that if a graph $G$ does not contain more than $k$ edge-disjoint triangles, then some set of at most $2k$ edges meets all triangles of $G$. We prove Tuza's Conjecture for all graphs $G$ having no subgraph with average degree at least $7$. As a key tool in the proof, we introduce a notion of reducible sets for Tuza's Conjecture; these are substructures which cannot occur in a minimal counterexample to Tuza's Conjecture. We also introduce weak K\\\"onig--Egerv\\'ary graphs, a generalization of the well-studied K\\\"onig--Egerv\\'ary graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.2211","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":""},"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":"1308.2211","created_at":"2026-05-18T02:19:06.295362+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.2211v3","created_at":"2026-05-18T02:19:06.295362+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.2211","created_at":"2026-05-18T02:19:06.295362+00:00"},{"alias_kind":"pith_short_12","alias_value":"E6EUP7RLRHXY","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"E6EUP7RLRHXY2THY","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"E6EUP7RL","created_at":"2026-05-18T12:27:43.054852+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/E6EUP7RLRHXY2THYES5DK2JLRQ","json":"https://pith.science/pith/E6EUP7RLRHXY2THYES5DK2JLRQ.json","graph_json":"https://pith.science/api/pith-number/E6EUP7RLRHXY2THYES5DK2JLRQ/graph.json","events_json":"https://pith.science/api/pith-number/E6EUP7RLRHXY2THYES5DK2JLRQ/events.json","paper":"https://pith.science/paper/E6EUP7RL"},"agent_actions":{"view_html":"https://pith.science/pith/E6EUP7RLRHXY2THYES5DK2JLRQ","download_json":"https://pith.science/pith/E6EUP7RLRHXY2THYES5DK2JLRQ.json","view_paper":"https://pith.science/paper/E6EUP7RL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.2211&json=true","fetch_graph":"https://pith.science/api/pith-number/E6EUP7RLRHXY2THYES5DK2JLRQ/graph.json","fetch_events":"https://pith.science/api/pith-number/E6EUP7RLRHXY2THYES5DK2JLRQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E6EUP7RLRHXY2THYES5DK2JLRQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E6EUP7RLRHXY2THYES5DK2JLRQ/action/storage_attestation","attest_author":"https://pith.science/pith/E6EUP7RLRHXY2THYES5DK2JLRQ/action/author_attestation","sign_citation":"https://pith.science/pith/E6EUP7RLRHXY2THYES5DK2JLRQ/action/citation_signature","submit_replication":"https://pith.science/pith/E6EUP7RLRHXY2THYES5DK2JLRQ/action/replication_record"}},"created_at":"2026-05-18T02:19:06.295362+00:00","updated_at":"2026-05-18T02:19:06.295362+00:00"}