{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:KMZOQOIT26YLB6S2MCWDUWMYXF","short_pith_number":"pith:KMZOQOIT","canonical_record":{"source":{"id":"1201.3778","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2012-01-18T13:16:57Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"05b2ae07820882b100f173521872af28c8c4f76209d722b58b00a9d80433950b","abstract_canon_sha256":"cd80ed06783037e1c8b1672a2c422d48ab979adf9372d4061ec3185d4ced4df5"},"schema_version":"1.0"},"canonical_sha256":"5332e83913d7b0b0fa5a60ac3a5998b976fd4d9b66fb1f6e6d846ae15137a000","source":{"kind":"arxiv","id":"1201.3778","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.3778","created_at":"2026-05-18T03:52:28Z"},{"alias_kind":"arxiv_version","alias_value":"1201.3778v2","created_at":"2026-05-18T03:52:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.3778","created_at":"2026-05-18T03:52:28Z"},{"alias_kind":"pith_short_12","alias_value":"KMZOQOIT26YL","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KMZOQOIT26YLB6S2","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KMZOQOIT","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:KMZOQOIT26YLB6S2MCWDUWMYXF","target":"record","payload":{"canonical_record":{"source":{"id":"1201.3778","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2012-01-18T13:16:57Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"05b2ae07820882b100f173521872af28c8c4f76209d722b58b00a9d80433950b","abstract_canon_sha256":"cd80ed06783037e1c8b1672a2c422d48ab979adf9372d4061ec3185d4ced4df5"},"schema_version":"1.0"},"canonical_sha256":"5332e83913d7b0b0fa5a60ac3a5998b976fd4d9b66fb1f6e6d846ae15137a000","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:28.166706Z","signature_b64":"ncWnSBcAbuKnxHZM6NdGuZO63X5cQO6jUgNqfuGnZ9Xm/6Lm3KU/vIU5s5D5017Gfwjnm8YYkqZovdatjTCfBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5332e83913d7b0b0fa5a60ac3a5998b976fd4d9b66fb1f6e6d846ae15137a000","last_reissued_at":"2026-05-18T03:52:28.165562Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:28.165562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.3778","source_version":2,"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-18T03:52:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S+dBs71QykWhiXau+TeiZBbP4trW6nwyv7aE3HQFYjMMQvbYb75PgHHgaSrLCPpaoibTx7Zu55XDj6+ZKjD+BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T12:15:16.253881Z"},"content_sha256":"53da4765a18568e632a52549641cf246056cd77a32be329e0972341ad759db69","schema_version":"1.0","event_id":"sha256:53da4765a18568e632a52549641cf246056cd77a32be329e0972341ad759db69"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:KMZOQOIT26YLB6S2MCWDUWMYXF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Processor Allocation for Optimistic Parallelization of Irregular Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.PL","authors_text":"Francesco Versaci, Keshav Pingali","submitted_at":"2012-01-18T13:16:57Z","abstract_excerpt":"Optimistic parallelization is a promising approach for the parallelization of irregular algorithms: potentially interfering tasks are launched dynamically, and the runtime system detects conflicts between concurrent activities, aborting and rolling back conflicting tasks. However, parallelism in irregular algorithms is very complex. In a regular algorithm like dense matrix multiplication, the amount of parallelism can usually be expressed as a function of the problem size, so it is reasonably straightforward to determine how many processors should be allocated to execute a regular algorithm of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.3778","kind":"arxiv","version":2},"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-18T03:52:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xd9PJbUw+BfT1VGX9/EJ3Pdx+dJa2oJsZrnIzaSRrP9KgaqGHZwq9S2UTOoohOxlea49HSUhEhwethSJnVKTBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T12:15:16.254600Z"},"content_sha256":"762b38da141a286b07c4734cc64b1cadcea72e9f468540d094544f14c2ac9657","schema_version":"1.0","event_id":"sha256:762b38da141a286b07c4734cc64b1cadcea72e9f468540d094544f14c2ac9657"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KMZOQOIT26YLB6S2MCWDUWMYXF/bundle.json","state_url":"https://pith.science/pith/KMZOQOIT26YLB6S2MCWDUWMYXF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KMZOQOIT26YLB6S2MCWDUWMYXF/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-23T12:15:16Z","links":{"resolver":"https://pith.science/pith/KMZOQOIT26YLB6S2MCWDUWMYXF","bundle":"https://pith.science/pith/KMZOQOIT26YLB6S2MCWDUWMYXF/bundle.json","state":"https://pith.science/pith/KMZOQOIT26YLB6S2MCWDUWMYXF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KMZOQOIT26YLB6S2MCWDUWMYXF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:KMZOQOIT26YLB6S2MCWDUWMYXF","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":"cd80ed06783037e1c8b1672a2c422d48ab979adf9372d4061ec3185d4ced4df5","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2012-01-18T13:16:57Z","title_canon_sha256":"05b2ae07820882b100f173521872af28c8c4f76209d722b58b00a9d80433950b"},"schema_version":"1.0","source":{"id":"1201.3778","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.3778","created_at":"2026-05-18T03:52:28Z"},{"alias_kind":"arxiv_version","alias_value":"1201.3778v2","created_at":"2026-05-18T03:52:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.3778","created_at":"2026-05-18T03:52:28Z"},{"alias_kind":"pith_short_12","alias_value":"KMZOQOIT26YL","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KMZOQOIT26YLB6S2","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KMZOQOIT","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:762b38da141a286b07c4734cc64b1cadcea72e9f468540d094544f14c2ac9657","target":"graph","created_at":"2026-05-18T03:52:28Z","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":"Optimistic parallelization is a promising approach for the parallelization of irregular algorithms: potentially interfering tasks are launched dynamically, and the runtime system detects conflicts between concurrent activities, aborting and rolling back conflicting tasks. However, parallelism in irregular algorithms is very complex. In a regular algorithm like dense matrix multiplication, the amount of parallelism can usually be expressed as a function of the problem size, so it is reasonably straightforward to determine how many processors should be allocated to execute a regular algorithm of","authors_text":"Francesco Versaci, Keshav Pingali","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2012-01-18T13:16:57Z","title":"Processor Allocation for Optimistic Parallelization of Irregular Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.3778","kind":"arxiv","version":2},"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:53da4765a18568e632a52549641cf246056cd77a32be329e0972341ad759db69","target":"record","created_at":"2026-05-18T03:52:28Z","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":"cd80ed06783037e1c8b1672a2c422d48ab979adf9372d4061ec3185d4ced4df5","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2012-01-18T13:16:57Z","title_canon_sha256":"05b2ae07820882b100f173521872af28c8c4f76209d722b58b00a9d80433950b"},"schema_version":"1.0","source":{"id":"1201.3778","kind":"arxiv","version":2}},"canonical_sha256":"5332e83913d7b0b0fa5a60ac3a5998b976fd4d9b66fb1f6e6d846ae15137a000","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5332e83913d7b0b0fa5a60ac3a5998b976fd4d9b66fb1f6e6d846ae15137a000","first_computed_at":"2026-05-18T03:52:28.165562Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:52:28.165562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ncWnSBcAbuKnxHZM6NdGuZO63X5cQO6jUgNqfuGnZ9Xm/6Lm3KU/vIU5s5D5017Gfwjnm8YYkqZovdatjTCfBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:52:28.166706Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.3778","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53da4765a18568e632a52549641cf246056cd77a32be329e0972341ad759db69","sha256:762b38da141a286b07c4734cc64b1cadcea72e9f468540d094544f14c2ac9657"],"state_sha256":"70790e12d8659334970db09a332f4a4779942ff502cf2a4eda6fa5958d9e8381"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0HS7iwb3Gn4v0O8aDhF94XQjPMNsmvrdUs7Zv5JtyCHkONCBtl+m6SRtNYUu1P1M/n3FbKEoxufrJa6IVgsxAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T12:15:16.258462Z","bundle_sha256":"5766b45a8e53e63a6fe99eab82a444cbb41a81d64f0f415a700415b6b6ec1104"}}