{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:3XTKMA64HX5WCEHIA2GUDE2CHW","short_pith_number":"pith:3XTKMA64","schema_version":"1.0","canonical_sha256":"dde6a603dc3dfb6110e8068d4193423da783a54d049b0fbc05d261c5f3c38814","source":{"kind":"arxiv","id":"1311.0558","version":1},"attestation_state":"computed","paper":{"title":"A Quantitative Steinitz Theorem for Plane Triangulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DM"],"primary_cat":"math.CO","authors_text":"Igor Pak, Stedman Wilson","submitted_at":"2013-11-04T01:15:16Z","abstract_excerpt":"We give a new proof of Steinitz's classical theorem in the case of plane triangulations, which allows us to obtain a new general bound on the grid size of the simplicial polytope realizing a given triangulation, subexponential in a number of special cases.\n  Formally, we prove that every plane triangulation $G$ with $n$ vertices can be embedded in $\\mathbb{R}^2$ in such a way that it is the vertical projection of a convex polyhedral surface. We show that the vertices of this surface may be placed in a $4n^3 \\times 8n^5 \\times \\zeta(n)$ integer grid, where $\\zeta(n) \\leq (500 n^8)^{\\tau(G)}$ an"},"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":"1311.0558","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-04T01:15:16Z","cross_cats_sorted":["cs.CG","cs.DM"],"title_canon_sha256":"8f22b864fbeab81f691189077ce6c0ba4e52fd45db41ead71e40a3408d85d20f","abstract_canon_sha256":"b7bc776333010fc7ba6b9e36398a8fb80eb4f74c08c8891384ed2c2ec901b0b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:05.477224Z","signature_b64":"s+9MY/xwym2AiePpG5Xil5kAmc4v22552kHeZJ/PJdAr7lXswnA3fxP/twX14DDkNJPi2s8thj5yaU6zO1i6Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dde6a603dc3dfb6110e8068d4193423da783a54d049b0fbc05d261c5f3c38814","last_reissued_at":"2026-05-18T03:08:05.476752Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:05.476752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Quantitative Steinitz Theorem for Plane Triangulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DM"],"primary_cat":"math.CO","authors_text":"Igor Pak, Stedman Wilson","submitted_at":"2013-11-04T01:15:16Z","abstract_excerpt":"We give a new proof of Steinitz's classical theorem in the case of plane triangulations, which allows us to obtain a new general bound on the grid size of the simplicial polytope realizing a given triangulation, subexponential in a number of special cases.\n  Formally, we prove that every plane triangulation $G$ with $n$ vertices can be embedded in $\\mathbb{R}^2$ in such a way that it is the vertical projection of a convex polyhedral surface. We show that the vertices of this surface may be placed in a $4n^3 \\times 8n^5 \\times \\zeta(n)$ integer grid, where $\\zeta(n) \\leq (500 n^8)^{\\tau(G)}$ an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.0558","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":"1311.0558","created_at":"2026-05-18T03:08:05.476821+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.0558v1","created_at":"2026-05-18T03:08:05.476821+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.0558","created_at":"2026-05-18T03:08:05.476821+00:00"},{"alias_kind":"pith_short_12","alias_value":"3XTKMA64HX5W","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"3XTKMA64HX5WCEHI","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"3XTKMA64","created_at":"2026-05-18T12:27:32.513160+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/3XTKMA64HX5WCEHIA2GUDE2CHW","json":"https://pith.science/pith/3XTKMA64HX5WCEHIA2GUDE2CHW.json","graph_json":"https://pith.science/api/pith-number/3XTKMA64HX5WCEHIA2GUDE2CHW/graph.json","events_json":"https://pith.science/api/pith-number/3XTKMA64HX5WCEHIA2GUDE2CHW/events.json","paper":"https://pith.science/paper/3XTKMA64"},"agent_actions":{"view_html":"https://pith.science/pith/3XTKMA64HX5WCEHIA2GUDE2CHW","download_json":"https://pith.science/pith/3XTKMA64HX5WCEHIA2GUDE2CHW.json","view_paper":"https://pith.science/paper/3XTKMA64","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.0558&json=true","fetch_graph":"https://pith.science/api/pith-number/3XTKMA64HX5WCEHIA2GUDE2CHW/graph.json","fetch_events":"https://pith.science/api/pith-number/3XTKMA64HX5WCEHIA2GUDE2CHW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3XTKMA64HX5WCEHIA2GUDE2CHW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3XTKMA64HX5WCEHIA2GUDE2CHW/action/storage_attestation","attest_author":"https://pith.science/pith/3XTKMA64HX5WCEHIA2GUDE2CHW/action/author_attestation","sign_citation":"https://pith.science/pith/3XTKMA64HX5WCEHIA2GUDE2CHW/action/citation_signature","submit_replication":"https://pith.science/pith/3XTKMA64HX5WCEHIA2GUDE2CHW/action/replication_record"}},"created_at":"2026-05-18T03:08:05.476821+00:00","updated_at":"2026-05-18T03:08:05.476821+00:00"}