{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:2SSF3Q74EMS4TBB3YFDYANPDBC","short_pith_number":"pith:2SSF3Q74","schema_version":"1.0","canonical_sha256":"d4a45dc3fc2325c9843bc1478035e3088e9130aac52c1801780727f972a108be","source":{"kind":"arxiv","id":"2305.00506","version":1},"attestation_state":"computed","paper":{"title":"A Wall-time Minimizing Parallelization Strategy for Approximate Bayesian Computation","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"q-bio.QM","authors_text":"Emad Alamoudi, Felipe Reck, Frederik Graw, Jan Hasenauer, Lutz Brusch, Nils Bundgaard, Yannik Sch\\\"alte","submitted_at":"2023-04-30T15:23:33Z","abstract_excerpt":"Approximate Bayesian Computation (ABC) is a widely applicable and popular approach to estimating unknown parameters of mechanistic models. As ABC analyses are computationally expensive, parallelization on high-performance infrastructure is often necessary. However, the existing parallelization strategies leave resources unused at times and thus do not optimally leverage them yet. We present look-ahead scheduling, a wall-time minimizing parallelization strategy for ABC Sequential Monte Carlo algorithms, which utilizes all available resources at practically all times by proactive sampling for pr"},"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":"2305.00506","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"q-bio.QM","submitted_at":"2023-04-30T15:23:33Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"f178cf27118595f2c793dbf857b55c89012f18811a8e77cf9d3a510ef40eec55","abstract_canon_sha256":"76e635a16f565d9919a350e265366dc6174cc454c6d6575fbba751fc11f1d7c1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:05:42.091185Z","signature_b64":"/0rzi1PKxOsL6CKVrDiM06ONuX7sVawqfcI6tiv/6a5ddVA+0lTVHZQXYx7RJIIKMJD5Bp/StVNBIJ9AvdI2AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4a45dc3fc2325c9843bc1478035e3088e9130aac52c1801780727f972a108be","last_reissued_at":"2026-07-05T06:05:42.090780Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:05:42.090780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Wall-time Minimizing Parallelization Strategy for Approximate Bayesian Computation","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"q-bio.QM","authors_text":"Emad Alamoudi, Felipe Reck, Frederik Graw, Jan Hasenauer, Lutz Brusch, Nils Bundgaard, Yannik Sch\\\"alte","submitted_at":"2023-04-30T15:23:33Z","abstract_excerpt":"Approximate Bayesian Computation (ABC) is a widely applicable and popular approach to estimating unknown parameters of mechanistic models. As ABC analyses are computationally expensive, parallelization on high-performance infrastructure is often necessary. However, the existing parallelization strategies leave resources unused at times and thus do not optimally leverage them yet. We present look-ahead scheduling, a wall-time minimizing parallelization strategy for ABC Sequential Monte Carlo algorithms, which utilizes all available resources at practically all times by proactive sampling for pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.00506","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/2305.00506/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2305.00506","created_at":"2026-07-05T06:05:42.090844+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.00506v1","created_at":"2026-07-05T06:05:42.090844+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.00506","created_at":"2026-07-05T06:05:42.090844+00:00"},{"alias_kind":"pith_short_12","alias_value":"2SSF3Q74EMS4","created_at":"2026-07-05T06:05:42.090844+00:00"},{"alias_kind":"pith_short_16","alias_value":"2SSF3Q74EMS4TBB3","created_at":"2026-07-05T06:05:42.090844+00:00"},{"alias_kind":"pith_short_8","alias_value":"2SSF3Q74","created_at":"2026-07-05T06:05:42.090844+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/2SSF3Q74EMS4TBB3YFDYANPDBC","json":"https://pith.science/pith/2SSF3Q74EMS4TBB3YFDYANPDBC.json","graph_json":"https://pith.science/api/pith-number/2SSF3Q74EMS4TBB3YFDYANPDBC/graph.json","events_json":"https://pith.science/api/pith-number/2SSF3Q74EMS4TBB3YFDYANPDBC/events.json","paper":"https://pith.science/paper/2SSF3Q74"},"agent_actions":{"view_html":"https://pith.science/pith/2SSF3Q74EMS4TBB3YFDYANPDBC","download_json":"https://pith.science/pith/2SSF3Q74EMS4TBB3YFDYANPDBC.json","view_paper":"https://pith.science/paper/2SSF3Q74","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.00506&json=true","fetch_graph":"https://pith.science/api/pith-number/2SSF3Q74EMS4TBB3YFDYANPDBC/graph.json","fetch_events":"https://pith.science/api/pith-number/2SSF3Q74EMS4TBB3YFDYANPDBC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2SSF3Q74EMS4TBB3YFDYANPDBC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2SSF3Q74EMS4TBB3YFDYANPDBC/action/storage_attestation","attest_author":"https://pith.science/pith/2SSF3Q74EMS4TBB3YFDYANPDBC/action/author_attestation","sign_citation":"https://pith.science/pith/2SSF3Q74EMS4TBB3YFDYANPDBC/action/citation_signature","submit_replication":"https://pith.science/pith/2SSF3Q74EMS4TBB3YFDYANPDBC/action/replication_record"}},"created_at":"2026-07-05T06:05:42.090844+00:00","updated_at":"2026-07-05T06:05:42.090844+00:00"}