{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:EC2JAGUI7LOTKWZQJSYBGSYDIG","short_pith_number":"pith:EC2JAGUI","schema_version":"1.0","canonical_sha256":"20b4901a88fadd355b304cb0134b0341a47a4276849568d62bf22bba56eb1656","source":{"kind":"arxiv","id":"2508.01834","version":2},"attestation_state":"computed","paper":{"title":"Efficient optimization of expensive black-box simulators via marginal means, with application to neutrino detector design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.CO","stat.ME"],"primary_cat":"stat.ML","authors_text":"Alan Poon, Ann-Kathrin Schuetz, Hwanwoo Kim, Simon Mak","submitted_at":"2025-08-03T16:44:05Z","abstract_excerpt":"With advances in scientific computing, computer experiments are increasingly used for optimizing complex systems. However, for modern applications, e.g., the optimization of nuclear physics detectors, each experiment run can require hundreds of CPU hours, making the optimization of its black-box simulator over a high-dimensional space a challenging task. Given limited runs at inputs $\\mathbf{x}_1, \\cdots, \\mathbf{x}_n$, the best solution from these evaluated inputs can be far from optimal, particularly as dimensionality increases. Existing black-box methods, however, largely employ this ''pick"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2508.01834","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2025-08-03T16:44:05Z","cross_cats_sorted":["cs.LG","stat.CO","stat.ME"],"title_canon_sha256":"524fcca327f4b00286d5550eacf47001d8470c04e4a85741a3bf1f26e213592e","abstract_canon_sha256":"e80bd174b7d92633deb5042c9af8578363828b51d5db9051542653848e67eb3f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:49:58.963767Z","signature_b64":"OCrJGCBT3GT8DpdkV7kTV7sCsmIV9KhI6PRFqtC/Xyl/yCzA38YbtlIy8SKFqi+X8wqq9suvTFnyaxE7J7qIAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20b4901a88fadd355b304cb0134b0341a47a4276849568d62bf22bba56eb1656","last_reissued_at":"2026-07-05T11:49:58.963343Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:49:58.963343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient optimization of expensive black-box simulators via marginal means, with application to neutrino detector design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.CO","stat.ME"],"primary_cat":"stat.ML","authors_text":"Alan Poon, Ann-Kathrin Schuetz, Hwanwoo Kim, Simon Mak","submitted_at":"2025-08-03T16:44:05Z","abstract_excerpt":"With advances in scientific computing, computer experiments are increasingly used for optimizing complex systems. However, for modern applications, e.g., the optimization of nuclear physics detectors, each experiment run can require hundreds of CPU hours, making the optimization of its black-box simulator over a high-dimensional space a challenging task. Given limited runs at inputs $\\mathbf{x}_1, \\cdots, \\mathbf{x}_n$, the best solution from these evaluated inputs can be far from optimal, particularly as dimensionality increases. Existing black-box methods, however, largely employ this ''pick"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.01834","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2508.01834/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2508.01834","created_at":"2026-07-05T11:49:58.963399+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.01834v2","created_at":"2026-07-05T11:49:58.963399+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.01834","created_at":"2026-07-05T11:49:58.963399+00:00"},{"alias_kind":"pith_short_12","alias_value":"EC2JAGUI7LOT","created_at":"2026-07-05T11:49:58.963399+00:00"},{"alias_kind":"pith_short_16","alias_value":"EC2JAGUI7LOTKWZQ","created_at":"2026-07-05T11:49:58.963399+00:00"},{"alias_kind":"pith_short_8","alias_value":"EC2JAGUI","created_at":"2026-07-05T11:49:58.963399+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EC2JAGUI7LOTKWZQJSYBGSYDIG","json":"https://pith.science/pith/EC2JAGUI7LOTKWZQJSYBGSYDIG.json","graph_json":"https://pith.science/api/pith-number/EC2JAGUI7LOTKWZQJSYBGSYDIG/graph.json","events_json":"https://pith.science/api/pith-number/EC2JAGUI7LOTKWZQJSYBGSYDIG/events.json","paper":"https://pith.science/paper/EC2JAGUI"},"agent_actions":{"view_html":"https://pith.science/pith/EC2JAGUI7LOTKWZQJSYBGSYDIG","download_json":"https://pith.science/pith/EC2JAGUI7LOTKWZQJSYBGSYDIG.json","view_paper":"https://pith.science/paper/EC2JAGUI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.01834&json=true","fetch_graph":"https://pith.science/api/pith-number/EC2JAGUI7LOTKWZQJSYBGSYDIG/graph.json","fetch_events":"https://pith.science/api/pith-number/EC2JAGUI7LOTKWZQJSYBGSYDIG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EC2JAGUI7LOTKWZQJSYBGSYDIG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EC2JAGUI7LOTKWZQJSYBGSYDIG/action/storage_attestation","attest_author":"https://pith.science/pith/EC2JAGUI7LOTKWZQJSYBGSYDIG/action/author_attestation","sign_citation":"https://pith.science/pith/EC2JAGUI7LOTKWZQJSYBGSYDIG/action/citation_signature","submit_replication":"https://pith.science/pith/EC2JAGUI7LOTKWZQJSYBGSYDIG/action/replication_record"}},"created_at":"2026-07-05T11:49:58.963399+00:00","updated_at":"2026-07-05T11:49:58.963399+00:00"}