{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LHVAV2ORPT3ZQFC3MUGOMQV7MI","short_pith_number":"pith:LHVAV2OR","schema_version":"1.0","canonical_sha256":"59ea0ae9d17cf798145b650ce642bf623c7418b8db76b6c68ab34493cef79365","source":{"kind":"arxiv","id":"1905.04156","version":1},"attestation_state":"computed","paper":{"title":"Efficient Algorithms for Approximate Smooth Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CA"],"primary_cat":"math.FA","authors_text":"Bernat Guillen Pegueroles, Charles Fefferman","submitted_at":"2019-05-08T20:17:57Z","abstract_excerpt":"In this paper we provide efficient algorithms for approximate $\\mathcal{C}^m(\\mathbb{R}^n, \\mathbb{R}^D)-$selection. In particular, given a set $E$, constants $M_0 > 0$ and $0 <\\tau \\leq \\tau_{\\max}$, and convex sets $K(x) \\subset \\mathbb{R}^D$ for $x \\in E$, we show that an algorithm running in $C(\\tau) N \\log N$ steps is able to solve the smooth selection problem of selecting a point $y \\in (1+\\tau)\\blacklozenge K(x)$ for $x \\in E$ for an appropriate dilation of $K(x)$, $(1+\\tau)\\blacklozenge K(x)$, and guaranteeing that a function interpolating the points $(x, y)$ will be $\\mathcal{C}^m(\\ma"},"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":"1905.04156","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2019-05-08T20:17:57Z","cross_cats_sorted":["math.CA"],"title_canon_sha256":"3be67748b0f01fe1d5a4687ea190c416f108860e2ca1e729747b3a24b74849e5","abstract_canon_sha256":"8d3b1c179020eedbf421874ac88ccd971663b3bd8f336d6c7c26e87e28e5feb0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:34.369268Z","signature_b64":"VADfE1xlhN9NCi93+b5gbUzwVnUbuAQ51AoTArlgdpCwMPgd2dz9exVHC63u7qcvI5o43sT3IllB6DesaQU5Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59ea0ae9d17cf798145b650ce642bf623c7418b8db76b6c68ab34493cef79365","last_reissued_at":"2026-05-17T23:46:34.368681Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:34.368681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Algorithms for Approximate Smooth Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CA"],"primary_cat":"math.FA","authors_text":"Bernat Guillen Pegueroles, Charles Fefferman","submitted_at":"2019-05-08T20:17:57Z","abstract_excerpt":"In this paper we provide efficient algorithms for approximate $\\mathcal{C}^m(\\mathbb{R}^n, \\mathbb{R}^D)-$selection. In particular, given a set $E$, constants $M_0 > 0$ and $0 <\\tau \\leq \\tau_{\\max}$, and convex sets $K(x) \\subset \\mathbb{R}^D$ for $x \\in E$, we show that an algorithm running in $C(\\tau) N \\log N$ steps is able to solve the smooth selection problem of selecting a point $y \\in (1+\\tau)\\blacklozenge K(x)$ for $x \\in E$ for an appropriate dilation of $K(x)$, $(1+\\tau)\\blacklozenge K(x)$, and guaranteeing that a function interpolating the points $(x, y)$ will be $\\mathcal{C}^m(\\ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04156","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1905.04156","created_at":"2026-05-17T23:46:34.368795+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.04156v1","created_at":"2026-05-17T23:46:34.368795+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04156","created_at":"2026-05-17T23:46:34.368795+00:00"},{"alias_kind":"pith_short_12","alias_value":"LHVAV2ORPT3Z","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"LHVAV2ORPT3ZQFC3","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"LHVAV2OR","created_at":"2026-05-18T12:33:21.387695+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/LHVAV2ORPT3ZQFC3MUGOMQV7MI","json":"https://pith.science/pith/LHVAV2ORPT3ZQFC3MUGOMQV7MI.json","graph_json":"https://pith.science/api/pith-number/LHVAV2ORPT3ZQFC3MUGOMQV7MI/graph.json","events_json":"https://pith.science/api/pith-number/LHVAV2ORPT3ZQFC3MUGOMQV7MI/events.json","paper":"https://pith.science/paper/LHVAV2OR"},"agent_actions":{"view_html":"https://pith.science/pith/LHVAV2ORPT3ZQFC3MUGOMQV7MI","download_json":"https://pith.science/pith/LHVAV2ORPT3ZQFC3MUGOMQV7MI.json","view_paper":"https://pith.science/paper/LHVAV2OR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.04156&json=true","fetch_graph":"https://pith.science/api/pith-number/LHVAV2ORPT3ZQFC3MUGOMQV7MI/graph.json","fetch_events":"https://pith.science/api/pith-number/LHVAV2ORPT3ZQFC3MUGOMQV7MI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LHVAV2ORPT3ZQFC3MUGOMQV7MI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LHVAV2ORPT3ZQFC3MUGOMQV7MI/action/storage_attestation","attest_author":"https://pith.science/pith/LHVAV2ORPT3ZQFC3MUGOMQV7MI/action/author_attestation","sign_citation":"https://pith.science/pith/LHVAV2ORPT3ZQFC3MUGOMQV7MI/action/citation_signature","submit_replication":"https://pith.science/pith/LHVAV2ORPT3ZQFC3MUGOMQV7MI/action/replication_record"}},"created_at":"2026-05-17T23:46:34.368795+00:00","updated_at":"2026-05-17T23:46:34.368795+00:00"}