{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:B5QK5LBQMQGZCK5BXFJLFHMXTI","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":"5ea1d9b13e0876a0f955845c3d319f2dfde02b7ed977f724c62b9262fe4f0b89","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-10-23T15:39:53Z","title_canon_sha256":"13a5519c4d6f6114b78a2a8f2e507c341d87d9aace8aeaa72d7ebbc5bad01338"},"schema_version":"1.0","source":{"id":"2210.12754","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.12754","created_at":"2026-07-05T05:09:32Z"},{"alias_kind":"arxiv_version","alias_value":"2210.12754v1","created_at":"2026-07-05T05:09:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.12754","created_at":"2026-07-05T05:09:32Z"},{"alias_kind":"pith_short_12","alias_value":"B5QK5LBQMQGZ","created_at":"2026-07-05T05:09:32Z"},{"alias_kind":"pith_short_16","alias_value":"B5QK5LBQMQGZCK5B","created_at":"2026-07-05T05:09:32Z"},{"alias_kind":"pith_short_8","alias_value":"B5QK5LBQ","created_at":"2026-07-05T05:09:32Z"}],"graph_snapshots":[{"event_id":"sha256:1b11cc4b96b7ba7e10d8291077c3319257151b3428c7f6a66b3d7a35d716f260","target":"graph","created_at":"2026-07-05T05:09:32Z","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/2210.12754/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove that for every non-trivial hereditary family of graphs ${\\cal P}$ and for every fixed $p \\in (0,1)$, the maximum possible number of edges in a subgraph of the random graph $G(n,p)$ which belongs to ${\\cal P}$ is, with high probability, $$ \\left(1-\\frac{1}{k-1}+o(1)\\right)p{n \\choose 2}, $$ where $k$ is the minimum chromatic number of a graph that does not belong to ${\\cal P}$.","authors_text":"Michael Krivelevich, Noga Alon, Wojciech Samotij","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-10-23T15:39:53Z","title":"Largest subgraph from a hereditary property in a random graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.12754","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:8c82afbf23f0e2dd1ea9a57f398e0156bde6976977af95b2193b9180c6b4e9e1","target":"record","created_at":"2026-07-05T05:09:32Z","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":"5ea1d9b13e0876a0f955845c3d319f2dfde02b7ed977f724c62b9262fe4f0b89","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-10-23T15:39:53Z","title_canon_sha256":"13a5519c4d6f6114b78a2a8f2e507c341d87d9aace8aeaa72d7ebbc5bad01338"},"schema_version":"1.0","source":{"id":"2210.12754","kind":"arxiv","version":1}},"canonical_sha256":"0f60aeac30640d912ba1b952b29d979a38d212e8ec6f2edb23e13debdea1500b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f60aeac30640d912ba1b952b29d979a38d212e8ec6f2edb23e13debdea1500b","first_computed_at":"2026-07-05T05:09:32.560763Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:09:32.560763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jCK8BmASqH4Ga7yTExD3KnVKUpNy0vDP4JT4nASRUsaCrW/EYdcO/+SbLQWDIPVLiTchVGiG+LHkHjvM+eqdDg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:09:32.561219Z","signed_message":"canonical_sha256_bytes"},"source_id":"2210.12754","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c82afbf23f0e2dd1ea9a57f398e0156bde6976977af95b2193b9180c6b4e9e1","sha256:1b11cc4b96b7ba7e10d8291077c3319257151b3428c7f6a66b3d7a35d716f260"],"state_sha256":"84010ca16f8457c4b3630a45870cf2fbae9051d6e55c5d11abb4438f4ea659fd"}