{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:U2X6UXQRHGC67KOEGYWQVI47XD","short_pith_number":"pith:U2X6UXQR","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"},"canonical_sha256":"a6afea5e113985efa9c4362d0aa39fb8fb763f5634ae0c927efa6b6ae60c53a7","source":{"kind":"arxiv","id":"1010.2000","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.2000","created_at":"2026-05-18T04:39:29Z"},{"alias_kind":"arxiv_version","alias_value":"1010.2000v1","created_at":"2026-05-18T04:39:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.2000","created_at":"2026-05-18T04:39:29Z"},{"alias_kind":"pith_short_12","alias_value":"U2X6UXQRHGC6","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"U2X6UXQRHGC67KOE","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"U2X6UXQR","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:U2X6UXQRHGC67KOEGYWQVI47XD","target":"record","payload":{"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"},"canonical_sha256":"a6afea5e113985efa9c4362d0aa39fb8fb763f5634ae0c927efa6b6ae60c53a7","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"},"source_kind":"arxiv","source_id":"1010.2000","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-18T04:39:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6clxmXr6JJmZIv31NX27SJiog3p0zba6/NWIPDUTX9bAygIUQv/apfQZe0DiNIq6iedNwrOLO42SdQOxFGIvAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:40:33.511549Z"},"content_sha256":"a9b72595cb0ad4e65d85427fe0f3072e97a30b259d0925cd338e44e983dd2a3e","schema_version":"1.0","event_id":"sha256:a9b72595cb0ad4e65d85427fe0f3072e97a30b259d0925cd338e44e983dd2a3e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:U2X6UXQRHGC67KOEGYWQVI47XD","target":"graph","payload":{"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"},"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-18T04:39:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7y4apvaRDwYq2fAs2/SViEAZ9WBNrnoysvyjTUuJ0bNo4h4QRxzjm/t8kILEJgeUsD41yoWiIbmq4hZukxAdBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:40:33.512171Z"},"content_sha256":"f9ac16fc7e97801f8d1e900f446b014747a09e52b0335d50f3bdb988deb048d7","schema_version":"1.0","event_id":"sha256:f9ac16fc7e97801f8d1e900f446b014747a09e52b0335d50f3bdb988deb048d7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U2X6UXQRHGC67KOEGYWQVI47XD/bundle.json","state_url":"https://pith.science/pith/U2X6UXQRHGC67KOEGYWQVI47XD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U2X6UXQRHGC67KOEGYWQVI47XD/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-05-26T10:40:33Z","links":{"resolver":"https://pith.science/pith/U2X6UXQRHGC67KOEGYWQVI47XD","bundle":"https://pith.science/pith/U2X6UXQRHGC67KOEGYWQVI47XD/bundle.json","state":"https://pith.science/pith/U2X6UXQRHGC67KOEGYWQVI47XD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U2X6UXQRHGC67KOEGYWQVI47XD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:U2X6UXQRHGC67KOEGYWQVI47XD","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":"1cf4b5876234550aadc51ea50d7fb4416945c8005b4035250be09e30354bfa28","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-10-11T05:34:40Z","title_canon_sha256":"a3bb40ad16573e62e9d5e507d09ad93769840751ef5df2e4123c25d6df56600b"},"schema_version":"1.0","source":{"id":"1010.2000","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.2000","created_at":"2026-05-18T04:39:29Z"},{"alias_kind":"arxiv_version","alias_value":"1010.2000v1","created_at":"2026-05-18T04:39:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.2000","created_at":"2026-05-18T04:39:29Z"},{"alias_kind":"pith_short_12","alias_value":"U2X6UXQRHGC6","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"U2X6UXQRHGC67KOE","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"U2X6UXQR","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:f9ac16fc7e97801f8d1e900f446b014747a09e52b0335d50f3bdb988deb048d7","target":"graph","created_at":"2026-05-18T04:39:29Z","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":"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","authors_text":"Henricus Bouwmeester, Julien Langou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-10-11T05:34:40Z","title":"A Critical Path Approach to Analyzing Parallelism of Algorithmic Variants. Application to Cholesky Inversion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.2000","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:a9b72595cb0ad4e65d85427fe0f3072e97a30b259d0925cd338e44e983dd2a3e","target":"record","created_at":"2026-05-18T04:39:29Z","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":"1cf4b5876234550aadc51ea50d7fb4416945c8005b4035250be09e30354bfa28","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-10-11T05:34:40Z","title_canon_sha256":"a3bb40ad16573e62e9d5e507d09ad93769840751ef5df2e4123c25d6df56600b"},"schema_version":"1.0","source":{"id":"1010.2000","kind":"arxiv","version":1}},"canonical_sha256":"a6afea5e113985efa9c4362d0aa39fb8fb763f5634ae0c927efa6b6ae60c53a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a6afea5e113985efa9c4362d0aa39fb8fb763f5634ae0c927efa6b6ae60c53a7","first_computed_at":"2026-05-18T04:39:29.901895Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:39:29.901895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PRLvzbx8LiHCc7KkqfWexWlI3eFbpc8Vb27218KxSkoXr2NaiTwMBBuvzlTn5an+Opq0Xu0ugR37vqLH8rLeCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:39:29.902406Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.2000","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a9b72595cb0ad4e65d85427fe0f3072e97a30b259d0925cd338e44e983dd2a3e","sha256:f9ac16fc7e97801f8d1e900f446b014747a09e52b0335d50f3bdb988deb048d7"],"state_sha256":"c072ee497f3231b6279a4171e85612c7b3484da97de244d8b94aaee483a7e3a9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X5LPcNs3aYlW40ndQ2yRdaQ3izszGsOcbChrwoX6medUTCdKwN9ay8UnTFkfdVD3qVBl95QaoK4fXpmtMNpXCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T10:40:33.515896Z","bundle_sha256":"bcee07dbfcb5d4eb67abd77d47b1e7565070e1e66a1addc1db8fcfe96967ed9c"}}