{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:QT2Q4ZI67W2XVPEORNJCFJHD5H","short_pith_number":"pith:QT2Q4ZI6","canonical_record":{"source":{"id":"2310.08081","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-10-12T07:10:22Z","cross_cats_sorted":[],"title_canon_sha256":"2cafd46cfe671970d6590c3a7bb2d127012c25c11821a1ae03d41ebb72f71672","abstract_canon_sha256":"a8defbbab8949d4d4ceeeb63ff6bb83dc1def6770aaa3110970197168104b2cd"},"schema_version":"1.0"},"canonical_sha256":"84f50e651efdb57abc8e8b5222a4e3e9e53265ccce8b11497fe150146d6f722f","source":{"kind":"arxiv","id":"2310.08081","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.08081","created_at":"2026-07-05T07:00:00Z"},{"alias_kind":"arxiv_version","alias_value":"2310.08081v1","created_at":"2026-07-05T07:00:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.08081","created_at":"2026-07-05T07:00:00Z"},{"alias_kind":"pith_short_12","alias_value":"QT2Q4ZI67W2X","created_at":"2026-07-05T07:00:00Z"},{"alias_kind":"pith_short_16","alias_value":"QT2Q4ZI67W2XVPEO","created_at":"2026-07-05T07:00:00Z"},{"alias_kind":"pith_short_8","alias_value":"QT2Q4ZI6","created_at":"2026-07-05T07:00:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:QT2Q4ZI67W2XVPEORNJCFJHD5H","target":"record","payload":{"canonical_record":{"source":{"id":"2310.08081","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-10-12T07:10:22Z","cross_cats_sorted":[],"title_canon_sha256":"2cafd46cfe671970d6590c3a7bb2d127012c25c11821a1ae03d41ebb72f71672","abstract_canon_sha256":"a8defbbab8949d4d4ceeeb63ff6bb83dc1def6770aaa3110970197168104b2cd"},"schema_version":"1.0"},"canonical_sha256":"84f50e651efdb57abc8e8b5222a4e3e9e53265ccce8b11497fe150146d6f722f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:00:00.692020Z","signature_b64":"EMtr5ueircZYPmGHOskzIj2I5hyDXqcV4rMiaO/BcSvGxjQfSnJtquwLfgqTcU9XYG36KVk1pbWfHAEWVlEqAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84f50e651efdb57abc8e8b5222a4e3e9e53265ccce8b11497fe150146d6f722f","last_reissued_at":"2026-07-05T07:00:00.691585Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:00:00.691585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2310.08081","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-07-05T07:00:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mSbV1i2wfqbD5rWzfhICjQKgFcGXRJAP2KdcNWbzD8Ji9xcl8cWMqRj9bGHQDXMhFq6BQcpo1VgMvgDD241ZBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T11:56:05.891980Z"},"content_sha256":"8f3c5ebc634df425f8ba88821760fe4f34bb0d3ded4279098bceb4f08f575d51","schema_version":"1.0","event_id":"sha256:8f3c5ebc634df425f8ba88821760fe4f34bb0d3ded4279098bceb4f08f575d51"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:QT2Q4ZI67W2XVPEORNJCFJHD5H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Supersaturation beyond color-critical graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Ma, Long-tu Yuan","submitted_at":"2023-10-12T07:10:22Z","abstract_excerpt":"The supersaturation problem for a given graph $F$ asks for the minimum number $h_F(n,q)$ of copies of $F$ in an $n$-vertex graph with $ex(n,F)+q$ edges. Subsequent works by Rademacher, Erd\\H{o}s, and Lov\\'{a}sz and Simonovits determine the optimal range of $q$ (which is linear in $n$) for cliques $F$ such that $h_F(n,q)$ equals the minimum number $t_F(n,q)$ of copies of $F$ obtained from a maximum $F$-free $n$-vertex graph by adding $q$ new edges. A breakthrough result of Mubayi extends this line of research from cliques to color-critical graphs $F$, and this was further strengthened by Pikhur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.08081","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2310.08081/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-05T07:00:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HwULj/nkWORZ+okvvkki8cDLNPhm/lM90VB6h5vzMxU+57OZb88KCleJwkOwB1Jyxw4DlM4TEC5m2LnwBv26DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T11:56:05.892892Z"},"content_sha256":"b5afa9cb2c353f12061eba689c5edaa3fd9c417e35322f9a9b8b78845650cdd4","schema_version":"1.0","event_id":"sha256:b5afa9cb2c353f12061eba689c5edaa3fd9c417e35322f9a9b8b78845650cdd4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QT2Q4ZI67W2XVPEORNJCFJHD5H/bundle.json","state_url":"https://pith.science/pith/QT2Q4ZI67W2XVPEORNJCFJHD5H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QT2Q4ZI67W2XVPEORNJCFJHD5H/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-15T11:56:05Z","links":{"resolver":"https://pith.science/pith/QT2Q4ZI67W2XVPEORNJCFJHD5H","bundle":"https://pith.science/pith/QT2Q4ZI67W2XVPEORNJCFJHD5H/bundle.json","state":"https://pith.science/pith/QT2Q4ZI67W2XVPEORNJCFJHD5H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QT2Q4ZI67W2XVPEORNJCFJHD5H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:QT2Q4ZI67W2XVPEORNJCFJHD5H","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":"a8defbbab8949d4d4ceeeb63ff6bb83dc1def6770aaa3110970197168104b2cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-10-12T07:10:22Z","title_canon_sha256":"2cafd46cfe671970d6590c3a7bb2d127012c25c11821a1ae03d41ebb72f71672"},"schema_version":"1.0","source":{"id":"2310.08081","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.08081","created_at":"2026-07-05T07:00:00Z"},{"alias_kind":"arxiv_version","alias_value":"2310.08081v1","created_at":"2026-07-05T07:00:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.08081","created_at":"2026-07-05T07:00:00Z"},{"alias_kind":"pith_short_12","alias_value":"QT2Q4ZI67W2X","created_at":"2026-07-05T07:00:00Z"},{"alias_kind":"pith_short_16","alias_value":"QT2Q4ZI67W2XVPEO","created_at":"2026-07-05T07:00:00Z"},{"alias_kind":"pith_short_8","alias_value":"QT2Q4ZI6","created_at":"2026-07-05T07:00:00Z"}],"graph_snapshots":[{"event_id":"sha256:b5afa9cb2c353f12061eba689c5edaa3fd9c417e35322f9a9b8b78845650cdd4","target":"graph","created_at":"2026-07-05T07:00:00Z","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/2310.08081/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The supersaturation problem for a given graph $F$ asks for the minimum number $h_F(n,q)$ of copies of $F$ in an $n$-vertex graph with $ex(n,F)+q$ edges. Subsequent works by Rademacher, Erd\\H{o}s, and Lov\\'{a}sz and Simonovits determine the optimal range of $q$ (which is linear in $n$) for cliques $F$ such that $h_F(n,q)$ equals the minimum number $t_F(n,q)$ of copies of $F$ obtained from a maximum $F$-free $n$-vertex graph by adding $q$ new edges. A breakthrough result of Mubayi extends this line of research from cliques to color-critical graphs $F$, and this was further strengthened by Pikhur","authors_text":"Jie Ma, Long-tu Yuan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-10-12T07:10:22Z","title":"Supersaturation beyond color-critical graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.08081","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:8f3c5ebc634df425f8ba88821760fe4f34bb0d3ded4279098bceb4f08f575d51","target":"record","created_at":"2026-07-05T07:00:00Z","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":"a8defbbab8949d4d4ceeeb63ff6bb83dc1def6770aaa3110970197168104b2cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-10-12T07:10:22Z","title_canon_sha256":"2cafd46cfe671970d6590c3a7bb2d127012c25c11821a1ae03d41ebb72f71672"},"schema_version":"1.0","source":{"id":"2310.08081","kind":"arxiv","version":1}},"canonical_sha256":"84f50e651efdb57abc8e8b5222a4e3e9e53265ccce8b11497fe150146d6f722f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"84f50e651efdb57abc8e8b5222a4e3e9e53265ccce8b11497fe150146d6f722f","first_computed_at":"2026-07-05T07:00:00.691585Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:00:00.691585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EMtr5ueircZYPmGHOskzIj2I5hyDXqcV4rMiaO/BcSvGxjQfSnJtquwLfgqTcU9XYG36KVk1pbWfHAEWVlEqAA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:00:00.692020Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.08081","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8f3c5ebc634df425f8ba88821760fe4f34bb0d3ded4279098bceb4f08f575d51","sha256:b5afa9cb2c353f12061eba689c5edaa3fd9c417e35322f9a9b8b78845650cdd4"],"state_sha256":"d132ccddfaafdbea656bf9eda7fe7503a7367bbdd15f67208ceb42ebf6b448b8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ifhjIkE4yBuSyQbv1pCKUD0H3bg9grSK9ZtTJj36S7dhPxj018ZsdMn5dj0rq54vuLgVryyzs1A7O29bMp3SBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T11:56:05.898273Z","bundle_sha256":"d4d903bd37ba2005af36ca984b88776ac364971486ae504eea4b5b3cfac4b786"}}