{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LCSZ72PTSFCZ6HUMRATVC5ZW75","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":"f15fbbdcefd3c2e1ed5b8a829fa04e8b44c00845f51d317a9273f9ba327aa59c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-01T19:52:37Z","title_canon_sha256":"99ab32b26994a73dfff04b78ac7c9dc5b466f3da060ccffd9b0ffd8052c418ce"},"schema_version":"1.0","source":{"id":"1810.00939","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.00939","created_at":"2026-05-18T00:03:24Z"},{"alias_kind":"arxiv_version","alias_value":"1810.00939v2","created_at":"2026-05-18T00:03:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.00939","created_at":"2026-05-18T00:03:24Z"},{"alias_kind":"pith_short_12","alias_value":"LCSZ72PTSFCZ","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LCSZ72PTSFCZ6HUM","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LCSZ72PT","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:c148ecee21aafd3127c820567b8b44e0f33638a834c011ebb1de47bd5e759a45","target":"graph","created_at":"2026-05-18T00:03:24Z","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"},"paper":{"abstract_excerpt":"A graph is $F$-saturated if it is $F$-free but the addition of any edge creates a copy of $F$. In this paper we study the quantity $\\mathrm{sat}(n, H, F)$ which denotes the minimum number of copies of $H$ that an $F$-saturated graph on $n$ vertices may contain. This parameter is a natural saturation analogue of Alon and Shikhelman's generalized Tur\\'an problem, and letting $H = K_2$ recovers the well-studied saturation function. We provide a first investigation into this general function focusing on the cases where the host graph is either $K_s$ or $C_k$-saturated. Some representative interest","authors_text":"Abhishek Methuku, Craig Timmons, J\\\"urgen Kritschgau, Michael Tait","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-01T19:52:37Z","title":"Few $T$ copies in $H$-saturated graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.00939","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:60f8a7f2ee7de4fe3c4ad1005de3ff4af7d61720414c05c374e6a414e967416c","target":"record","created_at":"2026-05-18T00:03:24Z","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":"f15fbbdcefd3c2e1ed5b8a829fa04e8b44c00845f51d317a9273f9ba327aa59c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-01T19:52:37Z","title_canon_sha256":"99ab32b26994a73dfff04b78ac7c9dc5b466f3da060ccffd9b0ffd8052c418ce"},"schema_version":"1.0","source":{"id":"1810.00939","kind":"arxiv","version":2}},"canonical_sha256":"58a59fe9f391459f1e8c8827517736ff5f5e22090e4e360808781bf01307b705","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"58a59fe9f391459f1e8c8827517736ff5f5e22090e4e360808781bf01307b705","first_computed_at":"2026-05-18T00:03:24.049066Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:24.049066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+PhEgKJ3avXPnHkQ6hOr/OMFLsMpNFoKxLtZ3tumomiJqudhjTNqJ8m/9dHRvnLDCmzycaziJv6d1IjDFZkiCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:24.049665Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.00939","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:60f8a7f2ee7de4fe3c4ad1005de3ff4af7d61720414c05c374e6a414e967416c","sha256:c148ecee21aafd3127c820567b8b44e0f33638a834c011ebb1de47bd5e759a45"],"state_sha256":"1acbfb4f47b08746c9fa06343ab7895c97cfc52d7b2e602f596b4fba07a3bc93"}