{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/privacy-preserving/papers/ran/2","list_of":"/task/privacy-preserving","task":"Privacy Preserving","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":2,"pages_in_order":2,"rows_per_page":100,"rows":[101,127],"of":127,"counts":{"archive_papers_tagged":2975,"with_a_code_link":758,"where_syntology_ran_a_sample":127,"not_listed_spam_title":0,"listed":2975,"listed_where_code_ran":127,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":112,"every_run_a_failure_of_syntologys_instrument":15,"listed_with_a_run_with_no_instrument_failure":112,"listed_every_run_a_failure_of_syntologys_instrument":15,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/privacy-preserving/papers/ran/1","prev":"/task/privacy-preserving/papers/ran/1","next":null,"papers":[{"url":"/paper/rofl-attestable-robustness-for-secure","slug":"rofl-attestable-robustness-for-secure","title":"RoFL: Robustness of Secure Federated Learning","date":"2021-07-07","arxiv_id":"2107.03311","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/rofl-attestable-robustness-for-secure#ran","syntology_url":"https://syntology.ai/paper/2107.03311","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.03311"}},"official":{"repos":["pps-lab/fl-analysis","pps-lab/rofl-project-code"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/gradient-leakage-resilient-federated-learning","slug":"gradient-leakage-resilient-federated-learning","title":"Gradient-Leakage Resilient Federated Learning","date":"2021-07-02","arxiv_id":"2107.01154","repositories_listed":2,"syntology":{"n":12,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":1,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/gradient-leakage-resilient-federated-learning#ran","syntology_url":"https://syntology.ai/paper/2107.01154","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.01154"}},"official":{"repos":["git-disl/ESORICS20-CPL"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/antipodes-of-label-differential-privacy-pate","slug":"antipodes-of-label-differential-privacy-pate","title":"Antipodes of Label Differential Privacy: PATE and ALIBI","date":"2021-06-07","arxiv_id":"2106.03408","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":1,"n_honours":5,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 5 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/antipodes-of-label-differential-privacy-pate#ran","syntology_url":"https://syntology.ai/paper/2106.03408","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.03408"}},"official":{"repos":["facebookresearch/label_dp_antipodes"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["community","official"]}}},{"url":"/paper/differential-privacy-for-text-analytics-via","slug":"differential-privacy-for-text-analytics-via","title":"Differential Privacy for Text Analytics via Natural Text Sanitization","date":"2021-06-02","arxiv_id":"2106.01221","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/differential-privacy-for-text-analytics-via#ran","syntology_url":"https://syntology.ai/paper/2106.01221","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.01221"}},"official":{"repos":["xiangyue9607/SanText"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/privacy-preserving-portrait-matting","slug":"privacy-preserving-portrait-matting","title":"Privacy-Preserving Portrait Matting","date":"2021-04-29","arxiv_id":"2104.14222","repositories_listed":2,"syntology":{"n":15,"n_ran":13,"n_constructed":0,"n_ran_checked":9,"n_instrument":4,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":8,"n_pointer_only":3,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/privacy-preserving-portrait-matting#ran","syntology_url":"https://syntology.ai/paper/2104.14222","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.14222"}},"official":{"repos":["JizhiziLi/P3M"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/see-through-gradients-image-batch-recovery","slug":"see-through-gradients-image-batch-recovery","title":"See through Gradients: Image Batch Recovery via GradInversion","date":"2021-04-15","arxiv_id":"2104.07586","repositories_listed":1,"syntology":{"n":13,"n_ran":12,"n_constructed":1,"n_ran_checked":5,"n_instrument":7,"n_unverified":1,"n_honours":4,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"12 ran (of which 1 constructed an object rather than computing a result; 5 with no instrument failure: 4 honoured, 0 violated, 1 with no contract checked; 7 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/see-through-gradients-image-batch-recovery#ran","syntology_url":"https://syntology.ai/paper/2104.07586","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.07586"}},"official":null}},{"url":"/paper/privacy-preserving-graph-convolutional","slug":"privacy-preserving-graph-convolutional","title":"Privacy-Preserving Graph Convolutional Networks for Text Classification","date":"2021-02-10","arxiv_id":"2102.09604","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/privacy-preserving-graph-convolutional#ran","syntology_url":"https://syntology.ai/paper/2102.09604","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.09604"}},"official":{"repos":["trusthlt/privacy-preserving-gcn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/private-outsourced-bayesian-optimization","slug":"private-outsourced-bayesian-optimization","title":"Private Outsourced Bayesian Optimization","date":"2020-10-24","arxiv_id":"2010.12799","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/private-outsourced-bayesian-optimization#ran","syntology_url":"https://syntology.ai/paper/2010.12799","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.12799"}},"official":{"repos":["Mitan/po-gp-ucb"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-agent-trust-region-policy-optimization","slug":"multi-agent-trust-region-policy-optimization","title":"Multi-Agent Trust Region Policy Optimization","date":"2020-10-15","arxiv_id":"2010.07916","repositories_listed":1,"syntology":{"n":18,"n_ran":16,"n_constructed":0,"n_ran_checked":14,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":7,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/multi-agent-trust-region-policy-optimization#ran","syntology_url":"https://syntology.ai/paper/2010.07916","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.07916"}},"official":null}},{"url":"/paper/adversarial-privacy-preserving-filter","slug":"adversarial-privacy-preserving-filter","title":"Adversarial Privacy-preserving Filter","date":"2020-07-25","arxiv_id":"2007.12861","repositories_listed":2,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/adversarial-privacy-preserving-filter#ran","syntology_url":"https://syntology.ai/paper/2007.12861","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.12861"}},"official":{"repos":["adversarial-for-goodness/APF","ACM-MM-2020-Submission/Submission123"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/p3gm-private-high-dimensional-data-release","slug":"p3gm-private-high-dimensional-data-release","title":"P3GM: Private High-Dimensional Data Release via Privacy Preserving Phased Generative Model","date":"2020-06-22","arxiv_id":"2006.12101","repositories_listed":2,"syntology":{"n":9,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/p3gm-private-high-dimensional-data-release#ran","syntology_url":"https://syntology.ai/paper/2006.12101","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.12101"}},"official":{"repos":["tkgsn/p3gm","tsubasat/P3GM"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/adversarial-representation-learning-for-2","slug":"adversarial-representation-learning-for-2","title":"Adversarial representation learning for private speech generation","date":"2020-06-16","arxiv_id":"2006.09114","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adversarial-representation-learning-for-2#ran","syntology_url":"https://syntology.ai/paper/2006.09114","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.09114"}},"official":{"repos":["daverics/pcmelgan"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/when-differential-privacy-meets-graph-neural","slug":"when-differential-privacy-meets-graph-neural","title":"Locally Private Graph Neural Networks","date":"2020-06-09","arxiv_id":"2006.05535","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/when-differential-privacy-meets-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2006.05535","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.05535"}},"official":{"repos":["sisaman/lpgnn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/synthetic-learning-learn-from-distributed","slug":"synthetic-learning-learn-from-distributed","title":"Synthetic Learning: Learn From Distributed Asynchronized Discriminator GAN Without Sharing Medical Image Data","date":"2020-05-29","arxiv_id":"2006.00080","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/synthetic-learning-learn-from-distributed#ran","syntology_url":"https://syntology.ai/paper/2006.00080","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.00080"}},"official":{"repos":["tommy-qichang/AsynDGAN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/federated-transfer-learning-for-eeg-signal","slug":"federated-transfer-learning-for-eeg-signal","title":"Federated Transfer Learning for EEG Signal Classification","date":"2020-04-26","arxiv_id":"2004.12321","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/federated-transfer-learning-for-eeg-signal#ran","syntology_url":"https://syntology.ai/paper/2004.12321","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.12321"}},"official":{"repos":["DashanGao/Federated-Transfer-Learning-for-EEG"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/ternary-compression-for-communication","slug":"ternary-compression-for-communication","title":"Ternary Compression for Communication-Efficient Federated Learning","date":"2020-03-07","arxiv_id":"2003.03564","repositories_listed":1,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/ternary-compression-for-communication#ran","syntology_url":"https://syntology.ai/paper/2003.03564","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.03564"}},"official":{"repos":["VeritasXu/Ternary-Federated"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/differential-privacy-at-risk-bridging","slug":"differential-privacy-at-risk-bridging","title":"Differential Privacy at Risk: Bridging Randomness and Privacy Budget","date":"2020-03-02","arxiv_id":"2003.00973","repositories_listed":1,"syntology":{"n":8,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":6,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":8,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/differential-privacy-at-risk-bridging#ran","syntology_url":"https://syntology.ai/paper/2003.00973","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.00973"}},"official":null}},{"url":"/paper/differentially-private-mean-embeddings-with","slug":"differentially-private-mean-embeddings-with","title":"DP-MERF: Differentially Private Mean Embeddings with Random Features for Practical Privacy-Preserving Data Generation","date":"2020-02-26","arxiv_id":"2002.11603","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/differentially-private-mean-embeddings-with#ran","syntology_url":"https://syntology.ai/paper/2002.11603","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.11603"}},"official":{"repos":["ParkLabML/DP-MERF"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/robust-aggregation-for-federated-learning","slug":"robust-aggregation-for-federated-learning","title":"Robust Aggregation for Federated Learning","date":"2019-12-31","arxiv_id":"1912.13445","repositories_listed":2,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/robust-aggregation-for-federated-learning#ran","syntology_url":"https://syntology.ai/paper/1912.13445","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.13445"}},"official":{"repos":["krishnap25/RFA"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/on-the-intrinsic-privacy-of-stochastic","slug":"on-the-intrinsic-privacy-of-stochastic","title":"An Empirical Study on the Intrinsic Privacy of SGD","date":"2019-12-05","arxiv_id":"1912.02919","repositories_listed":1,"syntology":{"n":16,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/on-the-intrinsic-privacy-of-stochastic#ran","syntology_url":"https://syntology.ai/paper/1912.02919","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.02919"}},"official":{"repos":["microsoft/intrinsic-private-sgd"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/clustered-federated-learning-model-agnostic","slug":"clustered-federated-learning-model-agnostic","title":"Clustered Federated Learning: Model-Agnostic Distributed Multi-Task Optimization under Privacy Constraints","date":"2019-10-04","arxiv_id":"1910.01991","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/clustered-federated-learning-model-agnostic#ran","syntology_url":"https://syntology.ai/paper/1910.01991","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.01991"}},"official":null}},{"url":"/paper/190807873","slug":"190807873","title":"Federated Learning: Challenges, Methods, and Future Directions","date":"2019-08-21","arxiv_id":"1908.07873","repositories_listed":2,"syntology":{"n":11,"n_ran":11,"n_constructed":0,"n_ran_checked":9,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":4,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/190807873#ran","syntology_url":"https://syntology.ai/paper/1908.07873","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.07873"}},"official":null}},{"url":"/paper/biscotti-a-ledger-for-private-and-secure-peer","slug":"biscotti-a-ledger-for-private-and-secure-peer","title":"Biscotti: A Ledger for Private and Secure Peer-to-Peer Machine Learning","date":"2018-11-24","arxiv_id":"1811.09904","repositories_listed":2,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/biscotti-a-ledger-for-private-and-secure-peer#ran","syntology_url":"https://syntology.ai/paper/1811.09904","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.09904"}},"official":{"repos":["DistributedML/Biscotti","m-shayanshafi/Biscotti"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/a-generic-framework-for-privacy-preserving","slug":"a-generic-framework-for-privacy-preserving","title":"A generic framework for privacy preserving deep learning","date":"2018-11-09","arxiv_id":"1811.04017","repositories_listed":3,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-generic-framework-for-privacy-preserving#ran","syntology_url":"https://syntology.ai/paper/1811.04017","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.04017"}},"official":null}},{"url":"/paper/learning-to-anonymize-faces-for-privacy","slug":"learning-to-anonymize-faces-for-privacy","title":"Learning to Anonymize Faces for Privacy Preserving Action Detection","date":"2018-03-30","arxiv_id":"1803.11556","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-to-anonymize-faces-for-privacy#ran","syntology_url":"https://syntology.ai/paper/1803.11556","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.11556"}},"official":null}},{"url":"/paper/locally-private-bayesian-inference-for-count","slug":"locally-private-bayesian-inference-for-count","title":"Locally Private Bayesian Inference for Count Models","date":"2018-03-22","arxiv_id":"1803.08471","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/locally-private-bayesian-inference-for-count#ran","syntology_url":"https://syntology.ai/paper/1803.08471","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.08471"}},"official":null}},{"url":"/paper/protecting-sensory-data-against-sensitive","slug":"protecting-sensory-data-against-sensitive","title":"Protecting Sensory Data against Sensitive Inferences","date":"2018-02-21","arxiv_id":"1802.07802","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/protecting-sensory-data-against-sensitive#ran","syntology_url":"https://syntology.ai/paper/1802.07802","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.07802"}},"official":{"repos":["mmalekzadeh/motion-sense"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}}],"record_sha256":"0b2224f82730c4987aebc7b6dec2a847f25d32d9c0659c136ad1cf539d090e00","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}