{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:UH3KJ7JIQAH7LXJQKGHZVL4SN7","short_pith_number":"pith:UH3KJ7JI","canonical_record":{"source":{"id":"1211.2409","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-11T12:14:21Z","cross_cats_sorted":[],"title_canon_sha256":"bffd143d83d4be14ecbd559439a34d9544a11683b2ab6b7bec6cd206af6213aa","abstract_canon_sha256":"345cce7037d37e92013721fb42e6ce1c11ab7ecfb12a8b80146cd81af9bd3c28"},"schema_version":"1.0"},"canonical_sha256":"a1f6a4fd28800ff5dd30518f9aaf926fcc9bbb24ad99f8a13a6f5711357f8a19","source":{"kind":"arxiv","id":"1211.2409","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.2409","created_at":"2026-05-18T03:41:03Z"},{"alias_kind":"arxiv_version","alias_value":"1211.2409v1","created_at":"2026-05-18T03:41:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.2409","created_at":"2026-05-18T03:41:03Z"},{"alias_kind":"pith_short_12","alias_value":"UH3KJ7JIQAH7","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"UH3KJ7JIQAH7LXJQ","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"UH3KJ7JI","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:UH3KJ7JIQAH7LXJQKGHZVL4SN7","target":"record","payload":{"canonical_record":{"source":{"id":"1211.2409","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-11T12:14:21Z","cross_cats_sorted":[],"title_canon_sha256":"bffd143d83d4be14ecbd559439a34d9544a11683b2ab6b7bec6cd206af6213aa","abstract_canon_sha256":"345cce7037d37e92013721fb42e6ce1c11ab7ecfb12a8b80146cd81af9bd3c28"},"schema_version":"1.0"},"canonical_sha256":"a1f6a4fd28800ff5dd30518f9aaf926fcc9bbb24ad99f8a13a6f5711357f8a19","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:03.399975Z","signature_b64":"g3ust/3Ogwq+HR9rtLy79rseYiYTzoFVW3vR4RLLxTAEwrrvHQRsLOCSbUJsyOAqDI2Gb55QYoyA//XagxreCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1f6a4fd28800ff5dd30518f9aaf926fcc9bbb24ad99f8a13a6f5711357f8a19","last_reissued_at":"2026-05-18T03:41:03.399515Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:03.399515Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.2409","source_version":1,"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-18T03:41:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vo+hyIGjuHiao9MIeUDnnAZdjIGrtBlRcNYN6ZK6oOWbiAaUx4IXNIUa+hwulhQ4KPtyB71WjJ/8bvkouDfAAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:14:03.099143Z"},"content_sha256":"12363a92669be74f3e98aadfbc92645dcd91733e4667b9725018745370d2453e","schema_version":"1.0","event_id":"sha256:12363a92669be74f3e98aadfbc92645dcd91733e4667b9725018745370d2453e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:UH3KJ7JIQAH7LXJQKGHZVL4SN7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-embeddability of geometric lattices and buildings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kathrin Vorwerk, Martin Tancer","submitted_at":"2012-11-11T12:14:21Z","abstract_excerpt":"A fundamental question for simplicial complexes is to find the lowest dimensional Euclidean space in which they can be embedded. We investigate this question for order complexes of posets. We show that order complexes of thick geometric lattices as well as several classes of finite buildings, all of which are order complexes, are hard to embed. That means that such d-dimensional complexes require (2d + 1)-dimensional Euclidean space for an embedding. (This dimension is in general always sufficient for any d-complex.)\n  We develop a method to show non-embeddability for general order complexes o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.2409","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"},"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-18T03:41:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ASst86AecwDkCU/y1McXiUhAU4E39wETE9Edc3tKg0kGO7llfBLZD9Ziw0N2Dtl1r5v1vkDd/IL1PxNDiC6lDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:14:03.099805Z"},"content_sha256":"8012e0beaeec9f7ef20b35321404399d6740a9929a9e017c9a0905e888f89216","schema_version":"1.0","event_id":"sha256:8012e0beaeec9f7ef20b35321404399d6740a9929a9e017c9a0905e888f89216"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UH3KJ7JIQAH7LXJQKGHZVL4SN7/bundle.json","state_url":"https://pith.science/pith/UH3KJ7JIQAH7LXJQKGHZVL4SN7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UH3KJ7JIQAH7LXJQKGHZVL4SN7/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-28T15:14:03Z","links":{"resolver":"https://pith.science/pith/UH3KJ7JIQAH7LXJQKGHZVL4SN7","bundle":"https://pith.science/pith/UH3KJ7JIQAH7LXJQKGHZVL4SN7/bundle.json","state":"https://pith.science/pith/UH3KJ7JIQAH7LXJQKGHZVL4SN7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UH3KJ7JIQAH7LXJQKGHZVL4SN7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:UH3KJ7JIQAH7LXJQKGHZVL4SN7","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":"345cce7037d37e92013721fb42e6ce1c11ab7ecfb12a8b80146cd81af9bd3c28","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-11T12:14:21Z","title_canon_sha256":"bffd143d83d4be14ecbd559439a34d9544a11683b2ab6b7bec6cd206af6213aa"},"schema_version":"1.0","source":{"id":"1211.2409","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.2409","created_at":"2026-05-18T03:41:03Z"},{"alias_kind":"arxiv_version","alias_value":"1211.2409v1","created_at":"2026-05-18T03:41:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.2409","created_at":"2026-05-18T03:41:03Z"},{"alias_kind":"pith_short_12","alias_value":"UH3KJ7JIQAH7","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"UH3KJ7JIQAH7LXJQ","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"UH3KJ7JI","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:8012e0beaeec9f7ef20b35321404399d6740a9929a9e017c9a0905e888f89216","target":"graph","created_at":"2026-05-18T03:41:03Z","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":"A fundamental question for simplicial complexes is to find the lowest dimensional Euclidean space in which they can be embedded. We investigate this question for order complexes of posets. We show that order complexes of thick geometric lattices as well as several classes of finite buildings, all of which are order complexes, are hard to embed. That means that such d-dimensional complexes require (2d + 1)-dimensional Euclidean space for an embedding. (This dimension is in general always sufficient for any d-complex.)\n  We develop a method to show non-embeddability for general order complexes o","authors_text":"Kathrin Vorwerk, Martin Tancer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-11T12:14:21Z","title":"Non-embeddability of geometric lattices and buildings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.2409","kind":"arxiv","version":1},"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:12363a92669be74f3e98aadfbc92645dcd91733e4667b9725018745370d2453e","target":"record","created_at":"2026-05-18T03:41:03Z","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":"345cce7037d37e92013721fb42e6ce1c11ab7ecfb12a8b80146cd81af9bd3c28","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-11T12:14:21Z","title_canon_sha256":"bffd143d83d4be14ecbd559439a34d9544a11683b2ab6b7bec6cd206af6213aa"},"schema_version":"1.0","source":{"id":"1211.2409","kind":"arxiv","version":1}},"canonical_sha256":"a1f6a4fd28800ff5dd30518f9aaf926fcc9bbb24ad99f8a13a6f5711357f8a19","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a1f6a4fd28800ff5dd30518f9aaf926fcc9bbb24ad99f8a13a6f5711357f8a19","first_computed_at":"2026-05-18T03:41:03.399515Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:03.399515Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g3ust/3Ogwq+HR9rtLy79rseYiYTzoFVW3vR4RLLxTAEwrrvHQRsLOCSbUJsyOAqDI2Gb55QYoyA//XagxreCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:03.399975Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.2409","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12363a92669be74f3e98aadfbc92645dcd91733e4667b9725018745370d2453e","sha256:8012e0beaeec9f7ef20b35321404399d6740a9929a9e017c9a0905e888f89216"],"state_sha256":"7d1cacc379d54a66ffbc99ec052029d2bffc65c77790c3e7a88ab255be4e776c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"suzOFXFSJSpQH89oXgrie4yXCJOP2nXD+3nHC6HasCOp5P3+9YQqwHsLHlqa9lHwPNUxJvrGwLLxSUQL+HDRBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T15:14:03.103032Z","bundle_sha256":"5dc2ad7468e77460967d4473d39a359d7a5f46f9e4388a5660921b661eb23494"}}