{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RPJIUR3RKNNXGQJG6TEGMJ53VT","short_pith_number":"pith:RPJIUR3R","schema_version":"1.0","canonical_sha256":"8bd28a4771535b734126f4c86627bbace63210565605954af8fc9f7080e4619e","source":{"kind":"arxiv","id":"1706.06202","version":1},"attestation_state":"computed","paper":{"title":"Maximal Planar Subgraphs of Fixed Girth in Random Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Manuel Fern\\'andez, Michael Tait, Nicholas Sieger","submitted_at":"2017-06-19T22:54:31Z","abstract_excerpt":"In 1991, Bollob\\'{a}s and Frieze showed that the threshold for $G_{n,p}$ to contain a spanning maximal planar subgraph is very close to $p = n^{-1/3}$. In this paper, we compute similar threshold ranges for $G_{n,p}$ to contain a maximal bipartite planar subgraph and for $G_{n,p}$ to contain a maximal planar subgraph of fixed girth $g$."},"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":"1706.06202","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-19T22:54:31Z","cross_cats_sorted":[],"title_canon_sha256":"8f3b5405476ea5ee04ca996f712836dc7996ed69abe7c4eb237a80dbf1919635","abstract_canon_sha256":"544d244d33b97ba8ab8fe191eb053c5bd2c465460755efdbbd011b2758890c81"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:03.955189Z","signature_b64":"o35QF0VJV/mCyTOrR3Pg7c9ePAg0cR9PRFJjTIqZT0fkfOOhqGGqYRbhZWY079l6y+wy59kBvMIs+XPswkWaCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8bd28a4771535b734126f4c86627bbace63210565605954af8fc9f7080e4619e","last_reissued_at":"2026-05-18T00:42:03.954536Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:03.954536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximal Planar Subgraphs of Fixed Girth in Random Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Manuel Fern\\'andez, Michael Tait, Nicholas Sieger","submitted_at":"2017-06-19T22:54:31Z","abstract_excerpt":"In 1991, Bollob\\'{a}s and Frieze showed that the threshold for $G_{n,p}$ to contain a spanning maximal planar subgraph is very close to $p = n^{-1/3}$. In this paper, we compute similar threshold ranges for $G_{n,p}$ to contain a maximal bipartite planar subgraph and for $G_{n,p}$ to contain a maximal planar subgraph of fixed girth $g$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.06202","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1706.06202","created_at":"2026-05-18T00:42:03.954642+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.06202v1","created_at":"2026-05-18T00:42:03.954642+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.06202","created_at":"2026-05-18T00:42:03.954642+00:00"},{"alias_kind":"pith_short_12","alias_value":"RPJIUR3RKNNX","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"RPJIUR3RKNNXGQJG","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"RPJIUR3R","created_at":"2026-05-18T12:31:39.905425+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/RPJIUR3RKNNXGQJG6TEGMJ53VT","json":"https://pith.science/pith/RPJIUR3RKNNXGQJG6TEGMJ53VT.json","graph_json":"https://pith.science/api/pith-number/RPJIUR3RKNNXGQJG6TEGMJ53VT/graph.json","events_json":"https://pith.science/api/pith-number/RPJIUR3RKNNXGQJG6TEGMJ53VT/events.json","paper":"https://pith.science/paper/RPJIUR3R"},"agent_actions":{"view_html":"https://pith.science/pith/RPJIUR3RKNNXGQJG6TEGMJ53VT","download_json":"https://pith.science/pith/RPJIUR3RKNNXGQJG6TEGMJ53VT.json","view_paper":"https://pith.science/paper/RPJIUR3R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.06202&json=true","fetch_graph":"https://pith.science/api/pith-number/RPJIUR3RKNNXGQJG6TEGMJ53VT/graph.json","fetch_events":"https://pith.science/api/pith-number/RPJIUR3RKNNXGQJG6TEGMJ53VT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RPJIUR3RKNNXGQJG6TEGMJ53VT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RPJIUR3RKNNXGQJG6TEGMJ53VT/action/storage_attestation","attest_author":"https://pith.science/pith/RPJIUR3RKNNXGQJG6TEGMJ53VT/action/author_attestation","sign_citation":"https://pith.science/pith/RPJIUR3RKNNXGQJG6TEGMJ53VT/action/citation_signature","submit_replication":"https://pith.science/pith/RPJIUR3RKNNXGQJG6TEGMJ53VT/action/replication_record"}},"created_at":"2026-05-18T00:42:03.954642+00:00","updated_at":"2026-05-18T00:42:03.954642+00:00"}