{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:2MJTJ3FKYFBO2232FUAZJWRAZI","short_pith_number":"pith:2MJTJ3FK","schema_version":"1.0","canonical_sha256":"d31334ecaac142ed6b7a2d0194da20ca3e5d5d06602f2832ca5042f7b0c7548f","source":{"kind":"arxiv","id":"1403.1229","version":2},"attestation_state":"computed","paper":{"title":"Ninja: Automated Integrand Reduction via Laurent Expansion for One-Loop Amplitudes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"hep-ph","authors_text":"Tiziano Peraro","submitted_at":"2014-03-05T19:10:00Z","abstract_excerpt":"We present the public C++ library Ninja, which implements the Integrand Reduction via Laurent Expansion method for the computation of one-loop integrals. The algorithm is suited for applications to complex one-loop processes."},"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":"1403.1229","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"hep-ph","submitted_at":"2014-03-05T19:10:00Z","cross_cats_sorted":[],"title_canon_sha256":"2dd027e9a76b2632f5d133218bb092b2a4ecef08ff2cc2300dc74c3dc9c5ecb7","abstract_canon_sha256":"cdd86d411ecc69985565ece0fd0de6cfe26311a4a06ab0308679716788e44eb6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:15.537755Z","signature_b64":"NU/7GrVMExJeN6nA1HUW/R6BPOOAx9qexLzC50rNKukkmUR1c3qrpgyMpD+2ROL/QF3olxxLvDZSEumw8Z5YAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d31334ecaac142ed6b7a2d0194da20ca3e5d5d06602f2832ca5042f7b0c7548f","last_reissued_at":"2026-05-18T02:47:15.537040Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:15.537040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ninja: Automated Integrand Reduction via Laurent Expansion for One-Loop Amplitudes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"hep-ph","authors_text":"Tiziano Peraro","submitted_at":"2014-03-05T19:10:00Z","abstract_excerpt":"We present the public C++ library Ninja, which implements the Integrand Reduction via Laurent Expansion method for the computation of one-loop integrals. The algorithm is suited for applications to complex one-loop processes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.1229","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":""},"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":"1403.1229","created_at":"2026-05-18T02:47:15.537157+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.1229v2","created_at":"2026-05-18T02:47:15.537157+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.1229","created_at":"2026-05-18T02:47:15.537157+00:00"},{"alias_kind":"pith_short_12","alias_value":"2MJTJ3FKYFBO","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"2MJTJ3FKYFBO2232","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"2MJTJ3FK","created_at":"2026-05-18T12:28:11.866339+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2505.03724","citing_title":"Stay Positive: Neural Refinement of Sample Weights","ref_index":16,"is_internal_anchor":true},{"citing_arxiv_id":"2601.21040","citing_title":"Constraining dimension-6 SMEFT with higher-order predictions for $p p \\to t W$","ref_index":118,"is_internal_anchor":true},{"citing_arxiv_id":"1405.0301","citing_title":"The automated computation of tree-level and next-to-leading order differential cross sections, and their matching to parton shower simulations","ref_index":82,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2MJTJ3FKYFBO2232FUAZJWRAZI","json":"https://pith.science/pith/2MJTJ3FKYFBO2232FUAZJWRAZI.json","graph_json":"https://pith.science/api/pith-number/2MJTJ3FKYFBO2232FUAZJWRAZI/graph.json","events_json":"https://pith.science/api/pith-number/2MJTJ3FKYFBO2232FUAZJWRAZI/events.json","paper":"https://pith.science/paper/2MJTJ3FK"},"agent_actions":{"view_html":"https://pith.science/pith/2MJTJ3FKYFBO2232FUAZJWRAZI","download_json":"https://pith.science/pith/2MJTJ3FKYFBO2232FUAZJWRAZI.json","view_paper":"https://pith.science/paper/2MJTJ3FK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.1229&json=true","fetch_graph":"https://pith.science/api/pith-number/2MJTJ3FKYFBO2232FUAZJWRAZI/graph.json","fetch_events":"https://pith.science/api/pith-number/2MJTJ3FKYFBO2232FUAZJWRAZI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2MJTJ3FKYFBO2232FUAZJWRAZI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2MJTJ3FKYFBO2232FUAZJWRAZI/action/storage_attestation","attest_author":"https://pith.science/pith/2MJTJ3FKYFBO2232FUAZJWRAZI/action/author_attestation","sign_citation":"https://pith.science/pith/2MJTJ3FKYFBO2232FUAZJWRAZI/action/citation_signature","submit_replication":"https://pith.science/pith/2MJTJ3FKYFBO2232FUAZJWRAZI/action/replication_record"}},"created_at":"2026-05-18T02:47:15.537157+00:00","updated_at":"2026-05-18T02:47:15.537157+00:00"}