{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:D73NENWAQB6XWQ5OWEOFK6PEDF","short_pith_number":"pith:D73NENWA","schema_version":"1.0","canonical_sha256":"1ff6d236c0807d7b43aeb11c5579e41969cb3b5157d3955dee7b464a1bb40ff6","source":{"kind":"arxiv","id":"1109.3608","version":1},"attestation_state":"computed","paper":{"title":"Efficient Matrix-Element Matching with Sector Showers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"hep-ph","authors_text":"J.J. Lopez-Villarejo, P. Skands","submitted_at":"2011-09-16T13:23:25Z","abstract_excerpt":"A Markovian shower algorithm based on \"sector antennae\" is presented and its main properties illustrated. Tree-level full-color matrix elements can be automatically incorporated in the algorithm and are re-interpreted as process-dependent 2 -> n antenna functions. In hard parts of phase-space, these functions generate tree-level matrix-element corrections to the shower. In soft parts, they should improve the logarithmic accuracy of it. The number of matrix-element evaluations required per order of matching is 1, with an unweighting efficiency that remains very high for arbitrary numbers of leg"},"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":"1109.3608","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"hep-ph","submitted_at":"2011-09-16T13:23:25Z","cross_cats_sorted":[],"title_canon_sha256":"d1a2f720b6f1d99fc9f4f45c0f0a013982034ab5552dccbd047785e854e2f8cf","abstract_canon_sha256":"7b0ec69a8abfacc0c175ce2c5dc07d231bce991757760f3cd42d1ec7408867aa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:00:31.858690Z","signature_b64":"PWO7LZBR2/u+40tztn36NNAXOhv7eFzVr6mjQBGyhZ4BeoAEMWPLoNzoqI3yc2OHr2RbYPSbndtsZ88C5+FcAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ff6d236c0807d7b43aeb11c5579e41969cb3b5157d3955dee7b464a1bb40ff6","last_reissued_at":"2026-05-18T02:00:31.858183Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:00:31.858183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Matrix-Element Matching with Sector Showers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"hep-ph","authors_text":"J.J. Lopez-Villarejo, P. Skands","submitted_at":"2011-09-16T13:23:25Z","abstract_excerpt":"A Markovian shower algorithm based on \"sector antennae\" is presented and its main properties illustrated. Tree-level full-color matrix elements can be automatically incorporated in the algorithm and are re-interpreted as process-dependent 2 -> n antenna functions. In hard parts of phase-space, these functions generate tree-level matrix-element corrections to the shower. In soft parts, they should improve the logarithmic accuracy of it. The number of matrix-element evaluations required per order of matching is 1, with an unweighting efficiency that remains very high for arbitrary numbers of leg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.3608","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1109.3608","created_at":"2026-05-18T02:00:31.858259+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.3608v1","created_at":"2026-05-18T02:00:31.858259+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3608","created_at":"2026-05-18T02:00:31.858259+00:00"},{"alias_kind":"pith_short_12","alias_value":"D73NENWAQB6X","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"D73NENWAQB6XWQ5O","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"D73NENWA","created_at":"2026-05-18T12:26:26.731475+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2203.11601","citing_title":"A comprehensive guide to the physics and usage of PYTHIA 8.3","ref_index":189,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/D73NENWAQB6XWQ5OWEOFK6PEDF","json":"https://pith.science/pith/D73NENWAQB6XWQ5OWEOFK6PEDF.json","graph_json":"https://pith.science/api/pith-number/D73NENWAQB6XWQ5OWEOFK6PEDF/graph.json","events_json":"https://pith.science/api/pith-number/D73NENWAQB6XWQ5OWEOFK6PEDF/events.json","paper":"https://pith.science/paper/D73NENWA"},"agent_actions":{"view_html":"https://pith.science/pith/D73NENWAQB6XWQ5OWEOFK6PEDF","download_json":"https://pith.science/pith/D73NENWAQB6XWQ5OWEOFK6PEDF.json","view_paper":"https://pith.science/paper/D73NENWA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.3608&json=true","fetch_graph":"https://pith.science/api/pith-number/D73NENWAQB6XWQ5OWEOFK6PEDF/graph.json","fetch_events":"https://pith.science/api/pith-number/D73NENWAQB6XWQ5OWEOFK6PEDF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D73NENWAQB6XWQ5OWEOFK6PEDF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D73NENWAQB6XWQ5OWEOFK6PEDF/action/storage_attestation","attest_author":"https://pith.science/pith/D73NENWAQB6XWQ5OWEOFK6PEDF/action/author_attestation","sign_citation":"https://pith.science/pith/D73NENWAQB6XWQ5OWEOFK6PEDF/action/citation_signature","submit_replication":"https://pith.science/pith/D73NENWAQB6XWQ5OWEOFK6PEDF/action/replication_record"}},"created_at":"2026-05-18T02:00:31.858259+00:00","updated_at":"2026-05-18T02:00:31.858259+00:00"}