{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:R44AH3UVP2SNEOHOZM63LWPMOD","short_pith_number":"pith:R44AH3UV","schema_version":"1.0","canonical_sha256":"8f3803ee957ea4d238eecb3db5d9ec70cef60e7f6180f4fc80690e892b56fdda","source":{"kind":"arxiv","id":"2205.12976","version":1},"attestation_state":"computed","paper":{"title":"Learning the EFT likelihood with tree boosting","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"hep-ph","authors_text":"Dennis Schwarz, Robert Sch\\\"ofbeck, Stefan Rohshap, Suman Chatterjee","submitted_at":"2022-05-25T18:00:03Z","abstract_excerpt":"We develop a tree boosting algorithm for collider measurements of multiple Wilson coefficients in effective field theories describing phenomena beyond the standard model of particle physics. The design of the discriminant exploits per-event information of the simulated data sets that encodes the predictions for different values of the Wilson coefficients. This ``Boosted Information Tree'' algorithm provides nearly optimal discrimination power order-by-order in the expansion in the Wilson coefficients and approaches the optimal likelihood ratio test statistic. As a proof-of-principle, we apply "},"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":"2205.12976","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"hep-ph","submitted_at":"2022-05-25T18:00:03Z","cross_cats_sorted":[],"title_canon_sha256":"ea85d1b2e49747bd0cd9f186dbad694fe82f8d5edf11e7d7a8e8d838f0ab2d83","abstract_canon_sha256":"09d2ab64d25f81223bd2f38b9f92b1197d58e8a6b8477ce02c7689edef4d3fc1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:26:38.906913Z","signature_b64":"KyzOZqV13L92Ax70zIwkjp4FuxJk171LtnuTSuFLRh3RlabkDpasXG4ZOn7Zm0NVADeob2ugb3gxGcmHaJQ5Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f3803ee957ea4d238eecb3db5d9ec70cef60e7f6180f4fc80690e892b56fdda","last_reissued_at":"2026-07-05T04:26:38.906467Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:26:38.906467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning the EFT likelihood with tree boosting","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"hep-ph","authors_text":"Dennis Schwarz, Robert Sch\\\"ofbeck, Stefan Rohshap, Suman Chatterjee","submitted_at":"2022-05-25T18:00:03Z","abstract_excerpt":"We develop a tree boosting algorithm for collider measurements of multiple Wilson coefficients in effective field theories describing phenomena beyond the standard model of particle physics. The design of the discriminant exploits per-event information of the simulated data sets that encodes the predictions for different values of the Wilson coefficients. This ``Boosted Information Tree'' algorithm provides nearly optimal discrimination power order-by-order in the expansion in the Wilson coefficients and approaches the optimal likelihood ratio test statistic. As a proof-of-principle, we apply "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.12976","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2205.12976/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":"2205.12976","created_at":"2026-07-05T04:26:38.906529+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.12976v1","created_at":"2026-07-05T04:26:38.906529+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.12976","created_at":"2026-07-05T04:26:38.906529+00:00"},{"alias_kind":"pith_short_12","alias_value":"R44AH3UVP2SN","created_at":"2026-07-05T04:26:38.906529+00:00"},{"alias_kind":"pith_short_16","alias_value":"R44AH3UVP2SNEOHO","created_at":"2026-07-05T04:26:38.906529+00:00"},{"alias_kind":"pith_short_8","alias_value":"R44AH3UV","created_at":"2026-07-05T04:26:38.906529+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.13157","citing_title":"Proton Structure from Neural Simulation-Based Inference at the LHC","ref_index":70,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R44AH3UVP2SNEOHOZM63LWPMOD","json":"https://pith.science/pith/R44AH3UVP2SNEOHOZM63LWPMOD.json","graph_json":"https://pith.science/api/pith-number/R44AH3UVP2SNEOHOZM63LWPMOD/graph.json","events_json":"https://pith.science/api/pith-number/R44AH3UVP2SNEOHOZM63LWPMOD/events.json","paper":"https://pith.science/paper/R44AH3UV"},"agent_actions":{"view_html":"https://pith.science/pith/R44AH3UVP2SNEOHOZM63LWPMOD","download_json":"https://pith.science/pith/R44AH3UVP2SNEOHOZM63LWPMOD.json","view_paper":"https://pith.science/paper/R44AH3UV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.12976&json=true","fetch_graph":"https://pith.science/api/pith-number/R44AH3UVP2SNEOHOZM63LWPMOD/graph.json","fetch_events":"https://pith.science/api/pith-number/R44AH3UVP2SNEOHOZM63LWPMOD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R44AH3UVP2SNEOHOZM63LWPMOD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R44AH3UVP2SNEOHOZM63LWPMOD/action/storage_attestation","attest_author":"https://pith.science/pith/R44AH3UVP2SNEOHOZM63LWPMOD/action/author_attestation","sign_citation":"https://pith.science/pith/R44AH3UVP2SNEOHOZM63LWPMOD/action/citation_signature","submit_replication":"https://pith.science/pith/R44AH3UVP2SNEOHOZM63LWPMOD/action/replication_record"}},"created_at":"2026-07-05T04:26:38.906529+00:00","updated_at":"2026-07-05T04:26:38.906529+00:00"}