{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:FMYLFKEGONY3GEJFO2O6O5JEV4","short_pith_number":"pith:FMYLFKEG","canonical_record":{"source":{"id":"2212.07234","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-12-14T14:16:45Z","cross_cats_sorted":[],"title_canon_sha256":"0561305e6217412e6b823e32df8fbd83fe2953ee704a891ecb0b1bf7c105071e","abstract_canon_sha256":"9cb990cac48d24ad7e17557d2da9aa0172bf6155e4622923dc9de8d4bd7ba681"},"schema_version":"1.0"},"canonical_sha256":"2b30b2a8867371b31125769de77524af2f116bd1d56898a0d4764f3d070840b5","source":{"kind":"arxiv","id":"2212.07234","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.07234","created_at":"2026-07-05T06:20:39Z"},{"alias_kind":"arxiv_version","alias_value":"2212.07234v3","created_at":"2026-07-05T06:20:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.07234","created_at":"2026-07-05T06:20:39Z"},{"alias_kind":"pith_short_12","alias_value":"FMYLFKEGONY3","created_at":"2026-07-05T06:20:39Z"},{"alias_kind":"pith_short_16","alias_value":"FMYLFKEGONY3GEJF","created_at":"2026-07-05T06:20:39Z"},{"alias_kind":"pith_short_8","alias_value":"FMYLFKEG","created_at":"2026-07-05T06:20:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:FMYLFKEGONY3GEJFO2O6O5JEV4","target":"record","payload":{"canonical_record":{"source":{"id":"2212.07234","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-12-14T14:16:45Z","cross_cats_sorted":[],"title_canon_sha256":"0561305e6217412e6b823e32df8fbd83fe2953ee704a891ecb0b1bf7c105071e","abstract_canon_sha256":"9cb990cac48d24ad7e17557d2da9aa0172bf6155e4622923dc9de8d4bd7ba681"},"schema_version":"1.0"},"canonical_sha256":"2b30b2a8867371b31125769de77524af2f116bd1d56898a0d4764f3d070840b5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:20:39.243583Z","signature_b64":"cRpq5JxIOQvd3BWga6xtSJPBg+2yfbnKLbXV4DAk2QCJxBpEeJMzOh7crtsp8Aap0LQQW/NZW6uxZAfraXnLAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b30b2a8867371b31125769de77524af2f116bd1d56898a0d4764f3d070840b5","last_reissued_at":"2026-07-05T06:20:39.243177Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:20:39.243177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2212.07234","source_version":3,"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-05T06:20:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qxk9EO/5/ea32I+LyrlAV9rM7QawFkrPt8tZQHAIjKNe8DNbFz1dpmDkfwv45Pd+NW/2S/fiVpC01oo/oqLDCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T09:42:42.775097Z"},"content_sha256":"b205387e09663a129cf8f8b2ef42f6ebbfa64e5a9b5a69bf189b08a55a46ebe7","schema_version":"1.0","event_id":"sha256:b205387e09663a129cf8f8b2ef42f6ebbfa64e5a9b5a69bf189b08a55a46ebe7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:FMYLFKEGONY3GEJFO2O6O5JEV4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Two Ramsey-Tur\\'{a}n numbers involving triangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Qizhong Lin, Xinyu Hu","submitted_at":"2022-12-14T14:16:45Z","abstract_excerpt":"Given integers $p, q\\ge2$, we say that a graph $G$ is $(K_p,K_q)$-free if there exists a red/blue edge coloring of $G$ such that it contains neither a red $K_p$ nor a blue $K_q$. Fix a function $f( n )$, the Ramsey-Tur\\'{a}n number $RT( {n,p,q,f( n ))} $ is the maximum number of edges in an $n$-vertex $(K_p,K_q)$-free graph with independence number at most $f( n )$. For any $\\delta>0$, let $\\rho (p, q,\\delta ) = \\mathop {\\lim }\\limits_{n \\to \\infty } \\frac{RT(n,p, q,\\delta n)}{n^2}$. We always call $\\rho (p, q):= \\mathop {\\lim }\\limits_{\\delta \\to 0}\\rho (p, q,\\delta )$ the Ramsey-Tur\\'{a}n de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.07234","kind":"arxiv","version":3},"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/2212.07234/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-05T06:20:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VSSjSa+RmMX72pnrHlo13DsdXZW0MxAu9HbiZSvKBcxzERQ3UJm2J1OHr/91R7MeIYCymBjZMwKq7q2/FlF6BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T09:42:42.775599Z"},"content_sha256":"be52d18f6212cec31ad96870b4801fe5f0f9d6b20db1d811e3a567ba7b74c1ae","schema_version":"1.0","event_id":"sha256:be52d18f6212cec31ad96870b4801fe5f0f9d6b20db1d811e3a567ba7b74c1ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FMYLFKEGONY3GEJFO2O6O5JEV4/bundle.json","state_url":"https://pith.science/pith/FMYLFKEGONY3GEJFO2O6O5JEV4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FMYLFKEGONY3GEJFO2O6O5JEV4/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-04T09:42:42Z","links":{"resolver":"https://pith.science/pith/FMYLFKEGONY3GEJFO2O6O5JEV4","bundle":"https://pith.science/pith/FMYLFKEGONY3GEJFO2O6O5JEV4/bundle.json","state":"https://pith.science/pith/FMYLFKEGONY3GEJFO2O6O5JEV4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FMYLFKEGONY3GEJFO2O6O5JEV4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:FMYLFKEGONY3GEJFO2O6O5JEV4","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":"9cb990cac48d24ad7e17557d2da9aa0172bf6155e4622923dc9de8d4bd7ba681","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-12-14T14:16:45Z","title_canon_sha256":"0561305e6217412e6b823e32df8fbd83fe2953ee704a891ecb0b1bf7c105071e"},"schema_version":"1.0","source":{"id":"2212.07234","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.07234","created_at":"2026-07-05T06:20:39Z"},{"alias_kind":"arxiv_version","alias_value":"2212.07234v3","created_at":"2026-07-05T06:20:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.07234","created_at":"2026-07-05T06:20:39Z"},{"alias_kind":"pith_short_12","alias_value":"FMYLFKEGONY3","created_at":"2026-07-05T06:20:39Z"},{"alias_kind":"pith_short_16","alias_value":"FMYLFKEGONY3GEJF","created_at":"2026-07-05T06:20:39Z"},{"alias_kind":"pith_short_8","alias_value":"FMYLFKEG","created_at":"2026-07-05T06:20:39Z"}],"graph_snapshots":[{"event_id":"sha256:be52d18f6212cec31ad96870b4801fe5f0f9d6b20db1d811e3a567ba7b74c1ae","target":"graph","created_at":"2026-07-05T06:20:39Z","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/2212.07234/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given integers $p, q\\ge2$, we say that a graph $G$ is $(K_p,K_q)$-free if there exists a red/blue edge coloring of $G$ such that it contains neither a red $K_p$ nor a blue $K_q$. Fix a function $f( n )$, the Ramsey-Tur\\'{a}n number $RT( {n,p,q,f( n ))} $ is the maximum number of edges in an $n$-vertex $(K_p,K_q)$-free graph with independence number at most $f( n )$. For any $\\delta>0$, let $\\rho (p, q,\\delta ) = \\mathop {\\lim }\\limits_{n \\to \\infty } \\frac{RT(n,p, q,\\delta n)}{n^2}$. We always call $\\rho (p, q):= \\mathop {\\lim }\\limits_{\\delta \\to 0}\\rho (p, q,\\delta )$ the Ramsey-Tur\\'{a}n de","authors_text":"Qizhong Lin, Xinyu Hu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-12-14T14:16:45Z","title":"Two Ramsey-Tur\\'{a}n numbers involving triangles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.07234","kind":"arxiv","version":3},"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:b205387e09663a129cf8f8b2ef42f6ebbfa64e5a9b5a69bf189b08a55a46ebe7","target":"record","created_at":"2026-07-05T06:20:39Z","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":"9cb990cac48d24ad7e17557d2da9aa0172bf6155e4622923dc9de8d4bd7ba681","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-12-14T14:16:45Z","title_canon_sha256":"0561305e6217412e6b823e32df8fbd83fe2953ee704a891ecb0b1bf7c105071e"},"schema_version":"1.0","source":{"id":"2212.07234","kind":"arxiv","version":3}},"canonical_sha256":"2b30b2a8867371b31125769de77524af2f116bd1d56898a0d4764f3d070840b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b30b2a8867371b31125769de77524af2f116bd1d56898a0d4764f3d070840b5","first_computed_at":"2026-07-05T06:20:39.243177Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:20:39.243177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cRpq5JxIOQvd3BWga6xtSJPBg+2yfbnKLbXV4DAk2QCJxBpEeJMzOh7crtsp8Aap0LQQW/NZW6uxZAfraXnLAA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:20:39.243583Z","signed_message":"canonical_sha256_bytes"},"source_id":"2212.07234","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b205387e09663a129cf8f8b2ef42f6ebbfa64e5a9b5a69bf189b08a55a46ebe7","sha256:be52d18f6212cec31ad96870b4801fe5f0f9d6b20db1d811e3a567ba7b74c1ae"],"state_sha256":"d33126573aeb1acc2b31122324f35b1750e3554e021fed90b704242d89f3c9a6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qvuDvo+SrdUs3yQZJwzBntY6EOsxF+RtX6uoVAHKdldxbf0EzHK6V8qq8RqU9MboOgPOv6xvnkKyeNug6POCDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T09:42:42.778876Z","bundle_sha256":"3bb6309ef384077253c3cb7c3ff1b84a5d8865b1ec7db45e6ec24467132f0cb5"}}