{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:NURKGSAD32Y6GQ22UXP2V5MDEI","short_pith_number":"pith:NURKGSAD","canonical_record":{"source":{"id":"2108.05244","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2021-08-11T14:25:30Z","cross_cats_sorted":["cs.CC","cs.DB"],"title_canon_sha256":"b0f576ff4a8d6d09c031f6e0c2f097ad90947fff54323835203612208400f245","abstract_canon_sha256":"daae7f7019c69f5fbad115ebfca1fcd4375871dfd442ce20a08a8d0151d34ef0"},"schema_version":"1.0"},"canonical_sha256":"6d22a34803deb1e3435aa5dfaaf5832212ff6de8c821b1733cdfb2a50e7611f4","source":{"kind":"arxiv","id":"2108.05244","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2108.05244","created_at":"2026-07-05T03:05:08Z"},{"alias_kind":"arxiv_version","alias_value":"2108.05244v1","created_at":"2026-07-05T03:05:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.05244","created_at":"2026-07-05T03:05:08Z"},{"alias_kind":"pith_short_12","alias_value":"NURKGSAD32Y6","created_at":"2026-07-05T03:05:08Z"},{"alias_kind":"pith_short_16","alias_value":"NURKGSAD32Y6GQ22","created_at":"2026-07-05T03:05:08Z"},{"alias_kind":"pith_short_8","alias_value":"NURKGSAD","created_at":"2026-07-05T03:05:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:NURKGSAD32Y6GQ22UXP2V5MDEI","target":"record","payload":{"canonical_record":{"source":{"id":"2108.05244","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2021-08-11T14:25:30Z","cross_cats_sorted":["cs.CC","cs.DB"],"title_canon_sha256":"b0f576ff4a8d6d09c031f6e0c2f097ad90947fff54323835203612208400f245","abstract_canon_sha256":"daae7f7019c69f5fbad115ebfca1fcd4375871dfd442ce20a08a8d0151d34ef0"},"schema_version":"1.0"},"canonical_sha256":"6d22a34803deb1e3435aa5dfaaf5832212ff6de8c821b1733cdfb2a50e7611f4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:05:08.097499Z","signature_b64":"/8Sabwv7+VvE8DB5HHPonCRRb+UCXzQvcEnxxsQfgwQLv2r42CfTOCP2avddoWMTrs6/fOIiLqoJdRGFCEugCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d22a34803deb1e3435aa5dfaaf5832212ff6de8c821b1733cdfb2a50e7611f4","last_reissued_at":"2026-07-05T03:05:08.097142Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:05:08.097142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2108.05244","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-07-05T03:05:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1rMbvagO0aUhfdgxcIgTi+wgXMItWSB+7jhRGD37cusRAsYsB12RvHRbKC8ewNSwDo5hjtgS+/QNCuYzoGo+Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T04:50:01.451291Z"},"content_sha256":"6df99ce10ea4f9f8a1275009c4129b9e18734d9b37579ab6184835870729e27a","schema_version":"1.0","event_id":"sha256:6df99ce10ea4f9f8a1275009c4129b9e18734d9b37579ab6184835870729e27a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:NURKGSAD32Y6GQ22UXP2V5MDEI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finite Automata Intersection Non-Emptiness: Parameterized Complexity Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DB"],"primary_cat":"cs.FL","authors_text":"Henning Fernau, Michael Wehar, Stefan Hoffmann","submitted_at":"2021-08-11T14:25:30Z","abstract_excerpt":"The problem DFA-Intersection-Nonemptiness asks if a given number of deterministic automata accept a common word. In general, this problem is PSPACE-complete. Here, we investigate this problem for the subclasses of commutative automata and automata recognizing sparse languages. We show that in both cases DFA-Intersection-Nonemptiness is complete for NP and for the parameterized class $W[1]$, where the number of input automata is the parameter, when the alphabet is fixed. Additionally, we establish the same result for Tables Non-Empty Join, a problem that asks if the join of several tables (poss"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.05244","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/2108.05244/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"},"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-07-05T03:05:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/efCQLmS3hX4+B+1+xFXIJN7uRC6/GXPduDivn1M/kTFX9e6ZXLQmzLi+QLOz9xVojx6mqoAhYGULGNkVDW2AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T04:50:01.451803Z"},"content_sha256":"1fe9197c54383cd88139429060251cbfecd6270a9ddeea7821c9e1cb55124f07","schema_version":"1.0","event_id":"sha256:1fe9197c54383cd88139429060251cbfecd6270a9ddeea7821c9e1cb55124f07"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NURKGSAD32Y6GQ22UXP2V5MDEI/bundle.json","state_url":"https://pith.science/pith/NURKGSAD32Y6GQ22UXP2V5MDEI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NURKGSAD32Y6GQ22UXP2V5MDEI/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-08-20T04:50:01Z","links":{"resolver":"https://pith.science/pith/NURKGSAD32Y6GQ22UXP2V5MDEI","bundle":"https://pith.science/pith/NURKGSAD32Y6GQ22UXP2V5MDEI/bundle.json","state":"https://pith.science/pith/NURKGSAD32Y6GQ22UXP2V5MDEI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NURKGSAD32Y6GQ22UXP2V5MDEI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:NURKGSAD32Y6GQ22UXP2V5MDEI","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":"daae7f7019c69f5fbad115ebfca1fcd4375871dfd442ce20a08a8d0151d34ef0","cross_cats_sorted":["cs.CC","cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2021-08-11T14:25:30Z","title_canon_sha256":"b0f576ff4a8d6d09c031f6e0c2f097ad90947fff54323835203612208400f245"},"schema_version":"1.0","source":{"id":"2108.05244","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2108.05244","created_at":"2026-07-05T03:05:08Z"},{"alias_kind":"arxiv_version","alias_value":"2108.05244v1","created_at":"2026-07-05T03:05:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.05244","created_at":"2026-07-05T03:05:08Z"},{"alias_kind":"pith_short_12","alias_value":"NURKGSAD32Y6","created_at":"2026-07-05T03:05:08Z"},{"alias_kind":"pith_short_16","alias_value":"NURKGSAD32Y6GQ22","created_at":"2026-07-05T03:05:08Z"},{"alias_kind":"pith_short_8","alias_value":"NURKGSAD","created_at":"2026-07-05T03:05:08Z"}],"graph_snapshots":[{"event_id":"sha256:1fe9197c54383cd88139429060251cbfecd6270a9ddeea7821c9e1cb55124f07","target":"graph","created_at":"2026-07-05T03:05:08Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2108.05244/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The problem DFA-Intersection-Nonemptiness asks if a given number of deterministic automata accept a common word. In general, this problem is PSPACE-complete. Here, we investigate this problem for the subclasses of commutative automata and automata recognizing sparse languages. We show that in both cases DFA-Intersection-Nonemptiness is complete for NP and for the parameterized class $W[1]$, where the number of input automata is the parameter, when the alphabet is fixed. Additionally, we establish the same result for Tables Non-Empty Join, a problem that asks if the join of several tables (poss","authors_text":"Henning Fernau, Michael Wehar, Stefan Hoffmann","cross_cats":["cs.CC","cs.DB"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2021-08-11T14:25:30Z","title":"Finite Automata Intersection Non-Emptiness: Parameterized Complexity Revisited"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.05244","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:6df99ce10ea4f9f8a1275009c4129b9e18734d9b37579ab6184835870729e27a","target":"record","created_at":"2026-07-05T03:05:08Z","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":"daae7f7019c69f5fbad115ebfca1fcd4375871dfd442ce20a08a8d0151d34ef0","cross_cats_sorted":["cs.CC","cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2021-08-11T14:25:30Z","title_canon_sha256":"b0f576ff4a8d6d09c031f6e0c2f097ad90947fff54323835203612208400f245"},"schema_version":"1.0","source":{"id":"2108.05244","kind":"arxiv","version":1}},"canonical_sha256":"6d22a34803deb1e3435aa5dfaaf5832212ff6de8c821b1733cdfb2a50e7611f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d22a34803deb1e3435aa5dfaaf5832212ff6de8c821b1733cdfb2a50e7611f4","first_computed_at":"2026-07-05T03:05:08.097142Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:05:08.097142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/8Sabwv7+VvE8DB5HHPonCRRb+UCXzQvcEnxxsQfgwQLv2r42CfTOCP2avddoWMTrs6/fOIiLqoJdRGFCEugCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:05:08.097499Z","signed_message":"canonical_sha256_bytes"},"source_id":"2108.05244","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6df99ce10ea4f9f8a1275009c4129b9e18734d9b37579ab6184835870729e27a","sha256:1fe9197c54383cd88139429060251cbfecd6270a9ddeea7821c9e1cb55124f07"],"state_sha256":"24e7be1df8c88bf9b8b38046778c18397208079742a748da1b937734fad9f905"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4LjfyGO2KL0mfRLlDuKCg5PUgrORLOYfOwLokbkwWn3d74ocSjWlV5Iv84Yc2Aym6tix9AuxpFWzawI+vkelDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T04:50:01.455977Z","bundle_sha256":"6ae7c28650857505195d8fe497ebb77e47dda1184443f4b15a008589dea711a6"}}