{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:4LWYPKVY43K4TEP3Q5VDLIAVLN","short_pith_number":"pith:4LWYPKVY","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"},"canonical_sha256":"e2ed87aab8e6d5c991fb876a35a0155b54c6d53eb6359655eeb11545ddefdaa6","source":{"kind":"arxiv","id":"1102.1523","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.1523","created_at":"2026-05-18T04:26:56Z"},{"alias_kind":"arxiv_version","alias_value":"1102.1523v1","created_at":"2026-05-18T04:26:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1523","created_at":"2026-05-18T04:26:56Z"},{"alias_kind":"pith_short_12","alias_value":"4LWYPKVY43K4","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4LWYPKVY43K4TEP3","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4LWYPKVY","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:4LWYPKVY43K4TEP3Q5VDLIAVLN","target":"record","payload":{"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"},"canonical_sha256":"e2ed87aab8e6d5c991fb876a35a0155b54c6d53eb6359655eeb11545ddefdaa6","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"},"source_kind":"arxiv","source_id":"1102.1523","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:26:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yX4K/Yu8dBKi6dsKEtFDsNnUqA4BouvXXmMbPFb13ge+z9RsktIRKgsSD14kZ2SXsUrT5Ou2DFvlNQqYw1MFDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:09:19.093902Z"},"content_sha256":"a373f6661976f14c864d77c718a1e69f9035ad76e6ab8f9c21045acd3a1381d7","schema_version":"1.0","event_id":"sha256:a373f6661976f14c864d77c718a1e69f9035ad76e6ab8f9c21045acd3a1381d7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:4LWYPKVY43K4TEP3Q5VDLIAVLN","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:26:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C6s1aSTFX5+i06ZepM+pZL3kxvJC8t+NxrdH9tA+HyTl/mC7n3ww2lsthWqObq+X6khPfIzRUhczCw4yX064DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:09:19.094635Z"},"content_sha256":"d58690420df87c665b3848d052053194f76862dcb1abc57f6a6dfa4910bc996a","schema_version":"1.0","event_id":"sha256:d58690420df87c665b3848d052053194f76862dcb1abc57f6a6dfa4910bc996a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4LWYPKVY43K4TEP3Q5VDLIAVLN/bundle.json","state_url":"https://pith.science/pith/4LWYPKVY43K4TEP3Q5VDLIAVLN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4LWYPKVY43K4TEP3Q5VDLIAVLN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T02:09:19Z","links":{"resolver":"https://pith.science/pith/4LWYPKVY43K4TEP3Q5VDLIAVLN","bundle":"https://pith.science/pith/4LWYPKVY43K4TEP3Q5VDLIAVLN/bundle.json","state":"https://pith.science/pith/4LWYPKVY43K4TEP3Q5VDLIAVLN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4LWYPKVY43K4TEP3Q5VDLIAVLN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:4LWYPKVY43K4TEP3Q5VDLIAVLN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1ae8708270c5016b950f94262af0e210baac9b0022e2876734199376162f9762","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2011-02-08T07:25:56Z","title_canon_sha256":"9bd5c7e47a81bbc88959cdfb5dd8abbdf411f2b41734b1fa4ff3874dde445a6d"},"schema_version":"1.0","source":{"id":"1102.1523","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.1523","created_at":"2026-05-18T04:26:56Z"},{"alias_kind":"arxiv_version","alias_value":"1102.1523v1","created_at":"2026-05-18T04:26:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1523","created_at":"2026-05-18T04:26:56Z"},{"alias_kind":"pith_short_12","alias_value":"4LWYPKVY43K4","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4LWYPKVY43K4TEP3","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4LWYPKVY","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:d58690420df87c665b3848d052053194f76862dcb1abc57f6a6dfa4910bc996a","target":"graph","created_at":"2026-05-18T04:26:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Ga\\\"el Varoquaux (Parietal), S. Chris Colbert, Stefan Van Der Walt","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2011-02-08T07:25:56Z","title":"The NumPy array: a structure for efficient numerical computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.1523","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a373f6661976f14c864d77c718a1e69f9035ad76e6ab8f9c21045acd3a1381d7","target":"record","created_at":"2026-05-18T04:26:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1ae8708270c5016b950f94262af0e210baac9b0022e2876734199376162f9762","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2011-02-08T07:25:56Z","title_canon_sha256":"9bd5c7e47a81bbc88959cdfb5dd8abbdf411f2b41734b1fa4ff3874dde445a6d"},"schema_version":"1.0","source":{"id":"1102.1523","kind":"arxiv","version":1}},"canonical_sha256":"e2ed87aab8e6d5c991fb876a35a0155b54c6d53eb6359655eeb11545ddefdaa6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e2ed87aab8e6d5c991fb876a35a0155b54c6d53eb6359655eeb11545ddefdaa6","first_computed_at":"2026-05-18T04:26:56.193559Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:26:56.193559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R3C0mw+FtIBbLNut/nnbEyGoaA+H84ReDaYZ89ftV38wEQ4X9to5ZwJ/533wCJbeJTdDjSzMcLi9901nzujIDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:26:56.194159Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.1523","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a373f6661976f14c864d77c718a1e69f9035ad76e6ab8f9c21045acd3a1381d7","sha256:d58690420df87c665b3848d052053194f76862dcb1abc57f6a6dfa4910bc996a"],"state_sha256":"eacc48d3c72de1cbb7ca2b58df9b943d622f2fb1d08ef40266ecb1e4da7f462c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pTzHsMY3sHQT9QO0LAav9alK0FfZfwHhQuwCQ8WgKTswEOOKiLTxy0Asg+DUEDqFCNlvZzJdDlpBa8WaFDtlDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T02:09:19.098801Z","bundle_sha256":"084d3f4cb1bddec4e6b36881e186d96b98a41636b921f8db1bd9abd80e43235f"}}