{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:7DXRJKWNZDEXMLNSKCQ5SQUB34","short_pith_number":"pith:7DXRJKWN","schema_version":"1.0","canonical_sha256":"f8ef14aacdc8c9762db250a1d94281df2317bbd5c2bc94e1e5ce7efb28aa1825","source":{"kind":"arxiv","id":"2504.03816","version":2},"attestation_state":"computed","paper":{"title":"A short proof of Tuza's conjecture for weak saturation in hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nikolai Terekhov","submitted_at":"2025-04-04T15:39:40Z","abstract_excerpt":"Given an $r$-uniform hypergraph $H$ and a positive integer $n$, the weak saturation number $\\mathrm{wsat}(n,H)$ is the minimum number of edges in an $r$-uniform hypergraph $F$ on $n$ vertices such that the missing edges in $F$ can be added, one at a time, so that each added edge creates a copy of $H$. Shapira and Tyomkyn (Proceedings of the American Mathematical Society, 2023) proved Tuza's conjecture on asymptotic behaviour of $\\mathrm{wsat}(n, H)$. In this paper we provide a significantly shorter proof of the conjecture."},"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":"2504.03816","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-04-04T15:39:40Z","cross_cats_sorted":[],"title_canon_sha256":"d73acb2f042fd16e88b7db8131f68693a7e31ed0aa8d9669f097513092536db0","abstract_canon_sha256":"8bc5af70872a115a0437dfdad58978835c0b80cc3db5d4c2ac18f5ec304b2b8c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:53:16.783438Z","signature_b64":"Ya361Phz8UAxIjCguPAZNcrN0pSi+GBPs7Riy6ziRaeP1EWmW32f9+mLWmiv9Z4bAD3t5/CmSvjNQkyS8Ti8DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8ef14aacdc8c9762db250a1d94281df2317bbd5c2bc94e1e5ce7efb28aa1825","last_reissued_at":"2026-07-05T10:53:16.782939Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:53:16.782939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A short proof of Tuza's conjecture for weak saturation in hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nikolai Terekhov","submitted_at":"2025-04-04T15:39:40Z","abstract_excerpt":"Given an $r$-uniform hypergraph $H$ and a positive integer $n$, the weak saturation number $\\mathrm{wsat}(n,H)$ is the minimum number of edges in an $r$-uniform hypergraph $F$ on $n$ vertices such that the missing edges in $F$ can be added, one at a time, so that each added edge creates a copy of $H$. Shapira and Tyomkyn (Proceedings of the American Mathematical Society, 2023) proved Tuza's conjecture on asymptotic behaviour of $\\mathrm{wsat}(n, H)$. In this paper we provide a significantly shorter proof of the conjecture."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.03816","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/2504.03816/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":"2504.03816","created_at":"2026-07-05T10:53:16.782996+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.03816v2","created_at":"2026-07-05T10:53:16.782996+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.03816","created_at":"2026-07-05T10:53:16.782996+00:00"},{"alias_kind":"pith_short_12","alias_value":"7DXRJKWNZDEX","created_at":"2026-07-05T10:53:16.782996+00:00"},{"alias_kind":"pith_short_16","alias_value":"7DXRJKWNZDEXMLNS","created_at":"2026-07-05T10:53:16.782996+00:00"},{"alias_kind":"pith_short_8","alias_value":"7DXRJKWN","created_at":"2026-07-05T10:53:16.782996+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.07104","citing_title":"Asymptotically optimal lower bounds on weak saturation numbers for hypergraphs","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7DXRJKWNZDEXMLNSKCQ5SQUB34","json":"https://pith.science/pith/7DXRJKWNZDEXMLNSKCQ5SQUB34.json","graph_json":"https://pith.science/api/pith-number/7DXRJKWNZDEXMLNSKCQ5SQUB34/graph.json","events_json":"https://pith.science/api/pith-number/7DXRJKWNZDEXMLNSKCQ5SQUB34/events.json","paper":"https://pith.science/paper/7DXRJKWN"},"agent_actions":{"view_html":"https://pith.science/pith/7DXRJKWNZDEXMLNSKCQ5SQUB34","download_json":"https://pith.science/pith/7DXRJKWNZDEXMLNSKCQ5SQUB34.json","view_paper":"https://pith.science/paper/7DXRJKWN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.03816&json=true","fetch_graph":"https://pith.science/api/pith-number/7DXRJKWNZDEXMLNSKCQ5SQUB34/graph.json","fetch_events":"https://pith.science/api/pith-number/7DXRJKWNZDEXMLNSKCQ5SQUB34/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7DXRJKWNZDEXMLNSKCQ5SQUB34/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7DXRJKWNZDEXMLNSKCQ5SQUB34/action/storage_attestation","attest_author":"https://pith.science/pith/7DXRJKWNZDEXMLNSKCQ5SQUB34/action/author_attestation","sign_citation":"https://pith.science/pith/7DXRJKWNZDEXMLNSKCQ5SQUB34/action/citation_signature","submit_replication":"https://pith.science/pith/7DXRJKWNZDEXMLNSKCQ5SQUB34/action/replication_record"}},"created_at":"2026-07-05T10:53:16.782996+00:00","updated_at":"2026-07-05T10:53:16.782996+00:00"}