{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:NLOU677HM7DHPJFYYIQHNY6D5C","short_pith_number":"pith:NLOU677H","schema_version":"1.0","canonical_sha256":"6add4f7fe767c677a4b8c22076e3c3e88c8b885926a74b80eeabc5f027cf64d2","source":{"kind":"arxiv","id":"1411.1607","version":4},"attestation_state":"computed","paper":{"title":"Julia: A Fresh Approach to Numerical Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MS","authors_text":"Alan Edelman, Jeff Bezanson, Stefan Karpinski, Viral B. Shah","submitted_at":"2014-11-06T13:39:40Z","abstract_excerpt":"Bridging cultures that have often been distant, Julia combines expertise from the diverse fields of computer science and computational science to create a new approach to numerical computing. Julia is designed to be easy and fast. Julia questions notions generally held as \"laws of nature\" by practitioners of numerical computing:\n  1. High-level dynamic programs have to be slow.\n  2. One must prototype in one language and then rewrite in another language for speed or deployment, and\n  3. There are parts of a system for the programmer, and other parts best left untouched as they are built by the"},"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":"1411.1607","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2014-11-06T13:39:40Z","cross_cats_sorted":[],"title_canon_sha256":"248ed6dd1ef192ba1422c8ab43246e9dd88538f8b38663ebbb13aeda023c5c06","abstract_canon_sha256":"105e6753e3cc77de563476f773e20d27a68429eb42baaae1d2aabb2473f6a952"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:38.649196Z","signature_b64":"S/VQsW8v5qUcd/Y2oaIPSSS2k9ZRw1y71eGeFv1/ytUufBxFHRocGeaaM+dso6qLPs+llPlN0s61eQAc4royAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6add4f7fe767c677a4b8c22076e3c3e88c8b885926a74b80eeabc5f027cf64d2","last_reissued_at":"2026-05-18T01:36:38.648504Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:38.648504Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Julia: A Fresh Approach to Numerical Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MS","authors_text":"Alan Edelman, Jeff Bezanson, Stefan Karpinski, Viral B. Shah","submitted_at":"2014-11-06T13:39:40Z","abstract_excerpt":"Bridging cultures that have often been distant, Julia combines expertise from the diverse fields of computer science and computational science to create a new approach to numerical computing. Julia is designed to be easy and fast. Julia questions notions generally held as \"laws of nature\" by practitioners of numerical computing:\n  1. High-level dynamic programs have to be slow.\n  2. One must prototype in one language and then rewrite in another language for speed or deployment, and\n  3. There are parts of a system for the programmer, and other parts best left untouched as they are built by the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.1607","kind":"arxiv","version":4},"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":"1411.1607","created_at":"2026-05-18T01:36:38.648629+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.1607v4","created_at":"2026-05-18T01:36:38.648629+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1607","created_at":"2026-05-18T01:36:38.648629+00:00"},{"alias_kind":"pith_short_12","alias_value":"NLOU677HM7DH","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"NLOU677HM7DHPJFY","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"NLOU677H","created_at":"2026-05-18T12:28:41.024544+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":8,"internal_anchor_count":4,"sample":[{"citing_arxiv_id":"1906.11199","citing_title":"Deployable probabilistic programming","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"2509.13528","citing_title":"Evaluating the Limits of QAOA Parameter Transfer at High-Rounds on Sparse Ising Models With Geometrically Local Cubic Terms","ref_index":42,"is_internal_anchor":true},{"citing_arxiv_id":"2511.10584","citing_title":"Finite-size quantum key distribution rates from R\\'enyi entropies using conic optimization","ref_index":27,"is_internal_anchor":true},{"citing_arxiv_id":"2512.05210","citing_title":"A Framework for Quantum Simulations of Energy-Loss and Hadronization in Non-Abelian Gauge Theories: SU(2) Lattice Gauge Theory in 1+1D","ref_index":180,"is_internal_anchor":true},{"citing_arxiv_id":"2604.03700","citing_title":"Robust self-testing with CHSH mod 3","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2305.01582","citing_title":"Interpretable Machine Learning for Science with PySR and SymbolicRegression.jl","ref_index":98,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06249","citing_title":"Finite-size general security for differential phase shift keying via variable-length quantum key distribution","ref_index":48,"is_internal_anchor":false},{"citing_arxiv_id":"2605.02181","citing_title":"Beyond collective fluctuations: probing micro-image swarms in lensed quasars with intensity interferometry","ref_index":63,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NLOU677HM7DHPJFYYIQHNY6D5C","json":"https://pith.science/pith/NLOU677HM7DHPJFYYIQHNY6D5C.json","graph_json":"https://pith.science/api/pith-number/NLOU677HM7DHPJFYYIQHNY6D5C/graph.json","events_json":"https://pith.science/api/pith-number/NLOU677HM7DHPJFYYIQHNY6D5C/events.json","paper":"https://pith.science/paper/NLOU677H"},"agent_actions":{"view_html":"https://pith.science/pith/NLOU677HM7DHPJFYYIQHNY6D5C","download_json":"https://pith.science/pith/NLOU677HM7DHPJFYYIQHNY6D5C.json","view_paper":"https://pith.science/paper/NLOU677H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.1607&json=true","fetch_graph":"https://pith.science/api/pith-number/NLOU677HM7DHPJFYYIQHNY6D5C/graph.json","fetch_events":"https://pith.science/api/pith-number/NLOU677HM7DHPJFYYIQHNY6D5C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NLOU677HM7DHPJFYYIQHNY6D5C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NLOU677HM7DHPJFYYIQHNY6D5C/action/storage_attestation","attest_author":"https://pith.science/pith/NLOU677HM7DHPJFYYIQHNY6D5C/action/author_attestation","sign_citation":"https://pith.science/pith/NLOU677HM7DHPJFYYIQHNY6D5C/action/citation_signature","submit_replication":"https://pith.science/pith/NLOU677HM7DHPJFYYIQHNY6D5C/action/replication_record"}},"created_at":"2026-05-18T01:36:38.648629+00:00","updated_at":"2026-05-18T01:36:38.648629+00:00"}