{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:F3QEEAMTSRKK7A6NU4W6OB7ASC","short_pith_number":"pith:F3QEEAMT","canonical_record":{"source":{"id":"1605.08538","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-27T08:37:17Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"198330bc04cd871d02e3def6ba3754958e3462396a295be23ef5773c847a7b43","abstract_canon_sha256":"f237fdc1b7f3d4b0df7c22ef4269489a9ccba8c49e2218aba7719e665cb81d8a"},"schema_version":"1.0"},"canonical_sha256":"2ee04201939454af83cda72de707e09088bf6c5501e39b8a163134bcf00128af","source":{"kind":"arxiv","id":"1605.08538","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.08538","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"arxiv_version","alias_value":"1605.08538v1","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08538","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"pith_short_12","alias_value":"F3QEEAMTSRKK","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"F3QEEAMTSRKK7A6N","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"F3QEEAMT","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:F3QEEAMTSRKK7A6NU4W6OB7ASC","target":"record","payload":{"canonical_record":{"source":{"id":"1605.08538","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-27T08:37:17Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"198330bc04cd871d02e3def6ba3754958e3462396a295be23ef5773c847a7b43","abstract_canon_sha256":"f237fdc1b7f3d4b0df7c22ef4269489a9ccba8c49e2218aba7719e665cb81d8a"},"schema_version":"1.0"},"canonical_sha256":"2ee04201939454af83cda72de707e09088bf6c5501e39b8a163134bcf00128af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:29.683014Z","signature_b64":"IcRJRxCGKJXTMIJ12NxhUzIiQsAOmdbiLWgkoZPfYTh6JQrIS6/UeWzzJsuR7bv7ITdYl7j+aKNPThkvF04eBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ee04201939454af83cda72de707e09088bf6c5501e39b8a163134bcf00128af","last_reissued_at":"2026-05-18T01:13:29.682453Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:29.682453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.08538","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-18T01:13:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cvLcsje4oORVfujcS5XG4yi7lPEhRsJGqoMpvCHjIVwDogRiOCzSg6S2u5pF+dX4dcPPlUrZznGj4RGhylEaCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:34:44.878999Z"},"content_sha256":"97838adad65b0cfbc509b8a9599f5b23f4df08719163a80fbd929b9d28172520","schema_version":"1.0","event_id":"sha256:97838adad65b0cfbc509b8a9599f5b23f4df08719163a80fbd929b9d28172520"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:F3QEEAMTSRKK7A6NU4W6OB7ASC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximum Semidefinite and Linear Extension Complexity of Families of Polytopes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"math.OC","authors_text":"Gennadiy Averkov, Stefan Weltge, Volker Kaibel","submitted_at":"2016-05-27T08:37:17Z","abstract_excerpt":"We relate the maximum semidefinite and linear extension complexity of a family of polytopes to the cardinality of this family and the minimum pairwise Hausdorff distance of its members. This result directly implies a known lower bound on the maximum semidefinite extension complexity of 0/1-polytopes. We further show how our result can be used to improve on the corresponding bounds known for polygons with integer vertices.\n  Our geometric proof builds upon nothing else than a simple well-known property of maximum volume inscribed ellipsoids of convex bodies. In particular, it does not rely on f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08538","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-18T01:13:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b9nS0yHAE32rVOyx1ZDYsIyxlbK9eDCQFau4v4YI6QySh5jUGecPhD5WyQrhvVUtWxaVxhdH02IW1znzUylXDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:34:44.879473Z"},"content_sha256":"971685b436c10622d3d26148fdb4942b85fdfcd6d641b8dedd012bb5faece816","schema_version":"1.0","event_id":"sha256:971685b436c10622d3d26148fdb4942b85fdfcd6d641b8dedd012bb5faece816"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F3QEEAMTSRKK7A6NU4W6OB7ASC/bundle.json","state_url":"https://pith.science/pith/F3QEEAMTSRKK7A6NU4W6OB7ASC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F3QEEAMTSRKK7A6NU4W6OB7ASC/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-05-26T12:34:44Z","links":{"resolver":"https://pith.science/pith/F3QEEAMTSRKK7A6NU4W6OB7ASC","bundle":"https://pith.science/pith/F3QEEAMTSRKK7A6NU4W6OB7ASC/bundle.json","state":"https://pith.science/pith/F3QEEAMTSRKK7A6NU4W6OB7ASC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F3QEEAMTSRKK7A6NU4W6OB7ASC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:F3QEEAMTSRKK7A6NU4W6OB7ASC","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":"f237fdc1b7f3d4b0df7c22ef4269489a9ccba8c49e2218aba7719e665cb81d8a","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-27T08:37:17Z","title_canon_sha256":"198330bc04cd871d02e3def6ba3754958e3462396a295be23ef5773c847a7b43"},"schema_version":"1.0","source":{"id":"1605.08538","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.08538","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"arxiv_version","alias_value":"1605.08538v1","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08538","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"pith_short_12","alias_value":"F3QEEAMTSRKK","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"F3QEEAMTSRKK7A6N","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"F3QEEAMT","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:971685b436c10622d3d26148fdb4942b85fdfcd6d641b8dedd012bb5faece816","target":"graph","created_at":"2026-05-18T01:13:29Z","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 relate the maximum semidefinite and linear extension complexity of a family of polytopes to the cardinality of this family and the minimum pairwise Hausdorff distance of its members. This result directly implies a known lower bound on the maximum semidefinite extension complexity of 0/1-polytopes. We further show how our result can be used to improve on the corresponding bounds known for polygons with integer vertices.\n  Our geometric proof builds upon nothing else than a simple well-known property of maximum volume inscribed ellipsoids of convex bodies. In particular, it does not rely on f","authors_text":"Gennadiy Averkov, Stefan Weltge, Volker Kaibel","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-27T08:37:17Z","title":"Maximum Semidefinite and Linear Extension Complexity of Families of Polytopes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08538","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:97838adad65b0cfbc509b8a9599f5b23f4df08719163a80fbd929b9d28172520","target":"record","created_at":"2026-05-18T01:13:29Z","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":"f237fdc1b7f3d4b0df7c22ef4269489a9ccba8c49e2218aba7719e665cb81d8a","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-27T08:37:17Z","title_canon_sha256":"198330bc04cd871d02e3def6ba3754958e3462396a295be23ef5773c847a7b43"},"schema_version":"1.0","source":{"id":"1605.08538","kind":"arxiv","version":1}},"canonical_sha256":"2ee04201939454af83cda72de707e09088bf6c5501e39b8a163134bcf00128af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2ee04201939454af83cda72de707e09088bf6c5501e39b8a163134bcf00128af","first_computed_at":"2026-05-18T01:13:29.682453Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:29.682453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IcRJRxCGKJXTMIJ12NxhUzIiQsAOmdbiLWgkoZPfYTh6JQrIS6/UeWzzJsuR7bv7ITdYl7j+aKNPThkvF04eBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:29.683014Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.08538","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:97838adad65b0cfbc509b8a9599f5b23f4df08719163a80fbd929b9d28172520","sha256:971685b436c10622d3d26148fdb4942b85fdfcd6d641b8dedd012bb5faece816"],"state_sha256":"f6e00b853f9a52925dde2088b3169e97eeb018c94a431c98719a7246acc52bef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3LIOn9NcFM8+N1/ABz4EySPTRqOZqpZ2LwORWS6sZ3gNt2iUtOdQG/MizP0suJ/J2c4Gh72Q91wJDwqAU6GHCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T12:34:44.882675Z","bundle_sha256":"99be01df2c96af81efa5f7bae75d2bf0c9e35b509ba8f79fcf79541b3e465f3e"}}