{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:CAPCVKOZGP6QEPGB5GFZ4U2GW6","short_pith_number":"pith:CAPCVKOZ","canonical_record":{"source":{"id":"1311.6671","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-11-26T14:00:52Z","cross_cats_sorted":[],"title_canon_sha256":"1fc4b85bd002bc49751967059407c4af96de502039041f569024ae9a2eba964c","abstract_canon_sha256":"8dd0c0a7d5b74b17cd456a07972c9eb86071056196d7e49a43f3be4087dc0b32"},"schema_version":"1.0"},"canonical_sha256":"101e2aa9d933fd023cc1e98b9e5346b7a339e2f70610762ba25beb75ea67ac79","source":{"kind":"arxiv","id":"1311.6671","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.6671","created_at":"2026-05-18T03:05:37Z"},{"alias_kind":"arxiv_version","alias_value":"1311.6671v3","created_at":"2026-05-18T03:05:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.6671","created_at":"2026-05-18T03:05:37Z"},{"alias_kind":"pith_short_12","alias_value":"CAPCVKOZGP6Q","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CAPCVKOZGP6QEPGB","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CAPCVKOZ","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:CAPCVKOZGP6QEPGB5GFZ4U2GW6","target":"record","payload":{"canonical_record":{"source":{"id":"1311.6671","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-11-26T14:00:52Z","cross_cats_sorted":[],"title_canon_sha256":"1fc4b85bd002bc49751967059407c4af96de502039041f569024ae9a2eba964c","abstract_canon_sha256":"8dd0c0a7d5b74b17cd456a07972c9eb86071056196d7e49a43f3be4087dc0b32"},"schema_version":"1.0"},"canonical_sha256":"101e2aa9d933fd023cc1e98b9e5346b7a339e2f70610762ba25beb75ea67ac79","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:37.282989Z","signature_b64":"2fuE/RD37IhXl3RHXbqRbda8MtepvCve0b9RZBnYhmfPsm/eCG2g5ZmIuqt0KLzkEkE178+9Bn31deKj0KcvDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"101e2aa9d933fd023cc1e98b9e5346b7a339e2f70610762ba25beb75ea67ac79","last_reissued_at":"2026-05-18T03:05:37.282283Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:37.282283Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.6671","source_version":3,"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-18T03:05:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m02MTDnYy3lLEtoYOWWobGGcKdXLrcEopFwQwgZaTWxyuIzfiTBhlu9WgcaaebsPARaacKzwoCH6BN6G56mVCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:10:28.709835Z"},"content_sha256":"a65f1bda42bd2f027d36590263ebd032daa5cb8a5c1cac0a0492f8cdcebcc1fb","schema_version":"1.0","event_id":"sha256:a65f1bda42bd2f027d36590263ebd032daa5cb8a5c1cac0a0492f8cdcebcc1fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:CAPCVKOZGP6QEPGB5GFZ4U2GW6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Deterministic Polynomial Space Construction for eps-nets under any Norm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Daniel Dadush","submitted_at":"2013-11-26T14:00:52Z","abstract_excerpt":"We give a deterministic polynomial space construction for nearly optimal eps-nets with respect to any input n-dimensional convex body K and norm |.|. More precisely, our algorithm can build and iterate over an eps-net of K with respect to |.| in time 2^O(n) x (size of the optimal net) using only poly(n)-space. This improves on previous constructions of Alon et al [STOC 2013] which achieve either a 2^O(n) approximation or an n^O(n) approximation of the optimal net size using 2^n space and poly(n)-space respectively. As in their work, our algorithm relies on the mathematically classical approach"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.6671","kind":"arxiv","version":3},"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-18T03:05:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FU5qs0Ry4BHzFhGhiKx9UT6/WB0zhaXF3A6bQPv2HJNyKHGXEsgSJqu6TAOdqQ7MPKMD0KpfZg5aMSEMtWNUBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:10:28.710493Z"},"content_sha256":"d792576c6516534f25992407eff74c549e90830a24504421ef2e5958651ba347","schema_version":"1.0","event_id":"sha256:d792576c6516534f25992407eff74c549e90830a24504421ef2e5958651ba347"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CAPCVKOZGP6QEPGB5GFZ4U2GW6/bundle.json","state_url":"https://pith.science/pith/CAPCVKOZGP6QEPGB5GFZ4U2GW6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CAPCVKOZGP6QEPGB5GFZ4U2GW6/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-27T05:10:28Z","links":{"resolver":"https://pith.science/pith/CAPCVKOZGP6QEPGB5GFZ4U2GW6","bundle":"https://pith.science/pith/CAPCVKOZGP6QEPGB5GFZ4U2GW6/bundle.json","state":"https://pith.science/pith/CAPCVKOZGP6QEPGB5GFZ4U2GW6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CAPCVKOZGP6QEPGB5GFZ4U2GW6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:CAPCVKOZGP6QEPGB5GFZ4U2GW6","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":"8dd0c0a7d5b74b17cd456a07972c9eb86071056196d7e49a43f3be4087dc0b32","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-11-26T14:00:52Z","title_canon_sha256":"1fc4b85bd002bc49751967059407c4af96de502039041f569024ae9a2eba964c"},"schema_version":"1.0","source":{"id":"1311.6671","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.6671","created_at":"2026-05-18T03:05:37Z"},{"alias_kind":"arxiv_version","alias_value":"1311.6671v3","created_at":"2026-05-18T03:05:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.6671","created_at":"2026-05-18T03:05:37Z"},{"alias_kind":"pith_short_12","alias_value":"CAPCVKOZGP6Q","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CAPCVKOZGP6QEPGB","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CAPCVKOZ","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:d792576c6516534f25992407eff74c549e90830a24504421ef2e5958651ba347","target":"graph","created_at":"2026-05-18T03:05:37Z","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 give a deterministic polynomial space construction for nearly optimal eps-nets with respect to any input n-dimensional convex body K and norm |.|. More precisely, our algorithm can build and iterate over an eps-net of K with respect to |.| in time 2^O(n) x (size of the optimal net) using only poly(n)-space. This improves on previous constructions of Alon et al [STOC 2013] which achieve either a 2^O(n) approximation or an n^O(n) approximation of the optimal net size using 2^n space and poly(n)-space respectively. As in their work, our algorithm relies on the mathematically classical approach","authors_text":"Daniel Dadush","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-11-26T14:00:52Z","title":"A Deterministic Polynomial Space Construction for eps-nets under any Norm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.6671","kind":"arxiv","version":3},"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:a65f1bda42bd2f027d36590263ebd032daa5cb8a5c1cac0a0492f8cdcebcc1fb","target":"record","created_at":"2026-05-18T03:05:37Z","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":"8dd0c0a7d5b74b17cd456a07972c9eb86071056196d7e49a43f3be4087dc0b32","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-11-26T14:00:52Z","title_canon_sha256":"1fc4b85bd002bc49751967059407c4af96de502039041f569024ae9a2eba964c"},"schema_version":"1.0","source":{"id":"1311.6671","kind":"arxiv","version":3}},"canonical_sha256":"101e2aa9d933fd023cc1e98b9e5346b7a339e2f70610762ba25beb75ea67ac79","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"101e2aa9d933fd023cc1e98b9e5346b7a339e2f70610762ba25beb75ea67ac79","first_computed_at":"2026-05-18T03:05:37.282283Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:37.282283Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2fuE/RD37IhXl3RHXbqRbda8MtepvCve0b9RZBnYhmfPsm/eCG2g5ZmIuqt0KLzkEkE178+9Bn31deKj0KcvDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:37.282989Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.6671","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a65f1bda42bd2f027d36590263ebd032daa5cb8a5c1cac0a0492f8cdcebcc1fb","sha256:d792576c6516534f25992407eff74c549e90830a24504421ef2e5958651ba347"],"state_sha256":"76f5223bcf7ba5b03b228f491c31e1add056a7efe1cde34ebba3eb2c8ca3b900"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FrVtBi+TUPT9alPR6CYuT0O/91VGFXy4uwVjc700HR/oNcKlRvc33rEzZhsPG6QSjRMK17oJalCAlfLTFOATDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:10:28.713872Z","bundle_sha256":"f06014405e49c69e11d5ff08a1dfe07a0c6acb1bc1b52e31845eb91b73b8406e"}}