{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GDTU5JJQVIYMDYZJIX35VXNECX","short_pith_number":"pith:GDTU5JJQ","schema_version":"1.0","canonical_sha256":"30e74ea530aa30c1e32945f7dadda415f5df19e5a2b7ae71eafef9004d974974","source":{"kind":"arxiv","id":"1502.02265","version":2},"attestation_state":"computed","paper":{"title":"A geometric approach for the upper bound theorem for Minkowski sums of convex polytopes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CG","authors_text":"Eleni Tzanaki, Menelaos I. Karavelas","submitted_at":"2015-02-08T15:54:48Z","abstract_excerpt":"We derive tight expressions for the maximum number of $k$-faces, $0\\le{}k\\le{}d-1$, of the Minkowski sum, $P_1+...+P_r$, of $r$ convex $d$-polytopes $P_1,...,P_r$ in $\\mathbb{R}^d$, where $d\\ge{}2$ and $r<d$, as a (recursively defined) function on the number of vertices of the polytopes.\n  Our results coincide with those recently proved by Adiprasito and Sanyal [2]. In contrast to Adiprasito and Sanyal's approach, which uses tools from Combinatorial Commutative Algebra, our approach is purely geometric and uses basic notions such as $f$- and $h$-vector calculus and shellings, and generalizes t"},"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":"1502.02265","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-02-08T15:54:48Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"b8158f390f046cb77fee78c8ee3ab963af72e155a4ec904afb4789b4aff9ab0e","abstract_canon_sha256":"6d8bb44c598c28a9eb600a09b072181d509d34054cd7a8a692a7e8d857934d9d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:55.509140Z","signature_b64":"waloLBJ1TErakby2J9MWirrpHAgXcSIZ5N7+RhH/2mW1FSGI1trZgJmQ4zkaU4o6OqTNIfaqnzrOutSmNY09Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30e74ea530aa30c1e32945f7dadda415f5df19e5a2b7ae71eafef9004d974974","last_reissued_at":"2026-05-18T02:25:55.508713Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:55.508713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A geometric approach for the upper bound theorem for Minkowski sums of convex polytopes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CG","authors_text":"Eleni Tzanaki, Menelaos I. Karavelas","submitted_at":"2015-02-08T15:54:48Z","abstract_excerpt":"We derive tight expressions for the maximum number of $k$-faces, $0\\le{}k\\le{}d-1$, of the Minkowski sum, $P_1+...+P_r$, of $r$ convex $d$-polytopes $P_1,...,P_r$ in $\\mathbb{R}^d$, where $d\\ge{}2$ and $r<d$, as a (recursively defined) function on the number of vertices of the polytopes.\n  Our results coincide with those recently proved by Adiprasito and Sanyal [2]. In contrast to Adiprasito and Sanyal's approach, which uses tools from Combinatorial Commutative Algebra, our approach is purely geometric and uses basic notions such as $f$- and $h$-vector calculus and shellings, and generalizes t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02265","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1502.02265","created_at":"2026-05-18T02:25:55.508783+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.02265v2","created_at":"2026-05-18T02:25:55.508783+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02265","created_at":"2026-05-18T02:25:55.508783+00:00"},{"alias_kind":"pith_short_12","alias_value":"GDTU5JJQVIYM","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GDTU5JJQVIYMDYZJ","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GDTU5JJQ","created_at":"2026-05-18T12:29:22.688609+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/GDTU5JJQVIYMDYZJIX35VXNECX","json":"https://pith.science/pith/GDTU5JJQVIYMDYZJIX35VXNECX.json","graph_json":"https://pith.science/api/pith-number/GDTU5JJQVIYMDYZJIX35VXNECX/graph.json","events_json":"https://pith.science/api/pith-number/GDTU5JJQVIYMDYZJIX35VXNECX/events.json","paper":"https://pith.science/paper/GDTU5JJQ"},"agent_actions":{"view_html":"https://pith.science/pith/GDTU5JJQVIYMDYZJIX35VXNECX","download_json":"https://pith.science/pith/GDTU5JJQVIYMDYZJIX35VXNECX.json","view_paper":"https://pith.science/paper/GDTU5JJQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.02265&json=true","fetch_graph":"https://pith.science/api/pith-number/GDTU5JJQVIYMDYZJIX35VXNECX/graph.json","fetch_events":"https://pith.science/api/pith-number/GDTU5JJQVIYMDYZJIX35VXNECX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GDTU5JJQVIYMDYZJIX35VXNECX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GDTU5JJQVIYMDYZJIX35VXNECX/action/storage_attestation","attest_author":"https://pith.science/pith/GDTU5JJQVIYMDYZJIX35VXNECX/action/author_attestation","sign_citation":"https://pith.science/pith/GDTU5JJQVIYMDYZJIX35VXNECX/action/citation_signature","submit_replication":"https://pith.science/pith/GDTU5JJQVIYMDYZJIX35VXNECX/action/replication_record"}},"created_at":"2026-05-18T02:25:55.508783+00:00","updated_at":"2026-05-18T02:25:55.508783+00:00"}