{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LCSZ72PTSFCZ6HUMRATVC5ZW75","short_pith_number":"pith:LCSZ72PT","schema_version":"1.0","canonical_sha256":"58a59fe9f391459f1e8c8827517736ff5f5e22090e4e360808781bf01307b705","source":{"kind":"arxiv","id":"1810.00939","version":2},"attestation_state":"computed","paper":{"title":"Few $T$ copies in $H$-saturated graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abhishek Methuku, Craig Timmons, J\\\"urgen Kritschgau, Michael Tait","submitted_at":"2018-10-01T19:52:37Z","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"},"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":"1810.00939","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-01T19:52:37Z","cross_cats_sorted":[],"title_canon_sha256":"99ab32b26994a73dfff04b78ac7c9dc5b466f3da060ccffd9b0ffd8052c418ce","abstract_canon_sha256":"f15fbbdcefd3c2e1ed5b8a829fa04e8b44c00845f51d317a9273f9ba327aa59c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:24.049665Z","signature_b64":"+PhEgKJ3avXPnHkQ6hOr/OMFLsMpNFoKxLtZ3tumomiJqudhjTNqJ8m/9dHRvnLDCmzycaziJv6d1IjDFZkiCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58a59fe9f391459f1e8c8827517736ff5f5e22090e4e360808781bf01307b705","last_reissued_at":"2026-05-18T00:03:24.049066Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:24.049066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Few $T$ copies in $H$-saturated graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abhishek Methuku, Craig Timmons, J\\\"urgen Kritschgau, Michael Tait","submitted_at":"2018-10-01T19:52:37Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.00939","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":""},"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":"1810.00939","created_at":"2026-05-18T00:03:24.049159+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.00939v2","created_at":"2026-05-18T00:03:24.049159+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.00939","created_at":"2026-05-18T00:03:24.049159+00:00"},{"alias_kind":"pith_short_12","alias_value":"LCSZ72PTSFCZ","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LCSZ72PTSFCZ6HUM","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LCSZ72PT","created_at":"2026-05-18T12:32:37.024351+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/LCSZ72PTSFCZ6HUMRATVC5ZW75","json":"https://pith.science/pith/LCSZ72PTSFCZ6HUMRATVC5ZW75.json","graph_json":"https://pith.science/api/pith-number/LCSZ72PTSFCZ6HUMRATVC5ZW75/graph.json","events_json":"https://pith.science/api/pith-number/LCSZ72PTSFCZ6HUMRATVC5ZW75/events.json","paper":"https://pith.science/paper/LCSZ72PT"},"agent_actions":{"view_html":"https://pith.science/pith/LCSZ72PTSFCZ6HUMRATVC5ZW75","download_json":"https://pith.science/pith/LCSZ72PTSFCZ6HUMRATVC5ZW75.json","view_paper":"https://pith.science/paper/LCSZ72PT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.00939&json=true","fetch_graph":"https://pith.science/api/pith-number/LCSZ72PTSFCZ6HUMRATVC5ZW75/graph.json","fetch_events":"https://pith.science/api/pith-number/LCSZ72PTSFCZ6HUMRATVC5ZW75/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LCSZ72PTSFCZ6HUMRATVC5ZW75/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LCSZ72PTSFCZ6HUMRATVC5ZW75/action/storage_attestation","attest_author":"https://pith.science/pith/LCSZ72PTSFCZ6HUMRATVC5ZW75/action/author_attestation","sign_citation":"https://pith.science/pith/LCSZ72PTSFCZ6HUMRATVC5ZW75/action/citation_signature","submit_replication":"https://pith.science/pith/LCSZ72PTSFCZ6HUMRATVC5ZW75/action/replication_record"}},"created_at":"2026-05-18T00:03:24.049159+00:00","updated_at":"2026-05-18T00:03:24.049159+00:00"}