{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:L2PW5C66PKKUSDYXX6S6JKVDP3","short_pith_number":"pith:L2PW5C66","canonical_record":{"source":{"id":"1112.1535","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-12-07T12:00:03Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"04f64799eae9010aef1143b1cf57be46904143cb34ba3d40cb8c111e81616e00","abstract_canon_sha256":"bf3c781a7deb9dd75217ed95241bb497edcb2d2d68265692e425d985c20011aa"},"schema_version":"1.0"},"canonical_sha256":"5e9f6e8bde7a95490f17bfa5e4aaa37ee438d70d8cbe9c2a1bc031d7854815b1","source":{"kind":"arxiv","id":"1112.1535","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.1535","created_at":"2026-05-18T04:06:54Z"},{"alias_kind":"arxiv_version","alias_value":"1112.1535v1","created_at":"2026-05-18T04:06:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1535","created_at":"2026-05-18T04:06:54Z"},{"alias_kind":"pith_short_12","alias_value":"L2PW5C66PKKU","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"L2PW5C66PKKUSDYX","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"L2PW5C66","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:L2PW5C66PKKUSDYXX6S6JKVDP3","target":"record","payload":{"canonical_record":{"source":{"id":"1112.1535","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-12-07T12:00:03Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"04f64799eae9010aef1143b1cf57be46904143cb34ba3d40cb8c111e81616e00","abstract_canon_sha256":"bf3c781a7deb9dd75217ed95241bb497edcb2d2d68265692e425d985c20011aa"},"schema_version":"1.0"},"canonical_sha256":"5e9f6e8bde7a95490f17bfa5e4aaa37ee438d70d8cbe9c2a1bc031d7854815b1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:06:54.395099Z","signature_b64":"JzVME9mXj0UJa5nA9mP2hoIwM+tIryF4YSwCJBXTaq9NUEdicP7klAomCjWReIGQBxiFuzhTZ09gGfmAHe/mCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e9f6e8bde7a95490f17bfa5e4aaa37ee438d70d8cbe9c2a1bc031d7854815b1","last_reissued_at":"2026-05-18T04:06:54.394623Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:06:54.394623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.1535","source_version":1,"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:06:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3SQkn8rgtlVQ2az7OT/iipl3OBQOpErhJMlYocu2OfG5J8hLahelPaWhtv8lAlKPicQfyZt3PdB0/HLc37l7AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T13:06:45.704291Z"},"content_sha256":"cdaefc83dd83e0f7f53ed68af3329fff7a8e8ec231885d8bcf1a19679316f1dd","schema_version":"1.0","event_id":"sha256:cdaefc83dd83e0f7f53ed68af3329fff7a8e8ec231885d8bcf1a19679316f1dd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:L2PW5C66PKKUSDYXX6S6JKVDP3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight lower bounds on the number of faces of the Minkowski sum of convex polytopes via the Cayley trick","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-12-07T12:00:03Z","abstract_excerpt":"Consider a set of $r$ convex $d$-polytopes $P_1,P_2,...,P_r$, where $d\\ge{}3$ and $r\\ge{}2$, and let $n_i$ be the number of vertices of $P_i$, $1\\le{}i\\le{}r$. It has been shown by Fukuda and Weibel that the number of $k$-faces of the Minkowski sum, $P_1+P_2+...+P_r$, is bounded from above by $\\Phi_{k+r}(n_1,n_2,...,n_r)$, where\n$\\Phi_{\\ell}(n_1,n_2,...,n_r)= \\sum_{\\substack{1\\le{}s_i\\le{}n_i\ns_1+...+s_r=\\ell}} \\prod_{i=1}^r\\binom{n_i}{s_i}$, $\\ell\\ge{}r$.\nFukuda and Weibel have also shown that the upper bound mentioned above is tight for $d\\ge{}4$, $2\\le{}r\\le{}\\lfloor\\frac{d}{2}\\rfloor$, and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1535","kind":"arxiv","version":1},"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:06:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XtsQK8J7eSTh7qlfqqGCAd8GwRZdQegkwFGtgtcTVy7cB8a8jC7PSl/rrqdBu32MaWbJZQ6guNkA8VkfStRdBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T13:06:45.705251Z"},"content_sha256":"93126a9bcb4a78c71f432b58ee2cfd6600de5b11b22568b68f56af7c0a7a9784","schema_version":"1.0","event_id":"sha256:93126a9bcb4a78c71f432b58ee2cfd6600de5b11b22568b68f56af7c0a7a9784"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L2PW5C66PKKUSDYXX6S6JKVDP3/bundle.json","state_url":"https://pith.science/pith/L2PW5C66PKKUSDYXX6S6JKVDP3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L2PW5C66PKKUSDYXX6S6JKVDP3/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-08T13:06:45Z","links":{"resolver":"https://pith.science/pith/L2PW5C66PKKUSDYXX6S6JKVDP3","bundle":"https://pith.science/pith/L2PW5C66PKKUSDYXX6S6JKVDP3/bundle.json","state":"https://pith.science/pith/L2PW5C66PKKUSDYXX6S6JKVDP3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L2PW5C66PKKUSDYXX6S6JKVDP3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:L2PW5C66PKKUSDYXX6S6JKVDP3","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":"bf3c781a7deb9dd75217ed95241bb497edcb2d2d68265692e425d985c20011aa","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-12-07T12:00:03Z","title_canon_sha256":"04f64799eae9010aef1143b1cf57be46904143cb34ba3d40cb8c111e81616e00"},"schema_version":"1.0","source":{"id":"1112.1535","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.1535","created_at":"2026-05-18T04:06:54Z"},{"alias_kind":"arxiv_version","alias_value":"1112.1535v1","created_at":"2026-05-18T04:06:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1535","created_at":"2026-05-18T04:06:54Z"},{"alias_kind":"pith_short_12","alias_value":"L2PW5C66PKKU","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"L2PW5C66PKKUSDYX","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"L2PW5C66","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:93126a9bcb4a78c71f432b58ee2cfd6600de5b11b22568b68f56af7c0a7a9784","target":"graph","created_at":"2026-05-18T04:06:54Z","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":"Consider a set of $r$ convex $d$-polytopes $P_1,P_2,...,P_r$, where $d\\ge{}3$ and $r\\ge{}2$, and let $n_i$ be the number of vertices of $P_i$, $1\\le{}i\\le{}r$. It has been shown by Fukuda and Weibel that the number of $k$-faces of the Minkowski sum, $P_1+P_2+...+P_r$, is bounded from above by $\\Phi_{k+r}(n_1,n_2,...,n_r)$, where\n$\\Phi_{\\ell}(n_1,n_2,...,n_r)= \\sum_{\\substack{1\\le{}s_i\\le{}n_i\ns_1+...+s_r=\\ell}} \\prod_{i=1}^r\\binom{n_i}{s_i}$, $\\ell\\ge{}r$.\nFukuda and Weibel have also shown that the upper bound mentioned above is tight for $d\\ge{}4$, $2\\le{}r\\le{}\\lfloor\\frac{d}{2}\\rfloor$, and","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-12-07T12:00:03Z","title":"Tight lower bounds on the number of faces of the Minkowski sum of convex polytopes via the Cayley trick"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1535","kind":"arxiv","version":1},"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:cdaefc83dd83e0f7f53ed68af3329fff7a8e8ec231885d8bcf1a19679316f1dd","target":"record","created_at":"2026-05-18T04:06:54Z","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":"bf3c781a7deb9dd75217ed95241bb497edcb2d2d68265692e425d985c20011aa","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-12-07T12:00:03Z","title_canon_sha256":"04f64799eae9010aef1143b1cf57be46904143cb34ba3d40cb8c111e81616e00"},"schema_version":"1.0","source":{"id":"1112.1535","kind":"arxiv","version":1}},"canonical_sha256":"5e9f6e8bde7a95490f17bfa5e4aaa37ee438d70d8cbe9c2a1bc031d7854815b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e9f6e8bde7a95490f17bfa5e4aaa37ee438d70d8cbe9c2a1bc031d7854815b1","first_computed_at":"2026-05-18T04:06:54.394623Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:06:54.394623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JzVME9mXj0UJa5nA9mP2hoIwM+tIryF4YSwCJBXTaq9NUEdicP7klAomCjWReIGQBxiFuzhTZ09gGfmAHe/mCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:06:54.395099Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.1535","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cdaefc83dd83e0f7f53ed68af3329fff7a8e8ec231885d8bcf1a19679316f1dd","sha256:93126a9bcb4a78c71f432b58ee2cfd6600de5b11b22568b68f56af7c0a7a9784"],"state_sha256":"ce075ac6e0f0150361f52730700d8881b01b74d19c39b399324093fc1fd39b01"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v7NbArvPKKCmshZUPiDzoX9PXfEnTxODD77iVWcjv+FRpazuQd/WlI3cfJTT1W706c0EIsEjjt1Wh2ObEZZqDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T13:06:45.708276Z","bundle_sha256":"eeea92800018c11e6672f5fa7924b78e08ff92c9e7ce263913936c3d51ff7692"}}