{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7NZVTYMG34MZDDBIV4P7URQSBS","short_pith_number":"pith:7NZVTYMG","canonical_record":{"source":{"id":"1605.01511","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-05-05T07:21:02Z","cross_cats_sorted":[],"title_canon_sha256":"6a81a6dd24f6d797ddccefc31f2f92555e95f30ac9437869be59776833504533","abstract_canon_sha256":"7c78fe32a3bc448fb72026b1f7701201b47c54083acb3b354bae21429935b820"},"schema_version":"1.0"},"canonical_sha256":"fb7359e186df19918c28af1ffa46120c81b247d08d1c886499af8637f9bfc231","source":{"kind":"arxiv","id":"1605.01511","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.01511","created_at":"2026-05-18T01:15:33Z"},{"alias_kind":"arxiv_version","alias_value":"1605.01511v1","created_at":"2026-05-18T01:15:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01511","created_at":"2026-05-18T01:15:33Z"},{"alias_kind":"pith_short_12","alias_value":"7NZVTYMG34MZ","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7NZVTYMG34MZDDBI","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7NZVTYMG","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7NZVTYMG34MZDDBIV4P7URQSBS","target":"record","payload":{"canonical_record":{"source":{"id":"1605.01511","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-05-05T07:21:02Z","cross_cats_sorted":[],"title_canon_sha256":"6a81a6dd24f6d797ddccefc31f2f92555e95f30ac9437869be59776833504533","abstract_canon_sha256":"7c78fe32a3bc448fb72026b1f7701201b47c54083acb3b354bae21429935b820"},"schema_version":"1.0"},"canonical_sha256":"fb7359e186df19918c28af1ffa46120c81b247d08d1c886499af8637f9bfc231","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:33.490257Z","signature_b64":"Z4BJzHdMelFuvpRCXbrEdem6g95q3HJbWd55ab+Ffs4+EH9jDd65GAvzX1GZPMNgW89+T6RgcHAchpW1s0kQCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb7359e186df19918c28af1ffa46120c81b247d08d1c886499af8637f9bfc231","last_reissued_at":"2026-05-18T01:15:33.489616Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:33.489616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.01511","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-18T01:15:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L45RI7KlnA7xg6g83J3nFQ1gX6KoAFNUEDThteluGBbmGGNQp2yGrXJHTquq8CcMfdjLcC5BHyJw8G60iIZZCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:23:29.754193Z"},"content_sha256":"acc6b8197ee2c9005a6225e751d6c35edfc97a84f28be590ad72bbce2f13d761","schema_version":"1.0","event_id":"sha256:acc6b8197ee2c9005a6225e751d6c35edfc97a84f28be590ad72bbce2f13d761"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7NZVTYMG34MZDDBIV4P7URQSBS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounded Cycle Synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Bernd Finkbeiner, Felix Klein","submitted_at":"2016-05-05T07:21:02Z","abstract_excerpt":"We introduce a new approach for the synthesis of Mealy machines from specifications in linear-time temporal logic (LTL), where the number of cycles in the state graph of the implementation is limited by a given bound. Bounding the number of cycles leads to implementations that are structurally simpler and easier to understand. We solve the synthesis problem via an extension of SAT-based bounded synthesis, where we additionally construct a witness structure that limits the number of cycles. We also establish a triple-exponential upper and lower bound for the potential blow-up between the length"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01511","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-18T01:15:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wl5EltKV8FZc+M0ICWdI6lpc71XI96rYmFcWusRZQSIYP8NzRiciHD9MolAstnAGis/jfJzmWszqPkPhqhKaCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:23:29.754558Z"},"content_sha256":"7e78ba0eead2367931d4a9ea4081b2556d16f494d79aee7117ab2737ae8ff9db","schema_version":"1.0","event_id":"sha256:7e78ba0eead2367931d4a9ea4081b2556d16f494d79aee7117ab2737ae8ff9db"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7NZVTYMG34MZDDBIV4P7URQSBS/bundle.json","state_url":"https://pith.science/pith/7NZVTYMG34MZDDBIV4P7URQSBS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7NZVTYMG34MZDDBIV4P7URQSBS/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-11T09:23:29Z","links":{"resolver":"https://pith.science/pith/7NZVTYMG34MZDDBIV4P7URQSBS","bundle":"https://pith.science/pith/7NZVTYMG34MZDDBIV4P7URQSBS/bundle.json","state":"https://pith.science/pith/7NZVTYMG34MZDDBIV4P7URQSBS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7NZVTYMG34MZDDBIV4P7URQSBS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7NZVTYMG34MZDDBIV4P7URQSBS","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":"7c78fe32a3bc448fb72026b1f7701201b47c54083acb3b354bae21429935b820","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-05-05T07:21:02Z","title_canon_sha256":"6a81a6dd24f6d797ddccefc31f2f92555e95f30ac9437869be59776833504533"},"schema_version":"1.0","source":{"id":"1605.01511","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.01511","created_at":"2026-05-18T01:15:33Z"},{"alias_kind":"arxiv_version","alias_value":"1605.01511v1","created_at":"2026-05-18T01:15:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01511","created_at":"2026-05-18T01:15:33Z"},{"alias_kind":"pith_short_12","alias_value":"7NZVTYMG34MZ","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7NZVTYMG34MZDDBI","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7NZVTYMG","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:7e78ba0eead2367931d4a9ea4081b2556d16f494d79aee7117ab2737ae8ff9db","target":"graph","created_at":"2026-05-18T01:15:33Z","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":"We introduce a new approach for the synthesis of Mealy machines from specifications in linear-time temporal logic (LTL), where the number of cycles in the state graph of the implementation is limited by a given bound. Bounding the number of cycles leads to implementations that are structurally simpler and easier to understand. We solve the synthesis problem via an extension of SAT-based bounded synthesis, where we additionally construct a witness structure that limits the number of cycles. We also establish a triple-exponential upper and lower bound for the potential blow-up between the length","authors_text":"Bernd Finkbeiner, Felix Klein","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-05-05T07:21:02Z","title":"Bounded Cycle Synthesis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01511","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:acc6b8197ee2c9005a6225e751d6c35edfc97a84f28be590ad72bbce2f13d761","target":"record","created_at":"2026-05-18T01:15:33Z","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":"7c78fe32a3bc448fb72026b1f7701201b47c54083acb3b354bae21429935b820","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-05-05T07:21:02Z","title_canon_sha256":"6a81a6dd24f6d797ddccefc31f2f92555e95f30ac9437869be59776833504533"},"schema_version":"1.0","source":{"id":"1605.01511","kind":"arxiv","version":1}},"canonical_sha256":"fb7359e186df19918c28af1ffa46120c81b247d08d1c886499af8637f9bfc231","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb7359e186df19918c28af1ffa46120c81b247d08d1c886499af8637f9bfc231","first_computed_at":"2026-05-18T01:15:33.489616Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:33.489616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z4BJzHdMelFuvpRCXbrEdem6g95q3HJbWd55ab+Ffs4+EH9jDd65GAvzX1GZPMNgW89+T6RgcHAchpW1s0kQCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:33.490257Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.01511","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:acc6b8197ee2c9005a6225e751d6c35edfc97a84f28be590ad72bbce2f13d761","sha256:7e78ba0eead2367931d4a9ea4081b2556d16f494d79aee7117ab2737ae8ff9db"],"state_sha256":"ef6b2ec52f805a6ab909ec1910cd489c1015b43814ae08ca9a3a6f43d9191754"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7cxdIuPLwTKMCHThqS6+Yh8A2AfnQwe/Ktp2BRUWaDgaUceC1wlrwoQ8jsOTutVL2/Hb3iHAE1jdbAsIenTaAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T09:23:29.756404Z","bundle_sha256":"02e2f380fc1e7ad57849c0812b1f797ef978a2d2c7261a70daaf784a85501e33"}}