{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NGNK5ODBPB7I7PHXQSQISNIWMN","short_pith_number":"pith:NGNK5ODB","canonical_record":{"source":{"id":"1711.02937","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-08T13:28:48Z","cross_cats_sorted":[],"title_canon_sha256":"3212637b2a7829f87a7aee603641254e2a6e6cadd3d80dc72b797b2052e50355","abstract_canon_sha256":"e01593a24756e6af1402b760dcc55ed7afb67bf90de8c26b5fec940bdef0077b"},"schema_version":"1.0"},"canonical_sha256":"699aaeb861787e8fbcf784a089351663787bea2996590072609c834794b7d202","source":{"kind":"arxiv","id":"1711.02937","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.02937","created_at":"2026-07-05T03:11:50Z"},{"alias_kind":"arxiv_version","alias_value":"1711.02937v4","created_at":"2026-07-05T03:11:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02937","created_at":"2026-07-05T03:11:50Z"},{"alias_kind":"pith_short_12","alias_value":"NGNK5ODBPB7I","created_at":"2026-07-05T03:11:50Z"},{"alias_kind":"pith_short_16","alias_value":"NGNK5ODBPB7I7PHX","created_at":"2026-07-05T03:11:50Z"},{"alias_kind":"pith_short_8","alias_value":"NGNK5ODB","created_at":"2026-07-05T03:11:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NGNK5ODBPB7I7PHXQSQISNIWMN","target":"record","payload":{"canonical_record":{"source":{"id":"1711.02937","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-08T13:28:48Z","cross_cats_sorted":[],"title_canon_sha256":"3212637b2a7829f87a7aee603641254e2a6e6cadd3d80dc72b797b2052e50355","abstract_canon_sha256":"e01593a24756e6af1402b760dcc55ed7afb67bf90de8c26b5fec940bdef0077b"},"schema_version":"1.0"},"canonical_sha256":"699aaeb861787e8fbcf784a089351663787bea2996590072609c834794b7d202","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:11:50.863073Z","signature_b64":"uAXC9tFXf7JMe2VwV9bzaAQLV+SqVdbM/RQMR/oRdtEHazWzUVCSn/WrVrh1aWuPTydUh8HE5GEY2gOMXdmGDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"699aaeb861787e8fbcf784a089351663787bea2996590072609c834794b7d202","last_reissued_at":"2026-07-05T03:11:50.862717Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:11:50.862717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.02937","source_version":4,"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-05T03:11:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mhieiTR0QpRYB1mvuPDOl18y+3ufw3g0b6qK/l7gRQRyd4WKlvCZbplHXS+99MTJxcPao/PdirmZ1gGnLFRmCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T09:21:20.197800Z"},"content_sha256":"152eb820382eb1477784bc3dd738805c06eaa171a7cf63186685f7dbbebd9ba9","schema_version":"1.0","event_id":"sha256:152eb820382eb1477784bc3dd738805c06eaa171a7cf63186685f7dbbebd9ba9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NGNK5ODBPB7I7PHXQSQISNIWMN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ramsey graphs induce subgraphs of quadratically many sizes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Matthew Kwan","submitted_at":"2017-11-08T13:28:48Z","abstract_excerpt":"An n-vertex graph is called C-Ramsey if it has no clique or independent set of size C log n. All known constructions of Ramsey graphs involve randomness in an essential way, and there is an ongoing line of research towards showing that in fact all Ramsey graphs must obey certain \"richness\" properties characteristic of random graphs. Motivated by an old problem of Erd\\H{o}s and McKay, recently Narayanan, Sahasrabudhe and Tomon conjectured that for any fixed C, every n-vertex C-Ramsey graph induces subgraphs of $\\Theta(n^2)$ different sizes. In this paper we prove this conjecture."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02937","kind":"arxiv","version":4},"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/1711.02937/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-05T03:11:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0KXngIhV6HlemoZcAQzeSGVyZc0aCj7zceIxaIr9vyu8lvFRC3EVzde17IcZt/pDYqFHh31URgbZFvCLNdaeBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T09:21:20.198349Z"},"content_sha256":"9fda5671be7a5a73137775abaa7415c0bacabb9606919967bb63444286ec2850","schema_version":"1.0","event_id":"sha256:9fda5671be7a5a73137775abaa7415c0bacabb9606919967bb63444286ec2850"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NGNK5ODBPB7I7PHXQSQISNIWMN/bundle.json","state_url":"https://pith.science/pith/NGNK5ODBPB7I7PHXQSQISNIWMN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NGNK5ODBPB7I7PHXQSQISNIWMN/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-17T09:21:20Z","links":{"resolver":"https://pith.science/pith/NGNK5ODBPB7I7PHXQSQISNIWMN","bundle":"https://pith.science/pith/NGNK5ODBPB7I7PHXQSQISNIWMN/bundle.json","state":"https://pith.science/pith/NGNK5ODBPB7I7PHXQSQISNIWMN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NGNK5ODBPB7I7PHXQSQISNIWMN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NGNK5ODBPB7I7PHXQSQISNIWMN","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":"e01593a24756e6af1402b760dcc55ed7afb67bf90de8c26b5fec940bdef0077b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-08T13:28:48Z","title_canon_sha256":"3212637b2a7829f87a7aee603641254e2a6e6cadd3d80dc72b797b2052e50355"},"schema_version":"1.0","source":{"id":"1711.02937","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.02937","created_at":"2026-07-05T03:11:50Z"},{"alias_kind":"arxiv_version","alias_value":"1711.02937v4","created_at":"2026-07-05T03:11:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02937","created_at":"2026-07-05T03:11:50Z"},{"alias_kind":"pith_short_12","alias_value":"NGNK5ODBPB7I","created_at":"2026-07-05T03:11:50Z"},{"alias_kind":"pith_short_16","alias_value":"NGNK5ODBPB7I7PHX","created_at":"2026-07-05T03:11:50Z"},{"alias_kind":"pith_short_8","alias_value":"NGNK5ODB","created_at":"2026-07-05T03:11:50Z"}],"graph_snapshots":[{"event_id":"sha256:9fda5671be7a5a73137775abaa7415c0bacabb9606919967bb63444286ec2850","target":"graph","created_at":"2026-07-05T03:11:50Z","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/1711.02937/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"An n-vertex graph is called C-Ramsey if it has no clique or independent set of size C log n. All known constructions of Ramsey graphs involve randomness in an essential way, and there is an ongoing line of research towards showing that in fact all Ramsey graphs must obey certain \"richness\" properties characteristic of random graphs. Motivated by an old problem of Erd\\H{o}s and McKay, recently Narayanan, Sahasrabudhe and Tomon conjectured that for any fixed C, every n-vertex C-Ramsey graph induces subgraphs of $\\Theta(n^2)$ different sizes. In this paper we prove this conjecture.","authors_text":"Benny Sudakov, Matthew Kwan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-08T13:28:48Z","title":"Ramsey graphs induce subgraphs of quadratically many sizes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02937","kind":"arxiv","version":4},"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:152eb820382eb1477784bc3dd738805c06eaa171a7cf63186685f7dbbebd9ba9","target":"record","created_at":"2026-07-05T03:11:50Z","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":"e01593a24756e6af1402b760dcc55ed7afb67bf90de8c26b5fec940bdef0077b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-08T13:28:48Z","title_canon_sha256":"3212637b2a7829f87a7aee603641254e2a6e6cadd3d80dc72b797b2052e50355"},"schema_version":"1.0","source":{"id":"1711.02937","kind":"arxiv","version":4}},"canonical_sha256":"699aaeb861787e8fbcf784a089351663787bea2996590072609c834794b7d202","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"699aaeb861787e8fbcf784a089351663787bea2996590072609c834794b7d202","first_computed_at":"2026-07-05T03:11:50.862717Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:11:50.862717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uAXC9tFXf7JMe2VwV9bzaAQLV+SqVdbM/RQMR/oRdtEHazWzUVCSn/WrVrh1aWuPTydUh8HE5GEY2gOMXdmGDw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:11:50.863073Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.02937","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:152eb820382eb1477784bc3dd738805c06eaa171a7cf63186685f7dbbebd9ba9","sha256:9fda5671be7a5a73137775abaa7415c0bacabb9606919967bb63444286ec2850"],"state_sha256":"1a43ab220b750bc7b4220c6543c629e2faa0531e9ff6e40abd2134decd6362c0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Onq/cNJz7FD+n1E+sNZZ4DcIFlD4OpynHFUYH/BcxuFMOcLBdmUW+BouRy0mgLJDNfgx4v7Ltkihme8XF9RPBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T09:21:20.202295Z","bundle_sha256":"f5d5413bb9b47b16cf46ecba12594d536b141a66de5373a320e6e413780663ef"}}