{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:CAPCVKOZGP6QEPGB5GFZ4U2GW6","short_pith_number":"pith:CAPCVKOZ","schema_version":"1.0","canonical_sha256":"101e2aa9d933fd023cc1e98b9e5346b7a339e2f70610762ba25beb75ea67ac79","source":{"kind":"arxiv","id":"1311.6671","version":3},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1311.6671","created_at":"2026-05-18T03:05:37.282411+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.6671v3","created_at":"2026-05-18T03:05:37.282411+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.6671","created_at":"2026-05-18T03:05:37.282411+00:00"},{"alias_kind":"pith_short_12","alias_value":"CAPCVKOZGP6Q","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"CAPCVKOZGP6QEPGB","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"CAPCVKOZ","created_at":"2026-05-18T12:27:40.988391+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CAPCVKOZGP6QEPGB5GFZ4U2GW6","json":"https://pith.science/pith/CAPCVKOZGP6QEPGB5GFZ4U2GW6.json","graph_json":"https://pith.science/api/pith-number/CAPCVKOZGP6QEPGB5GFZ4U2GW6/graph.json","events_json":"https://pith.science/api/pith-number/CAPCVKOZGP6QEPGB5GFZ4U2GW6/events.json","paper":"https://pith.science/paper/CAPCVKOZ"},"agent_actions":{"view_html":"https://pith.science/pith/CAPCVKOZGP6QEPGB5GFZ4U2GW6","download_json":"https://pith.science/pith/CAPCVKOZGP6QEPGB5GFZ4U2GW6.json","view_paper":"https://pith.science/paper/CAPCVKOZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.6671&json=true","fetch_graph":"https://pith.science/api/pith-number/CAPCVKOZGP6QEPGB5GFZ4U2GW6/graph.json","fetch_events":"https://pith.science/api/pith-number/CAPCVKOZGP6QEPGB5GFZ4U2GW6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CAPCVKOZGP6QEPGB5GFZ4U2GW6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CAPCVKOZGP6QEPGB5GFZ4U2GW6/action/storage_attestation","attest_author":"https://pith.science/pith/CAPCVKOZGP6QEPGB5GFZ4U2GW6/action/author_attestation","sign_citation":"https://pith.science/pith/CAPCVKOZGP6QEPGB5GFZ4U2GW6/action/citation_signature","submit_replication":"https://pith.science/pith/CAPCVKOZGP6QEPGB5GFZ4U2GW6/action/replication_record"}},"created_at":"2026-05-18T03:05:37.282411+00:00","updated_at":"2026-05-18T03:05:37.282411+00:00"}