{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:NIP74E57FPO6WGFY3REZFMTUJB","short_pith_number":"pith:NIP74E57","schema_version":"1.0","canonical_sha256":"6a1ffe13bf2bddeb18b8dc4992b274485e7f91d6fe6f65f060fb974de7a79e49","source":{"kind":"arxiv","id":"1106.6254","version":2},"attestation_state":"computed","paper":{"title":"The maximum number of faces of the Minkowski sum of two 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":"2011-06-30T14:59:45Z","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\\oplus{}P_2$, of two $d$-dimensional convex polytopes $P_1$ and $P_2$, as a function of the number of vertices of the polytopes.\n  For even dimensions $d\\ge{}2$, the maximum values are attained when $P_1$ and $P_2$ are cyclic $d$-polytopes with disjoint vertex sets. For odd dimensions $d\\ge{}3$, the maximum values are attained when $P_1$ and $P_2$ are $\\lfloor\\frac{d}{2}\\rfloor$-neighborly $d$-polytopes, whose vertex sets are chosen appropriately from two distinct $d$-dimensional momen"},"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":"1106.6254","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-06-30T14:59:45Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"c0913b928569af481607043f628722ff50396023e3c5da57d192eb146e79051e","abstract_canon_sha256":"5a4659e1ae968dc95399fd48e4427a36ec9d5503e6ac9404e14972a613dab618"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:51.330884Z","signature_b64":"JRLrQsujsxcJFH9gEr3uxrWftFyJ9FvJG/8rF9Qie/lX+q9xLl85IgbnuIZ5d0ig5dmzL112t7lrkffSb+ryBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a1ffe13bf2bddeb18b8dc4992b274485e7f91d6fe6f65f060fb974de7a79e49","last_reissued_at":"2026-05-18T04:11:51.330226Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:51.330226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The maximum number of faces of the Minkowski sum of two 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":"2011-06-30T14:59:45Z","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\\oplus{}P_2$, of two $d$-dimensional convex polytopes $P_1$ and $P_2$, as a function of the number of vertices of the polytopes.\n  For even dimensions $d\\ge{}2$, the maximum values are attained when $P_1$ and $P_2$ are cyclic $d$-polytopes with disjoint vertex sets. For odd dimensions $d\\ge{}3$, the maximum values are attained when $P_1$ and $P_2$ are $\\lfloor\\frac{d}{2}\\rfloor$-neighborly $d$-polytopes, whose vertex sets are chosen appropriately from two distinct $d$-dimensional momen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.6254","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":"1106.6254","created_at":"2026-05-18T04:11:51.330341+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.6254v2","created_at":"2026-05-18T04:11:51.330341+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.6254","created_at":"2026-05-18T04:11:51.330341+00:00"},{"alias_kind":"pith_short_12","alias_value":"NIP74E57FPO6","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"NIP74E57FPO6WGFY","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"NIP74E57","created_at":"2026-05-18T12:26:37.096874+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/NIP74E57FPO6WGFY3REZFMTUJB","json":"https://pith.science/pith/NIP74E57FPO6WGFY3REZFMTUJB.json","graph_json":"https://pith.science/api/pith-number/NIP74E57FPO6WGFY3REZFMTUJB/graph.json","events_json":"https://pith.science/api/pith-number/NIP74E57FPO6WGFY3REZFMTUJB/events.json","paper":"https://pith.science/paper/NIP74E57"},"agent_actions":{"view_html":"https://pith.science/pith/NIP74E57FPO6WGFY3REZFMTUJB","download_json":"https://pith.science/pith/NIP74E57FPO6WGFY3REZFMTUJB.json","view_paper":"https://pith.science/paper/NIP74E57","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.6254&json=true","fetch_graph":"https://pith.science/api/pith-number/NIP74E57FPO6WGFY3REZFMTUJB/graph.json","fetch_events":"https://pith.science/api/pith-number/NIP74E57FPO6WGFY3REZFMTUJB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NIP74E57FPO6WGFY3REZFMTUJB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NIP74E57FPO6WGFY3REZFMTUJB/action/storage_attestation","attest_author":"https://pith.science/pith/NIP74E57FPO6WGFY3REZFMTUJB/action/author_attestation","sign_citation":"https://pith.science/pith/NIP74E57FPO6WGFY3REZFMTUJB/action/citation_signature","submit_replication":"https://pith.science/pith/NIP74E57FPO6WGFY3REZFMTUJB/action/replication_record"}},"created_at":"2026-05-18T04:11:51.330341+00:00","updated_at":"2026-05-18T04:11:51.330341+00:00"}