{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:UPY6OK5KCQM7DXKMAXPKM3ZEUL","short_pith_number":"pith:UPY6OK5K","schema_version":"1.0","canonical_sha256":"a3f1e72baa1419f1dd4c05dea66f24a2c7e6e23895cb4cc7044919d17501d2ee","source":{"kind":"arxiv","id":"2606.22011","version":1},"attestation_state":"computed","paper":{"title":"Saturation numbers for joins of graphs and characterization of extremal graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xinying Hua, Yuejian Peng","submitted_at":"2026-06-20T12:20:03Z","abstract_excerpt":"A graph $G$ is $H$-saturated if $G$ contains no $H$-copy as a subgraph, but adding any edge between two non-adjacent vertices in $G$ creates a copy of $H$. The saturation number $\\mathrm{sat}(n,H)$ is the minimum number of edges in an $n$-vertex $H$-saturated graph. Saturation number for the join of a vertex and a graph $F$, denoted by $K_1\\vee F$, has received considerable attention. Cameron and Puleo \\cite{Ca} showed that $\\mathrm{sat}(n,K_1 \\vee F)\\le n-1+\\mathrm{sat}(n-1, F)$ for all $n > |V(F)|$. A natural question is to ask when the above equality holds. Existing results for $\\mathrm{sat"},"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":"2606.22011","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-20T12:20:03Z","cross_cats_sorted":[],"title_canon_sha256":"725512b5c539d351fe3963390dd403b4ba3cbc106ef51aed7b7fa8eab4ddf09e","abstract_canon_sha256":"07632d2d998c6f81d9675241d0548c62bf6b4456808e76548c13dda2a7344cd1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T02:13:05.513835Z","signature_b64":"E7IwQPmcuCVjDMmPBXNOCsjOAIUdGRyEJnTZ8WKylAfvBukZrOfgQXSnAwcwThDDGNB/kYBpUUwruShnpua4Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3f1e72baa1419f1dd4c05dea66f24a2c7e6e23895cb4cc7044919d17501d2ee","last_reissued_at":"2026-06-23T02:13:05.513480Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T02:13:05.513480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Saturation numbers for joins of graphs and characterization of extremal graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xinying Hua, Yuejian Peng","submitted_at":"2026-06-20T12:20:03Z","abstract_excerpt":"A graph $G$ is $H$-saturated if $G$ contains no $H$-copy as a subgraph, but adding any edge between two non-adjacent vertices in $G$ creates a copy of $H$. The saturation number $\\mathrm{sat}(n,H)$ is the minimum number of edges in an $n$-vertex $H$-saturated graph. Saturation number for the join of a vertex and a graph $F$, denoted by $K_1\\vee F$, has received considerable attention. Cameron and Puleo \\cite{Ca} showed that $\\mathrm{sat}(n,K_1 \\vee F)\\le n-1+\\mathrm{sat}(n-1, F)$ for all $n > |V(F)|$. A natural question is to ask when the above equality holds. Existing results for $\\mathrm{sat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.22011","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/2606.22011/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":"2606.22011","created_at":"2026-06-23T02:13:05.513543+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.22011v1","created_at":"2026-06-23T02:13:05.513543+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.22011","created_at":"2026-06-23T02:13:05.513543+00:00"},{"alias_kind":"pith_short_12","alias_value":"UPY6OK5KCQM7","created_at":"2026-06-23T02:13:05.513543+00:00"},{"alias_kind":"pith_short_16","alias_value":"UPY6OK5KCQM7DXKM","created_at":"2026-06-23T02:13:05.513543+00:00"},{"alias_kind":"pith_short_8","alias_value":"UPY6OK5K","created_at":"2026-06-23T02:13:05.513543+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/UPY6OK5KCQM7DXKMAXPKM3ZEUL","json":"https://pith.science/pith/UPY6OK5KCQM7DXKMAXPKM3ZEUL.json","graph_json":"https://pith.science/api/pith-number/UPY6OK5KCQM7DXKMAXPKM3ZEUL/graph.json","events_json":"https://pith.science/api/pith-number/UPY6OK5KCQM7DXKMAXPKM3ZEUL/events.json","paper":"https://pith.science/paper/UPY6OK5K"},"agent_actions":{"view_html":"https://pith.science/pith/UPY6OK5KCQM7DXKMAXPKM3ZEUL","download_json":"https://pith.science/pith/UPY6OK5KCQM7DXKMAXPKM3ZEUL.json","view_paper":"https://pith.science/paper/UPY6OK5K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.22011&json=true","fetch_graph":"https://pith.science/api/pith-number/UPY6OK5KCQM7DXKMAXPKM3ZEUL/graph.json","fetch_events":"https://pith.science/api/pith-number/UPY6OK5KCQM7DXKMAXPKM3ZEUL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UPY6OK5KCQM7DXKMAXPKM3ZEUL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UPY6OK5KCQM7DXKMAXPKM3ZEUL/action/storage_attestation","attest_author":"https://pith.science/pith/UPY6OK5KCQM7DXKMAXPKM3ZEUL/action/author_attestation","sign_citation":"https://pith.science/pith/UPY6OK5KCQM7DXKMAXPKM3ZEUL/action/citation_signature","submit_replication":"https://pith.science/pith/UPY6OK5KCQM7DXKMAXPKM3ZEUL/action/replication_record"}},"created_at":"2026-06-23T02:13:05.513543+00:00","updated_at":"2026-06-23T02:13:05.513543+00:00"}