{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7FKTCBK5XM7J6LFVNCTN5NSKV4","short_pith_number":"pith:7FKTCBK5","canonical_record":{"source":{"id":"1510.08258","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-28T11:22:12Z","cross_cats_sorted":[],"title_canon_sha256":"9cfee57e3d58f0f2ffce33b70d563c31d84e8573f96c316f72b5eabe3e1ae7ca","abstract_canon_sha256":"bd37f698622ed1d43d0f52c7cd6ef5685e8817052270e4e1c64b5983a5e48e2b"},"schema_version":"1.0"},"canonical_sha256":"f95531055dbb3e9f2cb568a6deb64aaf12bd4f8e1dc3871836c6d8a5e79b2732","source":{"kind":"arxiv","id":"1510.08258","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.08258","created_at":"2026-05-18T00:00:33Z"},{"alias_kind":"arxiv_version","alias_value":"1510.08258v3","created_at":"2026-05-18T00:00:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.08258","created_at":"2026-05-18T00:00:33Z"},{"alias_kind":"pith_short_12","alias_value":"7FKTCBK5XM7J","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7FKTCBK5XM7J6LFV","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7FKTCBK5","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7FKTCBK5XM7J6LFVNCTN5NSKV4","target":"record","payload":{"canonical_record":{"source":{"id":"1510.08258","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-28T11:22:12Z","cross_cats_sorted":[],"title_canon_sha256":"9cfee57e3d58f0f2ffce33b70d563c31d84e8573f96c316f72b5eabe3e1ae7ca","abstract_canon_sha256":"bd37f698622ed1d43d0f52c7cd6ef5685e8817052270e4e1c64b5983a5e48e2b"},"schema_version":"1.0"},"canonical_sha256":"f95531055dbb3e9f2cb568a6deb64aaf12bd4f8e1dc3871836c6d8a5e79b2732","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:33.048160Z","signature_b64":"9lo8pOUPIC0CMxRaqyOgFgJ/mxCQzx0qyKUzlHSF7P8PxLBYXoFx8noa6GlXQVJDYY4wwb84eFHo9DRxG8zWCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f95531055dbb3e9f2cb568a6deb64aaf12bd4f8e1dc3871836c6d8a5e79b2732","last_reissued_at":"2026-05-18T00:00:33.047722Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:33.047722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.08258","source_version":3,"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-18T00:00:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iAwI3legukbId0REI8Qd/Jmq9N8/YPNGCYhNVRznXFPjThMEtG7ebi3eKqPD5D0aoJdwxL/2x7ydWZ+WxvvKDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:17:14.991368Z"},"content_sha256":"37daef7f6a90368ff54423deb56e493d1ccf294ba1a28cc870a2e43b8a55bb9b","schema_version":"1.0","event_id":"sha256:37daef7f6a90368ff54423deb56e493d1ccf294ba1a28cc870a2e43b8a55bb9b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7FKTCBK5XM7J6LFVNCTN5NSKV4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Almost simplicial polytopes I. The lower and upper bound theorems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Yost, Eran Nevo, Guillermo Pineda-Villavicencio, Julien Ugon","submitted_at":"2015-10-28T11:22:12Z","abstract_excerpt":"We study $n$-vertex $d$-dimensional polytopes with at most one nonsimplex facet with, say, $d+s$ vertices, called {\\it almost simplicial polytopes}. We provide tight lower and upper bound theorems for these polytopes as functions of $d,n$ and $s$, thus generalizing the classical Lower Bound Theorem by Barnette and Upper Bound Theorem by McMullen, which treat the case of $s=0$. We characterize the minimizers and provide examples of maximizers, for any $d$. Our construction of maximizers is a generalization of cyclic polytopes, based on a suitable variation of the moment curve, and is of indepen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.08258","kind":"arxiv","version":3},"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-18T00:00:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2D8KynNIyygnLnar4y3B9FvAoY8Q3DAoJZPPXSXR3yL98zaTUAsM6Evzju4UM1gd8N6SFoKFjmTKp5mPgsALCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:17:14.991892Z"},"content_sha256":"589b8ae054e860b570fc6317713d949cfdc540b3522445be42448f4d47fd92a0","schema_version":"1.0","event_id":"sha256:589b8ae054e860b570fc6317713d949cfdc540b3522445be42448f4d47fd92a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7FKTCBK5XM7J6LFVNCTN5NSKV4/bundle.json","state_url":"https://pith.science/pith/7FKTCBK5XM7J6LFVNCTN5NSKV4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7FKTCBK5XM7J6LFVNCTN5NSKV4/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-06-07T14:17:14Z","links":{"resolver":"https://pith.science/pith/7FKTCBK5XM7J6LFVNCTN5NSKV4","bundle":"https://pith.science/pith/7FKTCBK5XM7J6LFVNCTN5NSKV4/bundle.json","state":"https://pith.science/pith/7FKTCBK5XM7J6LFVNCTN5NSKV4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7FKTCBK5XM7J6LFVNCTN5NSKV4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7FKTCBK5XM7J6LFVNCTN5NSKV4","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":"bd37f698622ed1d43d0f52c7cd6ef5685e8817052270e4e1c64b5983a5e48e2b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-28T11:22:12Z","title_canon_sha256":"9cfee57e3d58f0f2ffce33b70d563c31d84e8573f96c316f72b5eabe3e1ae7ca"},"schema_version":"1.0","source":{"id":"1510.08258","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.08258","created_at":"2026-05-18T00:00:33Z"},{"alias_kind":"arxiv_version","alias_value":"1510.08258v3","created_at":"2026-05-18T00:00:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.08258","created_at":"2026-05-18T00:00:33Z"},{"alias_kind":"pith_short_12","alias_value":"7FKTCBK5XM7J","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7FKTCBK5XM7J6LFV","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7FKTCBK5","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:589b8ae054e860b570fc6317713d949cfdc540b3522445be42448f4d47fd92a0","target":"graph","created_at":"2026-05-18T00:00:33Z","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":"We study $n$-vertex $d$-dimensional polytopes with at most one nonsimplex facet with, say, $d+s$ vertices, called {\\it almost simplicial polytopes}. We provide tight lower and upper bound theorems for these polytopes as functions of $d,n$ and $s$, thus generalizing the classical Lower Bound Theorem by Barnette and Upper Bound Theorem by McMullen, which treat the case of $s=0$. We characterize the minimizers and provide examples of maximizers, for any $d$. Our construction of maximizers is a generalization of cyclic polytopes, based on a suitable variation of the moment curve, and is of indepen","authors_text":"David Yost, Eran Nevo, Guillermo Pineda-Villavicencio, Julien Ugon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-28T11:22:12Z","title":"Almost simplicial polytopes I. The lower and upper bound theorems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.08258","kind":"arxiv","version":3},"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:37daef7f6a90368ff54423deb56e493d1ccf294ba1a28cc870a2e43b8a55bb9b","target":"record","created_at":"2026-05-18T00:00:33Z","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":"bd37f698622ed1d43d0f52c7cd6ef5685e8817052270e4e1c64b5983a5e48e2b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-28T11:22:12Z","title_canon_sha256":"9cfee57e3d58f0f2ffce33b70d563c31d84e8573f96c316f72b5eabe3e1ae7ca"},"schema_version":"1.0","source":{"id":"1510.08258","kind":"arxiv","version":3}},"canonical_sha256":"f95531055dbb3e9f2cb568a6deb64aaf12bd4f8e1dc3871836c6d8a5e79b2732","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f95531055dbb3e9f2cb568a6deb64aaf12bd4f8e1dc3871836c6d8a5e79b2732","first_computed_at":"2026-05-18T00:00:33.047722Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:33.047722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9lo8pOUPIC0CMxRaqyOgFgJ/mxCQzx0qyKUzlHSF7P8PxLBYXoFx8noa6GlXQVJDYY4wwb84eFHo9DRxG8zWCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:33.048160Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.08258","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:37daef7f6a90368ff54423deb56e493d1ccf294ba1a28cc870a2e43b8a55bb9b","sha256:589b8ae054e860b570fc6317713d949cfdc540b3522445be42448f4d47fd92a0"],"state_sha256":"70c700083fc97551eed861571b3ff59bfd2aa33fbbe14366c22f521fad210b34"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lrZoDjvtelgPPskGs3S+URFlh72lv58K5ewcy7Bw/b/Pgn8F3fs0QzygX1o55dSlJsu5WwhYgnEO1ZeLGettBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T14:17:14.994893Z","bundle_sha256":"2fc6538a333b77a166a41bc950b478bc1ef90a11c7eefde53aee9c33aec45d7c"}}