{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:IUCCHRYFJU6XV4YROO7PNH43OT","short_pith_number":"pith:IUCCHRYF","canonical_record":{"source":{"id":"2011.13823","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-11-27T16:41:07Z","cross_cats_sorted":[],"title_canon_sha256":"f1c01a01c6ba6b4234074907c8e3a413ad04d352a36c31d7a222c663c6bdf47e","abstract_canon_sha256":"f2b0c82e4dae14c3965e3b8ef7e1f39c3dde54b0b096bbddb5280684cc4bed07"},"schema_version":"1.0"},"canonical_sha256":"450423c7054d3d7af31173bef69f9b74d086d68bc189f636d5f3048418bf4e4a","source":{"kind":"arxiv","id":"2011.13823","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.13823","created_at":"2026-07-05T01:54:58Z"},{"alias_kind":"arxiv_version","alias_value":"2011.13823v1","created_at":"2026-07-05T01:54:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.13823","created_at":"2026-07-05T01:54:58Z"},{"alias_kind":"pith_short_12","alias_value":"IUCCHRYFJU6X","created_at":"2026-07-05T01:54:58Z"},{"alias_kind":"pith_short_16","alias_value":"IUCCHRYFJU6XV4YR","created_at":"2026-07-05T01:54:58Z"},{"alias_kind":"pith_short_8","alias_value":"IUCCHRYF","created_at":"2026-07-05T01:54:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:IUCCHRYFJU6XV4YROO7PNH43OT","target":"record","payload":{"canonical_record":{"source":{"id":"2011.13823","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-11-27T16:41:07Z","cross_cats_sorted":[],"title_canon_sha256":"f1c01a01c6ba6b4234074907c8e3a413ad04d352a36c31d7a222c663c6bdf47e","abstract_canon_sha256":"f2b0c82e4dae14c3965e3b8ef7e1f39c3dde54b0b096bbddb5280684cc4bed07"},"schema_version":"1.0"},"canonical_sha256":"450423c7054d3d7af31173bef69f9b74d086d68bc189f636d5f3048418bf4e4a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:54:58.939212Z","signature_b64":"AvU/cwkC/kRCf5S9GoLqMbkdLvD2rtBsIGyQGxiDv1HfFFVHH2o+tjPS6Oy6ZfwlGtTtItPM6HwWwIbYGmY3AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"450423c7054d3d7af31173bef69f9b74d086d68bc189f636d5f3048418bf4e4a","last_reissued_at":"2026-07-05T01:54:58.938830Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:54:58.938830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2011.13823","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-07-05T01:54:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aLoMQgrgilGBJZAj64ZBv+3rllGX/xAtQNbnS+EKXOVeZvvIqNfX4wtBGAcRQWkbg9XFMGwQ4/p5ZxkaTomtDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T05:51:48.343758Z"},"content_sha256":"c24115eedcf5d0a11ce0561b241aee10dbf528e46a9ec74d32dbc0eeb734acbe","schema_version":"1.0","event_id":"sha256:c24115eedcf5d0a11ce0561b241aee10dbf528e46a9ec74d32dbc0eeb734acbe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:IUCCHRYFJU6XV4YROO7PNH43OT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Introducing the Task-Aware Storage I/O (TASIO) Library","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Aleix Roca Nonell, Sergi Mateo Bellido, Vicen\\c{c} Beltran Querol","submitted_at":"2020-11-27T16:41:07Z","abstract_excerpt":"Task-based programming models are excellent tools to parallelize and seamlessly load balance an application workload. However, the integration of I/O intensive applications and task-based programming models is lacking. Typically, I/O operations stall the requesting thread until the data is serviced by the backing device. Because the core where the thread was running becomes idle, it should be possible to overlap the data query operation with either computation workloads or even more I/O operations. Nonetheless, overlapping I/O tasks with other tasks entails an extra degree of complexity curren"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.13823","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.13823/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:54:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Up0VMI6ed+A2F8bcIKGXv2RP7QC2DTAyLft2G0edYYJ+2MGSNHrSGFA+dY5AhNTw6AypDRHayQlZ9NWdn9KuCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T05:51:48.344685Z"},"content_sha256":"6c4ebc9a5dfb7138e8c27df1bd6ab77436dbe1889c402cdd6832f274ddca4776","schema_version":"1.0","event_id":"sha256:6c4ebc9a5dfb7138e8c27df1bd6ab77436dbe1889c402cdd6832f274ddca4776"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IUCCHRYFJU6XV4YROO7PNH43OT/bundle.json","state_url":"https://pith.science/pith/IUCCHRYFJU6XV4YROO7PNH43OT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IUCCHRYFJU6XV4YROO7PNH43OT/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-07-07T05:51:48Z","links":{"resolver":"https://pith.science/pith/IUCCHRYFJU6XV4YROO7PNH43OT","bundle":"https://pith.science/pith/IUCCHRYFJU6XV4YROO7PNH43OT/bundle.json","state":"https://pith.science/pith/IUCCHRYFJU6XV4YROO7PNH43OT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IUCCHRYFJU6XV4YROO7PNH43OT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:IUCCHRYFJU6XV4YROO7PNH43OT","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":"f2b0c82e4dae14c3965e3b8ef7e1f39c3dde54b0b096bbddb5280684cc4bed07","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-11-27T16:41:07Z","title_canon_sha256":"f1c01a01c6ba6b4234074907c8e3a413ad04d352a36c31d7a222c663c6bdf47e"},"schema_version":"1.0","source":{"id":"2011.13823","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.13823","created_at":"2026-07-05T01:54:58Z"},{"alias_kind":"arxiv_version","alias_value":"2011.13823v1","created_at":"2026-07-05T01:54:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.13823","created_at":"2026-07-05T01:54:58Z"},{"alias_kind":"pith_short_12","alias_value":"IUCCHRYFJU6X","created_at":"2026-07-05T01:54:58Z"},{"alias_kind":"pith_short_16","alias_value":"IUCCHRYFJU6XV4YR","created_at":"2026-07-05T01:54:58Z"},{"alias_kind":"pith_short_8","alias_value":"IUCCHRYF","created_at":"2026-07-05T01:54:58Z"}],"graph_snapshots":[{"event_id":"sha256:6c4ebc9a5dfb7138e8c27df1bd6ab77436dbe1889c402cdd6832f274ddca4776","target":"graph","created_at":"2026-07-05T01:54:58Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2011.13823/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Task-based programming models are excellent tools to parallelize and seamlessly load balance an application workload. However, the integration of I/O intensive applications and task-based programming models is lacking. Typically, I/O operations stall the requesting thread until the data is serviced by the backing device. Because the core where the thread was running becomes idle, it should be possible to overlap the data query operation with either computation workloads or even more I/O operations. Nonetheless, overlapping I/O tasks with other tasks entails an extra degree of complexity curren","authors_text":"Aleix Roca Nonell, Sergi Mateo Bellido, Vicen\\c{c} Beltran Querol","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-11-27T16:41:07Z","title":"Introducing the Task-Aware Storage I/O (TASIO) Library"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.13823","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:c24115eedcf5d0a11ce0561b241aee10dbf528e46a9ec74d32dbc0eeb734acbe","target":"record","created_at":"2026-07-05T01:54:58Z","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":"f2b0c82e4dae14c3965e3b8ef7e1f39c3dde54b0b096bbddb5280684cc4bed07","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-11-27T16:41:07Z","title_canon_sha256":"f1c01a01c6ba6b4234074907c8e3a413ad04d352a36c31d7a222c663c6bdf47e"},"schema_version":"1.0","source":{"id":"2011.13823","kind":"arxiv","version":1}},"canonical_sha256":"450423c7054d3d7af31173bef69f9b74d086d68bc189f636d5f3048418bf4e4a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"450423c7054d3d7af31173bef69f9b74d086d68bc189f636d5f3048418bf4e4a","first_computed_at":"2026-07-05T01:54:58.938830Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:54:58.938830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AvU/cwkC/kRCf5S9GoLqMbkdLvD2rtBsIGyQGxiDv1HfFFVHH2o+tjPS6Oy6ZfwlGtTtItPM6HwWwIbYGmY3AQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:54:58.939212Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.13823","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c24115eedcf5d0a11ce0561b241aee10dbf528e46a9ec74d32dbc0eeb734acbe","sha256:6c4ebc9a5dfb7138e8c27df1bd6ab77436dbe1889c402cdd6832f274ddca4776"],"state_sha256":"41ed60cc1c8bce85bc5d4c7fd5c2965d1dee163f235e0d2f3e11cf64a012e83b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JgIl8jwknVtvTw4Pnpc4as4X+OzQuwnGhY679xpC46fMIUQDIM5Wi8Jp0/ndFFA3MTROB+CANpAanlWkqlVXBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T05:51:48.347150Z","bundle_sha256":"34c8cd568c54fd60190147263cf9b8ed58ccaac8499039993b889149652deb7c"}}