{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GN7NEVBQOAMVB4UFNVTB4PZE56","short_pith_number":"pith:GN7NEVBQ","schema_version":"1.0","canonical_sha256":"337ed25430701950f2856d661e3f24ef95049c9cf8442091473e279342113a5f","source":{"kind":"arxiv","id":"1902.10069","version":2},"attestation_state":"computed","paper":{"title":"Simulating Data Access Profiles of Computational Jobs in Data Grids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Erich Schikuta, Joeri Hermans, Mario Lassnig, Martin Barisits, Volodimir Begy","submitted_at":"2019-02-26T17:29:44Z","abstract_excerpt":"The data access patterns of applications running in computing grids are changing due to the recent proliferation of high speed local and wide area networks. The data-intensive jobs are no longer strictly required to run at the computing sites, where the respective input data are located. Instead, jobs may access the data employing arbitrary combinations of data-placement, stage-in and remote data access. These data access profiles exhibit partially non-overlapping throughput bottlenecks. This fact can be exploited in order to minimize the time jobs spend waiting for input data. In this work we"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1902.10069","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-02-26T17:29:44Z","cross_cats_sorted":[],"title_canon_sha256":"3a234ccd0be77dbad9493c1e93c965319c0970250cec21e8fe1be74dfc4e34e5","abstract_canon_sha256":"1db0f79ebf4ea0875f38174d4cca44dd637890f0a19cb95156c4b79275a207fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:25.620985Z","signature_b64":"S92rBjlizR7ENlPYiT20ir36WB+IzybOC+8wS2XUao0Cgu4m2hTGRfBLI1TXCGDmJW4cj9J3ZYc6mpkgvN2uDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"337ed25430701950f2856d661e3f24ef95049c9cf8442091473e279342113a5f","last_reissued_at":"2026-05-17T23:51:25.620383Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:25.620383Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simulating Data Access Profiles of Computational Jobs in Data Grids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Erich Schikuta, Joeri Hermans, Mario Lassnig, Martin Barisits, Volodimir Begy","submitted_at":"2019-02-26T17:29:44Z","abstract_excerpt":"The data access patterns of applications running in computing grids are changing due to the recent proliferation of high speed local and wide area networks. The data-intensive jobs are no longer strictly required to run at the computing sites, where the respective input data are located. Instead, jobs may access the data employing arbitrary combinations of data-placement, stage-in and remote data access. These data access profiles exhibit partially non-overlapping throughput bottlenecks. This fact can be exploited in order to minimize the time jobs spend waiting for input data. In this work we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10069","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":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1902.10069","created_at":"2026-05-17T23:51:25.620454+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.10069v2","created_at":"2026-05-17T23:51:25.620454+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10069","created_at":"2026-05-17T23:51:25.620454+00:00"},{"alias_kind":"pith_short_12","alias_value":"GN7NEVBQOAMV","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"GN7NEVBQOAMVB4UF","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"GN7NEVBQ","created_at":"2026-05-18T12:33:18.533446+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GN7NEVBQOAMVB4UFNVTB4PZE56","json":"https://pith.science/pith/GN7NEVBQOAMVB4UFNVTB4PZE56.json","graph_json":"https://pith.science/api/pith-number/GN7NEVBQOAMVB4UFNVTB4PZE56/graph.json","events_json":"https://pith.science/api/pith-number/GN7NEVBQOAMVB4UFNVTB4PZE56/events.json","paper":"https://pith.science/paper/GN7NEVBQ"},"agent_actions":{"view_html":"https://pith.science/pith/GN7NEVBQOAMVB4UFNVTB4PZE56","download_json":"https://pith.science/pith/GN7NEVBQOAMVB4UFNVTB4PZE56.json","view_paper":"https://pith.science/paper/GN7NEVBQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.10069&json=true","fetch_graph":"https://pith.science/api/pith-number/GN7NEVBQOAMVB4UFNVTB4PZE56/graph.json","fetch_events":"https://pith.science/api/pith-number/GN7NEVBQOAMVB4UFNVTB4PZE56/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GN7NEVBQOAMVB4UFNVTB4PZE56/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GN7NEVBQOAMVB4UFNVTB4PZE56/action/storage_attestation","attest_author":"https://pith.science/pith/GN7NEVBQOAMVB4UFNVTB4PZE56/action/author_attestation","sign_citation":"https://pith.science/pith/GN7NEVBQOAMVB4UFNVTB4PZE56/action/citation_signature","submit_replication":"https://pith.science/pith/GN7NEVBQOAMVB4UFNVTB4PZE56/action/replication_record"}},"created_at":"2026-05-17T23:51:25.620454+00:00","updated_at":"2026-05-17T23:51:25.620454+00:00"}