{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:SJHCXE6GYTZOUAVUM6CENLOGIY","short_pith_number":"pith:SJHCXE6G","schema_version":"1.0","canonical_sha256":"924e2b93c6c4f2ea02b4678446adc64602d06a044f7284f50214e7194d6d7a84","source":{"kind":"arxiv","id":"2608.12762","version":1},"attestation_state":"computed","paper":{"title":"PROVE-RT: Generating Mechanized Theorem Prover Scripts for Real-Time Systems using LLMs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Abdullah Al Arafat, Sadat Shahriyar, Shareef Ahmed","submitted_at":"2026-08-13T03:12:17Z","abstract_excerpt":"Schedulability analysis is essential for certifying real-time systems, but existing tests are often developed through pen-and-paper proofs that are difficult to scale, validate, and maintain. Mechanized verification in PROSA/ROCQ offers a rigorous alternative, yet manually constructing such proofs requires substantial domain expertise and proof-engineering effort. Recent successes of large language models (LLMs) across a wide range of tasks make them promising candidates for generating PROSA/ROCQ scripts for mechanized theorem provers. However, state-of-the-art LLMs often lack the PROSA-specif"},"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":"2608.12762","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-08-13T03:12:17Z","cross_cats_sorted":[],"title_canon_sha256":"83a33a43036365f2a33c526b04d6bc325eb8c926287ae7bcfe7422b0624fd117","abstract_canon_sha256":"91129bb0f443461fc1423010f548c1728a90e0c9db397f088f9b339a0c9bbecd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-14T00:47:35.926875Z","signature_b64":"JTKrsUTtL1Y3j3Sw4Zbzu07a+Y1KkNhVxEH5TOWPxAN+9NDLoTqUrg0D9Je23Ioh6KXeEXlb7bKg9hEexqlNDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"924e2b93c6c4f2ea02b4678446adc64602d06a044f7284f50214e7194d6d7a84","last_reissued_at":"2026-08-14T00:47:35.922862Z","signature_status":"signed_v1","first_computed_at":"2026-08-14T00:47:35.922862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PROVE-RT: Generating Mechanized Theorem Prover Scripts for Real-Time Systems using LLMs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Abdullah Al Arafat, Sadat Shahriyar, Shareef Ahmed","submitted_at":"2026-08-13T03:12:17Z","abstract_excerpt":"Schedulability analysis is essential for certifying real-time systems, but existing tests are often developed through pen-and-paper proofs that are difficult to scale, validate, and maintain. Mechanized verification in PROSA/ROCQ offers a rigorous alternative, yet manually constructing such proofs requires substantial domain expertise and proof-engineering effort. Recent successes of large language models (LLMs) across a wide range of tasks make them promising candidates for generating PROSA/ROCQ scripts for mechanized theorem provers. However, state-of-the-art LLMs often lack the PROSA-specif"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.12762","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/2608.12762/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":"2608.12762","created_at":"2026-08-14T00:47:35.925685+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.12762v1","created_at":"2026-08-14T00:47:35.925685+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.12762","created_at":"2026-08-14T00:47:35.925685+00:00"},{"alias_kind":"pith_short_12","alias_value":"SJHCXE6GYTZO","created_at":"2026-08-14T00:47:35.925685+00:00"},{"alias_kind":"pith_short_16","alias_value":"SJHCXE6GYTZOUAVU","created_at":"2026-08-14T00:47:35.925685+00:00"},{"alias_kind":"pith_short_8","alias_value":"SJHCXE6G","created_at":"2026-08-14T00:47:35.925685+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/SJHCXE6GYTZOUAVUM6CENLOGIY","json":"https://pith.science/pith/SJHCXE6GYTZOUAVUM6CENLOGIY.json","graph_json":"https://pith.science/api/pith-number/SJHCXE6GYTZOUAVUM6CENLOGIY/graph.json","events_json":"https://pith.science/api/pith-number/SJHCXE6GYTZOUAVUM6CENLOGIY/events.json","paper":"https://pith.science/paper/SJHCXE6G"},"agent_actions":{"view_html":"https://pith.science/pith/SJHCXE6GYTZOUAVUM6CENLOGIY","download_json":"https://pith.science/pith/SJHCXE6GYTZOUAVUM6CENLOGIY.json","view_paper":"https://pith.science/paper/SJHCXE6G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.12762&json=true","fetch_graph":"https://pith.science/api/pith-number/SJHCXE6GYTZOUAVUM6CENLOGIY/graph.json","fetch_events":"https://pith.science/api/pith-number/SJHCXE6GYTZOUAVUM6CENLOGIY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SJHCXE6GYTZOUAVUM6CENLOGIY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SJHCXE6GYTZOUAVUM6CENLOGIY/action/storage_attestation","attest_author":"https://pith.science/pith/SJHCXE6GYTZOUAVUM6CENLOGIY/action/author_attestation","sign_citation":"https://pith.science/pith/SJHCXE6GYTZOUAVUM6CENLOGIY/action/citation_signature","submit_replication":"https://pith.science/pith/SJHCXE6GYTZOUAVUM6CENLOGIY/action/replication_record"}},"created_at":"2026-08-14T00:47:35.925685+00:00","updated_at":"2026-08-14T00:47:35.925685+00:00"}