{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:MHOAGSCBTGG7DLHZOOW6VZ6LHK","short_pith_number":"pith:MHOAGSCB","canonical_record":{"source":{"id":"2211.10819","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2022-11-19T23:04:14Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"7f63c385269b241c8da57926b5e7770e5d8612378f7ad1c3880c9191733bad65","abstract_canon_sha256":"7158953f1fdf32783e5ea30e2c41d386ddb36b90dbff5968c6fd0400081e7fc5"},"schema_version":"1.0"},"canonical_sha256":"61dc034841998df1acf973adeae7cb3ab5be10706cd6b3bcdc6efc521302b645","source":{"kind":"arxiv","id":"2211.10819","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.10819","created_at":"2026-07-05T07:39:56Z"},{"alias_kind":"arxiv_version","alias_value":"2211.10819v2","created_at":"2026-07-05T07:39:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.10819","created_at":"2026-07-05T07:39:56Z"},{"alias_kind":"pith_short_12","alias_value":"MHOAGSCBTGG7","created_at":"2026-07-05T07:39:56Z"},{"alias_kind":"pith_short_16","alias_value":"MHOAGSCBTGG7DLHZ","created_at":"2026-07-05T07:39:56Z"},{"alias_kind":"pith_short_8","alias_value":"MHOAGSCB","created_at":"2026-07-05T07:39:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:MHOAGSCBTGG7DLHZOOW6VZ6LHK","target":"record","payload":{"canonical_record":{"source":{"id":"2211.10819","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2022-11-19T23:04:14Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"7f63c385269b241c8da57926b5e7770e5d8612378f7ad1c3880c9191733bad65","abstract_canon_sha256":"7158953f1fdf32783e5ea30e2c41d386ddb36b90dbff5968c6fd0400081e7fc5"},"schema_version":"1.0"},"canonical_sha256":"61dc034841998df1acf973adeae7cb3ab5be10706cd6b3bcdc6efc521302b645","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:39:56.965706Z","signature_b64":"vWp0OnH1hd6YiS+RyyMZouOjSySBzPu19Mv0NH474cLUMQCzvKUgweXJKqE0LZAPN52XQId5f8Tb6B4zt/VFBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61dc034841998df1acf973adeae7cb3ab5be10706cd6b3bcdc6efc521302b645","last_reissued_at":"2026-07-05T07:39:56.965271Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:39:56.965271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2211.10819","source_version":2,"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-05T07:39:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6/NMEKtJqCsyzLBpmAW6ZiqsFTYCdO4wVJLMrnAJTHpaqtgkXQcadW5X9MDrn2bUO42176dvRXyZyUnFknG3CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T14:37:52.250336Z"},"content_sha256":"d657e76f2d385e0935ffba139283bfb576f297ab635b676129ad1b753e623715","schema_version":"1.0","event_id":"sha256:d657e76f2d385e0935ffba139283bfb576f297ab635b676129ad1b753e623715"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:MHOAGSCBTGG7DLHZOOW6VZ6LHK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Block size estimation for data partitioning in HPC applications using machine learning techniques","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DC","authors_text":"Alessio Orsino, Domenico Talia, Fabrizio Marozzo, Fernando Vazquez, Jorge Ejarque, Paolo Trunfio, Riccardo Cantini, Rosa M. Badia","submitted_at":"2022-11-19T23:04:14Z","abstract_excerpt":"The extensive use of HPC infrastructures and frameworks for running dataintensive applications has led to a growing interest in data partitioning techniques and strategies. In fact, application performance can be heavily affected by how data are partitioned, which in turn depends on the selected size for data blocks, i.e. the block size. Therefore, finding an effective partitioning, i.e. a suitable block size, is a key strategy to speed-up parallel data-intensive applications and increase scalability. This paper describes a methodology, namely BLEST-ML (BLock size ESTimation through Machine Le"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.10819","kind":"arxiv","version":2},"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/2211.10819/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-05T07:39:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EfdqWV9vap5KXhQPTdZWyiypvM7HjloN2V8UhbFOdUZipaYPX2zGVsLsan89y+m4E2kbKNRrjFx5CDxw3rd3Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T14:37:52.251264Z"},"content_sha256":"65d45ef2a216a83644cbcdec7a323edd75fb542ed85af253b8882da97b938d4c","schema_version":"1.0","event_id":"sha256:65d45ef2a216a83644cbcdec7a323edd75fb542ed85af253b8882da97b938d4c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MHOAGSCBTGG7DLHZOOW6VZ6LHK/bundle.json","state_url":"https://pith.science/pith/MHOAGSCBTGG7DLHZOOW6VZ6LHK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MHOAGSCBTGG7DLHZOOW6VZ6LHK/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-08-03T14:37:52Z","links":{"resolver":"https://pith.science/pith/MHOAGSCBTGG7DLHZOOW6VZ6LHK","bundle":"https://pith.science/pith/MHOAGSCBTGG7DLHZOOW6VZ6LHK/bundle.json","state":"https://pith.science/pith/MHOAGSCBTGG7DLHZOOW6VZ6LHK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MHOAGSCBTGG7DLHZOOW6VZ6LHK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:MHOAGSCBTGG7DLHZOOW6VZ6LHK","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":"7158953f1fdf32783e5ea30e2c41d386ddb36b90dbff5968c6fd0400081e7fc5","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2022-11-19T23:04:14Z","title_canon_sha256":"7f63c385269b241c8da57926b5e7770e5d8612378f7ad1c3880c9191733bad65"},"schema_version":"1.0","source":{"id":"2211.10819","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.10819","created_at":"2026-07-05T07:39:56Z"},{"alias_kind":"arxiv_version","alias_value":"2211.10819v2","created_at":"2026-07-05T07:39:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.10819","created_at":"2026-07-05T07:39:56Z"},{"alias_kind":"pith_short_12","alias_value":"MHOAGSCBTGG7","created_at":"2026-07-05T07:39:56Z"},{"alias_kind":"pith_short_16","alias_value":"MHOAGSCBTGG7DLHZ","created_at":"2026-07-05T07:39:56Z"},{"alias_kind":"pith_short_8","alias_value":"MHOAGSCB","created_at":"2026-07-05T07:39:56Z"}],"graph_snapshots":[{"event_id":"sha256:65d45ef2a216a83644cbcdec7a323edd75fb542ed85af253b8882da97b938d4c","target":"graph","created_at":"2026-07-05T07:39:56Z","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/2211.10819/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The extensive use of HPC infrastructures and frameworks for running dataintensive applications has led to a growing interest in data partitioning techniques and strategies. In fact, application performance can be heavily affected by how data are partitioned, which in turn depends on the selected size for data blocks, i.e. the block size. Therefore, finding an effective partitioning, i.e. a suitable block size, is a key strategy to speed-up parallel data-intensive applications and increase scalability. This paper describes a methodology, namely BLEST-ML (BLock size ESTimation through Machine Le","authors_text":"Alessio Orsino, Domenico Talia, Fabrizio Marozzo, Fernando Vazquez, Jorge Ejarque, Paolo Trunfio, Riccardo Cantini, Rosa M. Badia","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2022-11-19T23:04:14Z","title":"Block size estimation for data partitioning in HPC applications using machine learning techniques"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.10819","kind":"arxiv","version":2},"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:d657e76f2d385e0935ffba139283bfb576f297ab635b676129ad1b753e623715","target":"record","created_at":"2026-07-05T07:39:56Z","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":"7158953f1fdf32783e5ea30e2c41d386ddb36b90dbff5968c6fd0400081e7fc5","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2022-11-19T23:04:14Z","title_canon_sha256":"7f63c385269b241c8da57926b5e7770e5d8612378f7ad1c3880c9191733bad65"},"schema_version":"1.0","source":{"id":"2211.10819","kind":"arxiv","version":2}},"canonical_sha256":"61dc034841998df1acf973adeae7cb3ab5be10706cd6b3bcdc6efc521302b645","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"61dc034841998df1acf973adeae7cb3ab5be10706cd6b3bcdc6efc521302b645","first_computed_at":"2026-07-05T07:39:56.965271Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:39:56.965271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vWp0OnH1hd6YiS+RyyMZouOjSySBzPu19Mv0NH474cLUMQCzvKUgweXJKqE0LZAPN52XQId5f8Tb6B4zt/VFBg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:39:56.965706Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.10819","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d657e76f2d385e0935ffba139283bfb576f297ab635b676129ad1b753e623715","sha256:65d45ef2a216a83644cbcdec7a323edd75fb542ed85af253b8882da97b938d4c"],"state_sha256":"13c386e6b6db611659212f122eb2eea311100cbdac4c858d1d76cb2d4778985d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F6ClXkOXiMVrgIcrP0ZxhfE3GJouC3rUg1+PsqrN4LVwOxcnzfu0fxBfWvOmBL4BJ5hEv1MTwn4iswlqVg+jCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T14:37:52.263951Z","bundle_sha256":"71b3891ea14c5ac5ff0f5765165629a88a971a49ca650f014a814f7dd2b12a07"}}