{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:L4XLFLGJ3MULQLZXSCQP4GW6BW","short_pith_number":"pith:L4XLFLGJ","schema_version":"1.0","canonical_sha256":"5f2eb2acc9db28b82f3790a0fe1ade0da1c6585a555918d6e156bbe73aee8eb2","source":{"kind":"arxiv","id":"1806.04996","version":1},"attestation_state":"computed","paper":{"title":"The Intersection Problem for Finite Semigroups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Lukas Fleischer","submitted_at":"2018-06-13T12:54:10Z","abstract_excerpt":"We investigate the intersection problem for finite semigroups, which asks for a given set of regular languages, represented by recognizing morphisms to finite semigroups, whether there exists a word contained in their intersection. We introduce compressibility measures as a useful tool to classify the intersection problem for certain classes of finite semigroups into circuit complexity classes and Turing machine complexity classes. Using this framework, we obtain a new and simple proof that for groups and commutative semigroups, the problem is contained in NP. We uncover certain structural and"},"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":"1806.04996","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-06-13T12:54:10Z","cross_cats_sorted":[],"title_canon_sha256":"279bc6dd692d6d23173a5b6b516d8e45af5eb2769f727ea028e9a2151ba71d88","abstract_canon_sha256":"66a023135575220286635e10bf7212266d2d8f42cd3c5eeec13b89a356b1c07a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:20.395280Z","signature_b64":"MzUT8S+9SUrqxnjmJGhIXX1kUWdDsxtYQWFiHOfpCElDjekGZQSpfex/itK73JO5XW30cUnHoHRaUTZNckouDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f2eb2acc9db28b82f3790a0fe1ade0da1c6585a555918d6e156bbe73aee8eb2","last_reissued_at":"2026-05-18T00:13:20.394718Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:20.394718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Intersection Problem for Finite Semigroups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Lukas Fleischer","submitted_at":"2018-06-13T12:54:10Z","abstract_excerpt":"We investigate the intersection problem for finite semigroups, which asks for a given set of regular languages, represented by recognizing morphisms to finite semigroups, whether there exists a word contained in their intersection. We introduce compressibility measures as a useful tool to classify the intersection problem for certain classes of finite semigroups into circuit complexity classes and Turing machine complexity classes. Using this framework, we obtain a new and simple proof that for groups and commutative semigroups, the problem is contained in NP. We uncover certain structural and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04996","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1806.04996","created_at":"2026-05-18T00:13:20.394785+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.04996v1","created_at":"2026-05-18T00:13:20.394785+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04996","created_at":"2026-05-18T00:13:20.394785+00:00"},{"alias_kind":"pith_short_12","alias_value":"L4XLFLGJ3MUL","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"L4XLFLGJ3MULQLZX","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"L4XLFLGJ","created_at":"2026-05-18T12:32:33.847187+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/L4XLFLGJ3MULQLZXSCQP4GW6BW","json":"https://pith.science/pith/L4XLFLGJ3MULQLZXSCQP4GW6BW.json","graph_json":"https://pith.science/api/pith-number/L4XLFLGJ3MULQLZXSCQP4GW6BW/graph.json","events_json":"https://pith.science/api/pith-number/L4XLFLGJ3MULQLZXSCQP4GW6BW/events.json","paper":"https://pith.science/paper/L4XLFLGJ"},"agent_actions":{"view_html":"https://pith.science/pith/L4XLFLGJ3MULQLZXSCQP4GW6BW","download_json":"https://pith.science/pith/L4XLFLGJ3MULQLZXSCQP4GW6BW.json","view_paper":"https://pith.science/paper/L4XLFLGJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.04996&json=true","fetch_graph":"https://pith.science/api/pith-number/L4XLFLGJ3MULQLZXSCQP4GW6BW/graph.json","fetch_events":"https://pith.science/api/pith-number/L4XLFLGJ3MULQLZXSCQP4GW6BW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L4XLFLGJ3MULQLZXSCQP4GW6BW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L4XLFLGJ3MULQLZXSCQP4GW6BW/action/storage_attestation","attest_author":"https://pith.science/pith/L4XLFLGJ3MULQLZXSCQP4GW6BW/action/author_attestation","sign_citation":"https://pith.science/pith/L4XLFLGJ3MULQLZXSCQP4GW6BW/action/citation_signature","submit_replication":"https://pith.science/pith/L4XLFLGJ3MULQLZXSCQP4GW6BW/action/replication_record"}},"created_at":"2026-05-18T00:13:20.394785+00:00","updated_at":"2026-05-18T00:13:20.394785+00:00"}