{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4SPG62EJ7MSTLA7ABWBRCWH7AU","short_pith_number":"pith:4SPG62EJ","schema_version":"1.0","canonical_sha256":"e49e6f6889fb253583e00d831158ff050e64e3ee70153aefefddd1649b107ae7","source":{"kind":"arxiv","id":"1705.10417","version":2},"attestation_state":"computed","paper":{"title":"Solving the Conjugacy Decision Problem via Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.GR","authors_text":"Delaram Kahrobaei, Jonathan Gryak, Robert M. Haralick","submitted_at":"2017-05-30T00:01:07Z","abstract_excerpt":"Machine learning and pattern recognition techniques have been successfully applied to algorithmic problems in free groups. In this paper, we seek to extend these techniques to finitely presented non-free groups, with a particular emphasis on polycyclic and metabelian groups that are of interest to non-commutative cryptography.\n  As a prototypical example, we utilize supervised learning methods to construct classifiers that can solve the conjugacy decision problem, i.e., determine whether or not a pair of elements from a specified group are conjugate. The accuracies of classifiers created using"},"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":"1705.10417","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2017-05-30T00:01:07Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"913d2832167f8a68162cf352a7ec8909c8abd9c3148625e19c9dcf82c014772e","abstract_canon_sha256":"01646a42d466f197dbf40858021c256d72b204e093e28c014bdabd78c59714e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:52.806759Z","signature_b64":"NBMsWpaelafhR9EB5f3Mef03gj/dMBobAudZUfU0GAa0hWohj8foCmNKgxoo2ns1JqVopyFv41R+cjpMRJIrDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e49e6f6889fb253583e00d831158ff050e64e3ee70153aefefddd1649b107ae7","last_reissued_at":"2026-05-18T00:22:52.806370Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:52.806370Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving the Conjugacy Decision Problem via Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.GR","authors_text":"Delaram Kahrobaei, Jonathan Gryak, Robert M. Haralick","submitted_at":"2017-05-30T00:01:07Z","abstract_excerpt":"Machine learning and pattern recognition techniques have been successfully applied to algorithmic problems in free groups. In this paper, we seek to extend these techniques to finitely presented non-free groups, with a particular emphasis on polycyclic and metabelian groups that are of interest to non-commutative cryptography.\n  As a prototypical example, we utilize supervised learning methods to construct classifiers that can solve the conjugacy decision problem, i.e., determine whether or not a pair of elements from a specified group are conjugate. The accuracies of classifiers created using"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10417","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":"1705.10417","created_at":"2026-05-18T00:22:52.806430+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.10417v2","created_at":"2026-05-18T00:22:52.806430+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10417","created_at":"2026-05-18T00:22:52.806430+00:00"},{"alias_kind":"pith_short_12","alias_value":"4SPG62EJ7MST","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"4SPG62EJ7MSTLA7A","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"4SPG62EJ","created_at":"2026-05-18T12:31:00.734936+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/4SPG62EJ7MSTLA7ABWBRCWH7AU","json":"https://pith.science/pith/4SPG62EJ7MSTLA7ABWBRCWH7AU.json","graph_json":"https://pith.science/api/pith-number/4SPG62EJ7MSTLA7ABWBRCWH7AU/graph.json","events_json":"https://pith.science/api/pith-number/4SPG62EJ7MSTLA7ABWBRCWH7AU/events.json","paper":"https://pith.science/paper/4SPG62EJ"},"agent_actions":{"view_html":"https://pith.science/pith/4SPG62EJ7MSTLA7ABWBRCWH7AU","download_json":"https://pith.science/pith/4SPG62EJ7MSTLA7ABWBRCWH7AU.json","view_paper":"https://pith.science/paper/4SPG62EJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.10417&json=true","fetch_graph":"https://pith.science/api/pith-number/4SPG62EJ7MSTLA7ABWBRCWH7AU/graph.json","fetch_events":"https://pith.science/api/pith-number/4SPG62EJ7MSTLA7ABWBRCWH7AU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4SPG62EJ7MSTLA7ABWBRCWH7AU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4SPG62EJ7MSTLA7ABWBRCWH7AU/action/storage_attestation","attest_author":"https://pith.science/pith/4SPG62EJ7MSTLA7ABWBRCWH7AU/action/author_attestation","sign_citation":"https://pith.science/pith/4SPG62EJ7MSTLA7ABWBRCWH7AU/action/citation_signature","submit_replication":"https://pith.science/pith/4SPG62EJ7MSTLA7ABWBRCWH7AU/action/replication_record"}},"created_at":"2026-05-18T00:22:52.806430+00:00","updated_at":"2026-05-18T00:22:52.806430+00:00"}