{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:TG4W7Z54GXDWVLC2Z6FZFGY5FH","short_pith_number":"pith:TG4W7Z54","schema_version":"1.0","canonical_sha256":"99b96fe7bc35c76aac5acf8b929b1d29c11694ab7639b2780ed579d19aba25c9","source":{"kind":"arxiv","id":"1403.4153","version":3},"attestation_state":"computed","paper":{"title":"A family of polycyclic groups over which the uniform conjugacy problem is NP-complete","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CR"],"primary_cat":"math.GR","authors_text":"Bren Cavallo, Delaram Kahrobaei","submitted_at":"2014-03-17T16:35:11Z","abstract_excerpt":"In this paper we study the conjugacy problem in polycyclic groups. Our main result is that we construct polycyclic groups $G_n$ whose conjugacy problem is at least as hard as the subset sum problem with $n$ indeterminates. As such, the conjugacy problem over the groups $G_n$ is NP-complete where the parameters of the problem are taken in terms of $n$ and the length of the elements given on input."},"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":"1403.4153","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2014-03-17T16:35:11Z","cross_cats_sorted":["cs.CC","cs.CR"],"title_canon_sha256":"bd17dc7e8dac2512b191cae0dea223ce5aaa185f4878797b88d1d14f75115b65","abstract_canon_sha256":"66d1baba2e4c802307cb6c99b15583122fa094a7a4c9c25e5abcadf3e5298a6e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:48.349297Z","signature_b64":"NkkN3+yriBkGe1xbZOJ8ElpEklycEOsuEGtMQ+Is/ezVOya5ve+wn63UT/H9ZWfS0umOBisrQt8XhyzB1cMmBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99b96fe7bc35c76aac5acf8b929b1d29c11694ab7639b2780ed579d19aba25c9","last_reissued_at":"2026-05-18T02:39:48.348750Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:48.348750Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A family of polycyclic groups over which the uniform conjugacy problem is NP-complete","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CR"],"primary_cat":"math.GR","authors_text":"Bren Cavallo, Delaram Kahrobaei","submitted_at":"2014-03-17T16:35:11Z","abstract_excerpt":"In this paper we study the conjugacy problem in polycyclic groups. Our main result is that we construct polycyclic groups $G_n$ whose conjugacy problem is at least as hard as the subset sum problem with $n$ indeterminates. As such, the conjugacy problem over the groups $G_n$ is NP-complete where the parameters of the problem are taken in terms of $n$ and the length of the elements given on input."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.4153","kind":"arxiv","version":3},"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":"1403.4153","created_at":"2026-05-18T02:39:48.348840+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.4153v3","created_at":"2026-05-18T02:39:48.348840+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.4153","created_at":"2026-05-18T02:39:48.348840+00:00"},{"alias_kind":"pith_short_12","alias_value":"TG4W7Z54GXDW","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"TG4W7Z54GXDWVLC2","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"TG4W7Z54","created_at":"2026-05-18T12:28:49.207871+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/TG4W7Z54GXDWVLC2Z6FZFGY5FH","json":"https://pith.science/pith/TG4W7Z54GXDWVLC2Z6FZFGY5FH.json","graph_json":"https://pith.science/api/pith-number/TG4W7Z54GXDWVLC2Z6FZFGY5FH/graph.json","events_json":"https://pith.science/api/pith-number/TG4W7Z54GXDWVLC2Z6FZFGY5FH/events.json","paper":"https://pith.science/paper/TG4W7Z54"},"agent_actions":{"view_html":"https://pith.science/pith/TG4W7Z54GXDWVLC2Z6FZFGY5FH","download_json":"https://pith.science/pith/TG4W7Z54GXDWVLC2Z6FZFGY5FH.json","view_paper":"https://pith.science/paper/TG4W7Z54","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.4153&json=true","fetch_graph":"https://pith.science/api/pith-number/TG4W7Z54GXDWVLC2Z6FZFGY5FH/graph.json","fetch_events":"https://pith.science/api/pith-number/TG4W7Z54GXDWVLC2Z6FZFGY5FH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TG4W7Z54GXDWVLC2Z6FZFGY5FH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TG4W7Z54GXDWVLC2Z6FZFGY5FH/action/storage_attestation","attest_author":"https://pith.science/pith/TG4W7Z54GXDWVLC2Z6FZFGY5FH/action/author_attestation","sign_citation":"https://pith.science/pith/TG4W7Z54GXDWVLC2Z6FZFGY5FH/action/citation_signature","submit_replication":"https://pith.science/pith/TG4W7Z54GXDWVLC2Z6FZFGY5FH/action/replication_record"}},"created_at":"2026-05-18T02:39:48.348840+00:00","updated_at":"2026-05-18T02:39:48.348840+00:00"}