{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:ZOBOC4IKU45RWICS2UFLL6GRGP","short_pith_number":"pith:ZOBOC4IK","schema_version":"1.0","canonical_sha256":"cb82e1710aa73b1b2052d50ab5f8d133cff0f7d7f8e9a3e62b23f34be40ff4a1","source":{"kind":"arxiv","id":"1105.1905","version":1},"attestation_state":"computed","paper":{"title":"Amalgams of inverse semigroups and reversible two-counter machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Emanuele Rodaro, Pedro V. Silva","submitted_at":"2011-05-10T10:50:31Z","abstract_excerpt":"We show that the word problem for an amalgam $[S_1,S_2;U,\\omega_1,\\omega_2]$ of inverse semigroups may be undecidable even if we assume $S_1$ and $S_2$ (and therefore $U$) to have finite $\\mathcal{R}$-classes and $\\omega_1,\\omega_2$ to be computable functions, interrupting a series of positive decidability results on the subject. This is achieved by encoding into an appropriate amalgam of inverse semigroups 2-counter machines with sufficient universality, and relating the nature of certain \\sch graphs to sequences of computations in the machine."},"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":"1105.1905","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2011-05-10T10:50:31Z","cross_cats_sorted":[],"title_canon_sha256":"7cbd0eb218414123dc9dc5a4e22e205721dd2b2b2b19f40d12eac966c195e3e5","abstract_canon_sha256":"078747cff85790f977128f46f61b18032a565b9ac3dd104d3c178b3da0d7a1c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:56.501268Z","signature_b64":"k7UqyKTTEL9GfMiHRUCwMnYd1puvrK05eo+2tOR1flz/Qnz+AyL3DvDYeU1zTQweo36iTqW1hMcEiCbnr5PvBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb82e1710aa73b1b2052d50ab5f8d133cff0f7d7f8e9a3e62b23f34be40ff4a1","last_reissued_at":"2026-05-18T03:28:56.500358Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:56.500358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Amalgams of inverse semigroups and reversible two-counter machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Emanuele Rodaro, Pedro V. Silva","submitted_at":"2011-05-10T10:50:31Z","abstract_excerpt":"We show that the word problem for an amalgam $[S_1,S_2;U,\\omega_1,\\omega_2]$ of inverse semigroups may be undecidable even if we assume $S_1$ and $S_2$ (and therefore $U$) to have finite $\\mathcal{R}$-classes and $\\omega_1,\\omega_2$ to be computable functions, interrupting a series of positive decidability results on the subject. This is achieved by encoding into an appropriate amalgam of inverse semigroups 2-counter machines with sufficient universality, and relating the nature of certain \\sch graphs to sequences of computations in the machine."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.1905","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":"1105.1905","created_at":"2026-05-18T03:28:56.500488+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.1905v1","created_at":"2026-05-18T03:28:56.500488+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.1905","created_at":"2026-05-18T03:28:56.500488+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZOBOC4IKU45R","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZOBOC4IKU45RWICS","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZOBOC4IK","created_at":"2026-05-18T12:26:50.516681+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/ZOBOC4IKU45RWICS2UFLL6GRGP","json":"https://pith.science/pith/ZOBOC4IKU45RWICS2UFLL6GRGP.json","graph_json":"https://pith.science/api/pith-number/ZOBOC4IKU45RWICS2UFLL6GRGP/graph.json","events_json":"https://pith.science/api/pith-number/ZOBOC4IKU45RWICS2UFLL6GRGP/events.json","paper":"https://pith.science/paper/ZOBOC4IK"},"agent_actions":{"view_html":"https://pith.science/pith/ZOBOC4IKU45RWICS2UFLL6GRGP","download_json":"https://pith.science/pith/ZOBOC4IKU45RWICS2UFLL6GRGP.json","view_paper":"https://pith.science/paper/ZOBOC4IK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.1905&json=true","fetch_graph":"https://pith.science/api/pith-number/ZOBOC4IKU45RWICS2UFLL6GRGP/graph.json","fetch_events":"https://pith.science/api/pith-number/ZOBOC4IKU45RWICS2UFLL6GRGP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZOBOC4IKU45RWICS2UFLL6GRGP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZOBOC4IKU45RWICS2UFLL6GRGP/action/storage_attestation","attest_author":"https://pith.science/pith/ZOBOC4IKU45RWICS2UFLL6GRGP/action/author_attestation","sign_citation":"https://pith.science/pith/ZOBOC4IKU45RWICS2UFLL6GRGP/action/citation_signature","submit_replication":"https://pith.science/pith/ZOBOC4IKU45RWICS2UFLL6GRGP/action/replication_record"}},"created_at":"2026-05-18T03:28:56.500488+00:00","updated_at":"2026-05-18T03:28:56.500488+00:00"}