{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DGPDR6WU4XEQS5NG3RAI6QVB4F","short_pith_number":"pith:DGPDR6WU","schema_version":"1.0","canonical_sha256":"199e38fad4e5c90975a6dc408f42a1e17d943bd91d2f4e75d30fe9a338aad297","source":{"kind":"arxiv","id":"1611.09067","version":3},"attestation_state":"computed","paper":{"title":"Dynamic Choreographies: Theory And Implementation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Ivan Lanese, Jacopo Mauro, Maurizio Gabbrielli, Mila Dalla Preda, Saverio Giallorenzo","submitted_at":"2016-11-28T11:04:47Z","abstract_excerpt":"Programming distributed applications free from communication deadlocks and race conditions is complex. Preserving these properties when applications are updated at runtime is even harder. We present a choreographic approach for programming updatable, distributed applications. We define a choreography language, called Dynamic Interaction-Oriented Choreography (AIOC), that allows the programmer to specify, from a global viewpoint, which parts of the application can be updated. At runtime, these parts may be replaced by new AIOC fragments from outside the application. AIOC programs are compiled, "},"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":"1611.09067","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-11-28T11:04:47Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"4b363721c6ee8ce5cd2b1491a5edbd5e36f963be7e0b8ee4661baacf01861b6a","abstract_canon_sha256":"6e24f84502c0ab99aa56905a04a074334a05d9716c4809d54cf1d6b637558ff6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:21.736742Z","signature_b64":"0gqt5V7NIkUAxr34imn2pVI2RiidvLtBrS8xNvGC8FpILLnm5U5M5r9kYdn0FB18OWMmmZNg19pfSeCITsTNCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"199e38fad4e5c90975a6dc408f42a1e17d943bd91d2f4e75d30fe9a338aad297","last_reissued_at":"2026-05-17T23:51:21.736368Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:21.736368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Choreographies: Theory And Implementation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Ivan Lanese, Jacopo Mauro, Maurizio Gabbrielli, Mila Dalla Preda, Saverio Giallorenzo","submitted_at":"2016-11-28T11:04:47Z","abstract_excerpt":"Programming distributed applications free from communication deadlocks and race conditions is complex. Preserving these properties when applications are updated at runtime is even harder. We present a choreographic approach for programming updatable, distributed applications. We define a choreography language, called Dynamic Interaction-Oriented Choreography (AIOC), that allows the programmer to specify, from a global viewpoint, which parts of the application can be updated. At runtime, these parts may be replaced by new AIOC fragments from outside the application. AIOC programs are compiled, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09067","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":"1611.09067","created_at":"2026-05-17T23:51:21.736426+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.09067v3","created_at":"2026-05-17T23:51:21.736426+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09067","created_at":"2026-05-17T23:51:21.736426+00:00"},{"alias_kind":"pith_short_12","alias_value":"DGPDR6WU4XEQ","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DGPDR6WU4XEQS5NG","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DGPDR6WU","created_at":"2026-05-18T12:30:12.583610+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/DGPDR6WU4XEQS5NG3RAI6QVB4F","json":"https://pith.science/pith/DGPDR6WU4XEQS5NG3RAI6QVB4F.json","graph_json":"https://pith.science/api/pith-number/DGPDR6WU4XEQS5NG3RAI6QVB4F/graph.json","events_json":"https://pith.science/api/pith-number/DGPDR6WU4XEQS5NG3RAI6QVB4F/events.json","paper":"https://pith.science/paper/DGPDR6WU"},"agent_actions":{"view_html":"https://pith.science/pith/DGPDR6WU4XEQS5NG3RAI6QVB4F","download_json":"https://pith.science/pith/DGPDR6WU4XEQS5NG3RAI6QVB4F.json","view_paper":"https://pith.science/paper/DGPDR6WU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.09067&json=true","fetch_graph":"https://pith.science/api/pith-number/DGPDR6WU4XEQS5NG3RAI6QVB4F/graph.json","fetch_events":"https://pith.science/api/pith-number/DGPDR6WU4XEQS5NG3RAI6QVB4F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DGPDR6WU4XEQS5NG3RAI6QVB4F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DGPDR6WU4XEQS5NG3RAI6QVB4F/action/storage_attestation","attest_author":"https://pith.science/pith/DGPDR6WU4XEQS5NG3RAI6QVB4F/action/author_attestation","sign_citation":"https://pith.science/pith/DGPDR6WU4XEQS5NG3RAI6QVB4F/action/citation_signature","submit_replication":"https://pith.science/pith/DGPDR6WU4XEQS5NG3RAI6QVB4F/action/replication_record"}},"created_at":"2026-05-17T23:51:21.736426+00:00","updated_at":"2026-05-17T23:51:21.736426+00:00"}