{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:KH2GFG5HWHYZWENU7TLVPUSYJU","short_pith_number":"pith:KH2GFG5H","schema_version":"1.0","canonical_sha256":"51f4629ba7b1f19b11b4fcd757d2584d2115b065aeb72949d6846a5a05c93b2d","source":{"kind":"arxiv","id":"1309.4416","version":1},"attestation_state":"computed","paper":{"title":"Specifying Robustness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"John C. McCabe-Dansted, Mark Reynolds, Sophie Pinchinat, Tim French","submitted_at":"2013-09-14T03:39:10Z","abstract_excerpt":"This paper proposes a new logic RoCTL* to model robustness in concurrent systems. RoCTL* extends CTL* with the addition of Obligatory and Robustly operators, which quantify over failure-free paths and paths with one more failure respectively. We present a number of examples of problems to which RoCTL* can be applied. The core result of this paper is to show that RoCTL* is expressively equivalent to CTL* but is non-elementarily more succinct. We present a translation from RoCTL* into CTL* that preserves truth but may result in non-elementary growth in the length of the translated formula as eac"},"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":"1309.4416","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-09-14T03:39:10Z","cross_cats_sorted":[],"title_canon_sha256":"01f3cee2d5b0fbe513819a235c8441a714a3bd26c79207569e0c4f1dc45b1621","abstract_canon_sha256":"cde842af2b19bdf54bcb6e2a9640d3716db2ac0fd806b9bdbffdcb03e907735c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:08.767570Z","signature_b64":"49Gpq1n6R+0ZJr3HD9FtWOXMgJqruwIEVzzEy78v/E8vxBtpdss/V9hdWMcbID1TjAM1ly8/LEi8/XrdW+5JCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51f4629ba7b1f19b11b4fcd757d2584d2115b065aeb72949d6846a5a05c93b2d","last_reissued_at":"2026-05-18T03:13:08.766630Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:08.766630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Specifying Robustness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"John C. McCabe-Dansted, Mark Reynolds, Sophie Pinchinat, Tim French","submitted_at":"2013-09-14T03:39:10Z","abstract_excerpt":"This paper proposes a new logic RoCTL* to model robustness in concurrent systems. RoCTL* extends CTL* with the addition of Obligatory and Robustly operators, which quantify over failure-free paths and paths with one more failure respectively. We present a number of examples of problems to which RoCTL* can be applied. The core result of this paper is to show that RoCTL* is expressively equivalent to CTL* but is non-elementarily more succinct. We present a translation from RoCTL* into CTL* that preserves truth but may result in non-elementary growth in the length of the translated formula as eac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.4416","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":""},"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":"1309.4416","created_at":"2026-05-18T03:13:08.766788+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.4416v1","created_at":"2026-05-18T03:13:08.766788+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.4416","created_at":"2026-05-18T03:13:08.766788+00:00"},{"alias_kind":"pith_short_12","alias_value":"KH2GFG5HWHYZ","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"KH2GFG5HWHYZWENU","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"KH2GFG5H","created_at":"2026-05-18T12:27:49.015174+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/KH2GFG5HWHYZWENU7TLVPUSYJU","json":"https://pith.science/pith/KH2GFG5HWHYZWENU7TLVPUSYJU.json","graph_json":"https://pith.science/api/pith-number/KH2GFG5HWHYZWENU7TLVPUSYJU/graph.json","events_json":"https://pith.science/api/pith-number/KH2GFG5HWHYZWENU7TLVPUSYJU/events.json","paper":"https://pith.science/paper/KH2GFG5H"},"agent_actions":{"view_html":"https://pith.science/pith/KH2GFG5HWHYZWENU7TLVPUSYJU","download_json":"https://pith.science/pith/KH2GFG5HWHYZWENU7TLVPUSYJU.json","view_paper":"https://pith.science/paper/KH2GFG5H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.4416&json=true","fetch_graph":"https://pith.science/api/pith-number/KH2GFG5HWHYZWENU7TLVPUSYJU/graph.json","fetch_events":"https://pith.science/api/pith-number/KH2GFG5HWHYZWENU7TLVPUSYJU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KH2GFG5HWHYZWENU7TLVPUSYJU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KH2GFG5HWHYZWENU7TLVPUSYJU/action/storage_attestation","attest_author":"https://pith.science/pith/KH2GFG5HWHYZWENU7TLVPUSYJU/action/author_attestation","sign_citation":"https://pith.science/pith/KH2GFG5HWHYZWENU7TLVPUSYJU/action/citation_signature","submit_replication":"https://pith.science/pith/KH2GFG5HWHYZWENU7TLVPUSYJU/action/replication_record"}},"created_at":"2026-05-18T03:13:08.766788+00:00","updated_at":"2026-05-18T03:13:08.766788+00:00"}