{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:3OKVTDAZNBWEAEOEFNETSLRKIL","short_pith_number":"pith:3OKVTDAZ","schema_version":"1.0","canonical_sha256":"db95598c19686c4011c42b49392e2a42d8e6dc9cd568ca80842ff9e1b47fb5f3","source":{"kind":"arxiv","id":"2407.21239","version":1},"attestation_state":"computed","paper":{"title":"Improved Precision in $Vh(\\rightarrow b\\bar b)$ via Boosted Decision Trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"hep-ph","authors_text":"Philipp Englert","submitted_at":"2024-07-30T23:07:57Z","abstract_excerpt":"Extracting bounds on BSM operators at hadron colliders can be a highly non-trivial task. It can be useful or, depending on the complexity of the event structure, even essential to employ modern analysis techniques in order to measure New-Physics effects. A particular class of such modern methods are Machine-Learning algorithms, which are becoming more and more popular in particle physics. We attempt to gauge their potential in the study of $Vh(\\rightarrow b\\bar b)$ production processes, focusing on the leptonic decay channels of the vector bosons. Specifically, we employ boosted decision trees"},"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":"2407.21239","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"hep-ph","submitted_at":"2024-07-30T23:07:57Z","cross_cats_sorted":[],"title_canon_sha256":"ff4571567e409196e0eb7af410dbcbfcc6d450066320b21e66e78d41da4aae8d","abstract_canon_sha256":"e8b89902ad229f9c60f3e989f2c44864cdb67c0467bab86d96aa578496f0da9a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:50:36.380457Z","signature_b64":"Zf7BdVx5VSrZY9bdE8YLWd9OgyNgQRxyLoxHEISG42VnYmPIMx45qCOl1ZZ4KZSOj/f3ebo1zAn0cloeyQ0wDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db95598c19686c4011c42b49392e2a42d8e6dc9cd568ca80842ff9e1b47fb5f3","last_reissued_at":"2026-07-05T08:50:36.380041Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:50:36.380041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Precision in $Vh(\\rightarrow b\\bar b)$ via Boosted Decision Trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"hep-ph","authors_text":"Philipp Englert","submitted_at":"2024-07-30T23:07:57Z","abstract_excerpt":"Extracting bounds on BSM operators at hadron colliders can be a highly non-trivial task. It can be useful or, depending on the complexity of the event structure, even essential to employ modern analysis techniques in order to measure New-Physics effects. A particular class of such modern methods are Machine-Learning algorithms, which are becoming more and more popular in particle physics. We attempt to gauge their potential in the study of $Vh(\\rightarrow b\\bar b)$ production processes, focusing on the leptonic decay channels of the vector bosons. Specifically, we employ boosted decision trees"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.21239","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/2407.21239/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":"2407.21239","created_at":"2026-07-05T08:50:36.380094+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.21239v1","created_at":"2026-07-05T08:50:36.380094+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.21239","created_at":"2026-07-05T08:50:36.380094+00:00"},{"alias_kind":"pith_short_12","alias_value":"3OKVTDAZNBWE","created_at":"2026-07-05T08:50:36.380094+00:00"},{"alias_kind":"pith_short_16","alias_value":"3OKVTDAZNBWEAEOE","created_at":"2026-07-05T08:50:36.380094+00:00"},{"alias_kind":"pith_short_8","alias_value":"3OKVTDAZ","created_at":"2026-07-05T08:50:36.380094+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.07643","citing_title":"A Step Toward Interpretability: Smearing the Likelihood","ref_index":36,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3OKVTDAZNBWEAEOEFNETSLRKIL","json":"https://pith.science/pith/3OKVTDAZNBWEAEOEFNETSLRKIL.json","graph_json":"https://pith.science/api/pith-number/3OKVTDAZNBWEAEOEFNETSLRKIL/graph.json","events_json":"https://pith.science/api/pith-number/3OKVTDAZNBWEAEOEFNETSLRKIL/events.json","paper":"https://pith.science/paper/3OKVTDAZ"},"agent_actions":{"view_html":"https://pith.science/pith/3OKVTDAZNBWEAEOEFNETSLRKIL","download_json":"https://pith.science/pith/3OKVTDAZNBWEAEOEFNETSLRKIL.json","view_paper":"https://pith.science/paper/3OKVTDAZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.21239&json=true","fetch_graph":"https://pith.science/api/pith-number/3OKVTDAZNBWEAEOEFNETSLRKIL/graph.json","fetch_events":"https://pith.science/api/pith-number/3OKVTDAZNBWEAEOEFNETSLRKIL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3OKVTDAZNBWEAEOEFNETSLRKIL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3OKVTDAZNBWEAEOEFNETSLRKIL/action/storage_attestation","attest_author":"https://pith.science/pith/3OKVTDAZNBWEAEOEFNETSLRKIL/action/author_attestation","sign_citation":"https://pith.science/pith/3OKVTDAZNBWEAEOEFNETSLRKIL/action/citation_signature","submit_replication":"https://pith.science/pith/3OKVTDAZNBWEAEOEFNETSLRKIL/action/replication_record"}},"created_at":"2026-07-05T08:50:36.380094+00:00","updated_at":"2026-07-05T08:50:36.380094+00:00"}