{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:HBCGMLERB7LTDJW6HD5IT7FM3B","short_pith_number":"pith:HBCGMLER","schema_version":"1.0","canonical_sha256":"3844662c910fd731a6de38fa89fcacd86a7b1f1e6c4858a4156e8a4fdc224d52","source":{"kind":"arxiv","id":"1205.6240","version":3},"attestation_state":"computed","paper":{"title":"On the non-planarity of a random subgraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alan Frieze, Michael Krivelevich","submitted_at":"2012-05-29T00:02:40Z","abstract_excerpt":"Let $G$ be a finite graph with minimum degree $r$. Form a random subgraph $G_p$ of $G$ by taking each edge of $G$ into $G_p$ independently and with probability $p$. We prove that for any constant $\\epsilon>0$, if $p=\\frac{1+\\epsilon}{r}$, then $G_p$ is non-planar with probability approaching 1 as $r$ grows. This generalizes classical results on planarity of binomial random graphs."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1205.6240","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-29T00:02:40Z","cross_cats_sorted":[],"title_canon_sha256":"c6d35cc83b86c982ba288f6158746d1bae074998fa8657c5a1dff07a2022ba6c","abstract_canon_sha256":"8a9492c3725bb64d79aa9bb5d4e604e76544968dee9bfd25d36537323a87e82d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:20:09.870310Z","signature_b64":"xQV6bnhsZRuhnyT2gW4tuLapBmTA3QVfFpS2TXrIxMggF6IrA6FnooJ5a435rzhNipkICkgBWB6yvJuF+Jl2Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3844662c910fd731a6de38fa89fcacd86a7b1f1e6c4858a4156e8a4fdc224d52","last_reissued_at":"2026-05-18T03:20:09.869847Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:20:09.869847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the non-planarity of a random subgraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alan Frieze, Michael Krivelevich","submitted_at":"2012-05-29T00:02:40Z","abstract_excerpt":"Let $G$ be a finite graph with minimum degree $r$. Form a random subgraph $G_p$ of $G$ by taking each edge of $G$ into $G_p$ independently and with probability $p$. We prove that for any constant $\\epsilon>0$, if $p=\\frac{1+\\epsilon}{r}$, then $G_p$ is non-planar with probability approaching 1 as $r$ grows. This generalizes classical results on planarity of binomial random graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.6240","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1205.6240","created_at":"2026-05-18T03:20:09.869911+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.6240v3","created_at":"2026-05-18T03:20:09.869911+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.6240","created_at":"2026-05-18T03:20:09.869911+00:00"},{"alias_kind":"pith_short_12","alias_value":"HBCGMLERB7LT","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"HBCGMLERB7LTDJW6","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"HBCGMLER","created_at":"2026-05-18T12:27:09.501522+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HBCGMLERB7LTDJW6HD5IT7FM3B","json":"https://pith.science/pith/HBCGMLERB7LTDJW6HD5IT7FM3B.json","graph_json":"https://pith.science/api/pith-number/HBCGMLERB7LTDJW6HD5IT7FM3B/graph.json","events_json":"https://pith.science/api/pith-number/HBCGMLERB7LTDJW6HD5IT7FM3B/events.json","paper":"https://pith.science/paper/HBCGMLER"},"agent_actions":{"view_html":"https://pith.science/pith/HBCGMLERB7LTDJW6HD5IT7FM3B","download_json":"https://pith.science/pith/HBCGMLERB7LTDJW6HD5IT7FM3B.json","view_paper":"https://pith.science/paper/HBCGMLER","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.6240&json=true","fetch_graph":"https://pith.science/api/pith-number/HBCGMLERB7LTDJW6HD5IT7FM3B/graph.json","fetch_events":"https://pith.science/api/pith-number/HBCGMLERB7LTDJW6HD5IT7FM3B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HBCGMLERB7LTDJW6HD5IT7FM3B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HBCGMLERB7LTDJW6HD5IT7FM3B/action/storage_attestation","attest_author":"https://pith.science/pith/HBCGMLERB7LTDJW6HD5IT7FM3B/action/author_attestation","sign_citation":"https://pith.science/pith/HBCGMLERB7LTDJW6HD5IT7FM3B/action/citation_signature","submit_replication":"https://pith.science/pith/HBCGMLERB7LTDJW6HD5IT7FM3B/action/replication_record"}},"created_at":"2026-05-18T03:20:09.869911+00:00","updated_at":"2026-05-18T03:20:09.869911+00:00"}