{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:EGKCOP6A6JXHGMMTXEV5CFRXBR","short_pith_number":"pith:EGKCOP6A","schema_version":"1.0","canonical_sha256":"2194273fc0f26e733193b92bd116370c7292dec018c8e4eeab1648ced380b137","source":{"kind":"arxiv","id":"1201.4871","version":3},"attestation_state":"computed","paper":{"title":"Queue-Dispatch Asynchronous Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LO","authors_text":"Alexander Heu{\\ss}ner, Gilles Geeraerts, Jean-Fran\\c{c}ois Raskin","submitted_at":"2012-01-23T21:19:03Z","abstract_excerpt":"To make the development of efficient multi-core applications easier, libraries, such as Grand Central Dispatch, have been proposed. When using such a library, the programmer writes so-called blocks, which are chunks of codes, and dispatches them, using synchronous or asynchronous calls, to several types of waiting queues. A scheduler is then responsible for dispatching those blocks on the available cores. Blocks can synchronize via a global memory. In this paper, we propose Queue-Dispatch Asynchronous Systems as a mathematical model that faithfully formalizes the synchronization mechanisms and"},"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":"1201.4871","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-01-23T21:19:03Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"d9d872e0a0c1bbfe6f7a0c60bb20bfb6e8172a5594c73a11a343197d975c52a6","abstract_canon_sha256":"f34bf2e6fe516755ca26e10b3cd1f7b11e0c8c8ddac82d9fc6997e9165d3e79f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:43:05.208531Z","signature_b64":"IOFGBgOIejvP+b3cTNoJ4n1kHy0F3XAQPNW3KSKBf5ktG+fRsIQ8GTojWmYWg8ra/bdsmi1qLQ+muGEHnY/8DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2194273fc0f26e733193b92bd116370c7292dec018c8e4eeab1648ced380b137","last_reissued_at":"2026-05-18T03:43:05.208036Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:43:05.208036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Queue-Dispatch Asynchronous Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LO","authors_text":"Alexander Heu{\\ss}ner, Gilles Geeraerts, Jean-Fran\\c{c}ois Raskin","submitted_at":"2012-01-23T21:19:03Z","abstract_excerpt":"To make the development of efficient multi-core applications easier, libraries, such as Grand Central Dispatch, have been proposed. When using such a library, the programmer writes so-called blocks, which are chunks of codes, and dispatches them, using synchronous or asynchronous calls, to several types of waiting queues. A scheduler is then responsible for dispatching those blocks on the available cores. Blocks can synchronize via a global memory. In this paper, we propose Queue-Dispatch Asynchronous Systems as a mathematical model that faithfully formalizes the synchronization mechanisms and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.4871","kind":"arxiv","version":3},"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":"1201.4871","created_at":"2026-05-18T03:43:05.208114+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.4871v3","created_at":"2026-05-18T03:43:05.208114+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.4871","created_at":"2026-05-18T03:43:05.208114+00:00"},{"alias_kind":"pith_short_12","alias_value":"EGKCOP6A6JXH","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"EGKCOP6A6JXHGMMT","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"EGKCOP6A","created_at":"2026-05-18T12:27:04.183437+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/EGKCOP6A6JXHGMMTXEV5CFRXBR","json":"https://pith.science/pith/EGKCOP6A6JXHGMMTXEV5CFRXBR.json","graph_json":"https://pith.science/api/pith-number/EGKCOP6A6JXHGMMTXEV5CFRXBR/graph.json","events_json":"https://pith.science/api/pith-number/EGKCOP6A6JXHGMMTXEV5CFRXBR/events.json","paper":"https://pith.science/paper/EGKCOP6A"},"agent_actions":{"view_html":"https://pith.science/pith/EGKCOP6A6JXHGMMTXEV5CFRXBR","download_json":"https://pith.science/pith/EGKCOP6A6JXHGMMTXEV5CFRXBR.json","view_paper":"https://pith.science/paper/EGKCOP6A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.4871&json=true","fetch_graph":"https://pith.science/api/pith-number/EGKCOP6A6JXHGMMTXEV5CFRXBR/graph.json","fetch_events":"https://pith.science/api/pith-number/EGKCOP6A6JXHGMMTXEV5CFRXBR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EGKCOP6A6JXHGMMTXEV5CFRXBR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EGKCOP6A6JXHGMMTXEV5CFRXBR/action/storage_attestation","attest_author":"https://pith.science/pith/EGKCOP6A6JXHGMMTXEV5CFRXBR/action/author_attestation","sign_citation":"https://pith.science/pith/EGKCOP6A6JXHGMMTXEV5CFRXBR/action/citation_signature","submit_replication":"https://pith.science/pith/EGKCOP6A6JXHGMMTXEV5CFRXBR/action/replication_record"}},"created_at":"2026-05-18T03:43:05.208114+00:00","updated_at":"2026-05-18T03:43:05.208114+00:00"}