{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:YVG64WUOJUGYYAEZ5ENZO2H4OX","short_pith_number":"pith:YVG64WUO","canonical_record":{"source":{"id":"2605.19683","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-19T11:16:29Z","cross_cats_sorted":[],"title_canon_sha256":"39a07c3102d4af4374a659e893c790ef58ed9423b136e5ade24b9acfdc9d0c42","abstract_canon_sha256":"e55cfb6c9402a05bf63235440eede103ee843746bbfd2b21d5b8f78ff0db6f97"},"schema_version":"1.0"},"canonical_sha256":"c54dee5a8e4d0d8c0099e91b9768fc75c3133b9b9c728624217d5e7ddaab9d24","source":{"kind":"arxiv","id":"2605.19683","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.19683","created_at":"2026-05-20T01:05:57Z"},{"alias_kind":"arxiv_version","alias_value":"2605.19683v1","created_at":"2026-05-20T01:05:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.19683","created_at":"2026-05-20T01:05:57Z"},{"alias_kind":"pith_short_12","alias_value":"YVG64WUOJUGY","created_at":"2026-05-20T01:05:57Z"},{"alias_kind":"pith_short_16","alias_value":"YVG64WUOJUGYYAEZ","created_at":"2026-05-20T01:05:57Z"},{"alias_kind":"pith_short_8","alias_value":"YVG64WUO","created_at":"2026-05-20T01:05:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:YVG64WUOJUGYYAEZ5ENZO2H4OX","target":"record","payload":{"canonical_record":{"source":{"id":"2605.19683","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-19T11:16:29Z","cross_cats_sorted":[],"title_canon_sha256":"39a07c3102d4af4374a659e893c790ef58ed9423b136e5ade24b9acfdc9d0c42","abstract_canon_sha256":"e55cfb6c9402a05bf63235440eede103ee843746bbfd2b21d5b8f78ff0db6f97"},"schema_version":"1.0"},"canonical_sha256":"c54dee5a8e4d0d8c0099e91b9768fc75c3133b9b9c728624217d5e7ddaab9d24","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:05:57.594643Z","signature_b64":"YmEwlYfbLIh16dduaRI7CpPzzifjWm7hKDQaDZ8eq9BBipsAsz6dJ4TQO4AgjGm6QLoz1LW72X8Ijjw+1O7iDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c54dee5a8e4d0d8c0099e91b9768fc75c3133b9b9c728624217d5e7ddaab9d24","last_reissued_at":"2026-05-20T01:05:57.594048Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:05:57.594048Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.19683","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-05-20T01:05:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nUP7WSCtX8Tvz6Rc/QswztFLYAGhmQiME9Z3ICymqzsi9IaQcRa4mJi4fBU1MxIyvVolH45CUocB2XnO6bxRBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:19:34.557123Z"},"content_sha256":"91fc99ce6891946a8556d23321a588aec78b5c29e85e25c7740d9fc78eba47cb","schema_version":"1.0","event_id":"sha256:91fc99ce6891946a8556d23321a588aec78b5c29e85e25c7740d9fc78eba47cb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:YVG64WUOJUGYYAEZ5ENZO2H4OX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Completeness of Synthesis under Realizability Assumptions using Superposition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Eva Maria Wagner, Laura Kov\\'acs, M\\'arton Hajdu, Petra Hozzov\\'a","submitted_at":"2026-05-19T11:16:29Z","abstract_excerpt":"Program synthesis is the task of automatically deriving a program that has been specified by a user in advance. Combining automated theorem proving with program synthesis enables the automated construction of proven-to-be-correct programs, thereby ensuring software reliability. In this paper, we consider the superposition-based calculus extended to support synthesis of recursion-free programs allowing reasoning with uncomputable symbols. We present cases where the calculus fails and refine it to solve them. We prove that the refined calculus is sound. Finally, we also prove completeness in the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.19683","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/2605.19683/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-05-20T01:05:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gf5IzJwlTUSmgWuGv0Ghs48qhxsGOZiy3xTczMosIW5L1xL5BnKBg9UTyBUejr3SfbnWOzdx2DLiHNIEzdJECA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:19:34.557895Z"},"content_sha256":"478f4a22daf618a79c0c1304f83f0ceb2a84869af8d1c7c0630698bf4cbfd5fd","schema_version":"1.0","event_id":"sha256:478f4a22daf618a79c0c1304f83f0ceb2a84869af8d1c7c0630698bf4cbfd5fd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YVG64WUOJUGYYAEZ5ENZO2H4OX/bundle.json","state_url":"https://pith.science/pith/YVG64WUOJUGYYAEZ5ENZO2H4OX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YVG64WUOJUGYYAEZ5ENZO2H4OX/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-05-26T10:19:34Z","links":{"resolver":"https://pith.science/pith/YVG64WUOJUGYYAEZ5ENZO2H4OX","bundle":"https://pith.science/pith/YVG64WUOJUGYYAEZ5ENZO2H4OX/bundle.json","state":"https://pith.science/pith/YVG64WUOJUGYYAEZ5ENZO2H4OX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YVG64WUOJUGYYAEZ5ENZO2H4OX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:YVG64WUOJUGYYAEZ5ENZO2H4OX","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":"e55cfb6c9402a05bf63235440eede103ee843746bbfd2b21d5b8f78ff0db6f97","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-19T11:16:29Z","title_canon_sha256":"39a07c3102d4af4374a659e893c790ef58ed9423b136e5ade24b9acfdc9d0c42"},"schema_version":"1.0","source":{"id":"2605.19683","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.19683","created_at":"2026-05-20T01:05:57Z"},{"alias_kind":"arxiv_version","alias_value":"2605.19683v1","created_at":"2026-05-20T01:05:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.19683","created_at":"2026-05-20T01:05:57Z"},{"alias_kind":"pith_short_12","alias_value":"YVG64WUOJUGY","created_at":"2026-05-20T01:05:57Z"},{"alias_kind":"pith_short_16","alias_value":"YVG64WUOJUGYYAEZ","created_at":"2026-05-20T01:05:57Z"},{"alias_kind":"pith_short_8","alias_value":"YVG64WUO","created_at":"2026-05-20T01:05:57Z"}],"graph_snapshots":[{"event_id":"sha256:478f4a22daf618a79c0c1304f83f0ceb2a84869af8d1c7c0630698bf4cbfd5fd","target":"graph","created_at":"2026-05-20T01:05:57Z","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/2605.19683/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Program synthesis is the task of automatically deriving a program that has been specified by a user in advance. Combining automated theorem proving with program synthesis enables the automated construction of proven-to-be-correct programs, thereby ensuring software reliability. In this paper, we consider the superposition-based calculus extended to support synthesis of recursion-free programs allowing reasoning with uncomputable symbols. We present cases where the calculus fails and refine it to solve them. We prove that the refined calculus is sound. Finally, we also prove completeness in the","authors_text":"Eva Maria Wagner, Laura Kov\\'acs, M\\'arton Hajdu, Petra Hozzov\\'a","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-19T11:16:29Z","title":"Completeness of Synthesis under Realizability Assumptions using Superposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.19683","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:91fc99ce6891946a8556d23321a588aec78b5c29e85e25c7740d9fc78eba47cb","target":"record","created_at":"2026-05-20T01:05:57Z","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":"e55cfb6c9402a05bf63235440eede103ee843746bbfd2b21d5b8f78ff0db6f97","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-19T11:16:29Z","title_canon_sha256":"39a07c3102d4af4374a659e893c790ef58ed9423b136e5ade24b9acfdc9d0c42"},"schema_version":"1.0","source":{"id":"2605.19683","kind":"arxiv","version":1}},"canonical_sha256":"c54dee5a8e4d0d8c0099e91b9768fc75c3133b9b9c728624217d5e7ddaab9d24","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c54dee5a8e4d0d8c0099e91b9768fc75c3133b9b9c728624217d5e7ddaab9d24","first_computed_at":"2026-05-20T01:05:57.594048Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T01:05:57.594048Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YmEwlYfbLIh16dduaRI7CpPzzifjWm7hKDQaDZ8eq9BBipsAsz6dJ4TQO4AgjGm6QLoz1LW72X8Ijjw+1O7iDQ==","signature_status":"signed_v1","signed_at":"2026-05-20T01:05:57.594643Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.19683","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:91fc99ce6891946a8556d23321a588aec78b5c29e85e25c7740d9fc78eba47cb","sha256:478f4a22daf618a79c0c1304f83f0ceb2a84869af8d1c7c0630698bf4cbfd5fd"],"state_sha256":"b3761e91a9ea433d17eb8961c2602ca836abfbc4a1aebc65bd0b9ad882c24b3f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/TvgTz1u2zAqOYinl2BQ6XYLHevQ6X5MAox5nLMbe7wN3JihshpWVIn46SPkmwTlJZpYsSEBr0Lz4DhEHcLlCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T10:19:34.562220Z","bundle_sha256":"ca0cdbfd5bb1394fc3a4eb329b14d490f8301b52bf37d229cd5cbecf2b2dd354"}}