{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:UJLHCE7KDTQXRO5CADUPT43FSY","short_pith_number":"pith:UJLHCE7K","schema_version":"1.0","canonical_sha256":"a2567113ea1ce178bba200e8f9f365961fdb3f9f7c2fc0839ce9da9c06872e82","source":{"kind":"arxiv","id":"1510.03271","version":3},"attestation_state":"computed","paper":{"title":"A Core Model for Choreographic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Fabrizio Montesi, Lu\\'is Cruz-Filipe","submitted_at":"2015-10-12T13:09:58Z","abstract_excerpt":"Choreographic Programming is a programming paradigm for building concurrent programs that are deadlock-free by construction, as a result of programming communications declaratively and then synthesising process implementations automatically. Despite strong interest on choreographies, a foundational model that explains which computations can be performed with the hallmark constructs of choreographies is still missing.\n  In this work, we introduce Core Choreographies (CC), a model that includes only the core primitives of choreographic programming. Every computable function can be implemented as"},"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":"1510.03271","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-10-12T13:09:58Z","cross_cats_sorted":[],"title_canon_sha256":"f368c21a45063b8cea110983028b1a2f77410ccfd5a64c96c9e0caa5a1bd677c","abstract_canon_sha256":"2cdf5e194df0349e70216478197c850a3ab2a17fe73083b95a4d3faca99a5a75"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:50.605946Z","signature_b64":"KI0HKd6uzDnlNhzgXd1TcJTOkw8a5jCNSqUjm/GvyJofFMJa5qKw2l4WFPe3/4RtiW1nXRQi/0bj8ArUfxM4Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2567113ea1ce178bba200e8f9f365961fdb3f9f7c2fc0839ce9da9c06872e82","last_reissued_at":"2026-05-18T00:03:50.605452Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:50.605452Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Core Model for Choreographic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Fabrizio Montesi, Lu\\'is Cruz-Filipe","submitted_at":"2015-10-12T13:09:58Z","abstract_excerpt":"Choreographic Programming is a programming paradigm for building concurrent programs that are deadlock-free by construction, as a result of programming communications declaratively and then synthesising process implementations automatically. Despite strong interest on choreographies, a foundational model that explains which computations can be performed with the hallmark constructs of choreographies is still missing.\n  In this work, we introduce Core Choreographies (CC), a model that includes only the core primitives of choreographic programming. Every computable function can be implemented as"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.03271","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":"1510.03271","created_at":"2026-05-18T00:03:50.605533+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.03271v3","created_at":"2026-05-18T00:03:50.605533+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03271","created_at":"2026-05-18T00:03:50.605533+00:00"},{"alias_kind":"pith_short_12","alias_value":"UJLHCE7KDTQX","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"UJLHCE7KDTQXRO5C","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"UJLHCE7K","created_at":"2026-05-18T12:29:44.643036+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/UJLHCE7KDTQXRO5CADUPT43FSY","json":"https://pith.science/pith/UJLHCE7KDTQXRO5CADUPT43FSY.json","graph_json":"https://pith.science/api/pith-number/UJLHCE7KDTQXRO5CADUPT43FSY/graph.json","events_json":"https://pith.science/api/pith-number/UJLHCE7KDTQXRO5CADUPT43FSY/events.json","paper":"https://pith.science/paper/UJLHCE7K"},"agent_actions":{"view_html":"https://pith.science/pith/UJLHCE7KDTQXRO5CADUPT43FSY","download_json":"https://pith.science/pith/UJLHCE7KDTQXRO5CADUPT43FSY.json","view_paper":"https://pith.science/paper/UJLHCE7K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.03271&json=true","fetch_graph":"https://pith.science/api/pith-number/UJLHCE7KDTQXRO5CADUPT43FSY/graph.json","fetch_events":"https://pith.science/api/pith-number/UJLHCE7KDTQXRO5CADUPT43FSY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UJLHCE7KDTQXRO5CADUPT43FSY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UJLHCE7KDTQXRO5CADUPT43FSY/action/storage_attestation","attest_author":"https://pith.science/pith/UJLHCE7KDTQXRO5CADUPT43FSY/action/author_attestation","sign_citation":"https://pith.science/pith/UJLHCE7KDTQXRO5CADUPT43FSY/action/citation_signature","submit_replication":"https://pith.science/pith/UJLHCE7KDTQXRO5CADUPT43FSY/action/replication_record"}},"created_at":"2026-05-18T00:03:50.605533+00:00","updated_at":"2026-05-18T00:03:50.605533+00:00"}