{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:UXXFHPW5L4LBLM4ZR6VOC5TVLP","short_pith_number":"pith:UXXFHPW5","schema_version":"1.0","canonical_sha256":"a5ee53bedd5f1615b3998faae176755bfe30cf84808ff1f374c19c85b0681850","source":{"kind":"arxiv","id":"1403.7980","version":4},"attestation_state":"computed","paper":{"title":"Embedding Stacked Polytopes on a Polynomial-Size Grid","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CG","authors_text":"Andre Schulz, Erik D. Demaine","submitted_at":"2014-03-31T13:03:45Z","abstract_excerpt":"A stacking operation adds a $d$-simplex on top of a facet of a simplicial $d$-polytope while maintaining the convexity of the polytope. A stacked $d$-polytope is a polytope that is obtained from a $d$-simplex and a series of stacking operations. We show that for a fixed $d$ every stacked $d$-polytope with $n$ vertices can be realized with nonnegative integer coordinates. The coordinates are bounded by $O(n^{2\\log(2d)})$, except for one axis, where the coordinates are bounded by $O(n^{3\\log(2d)})$. The described realization can be computed with an easy algorithm.\n  The realization of the polyto"},"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":"1403.7980","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-03-31T13:03:45Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"993f0cefc22e8d8410418ba4be9c68aefdea9aa824ebb8e3fd1a043d2e504b3c","abstract_canon_sha256":"59bc6907d5d8d28395e1c1eb07277a943364885e1bac3eec5383b58cadc4bdc3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:42.855979Z","signature_b64":"aTZZj8wWg2vCNGVXKbHU7UbzELWj0/EfjKawwKUzAung9o92aIjANq+YeRE1O/vN8UCKRbh/bYWkFaSZwYgiBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5ee53bedd5f1615b3998faae176755bfe30cf84808ff1f374c19c85b0681850","last_reissued_at":"2026-05-18T00:49:42.855472Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:42.855472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Embedding Stacked Polytopes on a Polynomial-Size Grid","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CG","authors_text":"Andre Schulz, Erik D. Demaine","submitted_at":"2014-03-31T13:03:45Z","abstract_excerpt":"A stacking operation adds a $d$-simplex on top of a facet of a simplicial $d$-polytope while maintaining the convexity of the polytope. A stacked $d$-polytope is a polytope that is obtained from a $d$-simplex and a series of stacking operations. We show that for a fixed $d$ every stacked $d$-polytope with $n$ vertices can be realized with nonnegative integer coordinates. The coordinates are bounded by $O(n^{2\\log(2d)})$, except for one axis, where the coordinates are bounded by $O(n^{3\\log(2d)})$. The described realization can be computed with an easy algorithm.\n  The realization of the polyto"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.7980","kind":"arxiv","version":4},"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":"1403.7980","created_at":"2026-05-18T00:49:42.855549+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.7980v4","created_at":"2026-05-18T00:49:42.855549+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.7980","created_at":"2026-05-18T00:49:42.855549+00:00"},{"alias_kind":"pith_short_12","alias_value":"UXXFHPW5L4LB","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"UXXFHPW5L4LBLM4Z","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"UXXFHPW5","created_at":"2026-05-18T12:28:52.271510+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/UXXFHPW5L4LBLM4ZR6VOC5TVLP","json":"https://pith.science/pith/UXXFHPW5L4LBLM4ZR6VOC5TVLP.json","graph_json":"https://pith.science/api/pith-number/UXXFHPW5L4LBLM4ZR6VOC5TVLP/graph.json","events_json":"https://pith.science/api/pith-number/UXXFHPW5L4LBLM4ZR6VOC5TVLP/events.json","paper":"https://pith.science/paper/UXXFHPW5"},"agent_actions":{"view_html":"https://pith.science/pith/UXXFHPW5L4LBLM4ZR6VOC5TVLP","download_json":"https://pith.science/pith/UXXFHPW5L4LBLM4ZR6VOC5TVLP.json","view_paper":"https://pith.science/paper/UXXFHPW5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.7980&json=true","fetch_graph":"https://pith.science/api/pith-number/UXXFHPW5L4LBLM4ZR6VOC5TVLP/graph.json","fetch_events":"https://pith.science/api/pith-number/UXXFHPW5L4LBLM4ZR6VOC5TVLP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UXXFHPW5L4LBLM4ZR6VOC5TVLP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UXXFHPW5L4LBLM4ZR6VOC5TVLP/action/storage_attestation","attest_author":"https://pith.science/pith/UXXFHPW5L4LBLM4ZR6VOC5TVLP/action/author_attestation","sign_citation":"https://pith.science/pith/UXXFHPW5L4LBLM4ZR6VOC5TVLP/action/citation_signature","submit_replication":"https://pith.science/pith/UXXFHPW5L4LBLM4ZR6VOC5TVLP/action/replication_record"}},"created_at":"2026-05-18T00:49:42.855549+00:00","updated_at":"2026-05-18T00:49:42.855549+00:00"}