{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HKD6OFFXWGAL3C5RG6EJEFG4GO","short_pith_number":"pith:HKD6OFFX","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"},"canonical_sha256":"3a87e714b7b180bd8bb137889214dc339b5fa22c14226e2096a8a68debe0043b","source":{"kind":"arxiv","id":"1601.05871","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.05871","created_at":"2026-05-18T01:22:05Z"},{"alias_kind":"arxiv_version","alias_value":"1601.05871v1","created_at":"2026-05-18T01:22:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05871","created_at":"2026-05-18T01:22:05Z"},{"alias_kind":"pith_short_12","alias_value":"HKD6OFFXWGAL","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HKD6OFFXWGAL3C5R","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HKD6OFFX","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HKD6OFFXWGAL3C5RG6EJEFG4GO","target":"record","payload":{"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"},"canonical_sha256":"3a87e714b7b180bd8bb137889214dc339b5fa22c14226e2096a8a68debe0043b","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"},"source_kind":"arxiv","source_id":"1601.05871","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-18T01:22:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l0HkUejAvnWe3Nsmy+OTLM6xDA+Qfq+BwC+XzOZbf+0blsIJ9zmeEgKDYCpqJIVW30cSb7cjJfdNhxYJtTrJDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:51:25.419783Z"},"content_sha256":"b4d998d6e74ae7ab7f74f86aa1f39590a1f22eb188d4680e58c18a5b73574bd9","schema_version":"1.0","event_id":"sha256:b4d998d6e74ae7ab7f74f86aa1f39590a1f22eb188d4680e58c18a5b73574bd9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HKD6OFFXWGAL3C5RG6EJEFG4GO","target":"graph","payload":{"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"},"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-18T01:22:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AQneInFjj0ua2XXegTygrf/tW1juPed7LFXOi/x2N3bBC7j5Z2UTnzROUNsvkvCMwLIvVEpsuZVjE2eVS6j2Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:51:25.420420Z"},"content_sha256":"7d0267d9c8dacae73740101843f0250370a4014794f6ed6f6e48f4a8eefad87c","schema_version":"1.0","event_id":"sha256:7d0267d9c8dacae73740101843f0250370a4014794f6ed6f6e48f4a8eefad87c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HKD6OFFXWGAL3C5RG6EJEFG4GO/bundle.json","state_url":"https://pith.science/pith/HKD6OFFXWGAL3C5RG6EJEFG4GO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HKD6OFFXWGAL3C5RG6EJEFG4GO/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-02T20:51:25Z","links":{"resolver":"https://pith.science/pith/HKD6OFFXWGAL3C5RG6EJEFG4GO","bundle":"https://pith.science/pith/HKD6OFFXWGAL3C5RG6EJEFG4GO/bundle.json","state":"https://pith.science/pith/HKD6OFFXWGAL3C5RG6EJEFG4GO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HKD6OFFXWGAL3C5RG6EJEFG4GO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HKD6OFFXWGAL3C5RG6EJEFG4GO","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":"61933cb178ae172f18ad34b3d30af82ff88c78a8c3479e81bd6b97cb43606afb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2016-01-22T03:19:45Z","title_canon_sha256":"cf8412cd5eed02554d60e33eb9eda77a143263feb6fb64bd5e4c3863425dc018"},"schema_version":"1.0","source":{"id":"1601.05871","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.05871","created_at":"2026-05-18T01:22:05Z"},{"alias_kind":"arxiv_version","alias_value":"1601.05871v1","created_at":"2026-05-18T01:22:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05871","created_at":"2026-05-18T01:22:05Z"},{"alias_kind":"pith_short_12","alias_value":"HKD6OFFXWGAL","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HKD6OFFXWGAL3C5R","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HKD6OFFX","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:7d0267d9c8dacae73740101843f0250370a4014794f6ed6f6e48f4a8eefad87c","target":"graph","created_at":"2026-05-18T01:22:05Z","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":"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-","authors_text":"George Stelle, H. Carter Edwards, Kyungjoo Kim, Sivasankaran Rajamanickam, Stephen L. Olivier","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2016-01-22T03:19:45Z","title":"Task Parallel Incomplete Cholesky Factorization using 2D Partitioned-Block Layout"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05871","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:b4d998d6e74ae7ab7f74f86aa1f39590a1f22eb188d4680e58c18a5b73574bd9","target":"record","created_at":"2026-05-18T01:22:05Z","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":"61933cb178ae172f18ad34b3d30af82ff88c78a8c3479e81bd6b97cb43606afb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2016-01-22T03:19:45Z","title_canon_sha256":"cf8412cd5eed02554d60e33eb9eda77a143263feb6fb64bd5e4c3863425dc018"},"schema_version":"1.0","source":{"id":"1601.05871","kind":"arxiv","version":1}},"canonical_sha256":"3a87e714b7b180bd8bb137889214dc339b5fa22c14226e2096a8a68debe0043b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a87e714b7b180bd8bb137889214dc339b5fa22c14226e2096a8a68debe0043b","first_computed_at":"2026-05-18T01:22:05.274397Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:05.274397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T2MdOuOO4ZhzJYy2RLuTJDuls5uc4cXHIjWP198/NmNSuoPPgP9EDp3QO8y7I6/IVffj6bKR8oKak967QZC2Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:05.275068Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.05871","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b4d998d6e74ae7ab7f74f86aa1f39590a1f22eb188d4680e58c18a5b73574bd9","sha256:7d0267d9c8dacae73740101843f0250370a4014794f6ed6f6e48f4a8eefad87c"],"state_sha256":"85fa77836f1907cf510cd28494d0e0d83831ea1f6eda80aa69d6d0bac7fbceff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ccumzKcF/QBu0qAYJJbVaIVqgvpYmowKNLWFCXhzc/sKC20k/Z9J88Rd7SdLp2XoJWVbd8b4Ne/kYJrgGn+KDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T20:51:25.423849Z","bundle_sha256":"5654b638c7ab5e8fbc1f11e8db3926d4960718cd94ba34af2d808ac74e600a60"}}