{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:RJYCXUU4II4XIASUCSYKH3I6OR","short_pith_number":"pith:RJYCXUU4","canonical_record":{"source":{"id":"1305.4071","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-05-17T13:23:59Z","cross_cats_sorted":[],"title_canon_sha256":"5b97d8c83689d30f4e179c7d67607b056f3a8d1fd930bdec20bebddff24a58d2","abstract_canon_sha256":"5d952bdaa3ceecf1a250b69cf62a74ea22ca273a8f0a45b416b33f52945bfb90"},"schema_version":"1.0"},"canonical_sha256":"8a702bd29c423974025414b0a3ed1e745d8786076960e5f77bf727db1b1f87ac","source":{"kind":"arxiv","id":"1305.4071","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.4071","created_at":"2026-05-18T03:25:26Z"},{"alias_kind":"arxiv_version","alias_value":"1305.4071v1","created_at":"2026-05-18T03:25:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4071","created_at":"2026-05-18T03:25:26Z"},{"alias_kind":"pith_short_12","alias_value":"RJYCXUU4II4X","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"RJYCXUU4II4XIASU","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"RJYCXUU4","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:RJYCXUU4II4XIASUCSYKH3I6OR","target":"record","payload":{"canonical_record":{"source":{"id":"1305.4071","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-05-17T13:23:59Z","cross_cats_sorted":[],"title_canon_sha256":"5b97d8c83689d30f4e179c7d67607b056f3a8d1fd930bdec20bebddff24a58d2","abstract_canon_sha256":"5d952bdaa3ceecf1a250b69cf62a74ea22ca273a8f0a45b416b33f52945bfb90"},"schema_version":"1.0"},"canonical_sha256":"8a702bd29c423974025414b0a3ed1e745d8786076960e5f77bf727db1b1f87ac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:26.360105Z","signature_b64":"2rq1bIbwOH67n3Sw5Y86e9fN8X345MrosZledMT8Si+4zu7xpKHKc3LVl2zASeF+C09jpecNv2Z6jbje8R4HAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a702bd29c423974025414b0a3ed1e745d8786076960e5f77bf727db1b1f87ac","last_reissued_at":"2026-05-18T03:25:26.359344Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:26.359344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.4071","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:25:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1XPPDhPxhw6UQF2bEx7gbK4MwVjev3ttQ9vBTR+w2kXCH5fMZ0xJ+x1rRomdIopYtzxkqboP0/UwpbQG1z6sAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T17:59:12.298884Z"},"content_sha256":"ae0b90101f5444f1862aa8277f2815acc5b791c9bd70aca0c888ceed7b4cc280","schema_version":"1.0","event_id":"sha256:ae0b90101f5444f1862aa8277f2815acc5b791c9bd70aca0c888ceed7b4cc280"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:RJYCXUU4II4XIASUCSYKH3I6OR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Several Approaches to Break the Curse of Dimensionality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Markus Weimar","submitted_at":"2013-05-17T13:23:59Z","abstract_excerpt":"In modern science the efficient numerical treatment of high-dimensional problems becomes more and more important. A fundamental insight of the theory of information-based complexity (IBC for short) is that the computational hardness of a problem can not be described properly only by the rate of convergence. There exist problems for which an exponential number of information operations is needed in order to reduce the initial error, although there are algorithms which provide an arbitrary large rate of convergence. Problems that yield this exponential dependence are said to suffer from the curs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.4071","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:25:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3N/L5njLiwhZp5GJ+2rwtcKJoNV/KY4nx0pOjKlJT6pt84UOjLOeJa3ubK5FYPBYkfw655Gt5BGQozm5Z/umDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T17:59:12.299228Z"},"content_sha256":"2b3436bec72ec381dae7495c2ab648e72437be481936818db3d7c1f12c9f967d","schema_version":"1.0","event_id":"sha256:2b3436bec72ec381dae7495c2ab648e72437be481936818db3d7c1f12c9f967d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RJYCXUU4II4XIASUCSYKH3I6OR/bundle.json","state_url":"https://pith.science/pith/RJYCXUU4II4XIASUCSYKH3I6OR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RJYCXUU4II4XIASUCSYKH3I6OR/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-23T17:59:12Z","links":{"resolver":"https://pith.science/pith/RJYCXUU4II4XIASUCSYKH3I6OR","bundle":"https://pith.science/pith/RJYCXUU4II4XIASUCSYKH3I6OR/bundle.json","state":"https://pith.science/pith/RJYCXUU4II4XIASUCSYKH3I6OR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RJYCXUU4II4XIASUCSYKH3I6OR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:RJYCXUU4II4XIASUCSYKH3I6OR","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":"5d952bdaa3ceecf1a250b69cf62a74ea22ca273a8f0a45b416b33f52945bfb90","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-05-17T13:23:59Z","title_canon_sha256":"5b97d8c83689d30f4e179c7d67607b056f3a8d1fd930bdec20bebddff24a58d2"},"schema_version":"1.0","source":{"id":"1305.4071","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.4071","created_at":"2026-05-18T03:25:26Z"},{"alias_kind":"arxiv_version","alias_value":"1305.4071v1","created_at":"2026-05-18T03:25:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4071","created_at":"2026-05-18T03:25:26Z"},{"alias_kind":"pith_short_12","alias_value":"RJYCXUU4II4X","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"RJYCXUU4II4XIASU","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"RJYCXUU4","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:2b3436bec72ec381dae7495c2ab648e72437be481936818db3d7c1f12c9f967d","target":"graph","created_at":"2026-05-18T03:25: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":"In modern science the efficient numerical treatment of high-dimensional problems becomes more and more important. A fundamental insight of the theory of information-based complexity (IBC for short) is that the computational hardness of a problem can not be described properly only by the rate of convergence. There exist problems for which an exponential number of information operations is needed in order to reduce the initial error, although there are algorithms which provide an arbitrary large rate of convergence. Problems that yield this exponential dependence are said to suffer from the curs","authors_text":"Markus Weimar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-05-17T13:23:59Z","title":"Several Approaches to Break the Curse of Dimensionality"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.4071","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:ae0b90101f5444f1862aa8277f2815acc5b791c9bd70aca0c888ceed7b4cc280","target":"record","created_at":"2026-05-18T03:25: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":"5d952bdaa3ceecf1a250b69cf62a74ea22ca273a8f0a45b416b33f52945bfb90","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-05-17T13:23:59Z","title_canon_sha256":"5b97d8c83689d30f4e179c7d67607b056f3a8d1fd930bdec20bebddff24a58d2"},"schema_version":"1.0","source":{"id":"1305.4071","kind":"arxiv","version":1}},"canonical_sha256":"8a702bd29c423974025414b0a3ed1e745d8786076960e5f77bf727db1b1f87ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a702bd29c423974025414b0a3ed1e745d8786076960e5f77bf727db1b1f87ac","first_computed_at":"2026-05-18T03:25:26.359344Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:26.359344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2rq1bIbwOH67n3Sw5Y86e9fN8X345MrosZledMT8Si+4zu7xpKHKc3LVl2zASeF+C09jpecNv2Z6jbje8R4HAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:26.360105Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.4071","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae0b90101f5444f1862aa8277f2815acc5b791c9bd70aca0c888ceed7b4cc280","sha256:2b3436bec72ec381dae7495c2ab648e72437be481936818db3d7c1f12c9f967d"],"state_sha256":"548ef98612f7c9c1b4f0099ca5f07de1c76a7068347a02bee1596bcb1d0150a7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"20D5qirADZCvB3kp0vHaWW8Izq+UHkPv32GSV08h0+xgCQbBnDThssD5yCQOKF9KSCnnOh9Et9i7bcg8i1wyDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T17:59:12.301167Z","bundle_sha256":"a99f46b79d67daa0577170505585d5c57295a83f2fa1ae95e54093c0a433eaf3"}}