{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:H37BMAFXKVYN3UDFEKA4MEH55I","short_pith_number":"pith:H37BMAFX","schema_version":"1.0","canonical_sha256":"3efe1600b75570ddd0652281c610fdea3e22bf074e9dcdb4c2deeb4ba650bc32","source":{"kind":"arxiv","id":"1510.05107","version":1},"attestation_state":"computed","paper":{"title":"A Makespan Lower Bound for the Scheduling of the Tiled Cholesky Factorization based on ALAP scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Julien Langou, Willy Quach","submitted_at":"2015-10-17T09:18:39Z","abstract_excerpt":"Due to the advent of multicore architectures and massive parallelism, the tiled Cholesky factorization algorithm has recently received plenty of attention and is often referenced by practitioners as a case study. It is also implemented in mainstream dense linear algebra libraries. However, we note that theoretical study of the parallelism of this algorithm is currently lacking. In this paper, we present new theoretical results about the tiled Cholesky factorization in the context of a parallel homogeneous model without communication costs. We use standard flop-based weights for the tasks. For "},"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":"1510.05107","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-10-17T09:18:39Z","cross_cats_sorted":[],"title_canon_sha256":"a70cae9e5b41b7b829cc82dd8f9579e70c933552a539442a220c7a4a0d9cff54","abstract_canon_sha256":"dffca548220f4314bcc9b46ac20db8af55fee5c35575f1e0dd73899d12fe5125"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:53.143682Z","signature_b64":"42wOZdBhqIyQX2PAmo9g89FAuZYYx5GXm7ZAQw60myMlvIz6tcqccGOnhUgRAkNmfMyobIRg3DNSRIOulrBcCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3efe1600b75570ddd0652281c610fdea3e22bf074e9dcdb4c2deeb4ba650bc32","last_reissued_at":"2026-05-18T01:29:53.143206Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:53.143206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Makespan Lower Bound for the Scheduling of the Tiled Cholesky Factorization based on ALAP scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Julien Langou, Willy Quach","submitted_at":"2015-10-17T09:18:39Z","abstract_excerpt":"Due to the advent of multicore architectures and massive parallelism, the tiled Cholesky factorization algorithm has recently received plenty of attention and is often referenced by practitioners as a case study. It is also implemented in mainstream dense linear algebra libraries. However, we note that theoretical study of the parallelism of this algorithm is currently lacking. In this paper, we present new theoretical results about the tiled Cholesky factorization in the context of a parallel homogeneous model without communication costs. We use standard flop-based weights for the tasks. For "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.05107","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":"1510.05107","created_at":"2026-05-18T01:29:53.143278+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.05107v1","created_at":"2026-05-18T01:29:53.143278+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.05107","created_at":"2026-05-18T01:29:53.143278+00:00"},{"alias_kind":"pith_short_12","alias_value":"H37BMAFXKVYN","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"H37BMAFXKVYN3UDF","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"H37BMAFX","created_at":"2026-05-18T12:29:22.688609+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/H37BMAFXKVYN3UDFEKA4MEH55I","json":"https://pith.science/pith/H37BMAFXKVYN3UDFEKA4MEH55I.json","graph_json":"https://pith.science/api/pith-number/H37BMAFXKVYN3UDFEKA4MEH55I/graph.json","events_json":"https://pith.science/api/pith-number/H37BMAFXKVYN3UDFEKA4MEH55I/events.json","paper":"https://pith.science/paper/H37BMAFX"},"agent_actions":{"view_html":"https://pith.science/pith/H37BMAFXKVYN3UDFEKA4MEH55I","download_json":"https://pith.science/pith/H37BMAFXKVYN3UDFEKA4MEH55I.json","view_paper":"https://pith.science/paper/H37BMAFX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.05107&json=true","fetch_graph":"https://pith.science/api/pith-number/H37BMAFXKVYN3UDFEKA4MEH55I/graph.json","fetch_events":"https://pith.science/api/pith-number/H37BMAFXKVYN3UDFEKA4MEH55I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H37BMAFXKVYN3UDFEKA4MEH55I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H37BMAFXKVYN3UDFEKA4MEH55I/action/storage_attestation","attest_author":"https://pith.science/pith/H37BMAFXKVYN3UDFEKA4MEH55I/action/author_attestation","sign_citation":"https://pith.science/pith/H37BMAFXKVYN3UDFEKA4MEH55I/action/citation_signature","submit_replication":"https://pith.science/pith/H37BMAFXKVYN3UDFEKA4MEH55I/action/replication_record"}},"created_at":"2026-05-18T01:29:53.143278+00:00","updated_at":"2026-05-18T01:29:53.143278+00:00"}