{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:ZZCOQAQ7F4MDPOI5FHRFTH4OWM","short_pith_number":"pith:ZZCOQAQ7","schema_version":"1.0","canonical_sha256":"ce44e8021f2f1837b91d29e2599f8eb325f43071649fb0c5a2760a388654522a","source":{"kind":"arxiv","id":"1211.5204","version":2},"attestation_state":"computed","paper":{"title":"Algorithms to Evaluate Multiple Sums for Loop Computations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["hep-ph","math-ph","math.MP"],"primary_cat":"hep-th","authors_text":"C. Anzai, Y. Sumino","submitted_at":"2012-11-22T05:13:27Z","abstract_excerpt":"We present algorithms to evaluate two types of multiple sums, which appear in higher-order loop computations. We consider expansions of a generalized hypergeometric-type sums, $\\sum_{n_1,...,n_N} [Gamma(a1.n+c1) Gamma(a2.n}+c2) ... Gamma(aM.n+cM)] / [Gamma(b1.n+d1) Gamma(b2.n+d2) ... Gamma(bM.n+dM)] x1^n1...xN^nN $ with $ai.n=\\sum_{j=1}^N a_{ij}nj$, etc., in a small parameter epsilon around rational values of ci,di's. Type I sum corresponds to the case where, in the limit epsilon -> 0, the summand reduces to a rational function of nj's times x1^n1...xN^nN; ci,di's can depend on an external int"},"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":"1211.5204","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"hep-th","submitted_at":"2012-11-22T05:13:27Z","cross_cats_sorted":["hep-ph","math-ph","math.MP"],"title_canon_sha256":"3d5aaec9e2dda60bc886f1a24a588d3b86eda330f14ff392ad7279cf31d198f2","abstract_canon_sha256":"8c4ad5dbe45d51efd720160edc44a767591887a522b342de2921ccfbf42af88f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:53:01.685004Z","signature_b64":"4MRe8v/DxA+ozJAlmC0YcX4J7tQOyo5cMHO3DosBTcLM/nx/YYmSDWe1L3P/KrY+AmjE7zfILkd8S1BC7XIcDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce44e8021f2f1837b91d29e2599f8eb325f43071649fb0c5a2760a388654522a","last_reissued_at":"2026-05-18T01:53:01.684364Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:53:01.684364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms to Evaluate Multiple Sums for Loop Computations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["hep-ph","math-ph","math.MP"],"primary_cat":"hep-th","authors_text":"C. Anzai, Y. Sumino","submitted_at":"2012-11-22T05:13:27Z","abstract_excerpt":"We present algorithms to evaluate two types of multiple sums, which appear in higher-order loop computations. We consider expansions of a generalized hypergeometric-type sums, $\\sum_{n_1,...,n_N} [Gamma(a1.n+c1) Gamma(a2.n}+c2) ... Gamma(aM.n+cM)] / [Gamma(b1.n+d1) Gamma(b2.n+d2) ... Gamma(bM.n+dM)] x1^n1...xN^nN $ with $ai.n=\\sum_{j=1}^N a_{ij}nj$, etc., in a small parameter epsilon around rational values of ci,di's. Type I sum corresponds to the case where, in the limit epsilon -> 0, the summand reduces to a rational function of nj's times x1^n1...xN^nN; ci,di's can depend on an external int"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.5204","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":"1211.5204","created_at":"2026-05-18T01:53:01.684464+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.5204v2","created_at":"2026-05-18T01:53:01.684464+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.5204","created_at":"2026-05-18T01:53:01.684464+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZZCOQAQ7F4MD","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZZCOQAQ7F4MDPOI5","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZZCOQAQ7","created_at":"2026-05-18T12:27:30.460161+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZZCOQAQ7F4MDPOI5FHRFTH4OWM","json":"https://pith.science/pith/ZZCOQAQ7F4MDPOI5FHRFTH4OWM.json","graph_json":"https://pith.science/api/pith-number/ZZCOQAQ7F4MDPOI5FHRFTH4OWM/graph.json","events_json":"https://pith.science/api/pith-number/ZZCOQAQ7F4MDPOI5FHRFTH4OWM/events.json","paper":"https://pith.science/paper/ZZCOQAQ7"},"agent_actions":{"view_html":"https://pith.science/pith/ZZCOQAQ7F4MDPOI5FHRFTH4OWM","download_json":"https://pith.science/pith/ZZCOQAQ7F4MDPOI5FHRFTH4OWM.json","view_paper":"https://pith.science/paper/ZZCOQAQ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.5204&json=true","fetch_graph":"https://pith.science/api/pith-number/ZZCOQAQ7F4MDPOI5FHRFTH4OWM/graph.json","fetch_events":"https://pith.science/api/pith-number/ZZCOQAQ7F4MDPOI5FHRFTH4OWM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZZCOQAQ7F4MDPOI5FHRFTH4OWM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZZCOQAQ7F4MDPOI5FHRFTH4OWM/action/storage_attestation","attest_author":"https://pith.science/pith/ZZCOQAQ7F4MDPOI5FHRFTH4OWM/action/author_attestation","sign_citation":"https://pith.science/pith/ZZCOQAQ7F4MDPOI5FHRFTH4OWM/action/citation_signature","submit_replication":"https://pith.science/pith/ZZCOQAQ7F4MDPOI5FHRFTH4OWM/action/replication_record"}},"created_at":"2026-05-18T01:53:01.684464+00:00","updated_at":"2026-05-18T01:53:01.684464+00:00"}