{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:LY2WJFQHZIXWPYIGYK4KZILIR4","short_pith_number":"pith:LY2WJFQH","schema_version":"1.0","canonical_sha256":"5e35649607ca2f67e106c2b8aca1688f27264f350eda80ed61dcc7b231d2c26b","source":{"kind":"arxiv","id":"1407.1685","version":1},"attestation_state":"computed","paper":{"title":"Search problems in groups and branching processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Alexander Ushakov, Pavel Morar","submitted_at":"2014-07-07T12:35:14Z","abstract_excerpt":"In this paper we study complexity of randomly generated instances of Dehn search problems in finitely presented groups. We use Crump-Mode-Jagers processes to show that most of the random instances are easy. Our analysis shows that for any choice of a finitely presented platform group in Wagner-Wagner public key encryption protocol the majority of random keys can be broken by a polynomial time algorithm."},"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":"1407.1685","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2014-07-07T12:35:14Z","cross_cats_sorted":[],"title_canon_sha256":"7de211ac9055f90a67449aaac06227a6aa96ba8f9e1d1f7f01cc22d99b62f38f","abstract_canon_sha256":"f8538f48e4fc201feb43a3982e2a33648614c16ea1cd676d44a727a2a440d62c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:10.673254Z","signature_b64":"okVyRT3x7J3N5JJKGLX+GwBm1/WzP1dH1LYER7oOmd3dZIwz5GN6yTKCInkSqzZwgXreG5xyQvz69F/1CY/mCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e35649607ca2f67e106c2b8aca1688f27264f350eda80ed61dcc7b231d2c26b","last_reissued_at":"2026-05-18T02:48:10.672622Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:10.672622Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Search problems in groups and branching processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Alexander Ushakov, Pavel Morar","submitted_at":"2014-07-07T12:35:14Z","abstract_excerpt":"In this paper we study complexity of randomly generated instances of Dehn search problems in finitely presented groups. We use Crump-Mode-Jagers processes to show that most of the random instances are easy. Our analysis shows that for any choice of a finitely presented platform group in Wagner-Wagner public key encryption protocol the majority of random keys can be broken by a polynomial time algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.1685","kind":"arxiv","version":1},"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":"1407.1685","created_at":"2026-05-18T02:48:10.672704+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.1685v1","created_at":"2026-05-18T02:48:10.672704+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.1685","created_at":"2026-05-18T02:48:10.672704+00:00"},{"alias_kind":"pith_short_12","alias_value":"LY2WJFQHZIXW","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"LY2WJFQHZIXWPYIG","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"LY2WJFQH","created_at":"2026-05-18T12:28:38.356838+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/LY2WJFQHZIXWPYIGYK4KZILIR4","json":"https://pith.science/pith/LY2WJFQHZIXWPYIGYK4KZILIR4.json","graph_json":"https://pith.science/api/pith-number/LY2WJFQHZIXWPYIGYK4KZILIR4/graph.json","events_json":"https://pith.science/api/pith-number/LY2WJFQHZIXWPYIGYK4KZILIR4/events.json","paper":"https://pith.science/paper/LY2WJFQH"},"agent_actions":{"view_html":"https://pith.science/pith/LY2WJFQHZIXWPYIGYK4KZILIR4","download_json":"https://pith.science/pith/LY2WJFQHZIXWPYIGYK4KZILIR4.json","view_paper":"https://pith.science/paper/LY2WJFQH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.1685&json=true","fetch_graph":"https://pith.science/api/pith-number/LY2WJFQHZIXWPYIGYK4KZILIR4/graph.json","fetch_events":"https://pith.science/api/pith-number/LY2WJFQHZIXWPYIGYK4KZILIR4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LY2WJFQHZIXWPYIGYK4KZILIR4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LY2WJFQHZIXWPYIGYK4KZILIR4/action/storage_attestation","attest_author":"https://pith.science/pith/LY2WJFQHZIXWPYIGYK4KZILIR4/action/author_attestation","sign_citation":"https://pith.science/pith/LY2WJFQHZIXWPYIGYK4KZILIR4/action/citation_signature","submit_replication":"https://pith.science/pith/LY2WJFQHZIXWPYIGYK4KZILIR4/action/replication_record"}},"created_at":"2026-05-18T02:48:10.672704+00:00","updated_at":"2026-05-18T02:48:10.672704+00:00"}