{"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":"/code/log-loss","entry":"log_loss","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":14,"n_papers_ran":14,"n_papers_ran_no_instrument_failure":12,"n_papers_ran_instrument_only":2,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":13,"n_samples_ran":13,"n_samples_constructed":0,"n_samples_ran_checked":11,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":6,"n_places":15,"n_places_pointer_only":3,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":10,"unverified":0},"key_notes":{"n_samples_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_samples_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":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2602.07800","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-07800","title":"Approximating Matrix Functions with Deep Neural Networks and Transformers","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"rahul3/LAWT","path":"src/neuralnet/common.py","file_url":"https://github.com/rahul3/LAWT/blob/HEAD/src/neuralnet/common.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, rahul3/LAWT (NOASSERTION)","code_sha256":"21772223de978a2d","code_sha256_prefix":"21772223de978a2d","mcp_get_code":{"code_sha256":"21772223de978a2d"}},{"arxiv_id":"2401.08552","arxiv_id_is_arxiv":true,"paper":"/paper/explaining-time-series-via-contrastive-and","title":"Explaining Time Series via Contrastive and Locally Sparse Perturbations","date":"2024-01-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zichuan-liu/ContraLSP","path":"utils/losses.py","file_url":"https://github.com/zichuan-liu/ContraLSP/blob/HEAD/utils/losses.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zichuan-liu/ContraLSP when it was checked","code_sha256":"5865b9ffb828963c","code_sha256_prefix":"5865b9ffb828963c","mcp_get_code":{"code_sha256":"5865b9ffb828963c"}},{"arxiv_id":"2302.01190","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-efficacy-of-differentially-private-few","title":"On the Efficacy of Differentially Private Few-shot Image Classification","date":"2023-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cambridge-mlg/dp-few-shot","path":"src/lira.py","file_url":"https://github.com/cambridge-mlg/dp-few-shot/blob/HEAD/src/lira.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0e4e4401e5d8b0fe","code_sha256_prefix":"0e4e4401e5d8b0fe","mcp_get_code":{"code_sha256":"0e4e4401e5d8b0fe"}},{"arxiv_id":"2206.00517","arxiv_id_is_arxiv":true,"paper":"/paper/one-positive-label-is-sufficient-single","title":"One Positive Label is Sufficient: Single-Positive Multi-Label Learning with Label Enhancement","date":"2022-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"palm-ml/smile","path":"train_smile2.py","file_url":"https://github.com/palm-ml/smile/blob/HEAD/train_smile2.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, palm-ml/smile when it was checked","code_sha256":"40e1c8706d5df6dc","code_sha256_prefix":"40e1c8706d5df6dc","mcp_get_code":{"code_sha256":"40e1c8706d5df6dc"}},{"arxiv_id":"2112.08440","arxiv_id_is_arxiv":true,"paper":"/paper/climate-invariant-machine-learning","title":"Climate-Invariant Machine Learning","date":"2021-12-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tbeucler/CBRAIN-CAM","path":"cbrain/losses.py","file_url":"https://github.com/tbeucler/CBRAIN-CAM/blob/HEAD/cbrain/losses.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6eb107b3aee3be04","code_sha256_prefix":"6eb107b3aee3be04","mcp_get_code":{"code_sha256":"6eb107b3aee3be04"}},{"arxiv_id":"2106.09708","arxiv_id_is_arxiv":true,"paper":"/paper/multi-label-learning-from-single-positive","title":"Multi-Label Learning from Single Positive Labels","date":"2021-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"elijahcole/single-positive-multi-label","path":"losses.py","file_url":"https://github.com/elijahcole/single-positive-multi-label/blob/HEAD/losses.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b19f196f194e428a","code_sha256_prefix":"b19f196f194e428a","mcp_get_code":{"code_sha256":"b19f196f194e428a"}},{"arxiv_id":"1906.05272","arxiv_id_is_arxiv":true,"paper":"/paper/presence-only-geographical-priors-for-fine","title":"Presence-Only Geographical Priors for Fine-Grained Image Classification","date":"2019-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alcunha/geo_prior_tf","path":"geo_prior/losses.py","file_url":"https://github.com/alcunha/geo_prior_tf/blob/HEAD/geo_prior/losses.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a47f5ec6017b8204","code_sha256_prefix":"a47f5ec6017b8204","mcp_get_code":{"code_sha256":"a47f5ec6017b8204"}},{"arxiv_id":"1905.06873","arxiv_id_is_arxiv":true,"paper":"/paper/das3h-modeling-student-learning-and","title":"DAS3H: Modeling Student Learning and Forgetting for Optimally Scheduling Distributed Practice of Skills","date":"2019-05-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jilljenn/ktm","path":"ofm.py","file_url":"https://github.com/jilljenn/ktm/blob/HEAD/ofm.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b147ec392bdd9573","code_sha256_prefix":"b147ec392bdd9573","mcp_get_code":{"code_sha256":"b147ec392bdd9573"}},{"arxiv_id":"1905.06873","arxiv_id_is_arxiv":true,"paper":"/paper/das3h-modeling-student-learning-and","title":"DAS3H: Modeling Student Learning and Forgetting for Optimally Scheduling Distributed Practice of Skills","date":"2019-05-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jilljenn/ktm","path":"omirt.py","file_url":"https://github.com/jilljenn/ktm/blob/HEAD/omirt.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7eb65870990ef53f","code_sha256_prefix":"7eb65870990ef53f","mcp_get_code":{"code_sha256":"7eb65870990ef53f"}},{"arxiv_id":"1904.02632","arxiv_id_is_arxiv":true,"paper":"/paper/a-learned-representation-for-scalable-vector","title":"A Learned Representation for Scalable Vector Graphics","date":"2019-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tensorflow/magenta","path":"magenta/common/tf_utils.py","file_url":"https://github.com/tensorflow/magenta/blob/HEAD/magenta/common/tf_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b3b4d407f8e308ab","code_sha256_prefix":"b3b4d407f8e308ab","mcp_get_code":{"code_sha256":"b3b4d407f8e308ab"}},{"arxiv_id":"1811.11616","arxiv_id_is_arxiv":true,"paper":"/paper/identification-of-low-surface-brightness","title":"Identification of Low Surface Brightness Tidal Features in Galaxies Using Convolutional Neural Networks","date":null,"month_inferred_from_arxiv_id":"2018-11","title_source":"archive","repo":"mwalmsley/tidal-features-classifier","path":"tidalclassifier/general_metrics/performance_by_class.py","file_url":"https://github.com/mwalmsley/tidal-features-classifier/blob/HEAD/tidalclassifier/general_metrics/performance_by_class.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"da2d03cb51a4b49f","code_sha256_prefix":"da2d03cb51a4b49f","mcp_get_code":{"code_sha256":"da2d03cb51a4b49f"}},{"arxiv_id":"1806.04731","arxiv_id_is_arxiv":true,"paper":"/paper/deep-learning-to-represent-sub-grid-processes","title":"Deep learning to represent sub-grid processes in climate models","date":"2018-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jordanott/CBRAIN-CAM","path":"cbrain/losses.py","file_url":"https://github.com/jordanott/CBRAIN-CAM/blob/HEAD/cbrain/losses.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6eb107b3aee3be04","code_sha256_prefix":"6eb107b3aee3be04","mcp_get_code":{"code_sha256":"6eb107b3aee3be04"}},{"arxiv_id":"1805.09458","arxiv_id_is_arxiv":true,"paper":"/paper/invariant-representations-without-adversarial","title":"Invariant Representations without Adversarial Training","date":"2018-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dcmoyer/inv-rep","path":"src/error_utils.py","file_url":"https://github.com/dcmoyer/inv-rep/blob/HEAD/src/error_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3fec486caf59026e","code_sha256_prefix":"3fec486caf59026e","mcp_get_code":{"code_sha256":"3fec486caf59026e"}},{"arxiv_id":"1804.09399","arxiv_id_is_arxiv":true,"paper":"/paper/convolutional-generative-adversarial-networks","title":"Convolutional Generative Adversarial Networks with Binary Neurons for Polyphonic Music Generation","date":"2018-04-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucylow/Stochastic_SoundCloud","path":"common/tf_utils.py","file_url":"https://github.com/lucylow/Stochastic_SoundCloud/blob/HEAD/common/tf_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b3b4d407f8e308ab","code_sha256_prefix":"b3b4d407f8e308ab","mcp_get_code":{"code_sha256":"b3b4d407f8e308ab"}},{"arxiv_id":"1803.03764","arxiv_id_is_arxiv":true,"paper":"/paper/variance-networks-when-expectation-does-not","title":"Variance Networks: When Expectation Does Not Meet Your Expectations","date":"2018-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"da-molchanov/variance-networks","path":"variance-networks-tf/nets/metrics.py","file_url":"https://github.com/da-molchanov/variance-networks/blob/HEAD/variance-networks-tf/nets/metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4434bc86b61349d1","code_sha256_prefix":"4434bc86b61349d1","mcp_get_code":{"code_sha256":"4434bc86b61349d1"}}],"record_sha256":"9b0028f16ce9f2329c2615f77b48c1c96eb0e6a18592f5ed71f8187c5fde5262","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}