{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:5MDLKPU2DXA4MNTEDTR5DWL46F","short_pith_number":"pith:5MDLKPU2","schema_version":"1.0","canonical_sha256":"eb06b53e9a1dc1c636641ce3d1d97cf17bec4292e8808e123c8147f6f4720b63","source":{"kind":"arxiv","id":"1411.3834","version":1},"attestation_state":"computed","paper":{"title":"Simple, Parallel, High-Performance Virtual Machines for Extreme Computations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS","hep-ph"],"primary_cat":"physics.comp-ph","authors_text":"Bijan Chokoufe Nejad, J\\\"urgen Reuter, Thorsten Ohl","submitted_at":"2014-11-14T09:15:48Z","abstract_excerpt":"We introduce a high-performance virtual machine (VM) written in a numerically fast language like Fortran or C to evaluate very large expressions. We discuss the general concept of how to perform computations in terms of a VM and present specifically a VM that is able to compute tree-level cross sections for any number of external legs, given the corresponding byte code from the optimal matrix element generator, O'Mega. Furthermore, this approach allows to formulate the parallel computation of a single phase space point in a simple and obvious way. We analyze hereby the scaling behaviour with m"},"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":"1411.3834","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.comp-ph","submitted_at":"2014-11-14T09:15:48Z","cross_cats_sorted":["cs.MS","hep-ph"],"title_canon_sha256":"45d2224a9e62627b0f22d44198d2df0bb5f04484ab68f7bd993488377908b7e9","abstract_canon_sha256":"b60a50ae8b781575a5ca852fa9f4060639e7dc0b6bcde3a28d9430c9a5436a40"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:37.609515Z","signature_b64":"FGfY0KyF2EXDVmtSphUOqJC+94EeutHjUpVkYgVlS51irnx4k7N1KapTwOrUI4sV97JKYKYpnl5er4GOg/oMDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb06b53e9a1dc1c636641ce3d1d97cf17bec4292e8808e123c8147f6f4720b63","last_reissued_at":"2026-05-18T01:32:37.608999Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:37.608999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simple, Parallel, High-Performance Virtual Machines for Extreme Computations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS","hep-ph"],"primary_cat":"physics.comp-ph","authors_text":"Bijan Chokoufe Nejad, J\\\"urgen Reuter, Thorsten Ohl","submitted_at":"2014-11-14T09:15:48Z","abstract_excerpt":"We introduce a high-performance virtual machine (VM) written in a numerically fast language like Fortran or C to evaluate very large expressions. We discuss the general concept of how to perform computations in terms of a VM and present specifically a VM that is able to compute tree-level cross sections for any number of external legs, given the corresponding byte code from the optimal matrix element generator, O'Mega. Furthermore, this approach allows to formulate the parallel computation of a single phase space point in a simple and obvious way. We analyze hereby the scaling behaviour with m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.3834","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":"1411.3834","created_at":"2026-05-18T01:32:37.609082+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.3834v1","created_at":"2026-05-18T01:32:37.609082+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.3834","created_at":"2026-05-18T01:32:37.609082+00:00"},{"alias_kind":"pith_short_12","alias_value":"5MDLKPU2DXA4","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"5MDLKPU2DXA4MNTE","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"5MDLKPU2","created_at":"2026-05-18T12:28:14.216126+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/5MDLKPU2DXA4MNTEDTR5DWL46F","json":"https://pith.science/pith/5MDLKPU2DXA4MNTEDTR5DWL46F.json","graph_json":"https://pith.science/api/pith-number/5MDLKPU2DXA4MNTEDTR5DWL46F/graph.json","events_json":"https://pith.science/api/pith-number/5MDLKPU2DXA4MNTEDTR5DWL46F/events.json","paper":"https://pith.science/paper/5MDLKPU2"},"agent_actions":{"view_html":"https://pith.science/pith/5MDLKPU2DXA4MNTEDTR5DWL46F","download_json":"https://pith.science/pith/5MDLKPU2DXA4MNTEDTR5DWL46F.json","view_paper":"https://pith.science/paper/5MDLKPU2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.3834&json=true","fetch_graph":"https://pith.science/api/pith-number/5MDLKPU2DXA4MNTEDTR5DWL46F/graph.json","fetch_events":"https://pith.science/api/pith-number/5MDLKPU2DXA4MNTEDTR5DWL46F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5MDLKPU2DXA4MNTEDTR5DWL46F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5MDLKPU2DXA4MNTEDTR5DWL46F/action/storage_attestation","attest_author":"https://pith.science/pith/5MDLKPU2DXA4MNTEDTR5DWL46F/action/author_attestation","sign_citation":"https://pith.science/pith/5MDLKPU2DXA4MNTEDTR5DWL46F/action/citation_signature","submit_replication":"https://pith.science/pith/5MDLKPU2DXA4MNTEDTR5DWL46F/action/replication_record"}},"created_at":"2026-05-18T01:32:37.609082+00:00","updated_at":"2026-05-18T01:32:37.609082+00:00"}