{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:RPVPDBAHY2MQ4NE7PK7AE6O7UF","short_pith_number":"pith:RPVPDBAH","canonical_record":{"source":{"id":"1607.02229","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-07-08T05:31:26Z","cross_cats_sorted":[],"title_canon_sha256":"d18d0b84925b7d81ae7a8c7e23c89f389459fc09931e72c170b884ac058ba3e1","abstract_canon_sha256":"5614b156040dca960f1bb49bb91b255aed13ee54f9a6e36f94d490d4cec44ad7"},"schema_version":"1.0"},"canonical_sha256":"8beaf18407c6990e349f7abe0279dfa16f71fd5c14898c84f7a20ddfef78a7d2","source":{"kind":"arxiv","id":"1607.02229","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.02229","created_at":"2026-05-18T01:11:20Z"},{"alias_kind":"arxiv_version","alias_value":"1607.02229v1","created_at":"2026-05-18T01:11:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02229","created_at":"2026-05-18T01:11:20Z"},{"alias_kind":"pith_short_12","alias_value":"RPVPDBAHY2MQ","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RPVPDBAHY2MQ4NE7","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RPVPDBAH","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:RPVPDBAHY2MQ4NE7PK7AE6O7UF","target":"record","payload":{"canonical_record":{"source":{"id":"1607.02229","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-07-08T05:31:26Z","cross_cats_sorted":[],"title_canon_sha256":"d18d0b84925b7d81ae7a8c7e23c89f389459fc09931e72c170b884ac058ba3e1","abstract_canon_sha256":"5614b156040dca960f1bb49bb91b255aed13ee54f9a6e36f94d490d4cec44ad7"},"schema_version":"1.0"},"canonical_sha256":"8beaf18407c6990e349f7abe0279dfa16f71fd5c14898c84f7a20ddfef78a7d2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:20.957502Z","signature_b64":"6cg8kU0C7buZ5ykH8hcnNxzIECZb8nnCeS2MvfhI0Tc5skY1r508s2rHbOYWRajxBDUgRfZRSRMMYZZBVykDCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8beaf18407c6990e349f7abe0279dfa16f71fd5c14898c84f7a20ddfef78a7d2","last_reissued_at":"2026-05-18T01:11:20.957022Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:20.957022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.02229","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:11:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oUsp7BMBtcGRvV/znGpJ3zGcP13AOBQ2lk62b65cEtaoWov7F0nWqheB/ndrSN5QOnf0C4ko7VYX3b+5OwBZAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:25:22.509328Z"},"content_sha256":"d42ae5427e41170e22657dde374c737ac0c6234a5906e49fc5905eb10eb47e79","schema_version":"1.0","event_id":"sha256:d42ae5427e41170e22657dde374c737ac0c6234a5906e49fc5905eb10eb47e79"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:RPVPDBAHY2MQ4NE7PK7AE6O7UF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Program Transformation to Identify List-Based Parallel Skeletons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Dublin City University, G. W. Hamilton (School of Computing, Ireland), Venkatesh Kannan (School of Computing","submitted_at":"2016-07-08T05:31:26Z","abstract_excerpt":"Algorithmic skeletons are used as building-blocks to ease the task of parallel programming by abstracting the details of parallel implementation from the developer. Most existing libraries provide implementations of skeletons that are defined over flat data types such as lists or arrays. However, skeleton-based parallel programming is still very challenging as it requires intricate analysis of the underlying algorithm and often uses inefficient intermediate data structures. Further, the algorithmic structure of a given program may not match those of list-based skeletons. In this paper, we pres"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.02229","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:11:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"br+4zq8lPwvK97jVvlvittwlUzG9l592siKP0M14dDQsuV6lHZhevQpqOSQ0bm6lmjnqUChMGWb+xb5Uz06uAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:25:22.509925Z"},"content_sha256":"2536dd972eae98004f26d36c3d4a58984c16efe43553e10861ab68723b23ec9c","schema_version":"1.0","event_id":"sha256:2536dd972eae98004f26d36c3d4a58984c16efe43553e10861ab68723b23ec9c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RPVPDBAHY2MQ4NE7PK7AE6O7UF/bundle.json","state_url":"https://pith.science/pith/RPVPDBAHY2MQ4NE7PK7AE6O7UF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RPVPDBAHY2MQ4NE7PK7AE6O7UF/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-28T06:25:22Z","links":{"resolver":"https://pith.science/pith/RPVPDBAHY2MQ4NE7PK7AE6O7UF","bundle":"https://pith.science/pith/RPVPDBAHY2MQ4NE7PK7AE6O7UF/bundle.json","state":"https://pith.science/pith/RPVPDBAHY2MQ4NE7PK7AE6O7UF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RPVPDBAHY2MQ4NE7PK7AE6O7UF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:RPVPDBAHY2MQ4NE7PK7AE6O7UF","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":"5614b156040dca960f1bb49bb91b255aed13ee54f9a6e36f94d490d4cec44ad7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-07-08T05:31:26Z","title_canon_sha256":"d18d0b84925b7d81ae7a8c7e23c89f389459fc09931e72c170b884ac058ba3e1"},"schema_version":"1.0","source":{"id":"1607.02229","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.02229","created_at":"2026-05-18T01:11:20Z"},{"alias_kind":"arxiv_version","alias_value":"1607.02229v1","created_at":"2026-05-18T01:11:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02229","created_at":"2026-05-18T01:11:20Z"},{"alias_kind":"pith_short_12","alias_value":"RPVPDBAHY2MQ","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RPVPDBAHY2MQ4NE7","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RPVPDBAH","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:2536dd972eae98004f26d36c3d4a58984c16efe43553e10861ab68723b23ec9c","target":"graph","created_at":"2026-05-18T01:11:20Z","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":"Algorithmic skeletons are used as building-blocks to ease the task of parallel programming by abstracting the details of parallel implementation from the developer. Most existing libraries provide implementations of skeletons that are defined over flat data types such as lists or arrays. However, skeleton-based parallel programming is still very challenging as it requires intricate analysis of the underlying algorithm and often uses inefficient intermediate data structures. Further, the algorithmic structure of a given program may not match those of list-based skeletons. In this paper, we pres","authors_text":"Dublin City University, G. W. Hamilton (School of Computing, Ireland), Venkatesh Kannan (School of Computing","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-07-08T05:31:26Z","title":"Program Transformation to Identify List-Based Parallel Skeletons"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.02229","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:d42ae5427e41170e22657dde374c737ac0c6234a5906e49fc5905eb10eb47e79","target":"record","created_at":"2026-05-18T01:11:20Z","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":"5614b156040dca960f1bb49bb91b255aed13ee54f9a6e36f94d490d4cec44ad7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-07-08T05:31:26Z","title_canon_sha256":"d18d0b84925b7d81ae7a8c7e23c89f389459fc09931e72c170b884ac058ba3e1"},"schema_version":"1.0","source":{"id":"1607.02229","kind":"arxiv","version":1}},"canonical_sha256":"8beaf18407c6990e349f7abe0279dfa16f71fd5c14898c84f7a20ddfef78a7d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8beaf18407c6990e349f7abe0279dfa16f71fd5c14898c84f7a20ddfef78a7d2","first_computed_at":"2026-05-18T01:11:20.957022Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:20.957022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6cg8kU0C7buZ5ykH8hcnNxzIECZb8nnCeS2MvfhI0Tc5skY1r508s2rHbOYWRajxBDUgRfZRSRMMYZZBVykDCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:20.957502Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.02229","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d42ae5427e41170e22657dde374c737ac0c6234a5906e49fc5905eb10eb47e79","sha256:2536dd972eae98004f26d36c3d4a58984c16efe43553e10861ab68723b23ec9c"],"state_sha256":"2f67bb403afe294fa4ebf1f5ff23dd97d919865ca46081ba8076033ee9060ffb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fIFpNCB94ZGRtY6TVoxYAQ/1apHX2c6kfykCk2m6eBWmWahhzXR+R2A+SFjhoUVxk9r8n3iqoTMw47ueMBhHAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T06:25:22.512797Z","bundle_sha256":"2bd767440464022d9e1092b4eddcc9c7e4dc24195f4037632d70e89ab572a3e2"}}