{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:EDF36ACSHOAW3NX4KTPLWDKEQT","short_pith_number":"pith:EDF36ACS","schema_version":"1.0","canonical_sha256":"20cbbf00523b816db6fc54debb0d4484d2f915620621314b1a4b868f8f254d81","source":{"kind":"arxiv","id":"2605.21385","version":1},"attestation_state":"computed","paper":{"title":"Verification of Configurable SRA Systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Alberto Griggio, Alessandro Cimatti, Christian Lidstr\\\"om, Dylan Trenti, Gianluca Redondi","submitted_at":"2026-05-20T16:43:15Z","abstract_excerpt":"Many digital systems are designed as collections of asynchronous processes orchestrated by a domain-specific scheduler. The verification of such scheduler-restricted asynchronous systems (SRA) is challenging due to process-process and process-scheduler interactions. In this paper, we tackle the problem of verifying configurable SRA. A configurable SRA describes an unbounded family of possible SRA, each resulting from an instantiation satisfying given configuration constraints; our goal is proving at once that every legal instantiation of a configurable SRA is correct. We propose a contract-bas"},"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":"2605.21385","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-20T16:43:15Z","cross_cats_sorted":[],"title_canon_sha256":"fb765a85e5a16125e94045e733f7231bd9051a5cb877ca3383f0352c04038637","abstract_canon_sha256":"08f853372531c0c99a4608103e750e3ae8c2884d0e3d676cf928b9cbbe95072b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T02:05:32.170774Z","signature_b64":"DhcDmCpBwJky/M+jQ9zK2oQv0MQ1YFuFNoTPvYnO4ocYAcGtK5XALAEbkEfpDLBkHYUxZECa8JscBfU3oswvCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20cbbf00523b816db6fc54debb0d4484d2f915620621314b1a4b868f8f254d81","last_reissued_at":"2026-05-21T02:05:32.170061Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T02:05:32.170061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Verification of Configurable SRA Systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Alberto Griggio, Alessandro Cimatti, Christian Lidstr\\\"om, Dylan Trenti, Gianluca Redondi","submitted_at":"2026-05-20T16:43:15Z","abstract_excerpt":"Many digital systems are designed as collections of asynchronous processes orchestrated by a domain-specific scheduler. The verification of such scheduler-restricted asynchronous systems (SRA) is challenging due to process-process and process-scheduler interactions. In this paper, we tackle the problem of verifying configurable SRA. A configurable SRA describes an unbounded family of possible SRA, each resulting from an instantiation satisfying given configuration constraints; our goal is proving at once that every legal instantiation of a configurable SRA is correct. We propose a contract-bas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.21385","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.21385/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2605.21385","created_at":"2026-05-21T02:05:32.170180+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.21385v1","created_at":"2026-05-21T02:05:32.170180+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.21385","created_at":"2026-05-21T02:05:32.170180+00:00"},{"alias_kind":"pith_short_12","alias_value":"EDF36ACSHOAW","created_at":"2026-05-21T02:05:32.170180+00:00"},{"alias_kind":"pith_short_16","alias_value":"EDF36ACSHOAW3NX4","created_at":"2026-05-21T02:05:32.170180+00:00"},{"alias_kind":"pith_short_8","alias_value":"EDF36ACS","created_at":"2026-05-21T02:05:32.170180+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/EDF36ACSHOAW3NX4KTPLWDKEQT","json":"https://pith.science/pith/EDF36ACSHOAW3NX4KTPLWDKEQT.json","graph_json":"https://pith.science/api/pith-number/EDF36ACSHOAW3NX4KTPLWDKEQT/graph.json","events_json":"https://pith.science/api/pith-number/EDF36ACSHOAW3NX4KTPLWDKEQT/events.json","paper":"https://pith.science/paper/EDF36ACS"},"agent_actions":{"view_html":"https://pith.science/pith/EDF36ACSHOAW3NX4KTPLWDKEQT","download_json":"https://pith.science/pith/EDF36ACSHOAW3NX4KTPLWDKEQT.json","view_paper":"https://pith.science/paper/EDF36ACS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.21385&json=true","fetch_graph":"https://pith.science/api/pith-number/EDF36ACSHOAW3NX4KTPLWDKEQT/graph.json","fetch_events":"https://pith.science/api/pith-number/EDF36ACSHOAW3NX4KTPLWDKEQT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EDF36ACSHOAW3NX4KTPLWDKEQT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EDF36ACSHOAW3NX4KTPLWDKEQT/action/storage_attestation","attest_author":"https://pith.science/pith/EDF36ACSHOAW3NX4KTPLWDKEQT/action/author_attestation","sign_citation":"https://pith.science/pith/EDF36ACSHOAW3NX4KTPLWDKEQT/action/citation_signature","submit_replication":"https://pith.science/pith/EDF36ACSHOAW3NX4KTPLWDKEQT/action/replication_record"}},"created_at":"2026-05-21T02:05:32.170180+00:00","updated_at":"2026-05-21T02:05:32.170180+00:00"}