{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:CHP7BEDC67VSJ2A6DWDMRYDKQR","short_pith_number":"pith:CHP7BEDC","schema_version":"1.0","canonical_sha256":"11dff09062f7eb24e81e1d86c8e06a847f7a6dc7b1cc33eded54e6693f2b7c22","source":{"kind":"arxiv","id":"1106.5739","version":1},"attestation_state":"computed","paper":{"title":"CHAPLIN - Complex Harmonic Polylogarithms in Fortran","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"hep-ph","authors_text":"Claude Duhr, Stephan Buehler","submitted_at":"2011-06-28T17:43:07Z","abstract_excerpt":"We present a new Fortran library to evaluate all harmonic polylogarithms up to weight four numerically for any complex argument. The algorithm is based on a reduction of harmonic polylogarithms up to weight four to a minimal set of basis functions that are computed numerically using series expansions allowing for fast and reliable numerical results."},"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":"1106.5739","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"hep-ph","submitted_at":"2011-06-28T17:43:07Z","cross_cats_sorted":[],"title_canon_sha256":"552fafc354b765ef38088c86b217620d6c3cd9a527961f6b1f65819d4cb10785","abstract_canon_sha256":"64359c5ce0126af0019aa0fc4e4b083dff0fc34f506a10a927c2d8319dde51f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:12.599022Z","signature_b64":"xzUl9ClYLAPHaQPA/AUOWDnhDzk2XCG+xnkKutdseAgqIKdSPKdvkR/qDz9Xw9H7FxuGpHDdCdxSVnFUfUwiDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11dff09062f7eb24e81e1d86c8e06a847f7a6dc7b1cc33eded54e6693f2b7c22","last_reissued_at":"2026-05-18T04:19:12.598598Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:12.598598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CHAPLIN - Complex Harmonic Polylogarithms in Fortran","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"hep-ph","authors_text":"Claude Duhr, Stephan Buehler","submitted_at":"2011-06-28T17:43:07Z","abstract_excerpt":"We present a new Fortran library to evaluate all harmonic polylogarithms up to weight four numerically for any complex argument. The algorithm is based on a reduction of harmonic polylogarithms up to weight four to a minimal set of basis functions that are computed numerically using series expansions allowing for fast and reliable numerical results."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.5739","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":"1106.5739","created_at":"2026-05-18T04:19:12.598679+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.5739v1","created_at":"2026-05-18T04:19:12.598679+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.5739","created_at":"2026-05-18T04:19:12.598679+00:00"},{"alias_kind":"pith_short_12","alias_value":"CHP7BEDC67VS","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"CHP7BEDC67VSJ2A6","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"CHP7BEDC","created_at":"2026-05-18T12:26:26.731475+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/CHP7BEDC67VSJ2A6DWDMRYDKQR","json":"https://pith.science/pith/CHP7BEDC67VSJ2A6DWDMRYDKQR.json","graph_json":"https://pith.science/api/pith-number/CHP7BEDC67VSJ2A6DWDMRYDKQR/graph.json","events_json":"https://pith.science/api/pith-number/CHP7BEDC67VSJ2A6DWDMRYDKQR/events.json","paper":"https://pith.science/paper/CHP7BEDC"},"agent_actions":{"view_html":"https://pith.science/pith/CHP7BEDC67VSJ2A6DWDMRYDKQR","download_json":"https://pith.science/pith/CHP7BEDC67VSJ2A6DWDMRYDKQR.json","view_paper":"https://pith.science/paper/CHP7BEDC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.5739&json=true","fetch_graph":"https://pith.science/api/pith-number/CHP7BEDC67VSJ2A6DWDMRYDKQR/graph.json","fetch_events":"https://pith.science/api/pith-number/CHP7BEDC67VSJ2A6DWDMRYDKQR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CHP7BEDC67VSJ2A6DWDMRYDKQR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CHP7BEDC67VSJ2A6DWDMRYDKQR/action/storage_attestation","attest_author":"https://pith.science/pith/CHP7BEDC67VSJ2A6DWDMRYDKQR/action/author_attestation","sign_citation":"https://pith.science/pith/CHP7BEDC67VSJ2A6DWDMRYDKQR/action/citation_signature","submit_replication":"https://pith.science/pith/CHP7BEDC67VSJ2A6DWDMRYDKQR/action/replication_record"}},"created_at":"2026-05-18T04:19:12.598679+00:00","updated_at":"2026-05-18T04:19:12.598679+00:00"}