{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GDTU5JJQVIYMDYZJIX35VXNECX","short_pith_number":"pith:GDTU5JJQ","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"},"canonical_sha256":"30e74ea530aa30c1e32945f7dadda415f5df19e5a2b7ae71eafef9004d974974","source":{"kind":"arxiv","id":"1502.02265","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.02265","created_at":"2026-05-18T02:25:55Z"},{"alias_kind":"arxiv_version","alias_value":"1502.02265v2","created_at":"2026-05-18T02:25:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02265","created_at":"2026-05-18T02:25:55Z"},{"alias_kind":"pith_short_12","alias_value":"GDTU5JJQVIYM","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GDTU5JJQVIYMDYZJ","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GDTU5JJQ","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GDTU5JJQVIYMDYZJIX35VXNECX","target":"record","payload":{"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"},"canonical_sha256":"30e74ea530aa30c1e32945f7dadda415f5df19e5a2b7ae71eafef9004d974974","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"},"source_kind":"arxiv","source_id":"1502.02265","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-18T02:25:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nTLh159y6EeuftEbe7P2+VnBbdRVN6M7C1UIwxVo9ijBqHaRENYoMr1T5lB8G+pfK0D5y2BrYwNwsyUAG5lTDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T18:08:46.028521Z"},"content_sha256":"6ddc7111f1dba1d92d99743a8f209997d5565c4a1ed707b14c93acb0c4d2cc2a","schema_version":"1.0","event_id":"sha256:6ddc7111f1dba1d92d99743a8f209997d5565c4a1ed707b14c93acb0c4d2cc2a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GDTU5JJQVIYMDYZJIX35VXNECX","target":"graph","payload":{"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"},"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-18T02:25:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TuAAy6Ji5i/tLAOLRMilkCoI9jJTPBYHtQqw6RpqJLOtsD00Om+oCT6R64VGp4slmRjfc1qMJp59Wj0GDvHwAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T18:08:46.029238Z"},"content_sha256":"eb479b94c3d39de4a5967f1297728086e98318f23efa2f72490378b74a5aba0c","schema_version":"1.0","event_id":"sha256:eb479b94c3d39de4a5967f1297728086e98318f23efa2f72490378b74a5aba0c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GDTU5JJQVIYMDYZJIX35VXNECX/bundle.json","state_url":"https://pith.science/pith/GDTU5JJQVIYMDYZJIX35VXNECX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GDTU5JJQVIYMDYZJIX35VXNECX/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-08T18:08:46Z","links":{"resolver":"https://pith.science/pith/GDTU5JJQVIYMDYZJIX35VXNECX","bundle":"https://pith.science/pith/GDTU5JJQVIYMDYZJIX35VXNECX/bundle.json","state":"https://pith.science/pith/GDTU5JJQVIYMDYZJIX35VXNECX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GDTU5JJQVIYMDYZJIX35VXNECX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GDTU5JJQVIYMDYZJIX35VXNECX","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":"6d8bb44c598c28a9eb600a09b072181d509d34054cd7a8a692a7e8d857934d9d","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-02-08T15:54:48Z","title_canon_sha256":"b8158f390f046cb77fee78c8ee3ab963af72e155a4ec904afb4789b4aff9ab0e"},"schema_version":"1.0","source":{"id":"1502.02265","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.02265","created_at":"2026-05-18T02:25:55Z"},{"alias_kind":"arxiv_version","alias_value":"1502.02265v2","created_at":"2026-05-18T02:25:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02265","created_at":"2026-05-18T02:25:55Z"},{"alias_kind":"pith_short_12","alias_value":"GDTU5JJQVIYM","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GDTU5JJQVIYMDYZJ","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GDTU5JJQ","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:eb479b94c3d39de4a5967f1297728086e98318f23efa2f72490378b74a5aba0c","target":"graph","created_at":"2026-05-18T02:25:55Z","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+...+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","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":"2015-02-08T15:54:48Z","title":"A geometric approach for the upper bound theorem for Minkowski sums of convex polytopes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02265","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:6ddc7111f1dba1d92d99743a8f209997d5565c4a1ed707b14c93acb0c4d2cc2a","target":"record","created_at":"2026-05-18T02:25:55Z","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":"6d8bb44c598c28a9eb600a09b072181d509d34054cd7a8a692a7e8d857934d9d","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-02-08T15:54:48Z","title_canon_sha256":"b8158f390f046cb77fee78c8ee3ab963af72e155a4ec904afb4789b4aff9ab0e"},"schema_version":"1.0","source":{"id":"1502.02265","kind":"arxiv","version":2}},"canonical_sha256":"30e74ea530aa30c1e32945f7dadda415f5df19e5a2b7ae71eafef9004d974974","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"30e74ea530aa30c1e32945f7dadda415f5df19e5a2b7ae71eafef9004d974974","first_computed_at":"2026-05-18T02:25:55.508713Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:55.508713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"waloLBJ1TErakby2J9MWirrpHAgXcSIZ5N7+RhH/2mW1FSGI1trZgJmQ4zkaU4o6OqTNIfaqnzrOutSmNY09Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:55.509140Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.02265","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ddc7111f1dba1d92d99743a8f209997d5565c4a1ed707b14c93acb0c4d2cc2a","sha256:eb479b94c3d39de4a5967f1297728086e98318f23efa2f72490378b74a5aba0c"],"state_sha256":"a929ea61a1f267dffe7c2f340e689df200a534c21e67b23b69372b6a7184869d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kc5ZjEcjMl2kwoiLjZevx+ZJPNvjlLyu8AiXpbmZZrgYQ45FrOeJ66PsIGyghmz3E4N2vgGrAWtAyzlfpvI/CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T18:08:46.032991Z","bundle_sha256":"8333aea1a77b189033e2b2fd160935e09a04f44e947bd61b638860f81c93d547"}}