{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:VOEIOSAP3OCSJEYV4DVHLPTQ3E","short_pith_number":"pith:VOEIOSAP","schema_version":"1.0","canonical_sha256":"ab8887480fdb85249315e0ea75be70d93a7d5b8b985285a8123bf253f1719e8b","source":{"kind":"arxiv","id":"1011.0551","version":3},"attestation_state":"computed","paper":{"title":"Algorithmic Verification of Asynchronous Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Pierre Ganty, Rupak Majumdar","submitted_at":"2010-11-02T09:36:43Z","abstract_excerpt":"Asynchronous programming is a ubiquitous systems programming idiom to manage concurrent interactions with the environment. In this style, instead of waiting for time-consuming operations to complete, the programmer makes a non-blocking call to the operation and posts a callback task to a task buffer that is executed later when the time-consuming operation completes. A co-operative scheduler mediates the interaction by picking and executing callback tasks from the task buffer to completion (and these callbacks can post further callbacks to be executed later). Writing correct asynchronous progra"},"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":"1011.0551","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-11-02T09:36:43Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"4f3ea4185d3f28702460eb6a6f2b5ebffe91989dc7711067a6c6b5a5bc30f0a9","abstract_canon_sha256":"80ba4317a524bc928749901ce3cc71d8c7489a601f425b2ee734a88e7ca8db53"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:37.868991Z","signature_b64":"byCX21Xba4x/HjmkzPUeMu32PuU+b5BJv1If3n1fC51fiR7eWDICNXraUeWshSOkQXH8iOz09GLVGTz1vLA4CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab8887480fdb85249315e0ea75be70d93a7d5b8b985285a8123bf253f1719e8b","last_reissued_at":"2026-05-18T02:23:37.868306Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:37.868306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithmic Verification of Asynchronous Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Pierre Ganty, Rupak Majumdar","submitted_at":"2010-11-02T09:36:43Z","abstract_excerpt":"Asynchronous programming is a ubiquitous systems programming idiom to manage concurrent interactions with the environment. In this style, instead of waiting for time-consuming operations to complete, the programmer makes a non-blocking call to the operation and posts a callback task to a task buffer that is executed later when the time-consuming operation completes. A co-operative scheduler mediates the interaction by picking and executing callback tasks from the task buffer to completion (and these callbacks can post further callbacks to be executed later). Writing correct asynchronous progra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.0551","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":"1011.0551","created_at":"2026-05-18T02:23:37.868428+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.0551v3","created_at":"2026-05-18T02:23:37.868428+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.0551","created_at":"2026-05-18T02:23:37.868428+00:00"},{"alias_kind":"pith_short_12","alias_value":"VOEIOSAP3OCS","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"VOEIOSAP3OCSJEYV","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"VOEIOSAP","created_at":"2026-05-18T12:26:15.391820+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/VOEIOSAP3OCSJEYV4DVHLPTQ3E","json":"https://pith.science/pith/VOEIOSAP3OCSJEYV4DVHLPTQ3E.json","graph_json":"https://pith.science/api/pith-number/VOEIOSAP3OCSJEYV4DVHLPTQ3E/graph.json","events_json":"https://pith.science/api/pith-number/VOEIOSAP3OCSJEYV4DVHLPTQ3E/events.json","paper":"https://pith.science/paper/VOEIOSAP"},"agent_actions":{"view_html":"https://pith.science/pith/VOEIOSAP3OCSJEYV4DVHLPTQ3E","download_json":"https://pith.science/pith/VOEIOSAP3OCSJEYV4DVHLPTQ3E.json","view_paper":"https://pith.science/paper/VOEIOSAP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.0551&json=true","fetch_graph":"https://pith.science/api/pith-number/VOEIOSAP3OCSJEYV4DVHLPTQ3E/graph.json","fetch_events":"https://pith.science/api/pith-number/VOEIOSAP3OCSJEYV4DVHLPTQ3E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VOEIOSAP3OCSJEYV4DVHLPTQ3E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VOEIOSAP3OCSJEYV4DVHLPTQ3E/action/storage_attestation","attest_author":"https://pith.science/pith/VOEIOSAP3OCSJEYV4DVHLPTQ3E/action/author_attestation","sign_citation":"https://pith.science/pith/VOEIOSAP3OCSJEYV4DVHLPTQ3E/action/citation_signature","submit_replication":"https://pith.science/pith/VOEIOSAP3OCSJEYV4DVHLPTQ3E/action/replication_record"}},"created_at":"2026-05-18T02:23:37.868428+00:00","updated_at":"2026-05-18T02:23:37.868428+00:00"}