{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:IO3ERYFSCEDQDDDRPENETHOBBE","short_pith_number":"pith:IO3ERYFS","canonical_record":{"source":{"id":"1402.0264","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-02-03T00:22:59Z","cross_cats_sorted":[],"title_canon_sha256":"ba6f85c4bd2a378f50eed5f044a7106a868256f2c21b7d2b6bb00cd35c299afd","abstract_canon_sha256":"33b599153a0e15631657ccd97d4e75f74a4a4e38208f5bb522859e8911dbacf3"},"schema_version":"1.0"},"canonical_sha256":"43b648e0b21107018c71791a499dc1092c9f229ef2c05494c4aaa190289bb9b7","source":{"kind":"arxiv","id":"1402.0264","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.0264","created_at":"2026-05-18T03:00:24Z"},{"alias_kind":"arxiv_version","alias_value":"1402.0264v1","created_at":"2026-05-18T03:00:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0264","created_at":"2026-05-18T03:00:24Z"},{"alias_kind":"pith_short_12","alias_value":"IO3ERYFSCEDQ","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IO3ERYFSCEDQDDDR","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IO3ERYFS","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:IO3ERYFSCEDQDDDRPENETHOBBE","target":"record","payload":{"canonical_record":{"source":{"id":"1402.0264","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-02-03T00:22:59Z","cross_cats_sorted":[],"title_canon_sha256":"ba6f85c4bd2a378f50eed5f044a7106a868256f2c21b7d2b6bb00cd35c299afd","abstract_canon_sha256":"33b599153a0e15631657ccd97d4e75f74a4a4e38208f5bb522859e8911dbacf3"},"schema_version":"1.0"},"canonical_sha256":"43b648e0b21107018c71791a499dc1092c9f229ef2c05494c4aaa190289bb9b7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:24.099195Z","signature_b64":"5mReP6ukfwbJklkvx2Dn/uF+9jQnfgy+nISpxAV3MjxknUv+kC90URIh7reOgXjrzIvdGj4FWDwDT7lJrSrbAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43b648e0b21107018c71791a499dc1092c9f229ef2c05494c4aaa190289bb9b7","last_reissued_at":"2026-05-18T03:00:24.098402Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:24.098402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.0264","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-18T03:00:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J418ekSMS8oAhq5iLxmx4UHyS7N3p53RsAxzIW2d5uaV+6mcZbrXZPAMwjRtiFzyS5+3tFB01FyoeHgwYoPDAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:34:02.940830Z"},"content_sha256":"15ff9a3cfd40ca74e3c1c2debbcc850632ef83e9a13eefaf0fc66de960a7eca7","schema_version":"1.0","event_id":"sha256:15ff9a3cfd40ca74e3c1c2debbcc850632ef83e9a13eefaf0fc66de960a7eca7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:IO3ERYFSCEDQDDDRPENETHOBBE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Many-core Machine Model for Designing Algorithms with Minimum Parallelism Overheads","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Marc Moreno Maza, Ning Xie, Sardar Anisul Haque","submitted_at":"2014-02-03T00:22:59Z","abstract_excerpt":"We present a model of multithreaded computation, combining fork-join and single-instruction-multiple-data parallelisms, with an emphasis on estimating parallelism overheads of programs written for modern many-core architectures. We establish a Graham-Brent theorem for this model so as to estimate execution time of programs running on a given number of streaming multiprocessors. We evaluate the benefits of our model with four fundamental algorithms from scientific computing. In each case, our model is used to minimize parallelism overheads by determining an appropriate value range for a given p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.0264","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-18T03:00:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nPrrrOml6foiUywS/SAPLx+0Q2smPKCO56GvmARYjJD0Iy6Ft/smRE0jMEJifugDGWNVUJHLXfBvf2hAACFTDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:34:02.941177Z"},"content_sha256":"618e0a10f5bf88c14340fc89574eca32a247396f17af0372bb0e6674f937b46a","schema_version":"1.0","event_id":"sha256:618e0a10f5bf88c14340fc89574eca32a247396f17af0372bb0e6674f937b46a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IO3ERYFSCEDQDDDRPENETHOBBE/bundle.json","state_url":"https://pith.science/pith/IO3ERYFSCEDQDDDRPENETHOBBE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IO3ERYFSCEDQDDDRPENETHOBBE/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-28T09:34:02Z","links":{"resolver":"https://pith.science/pith/IO3ERYFSCEDQDDDRPENETHOBBE","bundle":"https://pith.science/pith/IO3ERYFSCEDQDDDRPENETHOBBE/bundle.json","state":"https://pith.science/pith/IO3ERYFSCEDQDDDRPENETHOBBE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IO3ERYFSCEDQDDDRPENETHOBBE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:IO3ERYFSCEDQDDDRPENETHOBBE","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":"33b599153a0e15631657ccd97d4e75f74a4a4e38208f5bb522859e8911dbacf3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-02-03T00:22:59Z","title_canon_sha256":"ba6f85c4bd2a378f50eed5f044a7106a868256f2c21b7d2b6bb00cd35c299afd"},"schema_version":"1.0","source":{"id":"1402.0264","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.0264","created_at":"2026-05-18T03:00:24Z"},{"alias_kind":"arxiv_version","alias_value":"1402.0264v1","created_at":"2026-05-18T03:00:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0264","created_at":"2026-05-18T03:00:24Z"},{"alias_kind":"pith_short_12","alias_value":"IO3ERYFSCEDQ","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IO3ERYFSCEDQDDDR","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IO3ERYFS","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:618e0a10f5bf88c14340fc89574eca32a247396f17af0372bb0e6674f937b46a","target":"graph","created_at":"2026-05-18T03:00:24Z","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":"We present a model of multithreaded computation, combining fork-join and single-instruction-multiple-data parallelisms, with an emphasis on estimating parallelism overheads of programs written for modern many-core architectures. We establish a Graham-Brent theorem for this model so as to estimate execution time of programs running on a given number of streaming multiprocessors. We evaluate the benefits of our model with four fundamental algorithms from scientific computing. In each case, our model is used to minimize parallelism overheads by determining an appropriate value range for a given p","authors_text":"Marc Moreno Maza, Ning Xie, Sardar Anisul Haque","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-02-03T00:22:59Z","title":"A Many-core Machine Model for Designing Algorithms with Minimum Parallelism Overheads"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.0264","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:15ff9a3cfd40ca74e3c1c2debbcc850632ef83e9a13eefaf0fc66de960a7eca7","target":"record","created_at":"2026-05-18T03:00:24Z","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":"33b599153a0e15631657ccd97d4e75f74a4a4e38208f5bb522859e8911dbacf3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-02-03T00:22:59Z","title_canon_sha256":"ba6f85c4bd2a378f50eed5f044a7106a868256f2c21b7d2b6bb00cd35c299afd"},"schema_version":"1.0","source":{"id":"1402.0264","kind":"arxiv","version":1}},"canonical_sha256":"43b648e0b21107018c71791a499dc1092c9f229ef2c05494c4aaa190289bb9b7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"43b648e0b21107018c71791a499dc1092c9f229ef2c05494c4aaa190289bb9b7","first_computed_at":"2026-05-18T03:00:24.098402Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:00:24.098402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5mReP6ukfwbJklkvx2Dn/uF+9jQnfgy+nISpxAV3MjxknUv+kC90URIh7reOgXjrzIvdGj4FWDwDT7lJrSrbAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:00:24.099195Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.0264","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:15ff9a3cfd40ca74e3c1c2debbcc850632ef83e9a13eefaf0fc66de960a7eca7","sha256:618e0a10f5bf88c14340fc89574eca32a247396f17af0372bb0e6674f937b46a"],"state_sha256":"7d566a34120bceb81b387e1619ca7571ffbac69edb0758f1aef6baac0f21646a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I1HmJjurye3MmLj/V9BWCk4jiwhm2xxNZ4gBrdMDgn1DAxF//zuhpUKfA61xxp2jelcySwc97HquVZApKKXFDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T09:34:02.943160Z","bundle_sha256":"cd42b73cdd4024ae2b11653dec95671caa2f083f2cb7b0240950f975a5052e3e"}}