{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:NKPLBY2ETKGSYE4X6FH3TJ6PUI","short_pith_number":"pith:NKPLBY2E","schema_version":"1.0","canonical_sha256":"6a9eb0e3449a8d2c1397f14fb9a7cfa218f0ba93ca603f46522f5170bec0cd1e","source":{"kind":"arxiv","id":"2501.13002","version":1},"attestation_state":"computed","paper":{"title":"Constructive characterisations of the must-preorder for asynchrony","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Giovanni Bernardi, Ilaria Castellani, L\\'eo Stefanesco, Paul Laforgue","submitted_at":"2025-01-22T16:42:03Z","abstract_excerpt":"De Nicola and Hennessy's must-preorder is a contextual refinement which states that a server q refines a server p if all clients satisfied by p are also satisfied by q. Owing to the universal quantification over clients, this definition does not yield a practical proof method for the must-preorder, and alternative characterisations are necessary to reason over it. Finding these characterisations for asynchronous semantics, i.e. where outputs are non-blocking, has thus far proven to be a challenge, usually tackled via ad-hoc definitions. We show that the standard characterisations of the must-p"},"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":"2501.13002","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2025-01-22T16:42:03Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"f14a872eacc289fba4b6c55d8ee4cc84a041829a913f8096c32064fda10b3d4d","abstract_canon_sha256":"233a499d1477d14c8a58acc347fb5a66b697bb575764c6485bbd54ed5eb998a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:04:01.616729Z","signature_b64":"TMhYHqHM+ugkGxqpiogS3RxbOnMxldN9mxBLmw0ZnJEOYPdCHUylqGQO57jHZNQnYT9YNVMp5J7+DpV2zmw7BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a9eb0e3449a8d2c1397f14fb9a7cfa218f0ba93ca603f46522f5170bec0cd1e","last_reissued_at":"2026-07-05T10:04:01.616204Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:04:01.616204Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constructive characterisations of the must-preorder for asynchrony","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Giovanni Bernardi, Ilaria Castellani, L\\'eo Stefanesco, Paul Laforgue","submitted_at":"2025-01-22T16:42:03Z","abstract_excerpt":"De Nicola and Hennessy's must-preorder is a contextual refinement which states that a server q refines a server p if all clients satisfied by p are also satisfied by q. Owing to the universal quantification over clients, this definition does not yield a practical proof method for the must-preorder, and alternative characterisations are necessary to reason over it. Finding these characterisations for asynchronous semantics, i.e. where outputs are non-blocking, has thus far proven to be a challenge, usually tackled via ad-hoc definitions. We show that the standard characterisations of the must-p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.13002","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/2501.13002/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":"2501.13002","created_at":"2026-07-05T10:04:01.616262+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.13002v1","created_at":"2026-07-05T10:04:01.616262+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.13002","created_at":"2026-07-05T10:04:01.616262+00:00"},{"alias_kind":"pith_short_12","alias_value":"NKPLBY2ETKGS","created_at":"2026-07-05T10:04:01.616262+00:00"},{"alias_kind":"pith_short_16","alias_value":"NKPLBY2ETKGSYE4X","created_at":"2026-07-05T10:04:01.616262+00:00"},{"alias_kind":"pith_short_8","alias_value":"NKPLBY2E","created_at":"2026-07-05T10:04:01.616262+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/NKPLBY2ETKGSYE4X6FH3TJ6PUI","json":"https://pith.science/pith/NKPLBY2ETKGSYE4X6FH3TJ6PUI.json","graph_json":"https://pith.science/api/pith-number/NKPLBY2ETKGSYE4X6FH3TJ6PUI/graph.json","events_json":"https://pith.science/api/pith-number/NKPLBY2ETKGSYE4X6FH3TJ6PUI/events.json","paper":"https://pith.science/paper/NKPLBY2E"},"agent_actions":{"view_html":"https://pith.science/pith/NKPLBY2ETKGSYE4X6FH3TJ6PUI","download_json":"https://pith.science/pith/NKPLBY2ETKGSYE4X6FH3TJ6PUI.json","view_paper":"https://pith.science/paper/NKPLBY2E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.13002&json=true","fetch_graph":"https://pith.science/api/pith-number/NKPLBY2ETKGSYE4X6FH3TJ6PUI/graph.json","fetch_events":"https://pith.science/api/pith-number/NKPLBY2ETKGSYE4X6FH3TJ6PUI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NKPLBY2ETKGSYE4X6FH3TJ6PUI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NKPLBY2ETKGSYE4X6FH3TJ6PUI/action/storage_attestation","attest_author":"https://pith.science/pith/NKPLBY2ETKGSYE4X6FH3TJ6PUI/action/author_attestation","sign_citation":"https://pith.science/pith/NKPLBY2ETKGSYE4X6FH3TJ6PUI/action/citation_signature","submit_replication":"https://pith.science/pith/NKPLBY2ETKGSYE4X6FH3TJ6PUI/action/replication_record"}},"created_at":"2026-07-05T10:04:01.616262+00:00","updated_at":"2026-07-05T10:04:01.616262+00:00"}