{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:XJ4YPCHABWFALLAUMMYWVRTL56","short_pith_number":"pith:XJ4YPCHA","schema_version":"1.0","canonical_sha256":"ba798788e00d8a05ac1463316ac66befb518d08b1fb9e243d965589a0b5807f7","source":{"kind":"arxiv","id":"1310.5246","version":2},"attestation_state":"computed","paper":{"title":"The Post correspondence problem in groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.CO"],"primary_cat":"math.GR","authors_text":"Alexander Ushakov, Alexei Myasnikov, Andrey Nikolaev","submitted_at":"2013-10-19T16:47:48Z","abstract_excerpt":"We generalize the classical Post correspondence problem ($\\mathbf{PCP}_n$) and its non-homogeneous variation ($\\mathbf{GPCP}_n$) to non-commutative groups and study the computational complexity of these new problems. We observe that $\\mathbf{PCP}_n$ is closely related to the equalizer problem in groups, while $\\mathbf{GPCP}_n$ is connected to the double twisted conjugacy problem for endomorphisms. Furthermore, it is shown that one of the strongest forms of the word problem in a group $G$ (we call it the {\\em hereditary word problem}) can be reduced to $\\mathbf{GPCP}_n$ in $G$ in polynomial tim"},"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":"1310.5246","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2013-10-19T16:47:48Z","cross_cats_sorted":["cs.CC","math.CO"],"title_canon_sha256":"b7988b86383d522a66e891104dce903656dbe627fd1cbe65aa3dd58445ff988a","abstract_canon_sha256":"ca404cbe1617e7a7746f7911a0bec675ae88dcb0395debbe658f0a17eccf447b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:33.107798Z","signature_b64":"qaX8rubbeE5JFz1NJD8PNm4wEG7WFrAX7nb1INv9+wPwG09TZjWm7OQ4icEihXCF4usZ6OYvwadtcHAuay+lBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba798788e00d8a05ac1463316ac66befb518d08b1fb9e243d965589a0b5807f7","last_reissued_at":"2026-05-18T01:35:33.107396Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:33.107396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Post correspondence problem in groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.CO"],"primary_cat":"math.GR","authors_text":"Alexander Ushakov, Alexei Myasnikov, Andrey Nikolaev","submitted_at":"2013-10-19T16:47:48Z","abstract_excerpt":"We generalize the classical Post correspondence problem ($\\mathbf{PCP}_n$) and its non-homogeneous variation ($\\mathbf{GPCP}_n$) to non-commutative groups and study the computational complexity of these new problems. We observe that $\\mathbf{PCP}_n$ is closely related to the equalizer problem in groups, while $\\mathbf{GPCP}_n$ is connected to the double twisted conjugacy problem for endomorphisms. Furthermore, it is shown that one of the strongest forms of the word problem in a group $G$ (we call it the {\\em hereditary word problem}) can be reduced to $\\mathbf{GPCP}_n$ in $G$ in polynomial tim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5246","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":"1310.5246","created_at":"2026-05-18T01:35:33.107457+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.5246v2","created_at":"2026-05-18T01:35:33.107457+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5246","created_at":"2026-05-18T01:35:33.107457+00:00"},{"alias_kind":"pith_short_12","alias_value":"XJ4YPCHABWFA","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"XJ4YPCHABWFALLAU","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"XJ4YPCHA","created_at":"2026-05-18T12:28:06.772260+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/XJ4YPCHABWFALLAUMMYWVRTL56","json":"https://pith.science/pith/XJ4YPCHABWFALLAUMMYWVRTL56.json","graph_json":"https://pith.science/api/pith-number/XJ4YPCHABWFALLAUMMYWVRTL56/graph.json","events_json":"https://pith.science/api/pith-number/XJ4YPCHABWFALLAUMMYWVRTL56/events.json","paper":"https://pith.science/paper/XJ4YPCHA"},"agent_actions":{"view_html":"https://pith.science/pith/XJ4YPCHABWFALLAUMMYWVRTL56","download_json":"https://pith.science/pith/XJ4YPCHABWFALLAUMMYWVRTL56.json","view_paper":"https://pith.science/paper/XJ4YPCHA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.5246&json=true","fetch_graph":"https://pith.science/api/pith-number/XJ4YPCHABWFALLAUMMYWVRTL56/graph.json","fetch_events":"https://pith.science/api/pith-number/XJ4YPCHABWFALLAUMMYWVRTL56/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XJ4YPCHABWFALLAUMMYWVRTL56/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XJ4YPCHABWFALLAUMMYWVRTL56/action/storage_attestation","attest_author":"https://pith.science/pith/XJ4YPCHABWFALLAUMMYWVRTL56/action/author_attestation","sign_citation":"https://pith.science/pith/XJ4YPCHABWFALLAUMMYWVRTL56/action/citation_signature","submit_replication":"https://pith.science/pith/XJ4YPCHABWFALLAUMMYWVRTL56/action/replication_record"}},"created_at":"2026-05-18T01:35:33.107457+00:00","updated_at":"2026-05-18T01:35:33.107457+00:00"}