{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:PRKMGC33E5QIZLETFUB2JY2C3Y","short_pith_number":"pith:PRKMGC33","schema_version":"1.0","canonical_sha256":"7c54c30b7b27608cac932d03a4e342de0ceef96ddbe39d6d9d623406ca85fe4f","source":{"kind":"arxiv","id":"1812.06160","version":3},"attestation_state":"computed","paper":{"title":"Javelin: A Scalable Implementation for Sparse Incomplete LU Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.MS","authors_text":"Gregory Bolet, Joshua Dennis Booth","submitted_at":"2018-12-13T15:20:41Z","abstract_excerpt":"In this work, we present a new scalable incomplete LU factorization framework called Javelin to be used as a preconditioner for solving sparse linear systems with iterative methods. Javelin allows for improved parallel factorization on shared-memory many-core systems by packaging the coefficient matrix into a format that allows for high performance sparse matrix-vector multiplication and sparse triangular solves with minimal overheads. The framework achieves these goals by using a collection of traditional permutations, point-to-point thread synchronizations, tasking, and segmented prefix scan"},"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":"1812.06160","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2018-12-13T15:20:41Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"80c2832d69075ccc922920e3ef985911510c27fa6c19d02e269255480a409c3c","abstract_canon_sha256":"b3bee302f0c84c25be34a797e0de46f944a03f91e15bf908591611a87f2246fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:08.496106Z","signature_b64":"ePahGDRQ71B/Cs3TvECHJ5NbLnHi/ggKjdRGQ0N1CEaZs/EV1LpnJ4KVYOGj1PUCpfCpfnr9CfRl5ydcFuo7Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c54c30b7b27608cac932d03a4e342de0ceef96ddbe39d6d9d623406ca85fe4f","last_reissued_at":"2026-05-17T23:47:08.495499Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:08.495499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Javelin: A Scalable Implementation for Sparse Incomplete LU Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.MS","authors_text":"Gregory Bolet, Joshua Dennis Booth","submitted_at":"2018-12-13T15:20:41Z","abstract_excerpt":"In this work, we present a new scalable incomplete LU factorization framework called Javelin to be used as a preconditioner for solving sparse linear systems with iterative methods. Javelin allows for improved parallel factorization on shared-memory many-core systems by packaging the coefficient matrix into a format that allows for high performance sparse matrix-vector multiplication and sparse triangular solves with minimal overheads. The framework achieves these goals by using a collection of traditional permutations, point-to-point thread synchronizations, tasking, and segmented prefix scan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.06160","kind":"arxiv","version":3},"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":"1812.06160","created_at":"2026-05-17T23:47:08.495591+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.06160v3","created_at":"2026-05-17T23:47:08.495591+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.06160","created_at":"2026-05-17T23:47:08.495591+00:00"},{"alias_kind":"pith_short_12","alias_value":"PRKMGC33E5QI","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"PRKMGC33E5QIZLET","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"PRKMGC33","created_at":"2026-05-18T12:32:46.962924+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/PRKMGC33E5QIZLETFUB2JY2C3Y","json":"https://pith.science/pith/PRKMGC33E5QIZLETFUB2JY2C3Y.json","graph_json":"https://pith.science/api/pith-number/PRKMGC33E5QIZLETFUB2JY2C3Y/graph.json","events_json":"https://pith.science/api/pith-number/PRKMGC33E5QIZLETFUB2JY2C3Y/events.json","paper":"https://pith.science/paper/PRKMGC33"},"agent_actions":{"view_html":"https://pith.science/pith/PRKMGC33E5QIZLETFUB2JY2C3Y","download_json":"https://pith.science/pith/PRKMGC33E5QIZLETFUB2JY2C3Y.json","view_paper":"https://pith.science/paper/PRKMGC33","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.06160&json=true","fetch_graph":"https://pith.science/api/pith-number/PRKMGC33E5QIZLETFUB2JY2C3Y/graph.json","fetch_events":"https://pith.science/api/pith-number/PRKMGC33E5QIZLETFUB2JY2C3Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PRKMGC33E5QIZLETFUB2JY2C3Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PRKMGC33E5QIZLETFUB2JY2C3Y/action/storage_attestation","attest_author":"https://pith.science/pith/PRKMGC33E5QIZLETFUB2JY2C3Y/action/author_attestation","sign_citation":"https://pith.science/pith/PRKMGC33E5QIZLETFUB2JY2C3Y/action/citation_signature","submit_replication":"https://pith.science/pith/PRKMGC33E5QIZLETFUB2JY2C3Y/action/replication_record"}},"created_at":"2026-05-17T23:47:08.495591+00:00","updated_at":"2026-05-17T23:47:08.495591+00:00"}