{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4SPG62EJ7MSTLA7ABWBRCWH7AU","short_pith_number":"pith:4SPG62EJ","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"},"canonical_sha256":"e49e6f6889fb253583e00d831158ff050e64e3ee70153aefefddd1649b107ae7","source":{"kind":"arxiv","id":"1705.10417","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.10417","created_at":"2026-05-18T00:22:52Z"},{"alias_kind":"arxiv_version","alias_value":"1705.10417v2","created_at":"2026-05-18T00:22:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10417","created_at":"2026-05-18T00:22:52Z"},{"alias_kind":"pith_short_12","alias_value":"4SPG62EJ7MST","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4SPG62EJ7MSTLA7A","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4SPG62EJ","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4SPG62EJ7MSTLA7ABWBRCWH7AU","target":"record","payload":{"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"},"canonical_sha256":"e49e6f6889fb253583e00d831158ff050e64e3ee70153aefefddd1649b107ae7","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"},"source_kind":"arxiv","source_id":"1705.10417","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-18T00:22:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wIQbxwKf7nIw3tMSX7hPCxmLtjYs/ZraW6d/q70gDX7fvK4B9GFcwucOSDNgBG5JndunnoqLTkyvu0mPyz9BBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:00:34.227800Z"},"content_sha256":"3ebaf1993a0b2cc4b5a9cd3a1a93a822e1eaeb8da503de5d2a8d070c4021abff","schema_version":"1.0","event_id":"sha256:3ebaf1993a0b2cc4b5a9cd3a1a93a822e1eaeb8da503de5d2a8d070c4021abff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4SPG62EJ7MSTLA7ABWBRCWH7AU","target":"graph","payload":{"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"},"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-18T00:22:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TM7x2DrQQ3dTRZGyrubutgKykUjcY2Gfl6YqiCJ1EuqS9g9vpdfSdAnsmb32cBGlB/nMYH12apiZdrCs5nWtDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:00:34.228525Z"},"content_sha256":"9231ea63d322f972a9256e0739d32a46e13dbf99ad984d10dcded88a97ca6109","schema_version":"1.0","event_id":"sha256:9231ea63d322f972a9256e0739d32a46e13dbf99ad984d10dcded88a97ca6109"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4SPG62EJ7MSTLA7ABWBRCWH7AU/bundle.json","state_url":"https://pith.science/pith/4SPG62EJ7MSTLA7ABWBRCWH7AU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4SPG62EJ7MSTLA7ABWBRCWH7AU/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-05-25T11:00:34Z","links":{"resolver":"https://pith.science/pith/4SPG62EJ7MSTLA7ABWBRCWH7AU","bundle":"https://pith.science/pith/4SPG62EJ7MSTLA7ABWBRCWH7AU/bundle.json","state":"https://pith.science/pith/4SPG62EJ7MSTLA7ABWBRCWH7AU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4SPG62EJ7MSTLA7ABWBRCWH7AU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4SPG62EJ7MSTLA7ABWBRCWH7AU","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":"01646a42d466f197dbf40858021c256d72b204e093e28c014bdabd78c59714e8","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2017-05-30T00:01:07Z","title_canon_sha256":"913d2832167f8a68162cf352a7ec8909c8abd9c3148625e19c9dcf82c014772e"},"schema_version":"1.0","source":{"id":"1705.10417","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.10417","created_at":"2026-05-18T00:22:52Z"},{"alias_kind":"arxiv_version","alias_value":"1705.10417v2","created_at":"2026-05-18T00:22:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10417","created_at":"2026-05-18T00:22:52Z"},{"alias_kind":"pith_short_12","alias_value":"4SPG62EJ7MST","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4SPG62EJ7MSTLA7A","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4SPG62EJ","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:9231ea63d322f972a9256e0739d32a46e13dbf99ad984d10dcded88a97ca6109","target":"graph","created_at":"2026-05-18T00:22:52Z","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":"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","authors_text":"Delaram Kahrobaei, Jonathan Gryak, Robert M. Haralick","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2017-05-30T00:01:07Z","title":"Solving the Conjugacy Decision Problem via Machine Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10417","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:3ebaf1993a0b2cc4b5a9cd3a1a93a822e1eaeb8da503de5d2a8d070c4021abff","target":"record","created_at":"2026-05-18T00:22:52Z","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":"01646a42d466f197dbf40858021c256d72b204e093e28c014bdabd78c59714e8","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2017-05-30T00:01:07Z","title_canon_sha256":"913d2832167f8a68162cf352a7ec8909c8abd9c3148625e19c9dcf82c014772e"},"schema_version":"1.0","source":{"id":"1705.10417","kind":"arxiv","version":2}},"canonical_sha256":"e49e6f6889fb253583e00d831158ff050e64e3ee70153aefefddd1649b107ae7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e49e6f6889fb253583e00d831158ff050e64e3ee70153aefefddd1649b107ae7","first_computed_at":"2026-05-18T00:22:52.806370Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:52.806370Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NBMsWpaelafhR9EB5f3Mef03gj/dMBobAudZUfU0GAa0hWohj8foCmNKgxoo2ns1JqVopyFv41R+cjpMRJIrDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:52.806759Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.10417","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ebaf1993a0b2cc4b5a9cd3a1a93a822e1eaeb8da503de5d2a8d070c4021abff","sha256:9231ea63d322f972a9256e0739d32a46e13dbf99ad984d10dcded88a97ca6109"],"state_sha256":"76d8ecf42b03c25e016e39d64f9eb5d86c3e79119e52af4b80e315cc8e2dc057"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pNHT16AVtzMtcHDWTekbfJtEcKtc/+xsAeRbJIgdkbMvos6hhvl28RFHiR0kL4EmWW/Xa8pnA1vtFPVSp+raBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T11:00:34.232130Z","bundle_sha256":"fcbd22316d1f208d8e552d2eca67d877b4bb38f01cb98f39cb449093bc06eeb3"}}