{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:4LWYPKVY43K4TEP3Q5VDLIAVLN","short_pith_number":"pith:4LWYPKVY","schema_version":"1.0","canonical_sha256":"e2ed87aab8e6d5c991fb876a35a0155b54c6d53eb6359655eeb11545ddefdaa6","source":{"kind":"arxiv","id":"1102.1523","version":1},"attestation_state":"computed","paper":{"title":"The NumPy array: a structure for efficient numerical computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MS","authors_text":"Ga\\\"el Varoquaux (Parietal), S. Chris Colbert, Stefan Van Der Walt","submitted_at":"2011-02-08T07:25:56Z","abstract_excerpt":"In the Python world, NumPy arrays are the standard representation for numerical data. Here, we show how these arrays enable efficient implementation of numerical computations in a high-level language. Overall, three techniques are applied to improve performance: vectorizing calculations, avoiding copying data in memory, and minimizing operation counts. We first present the NumPy array structure, then show how to use it for efficient computation, and finally how to share array data with other libraries."},"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":"1102.1523","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2011-02-08T07:25:56Z","cross_cats_sorted":[],"title_canon_sha256":"9bd5c7e47a81bbc88959cdfb5dd8abbdf411f2b41734b1fa4ff3874dde445a6d","abstract_canon_sha256":"1ae8708270c5016b950f94262af0e210baac9b0022e2876734199376162f9762"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:26:56.194159Z","signature_b64":"R3C0mw+FtIBbLNut/nnbEyGoaA+H84ReDaYZ89ftV38wEQ4X9to5ZwJ/533wCJbeJTdDjSzMcLi9901nzujIDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2ed87aab8e6d5c991fb876a35a0155b54c6d53eb6359655eeb11545ddefdaa6","last_reissued_at":"2026-05-18T04:26:56.193559Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:26:56.193559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The NumPy array: a structure for efficient numerical computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MS","authors_text":"Ga\\\"el Varoquaux (Parietal), S. Chris Colbert, Stefan Van Der Walt","submitted_at":"2011-02-08T07:25:56Z","abstract_excerpt":"In the Python world, NumPy arrays are the standard representation for numerical data. Here, we show how these arrays enable efficient implementation of numerical computations in a high-level language. Overall, three techniques are applied to improve performance: vectorizing calculations, avoiding copying data in memory, and minimizing operation counts. We first present the NumPy array structure, then show how to use it for efficient computation, and finally how to share array data with other libraries."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.1523","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":"1102.1523","created_at":"2026-05-18T04:26:56.193636+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.1523v1","created_at":"2026-05-18T04:26:56.193636+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1523","created_at":"2026-05-18T04:26:56.193636+00:00"},{"alias_kind":"pith_short_12","alias_value":"4LWYPKVY43K4","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"4LWYPKVY43K4TEP3","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"4LWYPKVY","created_at":"2026-05-18T12:26:20.644004+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2605.20509","citing_title":"The Causal Bootstrap: Bounding Smeared Spectral Functions from Non-Perturbative Euclidean Data","ref_index":68,"is_internal_anchor":true},{"citing_arxiv_id":"2603.09867","citing_title":"The emerging timescale of young star clusters regulated by cluster stellar mass","ref_index":70,"is_internal_anchor":true},{"citing_arxiv_id":"2604.05095","citing_title":"A generic $\\omega_b$ tension in early-time solutions to the Hubble tension","ref_index":57,"is_internal_anchor":false},{"citing_arxiv_id":"2007.05579","citing_title":"Inferring the properties of a population of compact binaries in presence of selection effects","ref_index":89,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4LWYPKVY43K4TEP3Q5VDLIAVLN","json":"https://pith.science/pith/4LWYPKVY43K4TEP3Q5VDLIAVLN.json","graph_json":"https://pith.science/api/pith-number/4LWYPKVY43K4TEP3Q5VDLIAVLN/graph.json","events_json":"https://pith.science/api/pith-number/4LWYPKVY43K4TEP3Q5VDLIAVLN/events.json","paper":"https://pith.science/paper/4LWYPKVY"},"agent_actions":{"view_html":"https://pith.science/pith/4LWYPKVY43K4TEP3Q5VDLIAVLN","download_json":"https://pith.science/pith/4LWYPKVY43K4TEP3Q5VDLIAVLN.json","view_paper":"https://pith.science/paper/4LWYPKVY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.1523&json=true","fetch_graph":"https://pith.science/api/pith-number/4LWYPKVY43K4TEP3Q5VDLIAVLN/graph.json","fetch_events":"https://pith.science/api/pith-number/4LWYPKVY43K4TEP3Q5VDLIAVLN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4LWYPKVY43K4TEP3Q5VDLIAVLN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4LWYPKVY43K4TEP3Q5VDLIAVLN/action/storage_attestation","attest_author":"https://pith.science/pith/4LWYPKVY43K4TEP3Q5VDLIAVLN/action/author_attestation","sign_citation":"https://pith.science/pith/4LWYPKVY43K4TEP3Q5VDLIAVLN/action/citation_signature","submit_replication":"https://pith.science/pith/4LWYPKVY43K4TEP3Q5VDLIAVLN/action/replication_record"}},"created_at":"2026-05-18T04:26:56.193636+00:00","updated_at":"2026-05-18T04:26:56.193636+00:00"}