{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:XJ4YPCHABWFALLAUMMYWVRTL56","short_pith_number":"pith:XJ4YPCHA","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"},"canonical_sha256":"ba798788e00d8a05ac1463316ac66befb518d08b1fb9e243d965589a0b5807f7","source":{"kind":"arxiv","id":"1310.5246","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.5246","created_at":"2026-05-18T01:35:33Z"},{"alias_kind":"arxiv_version","alias_value":"1310.5246v2","created_at":"2026-05-18T01:35:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5246","created_at":"2026-05-18T01:35:33Z"},{"alias_kind":"pith_short_12","alias_value":"XJ4YPCHABWFA","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XJ4YPCHABWFALLAU","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XJ4YPCHA","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:XJ4YPCHABWFALLAUMMYWVRTL56","target":"record","payload":{"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"},"canonical_sha256":"ba798788e00d8a05ac1463316ac66befb518d08b1fb9e243d965589a0b5807f7","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"},"source_kind":"arxiv","source_id":"1310.5246","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:35:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"76tRxk6HaQOVG1M6l+rG9o8rbndWrVHP29LSR6BhhCYye3JaAdfy7AJeYuYTli3INSoG4KIrfeS5hWlHK1jBDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:24:31.897500Z"},"content_sha256":"d5e8e95f16f8611463faf4197bd42469104f71e71bd03818278a7fe0d31d114e","schema_version":"1.0","event_id":"sha256:d5e8e95f16f8611463faf4197bd42469104f71e71bd03818278a7fe0d31d114e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:XJ4YPCHABWFALLAUMMYWVRTL56","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:35:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bmnuFI9oKVN5oRVp5GPrgBAy6IKohXaEqIgPdvXAGFSnnAh3l8Gs9CSeLOsOkRSeZMjCQQ/V7AAHXYZQXOY6DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:24:31.897855Z"},"content_sha256":"ccae11ba345d1e326524ae4d119a32355ee8d64abceb9ac7ec8fc96c2a244a88","schema_version":"1.0","event_id":"sha256:ccae11ba345d1e326524ae4d119a32355ee8d64abceb9ac7ec8fc96c2a244a88"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XJ4YPCHABWFALLAUMMYWVRTL56/bundle.json","state_url":"https://pith.science/pith/XJ4YPCHABWFALLAUMMYWVRTL56/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XJ4YPCHABWFALLAUMMYWVRTL56/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T10:24:31Z","links":{"resolver":"https://pith.science/pith/XJ4YPCHABWFALLAUMMYWVRTL56","bundle":"https://pith.science/pith/XJ4YPCHABWFALLAUMMYWVRTL56/bundle.json","state":"https://pith.science/pith/XJ4YPCHABWFALLAUMMYWVRTL56/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XJ4YPCHABWFALLAUMMYWVRTL56/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:XJ4YPCHABWFALLAUMMYWVRTL56","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ca404cbe1617e7a7746f7911a0bec675ae88dcb0395debbe658f0a17eccf447b","cross_cats_sorted":["cs.CC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2013-10-19T16:47:48Z","title_canon_sha256":"b7988b86383d522a66e891104dce903656dbe627fd1cbe65aa3dd58445ff988a"},"schema_version":"1.0","source":{"id":"1310.5246","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.5246","created_at":"2026-05-18T01:35:33Z"},{"alias_kind":"arxiv_version","alias_value":"1310.5246v2","created_at":"2026-05-18T01:35:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5246","created_at":"2026-05-18T01:35:33Z"},{"alias_kind":"pith_short_12","alias_value":"XJ4YPCHABWFA","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XJ4YPCHABWFALLAU","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XJ4YPCHA","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:ccae11ba345d1e326524ae4d119a32355ee8d64abceb9ac7ec8fc96c2a244a88","target":"graph","created_at":"2026-05-18T01:35:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Alexander Ushakov, Alexei Myasnikov, Andrey Nikolaev","cross_cats":["cs.CC","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2013-10-19T16:47:48Z","title":"The Post correspondence problem in groups"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5246","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d5e8e95f16f8611463faf4197bd42469104f71e71bd03818278a7fe0d31d114e","target":"record","created_at":"2026-05-18T01:35:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ca404cbe1617e7a7746f7911a0bec675ae88dcb0395debbe658f0a17eccf447b","cross_cats_sorted":["cs.CC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2013-10-19T16:47:48Z","title_canon_sha256":"b7988b86383d522a66e891104dce903656dbe627fd1cbe65aa3dd58445ff988a"},"schema_version":"1.0","source":{"id":"1310.5246","kind":"arxiv","version":2}},"canonical_sha256":"ba798788e00d8a05ac1463316ac66befb518d08b1fb9e243d965589a0b5807f7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ba798788e00d8a05ac1463316ac66befb518d08b1fb9e243d965589a0b5807f7","first_computed_at":"2026-05-18T01:35:33.107396Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:33.107396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qaX8rubbeE5JFz1NJD8PNm4wEG7WFrAX7nb1INv9+wPwG09TZjWm7OQ4icEihXCF4usZ6OYvwadtcHAuay+lBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:33.107798Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.5246","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d5e8e95f16f8611463faf4197bd42469104f71e71bd03818278a7fe0d31d114e","sha256:ccae11ba345d1e326524ae4d119a32355ee8d64abceb9ac7ec8fc96c2a244a88"],"state_sha256":"43710cc7c81a4b1469a72049ed83df62f045599e71b028f8498036353fa8e5fa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8X+FdIP8xr/wJM0PotvC3KxXCvg6p6Cio2xwfSAyZzOReUMCCtS3AyCMnAO5kTgijiA2UDxs4yXKIv/X5nOpBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T10:24:31.899937Z","bundle_sha256":"c26be502b988b52794b46cd0ee9e5ef8ffb0257abff67a9162369cb6602b093c"}}