{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:SPZEWGNBGK4AR5QE6R24NAWM3A","short_pith_number":"pith:SPZEWGNB","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"},"canonical_sha256":"93f24b19a132b808f604f475c682ccd80dd41246b4ace9a9a1030de4b67b4ecc","source":{"kind":"arxiv","id":"1109.5241","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.5241","created_at":"2026-05-18T03:54:26Z"},{"alias_kind":"arxiv_version","alias_value":"1109.5241v1","created_at":"2026-05-18T03:54:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5241","created_at":"2026-05-18T03:54:26Z"},{"alias_kind":"pith_short_12","alias_value":"SPZEWGNBGK4A","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"SPZEWGNBGK4AR5QE","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"SPZEWGNB","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:SPZEWGNBGK4AR5QE6R24NAWM3A","target":"record","payload":{"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"},"canonical_sha256":"93f24b19a132b808f604f475c682ccd80dd41246b4ace9a9a1030de4b67b4ecc","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"},"source_kind":"arxiv","source_id":"1109.5241","source_version":1,"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:54:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OI7v+NdFiQolMnoqp4i8gVgwI2xwZBcITJ6L8Vwc3I85fQI/Bb/kq/BgQfwU4y+uuAP21Qwvs1wIOC8j4pILAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:34:43.813705Z"},"content_sha256":"7570763b8d9d815e84b2c8ef82ecf862577a0e5977c8d08ce5c7cc86b69553ca","schema_version":"1.0","event_id":"sha256:7570763b8d9d815e84b2c8ef82ecf862577a0e5977c8d08ce5c7cc86b69553ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:SPZEWGNBGK4AR5QE6R24NAWM3A","target":"graph","payload":{"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"},"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:54:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hDt4C6gS1BMHCQFfzlBLbWQgTA1bFcMMK2wS8G1luV4gIgy0yNHJSJC8tqQg/wpbRCxdTqhaf/T0jO9joO2qBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:34:43.814080Z"},"content_sha256":"bb273839cf6055364c90b41c394a5b05514db7340c8aa54d906d10fd3370678a","schema_version":"1.0","event_id":"sha256:bb273839cf6055364c90b41c394a5b05514db7340c8aa54d906d10fd3370678a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SPZEWGNBGK4AR5QE6R24NAWM3A/bundle.json","state_url":"https://pith.science/pith/SPZEWGNBGK4AR5QE6R24NAWM3A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SPZEWGNBGK4AR5QE6R24NAWM3A/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-06-01T13:34:43Z","links":{"resolver":"https://pith.science/pith/SPZEWGNBGK4AR5QE6R24NAWM3A","bundle":"https://pith.science/pith/SPZEWGNBGK4AR5QE6R24NAWM3A/bundle.json","state":"https://pith.science/pith/SPZEWGNBGK4AR5QE6R24NAWM3A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SPZEWGNBGK4AR5QE6R24NAWM3A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:SPZEWGNBGK4AR5QE6R24NAWM3A","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":"ed7274a76faa357a4408178e9102ee13a7f4cca3c760fd6d9318966c015272c0","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-09-24T07:51:16Z","title_canon_sha256":"5a6fa87b6c4251a8c69792d1eb2d67336260853b2fa0e05ea0a693b41d12e451"},"schema_version":"1.0","source":{"id":"1109.5241","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.5241","created_at":"2026-05-18T03:54:26Z"},{"alias_kind":"arxiv_version","alias_value":"1109.5241v1","created_at":"2026-05-18T03:54:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5241","created_at":"2026-05-18T03:54:26Z"},{"alias_kind":"pith_short_12","alias_value":"SPZEWGNBGK4A","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"SPZEWGNBGK4AR5QE","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"SPZEWGNB","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:bb273839cf6055364c90b41c394a5b05514db7340c8aa54d906d10fd3370678a","target":"graph","created_at":"2026-05-18T03:54:26Z","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":"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","authors_text":"Stephane Gaubert, William McEneaney, Zheng Qu","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-09-24T07:51:16Z","title":"Curse of dimensionality reduction in max-plus based approximation methods: theoretical estimates and improved pruning algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.5241","kind":"arxiv","version":1},"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:7570763b8d9d815e84b2c8ef82ecf862577a0e5977c8d08ce5c7cc86b69553ca","target":"record","created_at":"2026-05-18T03:54:26Z","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":"ed7274a76faa357a4408178e9102ee13a7f4cca3c760fd6d9318966c015272c0","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-09-24T07:51:16Z","title_canon_sha256":"5a6fa87b6c4251a8c69792d1eb2d67336260853b2fa0e05ea0a693b41d12e451"},"schema_version":"1.0","source":{"id":"1109.5241","kind":"arxiv","version":1}},"canonical_sha256":"93f24b19a132b808f604f475c682ccd80dd41246b4ace9a9a1030de4b67b4ecc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"93f24b19a132b808f604f475c682ccd80dd41246b4ace9a9a1030de4b67b4ecc","first_computed_at":"2026-05-18T03:54:26.077272Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:54:26.077272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"09JJUHNPvGzqk0A3Eqv/uSvR8U2c61T1V/e+0wPseUQljDXaKibP/IixpFJGtXvZeCyIGKFdmabtGmQ3bLZSCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:54:26.077695Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.5241","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7570763b8d9d815e84b2c8ef82ecf862577a0e5977c8d08ce5c7cc86b69553ca","sha256:bb273839cf6055364c90b41c394a5b05514db7340c8aa54d906d10fd3370678a"],"state_sha256":"389b24ffdc05d622ed6cb8a2c7ee670e86836145901e8ab249e3e9fe8f5b7a9a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5CSoeAQp+TqzcMlxv95LjJgIRlQEy21UAZ30t3ySO7+ZPyvuWGo7jcwYsdCx+ZZNfwyqAmCMjp2d1dmZ2i3DAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T13:34:43.816155Z","bundle_sha256":"6e77dcf7dca0b697242b0570172159cdc60db5393fb218d9b514c398b4a4cb84"}}