{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:GFFRAKQ7RT7BDLDEG7KSNA7ONA","short_pith_number":"pith:GFFRAKQ7","canonical_record":{"source":{"id":"1311.5818","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-22T17:13:00Z","cross_cats_sorted":[],"title_canon_sha256":"dea3783549b5669c1e7fe397728c4008d056f7ab52b7be4ab4efc9ea32cab2c4","abstract_canon_sha256":"1513a7072c70125f6bf6ce25e2b4b8aa97c5363f82ba43fb82d1718713bfaa57"},"schema_version":"1.0"},"canonical_sha256":"314b102a1f8cfe11ac6437d52683ee680ea6616d774d13cd3c7fcbbc60d7e239","source":{"kind":"arxiv","id":"1311.5818","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.5818","created_at":"2026-05-18T02:27:29Z"},{"alias_kind":"arxiv_version","alias_value":"1311.5818v2","created_at":"2026-05-18T02:27:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.5818","created_at":"2026-05-18T02:27:29Z"},{"alias_kind":"pith_short_12","alias_value":"GFFRAKQ7RT7B","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GFFRAKQ7RT7BDLDE","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GFFRAKQ7","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:GFFRAKQ7RT7BDLDEG7KSNA7ONA","target":"record","payload":{"canonical_record":{"source":{"id":"1311.5818","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-22T17:13:00Z","cross_cats_sorted":[],"title_canon_sha256":"dea3783549b5669c1e7fe397728c4008d056f7ab52b7be4ab4efc9ea32cab2c4","abstract_canon_sha256":"1513a7072c70125f6bf6ce25e2b4b8aa97c5363f82ba43fb82d1718713bfaa57"},"schema_version":"1.0"},"canonical_sha256":"314b102a1f8cfe11ac6437d52683ee680ea6616d774d13cd3c7fcbbc60d7e239","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:29.472922Z","signature_b64":"jfWDk8u7EK6YTDaRhl2BJcszqIhuNiJS8SfvzbjkzI41b9V3t861SO5BZWI2NjuBVt7qxljbJWS3JKOnU1YxAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"314b102a1f8cfe11ac6437d52683ee680ea6616d774d13cd3c7fcbbc60d7e239","last_reissued_at":"2026-05-18T02:27:29.472028Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:29.472028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.5818","source_version":2,"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-05-18T02:27:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"acj/ugNBuM4ZG5HLUEzEHzltJTe+hSBFSzFdcx29CUQpC4bfvTdpfL+TtH8h+2+IrGSCihJtmtEcSAKsV3CnBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:57:45.999674Z"},"content_sha256":"403eccc48af8beae0f11fe36df8fd14ba39ae8eaa8f2fbd9f125ecf4d745f2f5","schema_version":"1.0","event_id":"sha256:403eccc48af8beae0f11fe36df8fd14ba39ae8eaa8f2fbd9f125ecf4d745f2f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:GFFRAKQ7RT7BDLDEG7KSNA7ONA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparse halves in dense triangle-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Liana Yepremyan, Sergey Norin","submitted_at":"2013-11-22T17:13:00Z","abstract_excerpt":"Erd\\H{o}s conjectured that every triangle-free graph $G$ on $n$ vertices contains a set of $\\lfloor n/2 \\rfloor$ vertices that spans at most $n^2 /50$ edges. Krivelevich proved the conjecture for graphs with minimum degree at least $\\frac{2}{5}n$. Keevash and Sudakov improved this result to graphs with average degree at least $\\frac{2}{5}n$. We strengthen these results by showing that the conjecture holds for graphs with minimum degree at least $\\frac{5}{14}n$ and for graphs with average degree at least $(\\frac{2}{5} - \\varepsilon)n$ for some absolute $\\varepsilon >0$. Moreover, we show that t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.5818","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T02:27:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w4CVDPWeFL7qkQWfyQ23R4dIISCrRKHq8UfgPvYc+5GEee2fdBduxI96lzY366U4Vzu7T4Qj5FDSzkl27Wv4CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:57:46.000404Z"},"content_sha256":"fb88538b68d8834ef3ec5768a234ae1db7ce026fa3903f50864bc4320886d296","schema_version":"1.0","event_id":"sha256:fb88538b68d8834ef3ec5768a234ae1db7ce026fa3903f50864bc4320886d296"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GFFRAKQ7RT7BDLDEG7KSNA7ONA/bundle.json","state_url":"https://pith.science/pith/GFFRAKQ7RT7BDLDEG7KSNA7ONA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GFFRAKQ7RT7BDLDEG7KSNA7ONA/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-05-25T16:57:46Z","links":{"resolver":"https://pith.science/pith/GFFRAKQ7RT7BDLDEG7KSNA7ONA","bundle":"https://pith.science/pith/GFFRAKQ7RT7BDLDEG7KSNA7ONA/bundle.json","state":"https://pith.science/pith/GFFRAKQ7RT7BDLDEG7KSNA7ONA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GFFRAKQ7RT7BDLDEG7KSNA7ONA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:GFFRAKQ7RT7BDLDEG7KSNA7ONA","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":"1513a7072c70125f6bf6ce25e2b4b8aa97c5363f82ba43fb82d1718713bfaa57","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-22T17:13:00Z","title_canon_sha256":"dea3783549b5669c1e7fe397728c4008d056f7ab52b7be4ab4efc9ea32cab2c4"},"schema_version":"1.0","source":{"id":"1311.5818","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.5818","created_at":"2026-05-18T02:27:29Z"},{"alias_kind":"arxiv_version","alias_value":"1311.5818v2","created_at":"2026-05-18T02:27:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.5818","created_at":"2026-05-18T02:27:29Z"},{"alias_kind":"pith_short_12","alias_value":"GFFRAKQ7RT7B","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GFFRAKQ7RT7BDLDE","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GFFRAKQ7","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:fb88538b68d8834ef3ec5768a234ae1db7ce026fa3903f50864bc4320886d296","target":"graph","created_at":"2026-05-18T02:27:29Z","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":"Erd\\H{o}s conjectured that every triangle-free graph $G$ on $n$ vertices contains a set of $\\lfloor n/2 \\rfloor$ vertices that spans at most $n^2 /50$ edges. Krivelevich proved the conjecture for graphs with minimum degree at least $\\frac{2}{5}n$. Keevash and Sudakov improved this result to graphs with average degree at least $\\frac{2}{5}n$. We strengthen these results by showing that the conjecture holds for graphs with minimum degree at least $\\frac{5}{14}n$ and for graphs with average degree at least $(\\frac{2}{5} - \\varepsilon)n$ for some absolute $\\varepsilon >0$. Moreover, we show that t","authors_text":"Liana Yepremyan, Sergey Norin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-22T17:13:00Z","title":"Sparse halves in dense triangle-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.5818","kind":"arxiv","version":2},"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:403eccc48af8beae0f11fe36df8fd14ba39ae8eaa8f2fbd9f125ecf4d745f2f5","target":"record","created_at":"2026-05-18T02:27:29Z","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":"1513a7072c70125f6bf6ce25e2b4b8aa97c5363f82ba43fb82d1718713bfaa57","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-22T17:13:00Z","title_canon_sha256":"dea3783549b5669c1e7fe397728c4008d056f7ab52b7be4ab4efc9ea32cab2c4"},"schema_version":"1.0","source":{"id":"1311.5818","kind":"arxiv","version":2}},"canonical_sha256":"314b102a1f8cfe11ac6437d52683ee680ea6616d774d13cd3c7fcbbc60d7e239","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"314b102a1f8cfe11ac6437d52683ee680ea6616d774d13cd3c7fcbbc60d7e239","first_computed_at":"2026-05-18T02:27:29.472028Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:29.472028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jfWDk8u7EK6YTDaRhl2BJcszqIhuNiJS8SfvzbjkzI41b9V3t861SO5BZWI2NjuBVt7qxljbJWS3JKOnU1YxAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:29.472922Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.5818","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:403eccc48af8beae0f11fe36df8fd14ba39ae8eaa8f2fbd9f125ecf4d745f2f5","sha256:fb88538b68d8834ef3ec5768a234ae1db7ce026fa3903f50864bc4320886d296"],"state_sha256":"82dca93035820866ce69bccf0980bf0a92a3894b9258d7ad6f8a15dea2f0de30"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IEKnQlaXceeTaINROhlN4DyFDuNoJfzXHr98epWdjCtTmL6ykrYq4kWNv+uhtuh64isIzVeLPlIRAIBvITC3Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:57:46.004010Z","bundle_sha256":"e8dcc76e386bbdbdae8c7db6624b75b0e7704908f59bddd6e67ddee437d11035"}}