{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:IM2KNDZSALEKLNHGX3Z7WXX33M","short_pith_number":"pith:IM2KNDZS","schema_version":"1.0","canonical_sha256":"4334a68f3202c8a5b4e6bef3fb5efbdb16cc719df37b755a5fd87c0d9ff71485","source":{"kind":"arxiv","id":"1802.00659","version":3},"attestation_state":"computed","paper":{"title":"On the Complexity of the Cayley Semigroup Membership Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Lukas Fleischer","submitted_at":"2018-02-02T12:29:27Z","abstract_excerpt":"We investigate the complexity of deciding, given a multiplication table representing a semigroup S, a subset X of S and an element t of S, whether t can be expressed as a product of elements of X. It is well-known that this problem is NL-complete and that the more general Cayley groupoid membership problem, where the multiplication table is not required to be associative, is P-complete. For groups, the problem can be solved in deterministic log-space which raised the question of determining the exact complexity of this variant. Barrington, Kadau, Lange and McKenzie showed that for Abelian grou"},"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":"1802.00659","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-02-02T12:29:27Z","cross_cats_sorted":[],"title_canon_sha256":"c020c802c9219997d57154020ac36925d5ca2d73d18d8bea7c1795a6cc336b58","abstract_canon_sha256":"00e927a85b61d3e8abddf13e0a6827f98abe2370401ae29f961c5e23701f8135"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:31.004936Z","signature_b64":"iETprqMZS8GGb8JwPPZPOBrKInHfkLg7zjSjCgm4DLqu5U4D+aCPs9Q2ytlqsbLjdZgrRKh1wzkYOP8t2hemBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4334a68f3202c8a5b4e6bef3fb5efbdb16cc719df37b755a5fd87c0d9ff71485","last_reissued_at":"2026-05-18T00:18:31.004392Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:31.004392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Complexity of the Cayley Semigroup Membership Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Lukas Fleischer","submitted_at":"2018-02-02T12:29:27Z","abstract_excerpt":"We investigate the complexity of deciding, given a multiplication table representing a semigroup S, a subset X of S and an element t of S, whether t can be expressed as a product of elements of X. It is well-known that this problem is NL-complete and that the more general Cayley groupoid membership problem, where the multiplication table is not required to be associative, is P-complete. For groups, the problem can be solved in deterministic log-space which raised the question of determining the exact complexity of this variant. Barrington, Kadau, Lange and McKenzie showed that for Abelian grou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.00659","kind":"arxiv","version":3},"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":"1802.00659","created_at":"2026-05-18T00:18:31.004471+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.00659v3","created_at":"2026-05-18T00:18:31.004471+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.00659","created_at":"2026-05-18T00:18:31.004471+00:00"},{"alias_kind":"pith_short_12","alias_value":"IM2KNDZSALEK","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"IM2KNDZSALEKLNHG","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"IM2KNDZS","created_at":"2026-05-18T12:32:31.084164+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/IM2KNDZSALEKLNHGX3Z7WXX33M","json":"https://pith.science/pith/IM2KNDZSALEKLNHGX3Z7WXX33M.json","graph_json":"https://pith.science/api/pith-number/IM2KNDZSALEKLNHGX3Z7WXX33M/graph.json","events_json":"https://pith.science/api/pith-number/IM2KNDZSALEKLNHGX3Z7WXX33M/events.json","paper":"https://pith.science/paper/IM2KNDZS"},"agent_actions":{"view_html":"https://pith.science/pith/IM2KNDZSALEKLNHGX3Z7WXX33M","download_json":"https://pith.science/pith/IM2KNDZSALEKLNHGX3Z7WXX33M.json","view_paper":"https://pith.science/paper/IM2KNDZS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.00659&json=true","fetch_graph":"https://pith.science/api/pith-number/IM2KNDZSALEKLNHGX3Z7WXX33M/graph.json","fetch_events":"https://pith.science/api/pith-number/IM2KNDZSALEKLNHGX3Z7WXX33M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IM2KNDZSALEKLNHGX3Z7WXX33M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IM2KNDZSALEKLNHGX3Z7WXX33M/action/storage_attestation","attest_author":"https://pith.science/pith/IM2KNDZSALEKLNHGX3Z7WXX33M/action/author_attestation","sign_citation":"https://pith.science/pith/IM2KNDZSALEKLNHGX3Z7WXX33M/action/citation_signature","submit_replication":"https://pith.science/pith/IM2KNDZSALEKLNHGX3Z7WXX33M/action/replication_record"}},"created_at":"2026-05-18T00:18:31.004471+00:00","updated_at":"2026-05-18T00:18:31.004471+00:00"}