{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XRRBPOIZP7UT4QPSYJC7RYJZPK","short_pith_number":"pith:XRRBPOIZ","canonical_record":{"source":{"id":"1807.09047","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-07-24T11:36:31Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"72dcfc665aa4f3d6f8e23e36e43d1d9575a5b4bafc372b6c61f46a31c476150e","abstract_canon_sha256":"a6488c1cd0a227ef5b7945bc8c8b52854da9433cef67c7825adf330294450693"},"schema_version":"1.0"},"canonical_sha256":"bc6217b9197fe93e41f2c245f8e1397a9ba9cc717917c318450a3e780dc46c33","source":{"kind":"arxiv","id":"1807.09047","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.09047","created_at":"2026-05-18T00:09:56Z"},{"alias_kind":"arxiv_version","alias_value":"1807.09047v1","created_at":"2026-05-18T00:09:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09047","created_at":"2026-05-18T00:09:56Z"},{"alias_kind":"pith_short_12","alias_value":"XRRBPOIZP7UT","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XRRBPOIZP7UT4QPS","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XRRBPOIZ","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XRRBPOIZP7UT4QPSYJC7RYJZPK","target":"record","payload":{"canonical_record":{"source":{"id":"1807.09047","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-07-24T11:36:31Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"72dcfc665aa4f3d6f8e23e36e43d1d9575a5b4bafc372b6c61f46a31c476150e","abstract_canon_sha256":"a6488c1cd0a227ef5b7945bc8c8b52854da9433cef67c7825adf330294450693"},"schema_version":"1.0"},"canonical_sha256":"bc6217b9197fe93e41f2c245f8e1397a9ba9cc717917c318450a3e780dc46c33","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:56.941889Z","signature_b64":"H6YFgA4ORBTDkon/bNmR/iPZW5KDEmxZ2ATx+1K4K7QshkxTz45+BSqDh0iMBssvm3yKe4yWcx9HnHoMML9JCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc6217b9197fe93e41f2c245f8e1397a9ba9cc717917c318450a3e780dc46c33","last_reissued_at":"2026-05-18T00:09:56.941397Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:56.941397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.09047","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-18T00:09:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VA7xuKmf841wQ1cdk12t8sXSkFxwYfZgivJ9UdTt+P2jU26hzPcC9mrmlwMFfdwyLXgmSjBou9ywWbzzqUxWDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T13:19:40.253421Z"},"content_sha256":"0eccb37d50d767b58e676ca02bf828316f2a3c636a6871fa6868b0caab484ff7","schema_version":"1.0","event_id":"sha256:0eccb37d50d767b58e676ca02bf828316f2a3c636a6871fa6868b0caab484ff7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XRRBPOIZP7UT4QPSYJC7RYJZPK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounded Synthesis of Reactive Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Bernd Finkbeiner, Carsten Gerstacker, Felix Klein","submitted_at":"2018-07-24T11:36:31Z","abstract_excerpt":"Most algorithms for the synthesis of reactive systems focus on the construction of finite-state machines rather than actual programs. This often leads to badly structured, unreadable code. In this paper, we present a bounded synthesis approach that automatically constructs, from a given specification in linear-time temporal logic (LTL), a program in Madhusudan's simple imperative language for reactive programs. We develop and compare two principal approaches for the reduction of the synthesis problem to a Boolean constraint satisfaction problem. The first reduction is based on a generalization"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.09047","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"},"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-18T00:09:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"owFA7j6TBtKRNUM5virQ1pYW5P8pGFCvFEC5kjFw2CgBVo5zJXV2Bp3iuJj5y3EnP/w7gSDuW0MEk4MPctEOAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T13:19:40.253770Z"},"content_sha256":"d4fee101eb8cc42e95e16ef7a66da929db9222e644673e5d361c1b273cd208e4","schema_version":"1.0","event_id":"sha256:d4fee101eb8cc42e95e16ef7a66da929db9222e644673e5d361c1b273cd208e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XRRBPOIZP7UT4QPSYJC7RYJZPK/bundle.json","state_url":"https://pith.science/pith/XRRBPOIZP7UT4QPSYJC7RYJZPK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XRRBPOIZP7UT4QPSYJC7RYJZPK/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-06-11T13:19:40Z","links":{"resolver":"https://pith.science/pith/XRRBPOIZP7UT4QPSYJC7RYJZPK","bundle":"https://pith.science/pith/XRRBPOIZP7UT4QPSYJC7RYJZPK/bundle.json","state":"https://pith.science/pith/XRRBPOIZP7UT4QPSYJC7RYJZPK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XRRBPOIZP7UT4QPSYJC7RYJZPK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XRRBPOIZP7UT4QPSYJC7RYJZPK","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":"a6488c1cd0a227ef5b7945bc8c8b52854da9433cef67c7825adf330294450693","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-07-24T11:36:31Z","title_canon_sha256":"72dcfc665aa4f3d6f8e23e36e43d1d9575a5b4bafc372b6c61f46a31c476150e"},"schema_version":"1.0","source":{"id":"1807.09047","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.09047","created_at":"2026-05-18T00:09:56Z"},{"alias_kind":"arxiv_version","alias_value":"1807.09047v1","created_at":"2026-05-18T00:09:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09047","created_at":"2026-05-18T00:09:56Z"},{"alias_kind":"pith_short_12","alias_value":"XRRBPOIZP7UT","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XRRBPOIZP7UT4QPS","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XRRBPOIZ","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:d4fee101eb8cc42e95e16ef7a66da929db9222e644673e5d361c1b273cd208e4","target":"graph","created_at":"2026-05-18T00:09:56Z","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"},"paper":{"abstract_excerpt":"Most algorithms for the synthesis of reactive systems focus on the construction of finite-state machines rather than actual programs. This often leads to badly structured, unreadable code. In this paper, we present a bounded synthesis approach that automatically constructs, from a given specification in linear-time temporal logic (LTL), a program in Madhusudan's simple imperative language for reactive programs. We develop and compare two principal approaches for the reduction of the synthesis problem to a Boolean constraint satisfaction problem. The first reduction is based on a generalization","authors_text":"Bernd Finkbeiner, Carsten Gerstacker, Felix Klein","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-07-24T11:36:31Z","title":"Bounded Synthesis of Reactive Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.09047","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:0eccb37d50d767b58e676ca02bf828316f2a3c636a6871fa6868b0caab484ff7","target":"record","created_at":"2026-05-18T00:09:56Z","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":"a6488c1cd0a227ef5b7945bc8c8b52854da9433cef67c7825adf330294450693","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-07-24T11:36:31Z","title_canon_sha256":"72dcfc665aa4f3d6f8e23e36e43d1d9575a5b4bafc372b6c61f46a31c476150e"},"schema_version":"1.0","source":{"id":"1807.09047","kind":"arxiv","version":1}},"canonical_sha256":"bc6217b9197fe93e41f2c245f8e1397a9ba9cc717917c318450a3e780dc46c33","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc6217b9197fe93e41f2c245f8e1397a9ba9cc717917c318450a3e780dc46c33","first_computed_at":"2026-05-18T00:09:56.941397Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:56.941397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H6YFgA4ORBTDkon/bNmR/iPZW5KDEmxZ2ATx+1K4K7QshkxTz45+BSqDh0iMBssvm3yKe4yWcx9HnHoMML9JCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:56.941889Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.09047","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0eccb37d50d767b58e676ca02bf828316f2a3c636a6871fa6868b0caab484ff7","sha256:d4fee101eb8cc42e95e16ef7a66da929db9222e644673e5d361c1b273cd208e4"],"state_sha256":"3e38013c68fe0ed6f527a54f2873110ef9d15da225cd2708bc56c53ee41141e4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gjFgW+6ScZtWdsM3p0zbV/aeXsSSDRfTS1GlCr5uPkygQQg1JdRA6t7XnfpxCVXkYWS2jixVEi8T9nTaofn3AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T13:19:40.255814Z","bundle_sha256":"bdd8e4cc5977756bcc130c6b88175953d7f4c02407ec7fb4c64e042e1a0183e6"}}