{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:YSZNJHTJ2XIPG5DWVOM2LNALER","short_pith_number":"pith:YSZNJHTJ","canonical_record":{"source":{"id":"1812.11601","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-12-30T20:13:54Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"3307ae0411acd93fdf1bc7f439bfb796765f3a05f0c20e5a75eb93170b493ef4","abstract_canon_sha256":"701190b81aa09ce6514b15ea9cae5ee1ef1a2754b0ed21d2b3d589264779de53"},"schema_version":"1.0"},"canonical_sha256":"c4b2d49e69d5d0f37476ab99a5b40b2445832d0b476e7ac2a67a298b40990159","source":{"kind":"arxiv","id":"1812.11601","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.11601","created_at":"2026-05-17T23:57:11Z"},{"alias_kind":"arxiv_version","alias_value":"1812.11601v1","created_at":"2026-05-17T23:57:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.11601","created_at":"2026-05-17T23:57:11Z"},{"alias_kind":"pith_short_12","alias_value":"YSZNJHTJ2XIP","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YSZNJHTJ2XIPG5DW","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YSZNJHTJ","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:YSZNJHTJ2XIPG5DWVOM2LNALER","target":"record","payload":{"canonical_record":{"source":{"id":"1812.11601","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-12-30T20:13:54Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"3307ae0411acd93fdf1bc7f439bfb796765f3a05f0c20e5a75eb93170b493ef4","abstract_canon_sha256":"701190b81aa09ce6514b15ea9cae5ee1ef1a2754b0ed21d2b3d589264779de53"},"schema_version":"1.0"},"canonical_sha256":"c4b2d49e69d5d0f37476ab99a5b40b2445832d0b476e7ac2a67a298b40990159","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:11.539057Z","signature_b64":"RNrHu9MBu4gex6XNGBfudzdmgRltk4jvr7g/AtyzV+pNu/Swgw8EmsiI3MiK9wz4CD3sK1xd77ksDi2CV+CwBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4b2d49e69d5d0f37476ab99a5b40b2445832d0b476e7ac2a67a298b40990159","last_reissued_at":"2026-05-17T23:57:11.538688Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:11.538688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.11601","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:57:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZrM5fkYY1OUfbfe4cnempwEIvOjbWvuE16Figjm+NjbLemRN4BVeU9fag8IifV4YSA6VdtqCtGIy2UIDyAiDAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:02:00.427972Z"},"content_sha256":"4e16592e534b41fb58014d367ff40b8fdcff77a06ca2023e91aeb658b1dbd3a6","schema_version":"1.0","event_id":"sha256:4e16592e534b41fb58014d367ff40b8fdcff77a06ca2023e91aeb658b1dbd3a6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:YSZNJHTJ2XIPG5DWVOM2LNALER","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Allocation strategies for high fidelity models in the multifidelity regime","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Akil Narayan, Daniel J. Perry, Robert M. Kirby, Ross T. Whitaker","submitted_at":"2018-12-30T20:13:54Z","abstract_excerpt":"We propose a novel approach to allocating resources for expensive simulations of high fidelity models when used in a multifidelity framework. Allocation decisions that distribute computational resources across several simulation models become extremely important in situations where only a small number of expensive high fidelity simulations can be run. We identify this allocation decision as a problem in optimal subset selection, and subsequently regularize this problem so that solutions can be computed. Our regularized formulation yields a type of group lasso problem that has been studied in t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.11601","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:57:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p+mNzmphH21tAgl8WXHl1H1PRv1y5nI3yYRShg0bveZq+oorlU9Tbbs7NZq/Bcx8tbzE9MNQfhxnB9q0ceoKCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:02:00.428332Z"},"content_sha256":"175206c7b914481a5af7ffe396e9b19abcb96efcd57c0a9f678dddc481d3ed6f","schema_version":"1.0","event_id":"sha256:175206c7b914481a5af7ffe396e9b19abcb96efcd57c0a9f678dddc481d3ed6f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YSZNJHTJ2XIPG5DWVOM2LNALER/bundle.json","state_url":"https://pith.science/pith/YSZNJHTJ2XIPG5DWVOM2LNALER/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YSZNJHTJ2XIPG5DWVOM2LNALER/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-01T17:02:00Z","links":{"resolver":"https://pith.science/pith/YSZNJHTJ2XIPG5DWVOM2LNALER","bundle":"https://pith.science/pith/YSZNJHTJ2XIPG5DWVOM2LNALER/bundle.json","state":"https://pith.science/pith/YSZNJHTJ2XIPG5DWVOM2LNALER/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YSZNJHTJ2XIPG5DWVOM2LNALER/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YSZNJHTJ2XIPG5DWVOM2LNALER","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":"701190b81aa09ce6514b15ea9cae5ee1ef1a2754b0ed21d2b3d589264779de53","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-12-30T20:13:54Z","title_canon_sha256":"3307ae0411acd93fdf1bc7f439bfb796765f3a05f0c20e5a75eb93170b493ef4"},"schema_version":"1.0","source":{"id":"1812.11601","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.11601","created_at":"2026-05-17T23:57:11Z"},{"alias_kind":"arxiv_version","alias_value":"1812.11601v1","created_at":"2026-05-17T23:57:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.11601","created_at":"2026-05-17T23:57:11Z"},{"alias_kind":"pith_short_12","alias_value":"YSZNJHTJ2XIP","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YSZNJHTJ2XIPG5DW","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YSZNJHTJ","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:175206c7b914481a5af7ffe396e9b19abcb96efcd57c0a9f678dddc481d3ed6f","target":"graph","created_at":"2026-05-17T23:57:11Z","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 propose a novel approach to allocating resources for expensive simulations of high fidelity models when used in a multifidelity framework. Allocation decisions that distribute computational resources across several simulation models become extremely important in situations where only a small number of expensive high fidelity simulations can be run. We identify this allocation decision as a problem in optimal subset selection, and subsequently regularize this problem so that solutions can be computed. Our regularized formulation yields a type of group lasso problem that has been studied in t","authors_text":"Akil Narayan, Daniel J. Perry, Robert M. Kirby, Ross T. Whitaker","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-12-30T20:13:54Z","title":"Allocation strategies for high fidelity models in the multifidelity regime"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.11601","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:4e16592e534b41fb58014d367ff40b8fdcff77a06ca2023e91aeb658b1dbd3a6","target":"record","created_at":"2026-05-17T23:57:11Z","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":"701190b81aa09ce6514b15ea9cae5ee1ef1a2754b0ed21d2b3d589264779de53","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-12-30T20:13:54Z","title_canon_sha256":"3307ae0411acd93fdf1bc7f439bfb796765f3a05f0c20e5a75eb93170b493ef4"},"schema_version":"1.0","source":{"id":"1812.11601","kind":"arxiv","version":1}},"canonical_sha256":"c4b2d49e69d5d0f37476ab99a5b40b2445832d0b476e7ac2a67a298b40990159","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c4b2d49e69d5d0f37476ab99a5b40b2445832d0b476e7ac2a67a298b40990159","first_computed_at":"2026-05-17T23:57:11.538688Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:11.538688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RNrHu9MBu4gex6XNGBfudzdmgRltk4jvr7g/AtyzV+pNu/Swgw8EmsiI3MiK9wz4CD3sK1xd77ksDi2CV+CwBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:11.539057Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.11601","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e16592e534b41fb58014d367ff40b8fdcff77a06ca2023e91aeb658b1dbd3a6","sha256:175206c7b914481a5af7ffe396e9b19abcb96efcd57c0a9f678dddc481d3ed6f"],"state_sha256":"54a2fa68df81edce0af148abc1d8eb680183d2bd61d829619387979bf56831e8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7PrDWqM07rYDY6VOL7DVGMb0U6Ba6l7rh+dMNrbnHtMBjs08h7Eu2dblodKJFFhQd6lLZx48y0OMBFWavSVWAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T17:02:00.430276Z","bundle_sha256":"1928603991c96edcf3c31c3d1a23d2eae07db3f55e15ce41986f7023ae765797"}}