{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:UBG4CA3XM7G7CBW3TGHKHIFJGJ","short_pith_number":"pith:UBG4CA3X","schema_version":"1.0","canonical_sha256":"a04dc1037767cdf106db998ea3a0a9326545ad366f27fb9831daef748f28fa41","source":{"kind":"arxiv","id":"2508.19435","version":1},"attestation_state":"computed","paper":{"title":"Weak saturation numbers of large complete bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ilya Vorobyev, Maksim Zhukovskii, Margarita Akhmejanova","submitted_at":"2025-08-26T21:09:45Z","abstract_excerpt":"An $n$-vertex graph $G$ is weakly $F$-saturated if $G$ contains no copy of $F$ and there exists an ordering of all edges in $E(K_n) \\setminus E(G)$ such that, when added one at a time, each edge creates a new copy of $F$. The minimum size of a weakly $F$-saturated graph $G$ is called the weak saturation number $\\mathrm{wsat}(n, F)$. We obtain exact values and new bounds for $\\mathrm{wsat}(n, K_{s,t})$ in the previously unaddressed range $s+t < n < 3t-3$, where $3\\leq s\\leq t$. To prove lower bounds, we introduce a new method that takes into account connectivity properties of subgraphs of a com"},"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":"2508.19435","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-08-26T21:09:45Z","cross_cats_sorted":[],"title_canon_sha256":"c1a22b80e08a7dda63560453e220ee0c90f0419d8b43c654b6b0532c202a220c","abstract_canon_sha256":"450b259777b5a94e8b80c80bd11f36f0b3e7ee9dde9d0f0421dbc7c4cf6ae7d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:00:11.465144Z","signature_b64":"j79NQplBUo/UILiNTvuwLE7FpW0OhAyUO9Z6L5BZDGwv/JgNsUc12fncXWS6G0x2QmV3bxy6+syENtPPYasvAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a04dc1037767cdf106db998ea3a0a9326545ad366f27fb9831daef748f28fa41","last_reissued_at":"2026-07-05T12:00:11.464739Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:00:11.464739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Weak saturation numbers of large complete bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ilya Vorobyev, Maksim Zhukovskii, Margarita Akhmejanova","submitted_at":"2025-08-26T21:09:45Z","abstract_excerpt":"An $n$-vertex graph $G$ is weakly $F$-saturated if $G$ contains no copy of $F$ and there exists an ordering of all edges in $E(K_n) \\setminus E(G)$ such that, when added one at a time, each edge creates a new copy of $F$. The minimum size of a weakly $F$-saturated graph $G$ is called the weak saturation number $\\mathrm{wsat}(n, F)$. We obtain exact values and new bounds for $\\mathrm{wsat}(n, K_{s,t})$ in the previously unaddressed range $s+t < n < 3t-3$, where $3\\leq s\\leq t$. To prove lower bounds, we introduce a new method that takes into account connectivity properties of subgraphs of a com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.19435","kind":"arxiv","version":1},"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/2508.19435/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":"2508.19435","created_at":"2026-07-05T12:00:11.464798+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.19435v1","created_at":"2026-07-05T12:00:11.464798+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.19435","created_at":"2026-07-05T12:00:11.464798+00:00"},{"alias_kind":"pith_short_12","alias_value":"UBG4CA3XM7G7","created_at":"2026-07-05T12:00:11.464798+00:00"},{"alias_kind":"pith_short_16","alias_value":"UBG4CA3XM7G7CBW3","created_at":"2026-07-05T12:00:11.464798+00:00"},{"alias_kind":"pith_short_8","alias_value":"UBG4CA3X","created_at":"2026-07-05T12:00:11.464798+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/UBG4CA3XM7G7CBW3TGHKHIFJGJ","json":"https://pith.science/pith/UBG4CA3XM7G7CBW3TGHKHIFJGJ.json","graph_json":"https://pith.science/api/pith-number/UBG4CA3XM7G7CBW3TGHKHIFJGJ/graph.json","events_json":"https://pith.science/api/pith-number/UBG4CA3XM7G7CBW3TGHKHIFJGJ/events.json","paper":"https://pith.science/paper/UBG4CA3X"},"agent_actions":{"view_html":"https://pith.science/pith/UBG4CA3XM7G7CBW3TGHKHIFJGJ","download_json":"https://pith.science/pith/UBG4CA3XM7G7CBW3TGHKHIFJGJ.json","view_paper":"https://pith.science/paper/UBG4CA3X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.19435&json=true","fetch_graph":"https://pith.science/api/pith-number/UBG4CA3XM7G7CBW3TGHKHIFJGJ/graph.json","fetch_events":"https://pith.science/api/pith-number/UBG4CA3XM7G7CBW3TGHKHIFJGJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UBG4CA3XM7G7CBW3TGHKHIFJGJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UBG4CA3XM7G7CBW3TGHKHIFJGJ/action/storage_attestation","attest_author":"https://pith.science/pith/UBG4CA3XM7G7CBW3TGHKHIFJGJ/action/author_attestation","sign_citation":"https://pith.science/pith/UBG4CA3XM7G7CBW3TGHKHIFJGJ/action/citation_signature","submit_replication":"https://pith.science/pith/UBG4CA3XM7G7CBW3TGHKHIFJGJ/action/replication_record"}},"created_at":"2026-07-05T12:00:11.464798+00:00","updated_at":"2026-07-05T12:00:11.464798+00:00"}