{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:SPZEWGNBGK4AR5QE6R24NAWM3A","short_pith_number":"pith:SPZEWGNB","schema_version":"1.0","canonical_sha256":"93f24b19a132b808f604f475c682ccd80dd41246b4ace9a9a1030de4b67b4ecc","source":{"kind":"arxiv","id":"1109.5241","version":1},"attestation_state":"computed","paper":{"title":"Curse of dimensionality reduction in max-plus based approximation methods: theoretical estimates and improved pruning algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Stephane Gaubert, William McEneaney, Zheng Qu","submitted_at":"2011-09-24T07:51:16Z","abstract_excerpt":"Max-plus based methods have been recently developed to approximate the value function of possibly high dimensional optimal control problems. A critical step of these methods consists in approximating a function by a supremum of a small number of functions (max-plus \"basis functions\") taken from a prescribed dictionary. We study several variants of this approximation problem, which we show to be continuous versions of the facility location and $k$-center combinatorial optimization problems, in which the connection costs arise from a Bregman distance. We give theoretical error estimates, quantif"},"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":"1109.5241","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-09-24T07:51:16Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"5a6fa87b6c4251a8c69792d1eb2d67336260853b2fa0e05ea0a693b41d12e451","abstract_canon_sha256":"ed7274a76faa357a4408178e9102ee13a7f4cca3c760fd6d9318966c015272c0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:26.077695Z","signature_b64":"09JJUHNPvGzqk0A3Eqv/uSvR8U2c61T1V/e+0wPseUQljDXaKibP/IixpFJGtXvZeCyIGKFdmabtGmQ3bLZSCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93f24b19a132b808f604f475c682ccd80dd41246b4ace9a9a1030de4b67b4ecc","last_reissued_at":"2026-05-18T03:54:26.077272Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:26.077272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Curse of dimensionality reduction in max-plus based approximation methods: theoretical estimates and improved pruning algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Stephane Gaubert, William McEneaney, Zheng Qu","submitted_at":"2011-09-24T07:51:16Z","abstract_excerpt":"Max-plus based methods have been recently developed to approximate the value function of possibly high dimensional optimal control problems. A critical step of these methods consists in approximating a function by a supremum of a small number of functions (max-plus \"basis functions\") taken from a prescribed dictionary. We study several variants of this approximation problem, which we show to be continuous versions of the facility location and $k$-center combinatorial optimization problems, in which the connection costs arise from a Bregman distance. We give theoretical error estimates, quantif"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.5241","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":"1109.5241","created_at":"2026-05-18T03:54:26.077344+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.5241v1","created_at":"2026-05-18T03:54:26.077344+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5241","created_at":"2026-05-18T03:54:26.077344+00:00"},{"alias_kind":"pith_short_12","alias_value":"SPZEWGNBGK4A","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"SPZEWGNBGK4AR5QE","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"SPZEWGNB","created_at":"2026-05-18T12:26:41.206345+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/SPZEWGNBGK4AR5QE6R24NAWM3A","json":"https://pith.science/pith/SPZEWGNBGK4AR5QE6R24NAWM3A.json","graph_json":"https://pith.science/api/pith-number/SPZEWGNBGK4AR5QE6R24NAWM3A/graph.json","events_json":"https://pith.science/api/pith-number/SPZEWGNBGK4AR5QE6R24NAWM3A/events.json","paper":"https://pith.science/paper/SPZEWGNB"},"agent_actions":{"view_html":"https://pith.science/pith/SPZEWGNBGK4AR5QE6R24NAWM3A","download_json":"https://pith.science/pith/SPZEWGNBGK4AR5QE6R24NAWM3A.json","view_paper":"https://pith.science/paper/SPZEWGNB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.5241&json=true","fetch_graph":"https://pith.science/api/pith-number/SPZEWGNBGK4AR5QE6R24NAWM3A/graph.json","fetch_events":"https://pith.science/api/pith-number/SPZEWGNBGK4AR5QE6R24NAWM3A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SPZEWGNBGK4AR5QE6R24NAWM3A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SPZEWGNBGK4AR5QE6R24NAWM3A/action/storage_attestation","attest_author":"https://pith.science/pith/SPZEWGNBGK4AR5QE6R24NAWM3A/action/author_attestation","sign_citation":"https://pith.science/pith/SPZEWGNBGK4AR5QE6R24NAWM3A/action/citation_signature","submit_replication":"https://pith.science/pith/SPZEWGNBGK4AR5QE6R24NAWM3A/action/replication_record"}},"created_at":"2026-05-18T03:54:26.077344+00:00","updated_at":"2026-05-18T03:54:26.077344+00:00"}