{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:E6755QUG3PCIZNOVKIKKON6BT7","short_pith_number":"pith:E6755QUG","canonical_record":{"source":{"id":"1608.07155","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-08-24T18:47:03Z","cross_cats_sorted":[],"title_canon_sha256":"fd1c312223b331d7b75760d8e5ab978807950b5c058fa2527d3fe702a31530f8","abstract_canon_sha256":"802b7dd854a8c554b87328eeee4a7ae6f6e0f565659f4acea3920f9d0e5a34ef"},"schema_version":"1.0"},"canonical_sha256":"27bfdec286dbc48cb5d55214a737c19fd89cc50243d454b95ebbe286fe5ad807","source":{"kind":"arxiv","id":"1608.07155","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.07155","created_at":"2026-05-18T01:07:54Z"},{"alias_kind":"arxiv_version","alias_value":"1608.07155v1","created_at":"2026-05-18T01:07:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.07155","created_at":"2026-05-18T01:07:54Z"},{"alias_kind":"pith_short_12","alias_value":"E6755QUG3PCI","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"E6755QUG3PCIZNOV","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"E6755QUG","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:E6755QUG3PCIZNOVKIKKON6BT7","target":"record","payload":{"canonical_record":{"source":{"id":"1608.07155","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-08-24T18:47:03Z","cross_cats_sorted":[],"title_canon_sha256":"fd1c312223b331d7b75760d8e5ab978807950b5c058fa2527d3fe702a31530f8","abstract_canon_sha256":"802b7dd854a8c554b87328eeee4a7ae6f6e0f565659f4acea3920f9d0e5a34ef"},"schema_version":"1.0"},"canonical_sha256":"27bfdec286dbc48cb5d55214a737c19fd89cc50243d454b95ebbe286fe5ad807","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:54.701669Z","signature_b64":"YleBbBGjjEScp5T2B1r627vaFnHILGhLj5qeNGJoMwifgvEyD4ZMtamncL0sxLRMDPcAmTmgveb+bHMHYAJjBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27bfdec286dbc48cb5d55214a737c19fd89cc50243d454b95ebbe286fe5ad807","last_reissued_at":"2026-05-18T01:07:54.701150Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:54.701150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.07155","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-18T01:07:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5yJhxA/l+iZw8bTAHJnAA7HA0WUptEc1HdjACtLq7qFqN17gAVV6xW8Pr9r8rpH5RxKJoEL+hBXGwSL1qdsqDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T11:58:23.719339Z"},"content_sha256":"44c4b6f57e59519f0fb307e5099f0ffa5c30ffd863e76348b72cf8ebd8703717","schema_version":"1.0","event_id":"sha256:44c4b6f57e59519f0fb307e5099f0ffa5c30ffd863e76348b72cf8ebd8703717"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:E6755QUG3PCIZNOVKIKKON6BT7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A new kind of parallelism and its programming in the Explicitly Many-Processor Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"J\\'anos V\\'egh","submitted_at":"2016-08-24T18:47:03Z","abstract_excerpt":"The processor accelerators are effective because they are working not (completely) on principles of stored program computers. They use some kind of parallelism, and it is rather hard to program them effectively: a parallel architecture by means of (and thinking in) sequential programming. The recently introduced EMPA architecture uses a new kind of parallelism, which offers the potential of reaching higher degree of parallelism, and also provides extra possibilities and challenges. It not only provides synchronization and inherent parallelization, but also takes over some duties typically offe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.07155","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-18T01:07:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ki79LVWHDihmQRd1LhDp0pWUfB1BCfX1FbXWXYWAUqMuO10cTpR9i1yVXFR2GEVaulAqAnktOpefoNkUUiqdDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T11:58:23.719690Z"},"content_sha256":"3f28b341d6e6920beaa8e345b2aac0ffd71bb53c3107061208a716cdb52872ff","schema_version":"1.0","event_id":"sha256:3f28b341d6e6920beaa8e345b2aac0ffd71bb53c3107061208a716cdb52872ff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E6755QUG3PCIZNOVKIKKON6BT7/bundle.json","state_url":"https://pith.science/pith/E6755QUG3PCIZNOVKIKKON6BT7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E6755QUG3PCIZNOVKIKKON6BT7/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-06T11:58:23Z","links":{"resolver":"https://pith.science/pith/E6755QUG3PCIZNOVKIKKON6BT7","bundle":"https://pith.science/pith/E6755QUG3PCIZNOVKIKKON6BT7/bundle.json","state":"https://pith.science/pith/E6755QUG3PCIZNOVKIKKON6BT7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E6755QUG3PCIZNOVKIKKON6BT7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:E6755QUG3PCIZNOVKIKKON6BT7","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":"802b7dd854a8c554b87328eeee4a7ae6f6e0f565659f4acea3920f9d0e5a34ef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-08-24T18:47:03Z","title_canon_sha256":"fd1c312223b331d7b75760d8e5ab978807950b5c058fa2527d3fe702a31530f8"},"schema_version":"1.0","source":{"id":"1608.07155","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.07155","created_at":"2026-05-18T01:07:54Z"},{"alias_kind":"arxiv_version","alias_value":"1608.07155v1","created_at":"2026-05-18T01:07:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.07155","created_at":"2026-05-18T01:07:54Z"},{"alias_kind":"pith_short_12","alias_value":"E6755QUG3PCI","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"E6755QUG3PCIZNOV","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"E6755QUG","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:3f28b341d6e6920beaa8e345b2aac0ffd71bb53c3107061208a716cdb52872ff","target":"graph","created_at":"2026-05-18T01:07:54Z","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":"The processor accelerators are effective because they are working not (completely) on principles of stored program computers. They use some kind of parallelism, and it is rather hard to program them effectively: a parallel architecture by means of (and thinking in) sequential programming. The recently introduced EMPA architecture uses a new kind of parallelism, which offers the potential of reaching higher degree of parallelism, and also provides extra possibilities and challenges. It not only provides synchronization and inherent parallelization, but also takes over some duties typically offe","authors_text":"J\\'anos V\\'egh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-08-24T18:47:03Z","title":"A new kind of parallelism and its programming in the Explicitly Many-Processor Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.07155","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:44c4b6f57e59519f0fb307e5099f0ffa5c30ffd863e76348b72cf8ebd8703717","target":"record","created_at":"2026-05-18T01:07:54Z","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":"802b7dd854a8c554b87328eeee4a7ae6f6e0f565659f4acea3920f9d0e5a34ef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-08-24T18:47:03Z","title_canon_sha256":"fd1c312223b331d7b75760d8e5ab978807950b5c058fa2527d3fe702a31530f8"},"schema_version":"1.0","source":{"id":"1608.07155","kind":"arxiv","version":1}},"canonical_sha256":"27bfdec286dbc48cb5d55214a737c19fd89cc50243d454b95ebbe286fe5ad807","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27bfdec286dbc48cb5d55214a737c19fd89cc50243d454b95ebbe286fe5ad807","first_computed_at":"2026-05-18T01:07:54.701150Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:07:54.701150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YleBbBGjjEScp5T2B1r627vaFnHILGhLj5qeNGJoMwifgvEyD4ZMtamncL0sxLRMDPcAmTmgveb+bHMHYAJjBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:07:54.701669Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.07155","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:44c4b6f57e59519f0fb307e5099f0ffa5c30ffd863e76348b72cf8ebd8703717","sha256:3f28b341d6e6920beaa8e345b2aac0ffd71bb53c3107061208a716cdb52872ff"],"state_sha256":"ea67fcd4e9d74aa2e4ebb86d04e5376aba4c7dc8f769639aa1d8cfa0de91f11a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3SQOe+seq4sa1nxro22TfnreWKGvn3YXCZvq+104rtJ4TmwDhwGxrUqV/4wHtXg6gCxR6xrE4EmOeN8RZlLJBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T11:58:23.721765Z","bundle_sha256":"a90db7aa00882ac6dd25b6b92937e009b09ce214225fdb64ce601dff703af79f"}}