{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5T3REIEZG3C77FW6QS67RNLA6R","short_pith_number":"pith:5T3REIEZ","schema_version":"1.0","canonical_sha256":"ecf712209936c5ff96de84bdf8b560f45c217f30abd025678409fca6fb2cc6b6","source":{"kind":"arxiv","id":"1802.02420","version":2},"attestation_state":"computed","paper":{"title":"A group-theoretical interpretation of the word problem for free idempotent generated semigroups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Igor Dolinka, Victoria Gould, Yang Dandan","submitted_at":"2018-02-07T13:49:40Z","abstract_excerpt":"The set of idempotents of any semigroup carries the structure of a biordered set, which contains a great deal of information concerning the idempotent generated subsemigroup of the semigroup in question. This leads to the construction of a free idempotent generated semigroup $\\mathsf{IG}(\\mathcal{E})$ - the `free-est' semigroup with a given biordered set $\\mathcal{E}$ of idempotents. We show that when $\\mathcal{E}$ is finite, the word problem for $\\mathsf{IG}(\\mathcal{E})$ is equivalent to a family of constraint satisfaction problems involving rational subsets of direct products of pairs of ma"},"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.02420","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2018-02-07T13:49:40Z","cross_cats_sorted":[],"title_canon_sha256":"e4b0043259127bf1312a3fe7a715390e694d55605764d7c851932b36613d7c43","abstract_canon_sha256":"0abee93382148922acb65a8590ec4e45cb332bc6090b18cfb33048c492709f01"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:38.796907Z","signature_b64":"3N1HaT0+MoWdhn6EIgojYHJ8WyrnbklMpgKiYE+iKRgXXRbmpyrKgQzS4jITLFnNG+IbqK14t+z+9hxJxAn+Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecf712209936c5ff96de84bdf8b560f45c217f30abd025678409fca6fb2cc6b6","last_reissued_at":"2026-05-17T23:56:38.796354Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:38.796354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A group-theoretical interpretation of the word problem for free idempotent generated semigroups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Igor Dolinka, Victoria Gould, Yang Dandan","submitted_at":"2018-02-07T13:49:40Z","abstract_excerpt":"The set of idempotents of any semigroup carries the structure of a biordered set, which contains a great deal of information concerning the idempotent generated subsemigroup of the semigroup in question. This leads to the construction of a free idempotent generated semigroup $\\mathsf{IG}(\\mathcal{E})$ - the `free-est' semigroup with a given biordered set $\\mathcal{E}$ of idempotents. We show that when $\\mathcal{E}$ is finite, the word problem for $\\mathsf{IG}(\\mathcal{E})$ is equivalent to a family of constraint satisfaction problems involving rational subsets of direct products of pairs of ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.02420","kind":"arxiv","version":2},"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.02420","created_at":"2026-05-17T23:56:38.796451+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.02420v2","created_at":"2026-05-17T23:56:38.796451+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02420","created_at":"2026-05-17T23:56:38.796451+00:00"},{"alias_kind":"pith_short_12","alias_value":"5T3REIEZG3C7","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5T3REIEZG3C77FW6","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5T3REIEZ","created_at":"2026-05-18T12:32:08.215937+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/5T3REIEZG3C77FW6QS67RNLA6R","json":"https://pith.science/pith/5T3REIEZG3C77FW6QS67RNLA6R.json","graph_json":"https://pith.science/api/pith-number/5T3REIEZG3C77FW6QS67RNLA6R/graph.json","events_json":"https://pith.science/api/pith-number/5T3REIEZG3C77FW6QS67RNLA6R/events.json","paper":"https://pith.science/paper/5T3REIEZ"},"agent_actions":{"view_html":"https://pith.science/pith/5T3REIEZG3C77FW6QS67RNLA6R","download_json":"https://pith.science/pith/5T3REIEZG3C77FW6QS67RNLA6R.json","view_paper":"https://pith.science/paper/5T3REIEZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.02420&json=true","fetch_graph":"https://pith.science/api/pith-number/5T3REIEZG3C77FW6QS67RNLA6R/graph.json","fetch_events":"https://pith.science/api/pith-number/5T3REIEZG3C77FW6QS67RNLA6R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5T3REIEZG3C77FW6QS67RNLA6R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5T3REIEZG3C77FW6QS67RNLA6R/action/storage_attestation","attest_author":"https://pith.science/pith/5T3REIEZG3C77FW6QS67RNLA6R/action/author_attestation","sign_citation":"https://pith.science/pith/5T3REIEZG3C77FW6QS67RNLA6R/action/citation_signature","submit_replication":"https://pith.science/pith/5T3REIEZG3C77FW6QS67RNLA6R/action/replication_record"}},"created_at":"2026-05-17T23:56:38.796451+00:00","updated_at":"2026-05-17T23:56:38.796451+00:00"}