{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:3OB3MN3YHHT4457U2OY3B2Y57Q","short_pith_number":"pith:3OB3MN3Y","canonical_record":{"source":{"id":"2109.04140","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-09-09T09:59:29Z","cross_cats_sorted":[],"title_canon_sha256":"cf3b0386f4a072a5f06f5de12dbc291720076329a37e7860a48686b4cc2b825b","abstract_canon_sha256":"a346a85818714955fb73ceebacf5eb7398ee9382c182b6fae069212eef75e048"},"schema_version":"1.0"},"canonical_sha256":"db83b6377839e7ce77f4d3b1b0eb1dfc1c99e4a144ed77c6031b445b037f510b","source":{"kind":"arxiv","id":"2109.04140","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.04140","created_at":"2026-07-05T10:23:48Z"},{"alias_kind":"arxiv_version","alias_value":"2109.04140v1","created_at":"2026-07-05T10:23:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.04140","created_at":"2026-07-05T10:23:48Z"},{"alias_kind":"pith_short_12","alias_value":"3OB3MN3YHHT4","created_at":"2026-07-05T10:23:48Z"},{"alias_kind":"pith_short_16","alias_value":"3OB3MN3YHHT4457U","created_at":"2026-07-05T10:23:48Z"},{"alias_kind":"pith_short_8","alias_value":"3OB3MN3Y","created_at":"2026-07-05T10:23:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:3OB3MN3YHHT4457U2OY3B2Y57Q","target":"record","payload":{"canonical_record":{"source":{"id":"2109.04140","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-09-09T09:59:29Z","cross_cats_sorted":[],"title_canon_sha256":"cf3b0386f4a072a5f06f5de12dbc291720076329a37e7860a48686b4cc2b825b","abstract_canon_sha256":"a346a85818714955fb73ceebacf5eb7398ee9382c182b6fae069212eef75e048"},"schema_version":"1.0"},"canonical_sha256":"db83b6377839e7ce77f4d3b1b0eb1dfc1c99e4a144ed77c6031b445b037f510b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:23:48.796590Z","signature_b64":"xeCljfMfScBbbWrgr4QmBHp4QlUuBqusq2Jbtz7YqmRdHog2MCPDPapHB4LkvsXJ4dVoqaqcfWaGY37dY4fPCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db83b6377839e7ce77f4d3b1b0eb1dfc1c99e4a144ed77c6031b445b037f510b","last_reissued_at":"2026-07-05T10:23:48.795814Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:23:48.795814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2109.04140","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-05T10:23:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R2nm3/WNX+GJM3KnUlHO8ePKUJ3GvxiiFXrX/btBXyTusWGWmbhzQvsasLh60fzZpCi7k0RGQW31wPWx8HBkAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T15:37:27.422151Z"},"content_sha256":"ab501efe8c8f9ece25c7906dee9c6d7d87e8cad56887b3ed7220ae73c7f1a687","schema_version":"1.0","event_id":"sha256:ab501efe8c8f9ece25c7906dee9c6d7d87e8cad56887b3ed7220ae73c7f1a687"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:3OB3MN3YHHT4457U2OY3B2Y57Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ramsey simplicity of random graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dennis Clemens, Pranshu Gupta, Shagnik Das, Simona Boyadzhiyska","submitted_at":"2021-09-09T09:59:29Z","abstract_excerpt":"A graph $G$ is $q$-Ramsey for another graph $H$ if in any $q$-edge-colouring of $G$ there is a monochromatic copy of $H$, and the classic Ramsey problem asks for the minimum number of vertices in such a graph. This was broadened in the seminal work of Burr, Erd\\H{o}s, and Lov\\'asz to the investigation of other extremal parameters of Ramsey graphs, including the minimum degree.\n  It is not hard to see that if $G$ is minimally $q$-Ramsey for $H$ we must have $\\delta(G) \\ge q(\\delta(H) - 1) + 1$, and we say that a graph $H$ is $q$-Ramsey simple if this bound can be attained. Grinshpun showed that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.04140","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/2109.04140/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-05T10:23:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lmcWNhMl8VD3oPigVpy1dmkbznuJJ/6ZpJtS4EIZURhqI3GEt7yUp+ONXcQOFZM9Ia0lu3Ytwvub5mXHvCyLAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T15:37:27.422680Z"},"content_sha256":"20082317e8fc73adecb7ef1713ec24d299c285a4be4766527c24cfe23438aac6","schema_version":"1.0","event_id":"sha256:20082317e8fc73adecb7ef1713ec24d299c285a4be4766527c24cfe23438aac6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3OB3MN3YHHT4457U2OY3B2Y57Q/bundle.json","state_url":"https://pith.science/pith/3OB3MN3YHHT4457U2OY3B2Y57Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3OB3MN3YHHT4457U2OY3B2Y57Q/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-21T15:37:27Z","links":{"resolver":"https://pith.science/pith/3OB3MN3YHHT4457U2OY3B2Y57Q","bundle":"https://pith.science/pith/3OB3MN3YHHT4457U2OY3B2Y57Q/bundle.json","state":"https://pith.science/pith/3OB3MN3YHHT4457U2OY3B2Y57Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3OB3MN3YHHT4457U2OY3B2Y57Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:3OB3MN3YHHT4457U2OY3B2Y57Q","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":"a346a85818714955fb73ceebacf5eb7398ee9382c182b6fae069212eef75e048","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-09-09T09:59:29Z","title_canon_sha256":"cf3b0386f4a072a5f06f5de12dbc291720076329a37e7860a48686b4cc2b825b"},"schema_version":"1.0","source":{"id":"2109.04140","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.04140","created_at":"2026-07-05T10:23:48Z"},{"alias_kind":"arxiv_version","alias_value":"2109.04140v1","created_at":"2026-07-05T10:23:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.04140","created_at":"2026-07-05T10:23:48Z"},{"alias_kind":"pith_short_12","alias_value":"3OB3MN3YHHT4","created_at":"2026-07-05T10:23:48Z"},{"alias_kind":"pith_short_16","alias_value":"3OB3MN3YHHT4457U","created_at":"2026-07-05T10:23:48Z"},{"alias_kind":"pith_short_8","alias_value":"3OB3MN3Y","created_at":"2026-07-05T10:23:48Z"}],"graph_snapshots":[{"event_id":"sha256:20082317e8fc73adecb7ef1713ec24d299c285a4be4766527c24cfe23438aac6","target":"graph","created_at":"2026-07-05T10:23:48Z","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/2109.04140/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A graph $G$ is $q$-Ramsey for another graph $H$ if in any $q$-edge-colouring of $G$ there is a monochromatic copy of $H$, and the classic Ramsey problem asks for the minimum number of vertices in such a graph. This was broadened in the seminal work of Burr, Erd\\H{o}s, and Lov\\'asz to the investigation of other extremal parameters of Ramsey graphs, including the minimum degree.\n  It is not hard to see that if $G$ is minimally $q$-Ramsey for $H$ we must have $\\delta(G) \\ge q(\\delta(H) - 1) + 1$, and we say that a graph $H$ is $q$-Ramsey simple if this bound can be attained. Grinshpun showed that","authors_text":"Dennis Clemens, Pranshu Gupta, Shagnik Das, Simona Boyadzhiyska","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-09-09T09:59:29Z","title":"Ramsey simplicity of random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.04140","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:ab501efe8c8f9ece25c7906dee9c6d7d87e8cad56887b3ed7220ae73c7f1a687","target":"record","created_at":"2026-07-05T10:23:48Z","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":"a346a85818714955fb73ceebacf5eb7398ee9382c182b6fae069212eef75e048","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-09-09T09:59:29Z","title_canon_sha256":"cf3b0386f4a072a5f06f5de12dbc291720076329a37e7860a48686b4cc2b825b"},"schema_version":"1.0","source":{"id":"2109.04140","kind":"arxiv","version":1}},"canonical_sha256":"db83b6377839e7ce77f4d3b1b0eb1dfc1c99e4a144ed77c6031b445b037f510b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"db83b6377839e7ce77f4d3b1b0eb1dfc1c99e4a144ed77c6031b445b037f510b","first_computed_at":"2026-07-05T10:23:48.795814Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:23:48.795814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xeCljfMfScBbbWrgr4QmBHp4QlUuBqusq2Jbtz7YqmRdHog2MCPDPapHB4LkvsXJ4dVoqaqcfWaGY37dY4fPCg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:23:48.796590Z","signed_message":"canonical_sha256_bytes"},"source_id":"2109.04140","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab501efe8c8f9ece25c7906dee9c6d7d87e8cad56887b3ed7220ae73c7f1a687","sha256:20082317e8fc73adecb7ef1713ec24d299c285a4be4766527c24cfe23438aac6"],"state_sha256":"87c2f1d5f3dd96c1ab33023a584f841df192db706f36448580e8336d3f026f79"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ls9nyNBBi0+1nEhxt6zQf2FEegvpv8jS77TR3guSgBHQgBgNdhQlbGJEEv/clDYbl4tOwWjMtyITYKRef34MBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T15:37:27.426746Z","bundle_sha256":"e49eb0473ca0e1c2df7a5c405c43d1ebbe531d0ba95acdef3aa35c1c612b8123"}}