{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:52I5OWJOIZHXA27JLAVDMMXNKP","short_pith_number":"pith:52I5OWJO","schema_version":"1.0","canonical_sha256":"ee91d7592e464f706be9582a3632ed53fc60c1a87b7c7544792699f5988e18cc","source":{"kind":"arxiv","id":"2605.20421","version":1},"attestation_state":"computed","paper":{"title":"Intersecting Dense Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Dmitry Chistikov, Neha Rino","submitted_at":"2026-05-19T19:18:01Z","abstract_excerpt":"We observe that the classical Cartesian product construction for the intersection of (languages of) nondeterministic finite automata (NFA) is non-optimal in the worst case, if the automata have many transitions. For a fixed alphabet, the product of two NFA may have $\\Theta(m^2)$ transitions if these NFA have at most $n$ states and $m$ transitions each.\n  We describe alternative constructions with $O(m n)$ transitions: or $O(m n^{k-1})$ for the intersection of $k$ NFA (for fixed $k \\ge 2$ and alphabet $\\Sigma$). This gives a faster algorithm for deciding NFA intersection emptiness. The new algo"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.20421","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2026-05-19T19:18:01Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"b4d4247973282e2e533e4c044c7daf7d2970217aa506be31baa5c768d7098ae1","abstract_canon_sha256":"98049f13bca8e7b42ec79590a19109fc0e4109be7d884c01d1bebda6d9a46c34"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:04:37.309889Z","signature_b64":"x5Yh1MUJa3fNOzsGAbBStRIr2fntamZmR18Bo+r3mgBvuO4BYJwnNy+zo5FdSQ6lPmYL0LXFYKmLmnItGO2wCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee91d7592e464f706be9582a3632ed53fc60c1a87b7c7544792699f5988e18cc","last_reissued_at":"2026-05-21T01:04:37.309240Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:04:37.309240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Intersecting Dense Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Dmitry Chistikov, Neha Rino","submitted_at":"2026-05-19T19:18:01Z","abstract_excerpt":"We observe that the classical Cartesian product construction for the intersection of (languages of) nondeterministic finite automata (NFA) is non-optimal in the worst case, if the automata have many transitions. For a fixed alphabet, the product of two NFA may have $\\Theta(m^2)$ transitions if these NFA have at most $n$ states and $m$ transitions each.\n  We describe alternative constructions with $O(m n)$ transitions: or $O(m n^{k-1})$ for the intersection of $k$ NFA (for fixed $k \\ge 2$ and alphabet $\\Sigma$). This gives a faster algorithm for deciding NFA intersection emptiness. The new algo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.20421","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.20421/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.20421","created_at":"2026-05-21T01:04:37.309309+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.20421v1","created_at":"2026-05-21T01:04:37.309309+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.20421","created_at":"2026-05-21T01:04:37.309309+00:00"},{"alias_kind":"pith_short_12","alias_value":"52I5OWJOIZHX","created_at":"2026-05-21T01:04:37.309309+00:00"},{"alias_kind":"pith_short_16","alias_value":"52I5OWJOIZHXA27J","created_at":"2026-05-21T01:04:37.309309+00:00"},{"alias_kind":"pith_short_8","alias_value":"52I5OWJO","created_at":"2026-05-21T01:04:37.309309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/52I5OWJOIZHXA27JLAVDMMXNKP","json":"https://pith.science/pith/52I5OWJOIZHXA27JLAVDMMXNKP.json","graph_json":"https://pith.science/api/pith-number/52I5OWJOIZHXA27JLAVDMMXNKP/graph.json","events_json":"https://pith.science/api/pith-number/52I5OWJOIZHXA27JLAVDMMXNKP/events.json","paper":"https://pith.science/paper/52I5OWJO"},"agent_actions":{"view_html":"https://pith.science/pith/52I5OWJOIZHXA27JLAVDMMXNKP","download_json":"https://pith.science/pith/52I5OWJOIZHXA27JLAVDMMXNKP.json","view_paper":"https://pith.science/paper/52I5OWJO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.20421&json=true","fetch_graph":"https://pith.science/api/pith-number/52I5OWJOIZHXA27JLAVDMMXNKP/graph.json","fetch_events":"https://pith.science/api/pith-number/52I5OWJOIZHXA27JLAVDMMXNKP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/52I5OWJOIZHXA27JLAVDMMXNKP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/52I5OWJOIZHXA27JLAVDMMXNKP/action/storage_attestation","attest_author":"https://pith.science/pith/52I5OWJOIZHXA27JLAVDMMXNKP/action/author_attestation","sign_citation":"https://pith.science/pith/52I5OWJOIZHXA27JLAVDMMXNKP/action/citation_signature","submit_replication":"https://pith.science/pith/52I5OWJOIZHXA27JLAVDMMXNKP/action/replication_record"}},"created_at":"2026-05-21T01:04:37.309309+00:00","updated_at":"2026-05-21T01:04:37.309309+00:00"}