{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:BFBWF2PSUZH5P427OOJE3Z6L4G","short_pith_number":"pith:BFBWF2PS","canonical_record":{"source":{"id":"1210.2452","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-10-09T00:53:36Z","cross_cats_sorted":[],"title_canon_sha256":"39f600028702b9ce67769927defe9a8c1523e6508473ab09167a6a63fe423b52","abstract_canon_sha256":"fe6e1de9c08bbe219494ecbea618d78bf57bc60606da8c43052cd4da257e779c"},"schema_version":"1.0"},"canonical_sha256":"094362e9f2a64fd7f35f73924de7cbe19dc8dcf4ace7d03e639b7949820f4285","source":{"kind":"arxiv","id":"1210.2452","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.2452","created_at":"2026-05-18T03:43:41Z"},{"alias_kind":"arxiv_version","alias_value":"1210.2452v1","created_at":"2026-05-18T03:43:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.2452","created_at":"2026-05-18T03:43:41Z"},{"alias_kind":"pith_short_12","alias_value":"BFBWF2PSUZH5","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"BFBWF2PSUZH5P427","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"BFBWF2PS","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:BFBWF2PSUZH5P427OOJE3Z6L4G","target":"record","payload":{"canonical_record":{"source":{"id":"1210.2452","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-10-09T00:53:36Z","cross_cats_sorted":[],"title_canon_sha256":"39f600028702b9ce67769927defe9a8c1523e6508473ab09167a6a63fe423b52","abstract_canon_sha256":"fe6e1de9c08bbe219494ecbea618d78bf57bc60606da8c43052cd4da257e779c"},"schema_version":"1.0"},"canonical_sha256":"094362e9f2a64fd7f35f73924de7cbe19dc8dcf4ace7d03e639b7949820f4285","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:43:41.498731Z","signature_b64":"CpXmws5yQhsLOYitp5z9MJ8lFip2DG+8g7tHNw6j1XPNCuNEfXLq/U1meQI84pUZy41MOC96ItrjzPkefEZLBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"094362e9f2a64fd7f35f73924de7cbe19dc8dcf4ace7d03e639b7949820f4285","last_reissued_at":"2026-05-18T03:43:41.498130Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:43:41.498130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.2452","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-18T03:43:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xZz6/fECKESBLh2SQI6KIOvc8qtwn806KwjX9hO1r2apc93fQJiJyKcIdRDJ0en8sncqJFDpLOth0FPgYrCWCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T11:20:54.161852Z"},"content_sha256":"007790631c9ba03d7f8385c8b24a7e48a9d51aae8d65789540c2607c065c5385","schema_version":"1.0","event_id":"sha256:007790631c9ba03d7f8385c8b24a7e48a9d51aae8d65789540c2607c065c5385"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:BFBWF2PSUZH5P427OOJE3Z6L4G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learn with SAT to Minimize B\\\"uchi Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Martin Hofmann, Stephan Barth","submitted_at":"2012-10-09T00:53:36Z","abstract_excerpt":"We describe a minimization procedure for nondeterministic B\\\"uchi automata (NBA). For an automaton A another automaton A_min with the minimal number of states  is learned with the help of a SAT-solver.\n  This is done by successively computing automata A' that approximate A in the  sense that they accept a given finite set of positive examples and reject a  given finite set of negative examples. In the course of the procedure these example sets are successively increased. Thus, our method can be seen as an  instance of a generic learning algorithm based on a \"minimally adequate  teacher\" in the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.2452","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-18T03:43:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zqCSfT1hKNJUgJNZ1W2xFd/vStiQ993CGuMcPx4MnCfRDb8wX8iMLYHdhaH8rY6cva9D/GcjHJ83QPrhgmv/BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T11:20:54.162245Z"},"content_sha256":"e5bc1bd9bbef060959a25558200d20ea283153b8edf943d5a23a8b8ebcdf9918","schema_version":"1.0","event_id":"sha256:e5bc1bd9bbef060959a25558200d20ea283153b8edf943d5a23a8b8ebcdf9918"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BFBWF2PSUZH5P427OOJE3Z6L4G/bundle.json","state_url":"https://pith.science/pith/BFBWF2PSUZH5P427OOJE3Z6L4G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BFBWF2PSUZH5P427OOJE3Z6L4G/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-20T11:20:54Z","links":{"resolver":"https://pith.science/pith/BFBWF2PSUZH5P427OOJE3Z6L4G","bundle":"https://pith.science/pith/BFBWF2PSUZH5P427OOJE3Z6L4G/bundle.json","state":"https://pith.science/pith/BFBWF2PSUZH5P427OOJE3Z6L4G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BFBWF2PSUZH5P427OOJE3Z6L4G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:BFBWF2PSUZH5P427OOJE3Z6L4G","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":"fe6e1de9c08bbe219494ecbea618d78bf57bc60606da8c43052cd4da257e779c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-10-09T00:53:36Z","title_canon_sha256":"39f600028702b9ce67769927defe9a8c1523e6508473ab09167a6a63fe423b52"},"schema_version":"1.0","source":{"id":"1210.2452","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.2452","created_at":"2026-05-18T03:43:41Z"},{"alias_kind":"arxiv_version","alias_value":"1210.2452v1","created_at":"2026-05-18T03:43:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.2452","created_at":"2026-05-18T03:43:41Z"},{"alias_kind":"pith_short_12","alias_value":"BFBWF2PSUZH5","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"BFBWF2PSUZH5P427","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"BFBWF2PS","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:e5bc1bd9bbef060959a25558200d20ea283153b8edf943d5a23a8b8ebcdf9918","target":"graph","created_at":"2026-05-18T03:43:41Z","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 describe a minimization procedure for nondeterministic B\\\"uchi automata (NBA). For an automaton A another automaton A_min with the minimal number of states  is learned with the help of a SAT-solver.\n  This is done by successively computing automata A' that approximate A in the  sense that they accept a given finite set of positive examples and reject a  given finite set of negative examples. In the course of the procedure these example sets are successively increased. Thus, our method can be seen as an  instance of a generic learning algorithm based on a \"minimally adequate  teacher\" in the","authors_text":"Martin Hofmann, Stephan Barth","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-10-09T00:53:36Z","title":"Learn with SAT to Minimize B\\\"uchi Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.2452","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:007790631c9ba03d7f8385c8b24a7e48a9d51aae8d65789540c2607c065c5385","target":"record","created_at":"2026-05-18T03:43:41Z","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":"fe6e1de9c08bbe219494ecbea618d78bf57bc60606da8c43052cd4da257e779c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-10-09T00:53:36Z","title_canon_sha256":"39f600028702b9ce67769927defe9a8c1523e6508473ab09167a6a63fe423b52"},"schema_version":"1.0","source":{"id":"1210.2452","kind":"arxiv","version":1}},"canonical_sha256":"094362e9f2a64fd7f35f73924de7cbe19dc8dcf4ace7d03e639b7949820f4285","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"094362e9f2a64fd7f35f73924de7cbe19dc8dcf4ace7d03e639b7949820f4285","first_computed_at":"2026-05-18T03:43:41.498130Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:43:41.498130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CpXmws5yQhsLOYitp5z9MJ8lFip2DG+8g7tHNw6j1XPNCuNEfXLq/U1meQI84pUZy41MOC96ItrjzPkefEZLBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:43:41.498731Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.2452","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:007790631c9ba03d7f8385c8b24a7e48a9d51aae8d65789540c2607c065c5385","sha256:e5bc1bd9bbef060959a25558200d20ea283153b8edf943d5a23a8b8ebcdf9918"],"state_sha256":"cc658c16d3da41a3352667228631593cb32b670a47f9d30d859e582dca2f6b0e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pw3Cc4L/WYoHAOyX7kj7garPztPN8BvVA4fbfCBr0WT4/A6HZfXBsgCySvp0BQ86zAqfjlozKubxuVF7MpyWCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T11:20:54.164252Z","bundle_sha256":"503bfdc250be3368ef971c949e97cfff93000e121cfa6cc614fa88fbfc5e2caa"}}