{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:MKUPBWE666S22IOSUYJA4RLHVF","short_pith_number":"pith:MKUPBWE6","schema_version":"1.0","canonical_sha256":"62a8f0d89ef7a5ad21d2a6120e4567a97204e4a3780e9b4e318d84b847e0d3de","source":{"kind":"arxiv","id":"1903.09422","version":1},"attestation_state":"computed","paper":{"title":"Parallel Adaptive Sampling with almost no Synchronization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alexander van der Grinten, Eugenio Angriman, Henning Meyerhenke","submitted_at":"2019-03-22T09:52:17Z","abstract_excerpt":"Approximation via sampling is a widespread technique whenever exact solutions are too expensive. In this paper, we present techniques for an efficient parallelization of adaptive (a. k. a. progressive) sampling algorithms on multi-threaded shared-memory machines. Our basic algorithmic technique requires no synchronization except for atomic load-acquire and store-release operations. It does, however, require O(n) memory per thread, where n is the size of the sampling state. We present variants of the algorithm that either reduce this memory consumption to O(1) or ensure that deterministic resul"},"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":"1903.09422","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-03-22T09:52:17Z","cross_cats_sorted":[],"title_canon_sha256":"20b144cbdb485f30b250537d44b10ea0e4aa85429ce3f06fc4c2d3915eb7c10a","abstract_canon_sha256":"8f1331d67dd19ebb4b3dd26341d0762d18c2319aec543f9ebe77c6c71737608a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:39.684591Z","signature_b64":"yd8yA1lDHCHVU7knIOh50HBbFHRZN+nOIHAdlRv15fBFHTdXDU+4Ts2mSEb7nlFS9F4fGZns6XvYSHNB7UTGAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62a8f0d89ef7a5ad21d2a6120e4567a97204e4a3780e9b4e318d84b847e0d3de","last_reissued_at":"2026-05-17T23:50:39.683937Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:39.683937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel Adaptive Sampling with almost no Synchronization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alexander van der Grinten, Eugenio Angriman, Henning Meyerhenke","submitted_at":"2019-03-22T09:52:17Z","abstract_excerpt":"Approximation via sampling is a widespread technique whenever exact solutions are too expensive. In this paper, we present techniques for an efficient parallelization of adaptive (a. k. a. progressive) sampling algorithms on multi-threaded shared-memory machines. Our basic algorithmic technique requires no synchronization except for atomic load-acquire and store-release operations. It does, however, require O(n) memory per thread, where n is the size of the sampling state. We present variants of the algorithm that either reduce this memory consumption to O(1) or ensure that deterministic resul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.09422","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1903.09422","created_at":"2026-05-17T23:50:39.684060+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.09422v1","created_at":"2026-05-17T23:50:39.684060+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.09422","created_at":"2026-05-17T23:50:39.684060+00:00"},{"alias_kind":"pith_short_12","alias_value":"MKUPBWE666S2","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"MKUPBWE666S22IOS","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"MKUPBWE6","created_at":"2026-05-18T12:33:21.387695+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/MKUPBWE666S22IOSUYJA4RLHVF","json":"https://pith.science/pith/MKUPBWE666S22IOSUYJA4RLHVF.json","graph_json":"https://pith.science/api/pith-number/MKUPBWE666S22IOSUYJA4RLHVF/graph.json","events_json":"https://pith.science/api/pith-number/MKUPBWE666S22IOSUYJA4RLHVF/events.json","paper":"https://pith.science/paper/MKUPBWE6"},"agent_actions":{"view_html":"https://pith.science/pith/MKUPBWE666S22IOSUYJA4RLHVF","download_json":"https://pith.science/pith/MKUPBWE666S22IOSUYJA4RLHVF.json","view_paper":"https://pith.science/paper/MKUPBWE6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.09422&json=true","fetch_graph":"https://pith.science/api/pith-number/MKUPBWE666S22IOSUYJA4RLHVF/graph.json","fetch_events":"https://pith.science/api/pith-number/MKUPBWE666S22IOSUYJA4RLHVF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MKUPBWE666S22IOSUYJA4RLHVF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MKUPBWE666S22IOSUYJA4RLHVF/action/storage_attestation","attest_author":"https://pith.science/pith/MKUPBWE666S22IOSUYJA4RLHVF/action/author_attestation","sign_citation":"https://pith.science/pith/MKUPBWE666S22IOSUYJA4RLHVF/action/citation_signature","submit_replication":"https://pith.science/pith/MKUPBWE666S22IOSUYJA4RLHVF/action/replication_record"}},"created_at":"2026-05-17T23:50:39.684060+00:00","updated_at":"2026-05-17T23:50:39.684060+00:00"}