{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HKD6OFFXWGAL3C5RG6EJEFG4GO","short_pith_number":"pith:HKD6OFFX","schema_version":"1.0","canonical_sha256":"3a87e714b7b180bd8bb137889214dc339b5fa22c14226e2096a8a68debe0043b","source":{"kind":"arxiv","id":"1601.05871","version":1},"attestation_state":"computed","paper":{"title":"Task Parallel Incomplete Cholesky Factorization using 2D Partitioned-Block Layout","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MS","authors_text":"George Stelle, H. Carter Edwards, Kyungjoo Kim, Sivasankaran Rajamanickam, Stephen L. Olivier","submitted_at":"2016-01-22T03:19:45Z","abstract_excerpt":"We introduce a task-parallel algorithm for sparse incomplete Cholesky factorization that utilizes a 2D sparse partitioned-block layout of a matrix. Our factorization algorithm follows the idea of algorithms-by-blocks by using the block layout. The algorithm-by-blocks approach induces a task graph for the factorization. These tasks are inter-related to each other through their data dependences in the factorization algorithm. To process the tasks on various manycore architectures in a portable manner, we also present a portable tasking API that incorporates different tasking backends and device-"},"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":"1601.05871","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2016-01-22T03:19:45Z","cross_cats_sorted":[],"title_canon_sha256":"cf8412cd5eed02554d60e33eb9eda77a143263feb6fb64bd5e4c3863425dc018","abstract_canon_sha256":"61933cb178ae172f18ad34b3d30af82ff88c78a8c3479e81bd6b97cb43606afb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:05.275068Z","signature_b64":"T2MdOuOO4ZhzJYy2RLuTJDuls5uc4cXHIjWP198/NmNSuoPPgP9EDp3QO8y7I6/IVffj6bKR8oKak967QZC2Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a87e714b7b180bd8bb137889214dc339b5fa22c14226e2096a8a68debe0043b","last_reissued_at":"2026-05-18T01:22:05.274397Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:05.274397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Task Parallel Incomplete Cholesky Factorization using 2D Partitioned-Block Layout","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MS","authors_text":"George Stelle, H. Carter Edwards, Kyungjoo Kim, Sivasankaran Rajamanickam, Stephen L. Olivier","submitted_at":"2016-01-22T03:19:45Z","abstract_excerpt":"We introduce a task-parallel algorithm for sparse incomplete Cholesky factorization that utilizes a 2D sparse partitioned-block layout of a matrix. Our factorization algorithm follows the idea of algorithms-by-blocks by using the block layout. The algorithm-by-blocks approach induces a task graph for the factorization. These tasks are inter-related to each other through their data dependences in the factorization algorithm. To process the tasks on various manycore architectures in a portable manner, we also present a portable tasking API that incorporates different tasking backends and device-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05871","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":"1601.05871","created_at":"2026-05-18T01:22:05.274496+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.05871v1","created_at":"2026-05-18T01:22:05.274496+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05871","created_at":"2026-05-18T01:22:05.274496+00:00"},{"alias_kind":"pith_short_12","alias_value":"HKD6OFFXWGAL","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"HKD6OFFXWGAL3C5R","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"HKD6OFFX","created_at":"2026-05-18T12:30:19.053100+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/HKD6OFFXWGAL3C5RG6EJEFG4GO","json":"https://pith.science/pith/HKD6OFFXWGAL3C5RG6EJEFG4GO.json","graph_json":"https://pith.science/api/pith-number/HKD6OFFXWGAL3C5RG6EJEFG4GO/graph.json","events_json":"https://pith.science/api/pith-number/HKD6OFFXWGAL3C5RG6EJEFG4GO/events.json","paper":"https://pith.science/paper/HKD6OFFX"},"agent_actions":{"view_html":"https://pith.science/pith/HKD6OFFXWGAL3C5RG6EJEFG4GO","download_json":"https://pith.science/pith/HKD6OFFXWGAL3C5RG6EJEFG4GO.json","view_paper":"https://pith.science/paper/HKD6OFFX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.05871&json=true","fetch_graph":"https://pith.science/api/pith-number/HKD6OFFXWGAL3C5RG6EJEFG4GO/graph.json","fetch_events":"https://pith.science/api/pith-number/HKD6OFFXWGAL3C5RG6EJEFG4GO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HKD6OFFXWGAL3C5RG6EJEFG4GO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HKD6OFFXWGAL3C5RG6EJEFG4GO/action/storage_attestation","attest_author":"https://pith.science/pith/HKD6OFFXWGAL3C5RG6EJEFG4GO/action/author_attestation","sign_citation":"https://pith.science/pith/HKD6OFFXWGAL3C5RG6EJEFG4GO/action/citation_signature","submit_replication":"https://pith.science/pith/HKD6OFFXWGAL3C5RG6EJEFG4GO/action/replication_record"}},"created_at":"2026-05-18T01:22:05.274496+00:00","updated_at":"2026-05-18T01:22:05.274496+00:00"}