{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:MDIVNUVNCL6QL2EG5XE3HBU7SJ","short_pith_number":"pith:MDIVNUVN","canonical_record":{"source":{"id":"2201.03983","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-01-11T14:59:59Z","cross_cats_sorted":[],"title_canon_sha256":"2a9897ce3b8df9b307805cbcb70f55fc156a2133fca9d40a1ac366c9147cb775","abstract_canon_sha256":"d414b0b1069f4e94a5c316c1b36bcd688b20ad47fe21dae8bf77aab7e3fa3bf7"},"schema_version":"1.0"},"canonical_sha256":"60d156d2ad12fd05e886edc9b3869f9265ce3350a8827e36987578f0f3e01c7b","source":{"kind":"arxiv","id":"2201.03983","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.03983","created_at":"2026-07-05T03:48:11Z"},{"alias_kind":"arxiv_version","alias_value":"2201.03983v2","created_at":"2026-07-05T03:48:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.03983","created_at":"2026-07-05T03:48:11Z"},{"alias_kind":"pith_short_12","alias_value":"MDIVNUVNCL6Q","created_at":"2026-07-05T03:48:11Z"},{"alias_kind":"pith_short_16","alias_value":"MDIVNUVNCL6QL2EG","created_at":"2026-07-05T03:48:11Z"},{"alias_kind":"pith_short_8","alias_value":"MDIVNUVN","created_at":"2026-07-05T03:48:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:MDIVNUVNCL6QL2EG5XE3HBU7SJ","target":"record","payload":{"canonical_record":{"source":{"id":"2201.03983","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-01-11T14:59:59Z","cross_cats_sorted":[],"title_canon_sha256":"2a9897ce3b8df9b307805cbcb70f55fc156a2133fca9d40a1ac366c9147cb775","abstract_canon_sha256":"d414b0b1069f4e94a5c316c1b36bcd688b20ad47fe21dae8bf77aab7e3fa3bf7"},"schema_version":"1.0"},"canonical_sha256":"60d156d2ad12fd05e886edc9b3869f9265ce3350a8827e36987578f0f3e01c7b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:48:11.055814Z","signature_b64":"6R9nZ4lKrPhVvxW/RorRYerEDBufZ+KyT6CePSDCqhizJ4aF/GeOhwisr+nBuHvIM/6XMlqpb0ibd85k5drWDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60d156d2ad12fd05e886edc9b3869f9265ce3350a8827e36987578f0f3e01c7b","last_reissued_at":"2026-07-05T03:48:11.055338Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:48:11.055338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2201.03983","source_version":2,"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-07-05T03:48:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cmD2OriDLhBqC0EDdPWG7BqTBmtNvravwkA8LqO3lDl3JoEK4EbUEtcWe5HtagP57HKEnA/TManHtmfFu6h5Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T15:13:18.444058Z"},"content_sha256":"32e8e56c536a9a7b2c0c32794397304a59210f5ef016e2a983a75da825ca5169","schema_version":"1.0","event_id":"sha256:32e8e56c536a9a7b2c0c32794397304a59210f5ef016e2a983a75da825ca5169"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:MDIVNUVNCL6QL2EG5XE3HBU7SJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The minimum number of clique-saturating edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fuhong Ma, Jialin He, Jie Ma, Xinyang Ye","submitted_at":"2022-01-11T14:59:59Z","abstract_excerpt":"Let $G$ be a $K_p$-free graph. We say $e$ is a $K_p$-saturating edge of $G$ if $e\\notin E(G)$ and $G+e$ contains a copy of $K_p$. Denote by $f_p(n, e)$ the minimum number of $K_p$-saturating edges that an $n$-vertex $K_p$-free graph with $e$ edges can have. Erd\\H{o}s and Tuza conjectured that $f_4(n,\\lfloor n^2/4\\rfloor+1)=\\left(1 + o(1)\\right)\\frac{n^2}{16}.$ Balogh and Liu disproved this by showing $f_4(n,\\lfloor n^2/4\\rfloor+1)=(1+o(1))\\frac{2n^2}{33}$. They believed that a natural generalization of their construction for $K_p$-free graph should also be optimal and made a conjecture that $f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.03983","kind":"arxiv","version":2},"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/2201.03983/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-07-05T03:48:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vzZbJM1djNcpwAQj8zBEiMjjbjv2uyz5gdHvEQG5vMhfImG4TC4XY8cU8SO7suDJyil38Rr5Gn+n23Xzu4ewDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T15:13:18.444548Z"},"content_sha256":"4e27e48dbaf3bf18be5517c0b6e5773fbf70f8da476df7ced124cc478ec8bf24","schema_version":"1.0","event_id":"sha256:4e27e48dbaf3bf18be5517c0b6e5773fbf70f8da476df7ced124cc478ec8bf24"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MDIVNUVNCL6QL2EG5XE3HBU7SJ/bundle.json","state_url":"https://pith.science/pith/MDIVNUVNCL6QL2EG5XE3HBU7SJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MDIVNUVNCL6QL2EG5XE3HBU7SJ/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-08-14T15:13:18Z","links":{"resolver":"https://pith.science/pith/MDIVNUVNCL6QL2EG5XE3HBU7SJ","bundle":"https://pith.science/pith/MDIVNUVNCL6QL2EG5XE3HBU7SJ/bundle.json","state":"https://pith.science/pith/MDIVNUVNCL6QL2EG5XE3HBU7SJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MDIVNUVNCL6QL2EG5XE3HBU7SJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:MDIVNUVNCL6QL2EG5XE3HBU7SJ","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":"d414b0b1069f4e94a5c316c1b36bcd688b20ad47fe21dae8bf77aab7e3fa3bf7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-01-11T14:59:59Z","title_canon_sha256":"2a9897ce3b8df9b307805cbcb70f55fc156a2133fca9d40a1ac366c9147cb775"},"schema_version":"1.0","source":{"id":"2201.03983","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.03983","created_at":"2026-07-05T03:48:11Z"},{"alias_kind":"arxiv_version","alias_value":"2201.03983v2","created_at":"2026-07-05T03:48:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.03983","created_at":"2026-07-05T03:48:11Z"},{"alias_kind":"pith_short_12","alias_value":"MDIVNUVNCL6Q","created_at":"2026-07-05T03:48:11Z"},{"alias_kind":"pith_short_16","alias_value":"MDIVNUVNCL6QL2EG","created_at":"2026-07-05T03:48:11Z"},{"alias_kind":"pith_short_8","alias_value":"MDIVNUVN","created_at":"2026-07-05T03:48:11Z"}],"graph_snapshots":[{"event_id":"sha256:4e27e48dbaf3bf18be5517c0b6e5773fbf70f8da476df7ced124cc478ec8bf24","target":"graph","created_at":"2026-07-05T03:48:11Z","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/2201.03983/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $G$ be a $K_p$-free graph. We say $e$ is a $K_p$-saturating edge of $G$ if $e\\notin E(G)$ and $G+e$ contains a copy of $K_p$. Denote by $f_p(n, e)$ the minimum number of $K_p$-saturating edges that an $n$-vertex $K_p$-free graph with $e$ edges can have. Erd\\H{o}s and Tuza conjectured that $f_4(n,\\lfloor n^2/4\\rfloor+1)=\\left(1 + o(1)\\right)\\frac{n^2}{16}.$ Balogh and Liu disproved this by showing $f_4(n,\\lfloor n^2/4\\rfloor+1)=(1+o(1))\\frac{2n^2}{33}$. They believed that a natural generalization of their construction for $K_p$-free graph should also be optimal and made a conjecture that $f","authors_text":"Fuhong Ma, Jialin He, Jie Ma, Xinyang Ye","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-01-11T14:59:59Z","title":"The minimum number of clique-saturating edges"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.03983","kind":"arxiv","version":2},"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:32e8e56c536a9a7b2c0c32794397304a59210f5ef016e2a983a75da825ca5169","target":"record","created_at":"2026-07-05T03:48:11Z","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":"d414b0b1069f4e94a5c316c1b36bcd688b20ad47fe21dae8bf77aab7e3fa3bf7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-01-11T14:59:59Z","title_canon_sha256":"2a9897ce3b8df9b307805cbcb70f55fc156a2133fca9d40a1ac366c9147cb775"},"schema_version":"1.0","source":{"id":"2201.03983","kind":"arxiv","version":2}},"canonical_sha256":"60d156d2ad12fd05e886edc9b3869f9265ce3350a8827e36987578f0f3e01c7b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"60d156d2ad12fd05e886edc9b3869f9265ce3350a8827e36987578f0f3e01c7b","first_computed_at":"2026-07-05T03:48:11.055338Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:48:11.055338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6R9nZ4lKrPhVvxW/RorRYerEDBufZ+KyT6CePSDCqhizJ4aF/GeOhwisr+nBuHvIM/6XMlqpb0ibd85k5drWDw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:48:11.055814Z","signed_message":"canonical_sha256_bytes"},"source_id":"2201.03983","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:32e8e56c536a9a7b2c0c32794397304a59210f5ef016e2a983a75da825ca5169","sha256:4e27e48dbaf3bf18be5517c0b6e5773fbf70f8da476df7ced124cc478ec8bf24"],"state_sha256":"5cefbdbcf8c00cb5c48287eaea32c1dae05efafef690640011b22d1a61788212"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2S6Vhcct3e9/uIHUIoBl/l7xwtTc8Z1oZcEV1djMhdY92xaw6d7kfKuhgUpKss1jKk9aZgLDnClaSliULax5Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T15:13:18.449253Z","bundle_sha256":"8e705447d0236a1f6f7c4bb5ad8511ceccd9bc9a026d87006e41a9a484ea5431"}}