{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:2W7CFQBKCPOLQLNF7PXAPNSQPS","short_pith_number":"pith:2W7CFQBK","schema_version":"1.0","canonical_sha256":"d5be22c02a13dcb82da5fbee07b6507c89e4883cb7eb964025c16998ef2c5774","source":{"kind":"arxiv","id":"1912.03142","version":1},"attestation_state":"computed","paper":{"title":"Analytic multi-loop results using finite fields and dataflow graphs with FiniteFlow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["hep-th"],"primary_cat":"hep-ph","authors_text":"Tiziano Peraro","submitted_at":"2019-12-06T14:21:19Z","abstract_excerpt":"FiniteFlow is a public framework for defining and executing numerical algorithms over finite fields and reconstructing multivariate rational functions. The framework allows to build complex algorithms by combining basic building blocks into graphical representations of the calculation, known as dataflow graphs. It offers an easy-to-use Mathematica interface for implementing efficient custom algorithms without any low-level coding. We report on some new features of FiniteFlow which have been published after its initial release, give some simple example of usage for common tasks and review recen"},"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":"1912.03142","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"hep-ph","submitted_at":"2019-12-06T14:21:19Z","cross_cats_sorted":["hep-th"],"title_canon_sha256":"1aeb334faf0daf9554f72530c165b171696c9c4f8ac0f92d7d711910c9b2ca08","abstract_canon_sha256":"875b04e5788f0c1d842df8edf2f1c274874047772ba90dd99cc4f6f822cdf3df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:24:30.860635Z","signature_b64":"8E839SHPj22ngtyG0JThpwGyRnGQZVI8v/8J9ORQokFLzfb3w2hEf0EqyhRGfLvzPNYN4VRF2S+IQSzM3T5rBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5be22c02a13dcb82da5fbee07b6507c89e4883cb7eb964025c16998ef2c5774","last_reissued_at":"2026-07-05T00:24:30.860171Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:24:30.860171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analytic multi-loop results using finite fields and dataflow graphs with FiniteFlow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["hep-th"],"primary_cat":"hep-ph","authors_text":"Tiziano Peraro","submitted_at":"2019-12-06T14:21:19Z","abstract_excerpt":"FiniteFlow is a public framework for defining and executing numerical algorithms over finite fields and reconstructing multivariate rational functions. The framework allows to build complex algorithms by combining basic building blocks into graphical representations of the calculation, known as dataflow graphs. It offers an easy-to-use Mathematica interface for implementing efficient custom algorithms without any low-level coding. We report on some new features of FiniteFlow which have been published after its initial release, give some simple example of usage for common tasks and review recen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.03142","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1912.03142/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1912.03142","created_at":"2026-07-05T00:24:30.860230+00:00"},{"alias_kind":"arxiv_version","alias_value":"1912.03142v1","created_at":"2026-07-05T00:24:30.860230+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.03142","created_at":"2026-07-05T00:24:30.860230+00:00"},{"alias_kind":"pith_short_12","alias_value":"2W7CFQBKCPOL","created_at":"2026-07-05T00:24:30.860230+00:00"},{"alias_kind":"pith_short_16","alias_value":"2W7CFQBKCPOLQLNF","created_at":"2026-07-05T00:24:30.860230+00:00"},{"alias_kind":"pith_short_8","alias_value":"2W7CFQBK","created_at":"2026-07-05T00:24:30.860230+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.09503","citing_title":"NNLO QCD predictions for $t\\bar t W$ production at hadron colliders","ref_index":53,"is_internal_anchor":false},{"citing_arxiv_id":"2606.31823","citing_title":"NNLO QCD predictions for $t\\bar{t}W$ production at the LHC","ref_index":54,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2W7CFQBKCPOLQLNF7PXAPNSQPS","json":"https://pith.science/pith/2W7CFQBKCPOLQLNF7PXAPNSQPS.json","graph_json":"https://pith.science/api/pith-number/2W7CFQBKCPOLQLNF7PXAPNSQPS/graph.json","events_json":"https://pith.science/api/pith-number/2W7CFQBKCPOLQLNF7PXAPNSQPS/events.json","paper":"https://pith.science/paper/2W7CFQBK"},"agent_actions":{"view_html":"https://pith.science/pith/2W7CFQBKCPOLQLNF7PXAPNSQPS","download_json":"https://pith.science/pith/2W7CFQBKCPOLQLNF7PXAPNSQPS.json","view_paper":"https://pith.science/paper/2W7CFQBK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1912.03142&json=true","fetch_graph":"https://pith.science/api/pith-number/2W7CFQBKCPOLQLNF7PXAPNSQPS/graph.json","fetch_events":"https://pith.science/api/pith-number/2W7CFQBKCPOLQLNF7PXAPNSQPS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2W7CFQBKCPOLQLNF7PXAPNSQPS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2W7CFQBKCPOLQLNF7PXAPNSQPS/action/storage_attestation","attest_author":"https://pith.science/pith/2W7CFQBKCPOLQLNF7PXAPNSQPS/action/author_attestation","sign_citation":"https://pith.science/pith/2W7CFQBKCPOLQLNF7PXAPNSQPS/action/citation_signature","submit_replication":"https://pith.science/pith/2W7CFQBKCPOLQLNF7PXAPNSQPS/action/replication_record"}},"created_at":"2026-07-05T00:24:30.860230+00:00","updated_at":"2026-07-05T00:24:30.860230+00:00"}