{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:HN67UAYVXQ6M7DQRRX2NMXT5SI","short_pith_number":"pith:HN67UAYV","canonical_record":{"source":{"id":"1109.1420","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2011-09-07T11:19:55Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"3ab4c9d3dc250183031d5bf8980bb8d20da82401f0cea431776dcb23fe14f4e5","abstract_canon_sha256":"9dc5138177a696c8bf3c158bfd5b8a4811bc17af6a373f4f3dafc836f23a5d1a"},"schema_version":"1.0"},"canonical_sha256":"3b7dfa0315bc3ccf8e118df4d65e7d9234532e86d66bd41137f36e56de5fca41","source":{"kind":"arxiv","id":"1109.1420","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.1420","created_at":"2026-05-18T04:13:55Z"},{"alias_kind":"arxiv_version","alias_value":"1109.1420v1","created_at":"2026-05-18T04:13:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.1420","created_at":"2026-05-18T04:13:55Z"},{"alias_kind":"pith_short_12","alias_value":"HN67UAYVXQ6M","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HN67UAYVXQ6M7DQR","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HN67UAYV","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:HN67UAYVXQ6M7DQRRX2NMXT5SI","target":"record","payload":{"canonical_record":{"source":{"id":"1109.1420","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2011-09-07T11:19:55Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"3ab4c9d3dc250183031d5bf8980bb8d20da82401f0cea431776dcb23fe14f4e5","abstract_canon_sha256":"9dc5138177a696c8bf3c158bfd5b8a4811bc17af6a373f4f3dafc836f23a5d1a"},"schema_version":"1.0"},"canonical_sha256":"3b7dfa0315bc3ccf8e118df4d65e7d9234532e86d66bd41137f36e56de5fca41","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:13:55.749408Z","signature_b64":"ZNtaYt6Vr/ahju2j+HRqqf0O8s1ZcLhbWmr7lYfK49G1ROIR2RBTUok5Set7NdqgP50ub/07Xr4V2pvsZcEOCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b7dfa0315bc3ccf8e118df4d65e7d9234532e86d66bd41137f36e56de5fca41","last_reissued_at":"2026-05-18T04:13:55.748922Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:13:55.748922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.1420","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:13:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WKBjlysJii7nLACXdVUlb8Ip/rnnls7O221gC39ne5c+IqN0nQafYpCqgWxZbbHe1k4OMAIvbsI+iUcFtzCABA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:26:57.102145Z"},"content_sha256":"51a8a4ff8839425053479c9b876d41fef1c3a604602c499dd4c4e0423e831711","schema_version":"1.0","event_id":"sha256:51a8a4ff8839425053479c9b876d41fef1c3a604602c499dd4c4e0423e831711"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:HN67UAYVXQ6M7DQRRX2NMXT5SI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Estimating the overlap between dependent computations for automatic parallelization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.PL","authors_text":"Paul Bone, Peter Schachte, Zoltan Somogyi","submitted_at":"2011-09-07T11:19:55Z","abstract_excerpt":"Researchers working on the automatic parallelization of programs have long known that too much parallelism can be even worse for performance than too little, because spawning a task to be run on another CPU incurs overheads. Autoparallelizing compilers have therefore long tried to use granularity analysis to ensure that they only spawn off computations whose cost will probably exceed the spawn-off cost by a comfortable margin. However, this is not enough to yield good results, because data dependencies may \\emph{also} limit the usefulness of running computations in parallel. If one computation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.1420","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:13:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rjXivtIrLfq55lFtuncCIykW0zMEhrkxUF6F8FYk+zw+fVk+WWcB3Ek7i3/IxUsg8pQ4m4hW5stAVdPq99NVBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:26:57.102522Z"},"content_sha256":"aa9881955428fad62bd95e5dd8a8573c356eae73667ea148c2dccf1734507cc8","schema_version":"1.0","event_id":"sha256:aa9881955428fad62bd95e5dd8a8573c356eae73667ea148c2dccf1734507cc8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HN67UAYVXQ6M7DQRRX2NMXT5SI/bundle.json","state_url":"https://pith.science/pith/HN67UAYVXQ6M7DQRRX2NMXT5SI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HN67UAYVXQ6M7DQRRX2NMXT5SI/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-04T05:26:57Z","links":{"resolver":"https://pith.science/pith/HN67UAYVXQ6M7DQRRX2NMXT5SI","bundle":"https://pith.science/pith/HN67UAYVXQ6M7DQRRX2NMXT5SI/bundle.json","state":"https://pith.science/pith/HN67UAYVXQ6M7DQRRX2NMXT5SI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HN67UAYVXQ6M7DQRRX2NMXT5SI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:HN67UAYVXQ6M7DQRRX2NMXT5SI","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":"9dc5138177a696c8bf3c158bfd5b8a4811bc17af6a373f4f3dafc836f23a5d1a","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2011-09-07T11:19:55Z","title_canon_sha256":"3ab4c9d3dc250183031d5bf8980bb8d20da82401f0cea431776dcb23fe14f4e5"},"schema_version":"1.0","source":{"id":"1109.1420","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.1420","created_at":"2026-05-18T04:13:55Z"},{"alias_kind":"arxiv_version","alias_value":"1109.1420v1","created_at":"2026-05-18T04:13:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.1420","created_at":"2026-05-18T04:13:55Z"},{"alias_kind":"pith_short_12","alias_value":"HN67UAYVXQ6M","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HN67UAYVXQ6M7DQR","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HN67UAYV","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:aa9881955428fad62bd95e5dd8a8573c356eae73667ea148c2dccf1734507cc8","target":"graph","created_at":"2026-05-18T04:13:55Z","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":"Researchers working on the automatic parallelization of programs have long known that too much parallelism can be even worse for performance than too little, because spawning a task to be run on another CPU incurs overheads. Autoparallelizing compilers have therefore long tried to use granularity analysis to ensure that they only spawn off computations whose cost will probably exceed the spawn-off cost by a comfortable margin. However, this is not enough to yield good results, because data dependencies may \\emph{also} limit the usefulness of running computations in parallel. If one computation","authors_text":"Paul Bone, Peter Schachte, Zoltan Somogyi","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2011-09-07T11:19:55Z","title":"Estimating the overlap between dependent computations for automatic parallelization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.1420","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:51a8a4ff8839425053479c9b876d41fef1c3a604602c499dd4c4e0423e831711","target":"record","created_at":"2026-05-18T04:13:55Z","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":"9dc5138177a696c8bf3c158bfd5b8a4811bc17af6a373f4f3dafc836f23a5d1a","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2011-09-07T11:19:55Z","title_canon_sha256":"3ab4c9d3dc250183031d5bf8980bb8d20da82401f0cea431776dcb23fe14f4e5"},"schema_version":"1.0","source":{"id":"1109.1420","kind":"arxiv","version":1}},"canonical_sha256":"3b7dfa0315bc3ccf8e118df4d65e7d9234532e86d66bd41137f36e56de5fca41","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b7dfa0315bc3ccf8e118df4d65e7d9234532e86d66bd41137f36e56de5fca41","first_computed_at":"2026-05-18T04:13:55.748922Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:13:55.748922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZNtaYt6Vr/ahju2j+HRqqf0O8s1ZcLhbWmr7lYfK49G1ROIR2RBTUok5Set7NdqgP50ub/07Xr4V2pvsZcEOCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:13:55.749408Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.1420","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51a8a4ff8839425053479c9b876d41fef1c3a604602c499dd4c4e0423e831711","sha256:aa9881955428fad62bd95e5dd8a8573c356eae73667ea148c2dccf1734507cc8"],"state_sha256":"68bf183d45df4abb8c08fac2dfecef8009281b974cd47077f056662e2e5e6baf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H9g3kA8kBRw/JSEVY3K3II/SO3mkPBRvLGlKkRlUU8kIs9HWCtNYybaM3NIVwgqNiygakdmkyuh+OwmrNIFIDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T05:26:57.104877Z","bundle_sha256":"be3a5968b3390677e619a313a902b45c857b5c3ec7e2d22d2b676f8121d966f7"}}