{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6BZUSA366DMN26OEZE6MEZBGT6","short_pith_number":"pith:6BZUSA36","schema_version":"1.0","canonical_sha256":"f07349037ef0d8dd79c4c93cc264269f9b7de04c1b8c6dc920afd8a5edf8bb2b","source":{"kind":"arxiv","id":"1712.04441","version":3},"attestation_state":"computed","paper":{"title":"All orders structure and efficient computation of linearly reducible elliptic Feynman integrals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"hep-ph","authors_text":"Francesco Moriello, Martijn Hidding","submitted_at":"2017-12-12T18:56:59Z","abstract_excerpt":"We define linearly reducible elliptic Feynman integrals, and we show that they can be algorithmically solved up to arbitrary order of the dimensional regulator in terms of a 1-dimensional integral over a polylogarithmic integrand, which we call the inner polylogarithmic part (IPP). The solution is obtained by direct integration of the Feynman parametric representation. When the IPP depends on one elliptic curve (and no other algebraic functions), this class of Feynman integrals can be algorithmically solved in terms of elliptic multiple polylogarithms (eMPLs) by using integration by parts iden"},"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":"1712.04441","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"hep-ph","submitted_at":"2017-12-12T18:56:59Z","cross_cats_sorted":[],"title_canon_sha256":"098d0e3e3364e225a95cb81c8c7c3d09a44d786a3273a8efee30df21246b30ca","abstract_canon_sha256":"abb06900480bc8ab9a9b247234c2be55dc44d3de57814cecacaa7cb552e6f83a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:15.399479Z","signature_b64":"cQ+DVaFAayLB8n2bvevqrZti6JzZFnD4kyHZ7KeDQ2gT4yb9iNMvh62ikH+2ogvpIMfBoHe23g2yf25gyfjbAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f07349037ef0d8dd79c4c93cc264269f9b7de04c1b8c6dc920afd8a5edf8bb2b","last_reissued_at":"2026-05-17T23:56:15.399023Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:15.399023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"All orders structure and efficient computation of linearly reducible elliptic Feynman integrals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"hep-ph","authors_text":"Francesco Moriello, Martijn Hidding","submitted_at":"2017-12-12T18:56:59Z","abstract_excerpt":"We define linearly reducible elliptic Feynman integrals, and we show that they can be algorithmically solved up to arbitrary order of the dimensional regulator in terms of a 1-dimensional integral over a polylogarithmic integrand, which we call the inner polylogarithmic part (IPP). The solution is obtained by direct integration of the Feynman parametric representation. When the IPP depends on one elliptic curve (and no other algebraic functions), this class of Feynman integrals can be algorithmically solved in terms of elliptic multiple polylogarithms (eMPLs) by using integration by parts iden"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.04441","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":""},"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":"1712.04441","created_at":"2026-05-17T23:56:15.399088+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.04441v3","created_at":"2026-05-17T23:56:15.399088+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.04441","created_at":"2026-05-17T23:56:15.399088+00:00"},{"alias_kind":"pith_short_12","alias_value":"6BZUSA366DMN","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6BZUSA366DMN26OE","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6BZUSA36","created_at":"2026-05-18T12:31:03.183658+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2008.06494","citing_title":"Integral Reduction with Kira 2.0 and Finite Field Methods","ref_index":66,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6BZUSA366DMN26OEZE6MEZBGT6","json":"https://pith.science/pith/6BZUSA366DMN26OEZE6MEZBGT6.json","graph_json":"https://pith.science/api/pith-number/6BZUSA366DMN26OEZE6MEZBGT6/graph.json","events_json":"https://pith.science/api/pith-number/6BZUSA366DMN26OEZE6MEZBGT6/events.json","paper":"https://pith.science/paper/6BZUSA36"},"agent_actions":{"view_html":"https://pith.science/pith/6BZUSA366DMN26OEZE6MEZBGT6","download_json":"https://pith.science/pith/6BZUSA366DMN26OEZE6MEZBGT6.json","view_paper":"https://pith.science/paper/6BZUSA36","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.04441&json=true","fetch_graph":"https://pith.science/api/pith-number/6BZUSA366DMN26OEZE6MEZBGT6/graph.json","fetch_events":"https://pith.science/api/pith-number/6BZUSA366DMN26OEZE6MEZBGT6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6BZUSA366DMN26OEZE6MEZBGT6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6BZUSA366DMN26OEZE6MEZBGT6/action/storage_attestation","attest_author":"https://pith.science/pith/6BZUSA366DMN26OEZE6MEZBGT6/action/author_attestation","sign_citation":"https://pith.science/pith/6BZUSA366DMN26OEZE6MEZBGT6/action/citation_signature","submit_replication":"https://pith.science/pith/6BZUSA366DMN26OEZE6MEZBGT6/action/replication_record"}},"created_at":"2026-05-17T23:56:15.399088+00:00","updated_at":"2026-05-17T23:56:15.399088+00:00"}