{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:BG2GVD45WZUVMGVN42CLXRCDIE","short_pith_number":"pith:BG2GVD45","schema_version":"1.0","canonical_sha256":"09b46a8f9db669561aade684bbc443412ccd4ce475cbe6a4c9c1bdd6850e1c1d","source":{"kind":"arxiv","id":"1309.4519","version":1},"attestation_state":"computed","paper":{"title":"Decision and Search in Non-abelian Cramer Shoup Public Key Cryptosystem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"math.GR","authors_text":"Delaram Kahrobaei, Michael Anshel","submitted_at":"2013-09-18T01:51:41Z","abstract_excerpt":"A method for non-abelian Cramer-Shoup cryptosystem is presented. The role of decision and search is explored, and the platform of solvable/polycyclic group is suggested. In the process we review recent progress in non-abelian cryptography and post some open problems that naturally arise from this path of research."},"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":"1309.4519","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2013-09-18T01:51:41Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"11a34c044621fba38039533fd155e9805e8a5c4016f91e3e9511360470f7ec89","abstract_canon_sha256":"96cf7ad6a3abf7a51ae057e8c84d1612b4a3f39eea97375ab5c76e7c4cdbdab9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:59.184992Z","signature_b64":"o2UjLuWacm4Wasof/hPAjt/vNOKmklixDMoPftq05bXAdQvqV8Qy6SBqfaXmhTKKzYtk4FjRZOKoel883q/SCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09b46a8f9db669561aade684bbc443412ccd4ce475cbe6a4c9c1bdd6850e1c1d","last_reissued_at":"2026-05-18T03:12:59.184070Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:59.184070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decision and Search in Non-abelian Cramer Shoup Public Key Cryptosystem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"math.GR","authors_text":"Delaram Kahrobaei, Michael Anshel","submitted_at":"2013-09-18T01:51:41Z","abstract_excerpt":"A method for non-abelian Cramer-Shoup cryptosystem is presented. The role of decision and search is explored, and the platform of solvable/polycyclic group is suggested. In the process we review recent progress in non-abelian cryptography and post some open problems that naturally arise from this path of research."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.4519","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":"1309.4519","created_at":"2026-05-18T03:12:59.184208+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.4519v1","created_at":"2026-05-18T03:12:59.184208+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.4519","created_at":"2026-05-18T03:12:59.184208+00:00"},{"alias_kind":"pith_short_12","alias_value":"BG2GVD45WZUV","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"BG2GVD45WZUVMGVN","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"BG2GVD45","created_at":"2026-05-18T12:27:38.830355+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/BG2GVD45WZUVMGVN42CLXRCDIE","json":"https://pith.science/pith/BG2GVD45WZUVMGVN42CLXRCDIE.json","graph_json":"https://pith.science/api/pith-number/BG2GVD45WZUVMGVN42CLXRCDIE/graph.json","events_json":"https://pith.science/api/pith-number/BG2GVD45WZUVMGVN42CLXRCDIE/events.json","paper":"https://pith.science/paper/BG2GVD45"},"agent_actions":{"view_html":"https://pith.science/pith/BG2GVD45WZUVMGVN42CLXRCDIE","download_json":"https://pith.science/pith/BG2GVD45WZUVMGVN42CLXRCDIE.json","view_paper":"https://pith.science/paper/BG2GVD45","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.4519&json=true","fetch_graph":"https://pith.science/api/pith-number/BG2GVD45WZUVMGVN42CLXRCDIE/graph.json","fetch_events":"https://pith.science/api/pith-number/BG2GVD45WZUVMGVN42CLXRCDIE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BG2GVD45WZUVMGVN42CLXRCDIE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BG2GVD45WZUVMGVN42CLXRCDIE/action/storage_attestation","attest_author":"https://pith.science/pith/BG2GVD45WZUVMGVN42CLXRCDIE/action/author_attestation","sign_citation":"https://pith.science/pith/BG2GVD45WZUVMGVN42CLXRCDIE/action/citation_signature","submit_replication":"https://pith.science/pith/BG2GVD45WZUVMGVN42CLXRCDIE/action/replication_record"}},"created_at":"2026-05-18T03:12:59.184208+00:00","updated_at":"2026-05-18T03:12:59.184208+00:00"}