{"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":"/paper/with-a-little-help-from-my-friends-nearest","title":"With a Little Help from My Friends: Nearest-Neighbor Contrastive Learning of Visual Representations","arxiv_id":"2104.14548","date":"2021-04-29","proceeding":"ICCV 2021 10","authors":["Debidatta Dwibedi","Yusuf Aytar","Jonathan Tompson","Pierre Sermanet","Andrew Zisserman"],"abstract":"Self-supervised learning algorithms based on instance discrimination train encoders to be invariant to pre-defined transformations of the same instance. While most methods treat different views of the same image as positives for a contrastive loss, we are interested in using positives from other instances in the dataset. Our method, Nearest-Neighbor Contrastive Learning of visual Representations (NNCLR), samples the nearest neighbors from the dataset in the latent space, and treats them as positives. This provides more semantic variations than pre-defined transformations. We find that using the nearest-neighbor as positive in contrastive losses improves performance significantly on ImageNet classification, from 71.7% to 75.6%, outperforming previous state-of-the-art methods. On semi-supervised learning benchmarks we improve performance significantly when only 1% ImageNet labels are available, from 53.8% to 56.5%. On transfer learning benchmarks our method outperforms state-of-the-art methods (including supervised learning with ImageNet) on 8 out of 12 downstream datasets. Furthermore, we demonstrate empirically that our method is less reliant on complex data augmentations. We see a relative reduction of only 2.1% ImageNet Top-1 accuracy when we train using only random crops.","url_abs":"https://arxiv.org/abs/2104.14548v2","url_pdf":"https://arxiv.org/pdf/2104.14548v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"with-a-little-help-from-my-friends-nearest","repo_url":"https://github.com/beresandras/contrastive-classification-keras","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"with-a-little-help-from-my-friends-nearest","repo_url":"https://github.com/lightly-ai/lightly","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"with-a-little-help-from-my-friends-nearest","repo_url":"https://github.com/vturrisi/solo-learn","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"with-a-little-help-from-my-friends-nearest","repo_url":"https://github.com/keras-team/keras-io/blob/master/examples/vision/nnclr.py","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"tf","reach":null}],"tasks":[{"task_slug":"contrastive-learning","task_name":"Contrastive Learning"},{"task_slug":"fine-grained-image-classification","task_name":"Fine-Grained Image Classification"},{"task_slug":"image-classification","task_name":"Image Classification"},{"task_slug":"self-supervised-image-classification","task_name":"Self-Supervised Image Classification"},{"task_slug":"self-supervised-learning","task_name":"Self-Supervised Learning"},{"task_slug":"semi-supervised-image-classification","task_name":"Semi-Supervised Image Classification"},{"task_slug":"transfer-learning","task_name":"Transfer Learning"}],"methods":[{"method_slug":"1x1-convolution","method_name":"1x1 Convolution"},{"method_slug":"average-pooling","method_name":"Average Pooling"},{"method_slug":"batch-normalization","method_name":"Batch Normalization"},{"method_slug":"bottleneck-residual-block","method_name":"Bottleneck Residual Block"},{"method_slug":"colorjitter","method_name":"ColorJitter"},{"method_slug":"contrastive-learning","method_name":"Contrastive Learning"},{"method_slug":"convolution","method_name":"Convolution"},{"method_slug":"dense-connections","method_name":"Dense Connections"},{"method_slug":"global-average-pooling","method_name":"Global Average Pooling"},{"method_slug":"kaiming-initialization","method_name":"Kaiming Initialization"},{"method_slug":"max-pooling","method_name":"Max Pooling"},{"method_slug":"nnclr","method_name":"NNCLR"},{"method_slug":"random-resized-crop","method_name":"Random Resized Crop"},{"method_slug":"relu","method_name":"ReLU"},{"method_slug":"residual-block","method_name":"Residual Block"},{"method_slug":"residual-connection","method_name":"Residual Connection"},{"method_slug":"supervised-contrastive-loss","method_name":"Supervised Contrastive Loss"}],"datasets_introduced":[],"methods_introduced":[{"slug":"nnclr","name":"NNCLR","full_name":"Nearest-Neighbor Contrastive Learning of Visual Representations"}],"results":[{"leaderboard":"/sota/fine-grained-image-classification-on-birdsnap","task":"Fine-Grained Image Classification","dataset":"Birdsnap","model":"NNCLR","rank_in_archive_order":5,"of":5,"metrics":{"Accuracy":"61.4%"},"uses_additional_data":false},{"leaderboard":"/sota/fine-grained-image-classification-on-caltech","task":"Fine-Grained Image Classification","dataset":"Caltech-101","model":"NNCLR","rank_in_archive_order":9,"of":18,"metrics":{"Top-1 Error Rate":"8.7%"},"uses_additional_data":false},{"leaderboard":"/sota/fine-grained-image-classification-on-fgvc","task":"Fine-Grained Image Classification","dataset":"FGVC Aircraft","model":"NNCLR","rank_in_archive_order":53,"of":57,"metrics":{"Accuracy":"64.1"},"uses_additional_data":false},{"leaderboard":"/sota/fine-grained-image-classification-on-sun397","task":"Fine-Grained Image Classification","dataset":"SUN397","model":"NNCLR","rank_in_archive_order":5,"of":5,"metrics":{"Accuracy":"62.5"},"uses_additional_data":false},{"leaderboard":"/sota/image-classification-on-cifar-10","task":"Image Classification","dataset":"CIFAR-10","model":"NNCLR","rank_in_archive_order":172,"of":265,"metrics":{"Percentage correct":"93.7"},"uses_additional_data":false},{"leaderboard":"/sota/image-classification-on-cifar-100","task":"Image Classification","dataset":"CIFAR-100","model":"NNCLR","rank_in_archive_order":135,"of":211,"metrics":{"Percentage correct":"79"},"uses_additional_data":true},{"leaderboard":"/sota/image-classification-on-dtd","task":"Image Classification","dataset":"DTD","model":"NNCLR","rank_in_archive_order":10,"of":11,"metrics":{"Accuracy":"75.5"},"uses_additional_data":true},{"leaderboard":"/sota/image-classification-on-flowers-102","task":"Image Classification","dataset":"Flowers-102","model":"NNCLR","rank_in_archive_order":43,"of":52,"metrics":{"Accuracy":"95.1"},"uses_additional_data":true},{"leaderboard":"/sota/image-classification-on-food-101-1","task":"Image Classification","dataset":"Food-101","model":"NNCLR","rank_in_archive_order":10,"of":11,"metrics":{"Accuracy (%)":"76.7"},"uses_additional_data":false},{"leaderboard":"/sota/image-classification-on-oxford-iiit-pets","task":"Image Classification","dataset":"Oxford-IIIT Pet Dataset","model":"NNCLR","rank_in_archive_order":3,"of":5,"metrics":{"Accuracy":"91.8"},"uses_additional_data":false},{"leaderboard":"/sota/image-classification-on-pascal-voc-2007","task":"Image Classification","dataset":"PASCAL VOC 2007","model":"NNCLR","rank_in_archive_order":1,"of":1,"metrics":{"Accuracy":"83"},"uses_additional_data":false},{"leaderboard":"/sota/image-classification-on-stanford-cars","task":"Image Classification","dataset":"Stanford Cars","model":"NNCLR","rank_in_archive_order":24,"of":24,"metrics":{"Accuracy":"67.1"},"uses_additional_data":false},{"leaderboard":"/sota/self-supervised-image-classification-on","task":"Self-Supervised Image Classification","dataset":"ImageNet","model":"NNCLR (ResNet-50, multi-crop)","rank_in_archive_order":71,"of":144,"metrics":{"Number of Params":"25M","Top 1 Accuracy":"75.6%","Top 5 Accuracy":"92.4"},"uses_additional_data":false},{"leaderboard":"/sota/semi-supervised-image-classification-on-1","task":"Semi-Supervised Image Classification","dataset":"ImageNet - 1% labeled data","model":"NNCLR (ResNet-50)","rank_in_archive_order":44,"of":65,"metrics":{"Top 1 Accuracy":"56.4%","Top 5 Accuracy":"80.7"},"uses_additional_data":false},{"leaderboard":"/sota/semi-supervised-image-classification-on-2","task":"Semi-Supervised Image Classification","dataset":"ImageNet - 10% labeled data","model":"NNCLR (ResNet-50)","rank_in_archive_order":40,"of":75,"metrics":{"Top 1 Accuracy":"69.8%","Top 5 Accuracy":"89.3"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2104.14548","atlas_url":"https://app.syntology.ai/?focus=2104.14548","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.14548"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2104.14548"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2104.14548"},"call":"get_harvested_code_for_paper(arxiv_id=\"2104.14548\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2104.14548"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2104.14548\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2104.14548"},"call":"get_concepts_for_paper(arxiv_id=\"2104.14548\")"}],"by_repo":[{"repo":"beresandras/contrastive-classification-keras","kind":"listed","samples":2,"ran":1,"instrument":0,"unverified":1},{"repo":"lightly-ai/lightly","kind":"listed","samples":3,"ran":3,"instrument":0,"unverified":0},{"repo":"vturrisi/solo-learn","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":3,"harvested_for":["2003.04297","2007.06346","2107.09282"],"harvested_for_calls":[{"arxiv_id":"2003.04297","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2003.04297"},"call":"get_harvested_code_for_paper(arxiv_id=\"2003.04297\")"},{"arxiv_id":"2007.06346","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2007.06346"},"call":"get_harvested_code_for_paper(arxiv_id=\"2007.06346\")"},{"arxiv_id":"2107.09282","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2107.09282"},"call":"get_harvested_code_for_paper(arxiv_id=\"2107.09282\")"}]},{"repo":"keras-team/keras-io","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2212.13345"],"harvested_for_calls":[{"arxiv_id":"2212.13345","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2212.13345"},"call":"get_harvested_code_for_paper(arxiv_id=\"2212.13345\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code","assemblies":[{"assembly_sha256":"0e13f0d05c7b5d83","source_kind":"harvested","method_name":"Nearest-Neighbor Contrastive Learning of visual Representations (NNCLR)","realizes_method":"Nearest-Neighbor Contrastive Learning of visual Representations (NNCLR)","graph_method":"Nearest-Neighbor Contrastive Learning of visual Representations (NNCLR)","realizes_severed":false,"claim":"The code implements Nearest-Neighbor Contrastive Learning of Visual Representations (NNCLR), which uses nearest neighbors from a support set as positives for contrastive learning instead of different views of the same image.","centrality":"contribution","entry":"NNCLR","entry_sha256":"a8d39573526af033","n_bricks":2,"bricks":[{"entry":"NNCLR","code_sha256":"a8d39573526af033","role":"entry","order":0,"level":0,"status":"unverified"},{"entry":"ContrastiveModel","code_sha256":"acc020a5fafd0a3c","role":"helper","order":1,"level":1,"status":"ran"}],"ran_individually":1,"ran_individually_constructed":1,"ran_individually_by_status":{"ran":1},"end_to_end":{"ran":false,"level":0},"level_lowered":null,"claim_match":"IMPLEMENTS","claim_match_rule":"single_judge","claim_match_basis":"judge:global.anthropic.claude-sonnet-4-5-20250929-v1:0","claim_match_judges":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"label_verdict":"matches","label_verdict_judged":true,"suggested_method":null,"batch_at":"2026-09-09T22:44:46+00:00","sibling_group":"66572a4c2225","n_siblings":1,"retention":"keep","provenance":"assembly:harvest_method_v6","attached_at":"2026-09-09T22:44:46+00:00","attached_provenance":"assembly:harvest_method_v6"},{"assembly_sha256":"6c0cbbc4fc1c537d","source_kind":"harvested","method_name":"Nearest-Neighbor Contrastive Learning of visual Representations (NNCLR)","realizes_method":"Nearest-Neighbor Contrastive Learning of visual Representations (NNCLR)","graph_method":"Nearest-Neighbor Contrastive Learning of visual Representations (NNCLR)","realizes_severed":false,"claim":"Implements Nearest-Neighbor Contrastive Learning of visual Representations (NNCLR) as described in the paper, using a nearest-neighbor memory bank to sample positives for contrastive learning.","centrality":"contribution","entry":"NNCLR","entry_sha256":"f4dca3b21591894a","n_bricks":4,"bricks":[{"entry":"NNCLR","code_sha256":"f4dca3b21591894a","role":"entry","order":0,"level":1,"status":"ran"},{"entry":"NNCLRPredictionHead","code_sha256":"c86c2eda640e0f05","role":"helper","order":1,"level":1,"status":"ran"},{"entry":"NNCLRProjectionHead","code_sha256":"b23b111c2f4e00fd","role":"helper","order":2,"level":1,"status":"ran"},{"entry":"ProjectionHead","code_sha256":"da76a8285671b345","role":"helper","order":3,"level":1,"status":"ran"}],"ran_individually":4,"ran_individually_constructed":4,"ran_individually_by_status":{"ran":4},"end_to_end":{"ran":false,"level":0},"level_lowered":null,"claim_match":"IMPLEMENTS","claim_match_rule":"single_judge","claim_match_basis":"judge:global.anthropic.claude-sonnet-4-5-20250929-v1:0","claim_match_judges":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"label_verdict":"matches","label_verdict_judged":true,"suggested_method":null,"batch_at":"2026-09-09T22:44:46+00:00","sibling_group":"66572a4c2225","n_siblings":1,"retention":"keep","provenance":"assembly:harvest_method_v6","attached_at":"2026-09-09T22:44:46+00:00","attached_provenance":"assembly:harvest_method_v6"}],"assembly_sibling_groups":[{"group":"66572a4c2225","realizes_method":"Nearest-Neighbor Contrastive Learning of visual Representations (NNCLR)","source_kind":"harvested","batch_at":"2026-09-09T22:44:46+00:00","members":["0e13f0d05c7b5d83","6c0cbbc4fc1c537d"]}],"assemblies_is":{"about":"What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results.","harvested":"assembled from code harvested from a repository linked to the paper","generated":"generated from the paper text, not the repository's code","end_to_end":"for a harvested assembly, the assembly has not been run end-to-end; for a generated one, end_to_end.level is the assembly's own level and against_independent_peer says whether it ran against a peer: an independent peer is a second implementation generated separately from the same paper text; neither implementation read the authors' code. At level 2 the two agreed numerically on the fixture's inputs; level 3 is recorded when property tests derived from the paper also passed on both, and each level 3 card prints how many its report lists","bricks_level":"each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level","ran_individually":"a COUNT of bricks that ran on their own on a fixture (split by status in ran_individually_by_status), not a level; instrument statuses are failures of Syntology's instrument, not of the code","siblings":"assemblies lifted from this paper in the same batch for the same method: alternative readings kept side by side; none replaces or supersedes another","judged":"Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it. A generated assembly's label was set when its code was generated for the method, and no model judged it; its card prints it as \"by construction\" or \"not judged by a model\"","level_lowered":"a generated assembly whose level Syntology's graph lowered, with the level it had, the recorded reason and when","retention":"Syntology's spending triage for further verification, not a verdict","claim_match":"the claim_match vote: IMPLEMENTS, COMPONENT or UNCLEAR. Where claim_match_basis is \"judge:<model>\", it is one model's judgement of the assembly's label against the paper's claim (claim_match_rule single_judge, the model in claim_match_judges): not a verification and not a run. Where it is \"construction\", the value was set when the code was generated for this method and no model judged it, whatever claim_match_rule says. The page prints no claim match for any assembly","label_verdict":"whether the assembly's code is the method it is labelled with: matches, cannot_tell, mislabelled (suggested_method names what it looks like instead) or not_the_method; label_verdict_judged is true only when a model read the code (claim_match_basis \"judge:<model>\")","label_verdict_judged":"where true (claim_match_basis \"judge:<model>\"), label_verdict is a single model's judgement; not calibrated; not printed on the page; where false, it was set by construction, and the page prints it unless the node is shared with another paper (node_properties_written_for)","claim":"the claim text stored on the assembly node: for a harvested assembly, what the paper claims the code implements, as the lifting model wrote it; for a generated one, the specification the code was generated from. Not verified text","centrality":"how central the lifted method is to the paper, as the lifting step recorded it: contribution, component or incidental","v3_tests_passed_both_sides":"end_to_end.v3_tests_passed_both_sides: the number of property tests derived from the paper that passed on both implementations, as the attached report lists them; a level 3 card with 0 says its report lists none","ran_individually_constructed":"ran_individually_constructed: of the bricks counted in ran_individually, how many constructed an object rather than computing a result (Syntology's RAN record's rule, read from the graph-layer sample with the brick's code_sha256); a part of ran_individually, never subtracted from it and never a failure; null where a brick that ran has no sample in the graph layer this build read, so the figure was not counted"},"assemblies_call":{"tool":"assembly","arguments":{"arxiv_id":"2104.14548"},"call":"assembly(arxiv_id=\"2104.14548\")"},"read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/2104.14548.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/2104.14548.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/lightly-ai/lightly","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/beresandras/contrastive-classification-keras","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/vturrisi/solo-learn","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/keras-team/keras-io/blob/master/examples/vision/nnclr.py","reach":null}],"summary":{"ran":4,"unverified":1},"n_samples":5,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"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)"},"by_repo_kind":{"listed":{"samples":5,"ran":4,"n_ran_checked":4,"n_instrument":0,"repositories":2}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":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_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing","signature_not_shown":"the graph records a signature for this sample and it is not shown; signature_not_shown_because names why, as the export's field-exclusion reason","signature_not_shown_because":{"signature_is_harness_probe_not_fixture_args":"for a class the fixture built without calling, the harness called the object with inputs it made up itself, so the recorded signature is the harness's probe, not the fixture's arguments"}},"n_ran_with_level_date":4,"n_ran_without_level_date":0,"n_ran_signature_not_shown":3,"levels_written_between":{"first":"2026-09-22","last":"2026-09-22","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"samples":[{"code_sha256":"acc020a5fafd0a3c","code_sha256_prefix":"acc020a5fafd0a3c","entry":"ContrastiveModel","repo":"beresandras/contrastive-classification-keras","repo_kind":"listed","path":"algorithms.py","file_url":"https://github.com/beresandras/contrastive-classification-keras/blob/HEAD/algorithms.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"fixture_out_type":"ContrastiveModel","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"acc020a5fafd0a3c"}},{"code_sha256":"f4dca3b21591894a","code_sha256_prefix":"f4dca3b21591894a","entry":"NNCLR","repo":"lightly-ai/lightly","repo_kind":"listed","path":"lightly/models/nnclr.py","file_url":"https://github.com/lightly-ai/lightly/blob/HEAD/lightly/models/nnclr.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature_not_shown":true,"signature_not_shown_because":"signature_is_harness_probe_not_fixture_args","fixture_out_type":"NNCLR","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"f4dca3b21591894a"},"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"f4dca3b21591894a"}},{"code_sha256":"c86c2eda640e0f05","code_sha256_prefix":"c86c2eda640e0f05","entry":"NNCLRPredictionHead","repo":"lightly-ai/lightly","repo_kind":"listed","path":"lightly/models/nnclr.py","file_url":"https://github.com/lightly-ai/lightly/blob/HEAD/lightly/models/nnclr.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature_not_shown":true,"signature_not_shown_because":"signature_is_harness_probe_not_fixture_args","fixture_out_type":"NNCLRPredictionHead","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"c86c2eda640e0f05"}},{"code_sha256":"b23b111c2f4e00fd","code_sha256_prefix":"b23b111c2f4e00fd","entry":"NNCLRProjectionHead","repo":"lightly-ai/lightly","repo_kind":"listed","path":"lightly/models/nnclr.py","file_url":"https://github.com/lightly-ai/lightly/blob/HEAD/lightly/models/nnclr.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature_not_shown":true,"signature_not_shown_because":"signature_is_harness_probe_not_fixture_args","fixture_out_type":"NNCLRProjectionHead","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"b23b111c2f4e00fd"}},{"code_sha256":"a8d39573526af033","code_sha256_prefix":"a8d39573526af033","entry":"NNCLR","repo":"beresandras/contrastive-classification-keras","repo_kind":"listed","path":"algorithms.py","file_url":"https://github.com/beresandras/contrastive-classification-keras/blob/HEAD/algorithms.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"a8d39573526af033"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"884793f6a98bb9b4f8acefe0ef00baf522234c94c13c66f5bef01e0165faf6bd","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}