{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:LWS5K5MRN62ADZHEGKCD2CQS23","short_pith_number":"pith:LWS5K5MR","canonical_record":{"source":{"id":"1903.11536","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-03-27T16:41:24Z","cross_cats_sorted":[],"title_canon_sha256":"7fd801a1f8fc649900f832bebd868b4e02812b918bb90ae746a2f41fb0b1b902","abstract_canon_sha256":"41037a0484b97c4bdb4ac51943865f0adef075645b331d0e7d6f396c3e9f7b52"},"schema_version":"1.0"},"canonical_sha256":"5da5d575916fb401e4e432843d0a12d6f83260eeed2cfd75f177a43f93e4f804","source":{"kind":"arxiv","id":"1903.11536","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.11536","created_at":"2026-05-17T23:50:03Z"},{"alias_kind":"arxiv_version","alias_value":"1903.11536v1","created_at":"2026-05-17T23:50:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.11536","created_at":"2026-05-17T23:50:03Z"},{"alias_kind":"pith_short_12","alias_value":"LWS5K5MRN62A","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LWS5K5MRN62ADZHE","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LWS5K5MR","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:LWS5K5MRN62ADZHEGKCD2CQS23","target":"record","payload":{"canonical_record":{"source":{"id":"1903.11536","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-03-27T16:41:24Z","cross_cats_sorted":[],"title_canon_sha256":"7fd801a1f8fc649900f832bebd868b4e02812b918bb90ae746a2f41fb0b1b902","abstract_canon_sha256":"41037a0484b97c4bdb4ac51943865f0adef075645b331d0e7d6f396c3e9f7b52"},"schema_version":"1.0"},"canonical_sha256":"5da5d575916fb401e4e432843d0a12d6f83260eeed2cfd75f177a43f93e4f804","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:03.040181Z","signature_b64":"Ko+YCdpnNOXYeCSe8n8L1abN2tn/E7oKtFKcBEhbLfvnXW3Ee9+jg42rkwW0yvIP8eavPBzTvlQjXfKfYUb/DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5da5d575916fb401e4e432843d0a12d6f83260eeed2cfd75f177a43f93e4f804","last_reissued_at":"2026-05-17T23:50:03.039707Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:03.039707Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.11536","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-17T23:50:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RzgqCd/59RZuB6DJJuhJhTiC7xqxMji/LUIMsfRePwKAP2qd5DTUKBRjZvgvt057Tk1tmd4HA0l2nZxcBTMBAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T15:37:59.157753Z"},"content_sha256":"4b04c745b579722e88a9931c54949e20122eae2a7ca8b161178ab36c29b54cc4","schema_version":"1.0","event_id":"sha256:4b04c745b579722e88a9931c54949e20122eae2a7ca8b161178ab36c29b54cc4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:LWS5K5MRN62ADZHEGKCD2CQS23","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Greedy Method for Solving Classes of PDE Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Robert Schaback","submitted_at":"2019-03-27T16:41:24Z","abstract_excerpt":"Motivated by the successful use of greedy algorithms for Reduced Basis Methods, a greedy method is proposed that selects N input data in an asymptotically optimal way to solve well-posed operator equations using these N data. The operator equations are defined as infinitely many equations given via a compact set of functionals in the dual of an underlying Hilbert space, and then the greedy algorithm, defined directly in the dual Hilbert space, selects N functionals step by step. When N functionals are selected, the operator equation is numerically solved by projection onto the span of the Ries"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.11536","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-17T23:50:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PdCuXXd3ABKLEU4gch0iWsAY15a3f/8BVWhGvjYzWyPg6PMJ1aiQQL5jDMmrgr/viH81elD2lgS2HInvNcd7DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T15:37:59.158098Z"},"content_sha256":"e6541b4cbbfd5e12abaf951736281c0a499b8056418a59b6b315df984a0a5919","schema_version":"1.0","event_id":"sha256:e6541b4cbbfd5e12abaf951736281c0a499b8056418a59b6b315df984a0a5919"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LWS5K5MRN62ADZHEGKCD2CQS23/bundle.json","state_url":"https://pith.science/pith/LWS5K5MRN62ADZHEGKCD2CQS23/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LWS5K5MRN62ADZHEGKCD2CQS23/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-28T15:37:59Z","links":{"resolver":"https://pith.science/pith/LWS5K5MRN62ADZHEGKCD2CQS23","bundle":"https://pith.science/pith/LWS5K5MRN62ADZHEGKCD2CQS23/bundle.json","state":"https://pith.science/pith/LWS5K5MRN62ADZHEGKCD2CQS23/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LWS5K5MRN62ADZHEGKCD2CQS23/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LWS5K5MRN62ADZHEGKCD2CQS23","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":"41037a0484b97c4bdb4ac51943865f0adef075645b331d0e7d6f396c3e9f7b52","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-03-27T16:41:24Z","title_canon_sha256":"7fd801a1f8fc649900f832bebd868b4e02812b918bb90ae746a2f41fb0b1b902"},"schema_version":"1.0","source":{"id":"1903.11536","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.11536","created_at":"2026-05-17T23:50:03Z"},{"alias_kind":"arxiv_version","alias_value":"1903.11536v1","created_at":"2026-05-17T23:50:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.11536","created_at":"2026-05-17T23:50:03Z"},{"alias_kind":"pith_short_12","alias_value":"LWS5K5MRN62A","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LWS5K5MRN62ADZHE","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LWS5K5MR","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:e6541b4cbbfd5e12abaf951736281c0a499b8056418a59b6b315df984a0a5919","target":"graph","created_at":"2026-05-17T23:50:03Z","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":"Motivated by the successful use of greedy algorithms for Reduced Basis Methods, a greedy method is proposed that selects N input data in an asymptotically optimal way to solve well-posed operator equations using these N data. The operator equations are defined as infinitely many equations given via a compact set of functionals in the dual of an underlying Hilbert space, and then the greedy algorithm, defined directly in the dual Hilbert space, selects N functionals step by step. When N functionals are selected, the operator equation is numerically solved by projection onto the span of the Ries","authors_text":"Robert Schaback","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-03-27T16:41:24Z","title":"A Greedy Method for Solving Classes of PDE Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.11536","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:4b04c745b579722e88a9931c54949e20122eae2a7ca8b161178ab36c29b54cc4","target":"record","created_at":"2026-05-17T23:50:03Z","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":"41037a0484b97c4bdb4ac51943865f0adef075645b331d0e7d6f396c3e9f7b52","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-03-27T16:41:24Z","title_canon_sha256":"7fd801a1f8fc649900f832bebd868b4e02812b918bb90ae746a2f41fb0b1b902"},"schema_version":"1.0","source":{"id":"1903.11536","kind":"arxiv","version":1}},"canonical_sha256":"5da5d575916fb401e4e432843d0a12d6f83260eeed2cfd75f177a43f93e4f804","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5da5d575916fb401e4e432843d0a12d6f83260eeed2cfd75f177a43f93e4f804","first_computed_at":"2026-05-17T23:50:03.039707Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:03.039707Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ko+YCdpnNOXYeCSe8n8L1abN2tn/E7oKtFKcBEhbLfvnXW3Ee9+jg42rkwW0yvIP8eavPBzTvlQjXfKfYUb/DQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:03.040181Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.11536","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b04c745b579722e88a9931c54949e20122eae2a7ca8b161178ab36c29b54cc4","sha256:e6541b4cbbfd5e12abaf951736281c0a499b8056418a59b6b315df984a0a5919"],"state_sha256":"11752da3c8d51d6065057ddab2cf47cc895679b106fd805521098e18b8e96352"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aB8CS7IKScpc61GDBkH206pYJf3tNQtlXaKMh9Zsz2mu0e6QNMgY/ndEaE7b7f/8lLraTs3Iu+WD60drUuR4CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T15:37:59.159971Z","bundle_sha256":"e52cebb4eb5590fe3da51b1baed05580a6f66ea2c7b2a302c158b322ff6c0b92"}}