{
    "candidateProfile": {
        "id": "0e65dbc0-8b0b-44f8-bbe5-64afa61b3848",
        "gender": "MALE",
        "availability": "IMMEDIATE",
        "residenceCantonCode": "ZH",
        "workLoad": 100,
        "availabilityEndDate": null,
        "showProtectedData": true,
        "workForm": [],
        "preferredWorkRegions": [],
        "preferredWorkCantons": [
            "AG",
            "ZG",
            "ZH",
            "SG",
            "SH",
            "GL",
            "SZ",
            "TG"
        ],
        "jobExperiences": [
            {
                "occupation": {
                    "avamCode": 101358,
                    "bfsCode": 51103515,
                    "chIsco3Code": 251,
                    "chIsco5Code": 25140
                },
                "experience": "LESS_THAN_1_YEAR",
                "graduation": "NONE",
                "degree": "TER_MASTER_UNIVERSITAET",
                "education": "ISCED7",
                "remark": "Sparse Neural Networks; SpGEMM; Matrix Reordering; Hypergraph Partitioning; Tensors; Numerical Linear Algebra; MPI; OpenMP; TVM-style Kernels; RecSys; Recommender Systems; Sharding/Replication; CPU Profiling; Performance Modeling (ARM/Intel); Kunpeng; Cache Coherency; NUMA; Python; C++; PyTorch; BLAS/LAPACK/MKL; NUMA affinity; thread pinning; cache-aware algorithms; ti-ling/blocking; hypergraph modeling; graph partitioning (KaHyPar/METIS/PaToH); communication-cost modeling; micro-benchmarking (Google Benchmark); Linux perf / perf stat; SQL; NumPy; Pandas; Jupyter; Feature engineering; multithreading; Data Layouts; Graphs; Hypergraph modeling, graph partitioning (e.g., METIS/KaHyPar); Docker; HPC/AI Research; Certified Training; MILP; Slurm; GraphBLAS;",
                "wanted": true,
                "lastJob": false
            },
            {
                "occupation": {
                    "avamCode": 101350,
                    "bfsCode": 29102028,
                    "chIsco3Code": 251,
                    "chIsco5Code": 25121
                },
                "experience": "MORE_THAN_3_YEARS",
                "graduation": "NOT_ACCEPTED",
                "degree": "TER_DOKTORAT_UNIVERSITAET",
                "education": "ISCED8",
                "remark": "Sparse Neural Networks; SpGEMM; Matrix Reordering; Hypergraph Partitioning; Tensors; Numerical Linear Algebra; MPI; OpenMP; TVM-style Kernels; RecSys; Recommender Systems; Sharding/Replication; CPU Profiling; Performance Modeling (ARM/Intel); Kunpeng; Cache Coherency; NUMA; Python; C++; PyTorch; BLAS/LAPACK/MKL; NUMA affinity; thread pinning; cache-aware algorithms; ti-ling/blocking; hypergraph modeling; graph partitioning (KaHyPar/METIS/PaToH); communication-cost modeling; micro-benchmarking (Google Benchmark); Linux perf / perf stat; SQL; NumPy; Pandas; Jupyter; Feature engineering; multithreading; Data Layouts; Graphs; Hypergraph modeling, graph partitioning (e.g., METIS/KaHyPar); Docker; HPC/AI Research; Certified Training; MILP; Slurm; GraphBLAS;",
                "wanted": true,
                "lastJob": true
            }
        ],
        "languages": [
            {
                "code": "de-ch",
                "writtenLevel": "NONE",
                "spokenLevel": "NONE"
            },
            {
                "code": "en",
                "writtenLevel": "PROFICIENT",
                "spokenLevel": "PROFICIENT"
            },
            {
                "code": "de",
                "writtenLevel": "BASIC",
                "spokenLevel": "BASIC"
            },
            {
                "code": "pl",
                "writtenLevel": "PROFICIENT",
                "spokenLevel": "PROFICIENT"
            }
        ],
        "drivingCategories": [],
        "highestEducationLevel": "ISCED8",
        "highestDegree": "TER_DOKTORAT_UNIVERSITAET",
        "jobCenterCode": null,
        "jobAdvisor": null,
        "contactTypes": [],
        "externalId": "AJ122908",
        "public": true,
        "protected": true
    },
    "candidateContact": null,
    "favouriteItem": null
}