{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:7DXRJKWNZDEXMLNSKCQ5SQUB34","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":"8bc5af70872a115a0437dfdad58978835c0b80cc3db5d4c2ac18f5ec304b2b8c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-04-04T15:39:40Z","title_canon_sha256":"d73acb2f042fd16e88b7db8131f68693a7e31ed0aa8d9669f097513092536db0"},"schema_version":"1.0","source":{"id":"2504.03816","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.03816","created_at":"2026-07-05T10:53:16Z"},{"alias_kind":"arxiv_version","alias_value":"2504.03816v2","created_at":"2026-07-05T10:53:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.03816","created_at":"2026-07-05T10:53:16Z"},{"alias_kind":"pith_short_12","alias_value":"7DXRJKWNZDEX","created_at":"2026-07-05T10:53:16Z"},{"alias_kind":"pith_short_16","alias_value":"7DXRJKWNZDEXMLNS","created_at":"2026-07-05T10:53:16Z"},{"alias_kind":"pith_short_8","alias_value":"7DXRJKWN","created_at":"2026-07-05T10:53:16Z"}],"graph_snapshots":[{"event_id":"sha256:3e2c9a79b58051214c216dc3d5b63056a7ab89570acf228fb50944122e083731","target":"graph","created_at":"2026-07-05T10:53:16Z","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/2504.03816/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Nikolai Terekhov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-04-04T15:39:40Z","title":"A short proof of Tuza's conjecture for weak saturation in hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.03816","kind":"arxiv","version":2},"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:b8063748fc8c928a694fa3f6b843c11f58c23e107a61f8c9377138bf047d23d5","target":"record","created_at":"2026-07-05T10:53:16Z","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":"8bc5af70872a115a0437dfdad58978835c0b80cc3db5d4c2ac18f5ec304b2b8c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-04-04T15:39:40Z","title_canon_sha256":"d73acb2f042fd16e88b7db8131f68693a7e31ed0aa8d9669f097513092536db0"},"schema_version":"1.0","source":{"id":"2504.03816","kind":"arxiv","version":2}},"canonical_sha256":"f8ef14aacdc8c9762db250a1d94281df2317bbd5c2bc94e1e5ce7efb28aa1825","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f8ef14aacdc8c9762db250a1d94281df2317bbd5c2bc94e1e5ce7efb28aa1825","first_computed_at":"2026-07-05T10:53:16.782939Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:53:16.782939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ya361Phz8UAxIjCguPAZNcrN0pSi+GBPs7Riy6ziRaeP1EWmW32f9+mLWmiv9Z4bAD3t5/CmSvjNQkyS8Ti8DA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:53:16.783438Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.03816","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b8063748fc8c928a694fa3f6b843c11f58c23e107a61f8c9377138bf047d23d5","sha256:3e2c9a79b58051214c216dc3d5b63056a7ab89570acf228fb50944122e083731"],"state_sha256":"f067d3d6aceff125b3f447cb47309640892928fe64611f7024dbaed71003d8d4"}