{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:PBEU6A7EM65NCTO3WQEK4H73GX","short_pith_number":"pith:PBEU6A7E","schema_version":"1.0","canonical_sha256":"78494f03e467bad14ddbb408ae1ffb35c1abd4123dac52fd6937f9c8b5b6d516","source":{"kind":"arxiv","id":"2507.05697","version":1},"attestation_state":"computed","paper":{"title":"When does a tree activate the random graph?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AT","math.PR"],"primary_cat":"math.CO","authors_text":"Asaf Cohen Antonir, Asaf Shapira, Maksim Zhukovskii, Mykhaylo Tyomkyn, Yuval Peled","submitted_at":"2025-07-08T06:09:01Z","abstract_excerpt":"Let $F$ and $G$ be two graphs. A spanning subgraph $H$ of $G$ is called weakly $F$-saturated if one can add to $H$ the edges of $G \\setminus H$ in some order, so that whenever a new edge is added, a new copy of $F$ is formed. Obtaining lower bounds for the minimum size $\\mathrm{wsat}(G,F)$ of such an $H$ is a classical problem in extremal combinatorics. In particular, in the past 40 years, various algebraic tools have been developed to prove lower bounds on the weak saturation number $\\mathrm{wsat}(G,F)$. Our paper uncovers a new connection of weak saturation to topology of clique complexes, t"},"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":"2507.05697","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-08T06:09:01Z","cross_cats_sorted":["math.AT","math.PR"],"title_canon_sha256":"1511824b9fc4b50b2661f1e37bd78b4b0ce11294a43183735fa5d1d635ec50ae","abstract_canon_sha256":"d07856abf2695be153337ffed2837f9b354c79ff2ff1e5ae70d12ea1d4a2f85d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:33:34.930019Z","signature_b64":"ilJ6SMQPRRwflbUnQW4bMu1LhUrNUuP05aSqLUdgigRB+y8gCBymwPbAvKp8qJVbsEYxbniABlQCqmPkOXJuBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78494f03e467bad14ddbb408ae1ffb35c1abd4123dac52fd6937f9c8b5b6d516","last_reissued_at":"2026-07-05T11:33:34.929559Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:33:34.929559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"When does a tree activate the random graph?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AT","math.PR"],"primary_cat":"math.CO","authors_text":"Asaf Cohen Antonir, Asaf Shapira, Maksim Zhukovskii, Mykhaylo Tyomkyn, Yuval Peled","submitted_at":"2025-07-08T06:09:01Z","abstract_excerpt":"Let $F$ and $G$ be two graphs. A spanning subgraph $H$ of $G$ is called weakly $F$-saturated if one can add to $H$ the edges of $G \\setminus H$ in some order, so that whenever a new edge is added, a new copy of $F$ is formed. Obtaining lower bounds for the minimum size $\\mathrm{wsat}(G,F)$ of such an $H$ is a classical problem in extremal combinatorics. In particular, in the past 40 years, various algebraic tools have been developed to prove lower bounds on the weak saturation number $\\mathrm{wsat}(G,F)$. Our paper uncovers a new connection of weak saturation to topology of clique complexes, t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.05697","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/2507.05697/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":"2507.05697","created_at":"2026-07-05T11:33:34.929627+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.05697v1","created_at":"2026-07-05T11:33:34.929627+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.05697","created_at":"2026-07-05T11:33:34.929627+00:00"},{"alias_kind":"pith_short_12","alias_value":"PBEU6A7EM65N","created_at":"2026-07-05T11:33:34.929627+00:00"},{"alias_kind":"pith_short_16","alias_value":"PBEU6A7EM65NCTO3","created_at":"2026-07-05T11:33:34.929627+00:00"},{"alias_kind":"pith_short_8","alias_value":"PBEU6A7E","created_at":"2026-07-05T11:33:34.929627+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.19435","citing_title":"Weak saturation numbers of large complete bipartite graphs","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PBEU6A7EM65NCTO3WQEK4H73GX","json":"https://pith.science/pith/PBEU6A7EM65NCTO3WQEK4H73GX.json","graph_json":"https://pith.science/api/pith-number/PBEU6A7EM65NCTO3WQEK4H73GX/graph.json","events_json":"https://pith.science/api/pith-number/PBEU6A7EM65NCTO3WQEK4H73GX/events.json","paper":"https://pith.science/paper/PBEU6A7E"},"agent_actions":{"view_html":"https://pith.science/pith/PBEU6A7EM65NCTO3WQEK4H73GX","download_json":"https://pith.science/pith/PBEU6A7EM65NCTO3WQEK4H73GX.json","view_paper":"https://pith.science/paper/PBEU6A7E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.05697&json=true","fetch_graph":"https://pith.science/api/pith-number/PBEU6A7EM65NCTO3WQEK4H73GX/graph.json","fetch_events":"https://pith.science/api/pith-number/PBEU6A7EM65NCTO3WQEK4H73GX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PBEU6A7EM65NCTO3WQEK4H73GX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PBEU6A7EM65NCTO3WQEK4H73GX/action/storage_attestation","attest_author":"https://pith.science/pith/PBEU6A7EM65NCTO3WQEK4H73GX/action/author_attestation","sign_citation":"https://pith.science/pith/PBEU6A7EM65NCTO3WQEK4H73GX/action/citation_signature","submit_replication":"https://pith.science/pith/PBEU6A7EM65NCTO3WQEK4H73GX/action/replication_record"}},"created_at":"2026-07-05T11:33:34.929627+00:00","updated_at":"2026-07-05T11:33:34.929627+00:00"}