{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:MKDXAYM7I3G4AYSUPNMH2EARKZ","short_pith_number":"pith:MKDXAYM7","schema_version":"1.0","canonical_sha256":"628770619f46cdc062547b587d1011566a78f10623ac2caa8d4799321278fed0","source":{"kind":"arxiv","id":"1608.04592","version":2},"attestation_state":"computed","paper":{"title":"Data optimizations for constraint automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Farhad Arbab (Centrum Wiskunde, Informatica, Leiden University), Radboud University Nijmegen), Sung-Shik T.Q. Jongmans (Open University of the Netherlands","submitted_at":"2016-08-16T13:45:53Z","abstract_excerpt":"Constraint automata (CA) constitute a coordination model based on finite automata on infinite words. Originally introduced for modeling of coordinators, an interesting new application of CAs is implementing coordinators (i.e., compiling CAs into executable code). Such an approach guarantees correctness-by-construction and can even yield code that outperforms hand-crafted code. The extent to which these two potential advantages materialize depends on the smartness of CA-compilers and the existence of proofs of their correctness.\n  Every transition in a CA is labeled by a \"data constraint\" that "},"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":"1608.04592","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-08-16T13:45:53Z","cross_cats_sorted":[],"title_canon_sha256":"0ca053aa8b245b0742eafa402be3e83c1500562f3a0438ce5667c9b01409741e","abstract_canon_sha256":"1d21cf7d40ac74294073cefb155533c81bca1daea0203e361591bc4b343b7196"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:21.922313Z","signature_b64":"pGyuIOiG37yCIIjStr/wbjl1I35JoN7F1l7gpbSgutiRpEeifoA8bdaCBKP8Ua+MLW4JMuI+3QQTBZGfb1SyAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"628770619f46cdc062547b587d1011566a78f10623ac2caa8d4799321278fed0","last_reissued_at":"2026-05-17T23:51:21.921773Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:21.921773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Data optimizations for constraint automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Farhad Arbab (Centrum Wiskunde, Informatica, Leiden University), Radboud University Nijmegen), Sung-Shik T.Q. Jongmans (Open University of the Netherlands","submitted_at":"2016-08-16T13:45:53Z","abstract_excerpt":"Constraint automata (CA) constitute a coordination model based on finite automata on infinite words. Originally introduced for modeling of coordinators, an interesting new application of CAs is implementing coordinators (i.e., compiling CAs into executable code). Such an approach guarantees correctness-by-construction and can even yield code that outperforms hand-crafted code. The extent to which these two potential advantages materialize depends on the smartness of CA-compilers and the existence of proofs of their correctness.\n  Every transition in a CA is labeled by a \"data constraint\" that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.04592","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":"1608.04592","created_at":"2026-05-17T23:51:21.921852+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.04592v2","created_at":"2026-05-17T23:51:21.921852+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.04592","created_at":"2026-05-17T23:51:21.921852+00:00"},{"alias_kind":"pith_short_12","alias_value":"MKDXAYM7I3G4","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"MKDXAYM7I3G4AYSU","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"MKDXAYM7","created_at":"2026-05-18T12:30:32.724797+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/MKDXAYM7I3G4AYSUPNMH2EARKZ","json":"https://pith.science/pith/MKDXAYM7I3G4AYSUPNMH2EARKZ.json","graph_json":"https://pith.science/api/pith-number/MKDXAYM7I3G4AYSUPNMH2EARKZ/graph.json","events_json":"https://pith.science/api/pith-number/MKDXAYM7I3G4AYSUPNMH2EARKZ/events.json","paper":"https://pith.science/paper/MKDXAYM7"},"agent_actions":{"view_html":"https://pith.science/pith/MKDXAYM7I3G4AYSUPNMH2EARKZ","download_json":"https://pith.science/pith/MKDXAYM7I3G4AYSUPNMH2EARKZ.json","view_paper":"https://pith.science/paper/MKDXAYM7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.04592&json=true","fetch_graph":"https://pith.science/api/pith-number/MKDXAYM7I3G4AYSUPNMH2EARKZ/graph.json","fetch_events":"https://pith.science/api/pith-number/MKDXAYM7I3G4AYSUPNMH2EARKZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MKDXAYM7I3G4AYSUPNMH2EARKZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MKDXAYM7I3G4AYSUPNMH2EARKZ/action/storage_attestation","attest_author":"https://pith.science/pith/MKDXAYM7I3G4AYSUPNMH2EARKZ/action/author_attestation","sign_citation":"https://pith.science/pith/MKDXAYM7I3G4AYSUPNMH2EARKZ/action/citation_signature","submit_replication":"https://pith.science/pith/MKDXAYM7I3G4AYSUPNMH2EARKZ/action/replication_record"}},"created_at":"2026-05-17T23:51:21.921852+00:00","updated_at":"2026-05-17T23:51:21.921852+00:00"}