{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:7OPZZHVA3USOGBKMOYIXHCEAHD","short_pith_number":"pith:7OPZZHVA","schema_version":"1.0","canonical_sha256":"fb9f9c9ea0dd24e3054c761173888038c1081ad3e41ffec9e4d96807e3837564","source":{"kind":"arxiv","id":"2606.22006","version":1},"attestation_state":"computed","paper":{"title":"Saturation numbers of some joins of 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:11:19Z","abstract_excerpt":"Let $H$ be a graph. A graph $G$ is $H$-saturated if $G$ is $H$-free, but adding any edge between two non-adjacent vertices of $G$ yields an $H$-copy as a subgraph. The saturation number $\\mathrm{sat}(n, H)$ is the minimum number of edges in an $H$-saturated graph on $n$ vertices. The saturation number for the join of a vertex and a graph $F$, denoted by $K_1\\vee F$, has attracted considerable attention. Cameron and Puleo \\cite{Ca} proved that $\\mathrm{sat}(n,K_1 \\vee F)\\le n-1+\\mathrm{sat}(n-1, F)$ for $n > |V(F)|$. A natural question is when the above equality holds. Most existing results imp"},"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.22006","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-20T12:11:19Z","cross_cats_sorted":[],"title_canon_sha256":"b968d091e0401b3de0b14eef9a7facfaec6e10ae1303a75a3bf89acbff767e30","abstract_canon_sha256":"1f088674349c253b66360f57fa18a2ece8fc3713ca0fbe76fdeeec18dddf4fc3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T02:13:05.434022Z","signature_b64":"pFHjUJ20yaVNfyJxvk2DKWiFGcn8u8w8xEOOuy3Zf2CxA7tIdCauOSYIsSD+abvcL1s3hF+Hc0Cbfv+2HB4gBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb9f9c9ea0dd24e3054c761173888038c1081ad3e41ffec9e4d96807e3837564","last_reissued_at":"2026-06-23T02:13:05.433685Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T02:13:05.433685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Saturation numbers of some joins of 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:11:19Z","abstract_excerpt":"Let $H$ be a graph. A graph $G$ is $H$-saturated if $G$ is $H$-free, but adding any edge between two non-adjacent vertices of $G$ yields an $H$-copy as a subgraph. The saturation number $\\mathrm{sat}(n, H)$ is the minimum number of edges in an $H$-saturated graph on $n$ vertices. The saturation number for the join of a vertex and a graph $F$, denoted by $K_1\\vee F$, has attracted considerable attention. Cameron and Puleo \\cite{Ca} proved that $\\mathrm{sat}(n,K_1 \\vee F)\\le n-1+\\mathrm{sat}(n-1, F)$ for $n > |V(F)|$. A natural question is when the above equality holds. Most existing results imp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.22006","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.22006/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.22006","created_at":"2026-06-23T02:13:05.433742+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.22006v1","created_at":"2026-06-23T02:13:05.433742+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.22006","created_at":"2026-06-23T02:13:05.433742+00:00"},{"alias_kind":"pith_short_12","alias_value":"7OPZZHVA3USO","created_at":"2026-06-23T02:13:05.433742+00:00"},{"alias_kind":"pith_short_16","alias_value":"7OPZZHVA3USOGBKM","created_at":"2026-06-23T02:13:05.433742+00:00"},{"alias_kind":"pith_short_8","alias_value":"7OPZZHVA","created_at":"2026-06-23T02:13:05.433742+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/7OPZZHVA3USOGBKMOYIXHCEAHD","json":"https://pith.science/pith/7OPZZHVA3USOGBKMOYIXHCEAHD.json","graph_json":"https://pith.science/api/pith-number/7OPZZHVA3USOGBKMOYIXHCEAHD/graph.json","events_json":"https://pith.science/api/pith-number/7OPZZHVA3USOGBKMOYIXHCEAHD/events.json","paper":"https://pith.science/paper/7OPZZHVA"},"agent_actions":{"view_html":"https://pith.science/pith/7OPZZHVA3USOGBKMOYIXHCEAHD","download_json":"https://pith.science/pith/7OPZZHVA3USOGBKMOYIXHCEAHD.json","view_paper":"https://pith.science/paper/7OPZZHVA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.22006&json=true","fetch_graph":"https://pith.science/api/pith-number/7OPZZHVA3USOGBKMOYIXHCEAHD/graph.json","fetch_events":"https://pith.science/api/pith-number/7OPZZHVA3USOGBKMOYIXHCEAHD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7OPZZHVA3USOGBKMOYIXHCEAHD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7OPZZHVA3USOGBKMOYIXHCEAHD/action/storage_attestation","attest_author":"https://pith.science/pith/7OPZZHVA3USOGBKMOYIXHCEAHD/action/author_attestation","sign_citation":"https://pith.science/pith/7OPZZHVA3USOGBKMOYIXHCEAHD/action/citation_signature","submit_replication":"https://pith.science/pith/7OPZZHVA3USOGBKMOYIXHCEAHD/action/replication_record"}},"created_at":"2026-06-23T02:13:05.433742+00:00","updated_at":"2026-06-23T02:13:05.433742+00:00"}