{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LCSZ72PTSFCZ6HUMRATVC5ZW75","short_pith_number":"pith:LCSZ72PT","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"},"canonical_sha256":"58a59fe9f391459f1e8c8827517736ff5f5e22090e4e360808781bf01307b705","source":{"kind":"arxiv","id":"1810.00939","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LCSZ72PTSFCZ6HUMRATVC5ZW75","target":"record","payload":{"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"},"canonical_sha256":"58a59fe9f391459f1e8c8827517736ff5f5e22090e4e360808781bf01307b705","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"},"source_kind":"arxiv","source_id":"1810.00939","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-05-18T00:03:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2l8pRLjLjAZaymHNevzaM76bvPtcXYNlEp//3kncTcBUhFHXGN5nXomYALelNEwbUqywxudRtxXSICZLxwl8Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:22:10.290241Z"},"content_sha256":"60f8a7f2ee7de4fe3c4ad1005de3ff4af7d61720414c05c374e6a414e967416c","schema_version":"1.0","event_id":"sha256:60f8a7f2ee7de4fe3c4ad1005de3ff4af7d61720414c05c374e6a414e967416c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LCSZ72PTSFCZ6HUMRATVC5ZW75","target":"graph","payload":{"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"},"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-05-18T00:03:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"boNaxZ+ZthCX69AMtVI+qPqkaI13ZywSkACFR+vJ8HwoJzUg/sK8YkF0c/qcFgHupdmFiC1yW9D4eDXVKtxXDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:22:10.290876Z"},"content_sha256":"c148ecee21aafd3127c820567b8b44e0f33638a834c011ebb1de47bd5e759a45","schema_version":"1.0","event_id":"sha256:c148ecee21aafd3127c820567b8b44e0f33638a834c011ebb1de47bd5e759a45"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LCSZ72PTSFCZ6HUMRATVC5ZW75/bundle.json","state_url":"https://pith.science/pith/LCSZ72PTSFCZ6HUMRATVC5ZW75/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LCSZ72PTSFCZ6HUMRATVC5ZW75/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-06-02T13:22:10Z","links":{"resolver":"https://pith.science/pith/LCSZ72PTSFCZ6HUMRATVC5ZW75","bundle":"https://pith.science/pith/LCSZ72PTSFCZ6HUMRATVC5ZW75/bundle.json","state":"https://pith.science/pith/LCSZ72PTSFCZ6HUMRATVC5ZW75/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LCSZ72PTSFCZ6HUMRATVC5ZW75/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S/wAkXZDlLIVU+yJTlRTbtFi+UdQ71XNvAqoYYytQ6UyNwjMRSvc1P6h3ZdR/Xdr1JvhlLMq7tzOBZHnRH9/Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T13:22:10.293918Z","bundle_sha256":"6cf51b72bced7027e33949f58828f16982b1c4c6e1d147c4946eddf7d413c71f"}}