{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PXNEKYBC6LUQOAGWQET2PXOEU6","short_pith_number":"pith:PXNEKYBC","canonical_record":{"source":{"id":"1607.05819","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-07-20T04:30:22Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"d243df387fd11549bb4c05bacdf1ed9655c2b832fbccfbf623c14166a8437912","abstract_canon_sha256":"096fcbde4b5152bcb1d3cba7a6890a656bd39d9c46e33ae0ce7fd53601996b05"},"schema_version":"1.0"},"canonical_sha256":"7dda456022f2e90700d68127a7ddc4a786286f85706753e5bce4e9aa598a0c0a","source":{"kind":"arxiv","id":"1607.05819","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.05819","created_at":"2026-05-18T01:01:35Z"},{"alias_kind":"arxiv_version","alias_value":"1607.05819v2","created_at":"2026-05-18T01:01:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05819","created_at":"2026-05-18T01:01:35Z"},{"alias_kind":"pith_short_12","alias_value":"PXNEKYBC6LUQ","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PXNEKYBC6LUQOAGW","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PXNEKYBC","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PXNEKYBC6LUQOAGWQET2PXOEU6","target":"record","payload":{"canonical_record":{"source":{"id":"1607.05819","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-07-20T04:30:22Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"d243df387fd11549bb4c05bacdf1ed9655c2b832fbccfbf623c14166a8437912","abstract_canon_sha256":"096fcbde4b5152bcb1d3cba7a6890a656bd39d9c46e33ae0ce7fd53601996b05"},"schema_version":"1.0"},"canonical_sha256":"7dda456022f2e90700d68127a7ddc4a786286f85706753e5bce4e9aa598a0c0a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:35.820618Z","signature_b64":"7UAVSnXx+JB+nXuOfvSq90cmNSUhzLuGKfnsVW+SQ8ewdCEFeVJFfohQ7uW8QfzulUY/eAHvWN2UCz9ofM5bCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7dda456022f2e90700d68127a7ddc4a786286f85706753e5bce4e9aa598a0c0a","last_reissued_at":"2026-05-18T01:01:35.820061Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:35.820061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.05819","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-18T01:01:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iroL5S82tLA5tpq/9dkN+gkOaYoCY0oPtI2PaZB6TJOp5xT9u0VRltEmPqYxcf0p6lBeR9//aRmQ4SSX9Bj2AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:34:05.937815Z"},"content_sha256":"61642040dc3868d081dc121367a3bc2f3ab915260423c61e31d970454d8140d4","schema_version":"1.0","event_id":"sha256:61642040dc3868d081dc121367a3bc2f3ab915260423c61e31d970454d8140d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PXNEKYBC6LUQOAGWQET2PXOEU6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Status of Polycyclic Group-Based Cryptography: A Survey and Open Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"cs.CR","authors_text":"Delaram Kahrobaei, Jonathan Gryak","submitted_at":"2016-07-20T04:30:22Z","abstract_excerpt":"Polycyclic groups are natural generalizations of cyclic groups but with more complicated algorithmic properties. They are finitely presented and the word, conjugacy, and isomorphism decision problems are all solvable in these groups. Moreover, the non-virtually nilpotent ones exhibit an exponential growth rate. These properties make them suitable for use in group-based cryptography, which was proposed in 2004 by Eick and Kahrobaei. Since then, many cryptosystems have been created that employ polycyclic groups. These include key exchanges such as non-commutative ElGamal, authentication schemes "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05819","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-18T01:01:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VMNkVghYfOVPODXQYKUpnY5w5LQdgdpMGSXnaPTg2pl1tviPl1/2f57FT6bLcnrhZUP9v3mZFtVHAm2GOAizCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:34:05.938537Z"},"content_sha256":"2b8e75abe38edebe7c436c21f8b4ea67bd3de7badb05dd430164f9c044055c72","schema_version":"1.0","event_id":"sha256:2b8e75abe38edebe7c436c21f8b4ea67bd3de7badb05dd430164f9c044055c72"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PXNEKYBC6LUQOAGWQET2PXOEU6/bundle.json","state_url":"https://pith.science/pith/PXNEKYBC6LUQOAGWQET2PXOEU6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PXNEKYBC6LUQOAGWQET2PXOEU6/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-25T21:34:05Z","links":{"resolver":"https://pith.science/pith/PXNEKYBC6LUQOAGWQET2PXOEU6","bundle":"https://pith.science/pith/PXNEKYBC6LUQOAGWQET2PXOEU6/bundle.json","state":"https://pith.science/pith/PXNEKYBC6LUQOAGWQET2PXOEU6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PXNEKYBC6LUQOAGWQET2PXOEU6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PXNEKYBC6LUQOAGWQET2PXOEU6","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":"096fcbde4b5152bcb1d3cba7a6890a656bd39d9c46e33ae0ce7fd53601996b05","cross_cats_sorted":["math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-07-20T04:30:22Z","title_canon_sha256":"d243df387fd11549bb4c05bacdf1ed9655c2b832fbccfbf623c14166a8437912"},"schema_version":"1.0","source":{"id":"1607.05819","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.05819","created_at":"2026-05-18T01:01:35Z"},{"alias_kind":"arxiv_version","alias_value":"1607.05819v2","created_at":"2026-05-18T01:01:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05819","created_at":"2026-05-18T01:01:35Z"},{"alias_kind":"pith_short_12","alias_value":"PXNEKYBC6LUQ","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PXNEKYBC6LUQOAGW","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PXNEKYBC","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:2b8e75abe38edebe7c436c21f8b4ea67bd3de7badb05dd430164f9c044055c72","target":"graph","created_at":"2026-05-18T01:01:35Z","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":"Polycyclic groups are natural generalizations of cyclic groups but with more complicated algorithmic properties. They are finitely presented and the word, conjugacy, and isomorphism decision problems are all solvable in these groups. Moreover, the non-virtually nilpotent ones exhibit an exponential growth rate. These properties make them suitable for use in group-based cryptography, which was proposed in 2004 by Eick and Kahrobaei. Since then, many cryptosystems have been created that employ polycyclic groups. These include key exchanges such as non-commutative ElGamal, authentication schemes ","authors_text":"Delaram Kahrobaei, Jonathan Gryak","cross_cats":["math.GR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-07-20T04:30:22Z","title":"The Status of Polycyclic Group-Based Cryptography: A Survey and Open Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05819","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:61642040dc3868d081dc121367a3bc2f3ab915260423c61e31d970454d8140d4","target":"record","created_at":"2026-05-18T01:01:35Z","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":"096fcbde4b5152bcb1d3cba7a6890a656bd39d9c46e33ae0ce7fd53601996b05","cross_cats_sorted":["math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-07-20T04:30:22Z","title_canon_sha256":"d243df387fd11549bb4c05bacdf1ed9655c2b832fbccfbf623c14166a8437912"},"schema_version":"1.0","source":{"id":"1607.05819","kind":"arxiv","version":2}},"canonical_sha256":"7dda456022f2e90700d68127a7ddc4a786286f85706753e5bce4e9aa598a0c0a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7dda456022f2e90700d68127a7ddc4a786286f85706753e5bce4e9aa598a0c0a","first_computed_at":"2026-05-18T01:01:35.820061Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:35.820061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7UAVSnXx+JB+nXuOfvSq90cmNSUhzLuGKfnsVW+SQ8ewdCEFeVJFfohQ7uW8QfzulUY/eAHvWN2UCz9ofM5bCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:35.820618Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.05819","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:61642040dc3868d081dc121367a3bc2f3ab915260423c61e31d970454d8140d4","sha256:2b8e75abe38edebe7c436c21f8b4ea67bd3de7badb05dd430164f9c044055c72"],"state_sha256":"23471eb2a40064d7201dae4d4c8f7ca207354c3235dd0bb9a878711a0d049b9c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AVSTMsx8VytJNyfx2YmhK29L5XmPwnmMCi2psLGnguPbSew20pZgmoeyvBcAJVo1kV3pGxiL3lnhVSw5RMCWAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T21:34:05.942408Z","bundle_sha256":"ce9e84bc1276455552e9c1f459c22f18d3cb26e727d69bf77c0c5efcdb8d4993"}}