{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:JC3QPBWNEEOLXJ2CONP3MK6ICX","short_pith_number":"pith:JC3QPBWN","schema_version":"1.0","canonical_sha256":"48b70786cd211cbba742735fb62bc815ea2990868c26c7f548eec28e1fdadb0d","source":{"kind":"arxiv","id":"1509.08218","version":4},"attestation_state":"computed","paper":{"title":"Lower bound theorems for general polytopes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Yost, Guillermo Pineda-Villavicencio, Julien Ugon","submitted_at":"2015-09-28T07:09:59Z","abstract_excerpt":"For a $d$-dimensional polytope with $v$ vertices, $d+1\\le v\\le2d$, we calculate precisely the minimum possible number of $m$-dimensional faces, when $m=1$ or $m\\ge0.62d$. This confirms a conjecture of Gr\\\"unbaum, for these values of $m$. For $v=2d+1$, we solve the same problem when $m=1$ or $d-2$; the solution was already known for $m= d-1$. In all these cases, we give a characterisation of the minimising polytopes. We also show that there are many gaps in the possible number of $m$-faces: for example, there is no polytope with 80 edges in dimension 10, and a polytope with 407 edges can have d"},"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":"1509.08218","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-28T07:09:59Z","cross_cats_sorted":[],"title_canon_sha256":"46e1e494bff1813eb86fd7d6386d9499f82870c32dc765a3ac5de29bea813a3c","abstract_canon_sha256":"843db58a1a573a1cef41f3951300dc30dbf81241cf49f40025a5ddbe2e852747"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:15.714016Z","signature_b64":"a+aqcYK1ynWjylKelTD5EMmKLnF+dvvly3FrbB34MgxJEdILCHb6EnJsEeuXaiBEBSYz7eH+C7X1PtntpjxbDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48b70786cd211cbba742735fb62bc815ea2990868c26c7f548eec28e1fdadb0d","last_reissued_at":"2026-05-17T23:56:15.713244Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:15.713244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower bound theorems for general polytopes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Yost, Guillermo Pineda-Villavicencio, Julien Ugon","submitted_at":"2015-09-28T07:09:59Z","abstract_excerpt":"For a $d$-dimensional polytope with $v$ vertices, $d+1\\le v\\le2d$, we calculate precisely the minimum possible number of $m$-dimensional faces, when $m=1$ or $m\\ge0.62d$. This confirms a conjecture of Gr\\\"unbaum, for these values of $m$. For $v=2d+1$, we solve the same problem when $m=1$ or $d-2$; the solution was already known for $m= d-1$. In all these cases, we give a characterisation of the minimising polytopes. We also show that there are many gaps in the possible number of $m$-faces: for example, there is no polytope with 80 edges in dimension 10, and a polytope with 407 edges can have d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.08218","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":"1509.08218","created_at":"2026-05-17T23:56:15.713370+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.08218v4","created_at":"2026-05-17T23:56:15.713370+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.08218","created_at":"2026-05-17T23:56:15.713370+00:00"},{"alias_kind":"pith_short_12","alias_value":"JC3QPBWNEEOL","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"JC3QPBWNEEOLXJ2C","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"JC3QPBWN","created_at":"2026-05-18T12:29:27.538025+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/JC3QPBWNEEOLXJ2CONP3MK6ICX","json":"https://pith.science/pith/JC3QPBWNEEOLXJ2CONP3MK6ICX.json","graph_json":"https://pith.science/api/pith-number/JC3QPBWNEEOLXJ2CONP3MK6ICX/graph.json","events_json":"https://pith.science/api/pith-number/JC3QPBWNEEOLXJ2CONP3MK6ICX/events.json","paper":"https://pith.science/paper/JC3QPBWN"},"agent_actions":{"view_html":"https://pith.science/pith/JC3QPBWNEEOLXJ2CONP3MK6ICX","download_json":"https://pith.science/pith/JC3QPBWNEEOLXJ2CONP3MK6ICX.json","view_paper":"https://pith.science/paper/JC3QPBWN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.08218&json=true","fetch_graph":"https://pith.science/api/pith-number/JC3QPBWNEEOLXJ2CONP3MK6ICX/graph.json","fetch_events":"https://pith.science/api/pith-number/JC3QPBWNEEOLXJ2CONP3MK6ICX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JC3QPBWNEEOLXJ2CONP3MK6ICX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JC3QPBWNEEOLXJ2CONP3MK6ICX/action/storage_attestation","attest_author":"https://pith.science/pith/JC3QPBWNEEOLXJ2CONP3MK6ICX/action/author_attestation","sign_citation":"https://pith.science/pith/JC3QPBWNEEOLXJ2CONP3MK6ICX/action/citation_signature","submit_replication":"https://pith.science/pith/JC3QPBWNEEOLXJ2CONP3MK6ICX/action/replication_record"}},"created_at":"2026-05-17T23:56:15.713370+00:00","updated_at":"2026-05-17T23:56:15.713370+00:00"}