{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:CERPX46PRK3TUASGXROOQVPXSC","short_pith_number":"pith:CERPX46P","schema_version":"1.0","canonical_sha256":"1122fbf3cf8ab73a0246bc5ce855f790898d4860e141798664e92b4bd6cddf00","source":{"kind":"arxiv","id":"1309.5314","version":2},"attestation_state":"computed","paper":{"title":"Conjugacy in Baumslag's group, generic case complexity, and division in power circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.GR"],"primary_cat":"cs.DM","authors_text":"Alexei Miasnikov, Armin Wei{\\ss}, Volker Diekert","submitted_at":"2013-09-20T16:34:42Z","abstract_excerpt":"The conjugacy problem belongs to algorithmic group theory. It is the following question: given two words x, y over generators of a fixed group G, decide whether x and y are conjugated, i.e., whether there exists some z such that zxz^{-1} = y in G. The conjugacy problem is more difficult than the word problem, in general. We investigate the complexity of the conjugacy problem for two prominent groups: the Baumslag-Solitar group BS(1,2) and the Baumslag(-Gersten) group G(1,2). The conjugacy problem in BS(1,2) is TC^0-complete. To the best of our knowledge BS(1,2) is the first natural infinite no"},"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":"1309.5314","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-20T16:34:42Z","cross_cats_sorted":["cs.CC","math.GR"],"title_canon_sha256":"079ce25a4d68b2a7d84aacaf0c6a4201b9417467877528861e2304d3704a2891","abstract_canon_sha256":"e1e7f98b5d8d3a3e45c8b8d6db7e1f46f77eaa51490b02783877b8bb0340d9d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:29.998984Z","signature_b64":"v8kNtW+UOV8ZuLDf89E2X2Ci16Gpu/BYxH2Xgcm9GARPSyLGrIf83WlWUvmYUjnM4dwQYUUZ0YltimrzLMsrCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1122fbf3cf8ab73a0246bc5ce855f790898d4860e141798664e92b4bd6cddf00","last_reissued_at":"2026-05-18T01:16:29.998494Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:29.998494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Conjugacy in Baumslag's group, generic case complexity, and division in power circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.GR"],"primary_cat":"cs.DM","authors_text":"Alexei Miasnikov, Armin Wei{\\ss}, Volker Diekert","submitted_at":"2013-09-20T16:34:42Z","abstract_excerpt":"The conjugacy problem belongs to algorithmic group theory. It is the following question: given two words x, y over generators of a fixed group G, decide whether x and y are conjugated, i.e., whether there exists some z such that zxz^{-1} = y in G. The conjugacy problem is more difficult than the word problem, in general. We investigate the complexity of the conjugacy problem for two prominent groups: the Baumslag-Solitar group BS(1,2) and the Baumslag(-Gersten) group G(1,2). The conjugacy problem in BS(1,2) is TC^0-complete. To the best of our knowledge BS(1,2) is the first natural infinite no"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5314","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":"1309.5314","created_at":"2026-05-18T01:16:29.998569+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.5314v2","created_at":"2026-05-18T01:16:29.998569+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5314","created_at":"2026-05-18T01:16:29.998569+00:00"},{"alias_kind":"pith_short_12","alias_value":"CERPX46PRK3T","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"CERPX46PRK3TUASG","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"CERPX46P","created_at":"2026-05-18T12:27:40.988391+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/CERPX46PRK3TUASGXROOQVPXSC","json":"https://pith.science/pith/CERPX46PRK3TUASGXROOQVPXSC.json","graph_json":"https://pith.science/api/pith-number/CERPX46PRK3TUASGXROOQVPXSC/graph.json","events_json":"https://pith.science/api/pith-number/CERPX46PRK3TUASGXROOQVPXSC/events.json","paper":"https://pith.science/paper/CERPX46P"},"agent_actions":{"view_html":"https://pith.science/pith/CERPX46PRK3TUASGXROOQVPXSC","download_json":"https://pith.science/pith/CERPX46PRK3TUASGXROOQVPXSC.json","view_paper":"https://pith.science/paper/CERPX46P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.5314&json=true","fetch_graph":"https://pith.science/api/pith-number/CERPX46PRK3TUASGXROOQVPXSC/graph.json","fetch_events":"https://pith.science/api/pith-number/CERPX46PRK3TUASGXROOQVPXSC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CERPX46PRK3TUASGXROOQVPXSC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CERPX46PRK3TUASGXROOQVPXSC/action/storage_attestation","attest_author":"https://pith.science/pith/CERPX46PRK3TUASGXROOQVPXSC/action/author_attestation","sign_citation":"https://pith.science/pith/CERPX46PRK3TUASGXROOQVPXSC/action/citation_signature","submit_replication":"https://pith.science/pith/CERPX46PRK3TUASGXROOQVPXSC/action/replication_record"}},"created_at":"2026-05-18T01:16:29.998569+00:00","updated_at":"2026-05-18T01:16:29.998569+00:00"}