{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:FWZQSFMTOHQOKGL6G7N2WLCJKP","short_pith_number":"pith:FWZQSFMT","schema_version":"1.0","canonical_sha256":"2db309159371e0e5197e37dbab2c4953c76bde32deb98c0043f72f000989bc22","source":{"kind":"arxiv","id":"1311.2667","version":2},"attestation_state":"computed","paper":{"title":"Geometric complexity of embeddings in ${\\mathbb R}^d$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.CO","math.GT"],"primary_cat":"math.MG","authors_text":"Michael Freedman, Vyacheslav Krushkal","submitted_at":"2013-11-12T03:50:41Z","abstract_excerpt":"Given a simplicial complex $K$, we consider several notions of geometric complexity of embeddings of $K$ in a Euclidean space ${\\mathbb R}^d$: thickness, distortion, and refinement complexity (the minimal number of simplices needed for a PL embedding). We show that any $n$-complex with $N$ simplices which topologically embeds in ${\\mathbb R}^{2n}$, $n>2$, can be PL embedded in ${\\mathbb R}^{2n}$ with refinement complexity $O(e^{N^{4+{\\epsilon}}})$. Families of simplicial $n$-complexes $K$ are constructed such that any embedding of $K$ into ${\\mathbb R}^{2n}$ has an exponential lower bound on t"},"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.2667","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2013-11-12T03:50:41Z","cross_cats_sorted":["cs.CG","math.CO","math.GT"],"title_canon_sha256":"2e572896a9c8f9a4c6a8d651efd7a093f6dee0950dd475a11d9362daacc0edfa","abstract_canon_sha256":"843670d18819792f96cc96f4eece3665f922778715e0811efe932e08046c0a85"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:42.079641Z","signature_b64":"JKF+41l2n6UTBo3oLdD5DnJrYBE2fTKSvSkqWmS34dgKvdOCwrmePYyoG7va+DkicsRq4iAhRtLU7/gEFpFuDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2db309159371e0e5197e37dbab2c4953c76bde32deb98c0043f72f000989bc22","last_reissued_at":"2026-05-18T02:41:42.079033Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:42.079033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Geometric complexity of embeddings in ${\\mathbb R}^d$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.CO","math.GT"],"primary_cat":"math.MG","authors_text":"Michael Freedman, Vyacheslav Krushkal","submitted_at":"2013-11-12T03:50:41Z","abstract_excerpt":"Given a simplicial complex $K$, we consider several notions of geometric complexity of embeddings of $K$ in a Euclidean space ${\\mathbb R}^d$: thickness, distortion, and refinement complexity (the minimal number of simplices needed for a PL embedding). We show that any $n$-complex with $N$ simplices which topologically embeds in ${\\mathbb R}^{2n}$, $n>2$, can be PL embedded in ${\\mathbb R}^{2n}$ with refinement complexity $O(e^{N^{4+{\\epsilon}}})$. Families of simplicial $n$-complexes $K$ are constructed such that any embedding of $K$ into ${\\mathbb R}^{2n}$ has an exponential lower bound on t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.2667","kind":"arxiv","version":2},"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.2667","created_at":"2026-05-18T02:41:42.079153+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.2667v2","created_at":"2026-05-18T02:41:42.079153+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.2667","created_at":"2026-05-18T02:41:42.079153+00:00"},{"alias_kind":"pith_short_12","alias_value":"FWZQSFMTOHQO","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"FWZQSFMTOHQOKGL6","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"FWZQSFMT","created_at":"2026-05-18T12:27:45.050594+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/FWZQSFMTOHQOKGL6G7N2WLCJKP","json":"https://pith.science/pith/FWZQSFMTOHQOKGL6G7N2WLCJKP.json","graph_json":"https://pith.science/api/pith-number/FWZQSFMTOHQOKGL6G7N2WLCJKP/graph.json","events_json":"https://pith.science/api/pith-number/FWZQSFMTOHQOKGL6G7N2WLCJKP/events.json","paper":"https://pith.science/paper/FWZQSFMT"},"agent_actions":{"view_html":"https://pith.science/pith/FWZQSFMTOHQOKGL6G7N2WLCJKP","download_json":"https://pith.science/pith/FWZQSFMTOHQOKGL6G7N2WLCJKP.json","view_paper":"https://pith.science/paper/FWZQSFMT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.2667&json=true","fetch_graph":"https://pith.science/api/pith-number/FWZQSFMTOHQOKGL6G7N2WLCJKP/graph.json","fetch_events":"https://pith.science/api/pith-number/FWZQSFMTOHQOKGL6G7N2WLCJKP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FWZQSFMTOHQOKGL6G7N2WLCJKP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FWZQSFMTOHQOKGL6G7N2WLCJKP/action/storage_attestation","attest_author":"https://pith.science/pith/FWZQSFMTOHQOKGL6G7N2WLCJKP/action/author_attestation","sign_citation":"https://pith.science/pith/FWZQSFMTOHQOKGL6G7N2WLCJKP/action/citation_signature","submit_replication":"https://pith.science/pith/FWZQSFMTOHQOKGL6G7N2WLCJKP/action/replication_record"}},"created_at":"2026-05-18T02:41:42.079153+00:00","updated_at":"2026-05-18T02:41:42.079153+00:00"}