{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7HTD4KRTXECIRCNVJWBV5KQPSH","short_pith_number":"pith:7HTD4KRT","canonical_record":{"source":{"id":"1602.05028","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-02-16T14:26:24Z","cross_cats_sorted":["cs.AI","cs.LO"],"title_canon_sha256":"9fac024080548519c609faf31efbf232280ff61ef145702a2da67f642536dca1","abstract_canon_sha256":"7e0eefbcb2254d75bcd9b4c4a4a35b55c53b436e64e741c7e466f5a999cd6715"},"schema_version":"1.0"},"canonical_sha256":"f9e63e2a33b9048889b54d835eaa0f91ff47a8254d35f305de31e8061ad76fbe","source":{"kind":"arxiv","id":"1602.05028","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.05028","created_at":"2026-05-18T01:20:18Z"},{"alias_kind":"arxiv_version","alias_value":"1602.05028v2","created_at":"2026-05-18T01:20:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05028","created_at":"2026-05-18T01:20:18Z"},{"alias_kind":"pith_short_12","alias_value":"7HTD4KRTXECI","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7HTD4KRTXECIRCNV","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7HTD4KRT","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7HTD4KRTXECIRCNVJWBV5KQPSH","target":"record","payload":{"canonical_record":{"source":{"id":"1602.05028","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-02-16T14:26:24Z","cross_cats_sorted":["cs.AI","cs.LO"],"title_canon_sha256":"9fac024080548519c609faf31efbf232280ff61ef145702a2da67f642536dca1","abstract_canon_sha256":"7e0eefbcb2254d75bcd9b4c4a4a35b55c53b436e64e741c7e466f5a999cd6715"},"schema_version":"1.0"},"canonical_sha256":"f9e63e2a33b9048889b54d835eaa0f91ff47a8254d35f305de31e8061ad76fbe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:18.643166Z","signature_b64":"AaK4jLLsx8B5LrW7hsf+2eNWMTJfJpvHXUd8Zw5KUzUJKGtQtxu1gm6IX8xBP7CgOG8dl9uXy5fRPjSTt6hKCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9e63e2a33b9048889b54d835eaa0f91ff47a8254d35f305de31e8061ad76fbe","last_reissued_at":"2026-05-18T01:20:18.642486Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:18.642486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.05028","source_version":2,"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:20:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S4doVYR2ZUjL2gLJedDI2pho++p85SBlBmMEl9RY4n/BmhBv0vTrLWYus9pUVHGiDj0nPzwOjv3BXhWWRAUbCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T11:16:48.471258Z"},"content_sha256":"9ed3afc501172a61887bc2e11d35fea4e4a0e850d03fc11a403fb39ddbf67599","schema_version":"1.0","event_id":"sha256:9ed3afc501172a61887bc2e11d35fea4e4a0e850d03fc11a403fb39ddbf67599"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7HTD4KRTXECIRCNVJWBV5KQPSH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Symmetry Breaking Predicates for SAT-based DFA Identification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LO"],"primary_cat":"cs.FL","authors_text":"Anatoly Shalyto, Ilya Zakirzyanov, Vladimir Ulyantsev","submitted_at":"2016-02-16T14:26:24Z","abstract_excerpt":"It was shown before that the NP-hard problem of deterministic finite automata (DFA) identification can be effectively translated to Boolean satisfiability (SAT). Modern SAT-solvers can tackle hard DFA identification instances efficiently. We present a technique to reduce the problem search space by enforcing an enumeration of DFA states in depth-first search (DFS) or breadth-first search (BFS) order. We propose symmetry breaking predicates, which can be added to Boolean formulae representing various DFA identification problems. We show how to apply this technique to DFA identification from bot"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.05028","kind":"arxiv","version":2},"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:20:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"is0/0mfeNtT5yDc2Pi4W/Pi684lYyXEZn8vdIjmATdFaxmR5ZzevdavP26ITj2bGQW1EuZ/AMFCTWEMLrdv+Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T11:16:48.471616Z"},"content_sha256":"00361e90a1608cb7347284581ccbdb1c2056f4cdcb4f5a8ae480ceb8b09ac803","schema_version":"1.0","event_id":"sha256:00361e90a1608cb7347284581ccbdb1c2056f4cdcb4f5a8ae480ceb8b09ac803"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7HTD4KRTXECIRCNVJWBV5KQPSH/bundle.json","state_url":"https://pith.science/pith/7HTD4KRTXECIRCNVJWBV5KQPSH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7HTD4KRTXECIRCNVJWBV5KQPSH/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-28T11:16:48Z","links":{"resolver":"https://pith.science/pith/7HTD4KRTXECIRCNVJWBV5KQPSH","bundle":"https://pith.science/pith/7HTD4KRTXECIRCNVJWBV5KQPSH/bundle.json","state":"https://pith.science/pith/7HTD4KRTXECIRCNVJWBV5KQPSH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7HTD4KRTXECIRCNVJWBV5KQPSH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7HTD4KRTXECIRCNVJWBV5KQPSH","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":"7e0eefbcb2254d75bcd9b4c4a4a35b55c53b436e64e741c7e466f5a999cd6715","cross_cats_sorted":["cs.AI","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-02-16T14:26:24Z","title_canon_sha256":"9fac024080548519c609faf31efbf232280ff61ef145702a2da67f642536dca1"},"schema_version":"1.0","source":{"id":"1602.05028","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.05028","created_at":"2026-05-18T01:20:18Z"},{"alias_kind":"arxiv_version","alias_value":"1602.05028v2","created_at":"2026-05-18T01:20:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05028","created_at":"2026-05-18T01:20:18Z"},{"alias_kind":"pith_short_12","alias_value":"7HTD4KRTXECI","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7HTD4KRTXECIRCNV","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7HTD4KRT","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:00361e90a1608cb7347284581ccbdb1c2056f4cdcb4f5a8ae480ceb8b09ac803","target":"graph","created_at":"2026-05-18T01:20:18Z","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":"It was shown before that the NP-hard problem of deterministic finite automata (DFA) identification can be effectively translated to Boolean satisfiability (SAT). Modern SAT-solvers can tackle hard DFA identification instances efficiently. We present a technique to reduce the problem search space by enforcing an enumeration of DFA states in depth-first search (DFS) or breadth-first search (BFS) order. We propose symmetry breaking predicates, which can be added to Boolean formulae representing various DFA identification problems. We show how to apply this technique to DFA identification from bot","authors_text":"Anatoly Shalyto, Ilya Zakirzyanov, Vladimir Ulyantsev","cross_cats":["cs.AI","cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-02-16T14:26:24Z","title":"Symmetry Breaking Predicates for SAT-based DFA Identification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.05028","kind":"arxiv","version":2},"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:9ed3afc501172a61887bc2e11d35fea4e4a0e850d03fc11a403fb39ddbf67599","target":"record","created_at":"2026-05-18T01:20:18Z","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":"7e0eefbcb2254d75bcd9b4c4a4a35b55c53b436e64e741c7e466f5a999cd6715","cross_cats_sorted":["cs.AI","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-02-16T14:26:24Z","title_canon_sha256":"9fac024080548519c609faf31efbf232280ff61ef145702a2da67f642536dca1"},"schema_version":"1.0","source":{"id":"1602.05028","kind":"arxiv","version":2}},"canonical_sha256":"f9e63e2a33b9048889b54d835eaa0f91ff47a8254d35f305de31e8061ad76fbe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f9e63e2a33b9048889b54d835eaa0f91ff47a8254d35f305de31e8061ad76fbe","first_computed_at":"2026-05-18T01:20:18.642486Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:18.642486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AaK4jLLsx8B5LrW7hsf+2eNWMTJfJpvHXUd8Zw5KUzUJKGtQtxu1gm6IX8xBP7CgOG8dl9uXy5fRPjSTt6hKCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:18.643166Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.05028","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9ed3afc501172a61887bc2e11d35fea4e4a0e850d03fc11a403fb39ddbf67599","sha256:00361e90a1608cb7347284581ccbdb1c2056f4cdcb4f5a8ae480ceb8b09ac803"],"state_sha256":"6f6f52c28fe207d47be8120ff5bdac6bdc6d6dce703c1b8c7c4ed71f8ce98143"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DKy2VPSvVwYFFfx5yjwZt+48eb5PX3/6IlZJslUNw6jatUYe9vyNf63Uoid0cMUSpf47Jc9tUPIQVEjVgYUqCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T11:16:48.473688Z","bundle_sha256":"891d2617458e69346d36693644b4a319523ff4a6de432ae732c67e7c910d55be"}}