{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:7YSCNJDFKIB6YWCZHU2U4TMAJU","short_pith_number":"pith:7YSCNJDF","canonical_record":{"source":{"id":"1008.1653","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-08-10T08:33:28Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"8212ededf7796f21c1170d69910fa917ae4c6072a4692ff1dc424f82f4eea0a1","abstract_canon_sha256":"8adb69c1d431405b14469e644b3fb8aa380b31f2d2d983acf02023ebf1b04f56"},"schema_version":"1.0"},"canonical_sha256":"fe2426a4655203ec58593d354e4d804d0b61ac6c39ab22aa18b10eab453342a1","source":{"kind":"arxiv","id":"1008.1653","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.1653","created_at":"2026-05-18T04:42:23Z"},{"alias_kind":"arxiv_version","alias_value":"1008.1653v1","created_at":"2026-05-18T04:42:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.1653","created_at":"2026-05-18T04:42:23Z"},{"alias_kind":"pith_short_12","alias_value":"7YSCNJDFKIB6","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"7YSCNJDFKIB6YWCZ","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"7YSCNJDF","created_at":"2026-05-18T12:26:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:7YSCNJDFKIB6YWCZHU2U4TMAJU","target":"record","payload":{"canonical_record":{"source":{"id":"1008.1653","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-08-10T08:33:28Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"8212ededf7796f21c1170d69910fa917ae4c6072a4692ff1dc424f82f4eea0a1","abstract_canon_sha256":"8adb69c1d431405b14469e644b3fb8aa380b31f2d2d983acf02023ebf1b04f56"},"schema_version":"1.0"},"canonical_sha256":"fe2426a4655203ec58593d354e4d804d0b61ac6c39ab22aa18b10eab453342a1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:23.612010Z","signature_b64":"gOtKs2I/VnqvJuAnsDuWOdroGIPehByFYBbEifZm8ePt4aWDFlnyU9ZiNKwgi/WJXALbg8qhJiriBdA59S9HBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe2426a4655203ec58593d354e4d804d0b61ac6c39ab22aa18b10eab453342a1","last_reissued_at":"2026-05-18T04:42:23.611583Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:23.611583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1008.1653","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-18T04:42:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2DMrz9MAICpeAUEKyGqeqT8JZ1snwaxIQE7KSEu98CsCAggGBoWjo5DxEXN27Ev11M+2i8gowq/2lD6NqyCsBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:19:46.360277Z"},"content_sha256":"32cb66039164b4015e6426a8ada4e2c1d470e6b1bf9c354540b109d0f65f57d4","schema_version":"1.0","event_id":"sha256:32cb66039164b4015e6426a8ada4e2c1d470e6b1bf9c354540b109d0f65f57d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:7YSCNJDFKIB6YWCZHU2U4TMAJU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Magic Number Problem for Subregular Language Families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.FL","authors_text":"Markus Holzer, Martin Kutrib, Sebastian Jakobi","submitted_at":"2010-08-10T08:33:28Z","abstract_excerpt":"We investigate the magic number problem, that is, the question  whether there exists a minimal n-state nondeterministic finite automaton (NFA) whose equivalent minimal deterministic finite automaton (DFA) has alpha states, for all n and alpha satisfying n less or equal to alpha less or equal to exp(2,n).   A number alpha not satisfying this condition is called a magic number (for n).  It was shown in [11] that no magic numbers exist for general regular languages, while in [5] trivial and non-trivial magic numbers for unary regular languages were identified.  We obtain similar results for autom"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.1653","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-18T04:42:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MKFa9CZ6wN/YxFkp/FjBbD5GK00MXE8h3e9zmuiQQ5xlCQTeJh8chswKrIX5HQAZatrN3V5mAfK88xBoP2KKDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:19:46.360640Z"},"content_sha256":"ea21da6b6923ac45c6ff344d3624ebe42848408fb1123e457d08cd1c3a381a2f","schema_version":"1.0","event_id":"sha256:ea21da6b6923ac45c6ff344d3624ebe42848408fb1123e457d08cd1c3a381a2f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7YSCNJDFKIB6YWCZHU2U4TMAJU/bundle.json","state_url":"https://pith.science/pith/7YSCNJDFKIB6YWCZHU2U4TMAJU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7YSCNJDFKIB6YWCZHU2U4TMAJU/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:19:46Z","links":{"resolver":"https://pith.science/pith/7YSCNJDFKIB6YWCZHU2U4TMAJU","bundle":"https://pith.science/pith/7YSCNJDFKIB6YWCZHU2U4TMAJU/bundle.json","state":"https://pith.science/pith/7YSCNJDFKIB6YWCZHU2U4TMAJU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7YSCNJDFKIB6YWCZHU2U4TMAJU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:7YSCNJDFKIB6YWCZHU2U4TMAJU","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":"8adb69c1d431405b14469e644b3fb8aa380b31f2d2d983acf02023ebf1b04f56","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-08-10T08:33:28Z","title_canon_sha256":"8212ededf7796f21c1170d69910fa917ae4c6072a4692ff1dc424f82f4eea0a1"},"schema_version":"1.0","source":{"id":"1008.1653","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.1653","created_at":"2026-05-18T04:42:23Z"},{"alias_kind":"arxiv_version","alias_value":"1008.1653v1","created_at":"2026-05-18T04:42:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.1653","created_at":"2026-05-18T04:42:23Z"},{"alias_kind":"pith_short_12","alias_value":"7YSCNJDFKIB6","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"7YSCNJDFKIB6YWCZ","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"7YSCNJDF","created_at":"2026-05-18T12:26:05Z"}],"graph_snapshots":[{"event_id":"sha256:ea21da6b6923ac45c6ff344d3624ebe42848408fb1123e457d08cd1c3a381a2f","target":"graph","created_at":"2026-05-18T04:42:23Z","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 investigate the magic number problem, that is, the question  whether there exists a minimal n-state nondeterministic finite automaton (NFA) whose equivalent minimal deterministic finite automaton (DFA) has alpha states, for all n and alpha satisfying n less or equal to alpha less or equal to exp(2,n).   A number alpha not satisfying this condition is called a magic number (for n).  It was shown in [11] that no magic numbers exist for general regular languages, while in [5] trivial and non-trivial magic numbers for unary regular languages were identified.  We obtain similar results for autom","authors_text":"Markus Holzer, Martin Kutrib, Sebastian Jakobi","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-08-10T08:33:28Z","title":"The Magic Number Problem for Subregular Language Families"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.1653","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:32cb66039164b4015e6426a8ada4e2c1d470e6b1bf9c354540b109d0f65f57d4","target":"record","created_at":"2026-05-18T04:42:23Z","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":"8adb69c1d431405b14469e644b3fb8aa380b31f2d2d983acf02023ebf1b04f56","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-08-10T08:33:28Z","title_canon_sha256":"8212ededf7796f21c1170d69910fa917ae4c6072a4692ff1dc424f82f4eea0a1"},"schema_version":"1.0","source":{"id":"1008.1653","kind":"arxiv","version":1}},"canonical_sha256":"fe2426a4655203ec58593d354e4d804d0b61ac6c39ab22aa18b10eab453342a1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe2426a4655203ec58593d354e4d804d0b61ac6c39ab22aa18b10eab453342a1","first_computed_at":"2026-05-18T04:42:23.611583Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:42:23.611583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gOtKs2I/VnqvJuAnsDuWOdroGIPehByFYBbEifZm8ePt4aWDFlnyU9ZiNKwgi/WJXALbg8qhJiriBdA59S9HBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:42:23.612010Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.1653","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:32cb66039164b4015e6426a8ada4e2c1d470e6b1bf9c354540b109d0f65f57d4","sha256:ea21da6b6923ac45c6ff344d3624ebe42848408fb1123e457d08cd1c3a381a2f"],"state_sha256":"4ecb13f49ae7f709915749901a9ed72807d130d5102c615ca958c6c776bb89d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fnLKB/a4BIUr29HMuBHwgaDOdneuj/vDCELdeIzy2r587KMfYxwj1qOigXqQhduyCHq88znvcKQpro2uKxciBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T09:19:46.362886Z","bundle_sha256":"0e44eba1bfa2aa61b390c86d712e5e8bc3fe3fda0ac38bb9f5902c0fb167302f"}}