{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:SJHCXE6GYTZOUAVUM6CENLOGIY","short_pith_number":"pith:SJHCXE6G","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"},"canonical_sha256":"924e2b93c6c4f2ea02b4678446adc64602d06a044f7284f50214e7194d6d7a84","source":{"kind":"arxiv","id":"2608.12762","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.12762","created_at":"2026-08-14T00:47:35Z"},{"alias_kind":"arxiv_version","alias_value":"2608.12762v1","created_at":"2026-08-14T00:47:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.12762","created_at":"2026-08-14T00:47:35Z"},{"alias_kind":"pith_short_12","alias_value":"SJHCXE6GYTZO","created_at":"2026-08-14T00:47:35Z"},{"alias_kind":"pith_short_16","alias_value":"SJHCXE6GYTZOUAVU","created_at":"2026-08-14T00:47:35Z"},{"alias_kind":"pith_short_8","alias_value":"SJHCXE6G","created_at":"2026-08-14T00:47:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:SJHCXE6GYTZOUAVUM6CENLOGIY","target":"record","payload":{"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"},"canonical_sha256":"924e2b93c6c4f2ea02b4678446adc64602d06a044f7284f50214e7194d6d7a84","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"},"source_kind":"arxiv","source_id":"2608.12762","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-14T00:47:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DwM7cDT9ilC9nVEIVoOSSRAuoCv7P8QrYtoylul0bBBD4ZtLJdhmmYJWc2fhCsPIHSvGbWeJOJK+5e8xw+/vBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T13:26:20.848829Z"},"content_sha256":"996fac6a260ee1606cdf26a8966d6cfbd476ec67346ad6ba5081e2dec662a32c","schema_version":"1.0","event_id":"sha256:996fac6a260ee1606cdf26a8966d6cfbd476ec67346ad6ba5081e2dec662a32c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:SJHCXE6GYTZOUAVUM6CENLOGIY","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-14T00:47:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VqFbb0WPJGl4naSu0he+zN+PuR2rgYTjbtFAx+An+Wm2nxOeNbH0s3Typzc8oLrIEmSsdDLjPKga9WfjQxYPBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T13:26:20.849754Z"},"content_sha256":"91a24571a4e3ca99d8abff4a064bff1a2a5dfa77a91aeac8ab657d066e9c1eb7","schema_version":"1.0","event_id":"sha256:91a24571a4e3ca99d8abff4a064bff1a2a5dfa77a91aeac8ab657d066e9c1eb7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SJHCXE6GYTZOUAVUM6CENLOGIY/bundle.json","state_url":"https://pith.science/pith/SJHCXE6GYTZOUAVUM6CENLOGIY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SJHCXE6GYTZOUAVUM6CENLOGIY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-17T13:26:20Z","links":{"resolver":"https://pith.science/pith/SJHCXE6GYTZOUAVUM6CENLOGIY","bundle":"https://pith.science/pith/SJHCXE6GYTZOUAVUM6CENLOGIY/bundle.json","state":"https://pith.science/pith/SJHCXE6GYTZOUAVUM6CENLOGIY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SJHCXE6GYTZOUAVUM6CENLOGIY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:SJHCXE6GYTZOUAVUM6CENLOGIY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"91129bb0f443461fc1423010f548c1728a90e0c9db397f088f9b339a0c9bbecd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-08-13T03:12:17Z","title_canon_sha256":"83a33a43036365f2a33c526b04d6bc325eb8c926287ae7bcfe7422b0624fd117"},"schema_version":"1.0","source":{"id":"2608.12762","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.12762","created_at":"2026-08-14T00:47:35Z"},{"alias_kind":"arxiv_version","alias_value":"2608.12762v1","created_at":"2026-08-14T00:47:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.12762","created_at":"2026-08-14T00:47:35Z"},{"alias_kind":"pith_short_12","alias_value":"SJHCXE6GYTZO","created_at":"2026-08-14T00:47:35Z"},{"alias_kind":"pith_short_16","alias_value":"SJHCXE6GYTZOUAVU","created_at":"2026-08-14T00:47:35Z"},{"alias_kind":"pith_short_8","alias_value":"SJHCXE6G","created_at":"2026-08-14T00:47:35Z"}],"graph_snapshots":[{"event_id":"sha256:91a24571a4e3ca99d8abff4a064bff1a2a5dfa77a91aeac8ab657d066e9c1eb7","target":"graph","created_at":"2026-08-14T00:47:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2608.12762/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Abdullah Al Arafat, Sadat Shahriyar, Shareef Ahmed","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-08-13T03:12:17Z","title":"PROVE-RT: Generating Mechanized Theorem Prover Scripts for Real-Time Systems using LLMs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.12762","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:996fac6a260ee1606cdf26a8966d6cfbd476ec67346ad6ba5081e2dec662a32c","target":"record","created_at":"2026-08-14T00:47:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"91129bb0f443461fc1423010f548c1728a90e0c9db397f088f9b339a0c9bbecd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-08-13T03:12:17Z","title_canon_sha256":"83a33a43036365f2a33c526b04d6bc325eb8c926287ae7bcfe7422b0624fd117"},"schema_version":"1.0","source":{"id":"2608.12762","kind":"arxiv","version":1}},"canonical_sha256":"924e2b93c6c4f2ea02b4678446adc64602d06a044f7284f50214e7194d6d7a84","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"924e2b93c6c4f2ea02b4678446adc64602d06a044f7284f50214e7194d6d7a84","first_computed_at":"2026-08-14T00:47:35.922862Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-14T00:47:35.922862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JTKrsUTtL1Y3j3Sw4Zbzu07a+Y1KkNhVxEH5TOWPxAN+9NDLoTqUrg0D9Je23Ioh6KXeEXlb7bKg9hEexqlNDg==","signature_status":"signed_v1","signed_at":"2026-08-14T00:47:35.926875Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.12762","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:996fac6a260ee1606cdf26a8966d6cfbd476ec67346ad6ba5081e2dec662a32c","sha256:91a24571a4e3ca99d8abff4a064bff1a2a5dfa77a91aeac8ab657d066e9c1eb7"],"state_sha256":"93362215d32680b3ec08c6e3cf893e1b28b9f56005de2a2cf38eb694bac4a74b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xRM83y2Tb7nEvExEJHGNAeyAHLTS6LEuO+pfZM3UIVBKBKg/CkOsCTg8y7nxHu2LCGtVffcOGKZ86rgubormCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T13:26:20.856607Z","bundle_sha256":"e47e8b7a65b5752147212826d8c463882c557d44b4f4169abeff47fe61b30848"}}