{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:MLAQF33D5VTWJW3PR4A32JS5HR","short_pith_number":"pith:MLAQF33D","canonical_record":{"source":{"id":"1604.01175","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-04-05T08:45:11Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"f1f3f4e0fc18dfe73f1633b9475b3036a3012d9e65ca0251831453cd7d3bd649","abstract_canon_sha256":"676c25e97afcea42f181886d6d209edab6136445613efab74999740b93d5e6aa"},"schema_version":"1.0"},"canonical_sha256":"62c102ef63ed6764db6f8f01bd265d3c4552febc2f1a17020f256daa0f139f6a","source":{"kind":"arxiv","id":"1604.01175","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.01175","created_at":"2026-05-18T00:26:18Z"},{"alias_kind":"arxiv_version","alias_value":"1604.01175v4","created_at":"2026-05-18T00:26:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.01175","created_at":"2026-05-18T00:26:18Z"},{"alias_kind":"pith_short_12","alias_value":"MLAQF33D5VTW","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MLAQF33D5VTWJW3P","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MLAQF33D","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:MLAQF33D5VTWJW3PR4A32JS5HR","target":"record","payload":{"canonical_record":{"source":{"id":"1604.01175","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-04-05T08:45:11Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"f1f3f4e0fc18dfe73f1633b9475b3036a3012d9e65ca0251831453cd7d3bd649","abstract_canon_sha256":"676c25e97afcea42f181886d6d209edab6136445613efab74999740b93d5e6aa"},"schema_version":"1.0"},"canonical_sha256":"62c102ef63ed6764db6f8f01bd265d3c4552febc2f1a17020f256daa0f139f6a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:18.575768Z","signature_b64":"77QQBTQaB/MP4UEra92Ghu5PR1SE5QuSq8s67gxP+Gd2A1H+y/4C8eU0AtERpSQJq7iA8TEA9pu7q4HAjmCfDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62c102ef63ed6764db6f8f01bd265d3c4552febc2f1a17020f256daa0f139f6a","last_reissued_at":"2026-05-18T00:26:18.575236Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:18.575236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.01175","source_version":4,"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-18T00:26:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"edUjdl2jwScBYFW3KTple7vHJMf+8K0jVweM/HSgYL2UMFQVD6gYpgIQkYmN+R98ITBldFCKE4pi0Yrg5KtCBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:10:45.859122Z"},"content_sha256":"b4eb42a931503960f752507e60295642db099ed53c070991a7215666b51d27d6","schema_version":"1.0","event_id":"sha256:b4eb42a931503960f752507e60295642db099ed53c070991a7215666b51d27d6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:MLAQF33D5VTWJW3PR4A32JS5HR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Combinatorial Complexity of Approximating Polytopes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"cs.CG","authors_text":"David M. Mount, Guilherme D. da Fonseca, Sunil Arya","submitted_at":"2016-04-05T08:45:11Z","abstract_excerpt":"Approximating convex bodies succinctly by convex polytopes is a fundamental problem in discrete geometry. A convex body $K$ of diameter $\\mathrm{diam}(K)$ is given in Euclidean $d$-dimensional space, where $d$ is a constant. Given an error parameter $\\varepsilon > 0$, the objective is to determine a polytope of minimum combinatorial complexity whose Hausdorff distance from $K$ is at most $\\varepsilon \\cdot \\mathrm{diam}(K)$. By combinatorial complexity we mean the total number of faces of all dimensions of the polytope. A well-known result by Dudley implies that $O(1/\\varepsilon^{(d-1)/2})$ fa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.01175","kind":"arxiv","version":4},"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-18T00:26:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8tbBh0tg4g3WRXHTD3fhV8FZfY5HIGlelu89hHZ5uz5GOo0GjXWRy+xtlF2TJ9/qkQdujPQytHZs8JdICfonDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:10:45.859769Z"},"content_sha256":"5dfed0ef815fe39ccf084ebf9bdedde1a75c528266bc65d00234d154fff5d765","schema_version":"1.0","event_id":"sha256:5dfed0ef815fe39ccf084ebf9bdedde1a75c528266bc65d00234d154fff5d765"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MLAQF33D5VTWJW3PR4A32JS5HR/bundle.json","state_url":"https://pith.science/pith/MLAQF33D5VTWJW3PR4A32JS5HR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MLAQF33D5VTWJW3PR4A32JS5HR/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-30T08:10:45Z","links":{"resolver":"https://pith.science/pith/MLAQF33D5VTWJW3PR4A32JS5HR","bundle":"https://pith.science/pith/MLAQF33D5VTWJW3PR4A32JS5HR/bundle.json","state":"https://pith.science/pith/MLAQF33D5VTWJW3PR4A32JS5HR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MLAQF33D5VTWJW3PR4A32JS5HR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MLAQF33D5VTWJW3PR4A32JS5HR","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":"676c25e97afcea42f181886d6d209edab6136445613efab74999740b93d5e6aa","cross_cats_sorted":["math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-04-05T08:45:11Z","title_canon_sha256":"f1f3f4e0fc18dfe73f1633b9475b3036a3012d9e65ca0251831453cd7d3bd649"},"schema_version":"1.0","source":{"id":"1604.01175","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.01175","created_at":"2026-05-18T00:26:18Z"},{"alias_kind":"arxiv_version","alias_value":"1604.01175v4","created_at":"2026-05-18T00:26:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.01175","created_at":"2026-05-18T00:26:18Z"},{"alias_kind":"pith_short_12","alias_value":"MLAQF33D5VTW","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MLAQF33D5VTWJW3P","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MLAQF33D","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:5dfed0ef815fe39ccf084ebf9bdedde1a75c528266bc65d00234d154fff5d765","target":"graph","created_at":"2026-05-18T00:26:18Z","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":"Approximating convex bodies succinctly by convex polytopes is a fundamental problem in discrete geometry. A convex body $K$ of diameter $\\mathrm{diam}(K)$ is given in Euclidean $d$-dimensional space, where $d$ is a constant. Given an error parameter $\\varepsilon > 0$, the objective is to determine a polytope of minimum combinatorial complexity whose Hausdorff distance from $K$ is at most $\\varepsilon \\cdot \\mathrm{diam}(K)$. By combinatorial complexity we mean the total number of faces of all dimensions of the polytope. A well-known result by Dudley implies that $O(1/\\varepsilon^{(d-1)/2})$ fa","authors_text":"David M. Mount, Guilherme D. da Fonseca, Sunil Arya","cross_cats":["math.MG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-04-05T08:45:11Z","title":"On the Combinatorial Complexity of Approximating Polytopes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.01175","kind":"arxiv","version":4},"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:b4eb42a931503960f752507e60295642db099ed53c070991a7215666b51d27d6","target":"record","created_at":"2026-05-18T00:26:18Z","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":"676c25e97afcea42f181886d6d209edab6136445613efab74999740b93d5e6aa","cross_cats_sorted":["math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-04-05T08:45:11Z","title_canon_sha256":"f1f3f4e0fc18dfe73f1633b9475b3036a3012d9e65ca0251831453cd7d3bd649"},"schema_version":"1.0","source":{"id":"1604.01175","kind":"arxiv","version":4}},"canonical_sha256":"62c102ef63ed6764db6f8f01bd265d3c4552febc2f1a17020f256daa0f139f6a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"62c102ef63ed6764db6f8f01bd265d3c4552febc2f1a17020f256daa0f139f6a","first_computed_at":"2026-05-18T00:26:18.575236Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:18.575236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"77QQBTQaB/MP4UEra92Ghu5PR1SE5QuSq8s67gxP+Gd2A1H+y/4C8eU0AtERpSQJq7iA8TEA9pu7q4HAjmCfDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:18.575768Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.01175","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b4eb42a931503960f752507e60295642db099ed53c070991a7215666b51d27d6","sha256:5dfed0ef815fe39ccf084ebf9bdedde1a75c528266bc65d00234d154fff5d765"],"state_sha256":"ab98b6eae8b77f103d8dd84fc78e05f85fbb385ba6dcf9f4da339fa5deb75b04"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"myCI6S6Uy2zaAXWvNuxMMx2xoh8973e0em2wDEpJ9ioCaISQjtdcFWErGoHTDRBfRrUSOH3MCVrAm6qFu8aKCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:10:45.862912Z","bundle_sha256":"70fb66ed42dbc6b2aa9be1bc995660f0adcbe80c3b21d87120154654bb778266"}}