{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:W2UX4CKQXNC2W34JSJU2TKB2PD","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":"a0a46013e3996076c39db48cab55ddc63f262594ebf2c303fcd3a9b8e44e2822","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-27T01:11:16Z","title_canon_sha256":"15ada469f3c785d1fac843a747abd9f702d7712fbaa27e70fa8a39d0e526f86c"},"schema_version":"1.0","source":{"id":"1401.6711","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.6711","created_at":"2026-05-18T03:01:00Z"},{"alias_kind":"arxiv_version","alias_value":"1401.6711v1","created_at":"2026-05-18T03:01:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6711","created_at":"2026-05-18T03:01:00Z"},{"alias_kind":"pith_short_12","alias_value":"W2UX4CKQXNC2","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"W2UX4CKQXNC2W34J","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"W2UX4CKQ","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:ff05feb0bd867c720c834f2e856f729199deae7230560f57ac5e858e7238a8ed","target":"graph","created_at":"2026-05-18T03:01:00Z","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"},"paper":{"abstract_excerpt":"In this note, we answer the following question of Foucaud, Krivelevich and Perarnau. What is the size of the largest $K_{r,s}$-free subgraph one can guarantee in every graph $G$ with $m$ edges? We also discuss the analogous problem for hypergraphs.","authors_text":"Benny Sudakov, David Conlon, Jacob Fox","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-27T01:11:16Z","title":"Large subgraphs without complete bipartite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6711","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:eae34c65e0b5c6232ffd289131513459aa99472ac63683696b51ad29a9489580","target":"record","created_at":"2026-05-18T03:01:00Z","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":"a0a46013e3996076c39db48cab55ddc63f262594ebf2c303fcd3a9b8e44e2822","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-27T01:11:16Z","title_canon_sha256":"15ada469f3c785d1fac843a747abd9f702d7712fbaa27e70fa8a39d0e526f86c"},"schema_version":"1.0","source":{"id":"1401.6711","kind":"arxiv","version":1}},"canonical_sha256":"b6a97e0950bb45ab6f899269a9a83a78e22dc42cc60461549022c65fcc891133","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b6a97e0950bb45ab6f899269a9a83a78e22dc42cc60461549022c65fcc891133","first_computed_at":"2026-05-18T03:01:00.930486Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:00.930486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QW7criVMKDONhzFO8O/w3wK3PIPE7QgPntmuo2RmC0fqtW4A0mx0MPuIVzuywhtS4we/opUn8FPMDiqHLUCsCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:00.931249Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.6711","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eae34c65e0b5c6232ffd289131513459aa99472ac63683696b51ad29a9489580","sha256:ff05feb0bd867c720c834f2e856f729199deae7230560f57ac5e858e7238a8ed"],"state_sha256":"1e9a7d703a1847c6d2c751506fccfc5c8c677d4f709d935f8ab5f6225ffafcd3"}