{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:UPY6OK5KCQM7DXKMAXPKM3ZEUL","short_pith_number":"pith:UPY6OK5K","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"},"canonical_sha256":"a3f1e72baa1419f1dd4c05dea66f24a2c7e6e23895cb4cc7044919d17501d2ee","source":{"kind":"arxiv","id":"2606.22011","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.22011","created_at":"2026-06-23T02:13:05Z"},{"alias_kind":"arxiv_version","alias_value":"2606.22011v1","created_at":"2026-06-23T02:13:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.22011","created_at":"2026-06-23T02:13:05Z"},{"alias_kind":"pith_short_12","alias_value":"UPY6OK5KCQM7","created_at":"2026-06-23T02:13:05Z"},{"alias_kind":"pith_short_16","alias_value":"UPY6OK5KCQM7DXKM","created_at":"2026-06-23T02:13:05Z"},{"alias_kind":"pith_short_8","alias_value":"UPY6OK5K","created_at":"2026-06-23T02:13:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:UPY6OK5KCQM7DXKMAXPKM3ZEUL","target":"record","payload":{"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"},"canonical_sha256":"a3f1e72baa1419f1dd4c05dea66f24a2c7e6e23895cb4cc7044919d17501d2ee","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"},"source_kind":"arxiv","source_id":"2606.22011","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-23T02:13:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oXVhUEGV8rX8uXQtcbtw4r9udjpXJV6DHuNP9v9FKtq2eS0x//Gpn4hOtt2p4Cr5oKVkdwwaMWgLUZM/mIWWBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T23:43:53.205016Z"},"content_sha256":"c8accb1883c1fe7ff745878a10ac0cc3b2313ed0a5b351f4249f1e7a3435d5f3","schema_version":"1.0","event_id":"sha256:c8accb1883c1fe7ff745878a10ac0cc3b2313ed0a5b351f4249f1e7a3435d5f3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:UPY6OK5KCQM7DXKMAXPKM3ZEUL","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-23T02:13:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"df4iswksY2tKcDAipxZSlvz8g3u8TA6xFBUTR3R7Vb07oPXJofIF1dAwtvf7oihQvwpQp8MFzYw91f1Q2qNFCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T23:43:53.205393Z"},"content_sha256":"02b797d25c3f49ec880c9fd9d8710777b2f4951dd3e8e34bbbb439794b774066","schema_version":"1.0","event_id":"sha256:02b797d25c3f49ec880c9fd9d8710777b2f4951dd3e8e34bbbb439794b774066"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UPY6OK5KCQM7DXKMAXPKM3ZEUL/bundle.json","state_url":"https://pith.science/pith/UPY6OK5KCQM7DXKMAXPKM3ZEUL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UPY6OK5KCQM7DXKMAXPKM3ZEUL/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-04T23:43:53Z","links":{"resolver":"https://pith.science/pith/UPY6OK5KCQM7DXKMAXPKM3ZEUL","bundle":"https://pith.science/pith/UPY6OK5KCQM7DXKMAXPKM3ZEUL/bundle.json","state":"https://pith.science/pith/UPY6OK5KCQM7DXKMAXPKM3ZEUL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UPY6OK5KCQM7DXKMAXPKM3ZEUL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:UPY6OK5KCQM7DXKMAXPKM3ZEUL","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"07632d2d998c6f81d9675241d0548c62bf6b4456808e76548c13dda2a7344cd1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-20T12:20:03Z","title_canon_sha256":"725512b5c539d351fe3963390dd403b4ba3cbc106ef51aed7b7fa8eab4ddf09e"},"schema_version":"1.0","source":{"id":"2606.22011","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.22011","created_at":"2026-06-23T02:13:05Z"},{"alias_kind":"arxiv_version","alias_value":"2606.22011v1","created_at":"2026-06-23T02:13:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.22011","created_at":"2026-06-23T02:13:05Z"},{"alias_kind":"pith_short_12","alias_value":"UPY6OK5KCQM7","created_at":"2026-06-23T02:13:05Z"},{"alias_kind":"pith_short_16","alias_value":"UPY6OK5KCQM7DXKM","created_at":"2026-06-23T02:13:05Z"},{"alias_kind":"pith_short_8","alias_value":"UPY6OK5K","created_at":"2026-06-23T02:13:05Z"}],"graph_snapshots":[{"event_id":"sha256:02b797d25c3f49ec880c9fd9d8710777b2f4951dd3e8e34bbbb439794b774066","target":"graph","created_at":"2026-06-23T02:13:05Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.22011/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Xinying Hua, Yuejian Peng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-20T12:20:03Z","title":"Saturation numbers for joins of graphs and characterization of extremal graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.22011","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c8accb1883c1fe7ff745878a10ac0cc3b2313ed0a5b351f4249f1e7a3435d5f3","target":"record","created_at":"2026-06-23T02:13:05Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"07632d2d998c6f81d9675241d0548c62bf6b4456808e76548c13dda2a7344cd1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-20T12:20:03Z","title_canon_sha256":"725512b5c539d351fe3963390dd403b4ba3cbc106ef51aed7b7fa8eab4ddf09e"},"schema_version":"1.0","source":{"id":"2606.22011","kind":"arxiv","version":1}},"canonical_sha256":"a3f1e72baa1419f1dd4c05dea66f24a2c7e6e23895cb4cc7044919d17501d2ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a3f1e72baa1419f1dd4c05dea66f24a2c7e6e23895cb4cc7044919d17501d2ee","first_computed_at":"2026-06-23T02:13:05.513480Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-23T02:13:05.513480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E7IwQPmcuCVjDMmPBXNOCsjOAIUdGRyEJnTZ8WKylAfvBukZrOfgQXSnAwcwThDDGNB/kYBpUUwruShnpua4Bg==","signature_status":"signed_v1","signed_at":"2026-06-23T02:13:05.513835Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.22011","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c8accb1883c1fe7ff745878a10ac0cc3b2313ed0a5b351f4249f1e7a3435d5f3","sha256:02b797d25c3f49ec880c9fd9d8710777b2f4951dd3e8e34bbbb439794b774066"],"state_sha256":"fcc7fb1316635325ded5d6ed0dccd7329da913cf96a0738f5bf2077afb017a89"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dmptQTAHxUYLduls1zeM2P5nIOFs2ATC3Qhyh+EM1NxVF+RFBfbERNpZaat762ys50kNSw39USSdTSruC0x/Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T23:43:53.207388Z","bundle_sha256":"7f34c151c69ceb39614c4e8be71354ef7e9447c5fccf202a93f8b8cbab90806e"}}