{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KBDVBN7DNOK6HVIGNATLPOFRCF","short_pith_number":"pith:KBDVBN7D","schema_version":"1.0","canonical_sha256":"504750b7e36b95e3d5066826b7b8b11155cea79670b43a672aedd012899fcb6e","source":{"kind":"arxiv","id":"2405.17857","version":2},"attestation_state":"computed","paper":{"title":"Weak saturation rank: a failure of linear algebraic approach to weak saturation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Maksim Zhukovskii, Nikolai Terekhov","submitted_at":"2024-05-28T06:16:12Z","abstract_excerpt":"Given a graph $F$ and a positive integer $n$, the weak $F$-saturation number $\\mathrm{wsat}(K_n,F)$ is the minimum number of edges in a graph $H$ on $n$ vertices such that the edges missing in $H$ can be added, one at a time, so that every edge creates a copy of $F$. Kalai in 1985 introduced a linear algebraic approach that became one of the most efficient tools to prove lower bounds on weak saturation numbers. If $W$ is a vector space spanned by vectors $w(e)$ assigned to edges $e$ of $K_n$ in such a way that, for every copy $F'\\subset K_n$ of $F$, there exist non-zero $\\lambda_e$, $e\\in E(F'"},"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":"2405.17857","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-05-28T06:16:12Z","cross_cats_sorted":[],"title_canon_sha256":"de157f895deb0bcbcf5eefb6f35849773f00ac523bd167b9d0cdfd7af80c65b3","abstract_canon_sha256":"e85a2709b531f918ba60515361eba96ac4784c9ec32a3d323e4f3b349e414c08"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:31:51.585782Z","signature_b64":"c0ppqh2p4Di02vBEuDRyTcu3m5RtQIYu6p5jCAGOPr8lruOV7SuLNC7AcpwDpTXwxwtKl482roAC5KQvA743DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"504750b7e36b95e3d5066826b7b8b11155cea79670b43a672aedd012899fcb6e","last_reissued_at":"2026-07-05T08:31:51.585355Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:31:51.585355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Weak saturation rank: a failure of linear algebraic approach to weak saturation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Maksim Zhukovskii, Nikolai Terekhov","submitted_at":"2024-05-28T06:16:12Z","abstract_excerpt":"Given a graph $F$ and a positive integer $n$, the weak $F$-saturation number $\\mathrm{wsat}(K_n,F)$ is the minimum number of edges in a graph $H$ on $n$ vertices such that the edges missing in $H$ can be added, one at a time, so that every edge creates a copy of $F$. Kalai in 1985 introduced a linear algebraic approach that became one of the most efficient tools to prove lower bounds on weak saturation numbers. If $W$ is a vector space spanned by vectors $w(e)$ assigned to edges $e$ of $K_n$ in such a way that, for every copy $F'\\subset K_n$ of $F$, there exist non-zero $\\lambda_e$, $e\\in E(F'"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.17857","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/2405.17857/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":"2405.17857","created_at":"2026-07-05T08:31:51.585414+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.17857v2","created_at":"2026-07-05T08:31:51.585414+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.17857","created_at":"2026-07-05T08:31:51.585414+00:00"},{"alias_kind":"pith_short_12","alias_value":"KBDVBN7DNOK6","created_at":"2026-07-05T08:31:51.585414+00:00"},{"alias_kind":"pith_short_16","alias_value":"KBDVBN7DNOK6HVIG","created_at":"2026-07-05T08:31:51.585414+00:00"},{"alias_kind":"pith_short_8","alias_value":"KBDVBN7D","created_at":"2026-07-05T08:31:51.585414+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.05697","citing_title":"When does a tree activate the random graph?","ref_index":63,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KBDVBN7DNOK6HVIGNATLPOFRCF","json":"https://pith.science/pith/KBDVBN7DNOK6HVIGNATLPOFRCF.json","graph_json":"https://pith.science/api/pith-number/KBDVBN7DNOK6HVIGNATLPOFRCF/graph.json","events_json":"https://pith.science/api/pith-number/KBDVBN7DNOK6HVIGNATLPOFRCF/events.json","paper":"https://pith.science/paper/KBDVBN7D"},"agent_actions":{"view_html":"https://pith.science/pith/KBDVBN7DNOK6HVIGNATLPOFRCF","download_json":"https://pith.science/pith/KBDVBN7DNOK6HVIGNATLPOFRCF.json","view_paper":"https://pith.science/paper/KBDVBN7D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.17857&json=true","fetch_graph":"https://pith.science/api/pith-number/KBDVBN7DNOK6HVIGNATLPOFRCF/graph.json","fetch_events":"https://pith.science/api/pith-number/KBDVBN7DNOK6HVIGNATLPOFRCF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KBDVBN7DNOK6HVIGNATLPOFRCF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KBDVBN7DNOK6HVIGNATLPOFRCF/action/storage_attestation","attest_author":"https://pith.science/pith/KBDVBN7DNOK6HVIGNATLPOFRCF/action/author_attestation","sign_citation":"https://pith.science/pith/KBDVBN7DNOK6HVIGNATLPOFRCF/action/citation_signature","submit_replication":"https://pith.science/pith/KBDVBN7DNOK6HVIGNATLPOFRCF/action/replication_record"}},"created_at":"2026-07-05T08:31:51.585414+00:00","updated_at":"2026-07-05T08:31:51.585414+00:00"}