{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:TFPA5RCUQAIUNY3CLAIZT5CIWM","short_pith_number":"pith:TFPA5RCU","canonical_record":{"source":{"id":"2505.23311","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2025-05-29T10:11:42Z","cross_cats_sorted":["cs.AR","cs.SC"],"title_canon_sha256":"f7f203521578a373d1cca1981d52045d45d2dd44ae1de9bbb48e4f2a01af5109","abstract_canon_sha256":"d34594b8d1ecbb2bd99fe56eea487455aadd20ebbcab8ff44bd5b9f219e1f06f"},"schema_version":"1.0"},"canonical_sha256":"995e0ec454801146e362581199f448b308442ad9a7f8fe2b60d38f15afaf4ee5","source":{"kind":"arxiv","id":"2505.23311","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.23311","created_at":"2026-07-05T11:11:59Z"},{"alias_kind":"arxiv_version","alias_value":"2505.23311v1","created_at":"2026-07-05T11:11:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.23311","created_at":"2026-07-05T11:11:59Z"},{"alias_kind":"pith_short_12","alias_value":"TFPA5RCUQAIU","created_at":"2026-07-05T11:11:59Z"},{"alias_kind":"pith_short_16","alias_value":"TFPA5RCUQAIUNY3C","created_at":"2026-07-05T11:11:59Z"},{"alias_kind":"pith_short_8","alias_value":"TFPA5RCU","created_at":"2026-07-05T11:11:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:TFPA5RCUQAIUNY3CLAIZT5CIWM","target":"record","payload":{"canonical_record":{"source":{"id":"2505.23311","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2025-05-29T10:11:42Z","cross_cats_sorted":["cs.AR","cs.SC"],"title_canon_sha256":"f7f203521578a373d1cca1981d52045d45d2dd44ae1de9bbb48e4f2a01af5109","abstract_canon_sha256":"d34594b8d1ecbb2bd99fe56eea487455aadd20ebbcab8ff44bd5b9f219e1f06f"},"schema_version":"1.0"},"canonical_sha256":"995e0ec454801146e362581199f448b308442ad9a7f8fe2b60d38f15afaf4ee5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:11:59.299400Z","signature_b64":"sds5eFaemJEJGJIYodjYUFpWKQBMEEcD/UXi8Chb+ezuQOU4Mum5YsysnjXk18/sEdQwTrDgLNsAsQCEp6pqAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"995e0ec454801146e362581199f448b308442ad9a7f8fe2b60d38f15afaf4ee5","last_reissued_at":"2026-07-05T11:11:59.298929Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:11:59.298929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.23311","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-07-05T11:11:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0FF4qQAnJ9gsYoVl+brJF6Wgt8PG25wIH59VTehyqeESLxRKbZAfQ8VxZNS1UZKMlt0dbJZPlwGrlTDcNHedBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T08:43:59.226314Z"},"content_sha256":"0b0e3463ce96548f53d9aa0d68c63b8f4eeb71b45d47128f2bd74c802328ff1f","schema_version":"1.0","event_id":"sha256:0b0e3463ce96548f53d9aa0d68c63b8f4eeb71b45d47128f2bd74c802328ff1f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:TFPA5RCUQAIUNY3CLAIZT5CIWM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards LLM-based Generation of Human-Readable Proofs in Polynomial Formal Verification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR","cs.SC"],"primary_cat":"cs.LO","authors_text":"Rolf Drechsler","submitted_at":"2025-05-29T10:11:42Z","abstract_excerpt":"Verification is one of the central tasks in circuit and system design. While simulation and emulation are widely used, complete correctness can only be ensured based on formal proof techniques. But these approaches often have very high run time and memory requirements. Recently, Polynomial Formal Verification (PFV) has been introduced showing that for many instances of practical relevance upper bounds on needed resources can be given. But proofs have to be provided that are human-readable.\n  Here, we study how modern approaches from Artificial Intelligence (AI) based on Large Language Models ("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.23311","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/2505.23311/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-07-05T11:11:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O6cMzcRBuMafbSODy+zZK0gj3nyxZIkPqBtu8Jn6a6ynLe7/psBEyPKEjm7uqXOo7iXWJyoyUYAGqTmXPOAZDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T08:43:59.226874Z"},"content_sha256":"28592d0bad9b402a4833d73d2e415c62b2585347e2040ae91ded0c0acb469b7f","schema_version":"1.0","event_id":"sha256:28592d0bad9b402a4833d73d2e415c62b2585347e2040ae91ded0c0acb469b7f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TFPA5RCUQAIUNY3CLAIZT5CIWM/bundle.json","state_url":"https://pith.science/pith/TFPA5RCUQAIUNY3CLAIZT5CIWM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TFPA5RCUQAIUNY3CLAIZT5CIWM/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-08T08:43:59Z","links":{"resolver":"https://pith.science/pith/TFPA5RCUQAIUNY3CLAIZT5CIWM","bundle":"https://pith.science/pith/TFPA5RCUQAIUNY3CLAIZT5CIWM/bundle.json","state":"https://pith.science/pith/TFPA5RCUQAIUNY3CLAIZT5CIWM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TFPA5RCUQAIUNY3CLAIZT5CIWM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:TFPA5RCUQAIUNY3CLAIZT5CIWM","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":"d34594b8d1ecbb2bd99fe56eea487455aadd20ebbcab8ff44bd5b9f219e1f06f","cross_cats_sorted":["cs.AR","cs.SC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2025-05-29T10:11:42Z","title_canon_sha256":"f7f203521578a373d1cca1981d52045d45d2dd44ae1de9bbb48e4f2a01af5109"},"schema_version":"1.0","source":{"id":"2505.23311","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.23311","created_at":"2026-07-05T11:11:59Z"},{"alias_kind":"arxiv_version","alias_value":"2505.23311v1","created_at":"2026-07-05T11:11:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.23311","created_at":"2026-07-05T11:11:59Z"},{"alias_kind":"pith_short_12","alias_value":"TFPA5RCUQAIU","created_at":"2026-07-05T11:11:59Z"},{"alias_kind":"pith_short_16","alias_value":"TFPA5RCUQAIUNY3C","created_at":"2026-07-05T11:11:59Z"},{"alias_kind":"pith_short_8","alias_value":"TFPA5RCU","created_at":"2026-07-05T11:11:59Z"}],"graph_snapshots":[{"event_id":"sha256:28592d0bad9b402a4833d73d2e415c62b2585347e2040ae91ded0c0acb469b7f","target":"graph","created_at":"2026-07-05T11:11:59Z","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/2505.23311/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Verification is one of the central tasks in circuit and system design. While simulation and emulation are widely used, complete correctness can only be ensured based on formal proof techniques. But these approaches often have very high run time and memory requirements. Recently, Polynomial Formal Verification (PFV) has been introduced showing that for many instances of practical relevance upper bounds on needed resources can be given. But proofs have to be provided that are human-readable.\n  Here, we study how modern approaches from Artificial Intelligence (AI) based on Large Language Models (","authors_text":"Rolf Drechsler","cross_cats":["cs.AR","cs.SC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2025-05-29T10:11:42Z","title":"Towards LLM-based Generation of Human-Readable Proofs in Polynomial Formal Verification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.23311","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:0b0e3463ce96548f53d9aa0d68c63b8f4eeb71b45d47128f2bd74c802328ff1f","target":"record","created_at":"2026-07-05T11:11:59Z","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":"d34594b8d1ecbb2bd99fe56eea487455aadd20ebbcab8ff44bd5b9f219e1f06f","cross_cats_sorted":["cs.AR","cs.SC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2025-05-29T10:11:42Z","title_canon_sha256":"f7f203521578a373d1cca1981d52045d45d2dd44ae1de9bbb48e4f2a01af5109"},"schema_version":"1.0","source":{"id":"2505.23311","kind":"arxiv","version":1}},"canonical_sha256":"995e0ec454801146e362581199f448b308442ad9a7f8fe2b60d38f15afaf4ee5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"995e0ec454801146e362581199f448b308442ad9a7f8fe2b60d38f15afaf4ee5","first_computed_at":"2026-07-05T11:11:59.298929Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:11:59.298929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sds5eFaemJEJGJIYodjYUFpWKQBMEEcD/UXi8Chb+ezuQOU4Mum5YsysnjXk18/sEdQwTrDgLNsAsQCEp6pqAg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:11:59.299400Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.23311","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b0e3463ce96548f53d9aa0d68c63b8f4eeb71b45d47128f2bd74c802328ff1f","sha256:28592d0bad9b402a4833d73d2e415c62b2585347e2040ae91ded0c0acb469b7f"],"state_sha256":"962d13f70d8ccc291704806c74957a1fc7db8c6c2cb8c39ab25ec3b637a20313"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wbV3p7027LIfynwuyXhhEXMm6UZDL6Q75zaHmmlurWMsvAnA/ppnJrmRIbo40QJOBi4VOImbLT967n7vxz5JBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T08:43:59.231970Z","bundle_sha256":"45e4d3e70d732da5cd6662c1bb05e9e3311fffaf9bf740bb1fb42fd2bc165e66"}}