{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:BVMJNSV6VNBTCLM2SZNU2VPJMN","short_pith_number":"pith:BVMJNSV6","schema_version":"1.0","canonical_sha256":"0d5896cabeab43312d9a965b4d55e9637d5c38dc1a53174ebef555c2a5e4bd56","source":{"kind":"arxiv","id":"2111.04457","version":1},"attestation_state":"computed","paper":{"title":"General purpose lattice QCD code set Bridge++ 2.0 for high performance computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"hep-lat","authors_text":"Hidekatsu Nemura, Hideo Matsufuru, Issaku Kanamori, Kazuyuki Kanaya, Sinya Aoki, Tatsumi Aoyama, Yusuke Namekawa, Yusuke Taniguchi, Yutaro Akahoshi","submitted_at":"2021-11-08T13:03:57Z","abstract_excerpt":"Bridge++ is a general-purpose code set for a numerical simulation of lattice QCD aiming at a readable, extensible, and portable code while keeping practically high performance. The previous version of Bridge++ is implemented in double precision with a fixed data layout. To exploit the high arithmetic capability of new processor architecture, we extend the Bridge++ code so that optimized code is available as a new branch, i.e., an alternative to the original code. This paper explains our strategy of implementation and displays application examples to the following architectures and systems: 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":"2111.04457","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"hep-lat","submitted_at":"2021-11-08T13:03:57Z","cross_cats_sorted":[],"title_canon_sha256":"4f9ea06061cc38600b2d182cb5769bb70792804543445f15647d426987388183","abstract_canon_sha256":"020ec152f530dba8d59e177f076e06c0410880bb3cc36dcdfa795331d0c130ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:13:45.663095Z","signature_b64":"8Y16vTzZoFRrObXTsrRIyVUEJ34GxgqGyOQO6qHOstbkewKOq49MOghHjv2IW+1OGo7wBPvDfqfzvOC7ElA4Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d5896cabeab43312d9a965b4d55e9637d5c38dc1a53174ebef555c2a5e4bd56","last_reissued_at":"2026-07-05T04:13:45.662622Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:13:45.662622Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"General purpose lattice QCD code set Bridge++ 2.0 for high performance computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"hep-lat","authors_text":"Hidekatsu Nemura, Hideo Matsufuru, Issaku Kanamori, Kazuyuki Kanaya, Sinya Aoki, Tatsumi Aoyama, Yusuke Namekawa, Yusuke Taniguchi, Yutaro Akahoshi","submitted_at":"2021-11-08T13:03:57Z","abstract_excerpt":"Bridge++ is a general-purpose code set for a numerical simulation of lattice QCD aiming at a readable, extensible, and portable code while keeping practically high performance. The previous version of Bridge++ is implemented in double precision with a fixed data layout. To exploit the high arithmetic capability of new processor architecture, we extend the Bridge++ code so that optimized code is available as a new branch, i.e., an alternative to the original code. This paper explains our strategy of implementation and displays application examples to the following architectures and systems: Int"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.04457","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/2111.04457/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":"2111.04457","created_at":"2026-07-05T04:13:45.662679+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.04457v1","created_at":"2026-07-05T04:13:45.662679+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.04457","created_at":"2026-07-05T04:13:45.662679+00:00"},{"alias_kind":"pith_short_12","alias_value":"BVMJNSV6VNBT","created_at":"2026-07-05T04:13:45.662679+00:00"},{"alias_kind":"pith_short_16","alias_value":"BVMJNSV6VNBTCLM2","created_at":"2026-07-05T04:13:45.662679+00:00"},{"alias_kind":"pith_short_8","alias_value":"BVMJNSV6","created_at":"2026-07-05T04:13:45.662679+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.06574","citing_title":"Study of symmetries in finite temperature $N_f=2$ QCD with M\\\"obius Domain Wall Fermions","ref_index":31,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BVMJNSV6VNBTCLM2SZNU2VPJMN","json":"https://pith.science/pith/BVMJNSV6VNBTCLM2SZNU2VPJMN.json","graph_json":"https://pith.science/api/pith-number/BVMJNSV6VNBTCLM2SZNU2VPJMN/graph.json","events_json":"https://pith.science/api/pith-number/BVMJNSV6VNBTCLM2SZNU2VPJMN/events.json","paper":"https://pith.science/paper/BVMJNSV6"},"agent_actions":{"view_html":"https://pith.science/pith/BVMJNSV6VNBTCLM2SZNU2VPJMN","download_json":"https://pith.science/pith/BVMJNSV6VNBTCLM2SZNU2VPJMN.json","view_paper":"https://pith.science/paper/BVMJNSV6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.04457&json=true","fetch_graph":"https://pith.science/api/pith-number/BVMJNSV6VNBTCLM2SZNU2VPJMN/graph.json","fetch_events":"https://pith.science/api/pith-number/BVMJNSV6VNBTCLM2SZNU2VPJMN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BVMJNSV6VNBTCLM2SZNU2VPJMN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BVMJNSV6VNBTCLM2SZNU2VPJMN/action/storage_attestation","attest_author":"https://pith.science/pith/BVMJNSV6VNBTCLM2SZNU2VPJMN/action/author_attestation","sign_citation":"https://pith.science/pith/BVMJNSV6VNBTCLM2SZNU2VPJMN/action/citation_signature","submit_replication":"https://pith.science/pith/BVMJNSV6VNBTCLM2SZNU2VPJMN/action/replication_record"}},"created_at":"2026-07-05T04:13:45.662679+00:00","updated_at":"2026-07-05T04:13:45.662679+00:00"}