{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:U2X6UXQRHGC67KOEGYWQVI47XD","short_pith_number":"pith:U2X6UXQR","schema_version":"1.0","canonical_sha256":"a6afea5e113985efa9c4362d0aa39fb8fb763f5634ae0c927efa6b6ae60c53a7","source":{"kind":"arxiv","id":"1010.2000","version":1},"attestation_state":"computed","paper":{"title":"A Critical Path Approach to Analyzing Parallelism of Algorithmic Variants. Application to Cholesky Inversion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Henricus Bouwmeester, Julien Langou","submitted_at":"2010-10-11T05:34:40Z","abstract_excerpt":"Algorithms come with multiple variants which are obtained by changing the mathematical approach from which the algorithm is derived. These variants offer a wide spectrum of performance when implemented on a multicore platform and we seek to understand these differences in performances from a theoretical point of view. To that aim, we derive and present the critical path lengths of each algorithmic variant for our application problem which enables us to determine a lower bound on the time to solution. This metric provides an intuitive grasp of the performance of a variant and we present numeric"},"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":"1010.2000","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-10-11T05:34:40Z","cross_cats_sorted":[],"title_canon_sha256":"a3bb40ad16573e62e9d5e507d09ad93769840751ef5df2e4123c25d6df56600b","abstract_canon_sha256":"1cf4b5876234550aadc51ea50d7fb4416945c8005b4035250be09e30354bfa28"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:29.902406Z","signature_b64":"PRLvzbx8LiHCc7KkqfWexWlI3eFbpc8Vb27218KxSkoXr2NaiTwMBBuvzlTn5an+Opq0Xu0ugR37vqLH8rLeCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6afea5e113985efa9c4362d0aa39fb8fb763f5634ae0c927efa6b6ae60c53a7","last_reissued_at":"2026-05-18T04:39:29.901895Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:29.901895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Critical Path Approach to Analyzing Parallelism of Algorithmic Variants. Application to Cholesky Inversion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Henricus Bouwmeester, Julien Langou","submitted_at":"2010-10-11T05:34:40Z","abstract_excerpt":"Algorithms come with multiple variants which are obtained by changing the mathematical approach from which the algorithm is derived. These variants offer a wide spectrum of performance when implemented on a multicore platform and we seek to understand these differences in performances from a theoretical point of view. To that aim, we derive and present the critical path lengths of each algorithmic variant for our application problem which enables us to determine a lower bound on the time to solution. This metric provides an intuitive grasp of the performance of a variant and we present numeric"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.2000","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":"1010.2000","created_at":"2026-05-18T04:39:29.901958+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.2000v1","created_at":"2026-05-18T04:39:29.901958+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.2000","created_at":"2026-05-18T04:39:29.901958+00:00"},{"alias_kind":"pith_short_12","alias_value":"U2X6UXQRHGC6","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"U2X6UXQRHGC67KOE","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"U2X6UXQR","created_at":"2026-05-18T12:26:15.391820+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/U2X6UXQRHGC67KOEGYWQVI47XD","json":"https://pith.science/pith/U2X6UXQRHGC67KOEGYWQVI47XD.json","graph_json":"https://pith.science/api/pith-number/U2X6UXQRHGC67KOEGYWQVI47XD/graph.json","events_json":"https://pith.science/api/pith-number/U2X6UXQRHGC67KOEGYWQVI47XD/events.json","paper":"https://pith.science/paper/U2X6UXQR"},"agent_actions":{"view_html":"https://pith.science/pith/U2X6UXQRHGC67KOEGYWQVI47XD","download_json":"https://pith.science/pith/U2X6UXQRHGC67KOEGYWQVI47XD.json","view_paper":"https://pith.science/paper/U2X6UXQR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.2000&json=true","fetch_graph":"https://pith.science/api/pith-number/U2X6UXQRHGC67KOEGYWQVI47XD/graph.json","fetch_events":"https://pith.science/api/pith-number/U2X6UXQRHGC67KOEGYWQVI47XD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U2X6UXQRHGC67KOEGYWQVI47XD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U2X6UXQRHGC67KOEGYWQVI47XD/action/storage_attestation","attest_author":"https://pith.science/pith/U2X6UXQRHGC67KOEGYWQVI47XD/action/author_attestation","sign_citation":"https://pith.science/pith/U2X6UXQRHGC67KOEGYWQVI47XD/action/citation_signature","submit_replication":"https://pith.science/pith/U2X6UXQRHGC67KOEGYWQVI47XD/action/replication_record"}},"created_at":"2026-05-18T04:39:29.901958+00:00","updated_at":"2026-05-18T04:39:29.901958+00:00"}