{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HFTMMJB27V2TX332EQWFVV6X5F","short_pith_number":"pith:HFTMMJB2","schema_version":"1.0","canonical_sha256":"3966c6243afd753bef7a242c5ad7d7e967e5fb2bbed6be7c7a34195e50ef4b56","source":{"kind":"arxiv","id":"1610.06503","version":2},"attestation_state":"computed","paper":{"title":"On the Conjugacy Problem in Certain Metabelian Groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.GR","authors_text":"Conchita Martinez-Perez, Delaram Kahrobaei, Jonathan Gryak","submitted_at":"2016-10-20T17:08:00Z","abstract_excerpt":"Weanalyzethecomputationalcomplexityofanalgorithmtosolve the conjugacy search problem in a certain family of metabelian groups. We prove that in general the time complexity of the conjugacy search problem for these groups is at most exponential. For a subfamily of groups we prove that the conjugacy search problem is polynomial. We also show that for a different subfamily the conjugacy search problem reduces to the discrete logarithm problem."},"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":"1610.06503","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2016-10-20T17:08:00Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"579a6928e498d6eacc230444bdcb2e848dd04d5bbae8b23806885bd49facd8e7","abstract_canon_sha256":"fa735ef2a560cec8dc952a103060a67f01f2d8479b66b95fa51407d8f17d243c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:16.585634Z","signature_b64":"MgjUx8Pwdc3uTpYh8/ouOQCFVEeAovBDJutU1+N5/wWwEV3imVaeXn87ZfG11Ji4kBx344L2tkew5s+tCCrkCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3966c6243afd753bef7a242c5ad7d7e967e5fb2bbed6be7c7a34195e50ef4b56","last_reissued_at":"2026-05-17T23:50:16.584974Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:16.584974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Conjugacy Problem in Certain Metabelian Groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.GR","authors_text":"Conchita Martinez-Perez, Delaram Kahrobaei, Jonathan Gryak","submitted_at":"2016-10-20T17:08:00Z","abstract_excerpt":"Weanalyzethecomputationalcomplexityofanalgorithmtosolve the conjugacy search problem in a certain family of metabelian groups. We prove that in general the time complexity of the conjugacy search problem for these groups is at most exponential. For a subfamily of groups we prove that the conjugacy search problem is polynomial. We also show that for a different subfamily the conjugacy search problem reduces to the discrete logarithm problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.06503","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":"1610.06503","created_at":"2026-05-17T23:50:16.585058+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.06503v2","created_at":"2026-05-17T23:50:16.585058+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.06503","created_at":"2026-05-17T23:50:16.585058+00:00"},{"alias_kind":"pith_short_12","alias_value":"HFTMMJB27V2T","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"HFTMMJB27V2TX332","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"HFTMMJB2","created_at":"2026-05-18T12:30:19.053100+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/HFTMMJB27V2TX332EQWFVV6X5F","json":"https://pith.science/pith/HFTMMJB27V2TX332EQWFVV6X5F.json","graph_json":"https://pith.science/api/pith-number/HFTMMJB27V2TX332EQWFVV6X5F/graph.json","events_json":"https://pith.science/api/pith-number/HFTMMJB27V2TX332EQWFVV6X5F/events.json","paper":"https://pith.science/paper/HFTMMJB2"},"agent_actions":{"view_html":"https://pith.science/pith/HFTMMJB27V2TX332EQWFVV6X5F","download_json":"https://pith.science/pith/HFTMMJB27V2TX332EQWFVV6X5F.json","view_paper":"https://pith.science/paper/HFTMMJB2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.06503&json=true","fetch_graph":"https://pith.science/api/pith-number/HFTMMJB27V2TX332EQWFVV6X5F/graph.json","fetch_events":"https://pith.science/api/pith-number/HFTMMJB27V2TX332EQWFVV6X5F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HFTMMJB27V2TX332EQWFVV6X5F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HFTMMJB27V2TX332EQWFVV6X5F/action/storage_attestation","attest_author":"https://pith.science/pith/HFTMMJB27V2TX332EQWFVV6X5F/action/author_attestation","sign_citation":"https://pith.science/pith/HFTMMJB27V2TX332EQWFVV6X5F/action/citation_signature","submit_replication":"https://pith.science/pith/HFTMMJB27V2TX332EQWFVV6X5F/action/replication_record"}},"created_at":"2026-05-17T23:50:16.585058+00:00","updated_at":"2026-05-17T23:50:16.585058+00:00"}