{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:JK3NVOCE2YOTV5NJMP47UHU7VT","short_pith_number":"pith:JK3NVOCE","canonical_record":{"source":{"id":"1601.05470","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-01-20T22:53:17Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"229913020df3a4d31a79a1ffa21d06447f67978e095f8f323dc6e2c7c0bdbe9c","abstract_canon_sha256":"49e203cf2626dd2f86fc42f62573fb3d621b53513ba21fcdc44c86ae32a34203"},"schema_version":"1.0"},"canonical_sha256":"4ab6dab844d61d3af5a963f9fa1e9facda830fed99e93994db7e174742b1363c","source":{"kind":"arxiv","id":"1601.05470","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.05470","created_at":"2026-05-18T00:45:16Z"},{"alias_kind":"arxiv_version","alias_value":"1601.05470v4","created_at":"2026-05-18T00:45:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05470","created_at":"2026-05-18T00:45:16Z"},{"alias_kind":"pith_short_12","alias_value":"JK3NVOCE2YOT","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JK3NVOCE2YOTV5NJ","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JK3NVOCE","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:JK3NVOCE2YOTV5NJMP47UHU7VT","target":"record","payload":{"canonical_record":{"source":{"id":"1601.05470","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-01-20T22:53:17Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"229913020df3a4d31a79a1ffa21d06447f67978e095f8f323dc6e2c7c0bdbe9c","abstract_canon_sha256":"49e203cf2626dd2f86fc42f62573fb3d621b53513ba21fcdc44c86ae32a34203"},"schema_version":"1.0"},"canonical_sha256":"4ab6dab844d61d3af5a963f9fa1e9facda830fed99e93994db7e174742b1363c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:16.351767Z","signature_b64":"DPvsCdzRIHw1Lk/wojNcWckGkPa7h9P+Vdk1MV7nq/7aTy4W5Mj6+W0sG+x0RI0fwjpDceDa5FKe9FMEVTRBAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ab6dab844d61d3af5a963f9fa1e9facda830fed99e93994db7e174742b1363c","last_reissued_at":"2026-05-18T00:45:16.351080Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:16.351080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.05470","source_version":4,"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-18T00:45:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bhUhnJlsMXywOKsOSvQHyNzOqr7zAc5AO4UU775zXlJZFCHG8Pu7oj6XKYKE5V9xvRTC0u4o/Nc0RmRpclJ8Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:10:21.771470Z"},"content_sha256":"b785d014180b37f1d787d722b73323f379b58e8f1586028884d24f5b14da4eb6","schema_version":"1.0","event_id":"sha256:b785d014180b37f1d787d722b73323f379b58e8f1586028884d24f5b14da4eb6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:JK3NVOCE2YOTV5NJMP47UHU7VT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Effectively Subsampled Quadratures For Least Squares Polynomial Approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.NA","authors_text":"Akil Narayan, Pranay Seshadri, Sankaran Mahadevan","submitted_at":"2016-01-20T22:53:17Z","abstract_excerpt":"This paper proposes a new deterministic sampling strategy for constructing polynomial chaos approximations for expensive physics simulation models. The proposed approach, effectively subsampled quadratures involves sparsely subsampling an existing tensor grid using QR column pivoting. For polynomial interpolation using hyperbolic or total order sets, we then solve the following square least squares problem. For polynomial approximation, we use a column pruning heuristic that removes columns based on the highest total orders and then solves the tall least squares problem. While we provide bound"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05470","kind":"arxiv","version":4},"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-18T00:45:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VwbjtBmdW8u1pXEPTCsfx+aXdZzQmb1Txo3yjSRLxldJMdBkf4kZm5HXuT13NKVab5E+xsJKNQZvSloRuItMAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:10:21.772148Z"},"content_sha256":"d5da5ed0f8b5897c91b8a7f0142d2ce682e923ba49e8c501ab9be78cd56b0130","schema_version":"1.0","event_id":"sha256:d5da5ed0f8b5897c91b8a7f0142d2ce682e923ba49e8c501ab9be78cd56b0130"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JK3NVOCE2YOTV5NJMP47UHU7VT/bundle.json","state_url":"https://pith.science/pith/JK3NVOCE2YOTV5NJMP47UHU7VT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JK3NVOCE2YOTV5NJMP47UHU7VT/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-26T01:10:21Z","links":{"resolver":"https://pith.science/pith/JK3NVOCE2YOTV5NJMP47UHU7VT","bundle":"https://pith.science/pith/JK3NVOCE2YOTV5NJMP47UHU7VT/bundle.json","state":"https://pith.science/pith/JK3NVOCE2YOTV5NJMP47UHU7VT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JK3NVOCE2YOTV5NJMP47UHU7VT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:JK3NVOCE2YOTV5NJMP47UHU7VT","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":"49e203cf2626dd2f86fc42f62573fb3d621b53513ba21fcdc44c86ae32a34203","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-01-20T22:53:17Z","title_canon_sha256":"229913020df3a4d31a79a1ffa21d06447f67978e095f8f323dc6e2c7c0bdbe9c"},"schema_version":"1.0","source":{"id":"1601.05470","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.05470","created_at":"2026-05-18T00:45:16Z"},{"alias_kind":"arxiv_version","alias_value":"1601.05470v4","created_at":"2026-05-18T00:45:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05470","created_at":"2026-05-18T00:45:16Z"},{"alias_kind":"pith_short_12","alias_value":"JK3NVOCE2YOT","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JK3NVOCE2YOTV5NJ","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JK3NVOCE","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:d5da5ed0f8b5897c91b8a7f0142d2ce682e923ba49e8c501ab9be78cd56b0130","target":"graph","created_at":"2026-05-18T00:45:16Z","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":"This paper proposes a new deterministic sampling strategy for constructing polynomial chaos approximations for expensive physics simulation models. The proposed approach, effectively subsampled quadratures involves sparsely subsampling an existing tensor grid using QR column pivoting. For polynomial interpolation using hyperbolic or total order sets, we then solve the following square least squares problem. For polynomial approximation, we use a column pruning heuristic that removes columns based on the highest total orders and then solves the tall least squares problem. While we provide bound","authors_text":"Akil Narayan, Pranay Seshadri, Sankaran Mahadevan","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-01-20T22:53:17Z","title":"Effectively Subsampled Quadratures For Least Squares Polynomial Approximations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05470","kind":"arxiv","version":4},"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:b785d014180b37f1d787d722b73323f379b58e8f1586028884d24f5b14da4eb6","target":"record","created_at":"2026-05-18T00:45:16Z","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":"49e203cf2626dd2f86fc42f62573fb3d621b53513ba21fcdc44c86ae32a34203","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-01-20T22:53:17Z","title_canon_sha256":"229913020df3a4d31a79a1ffa21d06447f67978e095f8f323dc6e2c7c0bdbe9c"},"schema_version":"1.0","source":{"id":"1601.05470","kind":"arxiv","version":4}},"canonical_sha256":"4ab6dab844d61d3af5a963f9fa1e9facda830fed99e93994db7e174742b1363c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ab6dab844d61d3af5a963f9fa1e9facda830fed99e93994db7e174742b1363c","first_computed_at":"2026-05-18T00:45:16.351080Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:16.351080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DPvsCdzRIHw1Lk/wojNcWckGkPa7h9P+Vdk1MV7nq/7aTy4W5Mj6+W0sG+x0RI0fwjpDceDa5FKe9FMEVTRBAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:16.351767Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.05470","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b785d014180b37f1d787d722b73323f379b58e8f1586028884d24f5b14da4eb6","sha256:d5da5ed0f8b5897c91b8a7f0142d2ce682e923ba49e8c501ab9be78cd56b0130"],"state_sha256":"95e09169e55ca582e615e437b29afd36983a550f72f8fba20e8cff43bb28bb71"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DoXI8nKwRzBEqnA7CJNmRNElFW4kfiI+BOhIQ22U1RyeAVkKLxxYpxrfDPvVyZGk6q2hnpr2iAvJVvV8ArAnBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T01:10:21.775624Z","bundle_sha256":"de5b60ef7d93886ecd4bca916268415f91785b16f9cec6c9bf281383bf7cbe66"}}