{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:RDEZDN7SS6JVU5A6SPFAN3L3SF","short_pith_number":"pith:RDEZDN7S","schema_version":"1.0","canonical_sha256":"88c991b7f297935a741e93ca06ed7b914a8a048dab01d84cd2f20073db23126a","source":{"kind":"arxiv","id":"0712.0813","version":1},"attestation_state":"computed","paper":{"title":"CLUSTEREASY: A Program for Simulating Scalar Field Evolution on Parallel Computers","license":"","headline":"","cross_cats":["hep-lat","hep-th"],"primary_cat":"hep-ph","authors_text":"Gary N Felder","submitted_at":"2007-12-05T20:00:31Z","abstract_excerpt":"We describe a new, parallel programming version of the scalar field simulation program LATTICEEASY. The new C++ program, CLUSTEREASY, can simulate arbitrary scalar field models on distributed-memory clusters. The speed and memory requirements scale well with the number of processors. As with the serial version of LATTICEEASY, CLUSTEREASY can run simulations in one, two, or three dimensions, with or without expansion of the universe, with customizable parameters and output. The program and its full documentation are available on the LATTICEEASY website at http://www.science.smith.edu/department"},"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":"0712.0813","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"hep-ph","submitted_at":"2007-12-05T20:00:31Z","cross_cats_sorted":["hep-lat","hep-th"],"title_canon_sha256":"06464a3094e4ae30982d0a0865b65927dd20b55ba13106f97de711f4cde28083","abstract_canon_sha256":"93ed5f07de02e83b5ecd259531cfec943a5d922099c63ae6df145be990aa3f9e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T17:29:37.343513Z","signature_b64":"187FRgNGTCUwITZdIw2qk1c7XfVoREZ7WzZjLj4ywcu8tOABzUP90meSO87svHHSZc4LbBhjtxlaFGQzOHQUBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88c991b7f297935a741e93ca06ed7b914a8a048dab01d84cd2f20073db23126a","last_reissued_at":"2026-07-04T17:29:37.343035Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T17:29:37.343035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CLUSTEREASY: A Program for Simulating Scalar Field Evolution on Parallel Computers","license":"","headline":"","cross_cats":["hep-lat","hep-th"],"primary_cat":"hep-ph","authors_text":"Gary N Felder","submitted_at":"2007-12-05T20:00:31Z","abstract_excerpt":"We describe a new, parallel programming version of the scalar field simulation program LATTICEEASY. The new C++ program, CLUSTEREASY, can simulate arbitrary scalar field models on distributed-memory clusters. The speed and memory requirements scale well with the number of processors. As with the serial version of LATTICEEASY, CLUSTEREASY can run simulations in one, two, or three dimensions, with or without expansion of the universe, with customizable parameters and output. The program and its full documentation are available on the LATTICEEASY website at http://www.science.smith.edu/department"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0712.0813","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/0712.0813/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":"0712.0813","created_at":"2026-07-04T17:29:37.343105+00:00"},{"alias_kind":"arxiv_version","alias_value":"0712.0813v1","created_at":"2026-07-04T17:29:37.343105+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0712.0813","created_at":"2026-07-04T17:29:37.343105+00:00"},{"alias_kind":"pith_short_12","alias_value":"RDEZDN7SS6JV","created_at":"2026-07-04T17:29:37.343105+00:00"},{"alias_kind":"pith_short_16","alias_value":"RDEZDN7SS6JVU5A6","created_at":"2026-07-04T17:29:37.343105+00:00"},{"alias_kind":"pith_short_8","alias_value":"RDEZDN7S","created_at":"2026-07-04T17:29:37.343105+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/RDEZDN7SS6JVU5A6SPFAN3L3SF","json":"https://pith.science/pith/RDEZDN7SS6JVU5A6SPFAN3L3SF.json","graph_json":"https://pith.science/api/pith-number/RDEZDN7SS6JVU5A6SPFAN3L3SF/graph.json","events_json":"https://pith.science/api/pith-number/RDEZDN7SS6JVU5A6SPFAN3L3SF/events.json","paper":"https://pith.science/paper/RDEZDN7S"},"agent_actions":{"view_html":"https://pith.science/pith/RDEZDN7SS6JVU5A6SPFAN3L3SF","download_json":"https://pith.science/pith/RDEZDN7SS6JVU5A6SPFAN3L3SF.json","view_paper":"https://pith.science/paper/RDEZDN7S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0712.0813&json=true","fetch_graph":"https://pith.science/api/pith-number/RDEZDN7SS6JVU5A6SPFAN3L3SF/graph.json","fetch_events":"https://pith.science/api/pith-number/RDEZDN7SS6JVU5A6SPFAN3L3SF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RDEZDN7SS6JVU5A6SPFAN3L3SF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RDEZDN7SS6JVU5A6SPFAN3L3SF/action/storage_attestation","attest_author":"https://pith.science/pith/RDEZDN7SS6JVU5A6SPFAN3L3SF/action/author_attestation","sign_citation":"https://pith.science/pith/RDEZDN7SS6JVU5A6SPFAN3L3SF/action/citation_signature","submit_replication":"https://pith.science/pith/RDEZDN7SS6JVU5A6SPFAN3L3SF/action/replication_record"}},"created_at":"2026-07-04T17:29:37.343105+00:00","updated_at":"2026-07-04T17:29:37.343105+00:00"}