{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:5VNZPJ4PKQEX3FGPSH6U5GCXA5","short_pith_number":"pith:5VNZPJ4P","schema_version":"1.0","canonical_sha256":"ed5b97a78f54097d94cf91fd4e98570758273398243b1dbf36971e34727685ef","source":{"kind":"arxiv","id":"1705.02851","version":2},"attestation_state":"computed","paper":{"title":"Flat Parallelization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Petr Kuznetsov, Vitaly Aksenov","submitted_at":"2017-05-08T13:02:34Z","abstract_excerpt":"There are two intertwined factors that affect performance of concurrent data structures: the ability of processes to access the data in parallel and the cost of synchronization. It has been observed that for a large class of \"concurrency-unfriendly\" data structures, fine-grained parallelization does not pay off: an implementation based on a single global lock outperforms fine-grained solutions. The flat combining paradigm exploits this by ensuring that a thread holding the global lock sequentially combines requests and then executes the combined requests on behalf of concurrent threads.\n  In t"},"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":"1705.02851","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-08T13:02:34Z","cross_cats_sorted":[],"title_canon_sha256":"a1a4707ec7cbbe63d6cb30c25dce0ff378c08f1edf69e9c013f5412614fdba02","abstract_canon_sha256":"7b5ef824aec94b80b425e814a2d419facd500b7186be457bc97020738e540d4f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:50.936701Z","signature_b64":"+e1M8Qv38X8dAzD7EO55kdCT2VKVlJtZL907uRIzANElu17xKwoChhSrWtNvQ7hfPZAIuAkIw1OJQpQ2UFuCCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed5b97a78f54097d94cf91fd4e98570758273398243b1dbf36971e34727685ef","last_reissued_at":"2026-05-18T00:44:50.935978Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:50.935978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Flat Parallelization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Petr Kuznetsov, Vitaly Aksenov","submitted_at":"2017-05-08T13:02:34Z","abstract_excerpt":"There are two intertwined factors that affect performance of concurrent data structures: the ability of processes to access the data in parallel and the cost of synchronization. It has been observed that for a large class of \"concurrency-unfriendly\" data structures, fine-grained parallelization does not pay off: an implementation based on a single global lock outperforms fine-grained solutions. The flat combining paradigm exploits this by ensuring that a thread holding the global lock sequentially combines requests and then executes the combined requests on behalf of concurrent threads.\n  In t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02851","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":"1705.02851","created_at":"2026-05-18T00:44:50.936093+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.02851v2","created_at":"2026-05-18T00:44:50.936093+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02851","created_at":"2026-05-18T00:44:50.936093+00:00"},{"alias_kind":"pith_short_12","alias_value":"5VNZPJ4PKQEX","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"5VNZPJ4PKQEX3FGP","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"5VNZPJ4P","created_at":"2026-05-18T12:31:00.734936+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/5VNZPJ4PKQEX3FGPSH6U5GCXA5","json":"https://pith.science/pith/5VNZPJ4PKQEX3FGPSH6U5GCXA5.json","graph_json":"https://pith.science/api/pith-number/5VNZPJ4PKQEX3FGPSH6U5GCXA5/graph.json","events_json":"https://pith.science/api/pith-number/5VNZPJ4PKQEX3FGPSH6U5GCXA5/events.json","paper":"https://pith.science/paper/5VNZPJ4P"},"agent_actions":{"view_html":"https://pith.science/pith/5VNZPJ4PKQEX3FGPSH6U5GCXA5","download_json":"https://pith.science/pith/5VNZPJ4PKQEX3FGPSH6U5GCXA5.json","view_paper":"https://pith.science/paper/5VNZPJ4P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.02851&json=true","fetch_graph":"https://pith.science/api/pith-number/5VNZPJ4PKQEX3FGPSH6U5GCXA5/graph.json","fetch_events":"https://pith.science/api/pith-number/5VNZPJ4PKQEX3FGPSH6U5GCXA5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5VNZPJ4PKQEX3FGPSH6U5GCXA5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5VNZPJ4PKQEX3FGPSH6U5GCXA5/action/storage_attestation","attest_author":"https://pith.science/pith/5VNZPJ4PKQEX3FGPSH6U5GCXA5/action/author_attestation","sign_citation":"https://pith.science/pith/5VNZPJ4PKQEX3FGPSH6U5GCXA5/action/citation_signature","submit_replication":"https://pith.science/pith/5VNZPJ4PKQEX3FGPSH6U5GCXA5/action/replication_record"}},"created_at":"2026-05-18T00:44:50.936093+00:00","updated_at":"2026-05-18T00:44:50.936093+00:00"}