{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:HOX3DTV4OKUY64Z6DPBGFZYRUW","short_pith_number":"pith:HOX3DTV4","canonical_record":{"source":{"id":"1203.0132","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-01T10:18:47Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"4aae709e89f38b7ecb4205f270741222895ba1498c5e15eafe5f83b18a1b502a","abstract_canon_sha256":"b261677b0bc4f17317cdcb303311db46c600b6d4d5fde45b758591d46794e428"},"schema_version":"1.0"},"canonical_sha256":"3bafb1cebc72a98f733e1bc262e711a5845be8811e57ad5e97008cff52ecb733","source":{"kind":"arxiv","id":"1203.0132","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.0132","created_at":"2026-05-18T03:14:26Z"},{"alias_kind":"arxiv_version","alias_value":"1203.0132v1","created_at":"2026-05-18T03:14:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.0132","created_at":"2026-05-18T03:14:26Z"},{"alias_kind":"pith_short_12","alias_value":"HOX3DTV4OKUY","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"HOX3DTV4OKUY64Z6","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"HOX3DTV4","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:HOX3DTV4OKUY64Z6DPBGFZYRUW","target":"record","payload":{"canonical_record":{"source":{"id":"1203.0132","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-01T10:18:47Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"4aae709e89f38b7ecb4205f270741222895ba1498c5e15eafe5f83b18a1b502a","abstract_canon_sha256":"b261677b0bc4f17317cdcb303311db46c600b6d4d5fde45b758591d46794e428"},"schema_version":"1.0"},"canonical_sha256":"3bafb1cebc72a98f733e1bc262e711a5845be8811e57ad5e97008cff52ecb733","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:14:26.991211Z","signature_b64":"EuOUHLNdokOwNS9GMcAZdgOmBjT6+NdXo7TRTHJ5zIQE2GRN3M+1QHgOJ46B0RvNqj7if+qu4QmC7OFOfQ89Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3bafb1cebc72a98f733e1bc262e711a5845be8811e57ad5e97008cff52ecb733","last_reissued_at":"2026-05-18T03:14:26.990430Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:14:26.990430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.0132","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-18T03:14:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zZinY9C34PVdQ0G1B2XIaPxO2icZo6j2vUJswU1W/PyvI7iIUAM0ubADgOjx5rszMi+kS6RzIe58SS/ADVYsBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T23:53:33.828874Z"},"content_sha256":"2e504d422dd6b7bdcc78f02b555aa2ceabf8ddbe0b492f043459ed5df04ed6a4","schema_version":"1.0","event_id":"sha256:2e504d422dd6b7bdcc78f02b555aa2ceabf8ddbe0b492f043459ed5df04ed6a4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:HOX3DTV4OKUY64Z6DPBGFZYRUW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Largest sparse subgraphs of random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Colin McDiarmid, Nikolaos Fountoulakis, Ross J. Kang","submitted_at":"2012-03-01T10:18:47Z","abstract_excerpt":"For the Erd\\H{o}s-R\\'enyi random graph G(n,p), we give a precise asymptotic formula for the size of a largest vertex subset in G(n,p) that induces a subgraph with average degree at most t, provided that p = p(n) is not too small and t = t(n) is not too large. In the case of fixed t and p, we find that this value is asymptotically almost surely concentrated on at most two explicitly given points. This generalises a result on the independence number of random graphs. For both the upper and lower bounds, we rely on large deviations inequalities for the binomial distribution."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.0132","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-18T03:14:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h+lbjvO9ycthAO+pX9n/gdiFjYmJtYxcMVzvuEmZ77/NrltGfxC+Xp8qB5l1IC5aW+UAn0lzzCK5DQzUM0SgAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T23:53:33.829217Z"},"content_sha256":"631ebc4de3a96fd0dcfc942c4bbd0bd2dde29fd5a949da813a765eeb45c27b49","schema_version":"1.0","event_id":"sha256:631ebc4de3a96fd0dcfc942c4bbd0bd2dde29fd5a949da813a765eeb45c27b49"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HOX3DTV4OKUY64Z6DPBGFZYRUW/bundle.json","state_url":"https://pith.science/pith/HOX3DTV4OKUY64Z6DPBGFZYRUW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HOX3DTV4OKUY64Z6DPBGFZYRUW/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-24T23:53:33Z","links":{"resolver":"https://pith.science/pith/HOX3DTV4OKUY64Z6DPBGFZYRUW","bundle":"https://pith.science/pith/HOX3DTV4OKUY64Z6DPBGFZYRUW/bundle.json","state":"https://pith.science/pith/HOX3DTV4OKUY64Z6DPBGFZYRUW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HOX3DTV4OKUY64Z6DPBGFZYRUW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:HOX3DTV4OKUY64Z6DPBGFZYRUW","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":"b261677b0bc4f17317cdcb303311db46c600b6d4d5fde45b758591d46794e428","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-01T10:18:47Z","title_canon_sha256":"4aae709e89f38b7ecb4205f270741222895ba1498c5e15eafe5f83b18a1b502a"},"schema_version":"1.0","source":{"id":"1203.0132","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.0132","created_at":"2026-05-18T03:14:26Z"},{"alias_kind":"arxiv_version","alias_value":"1203.0132v1","created_at":"2026-05-18T03:14:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.0132","created_at":"2026-05-18T03:14:26Z"},{"alias_kind":"pith_short_12","alias_value":"HOX3DTV4OKUY","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"HOX3DTV4OKUY64Z6","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"HOX3DTV4","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:631ebc4de3a96fd0dcfc942c4bbd0bd2dde29fd5a949da813a765eeb45c27b49","target":"graph","created_at":"2026-05-18T03:14:26Z","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 the Erd\\H{o}s-R\\'enyi random graph G(n,p), we give a precise asymptotic formula for the size of a largest vertex subset in G(n,p) that induces a subgraph with average degree at most t, provided that p = p(n) is not too small and t = t(n) is not too large. In the case of fixed t and p, we find that this value is asymptotically almost surely concentrated on at most two explicitly given points. This generalises a result on the independence number of random graphs. For both the upper and lower bounds, we rely on large deviations inequalities for the binomial distribution.","authors_text":"Colin McDiarmid, Nikolaos Fountoulakis, Ross J. Kang","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-01T10:18:47Z","title":"Largest sparse subgraphs of random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.0132","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:2e504d422dd6b7bdcc78f02b555aa2ceabf8ddbe0b492f043459ed5df04ed6a4","target":"record","created_at":"2026-05-18T03:14:26Z","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":"b261677b0bc4f17317cdcb303311db46c600b6d4d5fde45b758591d46794e428","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-01T10:18:47Z","title_canon_sha256":"4aae709e89f38b7ecb4205f270741222895ba1498c5e15eafe5f83b18a1b502a"},"schema_version":"1.0","source":{"id":"1203.0132","kind":"arxiv","version":1}},"canonical_sha256":"3bafb1cebc72a98f733e1bc262e711a5845be8811e57ad5e97008cff52ecb733","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3bafb1cebc72a98f733e1bc262e711a5845be8811e57ad5e97008cff52ecb733","first_computed_at":"2026-05-18T03:14:26.990430Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:14:26.990430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EuOUHLNdokOwNS9GMcAZdgOmBjT6+NdXo7TRTHJ5zIQE2GRN3M+1QHgOJ46B0RvNqj7if+qu4QmC7OFOfQ89Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:14:26.991211Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.0132","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e504d422dd6b7bdcc78f02b555aa2ceabf8ddbe0b492f043459ed5df04ed6a4","sha256:631ebc4de3a96fd0dcfc942c4bbd0bd2dde29fd5a949da813a765eeb45c27b49"],"state_sha256":"3b9be9b061c233c18d0cd7038f28e3ea350d92e1aabbb98dfb695aa3a29c15d0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XtmjfM1EDyo2tkKXHTRueQ9UNAixzhg2Y2FSN1U6aIbS4R6FNdB/3NB90XmEfHPX/Yb9DtJNnGVHM2l4DxCODA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T23:53:33.831173Z","bundle_sha256":"b0a723c4d571588e990c2a0da2f01195c9236b5bcb658b014a403fab52331d1d"}}