{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HWEXSD25X3GTVSIQA546VI7FI4","short_pith_number":"pith:HWEXSD25","canonical_record":{"source":{"id":"1509.00040","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2015-08-27T12:23:57Z","cross_cats_sorted":["cs.CE","cs.DC","cs.PL"],"title_canon_sha256":"20c12b73934683f0d0227ae3d36fb15f51c33fd22e55e077a54ddc73f9655a66","abstract_canon_sha256":"5eb55bdcd3182397e26e09ec47077887f010ccc76fa468e39bab0e0feb0bfad7"},"schema_version":"1.0"},"canonical_sha256":"3d89790f5dbecd3ac9100779eaa3e54715ff7d7dacb6520800cd54c821d8c6b7","source":{"kind":"arxiv","id":"1509.00040","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.00040","created_at":"2026-05-18T01:34:30Z"},{"alias_kind":"arxiv_version","alias_value":"1509.00040v1","created_at":"2026-05-18T01:34:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00040","created_at":"2026-05-18T01:34:30Z"},{"alias_kind":"pith_short_12","alias_value":"HWEXSD25X3GT","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HWEXSD25X3GTVSIQ","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HWEXSD25","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HWEXSD25X3GTVSIQA546VI7FI4","target":"record","payload":{"canonical_record":{"source":{"id":"1509.00040","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2015-08-27T12:23:57Z","cross_cats_sorted":["cs.CE","cs.DC","cs.PL"],"title_canon_sha256":"20c12b73934683f0d0227ae3d36fb15f51c33fd22e55e077a54ddc73f9655a66","abstract_canon_sha256":"5eb55bdcd3182397e26e09ec47077887f010ccc76fa468e39bab0e0feb0bfad7"},"schema_version":"1.0"},"canonical_sha256":"3d89790f5dbecd3ac9100779eaa3e54715ff7d7dacb6520800cd54c821d8c6b7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:30.732696Z","signature_b64":"fwsEHAGbKopnqaTbM7kyWAdYzoLEyrWF3TEaCDArMQ9hFNyfIDN35bP33jxXdBDEWWzX3f97IbmYMU1HwhB7Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d89790f5dbecd3ac9100779eaa3e54715ff7d7dacb6520800cd54c821d8c6b7","last_reissued_at":"2026-05-18T01:34:30.732211Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:30.732211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.00040","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:34:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/vY9p15JthDUsBXR8iDUdOeNS4B8dnwvayx/djynTu8mYAwNKJFOCPnUa8n47QB34+mTfM0gCU6PDhS4DL43DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T04:25:15.097897Z"},"content_sha256":"27f6ca30d9882cf9ef0d32378f27dda5017a724e8f15dd8c31fa970ca1ea9de9","schema_version":"1.0","event_id":"sha256:27f6ca30d9882cf9ef0d32378f27dda5017a724e8f15dd8c31fa970ca1ea9de9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HWEXSD25X3GTVSIQA546VI7FI4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"DSL-based Design Space Exploration for Temporal and Spatial Parallelism of Custom Stream Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE","cs.DC","cs.PL"],"primary_cat":"cs.AR","authors_text":"Kentaro Sano","submitted_at":"2015-08-27T12:23:57Z","abstract_excerpt":"Stream computation is one of the approaches suitable for FPGA-based custom computing due to its high throughput capability brought by pipelining with regular memory access. To increase performance of iterative stream computation, we can exploit both temporal and spatial parallelism by deepening and duplicating pipelines, respectively. However, the performance is constrained by several factors including available hardware resources on FPGA, an external memory bandwidth, and utilization of pipeline stages, and therefore we need to find the best mix of the different parallelism to achieve the hig"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00040","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:34:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4YmCz17v64X1OzVPENKPD+WHLSZOJIcH8ocBvX0Qc2doSEiNmPxeJwGGN7XO7v+tAiTEhzA90+FOd1phbiTzCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T04:25:15.098552Z"},"content_sha256":"0351001a4591bf5a1ed671da5a1a803f22179a5b0d6fb49a84882a039f8881b2","schema_version":"1.0","event_id":"sha256:0351001a4591bf5a1ed671da5a1a803f22179a5b0d6fb49a84882a039f8881b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HWEXSD25X3GTVSIQA546VI7FI4/bundle.json","state_url":"https://pith.science/pith/HWEXSD25X3GTVSIQA546VI7FI4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HWEXSD25X3GTVSIQA546VI7FI4/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-04T04:25:15Z","links":{"resolver":"https://pith.science/pith/HWEXSD25X3GTVSIQA546VI7FI4","bundle":"https://pith.science/pith/HWEXSD25X3GTVSIQA546VI7FI4/bundle.json","state":"https://pith.science/pith/HWEXSD25X3GTVSIQA546VI7FI4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HWEXSD25X3GTVSIQA546VI7FI4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HWEXSD25X3GTVSIQA546VI7FI4","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":"5eb55bdcd3182397e26e09ec47077887f010ccc76fa468e39bab0e0feb0bfad7","cross_cats_sorted":["cs.CE","cs.DC","cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2015-08-27T12:23:57Z","title_canon_sha256":"20c12b73934683f0d0227ae3d36fb15f51c33fd22e55e077a54ddc73f9655a66"},"schema_version":"1.0","source":{"id":"1509.00040","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.00040","created_at":"2026-05-18T01:34:30Z"},{"alias_kind":"arxiv_version","alias_value":"1509.00040v1","created_at":"2026-05-18T01:34:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00040","created_at":"2026-05-18T01:34:30Z"},{"alias_kind":"pith_short_12","alias_value":"HWEXSD25X3GT","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HWEXSD25X3GTVSIQ","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HWEXSD25","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:0351001a4591bf5a1ed671da5a1a803f22179a5b0d6fb49a84882a039f8881b2","target":"graph","created_at":"2026-05-18T01:34:30Z","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":"Stream computation is one of the approaches suitable for FPGA-based custom computing due to its high throughput capability brought by pipelining with regular memory access. To increase performance of iterative stream computation, we can exploit both temporal and spatial parallelism by deepening and duplicating pipelines, respectively. However, the performance is constrained by several factors including available hardware resources on FPGA, an external memory bandwidth, and utilization of pipeline stages, and therefore we need to find the best mix of the different parallelism to achieve the hig","authors_text":"Kentaro Sano","cross_cats":["cs.CE","cs.DC","cs.PL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2015-08-27T12:23:57Z","title":"DSL-based Design Space Exploration for Temporal and Spatial Parallelism of Custom Stream Computing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00040","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:27f6ca30d9882cf9ef0d32378f27dda5017a724e8f15dd8c31fa970ca1ea9de9","target":"record","created_at":"2026-05-18T01:34:30Z","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":"5eb55bdcd3182397e26e09ec47077887f010ccc76fa468e39bab0e0feb0bfad7","cross_cats_sorted":["cs.CE","cs.DC","cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2015-08-27T12:23:57Z","title_canon_sha256":"20c12b73934683f0d0227ae3d36fb15f51c33fd22e55e077a54ddc73f9655a66"},"schema_version":"1.0","source":{"id":"1509.00040","kind":"arxiv","version":1}},"canonical_sha256":"3d89790f5dbecd3ac9100779eaa3e54715ff7d7dacb6520800cd54c821d8c6b7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d89790f5dbecd3ac9100779eaa3e54715ff7d7dacb6520800cd54c821d8c6b7","first_computed_at":"2026-05-18T01:34:30.732211Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:30.732211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fwsEHAGbKopnqaTbM7kyWAdYzoLEyrWF3TEaCDArMQ9hFNyfIDN35bP33jxXdBDEWWzX3f97IbmYMU1HwhB7Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:30.732696Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.00040","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:27f6ca30d9882cf9ef0d32378f27dda5017a724e8f15dd8c31fa970ca1ea9de9","sha256:0351001a4591bf5a1ed671da5a1a803f22179a5b0d6fb49a84882a039f8881b2"],"state_sha256":"932cb5bcf8dd979fea4153250f7d9a0249a95d42ed01c17945dd6a10c475cee5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/NZIilXUfPBpzrPTlch/58/ztyu2WiLZrbqyzhXIvEQMJshUMFRHADNVVdS0VHYzMGqtWsSwC/08XdNDc5MiAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T04:25:15.102222Z","bundle_sha256":"14f2df15656910e7c2105e2601805fe5a4cb794ab19a00eaebdaad13229c2516"}}