{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:UK45EBI6GWLDHH7DNKP7Z3L5FB","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":"0893d3e7e4968f450914029f3673bec0e213c58d5c4b242383f3586a44d18384","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-04-08T13:56:51Z","title_canon_sha256":"501fe23ff1da25db9c7b1cc535d99fc0d06391332a0463cc9628151dc78fcbf5"},"schema_version":"1.0","source":{"id":"2604.07104","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.07104","created_at":"2026-07-07T02:19:50Z"},{"alias_kind":"arxiv_version","alias_value":"2604.07104v2","created_at":"2026-07-07T02:19:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.07104","created_at":"2026-07-07T02:19:50Z"},{"alias_kind":"pith_short_12","alias_value":"UK45EBI6GWLD","created_at":"2026-07-07T02:19:50Z"},{"alias_kind":"pith_short_16","alias_value":"UK45EBI6GWLDHH7D","created_at":"2026-07-07T02:19:50Z"},{"alias_kind":"pith_short_8","alias_value":"UK45EBI6","created_at":"2026-07-07T02:19:50Z"}],"graph_snapshots":[{"event_id":"sha256:7162f786606698ec6b15f8b52bdb1997d62328cc811623f98611f5acb7c3c29a","target":"graph","created_at":"2026-07-07T02:19:50Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The polymatroid construction correctly captures the weak saturation process for arbitrary r-uniform H and yields tight asymptotic coefficients without hidden integrality constraints."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Polymatroids establish asymptotically optimal lower bounds on weak saturation numbers for hypergraphs."}],"snapshot_sha256":"94f555ec0546cad7b255a7af8b40c94391af522255eaf624863539047f67c6f4"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2604.07104/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$.\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","authors_text":"Nikolai Terekhov","cross_cats":[],"headline":"Polymatroids establish asymptotically optimal lower bounds on weak saturation numbers for hypergraphs.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-04-08T13:56:51Z","title":"Asymptotically optimal lower bounds on weak saturation numbers for hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.07104","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-10T17:33:40.570972Z","id":"cc11edaa-9e2a-4cec-b450-a58b44b28d51","model_set":{"reader":"grok-4.3"},"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","pith_extraction_headline":"Polymatroids establish asymptotically optimal lower bounds on weak saturation numbers for hypergraphs.","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.","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."}},"verdict_id":"cc11edaa-9e2a-4cec-b450-a58b44b28d51"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a364a952c26e4a8d7bd2effa4a3d8b232f87cdcdf397fe64789159f4f7acb45b","target":"record","created_at":"2026-07-07T02:19:50Z","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":"0893d3e7e4968f450914029f3673bec0e213c58d5c4b242383f3586a44d18384","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-04-08T13:56:51Z","title_canon_sha256":"501fe23ff1da25db9c7b1cc535d99fc0d06391332a0463cc9628151dc78fcbf5"},"schema_version":"1.0","source":{"id":"2604.07104","kind":"arxiv","version":2}},"canonical_sha256":"a2b9d2051e3596339fe36a9ffced7d28691d198a62d4e89c6cf12b509f98bf29","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2b9d2051e3596339fe36a9ffced7d28691d198a62d4e89c6cf12b509f98bf29","first_computed_at":"2026-07-07T02:19:50.345239Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-07T02:19:50.345239Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hGhyOz2J8b6Mk7dw8WYKeqROpFRLKl9kI5MhnOW8xsJmjSLENeb3etMmdHsY201Y1Lx2WIvxVcuUYgrVyna9Cw==","signature_status":"signed_v1","signed_at":"2026-07-07T02:19:50.346599Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.07104","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a364a952c26e4a8d7bd2effa4a3d8b232f87cdcdf397fe64789159f4f7acb45b","sha256:7162f786606698ec6b15f8b52bdb1997d62328cc811623f98611f5acb7c3c29a"],"state_sha256":"c8b7d9fd3c869cebe15974d9e1b361396a85c8dc423a47d9492ddc3f74178c20"}