{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:NIP74E57FPO6WGFY3REZFMTUJB","short_pith_number":"pith:NIP74E57","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"},"canonical_sha256":"6a1ffe13bf2bddeb18b8dc4992b274485e7f91d6fe6f65f060fb974de7a79e49","source":{"kind":"arxiv","id":"1106.6254","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.6254","created_at":"2026-05-18T04:11:51Z"},{"alias_kind":"arxiv_version","alias_value":"1106.6254v2","created_at":"2026-05-18T04:11:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.6254","created_at":"2026-05-18T04:11:51Z"},{"alias_kind":"pith_short_12","alias_value":"NIP74E57FPO6","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NIP74E57FPO6WGFY","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NIP74E57","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:NIP74E57FPO6WGFY3REZFMTUJB","target":"record","payload":{"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"},"canonical_sha256":"6a1ffe13bf2bddeb18b8dc4992b274485e7f91d6fe6f65f060fb974de7a79e49","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"},"source_kind":"arxiv","source_id":"1106.6254","source_version":2,"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-18T04:11:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3Zx+WNfaeBjkuugg7OG2+lS99CsKAJqNrenzgCFLiNER3ySaehyDiLa1hOfluMwj47dT3BwENRIx47HQdZWOCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T06:24:40.328858Z"},"content_sha256":"533a63805f1bdf56e0eec0768dd508250f5a4ab6e0c02aa08192e5c613c8bd70","schema_version":"1.0","event_id":"sha256:533a63805f1bdf56e0eec0768dd508250f5a4ab6e0c02aa08192e5c613c8bd70"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:NIP74E57FPO6WGFY3REZFMTUJB","target":"graph","payload":{"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"},"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-18T04:11:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3GLinCzu4Qbj3KMep/uQQfDHLIFor8TLpJusNQn/867wLtExBE0Gl54phbL6TO3fGgitYxhje/4bjaMGXhV9BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T06:24:40.329595Z"},"content_sha256":"873218fe9fcb977dbf75cb3ee54728c2191194f9e8fbacfc1acdeb45e3cb507c","schema_version":"1.0","event_id":"sha256:873218fe9fcb977dbf75cb3ee54728c2191194f9e8fbacfc1acdeb45e3cb507c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NIP74E57FPO6WGFY3REZFMTUJB/bundle.json","state_url":"https://pith.science/pith/NIP74E57FPO6WGFY3REZFMTUJB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NIP74E57FPO6WGFY3REZFMTUJB/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-08T06:24:40Z","links":{"resolver":"https://pith.science/pith/NIP74E57FPO6WGFY3REZFMTUJB","bundle":"https://pith.science/pith/NIP74E57FPO6WGFY3REZFMTUJB/bundle.json","state":"https://pith.science/pith/NIP74E57FPO6WGFY3REZFMTUJB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NIP74E57FPO6WGFY3REZFMTUJB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:NIP74E57FPO6WGFY3REZFMTUJB","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":"5a4659e1ae968dc95399fd48e4427a36ec9d5503e6ac9404e14972a613dab618","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-06-30T14:59:45Z","title_canon_sha256":"c0913b928569af481607043f628722ff50396023e3c5da57d192eb146e79051e"},"schema_version":"1.0","source":{"id":"1106.6254","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.6254","created_at":"2026-05-18T04:11:51Z"},{"alias_kind":"arxiv_version","alias_value":"1106.6254v2","created_at":"2026-05-18T04:11:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.6254","created_at":"2026-05-18T04:11:51Z"},{"alias_kind":"pith_short_12","alias_value":"NIP74E57FPO6","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NIP74E57FPO6WGFY","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NIP74E57","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:873218fe9fcb977dbf75cb3ee54728c2191194f9e8fbacfc1acdeb45e3cb507c","target":"graph","created_at":"2026-05-18T04:11:51Z","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 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","authors_text":"Eleni Tzanaki, Menelaos I. Karavelas","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-06-30T14:59:45Z","title":"The maximum number of faces of the Minkowski sum of two convex polytopes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.6254","kind":"arxiv","version":2},"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:533a63805f1bdf56e0eec0768dd508250f5a4ab6e0c02aa08192e5c613c8bd70","target":"record","created_at":"2026-05-18T04:11:51Z","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":"5a4659e1ae968dc95399fd48e4427a36ec9d5503e6ac9404e14972a613dab618","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-06-30T14:59:45Z","title_canon_sha256":"c0913b928569af481607043f628722ff50396023e3c5da57d192eb146e79051e"},"schema_version":"1.0","source":{"id":"1106.6254","kind":"arxiv","version":2}},"canonical_sha256":"6a1ffe13bf2bddeb18b8dc4992b274485e7f91d6fe6f65f060fb974de7a79e49","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a1ffe13bf2bddeb18b8dc4992b274485e7f91d6fe6f65f060fb974de7a79e49","first_computed_at":"2026-05-18T04:11:51.330226Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:11:51.330226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JRLrQsujsxcJFH9gEr3uxrWftFyJ9FvJG/8rF9Qie/lX+q9xLl85IgbnuIZ5d0ig5dmzL112t7lrkffSb+ryBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:11:51.330884Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.6254","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:533a63805f1bdf56e0eec0768dd508250f5a4ab6e0c02aa08192e5c613c8bd70","sha256:873218fe9fcb977dbf75cb3ee54728c2191194f9e8fbacfc1acdeb45e3cb507c"],"state_sha256":"ffced3109d194a23c70b086dae27eb58cc58c7be626deb117dd21f321d0cb90d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4yw3TcD6X+hKC4TIYCj0xnDLdFwZJ4QZucOGOeEqmvQdy8n2nWkfiD4fHpyYrnkEtBqoPqWGsIoOMgpj63alAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T06:24:40.333755Z","bundle_sha256":"4f4ef0e2fcdbaa998f107c3100857a26b8716dc88e20e4a2c738709d98d13bb6"}}