{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4RY6IOYKXZP3PMSDPHG3HE6G4Z","short_pith_number":"pith:4RY6IOYK","canonical_record":{"source":{"id":"1710.06000","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-10-16T20:58:17Z","cross_cats_sorted":[],"title_canon_sha256":"6bd1a08d57201f40ed5afbf179f4c2ee576b486ee144b6f238f29c15d80d9067","abstract_canon_sha256":"d22d3fef6456b020fe3a4c23a5820190918fac18d45a53fcc66c6e05a57fa5b3"},"schema_version":"1.0"},"canonical_sha256":"e471e43b0abe5fb7b24379cdb393c6e646681f7816a9cf7002e663efa15bf566","source":{"kind":"arxiv","id":"1710.06000","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.06000","created_at":"2026-05-17T23:58:31Z"},{"alias_kind":"arxiv_version","alias_value":"1710.06000v4","created_at":"2026-05-17T23:58:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.06000","created_at":"2026-05-17T23:58:31Z"},{"alias_kind":"pith_short_12","alias_value":"4RY6IOYKXZP3","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4RY6IOYKXZP3PMSD","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4RY6IOYK","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4RY6IOYKXZP3PMSDPHG3HE6G4Z","target":"record","payload":{"canonical_record":{"source":{"id":"1710.06000","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-10-16T20:58:17Z","cross_cats_sorted":[],"title_canon_sha256":"6bd1a08d57201f40ed5afbf179f4c2ee576b486ee144b6f238f29c15d80d9067","abstract_canon_sha256":"d22d3fef6456b020fe3a4c23a5820190918fac18d45a53fcc66c6e05a57fa5b3"},"schema_version":"1.0"},"canonical_sha256":"e471e43b0abe5fb7b24379cdb393c6e646681f7816a9cf7002e663efa15bf566","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:31.139172Z","signature_b64":"oJyvkuYqlt136aVy+/2Mut4C7mq7OeWJ0Bb2y+Y/LLeGrK9KYF75NGSQFZwKWQwCxmCI/kdlVmP5y0Msn6PfCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e471e43b0abe5fb7b24379cdb393c6e646681f7816a9cf7002e663efa15bf566","last_reissued_at":"2026-05-17T23:58:31.138537Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:31.138537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.06000","source_version":4,"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-17T23:58:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CXpYLhkJI9Vx9cHrcTj17spXsNAmMwCPmE3nGwRuB00pzTxnBHGR66IkpjnendaSMNFByGFA3e2LjJcuympWBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:51:35.339002Z"},"content_sha256":"daaa3277fbc0b47d7d78af8a47316da060c07dab6925ed965926e7bff8fad148","schema_version":"1.0","event_id":"sha256:daaa3277fbc0b47d7d78af8a47316da060c07dab6925ed965926e7bff8fad148"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4RY6IOYKXZP3PMSDPHG3HE6G4Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"State Complexity of Overlap Assembly","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Bai Li, Janusz Brzozowski, Lila Kari, Marek Szyku{\\l}a","submitted_at":"2017-10-16T20:58:17Z","abstract_excerpt":"The \\emph{state complexity} of a regular language $L_m$ is the number $m$ of states in a minimal deterministic finite automaton (DFA) accepting $L_m$. The state complexity of a regularity-preserving binary operation on regular languages is defined as the maximal state complexity of the result of the operation where the two operands range over all languages of state complexities $\\le m$ and $\\le n$, respectively. We find a tight upper bound on the state complexity of the binary operation \\emph{overlap assembly} on regular languages. This operation was introduced by Csuhaj-Varj\\'u, Petre, and Va"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.06000","kind":"arxiv","version":4},"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-17T23:58:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oHiW0dWlnE0elmrT0buS+AAyziWjn+9gISy+YSnqheQ+Xpu+RgfCjB3qCIqiclnqTOx+IakcDEY3edSrGS0sAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:51:35.339571Z"},"content_sha256":"dc217f3f046598ae7fa447649f20a8259bf6fd9cc308532fe5b85ccd7ad1a202","schema_version":"1.0","event_id":"sha256:dc217f3f046598ae7fa447649f20a8259bf6fd9cc308532fe5b85ccd7ad1a202"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4RY6IOYKXZP3PMSDPHG3HE6G4Z/bundle.json","state_url":"https://pith.science/pith/4RY6IOYKXZP3PMSDPHG3HE6G4Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4RY6IOYKXZP3PMSDPHG3HE6G4Z/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-05-30T05:51:35Z","links":{"resolver":"https://pith.science/pith/4RY6IOYKXZP3PMSDPHG3HE6G4Z","bundle":"https://pith.science/pith/4RY6IOYKXZP3PMSDPHG3HE6G4Z/bundle.json","state":"https://pith.science/pith/4RY6IOYKXZP3PMSDPHG3HE6G4Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4RY6IOYKXZP3PMSDPHG3HE6G4Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4RY6IOYKXZP3PMSDPHG3HE6G4Z","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":"d22d3fef6456b020fe3a4c23a5820190918fac18d45a53fcc66c6e05a57fa5b3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-10-16T20:58:17Z","title_canon_sha256":"6bd1a08d57201f40ed5afbf179f4c2ee576b486ee144b6f238f29c15d80d9067"},"schema_version":"1.0","source":{"id":"1710.06000","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.06000","created_at":"2026-05-17T23:58:31Z"},{"alias_kind":"arxiv_version","alias_value":"1710.06000v4","created_at":"2026-05-17T23:58:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.06000","created_at":"2026-05-17T23:58:31Z"},{"alias_kind":"pith_short_12","alias_value":"4RY6IOYKXZP3","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4RY6IOYKXZP3PMSD","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4RY6IOYK","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:dc217f3f046598ae7fa447649f20a8259bf6fd9cc308532fe5b85ccd7ad1a202","target":"graph","created_at":"2026-05-17T23:58:31Z","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":"The \\emph{state complexity} of a regular language $L_m$ is the number $m$ of states in a minimal deterministic finite automaton (DFA) accepting $L_m$. The state complexity of a regularity-preserving binary operation on regular languages is defined as the maximal state complexity of the result of the operation where the two operands range over all languages of state complexities $\\le m$ and $\\le n$, respectively. We find a tight upper bound on the state complexity of the binary operation \\emph{overlap assembly} on regular languages. This operation was introduced by Csuhaj-Varj\\'u, Petre, and Va","authors_text":"Bai Li, Janusz Brzozowski, Lila Kari, Marek Szyku{\\l}a","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-10-16T20:58:17Z","title":"State Complexity of Overlap Assembly"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.06000","kind":"arxiv","version":4},"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:daaa3277fbc0b47d7d78af8a47316da060c07dab6925ed965926e7bff8fad148","target":"record","created_at":"2026-05-17T23:58:31Z","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":"d22d3fef6456b020fe3a4c23a5820190918fac18d45a53fcc66c6e05a57fa5b3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-10-16T20:58:17Z","title_canon_sha256":"6bd1a08d57201f40ed5afbf179f4c2ee576b486ee144b6f238f29c15d80d9067"},"schema_version":"1.0","source":{"id":"1710.06000","kind":"arxiv","version":4}},"canonical_sha256":"e471e43b0abe5fb7b24379cdb393c6e646681f7816a9cf7002e663efa15bf566","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e471e43b0abe5fb7b24379cdb393c6e646681f7816a9cf7002e663efa15bf566","first_computed_at":"2026-05-17T23:58:31.138537Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:31.138537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oJyvkuYqlt136aVy+/2Mut4C7mq7OeWJ0Bb2y+Y/LLeGrK9KYF75NGSQFZwKWQwCxmCI/kdlVmP5y0Msn6PfCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:31.139172Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.06000","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:daaa3277fbc0b47d7d78af8a47316da060c07dab6925ed965926e7bff8fad148","sha256:dc217f3f046598ae7fa447649f20a8259bf6fd9cc308532fe5b85ccd7ad1a202"],"state_sha256":"38d6478c9ff9acba831e6c3a4521236219b7e63d943630992ae8fcce18083fb1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sPxOOtb01wfDADrkK1Rk8xfE7Htha3wPvkhbED1aNE+35uzs4jtkWhZ5AZ+8eCWfmMhDrISErzx48/XIUohzCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:51:35.342025Z","bundle_sha256":"04012cd1dbcec8c8d103173f200004edd862b681d90d24dea2aabf134e2e8cee"}}