{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XCR2ACRUX3NPRAYFTE4HEHZVEE","short_pith_number":"pith:XCR2ACRU","canonical_record":{"source":{"id":"1803.10349","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-27T22:39:17Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"6db84ed6a2ef7b24bed2b97a9ff662f1b2825451a9dd0498df6fc19e5c6716ad","abstract_canon_sha256":"cb4ca4ea7059f0883b94982647dc6cf8bb2c9b8d95db601a64a62249d66ce0e2"},"schema_version":"1.0"},"canonical_sha256":"b8a3a00a34bedaf883059938721f352101259e84c55d28a45acb87f920435efe","source":{"kind":"arxiv","id":"1803.10349","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.10349","created_at":"2026-05-18T00:19:55Z"},{"alias_kind":"arxiv_version","alias_value":"1803.10349v1","created_at":"2026-05-18T00:19:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10349","created_at":"2026-05-18T00:19:55Z"},{"alias_kind":"pith_short_12","alias_value":"XCR2ACRUX3NP","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XCR2ACRUX3NPRAYF","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XCR2ACRU","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XCR2ACRUX3NPRAYFTE4HEHZVEE","target":"record","payload":{"canonical_record":{"source":{"id":"1803.10349","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-27T22:39:17Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"6db84ed6a2ef7b24bed2b97a9ff662f1b2825451a9dd0498df6fc19e5c6716ad","abstract_canon_sha256":"cb4ca4ea7059f0883b94982647dc6cf8bb2c9b8d95db601a64a62249d66ce0e2"},"schema_version":"1.0"},"canonical_sha256":"b8a3a00a34bedaf883059938721f352101259e84c55d28a45acb87f920435efe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:55.704442Z","signature_b64":"ol+jgrVVE3pfIyJ4Xfb4llKHDl3nsHh6DRjHy6zFqU+D7yZuTsp3/llvgTbWNGE9xC9xz4i0SOC6YlFDzHvdCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8a3a00a34bedaf883059938721f352101259e84c55d28a45acb87f920435efe","last_reissued_at":"2026-05-18T00:19:55.703839Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:55.703839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.10349","source_version":1,"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-18T00:19:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fTtY4Ijnto4M/vl+/OJX5HHNcmVf9C6DueylECE8HG27E3JLjXWYZD2xeIoQp3rZ85GkXU6crcxZHR5ZQcEWCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:33:00.866851Z"},"content_sha256":"cfa54d2637342069b415dcbf0091bcc8da25ad8d207b2601ade676c7fa40362a","schema_version":"1.0","event_id":"sha256:cfa54d2637342069b415dcbf0091bcc8da25ad8d207b2601ade676c7fa40362a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XCR2ACRUX3NPRAYFTE4HEHZVEE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dense Subgraphs in Random Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Alexander Veremyev, B\\'ela Bollob\\'as, Julian Sahasrabudhe, Paul Balister","submitted_at":"2018-03-27T22:39:17Z","abstract_excerpt":"For a constant $\\gamma \\in[0,1]$ and a graph $G$, let $\\omega_{\\gamma}(G)$ be the largest integer $k$ for which there exists a $k$-vertex subgraph of $G$ with at least $\\gamma\\binom{k}{2}$ edges. We show that if $0<p<\\gamma<1$ then $\\omega_{\\gamma}(G_{n,p})$ is concentrated on a set of two integers. More precisely, with $\\alpha(\\gamma,p)=\\gamma\\log\\frac{\\gamma}{p}+(1-\\gamma)\\log\\frac{1-\\gamma}{1-p}$, we show that $\\omega_{\\gamma}(G_{n,p})$ is one of the two integers closest to $\\frac{2}{\\alpha(\\gamma,p)}\\big(\\log n-\\log\\log n+\\log\\frac{e\\alpha(\\gamma,p)}{2}\\big)+\\frac{1}{2}$, with high probabi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.10349","kind":"arxiv","version":1},"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-18T00:19:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nXMpUvMrgm5Hhet3tRSg402ubP4nLHDSIn6A7BV9ZuDU+xFIy2VFrmy2A4oKWbqKCWbdt6SwW+4PuiSc9bZICw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:33:00.867201Z"},"content_sha256":"04cba57d5e18c411397496cdf57b50ecee66083efcf617951ce8d90a7f1c0686","schema_version":"1.0","event_id":"sha256:04cba57d5e18c411397496cdf57b50ecee66083efcf617951ce8d90a7f1c0686"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XCR2ACRUX3NPRAYFTE4HEHZVEE/bundle.json","state_url":"https://pith.science/pith/XCR2ACRUX3NPRAYFTE4HEHZVEE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XCR2ACRUX3NPRAYFTE4HEHZVEE/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-02T07:33:00Z","links":{"resolver":"https://pith.science/pith/XCR2ACRUX3NPRAYFTE4HEHZVEE","bundle":"https://pith.science/pith/XCR2ACRUX3NPRAYFTE4HEHZVEE/bundle.json","state":"https://pith.science/pith/XCR2ACRUX3NPRAYFTE4HEHZVEE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XCR2ACRUX3NPRAYFTE4HEHZVEE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XCR2ACRUX3NPRAYFTE4HEHZVEE","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":"cb4ca4ea7059f0883b94982647dc6cf8bb2c9b8d95db601a64a62249d66ce0e2","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-27T22:39:17Z","title_canon_sha256":"6db84ed6a2ef7b24bed2b97a9ff662f1b2825451a9dd0498df6fc19e5c6716ad"},"schema_version":"1.0","source":{"id":"1803.10349","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.10349","created_at":"2026-05-18T00:19:55Z"},{"alias_kind":"arxiv_version","alias_value":"1803.10349v1","created_at":"2026-05-18T00:19:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10349","created_at":"2026-05-18T00:19:55Z"},{"alias_kind":"pith_short_12","alias_value":"XCR2ACRUX3NP","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XCR2ACRUX3NPRAYF","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XCR2ACRU","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:04cba57d5e18c411397496cdf57b50ecee66083efcf617951ce8d90a7f1c0686","target":"graph","created_at":"2026-05-18T00:19:55Z","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":"For a constant $\\gamma \\in[0,1]$ and a graph $G$, let $\\omega_{\\gamma}(G)$ be the largest integer $k$ for which there exists a $k$-vertex subgraph of $G$ with at least $\\gamma\\binom{k}{2}$ edges. We show that if $0<p<\\gamma<1$ then $\\omega_{\\gamma}(G_{n,p})$ is concentrated on a set of two integers. More precisely, with $\\alpha(\\gamma,p)=\\gamma\\log\\frac{\\gamma}{p}+(1-\\gamma)\\log\\frac{1-\\gamma}{1-p}$, we show that $\\omega_{\\gamma}(G_{n,p})$ is one of the two integers closest to $\\frac{2}{\\alpha(\\gamma,p)}\\big(\\log n-\\log\\log n+\\log\\frac{e\\alpha(\\gamma,p)}{2}\\big)+\\frac{1}{2}$, with high probabi","authors_text":"Alexander Veremyev, B\\'ela Bollob\\'as, Julian Sahasrabudhe, Paul Balister","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-27T22:39:17Z","title":"Dense Subgraphs in Random Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.10349","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:cfa54d2637342069b415dcbf0091bcc8da25ad8d207b2601ade676c7fa40362a","target":"record","created_at":"2026-05-18T00:19:55Z","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":"cb4ca4ea7059f0883b94982647dc6cf8bb2c9b8d95db601a64a62249d66ce0e2","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-27T22:39:17Z","title_canon_sha256":"6db84ed6a2ef7b24bed2b97a9ff662f1b2825451a9dd0498df6fc19e5c6716ad"},"schema_version":"1.0","source":{"id":"1803.10349","kind":"arxiv","version":1}},"canonical_sha256":"b8a3a00a34bedaf883059938721f352101259e84c55d28a45acb87f920435efe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8a3a00a34bedaf883059938721f352101259e84c55d28a45acb87f920435efe","first_computed_at":"2026-05-18T00:19:55.703839Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:55.703839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ol+jgrVVE3pfIyJ4Xfb4llKHDl3nsHh6DRjHy6zFqU+D7yZuTsp3/llvgTbWNGE9xC9xz4i0SOC6YlFDzHvdCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:55.704442Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.10349","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cfa54d2637342069b415dcbf0091bcc8da25ad8d207b2601ade676c7fa40362a","sha256:04cba57d5e18c411397496cdf57b50ecee66083efcf617951ce8d90a7f1c0686"],"state_sha256":"b7b57b0e2bbf476f1f96b7bd76b1b84edec02cc61669eb9d3bd4fc6c76f54350"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yG1dCPYmFtuGohTi8qimdmhosSrfyw/sGW/BbK4vEZmzROT2VjuCGr3x537IJruA7Wwhb6tk8oaAh2R6qEI9CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T07:33:00.869162Z","bundle_sha256":"da762c496fa32048167fa7e76f4e1ac8dfce101701939989f476049232d20aeb"}}