{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KDBNQI77DLUZE4UTYL3PXCYIEI","short_pith_number":"pith:KDBNQI77","canonical_record":{"source":{"id":"1505.03072","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-12T15:58:41Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"948a5d4fc25202f42769a0a8cd960ac38a1f0f22248c32c71ecab163e0a100ec","abstract_canon_sha256":"e49afb80fd1d369aac90b348f95809de1a014c8289d6af4868bc76ce6b271a7a"},"schema_version":"1.0"},"canonical_sha256":"50c2d823ff1ae9927293c2f6fb8b08222c779a0086c98edf840199432912c4ab","source":{"kind":"arxiv","id":"1505.03072","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.03072","created_at":"2026-05-18T01:01:42Z"},{"alias_kind":"arxiv_version","alias_value":"1505.03072v2","created_at":"2026-05-18T01:01:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.03072","created_at":"2026-05-18T01:01:42Z"},{"alias_kind":"pith_short_12","alias_value":"KDBNQI77DLUZ","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"KDBNQI77DLUZE4UT","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"KDBNQI77","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KDBNQI77DLUZE4UTYL3PXCYIEI","target":"record","payload":{"canonical_record":{"source":{"id":"1505.03072","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-12T15:58:41Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"948a5d4fc25202f42769a0a8cd960ac38a1f0f22248c32c71ecab163e0a100ec","abstract_canon_sha256":"e49afb80fd1d369aac90b348f95809de1a014c8289d6af4868bc76ce6b271a7a"},"schema_version":"1.0"},"canonical_sha256":"50c2d823ff1ae9927293c2f6fb8b08222c779a0086c98edf840199432912c4ab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:42.387436Z","signature_b64":"V3N/5917sc5c4jbmzWTKt7hxoK1s1hPvrUnC6fCi86q+SUy6aON3YUxhdP9Cp5w7WMOpZLkVkdcx6QFjVwhjBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50c2d823ff1ae9927293c2f6fb8b08222c779a0086c98edf840199432912c4ab","last_reissued_at":"2026-05-18T01:01:42.386876Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:42.386876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.03072","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-18T01:01:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+/JleXxk8HLJU7Q9PfQ4OjI/8c9tYbperl51TwqpGIxlJoJrR2NiGuOsCfNddmdCD8cMKemn2JZhGtTNj7HWCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:52:30.482799Z"},"content_sha256":"3b0555c0ae3076a8d3c706fe015c7a13464f6d4c9a1f65e5e51e2322d74e6ffb","schema_version":"1.0","event_id":"sha256:3b0555c0ae3076a8d3c706fe015c7a13464f6d4c9a1f65e5e51e2322d74e6ffb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KDBNQI77DLUZE4UTYL3PXCYIEI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Full subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jacques Verstra\\\"ete, Klas Markstr\\\"om, Victor Falgas-Ravry","submitted_at":"2015-05-12T15:58:41Z","abstract_excerpt":"Let $G=(V,E)$ be a graph of density $p$ on $n$ vertices. Following Erd\\H{o}s, \\L uczak and Spencer, an $m$-vertex subgraph $H$ of $G$ is called {\\em full} if $H$ has minimum degree at least $p(m - 1)$. Let $f(G)$ denote the order of a largest full subgraph of $G$. If $p\\binom{n}{2}$ is a non-negative integer, define \\[ f(n,p) = \\min\\{f(G) : \\vert V(G)\\vert = n, \\ \\vert E(G)\\vert = p\\binom{n}{2} \\}.\\] Erd\\H{o}s, \\L uczak and Spencer proved that for $n \\geq 2$, \\[ (2n)^{\\frac{1}{2}} - 2 \\leq f(n, {\\frac{1}{2}}) \\leq 4n^{\\frac{2}{3}}(\\log n)^{\\frac{1}{3}}.\\] In this paper, we prove the following "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.03072","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-18T01:01:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h9cQqnJxKTHzmpCgi5F5TP1gvdrBp41o+8YQFOwrkuYu+qObBGkYmGyPixoAziFw4ji4cs8UoUbWgkV2VZTbCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:52:30.483150Z"},"content_sha256":"96dad3ca779f04de068ccd1e5540f2d9ab51701612f9903b250e253eb55792f4","schema_version":"1.0","event_id":"sha256:96dad3ca779f04de068ccd1e5540f2d9ab51701612f9903b250e253eb55792f4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KDBNQI77DLUZE4UTYL3PXCYIEI/bundle.json","state_url":"https://pith.science/pith/KDBNQI77DLUZE4UTYL3PXCYIEI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KDBNQI77DLUZE4UTYL3PXCYIEI/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-06-02T20:52:30Z","links":{"resolver":"https://pith.science/pith/KDBNQI77DLUZE4UTYL3PXCYIEI","bundle":"https://pith.science/pith/KDBNQI77DLUZE4UTYL3PXCYIEI/bundle.json","state":"https://pith.science/pith/KDBNQI77DLUZE4UTYL3PXCYIEI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KDBNQI77DLUZE4UTYL3PXCYIEI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KDBNQI77DLUZE4UTYL3PXCYIEI","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":"e49afb80fd1d369aac90b348f95809de1a014c8289d6af4868bc76ce6b271a7a","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-12T15:58:41Z","title_canon_sha256":"948a5d4fc25202f42769a0a8cd960ac38a1f0f22248c32c71ecab163e0a100ec"},"schema_version":"1.0","source":{"id":"1505.03072","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.03072","created_at":"2026-05-18T01:01:42Z"},{"alias_kind":"arxiv_version","alias_value":"1505.03072v2","created_at":"2026-05-18T01:01:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.03072","created_at":"2026-05-18T01:01:42Z"},{"alias_kind":"pith_short_12","alias_value":"KDBNQI77DLUZ","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"KDBNQI77DLUZE4UT","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"KDBNQI77","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:96dad3ca779f04de068ccd1e5540f2d9ab51701612f9903b250e253eb55792f4","target":"graph","created_at":"2026-05-18T01:01:42Z","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":"Let $G=(V,E)$ be a graph of density $p$ on $n$ vertices. Following Erd\\H{o}s, \\L uczak and Spencer, an $m$-vertex subgraph $H$ of $G$ is called {\\em full} if $H$ has minimum degree at least $p(m - 1)$. Let $f(G)$ denote the order of a largest full subgraph of $G$. If $p\\binom{n}{2}$ is a non-negative integer, define \\[ f(n,p) = \\min\\{f(G) : \\vert V(G)\\vert = n, \\ \\vert E(G)\\vert = p\\binom{n}{2} \\}.\\] Erd\\H{o}s, \\L uczak and Spencer proved that for $n \\geq 2$, \\[ (2n)^{\\frac{1}{2}} - 2 \\leq f(n, {\\frac{1}{2}}) \\leq 4n^{\\frac{2}{3}}(\\log n)^{\\frac{1}{3}}.\\] In this paper, we prove the following ","authors_text":"Jacques Verstra\\\"ete, Klas Markstr\\\"om, Victor Falgas-Ravry","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-12T15:58:41Z","title":"Full subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.03072","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:3b0555c0ae3076a8d3c706fe015c7a13464f6d4c9a1f65e5e51e2322d74e6ffb","target":"record","created_at":"2026-05-18T01:01:42Z","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":"e49afb80fd1d369aac90b348f95809de1a014c8289d6af4868bc76ce6b271a7a","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-12T15:58:41Z","title_canon_sha256":"948a5d4fc25202f42769a0a8cd960ac38a1f0f22248c32c71ecab163e0a100ec"},"schema_version":"1.0","source":{"id":"1505.03072","kind":"arxiv","version":2}},"canonical_sha256":"50c2d823ff1ae9927293c2f6fb8b08222c779a0086c98edf840199432912c4ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"50c2d823ff1ae9927293c2f6fb8b08222c779a0086c98edf840199432912c4ab","first_computed_at":"2026-05-18T01:01:42.386876Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:42.386876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V3N/5917sc5c4jbmzWTKt7hxoK1s1hPvrUnC6fCi86q+SUy6aON3YUxhdP9Cp5w7WMOpZLkVkdcx6QFjVwhjBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:42.387436Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.03072","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b0555c0ae3076a8d3c706fe015c7a13464f6d4c9a1f65e5e51e2322d74e6ffb","sha256:96dad3ca779f04de068ccd1e5540f2d9ab51701612f9903b250e253eb55792f4"],"state_sha256":"18efb30a9da1049ce5f4efdd0c40b948d620937dd091c772d52b9646159ebdbd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FeQOYMVz3DJUJLFlGLTIHCyAzP1ilVkDoH8mfK5QDBXth0K5cafqrpZJhwk030ti8DUJfhO8/QMlSlHcmqhsCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T20:52:30.485084Z","bundle_sha256":"70b7a61e60451b3798dfd2acf02cd56c8f02fb9928daab57d760e8d3aa2d3a22"}}