{"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/pareto-invariant-risk-minimization","title":"Pareto Invariant Risk Minimization: Towards Mitigating the Optimization Dilemma in Out-of-Distribution Generalization","arxiv_id":"2206.07766","date":"2022-06-15","proceeding":null,"authors":["Yongqiang Chen","Kaiwen Zhou","Yatao Bian","Binghui Xie","Bingzhe Wu","Yonggang Zhang","Kaili Ma","Han Yang","Peilin Zhao","Bo Han","James Cheng"],"abstract":"Recently, there has been a growing surge of interest in enabling machine learning systems to generalize well to Out-of-Distribution (OOD) data. Most efforts are devoted to advancing optimization objectives that regularize models to capture the underlying invariance; however, there often are compromises in the optimization process of these OOD objectives: i) Many OOD objectives have to be relaxed as penalty terms of Empirical Risk Minimization (ERM) for the ease of optimization, while the relaxed forms can weaken the robustness of the original objective; ii) The penalty terms also require careful tuning of the penalty weights due to the intrinsic conflicts between ERM and OOD objectives. Consequently, these compromises could easily lead to suboptimal performance of either the ERM or OOD objective. To address these issues, we introduce a multi-objective optimization (MOO) perspective to understand the OOD optimization process, and propose a new optimization scheme called PAreto Invariant Risk Minimization (PAIR). PAIR improves the robustness of OOD objectives by cooperatively optimizing with other OOD objectives, thereby bridging the gaps caused by the relaxations. Then PAIR approaches a Pareto optimal solution that trades off the ERM and OOD objectives properly. Extensive experiments on challenging benchmarks, WILDS, show that PAIR alleviates the compromises and yields top OOD performances.","url_abs":"https://arxiv.org/abs/2206.07766v2","url_pdf":"https://arxiv.org/pdf/2206.07766v2.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":"pareto-invariant-risk-minimization","repo_url":"https://github.com/lfhase/pair","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"pareto-invariant-risk-minimization","repo_url":"https://github.com/lfhase/ciga","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"pareto-invariant-risk-minimization","repo_url":"https://github.com/qkrdmsghk/GOODHSE","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"pareto-invariant-risk-minimization","repo_url":"https://github.com/MindSpore-scientific-2/code-1/tree/main/PACMOO","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null}],"tasks":[{"task_slug":"out-of-distribution-generalization","task_name":"Out-of-Distribution Generalization"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2206.07766","atlas_url":"https://app.syntology.ai/?focus=2206.07766","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.07766"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2206.07766"},"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_reference_implementation","arguments":{"name":"PAreto Invariant Risk Minimization (PAIR)"},"call":"get_reference_implementation(name='PAreto Invariant Risk Minimization (PAIR)')","min_level":{"quoted_from_server_card":["It REFUSES rather than serving below min_level, and the refusal names the highest level that exists","so lowering min_level is a deliberate, informed choice, not a guess."],"default_on_card":2,"server_card":"https://syntology.ai/.well-known/mcp/server-card.json","card_sha256":"479785a84658dd682a11b10237b3620d651d7f87799f5dc7add970aaa83f6d39","this_implementation_level":3}},{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2206.07766"},"call":"get_harvested_code_for_paper(arxiv_id=\"2206.07766\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2206.07766"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2206.07766\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2206.07766"},"call":"get_concepts_for_paper(arxiv_id=\"2206.07766\")"}],"reference_implementation":[{"method_name":"PAreto Invariant Risk Minimization (PAIR)","assembly_sha256":"0713f9e9a7e7ddad","source":"generated from the paper text (not the authors' code)","level":3,"level_is_quoted_from_server_card":[{"level":"V2","quoted":["two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs","neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)"]},{"level":"V3","quoted":["paper-derived property tests pass on both of those same two generations."]}],"server_card":"https://syntology.ai/.well-known/mcp/server-card.json","card_sha256":"479785a84658dd682a11b10237b3620d651d7f87799f5dc7add970aaa83f6d39","v3_tests_passed_both_sides":5,"no_rung":"No rung compares this code against the authors' implementation","no_rung_quoted_from_server_card":"No rung on this ladder compares the served code against the authors' implementation, so treat every level as evidence about runnability and internal agreement, not about matching the paper's results.","retrieve_with":"get_reference_implementation(name='PAreto Invariant Risk Minimization (PAIR)')","have_check":{"url":"https://syntology.ai/api/graph/have?x=2206.07766","call":"have('2206.07766')","in_build_sample":false}}],"reference_implementation_is":"Syntology's reference implementation of this paper's method: code Syntology generated from the paper text (not the authors' code), at the level its own end-to-end run recorded (the assembly's own level, never averaged); the level's meaning is quoted from Syntology's server card, and nothing here says the code is correct or reproduces the paper's results","by_repo":[{"repo":"lfhase/pair","kind":"official","samples":6,"ran":5,"instrument":1,"unverified":1},{"repo":"lfhase/ciga","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2202.05441"],"harvested_for_calls":[{"arxiv_id":"2202.05441","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2202.05441"},"call":"get_harvested_code_for_paper(arxiv_id=\"2202.05441\")"}]},{"repo":"qkrdmsghk/GOODHSE","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"MindSpore-scientific-2/code-1","kind":"listed","samples":1,"ran":0,"instrument":0,"unverified":1},{"repo":"Picsart-AI-Research/PAIR-Diffusion","kind":"community","samples":2,"ran":0,"instrument":0,"unverified":2}],"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":"0713f9e9a7e7ddad","source_kind":"generated","method_name":"PAreto Invariant Risk Minimization (PAIR)","realizes_method":"PAreto Invariant Risk Minimization (PAIR)","graph_method":"PAreto Invariant Risk Minimization (PAIR)","realizes_severed":false,"claim":"Compute the OOD divergence μ(L) as defined in Eq. (ref:pair_mu_appdx) of the PAIR paper. Input 'losses' is a 1D array of shape (m+1,) where losses[0] is the ERM loss L_erm and losses[1:] are the m OOD losses {L_ood^i}_{i=1}^m. Input 'preference' is a 1D array of shape (m+1,) containing the OOD prefe","centrality":"contribution","entry":"compute_ood_divergence","entry_sha256":"346be45b2493c35031897bd06f38b2c23bae653739577e9a3375e1b12f0d0645","n_bricks":1,"bricks":[{"entry":"compute_ood_divergence","code_sha256":"346be45b2493c35031897bd06f38b2c23bae653739577e9a3375e1b12f0d0645","role":"entry","order":0,"level":3,"status":"ran_honours"}],"ran_individually":1,"ran_individually_constructed":null,"ran_individually_by_status":{"ran_honours":1},"end_to_end":{"ran":true,"level":3,"against_independent_peer":true,"n_peers":1,"v3_tests_passed_both_sides":5,"means":"this assembly is a single routine, so the entry brick's verification IS the assembly's: it executed and two family-independent implementations agreed"},"level_lowered":null,"claim_match":"IMPLEMENTS","claim_match_rule":"single_judge","claim_match_basis":"construction","claim_match_judges":["construction:spec_drafted_for_this_method"],"label_verdict":"matches","label_verdict_judged":false,"suggested_method":null,"batch_at":"2026-09-07T20:44:12+00:00","sibling_group":"fe648c42f211","n_siblings":0,"retention":"keep","provenance":"assembly:generated_reference_impl_v1","attached_at":"2026-09-07T20:44:12+00:00","attached_provenance":"assembly:generated_reference_impl_v1"},{"assembly_sha256":"07d87148ea200e4b","source_kind":"harvested","method_name":"PAreto Invariant Risk Minimization (PAIR)","realizes_method":"PAreto Invariant Risk Minimization (PAIR)","graph_method":"PAreto Invariant Risk Minimization (PAIR)","realizes_severed":false,"claim":"The paper claims this code implements Pareto Invariant Risk Minimization (PAIR), a method to regularize models to capture underlying invariance for Out-of-Distribution (OOD) generalization by optimizing a trade-off between invariant risk minimization and environment-specific risks.","centrality":"contribution","entry":"get_irm_loss","entry_sha256":"fc7bb9ff36d7b1f1","n_bricks":1,"bricks":[{"entry":"get_irm_loss","code_sha256":"fc7bb9ff36d7b1f1","role":"entry","order":0,"level":1,"status":"ran_draft_wrong"}],"ran_individually":1,"ran_individually_constructed":0,"ran_individually_by_status":{"ran_draft_wrong":1},"end_to_end":{"ran":false,"level":0},"level_lowered":null,"claim_match":"COMPONENT","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":"cannot_tell","label_verdict_judged":true,"suggested_method":null,"batch_at":"2026-09-09T22:44:46+00:00","sibling_group":"d8abee615244","n_siblings":2,"retention":"defer","provenance":"assembly:harvest_method_v6","attached_at":"2026-09-09T22:44:46+00:00","attached_provenance":"assembly:harvest_method_v6"},{"assembly_sha256":"510c56aa8d82a0d4","source_kind":"harvested","method_name":"PAreto Invariant Risk Minimization (PAIR)","realizes_method":"PAreto Invariant Risk Minimization (PAIR)","graph_method":"PAreto Invariant Risk Minimization (PAIR)","realizes_severed":false,"claim":"The paper claims that PAreto Invariant Risk Minimization (PAIR) mitigates the optimization dilemma in out-of-distribution generalization by finding Pareto-optimal solutions that balance multiple invariant risk objectives.","centrality":"contribution","entry":"MinNormSolver","entry_sha256":"d0aa27294b3dd8c9","n_bricks":1,"bricks":[{"entry":"MinNormSolver","code_sha256":"d0aa27294b3dd8c9","role":"entry","order":0,"level":0,"status":"unverified"}],"ran_individually":0,"ran_individually_constructed":0,"ran_individually_by_status":{},"end_to_end":{"ran":false,"level":0},"level_lowered":null,"claim_match":"COMPONENT","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":"cannot_tell","label_verdict_judged":true,"suggested_method":null,"batch_at":"2026-09-09T22:44:46+00:00","sibling_group":"d8abee615244","n_siblings":2,"retention":"defer","provenance":"assembly:harvest_method_v6","attached_at":"2026-09-09T22:44:46+00:00","attached_provenance":"assembly:harvest_method_v6"},{"assembly_sha256":"844df9858d006fc5","source_kind":"harvested","method_name":"PAreto Invariant Risk Minimization (PAIR)","realizes_method":"PAreto Invariant Risk Minimization (PAIR)","graph_method":"PAreto Invariant Risk Minimization (PAIR)","realizes_severed":false,"claim":"Implements the Pareto Invariant Risk Minimization (PAIR) algorithm, which aims to mitigate the optimization dilemma in out-of-distribution generalization by balancing multiple objectives using Pareto optimization.","centrality":"contribution","entry":"PAIR","entry_sha256":"eca51e17518810ff","n_bricks":3,"bricks":[{"entry":"PAIR","code_sha256":"eca51e17518810ff","role":"entry","order":0,"level":0,"status":"unverified"},{"entry":"EPO","code_sha256":"d16a88da846b7682","role":"helper","order":1,"level":1,"status":"ran"},{"entry":"SEPO","code_sha256":"8c73c6ae98d61657","role":"helper","order":2,"level":1,"status":"ran"}],"ran_individually":2,"ran_individually_constructed":2,"ran_individually_by_status":{"ran":2},"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":"d8abee615244","n_siblings":2,"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":"d8abee615244","realizes_method":"PAreto Invariant Risk Minimization (PAIR)","source_kind":"harvested","batch_at":"2026-09-09T22:44:46+00:00","members":["07d87148ea200e4b","510c56aa8d82a0d4","844df9858d006fc5"]},{"group":"fe648c42f211","realizes_method":"PAreto Invariant Risk Minimization (PAIR)","source_kind":"generated","batch_at":"2026-09-07T20:44:12+00:00","members":["0713f9e9a7e7ddad"]}],"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":"2206.07766"},"call":"assembly(arxiv_id=\"2206.07766\")"},"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/2206.07766.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/2206.07766.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/MindSpore-scientific-2/code-1/tree/main/PACMOO","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/qkrdmsghk/GOODHSE","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/lfhase/pair","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/lfhase/ciga","reach":null}],"summary":{"ran":2,"ran_honours":1,"ran_draft_wrong":2,"ran_violates":1,"unverified":4},"n_samples":10,"n_ran":6,"n_constructed":2,"n_ran_checked":4,"n_instrument":2,"n_unverified":4,"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":{"official":{"samples":6,"ran":5,"n_ran_checked":4,"n_instrument":1,"repositories":1},"listed":{"samples":1,"ran":0,"n_ran_checked":0,"n_instrument":0,"repositories":1},"community":{"samples":2,"ran":0,"n_ran_checked":0,"n_instrument":0,"repositories":1},"unlocated":{"samples":1,"ran":1,"n_ran_checked":0,"n_instrument":1,"repositories":0,"is":"identical to code Syntology harvested from another paper's repository; this paper's own copy was not located, so no repository is named and no licence is recorded"}},"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":1,"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"},"n_ran_with_level_date":3,"n_ran_without_level_date":3,"n_ran_signature_not_shown":0,"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"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"d16a88da846b7682","code_sha256_prefix":"d16a88da846b7682","entry":"EPO","repo":"lfhase/pair","repo_kind":"official","path":"PAIR/pair.py","file_url":"https://github.com/lfhase/pair/blob/HEAD/PAIR/pair.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":"EPO","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":"d16a88da846b7682"}},{"code_sha256":"8c73c6ae98d61657","code_sha256_prefix":"8c73c6ae98d61657","entry":"SEPO","repo":"lfhase/pair","repo_kind":"official","path":"PAIR/pair.py","file_url":"https://github.com/lfhase/pair/blob/HEAD/PAIR/pair.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":"SEPO","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":"8c73c6ae98d61657"}},{"code_sha256":"28077f9c052f7aed","code_sha256_prefix":"28077f9c052f7aed","entry":"getNumParams","repo":"lfhase/pair","repo_kind":"official","path":"ColoredMNIST/pair.py","file_url":"https://github.com/lfhase/pair/blob/HEAD/ColoredMNIST/pair.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"signature":"params:list/1/Tensor","fixture_out_type":"tuple","code_page":"/code/getnumparams","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"28077f9c052f7aed"}},{"code_sha256":"fc7bb9ff36d7b1f1","code_sha256_prefix":"fc7bb9ff36d7b1f1","entry":"get_irm_loss","repo":null,"repo_kind":null,"path":null,"file_url":null,"link_basis":"identical_code_first_harvested_elsewhere","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"signature":"causal_pred:Tensor/2/float, labels:Tensor/1/int, batch_env_idx:Tensor/1/int, criterion:callable/0/?","fixture_out_type":"Tensor","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","mcp_get_code":{"code_sha256":"fc7bb9ff36d7b1f1"}},{"code_sha256":"cb517763d1083872","code_sha256_prefix":"cb517763d1083872","entry":"get_kl_div","repo":"lfhase/pair","repo_kind":"official","path":"ColoredMNIST/pair.py","file_url":"https://github.com/lfhase/pair/blob/HEAD/ColoredMNIST/pair.py","link_basis":"first_harvest_node","language":"python","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"signature":"losses:ndarray/1/float, preference:ndarray/1/float","fixture_out_type":"float64","retrieve_with":{"tool":"get_code","code_sha256":"cb517763d1083872"},"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"cb517763d1083872"}},{"code_sha256":"32a5b544ec6bebb1","code_sha256_prefix":"32a5b544ec6bebb1","entry":"pair_selection","repo":"lfhase/pair","repo_kind":"official","path":"ColoredMNIST/pair.py","file_url":"https://github.com/lfhase/pair/blob/HEAD/ColoredMNIST/pair.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"signature":"losses:ndarray/2/float, val_accs:ndarray/1/float, test_accs:ndarray/1/float, anneal_iter:int/0/int, val_acc_bar:int/0/int, pood:NoneType/0/?","fixture_out_type":"tuple","retrieve_with":{"tool":"get_code","code_sha256":"32a5b544ec6bebb1"},"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"32a5b544ec6bebb1"}},{"code_sha256":"d0aa27294b3dd8c9","code_sha256_prefix":"d0aa27294b3dd8c9","entry":"MinNormSolver","repo":"MindSpore-scientific-2/code-1","repo_kind":"listed","path":"PACMOO/min_norm_solvers_numpy.py","file_url":"https://github.com/MindSpore-scientific-2/code-1/blob/HEAD/PACMOO/min_norm_solvers_numpy.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":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"d0aa27294b3dd8c9"}},{"code_sha256":"eca51e17518810ff","code_sha256_prefix":"eca51e17518810ff","entry":"PAIR","repo":"lfhase/pair","repo_kind":"official","path":"PAIR/pair.py","file_url":"https://github.com/lfhase/pair/blob/HEAD/PAIR/pair.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":"eca51e17518810ff"}},{"code_sha256":"93721419ca48ae8f","code_sha256_prefix":"93721419ca48ae8f","entry":"init_input_canvas_wrapper","repo":"Picsart-AI-Research/PAIR-Diffusion","repo_kind":"community","path":"gradio_demo.py","file_url":"https://github.com/Picsart-AI-Research/PAIR-Diffusion/blob/HEAD/gradio_demo.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":"93721419ca48ae8f"}},{"code_sha256":"a6787f2913c02b9a","code_sha256_prefix":"a6787f2913c02b9a","entry":"init_ref_canvas_wrapper","repo":"Picsart-AI-Research/PAIR-Diffusion","repo_kind":"community","path":"gradio_demo.py","file_url":"https://github.com/Picsart-AI-Research/PAIR-Diffusion/blob/HEAD/gradio_demo.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":"a6787f2913c02b9a"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"6b55471971f9c225b604dd8ceccd1713fe7bd794944fc719a81bffd47b85fb8d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}