{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:FBKQZJPFN2ERD56XMSRR2DBJMX","short_pith_number":"pith:FBKQZJPF","schema_version":"1.0","canonical_sha256":"28550ca5e56e8911f7d764a31d0c2965dd85d5d80c9a5d6ed5cfdb2d700a03d8","source":{"kind":"arxiv","id":"2503.11473","version":1},"attestation_state":"computed","paper":{"title":"The saturation number of W 4","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jinze Hu, Ning Song, Qing Cui, Shengjin Ji","submitted_at":"2025-03-14T15:02:42Z","abstract_excerpt":"For a fixed graph $H$, a graph $G$ is called $H$-saturated if $G$ does not contain $H$ as a (not necessarily induced) subgraph, but $G+e$ contains a copy of $H$ for any $e\\in E(\\overline{G})$. The saturation number of $H$, denoted by ${\\rm sat}(n,H)$, is the minimum number of edges in an $n$-vertex $H$-saturated graph. A wheel $W_n$ is a graph obtained from a cycle of length $n$ by adding a new vertex and joining it to every vertex of the cycle. A well-known result of Erd\\H{o}s, Hajnal and Moon shows that ${\\rm sat}(n,W_3)=2n-3$ for all $n\\geq 4$ and $K_2\\vee \\overline{K_{n-2}}$ is the unique "},"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":"2503.11473","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2025-03-14T15:02:42Z","cross_cats_sorted":[],"title_canon_sha256":"cf8caa9cbe5a880a5cc53094be59019d4d550f2fbf6c13a095eefba26408bcc4","abstract_canon_sha256":"820a79796550f4e7a4716b6bbc03e6a60231cbf3a699c168799e99e555344474"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:31:32.433798Z","signature_b64":"JYFHf9JDGXORiJZewvHC8fmeZT9pt8dCSNyeGThw/ifL2Kn791HzEHpNu3eBbNu6rLwByxiMdruJ/J+QniJlBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28550ca5e56e8911f7d764a31d0c2965dd85d5d80c9a5d6ed5cfdb2d700a03d8","last_reissued_at":"2026-07-05T10:31:32.432995Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:31:32.432995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The saturation number of W 4","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jinze Hu, Ning Song, Qing Cui, Shengjin Ji","submitted_at":"2025-03-14T15:02:42Z","abstract_excerpt":"For a fixed graph $H$, a graph $G$ is called $H$-saturated if $G$ does not contain $H$ as a (not necessarily induced) subgraph, but $G+e$ contains a copy of $H$ for any $e\\in E(\\overline{G})$. The saturation number of $H$, denoted by ${\\rm sat}(n,H)$, is the minimum number of edges in an $n$-vertex $H$-saturated graph. A wheel $W_n$ is a graph obtained from a cycle of length $n$ by adding a new vertex and joining it to every vertex of the cycle. A well-known result of Erd\\H{o}s, Hajnal and Moon shows that ${\\rm sat}(n,W_3)=2n-3$ for all $n\\geq 4$ and $K_2\\vee \\overline{K_{n-2}}$ is the unique "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.11473","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/2503.11473/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":"2503.11473","created_at":"2026-07-05T10:31:32.433069+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.11473v1","created_at":"2026-07-05T10:31:32.433069+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.11473","created_at":"2026-07-05T10:31:32.433069+00:00"},{"alias_kind":"pith_short_12","alias_value":"FBKQZJPFN2ER","created_at":"2026-07-05T10:31:32.433069+00:00"},{"alias_kind":"pith_short_16","alias_value":"FBKQZJPFN2ERD56X","created_at":"2026-07-05T10:31:32.433069+00:00"},{"alias_kind":"pith_short_8","alias_value":"FBKQZJPF","created_at":"2026-07-05T10:31:32.433069+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/FBKQZJPFN2ERD56XMSRR2DBJMX","json":"https://pith.science/pith/FBKQZJPFN2ERD56XMSRR2DBJMX.json","graph_json":"https://pith.science/api/pith-number/FBKQZJPFN2ERD56XMSRR2DBJMX/graph.json","events_json":"https://pith.science/api/pith-number/FBKQZJPFN2ERD56XMSRR2DBJMX/events.json","paper":"https://pith.science/paper/FBKQZJPF"},"agent_actions":{"view_html":"https://pith.science/pith/FBKQZJPFN2ERD56XMSRR2DBJMX","download_json":"https://pith.science/pith/FBKQZJPFN2ERD56XMSRR2DBJMX.json","view_paper":"https://pith.science/paper/FBKQZJPF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.11473&json=true","fetch_graph":"https://pith.science/api/pith-number/FBKQZJPFN2ERD56XMSRR2DBJMX/graph.json","fetch_events":"https://pith.science/api/pith-number/FBKQZJPFN2ERD56XMSRR2DBJMX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FBKQZJPFN2ERD56XMSRR2DBJMX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FBKQZJPFN2ERD56XMSRR2DBJMX/action/storage_attestation","attest_author":"https://pith.science/pith/FBKQZJPFN2ERD56XMSRR2DBJMX/action/author_attestation","sign_citation":"https://pith.science/pith/FBKQZJPFN2ERD56XMSRR2DBJMX/action/citation_signature","submit_replication":"https://pith.science/pith/FBKQZJPFN2ERD56XMSRR2DBJMX/action/replication_record"}},"created_at":"2026-07-05T10:31:32.433069+00:00","updated_at":"2026-07-05T10:31:32.433069+00:00"}