{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:7XMJEYAHRXUZDET2YSSVHTLRV4","short_pith_number":"pith:7XMJEYAH","schema_version":"1.0","canonical_sha256":"fdd89260078de991927ac4a553cd71af1399f645d6edc0feb9e5ba9947028961","source":{"kind":"arxiv","id":"1209.1003","version":5},"attestation_state":"computed","paper":{"title":"A C++11 implementation of arbitrary-rank tensors for high-performance computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MS","authors_text":"Alejandro M. Arag\\'on","submitted_at":"2012-09-05T14:58:51Z","abstract_excerpt":"This article discusses an efficient implementation of tensors of arbitrary rank by using some of the idioms introduced by the recently published C++ ISO Standard (C++11). With the aims at providing a basic building block for high-performance computing, a single Array class template is carefully crafted, from which vectors, matrices, and even higher-order tensors can be created. An expression template facility is also built around the array class template to provide convenient mathematical syntax. As a result, by using templates, an extra high-level layer is added to the C++ language when deali"},"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":"1209.1003","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2012-09-05T14:58:51Z","cross_cats_sorted":[],"title_canon_sha256":"c55dd7a053c76f662d08cbca0c9f4a0baa064ba303720ebc4684845cf8f785be","abstract_canon_sha256":"3a3522d8db2c276bd1559f1017446ce8f4f0d4e1bf5b6b8de060b05117975124"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:50.668297Z","signature_b64":"Tj2Dbg5kX3qhWBtl9ewV/HvsXNurLSBRXXAT+/jmeZB2gqKvZo+/mlyBdG/PiOsr0hIokD/6lxU3prmRWmTWAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fdd89260078de991927ac4a553cd71af1399f645d6edc0feb9e5ba9947028961","last_reissued_at":"2026-05-18T02:50:50.667836Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:50.667836Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A C++11 implementation of arbitrary-rank tensors for high-performance computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MS","authors_text":"Alejandro M. Arag\\'on","submitted_at":"2012-09-05T14:58:51Z","abstract_excerpt":"This article discusses an efficient implementation of tensors of arbitrary rank by using some of the idioms introduced by the recently published C++ ISO Standard (C++11). With the aims at providing a basic building block for high-performance computing, a single Array class template is carefully crafted, from which vectors, matrices, and even higher-order tensors can be created. An expression template facility is also built around the array class template to provide convenient mathematical syntax. As a result, by using templates, an extra high-level layer is added to the C++ language when deali"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.1003","kind":"arxiv","version":5},"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":"1209.1003","created_at":"2026-05-18T02:50:50.667903+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.1003v5","created_at":"2026-05-18T02:50:50.667903+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.1003","created_at":"2026-05-18T02:50:50.667903+00:00"},{"alias_kind":"pith_short_12","alias_value":"7XMJEYAHRXUZ","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"7XMJEYAHRXUZDET2","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"7XMJEYAH","created_at":"2026-05-18T12:26:58.693483+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/7XMJEYAHRXUZDET2YSSVHTLRV4","json":"https://pith.science/pith/7XMJEYAHRXUZDET2YSSVHTLRV4.json","graph_json":"https://pith.science/api/pith-number/7XMJEYAHRXUZDET2YSSVHTLRV4/graph.json","events_json":"https://pith.science/api/pith-number/7XMJEYAHRXUZDET2YSSVHTLRV4/events.json","paper":"https://pith.science/paper/7XMJEYAH"},"agent_actions":{"view_html":"https://pith.science/pith/7XMJEYAHRXUZDET2YSSVHTLRV4","download_json":"https://pith.science/pith/7XMJEYAHRXUZDET2YSSVHTLRV4.json","view_paper":"https://pith.science/paper/7XMJEYAH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.1003&json=true","fetch_graph":"https://pith.science/api/pith-number/7XMJEYAHRXUZDET2YSSVHTLRV4/graph.json","fetch_events":"https://pith.science/api/pith-number/7XMJEYAHRXUZDET2YSSVHTLRV4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7XMJEYAHRXUZDET2YSSVHTLRV4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7XMJEYAHRXUZDET2YSSVHTLRV4/action/storage_attestation","attest_author":"https://pith.science/pith/7XMJEYAHRXUZDET2YSSVHTLRV4/action/author_attestation","sign_citation":"https://pith.science/pith/7XMJEYAHRXUZDET2YSSVHTLRV4/action/citation_signature","submit_replication":"https://pith.science/pith/7XMJEYAHRXUZDET2YSSVHTLRV4/action/replication_record"}},"created_at":"2026-05-18T02:50:50.667903+00:00","updated_at":"2026-05-18T02:50:50.667903+00:00"}