{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:TAT3652A26P37MY74BVUESQOBG","short_pith_number":"pith:TAT3652A","canonical_record":{"source":{"id":"1110.0058","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-10-01T00:29:39Z","cross_cats_sorted":[],"title_canon_sha256":"c204cbc35e78530aa4848be78021db07369501f55cad596e609d68db633a0b56","abstract_canon_sha256":"cb7d7702bbcf5f095cf6421fe0327a0e07406015f39fe3a0442c73d6345777cc"},"schema_version":"1.0"},"canonical_sha256":"9827bf7740d79fbfb31fe06b424a0e0984fed3614184779f9efeb5bc59454dbb","source":{"kind":"arxiv","id":"1110.0058","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.0058","created_at":"2026-05-18T03:28:54Z"},{"alias_kind":"arxiv_version","alias_value":"1110.0058v2","created_at":"2026-05-18T03:28:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.0058","created_at":"2026-05-18T03:28:54Z"},{"alias_kind":"pith_short_12","alias_value":"TAT3652A26P3","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"TAT3652A26P37MY7","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"TAT3652A","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:TAT3652A26P37MY74BVUESQOBG","target":"record","payload":{"canonical_record":{"source":{"id":"1110.0058","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-10-01T00:29:39Z","cross_cats_sorted":[],"title_canon_sha256":"c204cbc35e78530aa4848be78021db07369501f55cad596e609d68db633a0b56","abstract_canon_sha256":"cb7d7702bbcf5f095cf6421fe0327a0e07406015f39fe3a0442c73d6345777cc"},"schema_version":"1.0"},"canonical_sha256":"9827bf7740d79fbfb31fe06b424a0e0984fed3614184779f9efeb5bc59454dbb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:54.183588Z","signature_b64":"Hod1eLrWQeebqPFaDME+sp6+lvdhJ0vQr1GsHhRpDrDa2Ob4xK/+MT0La7lMjXZ/AitfZnxe8FKb8O4f4cUtBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9827bf7740d79fbfb31fe06b424a0e0984fed3614184779f9efeb5bc59454dbb","last_reissued_at":"2026-05-18T03:28:54.182714Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:54.182714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.0058","source_version":2,"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:28:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pAOaLcaS6E7jln38LEAZGiXVV6v6FwUtoKJKhYZv46VSK0roHjytaE0bLgk01ao8BAHb2Z8rHRJwlYHPAMhuBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:43:12.767094Z"},"content_sha256":"d01b61a1cbdc0f39505633b28a6bcc10f37800c7eb8b7c5be4135883914dfdf5","schema_version":"1.0","event_id":"sha256:d01b61a1cbdc0f39505633b28a6bcc10f37800c7eb8b7c5be4135883914dfdf5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:TAT3652A26P37MY74BVUESQOBG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Lanczos Method for Approximating Composite Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Eric T. Phipps, Paul G. Constantine","submitted_at":"2011-10-01T00:29:39Z","abstract_excerpt":"We seek to approximate a composite function h(x) = g(f(x)) with a global polynomial. The standard approach chooses points x in the domain of f and computes h(x) at each point, which requires an evaluation of f and an evaluation of g. We present a Lanczos-based procedure that implicitly approximates g with a polynomial of f. By constructing a quadrature rule for the density function of f, we can approximate h(x) using many fewer evaluations of g. The savings is particularly dramatic when g is much more expensive than f or the dimension of x is large. We demonstrate this procedure with two numer"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.0058","kind":"arxiv","version":2},"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:28:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5JQO+Y4/utUabiGn1YsddR0ODLedq7LL+tbChhBn9hGmBuiMKhe6DTcU+x6l5ozUVXHzBW+kAPedUiy6BcSBAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:43:12.767452Z"},"content_sha256":"ed657ce86dc55cd2105d50990fa239e375772e6df05a65bb030a51a987b9ef76","schema_version":"1.0","event_id":"sha256:ed657ce86dc55cd2105d50990fa239e375772e6df05a65bb030a51a987b9ef76"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TAT3652A26P37MY74BVUESQOBG/bundle.json","state_url":"https://pith.science/pith/TAT3652A26P37MY74BVUESQOBG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TAT3652A26P37MY74BVUESQOBG/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-05-28T10:43:12Z","links":{"resolver":"https://pith.science/pith/TAT3652A26P37MY74BVUESQOBG","bundle":"https://pith.science/pith/TAT3652A26P37MY74BVUESQOBG/bundle.json","state":"https://pith.science/pith/TAT3652A26P37MY74BVUESQOBG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TAT3652A26P37MY74BVUESQOBG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:TAT3652A26P37MY74BVUESQOBG","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":"cb7d7702bbcf5f095cf6421fe0327a0e07406015f39fe3a0442c73d6345777cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-10-01T00:29:39Z","title_canon_sha256":"c204cbc35e78530aa4848be78021db07369501f55cad596e609d68db633a0b56"},"schema_version":"1.0","source":{"id":"1110.0058","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.0058","created_at":"2026-05-18T03:28:54Z"},{"alias_kind":"arxiv_version","alias_value":"1110.0058v2","created_at":"2026-05-18T03:28:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.0058","created_at":"2026-05-18T03:28:54Z"},{"alias_kind":"pith_short_12","alias_value":"TAT3652A26P3","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"TAT3652A26P37MY7","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"TAT3652A","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:ed657ce86dc55cd2105d50990fa239e375772e6df05a65bb030a51a987b9ef76","target":"graph","created_at":"2026-05-18T03:28:54Z","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":"We seek to approximate a composite function h(x) = g(f(x)) with a global polynomial. The standard approach chooses points x in the domain of f and computes h(x) at each point, which requires an evaluation of f and an evaluation of g. We present a Lanczos-based procedure that implicitly approximates g with a polynomial of f. By constructing a quadrature rule for the density function of f, we can approximate h(x) using many fewer evaluations of g. The savings is particularly dramatic when g is much more expensive than f or the dimension of x is large. We demonstrate this procedure with two numer","authors_text":"Eric T. Phipps, Paul G. Constantine","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-10-01T00:29:39Z","title":"A Lanczos Method for Approximating Composite Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.0058","kind":"arxiv","version":2},"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:d01b61a1cbdc0f39505633b28a6bcc10f37800c7eb8b7c5be4135883914dfdf5","target":"record","created_at":"2026-05-18T03:28:54Z","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":"cb7d7702bbcf5f095cf6421fe0327a0e07406015f39fe3a0442c73d6345777cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-10-01T00:29:39Z","title_canon_sha256":"c204cbc35e78530aa4848be78021db07369501f55cad596e609d68db633a0b56"},"schema_version":"1.0","source":{"id":"1110.0058","kind":"arxiv","version":2}},"canonical_sha256":"9827bf7740d79fbfb31fe06b424a0e0984fed3614184779f9efeb5bc59454dbb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9827bf7740d79fbfb31fe06b424a0e0984fed3614184779f9efeb5bc59454dbb","first_computed_at":"2026-05-18T03:28:54.182714Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:28:54.182714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Hod1eLrWQeebqPFaDME+sp6+lvdhJ0vQr1GsHhRpDrDa2Ob4xK/+MT0La7lMjXZ/AitfZnxe8FKb8O4f4cUtBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:28:54.183588Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.0058","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d01b61a1cbdc0f39505633b28a6bcc10f37800c7eb8b7c5be4135883914dfdf5","sha256:ed657ce86dc55cd2105d50990fa239e375772e6df05a65bb030a51a987b9ef76"],"state_sha256":"f0281e2f0a62e518dd9c4a7425d7f65fa3b7121398590869c7c6a6373421acc4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b2Oye8SJeofX1qqtuYB0n3zc4j50dEnv6g4gSYr46rnY+jzTuhFvj2q8cd+K7BAVoOCKJAjqKK2Krj4+uEkFAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:43:12.769185Z","bundle_sha256":"46e74d409c308079e25b479c47236ebf01b1268189371e8d3281224a952546e5"}}