{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:UK45EBI6GWLDHH7DNKP7Z3L5FB","short_pith_number":"pith:UK45EBI6","schema_version":"1.0","canonical_sha256":"a2b9d2051e3596339fe36a9ffced7d28691d198a62d4e89c6cf12b509f98bf29","source":{"kind":"arxiv","id":"2604.07104","version":2},"attestation_state":"computed","paper":{"title":"Asymptotically optimal lower bounds on weak saturation numbers for hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Polymatroids establish asymptotically optimal lower bounds on weak saturation numbers for hypergraphs.","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nikolai Terekhov","submitted_at":"2026-04-08T13:56:51Z","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$.\n  For the case of graphs ($r = 2$), asymptotically optimal general lower bounds for these numbers in terms of the minimum vertex degree of $H$ are known. In this work, we generalize these bounds to the case of hypergraphs and establish their asymptotic optimality. To prove this, we introduce a lo"},"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":"2604.07104","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-04-08T13:56:51Z","cross_cats_sorted":[],"title_canon_sha256":"501fe23ff1da25db9c7b1cc535d99fc0d06391332a0463cc9628151dc78fcbf5","abstract_canon_sha256":"0893d3e7e4968f450914029f3673bec0e213c58d5c4b242383f3586a44d18384"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T02:19:50.346599Z","signature_b64":"hGhyOz2J8b6Mk7dw8WYKeqROpFRLKl9kI5MhnOW8xsJmjSLENeb3etMmdHsY201Y1Lx2WIvxVcuUYgrVyna9Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2b9d2051e3596339fe36a9ffced7d28691d198a62d4e89c6cf12b509f98bf29","last_reissued_at":"2026-07-07T02:19:50.345239Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T02:19:50.345239Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotically optimal lower bounds on weak saturation numbers for hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Polymatroids establish asymptotically optimal lower bounds on weak saturation numbers for hypergraphs.","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nikolai Terekhov","submitted_at":"2026-04-08T13:56:51Z","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$.\n  For the case of graphs ($r = 2$), asymptotically optimal general lower bounds for these numbers in terms of the minimum vertex degree of $H$ are known. In this work, we generalize these bounds to the case of hypergraphs and establish their asymptotic optimality. To prove this, we introduce a lo"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We generalize these bounds to the case of hypergraphs and establish their asymptotic optimality. To prove this, we introduce a lower bound method based on polymatroids.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The polymatroid construction correctly captures the weak saturation process for arbitrary r-uniform H and yields tight asymptotic coefficients without hidden integrality constraints.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Generalizes asymptotically optimal lower bounds on weak saturation numbers wsat(n,H) from graphs to r-uniform hypergraphs via a polymatroid method that yields non-integer coefficients.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Polymatroids establish asymptotically optimal lower bounds on weak saturation numbers for hypergraphs.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"94f555ec0546cad7b255a7af8b40c94391af522255eaf624863539047f67c6f4"},"source":{"id":"2604.07104","kind":"arxiv","version":2},"verdict":{"id":"cc11edaa-9e2a-4cec-b450-a58b44b28d51","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-10T17:33:40.570972Z","strongest_claim":"We generalize these bounds to the case of hypergraphs and establish their asymptotic optimality. To prove this, we introduce a lower bound method based on polymatroids.","one_line_summary":"Generalizes asymptotically optimal lower bounds on weak saturation numbers wsat(n,H) from graphs to r-uniform hypergraphs via a polymatroid method that yields non-integer coefficients.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The polymatroid construction correctly captures the weak saturation process for arbitrary r-uniform H and yields tight asymptotic coefficients without hidden integrality constraints.","pith_extraction_headline":"Polymatroids establish asymptotically optimal lower bounds on weak saturation numbers for hypergraphs."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.07104/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":"2604.07104","created_at":"2026-07-07T02:19:50.345470+00:00"},{"alias_kind":"arxiv_version","alias_value":"2604.07104v2","created_at":"2026-07-07T02:19:50.345470+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.07104","created_at":"2026-07-07T02:19:50.345470+00:00"},{"alias_kind":"pith_short_12","alias_value":"UK45EBI6GWLD","created_at":"2026-07-07T02:19:50.345470+00:00"},{"alias_kind":"pith_short_16","alias_value":"UK45EBI6GWLDHH7D","created_at":"2026-07-07T02:19:50.345470+00:00"},{"alias_kind":"pith_short_8","alias_value":"UK45EBI6","created_at":"2026-07-07T02:19:50.345470+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/UK45EBI6GWLDHH7DNKP7Z3L5FB","json":"https://pith.science/pith/UK45EBI6GWLDHH7DNKP7Z3L5FB.json","graph_json":"https://pith.science/api/pith-number/UK45EBI6GWLDHH7DNKP7Z3L5FB/graph.json","events_json":"https://pith.science/api/pith-number/UK45EBI6GWLDHH7DNKP7Z3L5FB/events.json","paper":"https://pith.science/paper/UK45EBI6"},"agent_actions":{"view_html":"https://pith.science/pith/UK45EBI6GWLDHH7DNKP7Z3L5FB","download_json":"https://pith.science/pith/UK45EBI6GWLDHH7DNKP7Z3L5FB.json","view_paper":"https://pith.science/paper/UK45EBI6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2604.07104&json=true","fetch_graph":"https://pith.science/api/pith-number/UK45EBI6GWLDHH7DNKP7Z3L5FB/graph.json","fetch_events":"https://pith.science/api/pith-number/UK45EBI6GWLDHH7DNKP7Z3L5FB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UK45EBI6GWLDHH7DNKP7Z3L5FB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UK45EBI6GWLDHH7DNKP7Z3L5FB/action/storage_attestation","attest_author":"https://pith.science/pith/UK45EBI6GWLDHH7DNKP7Z3L5FB/action/author_attestation","sign_citation":"https://pith.science/pith/UK45EBI6GWLDHH7DNKP7Z3L5FB/action/citation_signature","submit_replication":"https://pith.science/pith/UK45EBI6GWLDHH7DNKP7Z3L5FB/action/replication_record"}},"created_at":"2026-07-07T02:19:50.345470+00:00","updated_at":"2026-07-07T02:19:50.345470+00:00"}