{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:4R6MQC247BBEM33RF2DNAUJHFR","short_pith_number":"pith:4R6MQC24","schema_version":"1.0","canonical_sha256":"e47cc80b5cf842466f712e86d051272c5e0eeb342cfda506b7c72cf8ad49c704","source":{"kind":"arxiv","id":"2110.13632","version":3},"attestation_state":"computed","paper":{"title":"Generative Networks for Precision Enthusiasts","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"hep-ph","authors_text":"Anja Butter, Armand Rousselot, Sander Hummerich, Sophia Vent, Theo Heimel, Tilman Plehn, Tobias Krebs","submitted_at":"2021-10-22T18:10:42Z","abstract_excerpt":"Generative networks are opening new avenues in fast event generation for the LHC. We show how generative flow networks can reach percent-level precision for kinematic distributions, how they can be trained jointly with a discriminator, and how this discriminator improves the generation. Our joint training relies on a novel coupling of the two networks which does not require a Nash equilibrium. We then estimate the generation uncertainties through a Bayesian network setup and through conditional data augmentation, while the discriminator ensures that there are no systematic inconsistencies comp"},"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":"2110.13632","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"hep-ph","submitted_at":"2021-10-22T18:10:42Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2725f6fe35b2490ac961853bad57d66bd8dbfac19b64c59c5ae0687c1015b434","abstract_canon_sha256":"87ef6f45a5632cb215e9bf84118e1ae1c143a4e9a1584a29b0fcff3896780b79"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:04:29.008639Z","signature_b64":"jmw20JpfG+RGW1GLcajdpK/M37BVECmMrn/GenUBIt8jbhM4a2Y/+4aiCGrUOrRQuaHcY10IQ+Pjf0oL10lNDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e47cc80b5cf842466f712e86d051272c5e0eeb342cfda506b7c72cf8ad49c704","last_reissued_at":"2026-07-05T06:04:29.008184Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:04:29.008184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generative Networks for Precision Enthusiasts","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"hep-ph","authors_text":"Anja Butter, Armand Rousselot, Sander Hummerich, Sophia Vent, Theo Heimel, Tilman Plehn, Tobias Krebs","submitted_at":"2021-10-22T18:10:42Z","abstract_excerpt":"Generative networks are opening new avenues in fast event generation for the LHC. We show how generative flow networks can reach percent-level precision for kinematic distributions, how they can be trained jointly with a discriminator, and how this discriminator improves the generation. Our joint training relies on a novel coupling of the two networks which does not require a Nash equilibrium. We then estimate the generation uncertainties through a Bayesian network setup and through conditional data augmentation, while the discriminator ensures that there are no systematic inconsistencies comp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.13632","kind":"arxiv","version":3},"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/2110.13632/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":"2110.13632","created_at":"2026-07-05T06:04:29.008241+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.13632v3","created_at":"2026-07-05T06:04:29.008241+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.13632","created_at":"2026-07-05T06:04:29.008241+00:00"},{"alias_kind":"pith_short_12","alias_value":"4R6MQC247BBE","created_at":"2026-07-05T06:04:29.008241+00:00"},{"alias_kind":"pith_short_16","alias_value":"4R6MQC247BBEM33R","created_at":"2026-07-05T06:04:29.008241+00:00"},{"alias_kind":"pith_short_8","alias_value":"4R6MQC24","created_at":"2026-07-05T06:04:29.008241+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.18360","citing_title":"Nested-GPT for variable-multiplicity parton showers: A case study in the resummation of non-global logarithms","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2605.18360","citing_title":"Nested-GPT for variable-multiplicity parton showers: A case study in the resummation of non-global logarithms","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4R6MQC247BBEM33RF2DNAUJHFR","json":"https://pith.science/pith/4R6MQC247BBEM33RF2DNAUJHFR.json","graph_json":"https://pith.science/api/pith-number/4R6MQC247BBEM33RF2DNAUJHFR/graph.json","events_json":"https://pith.science/api/pith-number/4R6MQC247BBEM33RF2DNAUJHFR/events.json","paper":"https://pith.science/paper/4R6MQC24"},"agent_actions":{"view_html":"https://pith.science/pith/4R6MQC247BBEM33RF2DNAUJHFR","download_json":"https://pith.science/pith/4R6MQC247BBEM33RF2DNAUJHFR.json","view_paper":"https://pith.science/paper/4R6MQC24","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.13632&json=true","fetch_graph":"https://pith.science/api/pith-number/4R6MQC247BBEM33RF2DNAUJHFR/graph.json","fetch_events":"https://pith.science/api/pith-number/4R6MQC247BBEM33RF2DNAUJHFR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4R6MQC247BBEM33RF2DNAUJHFR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4R6MQC247BBEM33RF2DNAUJHFR/action/storage_attestation","attest_author":"https://pith.science/pith/4R6MQC247BBEM33RF2DNAUJHFR/action/author_attestation","sign_citation":"https://pith.science/pith/4R6MQC247BBEM33RF2DNAUJHFR/action/citation_signature","submit_replication":"https://pith.science/pith/4R6MQC247BBEM33RF2DNAUJHFR/action/replication_record"}},"created_at":"2026-07-05T06:04:29.008241+00:00","updated_at":"2026-07-05T06:04:29.008241+00:00"}