{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:2X4NR7A6TMSL7O3XCZTEVNSJAD","short_pith_number":"pith:2X4NR7A6","schema_version":"1.0","canonical_sha256":"d5f8d8fc1e9b24bfbb7716664ab64900e7612cdf8d46048e541139f7e733a096","source":{"kind":"arxiv","id":"2408.14355","version":2},"attestation_state":"computed","paper":{"title":"Contracting Self-similar Groups in Group-Based Cryptography","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"math.GR","authors_text":"Arsalan Akram Malik, Delaram Kahrobaei, Dmytro Savchuk","submitted_at":"2024-08-26T15:30:11Z","abstract_excerpt":"We propose self-similar contracting groups as a platform for cryptographic schemes based on simultaneous conjugacy search problem (SCSP). The class of these groups contains extraordinary examples like Grigorchuk group, which is known to be non-linear, thus making some of existing attacks against SCSP inapplicable. The groups in this class admit a natural normal form based on the notion of a nucleus portrait, that plays a key role in our approach. While for some groups in the class the conjugacy search problem has been studied, there are many groups for which no algorithms solving it are known."},"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":"2408.14355","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2024-08-26T15:30:11Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"f6e6b726ce2cb9dc8b0b1abad8b551d2c5cc833e3acaaaa1d2fc99b26212c48a","abstract_canon_sha256":"c7306fd05d9bcbb79de444b987bbb42db84fe07ae8827e81de545ceee297cfba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-01T02:03:18.081217Z","signature_b64":"YVPgm+X+E1co+rE/xBOeKTenBm+nIBkfORqc2rGVAJc32gwvQCu5qrNoUiIu01fcAU7XA7+BH5cmPsd0pGfQBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5f8d8fc1e9b24bfbb7716664ab64900e7612cdf8d46048e541139f7e733a096","last_reissued_at":"2026-06-01T02:03:18.080445Z","signature_status":"signed_v1","first_computed_at":"2026-06-01T02:03:18.080445Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Contracting Self-similar Groups in Group-Based Cryptography","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"math.GR","authors_text":"Arsalan Akram Malik, Delaram Kahrobaei, Dmytro Savchuk","submitted_at":"2024-08-26T15:30:11Z","abstract_excerpt":"We propose self-similar contracting groups as a platform for cryptographic schemes based on simultaneous conjugacy search problem (SCSP). The class of these groups contains extraordinary examples like Grigorchuk group, which is known to be non-linear, thus making some of existing attacks against SCSP inapplicable. The groups in this class admit a natural normal form based on the notion of a nucleus portrait, that plays a key role in our approach. While for some groups in the class the conjugacy search problem has been studied, there are many groups for which no algorithms solving it are known."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.14355","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2408.14355/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2408.14355","created_at":"2026-06-01T02:03:18.080569+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.14355v2","created_at":"2026-06-01T02:03:18.080569+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.14355","created_at":"2026-06-01T02:03:18.080569+00:00"},{"alias_kind":"pith_short_12","alias_value":"2X4NR7A6TMSL","created_at":"2026-06-01T02:03:18.080569+00:00"},{"alias_kind":"pith_short_16","alias_value":"2X4NR7A6TMSL7O3X","created_at":"2026-06-01T02:03:18.080569+00:00"},{"alias_kind":"pith_short_8","alias_value":"2X4NR7A6","created_at":"2026-06-01T02:03:18.080569+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.19649","citing_title":"A just-infinite iterated monodromy group without the congruence subgroup property","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2X4NR7A6TMSL7O3XCZTEVNSJAD","json":"https://pith.science/pith/2X4NR7A6TMSL7O3XCZTEVNSJAD.json","graph_json":"https://pith.science/api/pith-number/2X4NR7A6TMSL7O3XCZTEVNSJAD/graph.json","events_json":"https://pith.science/api/pith-number/2X4NR7A6TMSL7O3XCZTEVNSJAD/events.json","paper":"https://pith.science/paper/2X4NR7A6"},"agent_actions":{"view_html":"https://pith.science/pith/2X4NR7A6TMSL7O3XCZTEVNSJAD","download_json":"https://pith.science/pith/2X4NR7A6TMSL7O3XCZTEVNSJAD.json","view_paper":"https://pith.science/paper/2X4NR7A6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.14355&json=true","fetch_graph":"https://pith.science/api/pith-number/2X4NR7A6TMSL7O3XCZTEVNSJAD/graph.json","fetch_events":"https://pith.science/api/pith-number/2X4NR7A6TMSL7O3XCZTEVNSJAD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2X4NR7A6TMSL7O3XCZTEVNSJAD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2X4NR7A6TMSL7O3XCZTEVNSJAD/action/storage_attestation","attest_author":"https://pith.science/pith/2X4NR7A6TMSL7O3XCZTEVNSJAD/action/author_attestation","sign_citation":"https://pith.science/pith/2X4NR7A6TMSL7O3XCZTEVNSJAD/action/citation_signature","submit_replication":"https://pith.science/pith/2X4NR7A6TMSL7O3XCZTEVNSJAD/action/replication_record"}},"created_at":"2026-06-01T02:03:18.080569+00:00","updated_at":"2026-06-01T02:03:18.080569+00:00"}