{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4THN6PKWQ4FWG765HYPGWBNEU3","short_pith_number":"pith:4THN6PKW","canonical_record":{"source":{"id":"1712.05656","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-15T13:06:56Z","cross_cats_sorted":[],"title_canon_sha256":"623772584160dbc76605539c090cce60cdd996c5f3f8273fbced2c85704c17fe","abstract_canon_sha256":"b6219f5441ce87377a67385d1dd555e648920622bfe25f3c6cf3a4d4ce424f2d"},"schema_version":"1.0"},"canonical_sha256":"e4cedf3d56870b637fdd3e1e6b05a4a6d86adca68040ff1361fc2c990f5f0909","source":{"kind":"arxiv","id":"1712.05656","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.05656","created_at":"2026-07-05T03:11:50Z"},{"alias_kind":"arxiv_version","alias_value":"1712.05656v4","created_at":"2026-07-05T03:11:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05656","created_at":"2026-07-05T03:11:50Z"},{"alias_kind":"pith_short_12","alias_value":"4THN6PKWQ4FW","created_at":"2026-07-05T03:11:50Z"},{"alias_kind":"pith_short_16","alias_value":"4THN6PKWQ4FWG765","created_at":"2026-07-05T03:11:50Z"},{"alias_kind":"pith_short_8","alias_value":"4THN6PKW","created_at":"2026-07-05T03:11:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4THN6PKWQ4FWG765HYPGWBNEU3","target":"record","payload":{"canonical_record":{"source":{"id":"1712.05656","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-15T13:06:56Z","cross_cats_sorted":[],"title_canon_sha256":"623772584160dbc76605539c090cce60cdd996c5f3f8273fbced2c85704c17fe","abstract_canon_sha256":"b6219f5441ce87377a67385d1dd555e648920622bfe25f3c6cf3a4d4ce424f2d"},"schema_version":"1.0"},"canonical_sha256":"e4cedf3d56870b637fdd3e1e6b05a4a6d86adca68040ff1361fc2c990f5f0909","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:11:50.879251Z","signature_b64":"2X8DJ1mB5ml6hTt4ZU0cqvLYSuILo9HBd8YIocv218XOWysyCdb7A8bt4S+bioVWalez7XgfjPCELMAMh5jYAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4cedf3d56870b637fdd3e1e6b05a4a6d86adca68040ff1361fc2c990f5f0909","last_reissued_at":"2026-07-05T03:11:50.878903Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:11:50.878903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.05656","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":"fUWGBDsij6R0zP+Q8kY8i2POZyvc3NTO+DWb0YSb9qy9n579YFXs5r+q1h2RmtFalvgP40qCLI76YgO2ZbRjBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T14:02:11.343759Z"},"content_sha256":"7b54b7abb63c424deca6bd3127ba58df406e02bb4115d6ddcf991051258f6da4","schema_version":"1.0","event_id":"sha256:7b54b7abb63c424deca6bd3127ba58df406e02bb4115d6ddcf991051258f6da4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4THN6PKWQ4FWG765HYPGWBNEU3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Proof of a conjecture on induced subgraphs of Ramsey graphs","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-12-15T13:06:56Z","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. More than 25 years ago, Erd\\H{o}s, Faudree and S\\'{o}s conjectured that in any C-Ramsey graph there are $\\Omega\\left(n^{5/2}\\right)$ induced subgraphs, no pair of which have the same numbers of vertices and edges. Improving on earlier results of Alon, Balogh, Kosto"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05656","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/1712.05656/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":"jGZyBeojpUpuVXNF0HCymYLxP4eDiwV0TmiqiRWWB8JXcTWlGf8cjSWARDFjRZzIeP+l+6Zu43XnxJMTBZVXBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T14:02:11.344812Z"},"content_sha256":"9a017f5cb503755232ebea606c9649e039d46cad9d9d6e75e81cfdeedefe6152","schema_version":"1.0","event_id":"sha256:9a017f5cb503755232ebea606c9649e039d46cad9d9d6e75e81cfdeedefe6152"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4THN6PKWQ4FWG765HYPGWBNEU3/bundle.json","state_url":"https://pith.science/pith/4THN6PKWQ4FWG765HYPGWBNEU3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4THN6PKWQ4FWG765HYPGWBNEU3/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-17T14:02:11Z","links":{"resolver":"https://pith.science/pith/4THN6PKWQ4FWG765HYPGWBNEU3","bundle":"https://pith.science/pith/4THN6PKWQ4FWG765HYPGWBNEU3/bundle.json","state":"https://pith.science/pith/4THN6PKWQ4FWG765HYPGWBNEU3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4THN6PKWQ4FWG765HYPGWBNEU3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4THN6PKWQ4FWG765HYPGWBNEU3","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":"b6219f5441ce87377a67385d1dd555e648920622bfe25f3c6cf3a4d4ce424f2d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-15T13:06:56Z","title_canon_sha256":"623772584160dbc76605539c090cce60cdd996c5f3f8273fbced2c85704c17fe"},"schema_version":"1.0","source":{"id":"1712.05656","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.05656","created_at":"2026-07-05T03:11:50Z"},{"alias_kind":"arxiv_version","alias_value":"1712.05656v4","created_at":"2026-07-05T03:11:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05656","created_at":"2026-07-05T03:11:50Z"},{"alias_kind":"pith_short_12","alias_value":"4THN6PKWQ4FW","created_at":"2026-07-05T03:11:50Z"},{"alias_kind":"pith_short_16","alias_value":"4THN6PKWQ4FWG765","created_at":"2026-07-05T03:11:50Z"},{"alias_kind":"pith_short_8","alias_value":"4THN6PKW","created_at":"2026-07-05T03:11:50Z"}],"graph_snapshots":[{"event_id":"sha256:9a017f5cb503755232ebea606c9649e039d46cad9d9d6e75e81cfdeedefe6152","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/1712.05656/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. More than 25 years ago, Erd\\H{o}s, Faudree and S\\'{o}s conjectured that in any C-Ramsey graph there are $\\Omega\\left(n^{5/2}\\right)$ induced subgraphs, no pair of which have the same numbers of vertices and edges. Improving on earlier results of Alon, Balogh, Kosto","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-12-15T13:06:56Z","title":"Proof of a conjecture on induced subgraphs of Ramsey graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05656","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:7b54b7abb63c424deca6bd3127ba58df406e02bb4115d6ddcf991051258f6da4","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":"b6219f5441ce87377a67385d1dd555e648920622bfe25f3c6cf3a4d4ce424f2d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-15T13:06:56Z","title_canon_sha256":"623772584160dbc76605539c090cce60cdd996c5f3f8273fbced2c85704c17fe"},"schema_version":"1.0","source":{"id":"1712.05656","kind":"arxiv","version":4}},"canonical_sha256":"e4cedf3d56870b637fdd3e1e6b05a4a6d86adca68040ff1361fc2c990f5f0909","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4cedf3d56870b637fdd3e1e6b05a4a6d86adca68040ff1361fc2c990f5f0909","first_computed_at":"2026-07-05T03:11:50.878903Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:11:50.878903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2X8DJ1mB5ml6hTt4ZU0cqvLYSuILo9HBd8YIocv218XOWysyCdb7A8bt4S+bioVWalez7XgfjPCELMAMh5jYAw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:11:50.879251Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.05656","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b54b7abb63c424deca6bd3127ba58df406e02bb4115d6ddcf991051258f6da4","sha256:9a017f5cb503755232ebea606c9649e039d46cad9d9d6e75e81cfdeedefe6152"],"state_sha256":"b4ed1a270d663ef05f0e73f88f9a0d4bbab0964b6550d6e93823e7d45fc7b96c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KObIjM2/mkLKD2A4nRi61qXvmxu5ii7k8ORSVYm03DpD4BDqeMXCO97UQQS+2Xx4Quhm5yPSdQVKxoe8XOR9Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T14:02:11.352425Z","bundle_sha256":"4d49b96cfa4c05f46ef3ce91868f79bf2e2e7ebdf30f7693b281b2eebc1c6e8f"}}