{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3YWJMNDYJ6RDZLNWOL6VGFIQZI","short_pith_number":"pith:3YWJMNDY","canonical_record":{"source":{"id":"1906.02154","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-05T17:25:45Z","cross_cats_sorted":[],"title_canon_sha256":"5690787eda242ddd7a57d39c75d46d8d22857c8aa5c8841298f98d202f985da9","abstract_canon_sha256":"99028de74f298886d012fa588086ff73d8f470feab32f1d00e800d459b2c4266"},"schema_version":"1.0"},"canonical_sha256":"de2c9634784fa23cadb672fd531510ca2a32f62c80c9c1be2c2e73d96c2062f9","source":{"kind":"arxiv","id":"1906.02154","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.02154","created_at":"2026-05-17T23:44:05Z"},{"alias_kind":"arxiv_version","alias_value":"1906.02154v1","created_at":"2026-05-17T23:44:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.02154","created_at":"2026-05-17T23:44:05Z"},{"alias_kind":"pith_short_12","alias_value":"3YWJMNDYJ6RD","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"3YWJMNDYJ6RDZLNW","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"3YWJMNDY","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3YWJMNDYJ6RDZLNWOL6VGFIQZI","target":"record","payload":{"canonical_record":{"source":{"id":"1906.02154","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-05T17:25:45Z","cross_cats_sorted":[],"title_canon_sha256":"5690787eda242ddd7a57d39c75d46d8d22857c8aa5c8841298f98d202f985da9","abstract_canon_sha256":"99028de74f298886d012fa588086ff73d8f470feab32f1d00e800d459b2c4266"},"schema_version":"1.0"},"canonical_sha256":"de2c9634784fa23cadb672fd531510ca2a32f62c80c9c1be2c2e73d96c2062f9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:05.139728Z","signature_b64":"lSKevIlSppEQlWX7nlcw7+AtvPSw8S+K4FflNeXggAN/LJF969fT/PC8PVR9pFdgH+WUbRLnMari1UvfqsF+Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de2c9634784fa23cadb672fd531510ca2a32f62c80c9c1be2c2e73d96c2062f9","last_reissued_at":"2026-05-17T23:44:05.139243Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:05.139243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.02154","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-05-17T23:44:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XZqj2aZo5+cVu6BRHdMqBWnW15AEwD/YM/pv6Ahk9Ce1Yi7pW4WLLAcScszxh9S+cf+Mlk5FzxO2GBYNSOleAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T11:30:28.153138Z"},"content_sha256":"b510caf5c2a99c0d1ef341a8015096ffdc82f6567d45583153042d77c802c805","schema_version":"1.0","event_id":"sha256:b510caf5c2a99c0d1ef341a8015096ffdc82f6567d45583153042d77c802c805"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3YWJMNDYJ6RDZLNWOL6VGFIQZI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Triangles in $K_s$-saturated graphs with minimum degree $t$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Albert Curry, Benjamin Cole, Craig Timmons, David Davini","submitted_at":"2019-06-05T17:25:45Z","abstract_excerpt":"For $n \\geq 15$, we prove that the minimum number of triangles in an $n$-vertex $K_4$-saturated graph with minimum degree 4 is exactly $2n-4$, and that there is a unique extremal graph. This is a triangle version of a result of Alon, Erd\\H{o}s, Holzman, and Krivelevich from 1996. Additionally, we show that for any $s > r \\geq 3$ and $t \\geq 2 (s-2)+1$, there is a $K_s$-saturated $n$-vertex graph with minimum degree $t$ that has $\\binom{ s-2}{r-1}2^{r-1} n + c_{s,r,t}$ copies of $K_r$. This shows that unlike the number of edges, the number of $K_r$'s ($r >2$) in a $K_s$-saturated graph is not f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.02154","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":""},"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-17T23:44:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oUIeEvztmTg818OZ029ktFcw6BNZ8z4XjYXyS2uvnlHUlmC5Lsin5JgVQb4iNcEo+aauzPQqfj6hdZ0cHXn1CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T11:30:28.153500Z"},"content_sha256":"a59c815265e7359117e2c0d76955c042549aff7c60432145545817dd9bc57e31","schema_version":"1.0","event_id":"sha256:a59c815265e7359117e2c0d76955c042549aff7c60432145545817dd9bc57e31"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3YWJMNDYJ6RDZLNWOL6VGFIQZI/bundle.json","state_url":"https://pith.science/pith/3YWJMNDYJ6RDZLNWOL6VGFIQZI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3YWJMNDYJ6RDZLNWOL6VGFIQZI/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-03T11:30:28Z","links":{"resolver":"https://pith.science/pith/3YWJMNDYJ6RDZLNWOL6VGFIQZI","bundle":"https://pith.science/pith/3YWJMNDYJ6RDZLNWOL6VGFIQZI/bundle.json","state":"https://pith.science/pith/3YWJMNDYJ6RDZLNWOL6VGFIQZI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3YWJMNDYJ6RDZLNWOL6VGFIQZI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3YWJMNDYJ6RDZLNWOL6VGFIQZI","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":"99028de74f298886d012fa588086ff73d8f470feab32f1d00e800d459b2c4266","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-05T17:25:45Z","title_canon_sha256":"5690787eda242ddd7a57d39c75d46d8d22857c8aa5c8841298f98d202f985da9"},"schema_version":"1.0","source":{"id":"1906.02154","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.02154","created_at":"2026-05-17T23:44:05Z"},{"alias_kind":"arxiv_version","alias_value":"1906.02154v1","created_at":"2026-05-17T23:44:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.02154","created_at":"2026-05-17T23:44:05Z"},{"alias_kind":"pith_short_12","alias_value":"3YWJMNDYJ6RD","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"3YWJMNDYJ6RDZLNW","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"3YWJMNDY","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:a59c815265e7359117e2c0d76955c042549aff7c60432145545817dd9bc57e31","target":"graph","created_at":"2026-05-17T23:44: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"},"paper":{"abstract_excerpt":"For $n \\geq 15$, we prove that the minimum number of triangles in an $n$-vertex $K_4$-saturated graph with minimum degree 4 is exactly $2n-4$, and that there is a unique extremal graph. This is a triangle version of a result of Alon, Erd\\H{o}s, Holzman, and Krivelevich from 1996. Additionally, we show that for any $s > r \\geq 3$ and $t \\geq 2 (s-2)+1$, there is a $K_s$-saturated $n$-vertex graph with minimum degree $t$ that has $\\binom{ s-2}{r-1}2^{r-1} n + c_{s,r,t}$ copies of $K_r$. This shows that unlike the number of edges, the number of $K_r$'s ($r >2$) in a $K_s$-saturated graph is not f","authors_text":"Albert Curry, Benjamin Cole, Craig Timmons, David Davini","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-05T17:25:45Z","title":"Triangles in $K_s$-saturated graphs with minimum degree $t$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.02154","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:b510caf5c2a99c0d1ef341a8015096ffdc82f6567d45583153042d77c802c805","target":"record","created_at":"2026-05-17T23:44: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":"99028de74f298886d012fa588086ff73d8f470feab32f1d00e800d459b2c4266","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-05T17:25:45Z","title_canon_sha256":"5690787eda242ddd7a57d39c75d46d8d22857c8aa5c8841298f98d202f985da9"},"schema_version":"1.0","source":{"id":"1906.02154","kind":"arxiv","version":1}},"canonical_sha256":"de2c9634784fa23cadb672fd531510ca2a32f62c80c9c1be2c2e73d96c2062f9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de2c9634784fa23cadb672fd531510ca2a32f62c80c9c1be2c2e73d96c2062f9","first_computed_at":"2026-05-17T23:44:05.139243Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:05.139243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lSKevIlSppEQlWX7nlcw7+AtvPSw8S+K4FflNeXggAN/LJF969fT/PC8PVR9pFdgH+WUbRLnMari1UvfqsF+Ag==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:05.139728Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.02154","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b510caf5c2a99c0d1ef341a8015096ffdc82f6567d45583153042d77c802c805","sha256:a59c815265e7359117e2c0d76955c042549aff7c60432145545817dd9bc57e31"],"state_sha256":"f189313c21576a3436b15dcff41f53dab3bfc94b380216a15723d8cbda62879c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lxkyelmx+PCAySbPH6CKJq1uD3CeU62T9BXN/CTiWeQ4JWS4kPVARfEEz1FcAmPwFQ/wv1ZVqRyxT4NgAf1MAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T11:30:28.155542Z","bundle_sha256":"a933c9048a396006b6bf4826d677ff23c03f4c8c35c833760d4983aef3475367"}}