{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:FWZQSFMTOHQOKGL6G7N2WLCJKP","short_pith_number":"pith:FWZQSFMT","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"},"canonical_sha256":"2db309159371e0e5197e37dbab2c4953c76bde32deb98c0043f72f000989bc22","source":{"kind":"arxiv","id":"1311.2667","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.2667","created_at":"2026-05-18T02:41:42Z"},{"alias_kind":"arxiv_version","alias_value":"1311.2667v2","created_at":"2026-05-18T02:41:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.2667","created_at":"2026-05-18T02:41:42Z"},{"alias_kind":"pith_short_12","alias_value":"FWZQSFMTOHQO","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FWZQSFMTOHQOKGL6","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FWZQSFMT","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:FWZQSFMTOHQOKGL6G7N2WLCJKP","target":"record","payload":{"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"},"canonical_sha256":"2db309159371e0e5197e37dbab2c4953c76bde32deb98c0043f72f000989bc22","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"},"source_kind":"arxiv","source_id":"1311.2667","source_version":2,"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-18T02:41:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bKHJM6H3LzRw9S7ryYkx14vJvVtIX1PiX/bbZJZMzCbixznNVhCOtGRWjxFs10mWb9YoPq6zNe/1JCCLpxn1AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T19:38:42.842022Z"},"content_sha256":"3056d7a84048e6cdf07501aecd71e3309e802f27f51580367943eb46c4d8e99f","schema_version":"1.0","event_id":"sha256:3056d7a84048e6cdf07501aecd71e3309e802f27f51580367943eb46c4d8e99f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:FWZQSFMTOHQOKGL6G7N2WLCJKP","target":"graph","payload":{"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"},"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-18T02:41:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J4LtOUSf66JbDeORk+0wi1JOeuQfGMowk4NxG7RdQc3jlYhvOvLWSl3NnDIg7JGHgAgDyCMwx7A3S17k7d5+Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T19:38:42.842435Z"},"content_sha256":"9dea8c5a45d4e4a2a4324c031249f09a2626a2e698e047a9c6abe9f27b293eb7","schema_version":"1.0","event_id":"sha256:9dea8c5a45d4e4a2a4324c031249f09a2626a2e698e047a9c6abe9f27b293eb7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FWZQSFMTOHQOKGL6G7N2WLCJKP/bundle.json","state_url":"https://pith.science/pith/FWZQSFMTOHQOKGL6G7N2WLCJKP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FWZQSFMTOHQOKGL6G7N2WLCJKP/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-05-19T19:38:42Z","links":{"resolver":"https://pith.science/pith/FWZQSFMTOHQOKGL6G7N2WLCJKP","bundle":"https://pith.science/pith/FWZQSFMTOHQOKGL6G7N2WLCJKP/bundle.json","state":"https://pith.science/pith/FWZQSFMTOHQOKGL6G7N2WLCJKP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FWZQSFMTOHQOKGL6G7N2WLCJKP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:FWZQSFMTOHQOKGL6G7N2WLCJKP","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":"843670d18819792f96cc96f4eece3665f922778715e0811efe932e08046c0a85","cross_cats_sorted":["cs.CG","math.CO","math.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2013-11-12T03:50:41Z","title_canon_sha256":"2e572896a9c8f9a4c6a8d651efd7a093f6dee0950dd475a11d9362daacc0edfa"},"schema_version":"1.0","source":{"id":"1311.2667","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.2667","created_at":"2026-05-18T02:41:42Z"},{"alias_kind":"arxiv_version","alias_value":"1311.2667v2","created_at":"2026-05-18T02:41:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.2667","created_at":"2026-05-18T02:41:42Z"},{"alias_kind":"pith_short_12","alias_value":"FWZQSFMTOHQO","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FWZQSFMTOHQOKGL6","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FWZQSFMT","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:9dea8c5a45d4e4a2a4324c031249f09a2626a2e698e047a9c6abe9f27b293eb7","target":"graph","created_at":"2026-05-18T02:41:42Z","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":"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","authors_text":"Michael Freedman, Vyacheslav Krushkal","cross_cats":["cs.CG","math.CO","math.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2013-11-12T03:50:41Z","title":"Geometric complexity of embeddings in ${\\mathbb R}^d$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.2667","kind":"arxiv","version":2},"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:3056d7a84048e6cdf07501aecd71e3309e802f27f51580367943eb46c4d8e99f","target":"record","created_at":"2026-05-18T02:41:42Z","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":"843670d18819792f96cc96f4eece3665f922778715e0811efe932e08046c0a85","cross_cats_sorted":["cs.CG","math.CO","math.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2013-11-12T03:50:41Z","title_canon_sha256":"2e572896a9c8f9a4c6a8d651efd7a093f6dee0950dd475a11d9362daacc0edfa"},"schema_version":"1.0","source":{"id":"1311.2667","kind":"arxiv","version":2}},"canonical_sha256":"2db309159371e0e5197e37dbab2c4953c76bde32deb98c0043f72f000989bc22","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2db309159371e0e5197e37dbab2c4953c76bde32deb98c0043f72f000989bc22","first_computed_at":"2026-05-18T02:41:42.079033Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:42.079033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JKF+41l2n6UTBo3oLdD5DnJrYBE2fTKSvSkqWmS34dgKvdOCwrmePYyoG7va+DkicsRq4iAhRtLU7/gEFpFuDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:42.079641Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.2667","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3056d7a84048e6cdf07501aecd71e3309e802f27f51580367943eb46c4d8e99f","sha256:9dea8c5a45d4e4a2a4324c031249f09a2626a2e698e047a9c6abe9f27b293eb7"],"state_sha256":"fabbe22b3fb8b1f4feab4b6ef69c085fe28b248baf926e2e87f1ee28a2961fd6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m8wsTpM4jyVuQemLPn+63d6hShYdjE9s/eyzvozkkWIqFnGFKk74E2gNufkg997vm9VZfKFN4zQI2nWFMwGXBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T19:38:42.844611Z","bundle_sha256":"f5426009ce7ab2f8c1e508393f75ffa871dbd63d7340ecdc7bd0f858bf8b08ab"}}