{"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/lense-learning-to-navigate-subgraph","title":"LeNSE: Learning To Navigate Subgraph Embeddings for Large-Scale Combinatorial Optimisation","arxiv_id":"2205.10106","date":"2022-05-20","proceeding":null,"authors":["David Ireland","Giovanni Montana"],"abstract":"Combinatorial Optimisation problems arise in several application domains and are often formulated in terms of graphs. Many of these problems are NP-hard, but exact solutions are not always needed. Several heuristics have been developed to provide near-optimal solutions; however, they do not typically scale well with the size of the graph. We propose a low-complexity approach for identifying a (possibly much smaller) subgraph of the original graph where the heuristics can be run in reasonable time and with a high likelihood of finding a global near-optimal solution. The core component of our approach is LeNSE, a reinforcement learning algorithm that learns how to navigate the space of possible subgraphs using an Euclidean subgraph embedding as its map. To solve CO problems, LeNSE is provided with a discriminative embedding trained using any existing heuristics using only on a small portion of the original graph. When tested on three problems (vertex cover, max-cut and influence maximisation) using real graphs with up to $10$ million edges, LeNSE identifies small subgraphs yielding solutions comparable to those found by running the heuristics on the entire graph, but at a fraction of the total run time.","url_abs":"https://arxiv.org/abs/2205.10106v1","url_pdf":"https://arxiv.org/pdf/2205.10106v1.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":"lense-learning-to-navigate-subgraph","repo_url":"https://github.com/davidireland3/lense","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"navigate","task_name":"Navigate"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2205.10106","atlas_url":"https://app.syntology.ai/?focus=2205.10106","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.10106"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2205.10106"},"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":"2205.10106"},"call":"get_harvested_code_for_paper(arxiv_id=\"2205.10106\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2205.10106"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2205.10106\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2205.10106"},"call":"get_concepts_for_paper(arxiv_id=\"2205.10106\")"}],"by_repo":[{"repo":"davidireland3/lense","kind":"official","samples":20,"ran":11,"instrument":6,"unverified":9}],"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":"b58b322a917a6cff","source_kind":"harvested","method_name":"LeNSE","realizes_method":"LeNSE","graph_method":"LeNSE","realizes_severed":false,"claim":"LeNSE is a reinforcement learning method that learns to navigate subgraph embeddings to solve large-scale combinatorial optimisation problems by guiding exploration towards promising subgraphs.","centrality":"contribution","entry":"GuidedExplorationEnv","entry_sha256":"78b0e7b7e4da9f30","n_bricks":20,"bricks":[{"entry":"GuidedExplorationEnv","code_sha256":"78b0e7b7e4da9f30","role":"entry","order":0,"level":0,"status":"unverified"},{"entry":"GraphModification","code_sha256":"97cd6b4c29a422a6","role":"helper","order":1,"level":0,"status":"unverified"},{"entry":"expected_spread","code_sha256":"596d1f7c21defb6c","role":"helper","order":2,"level":0,"status":"unverified"},{"entry":"imm","code_sha256":"e202328780981f8d","role":"helper","order":3,"level":0,"status":"unverified"},{"entry":"BaseEnvironment","code_sha256":"ac916420d1fd853a","role":"helper","order":4,"level":0,"status":"unverified"},{"entry":"spread","code_sha256":"591f1210480b0800","role":"helper","order":5,"level":0,"status":"unverified"},{"entry":"get_graph","code_sha256":"d43be97e1132fc8f","role":"helper","order":6,"level":1,"status":"ran_draft_wrong"},{"entry":"node_selection","code_sha256":"23c3ca8a0aef28fd","role":"helper","order":7,"level":1,"status":"ran_draft_wrong"},{"entry":"sampling","code_sha256":"46936d1547cdad31","role":"helper","order":8,"level":1,"status":"ran_draft_wrong"},{"entry":"make_graph_features_for_encoder","code_sha256":"90d49c367c418c13","role":"helper","order":9,"level":1,"status":"ran_draft_wrong"},{"entry":"relabel_edgelist","code_sha256":"c1ba64834670d871","role":"helper","order":10,"level":1,"status":"ran_fixture"},{"entry":"relabel_graph","code_sha256":"fda53e336a8bdbfa","role":"helper","order":11,"level":1,"status":"ran_draft_wrong"},{"entry":"Graph","code_sha256":"615fee04c551f7eb","role":"helper","order":12,"level":0,"status":"unverified"},{"entry":"create_worker","code_sha256":"e027d64126246691","role":"helper","order":13,"level":0,"status":"unverified"},{"entry":"finish_worker","code_sha256":"5d2523ccb379f385","role":"helper","order":14,"level":0,"status":"unverified"},{"entry":"logcnk","code_sha256":"9d331a19f8957fa6","role":"helper","order":15,"level":1,"status":"ran_honours"},{"entry":"Worker","code_sha256":"3e065407364bc76f","role":"helper","order":16,"level":1,"status":"ran"},{"entry":"generate_rr","code_sha256":"8b977e858e065127","role":"helper","order":17,"level":1,"status":"ran_honours"},{"entry":"generate_rr_ic","code_sha256":"bfac2181c831ea72","role":"helper","order":18,"level":1,"status":"ran_honours"},{"entry":"generate_rr_lt","code_sha256":"b47c4238e4bc15f3","role":"helper","order":19,"level":1,"status":"ran_honours"}],"ran_individually":11,"ran_individually_constructed":1,"ran_individually_by_status":{"ran":1,"ran_draft_wrong":5,"ran_fixture":1,"ran_honours":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":"65ea9930409c","n_siblings":0,"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":"65ea9930409c","realizes_method":"LeNSE","source_kind":"harvested","batch_at":"2026-09-09T22:44:46+00:00","members":["b58b322a917a6cff"]}],"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":"2205.10106"},"call":"assembly(arxiv_id=\"2205.10106\")"},"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/2205.10106.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/2205.10106.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":"deterministic:regex_extraction","url":"https://github.com/davidireland3/LeNSE","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/davidireland3/lense","reach":{"status":"ok"}}],"summary":{"ran":1,"ran_honours":4,"ran_draft_wrong":5,"ran_fixture":1,"unverified":9},"n_samples":20,"n_ran":11,"n_constructed":1,"n_ran_checked":5,"n_instrument":6,"n_unverified":9,"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":20,"ran":11,"n_ran_checked":5,"n_instrument":6,"repositories":1}},"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":20,"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":11,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-22","last":"2026-09-24","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":"3e065407364bc76f","code_sha256_prefix":"3e065407364bc76f","entry":"Worker","repo":"davidireland3/lense","repo_kind":"official","path":"IM/environment.py","file_url":"https://github.com/davidireland3/lense/blob/HEAD/IM/environment.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":"Worker","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, davidireland3/lense when it was checked","mcp_get_code":{"code_sha256":"3e065407364bc76f"}},{"code_sha256":"8b977e858e065127","code_sha256_prefix":"8b977e858e065127","entry":"generate_rr","repo":"davidireland3/lense","repo_kind":"official","path":"IM/environment.py","file_url":"https://github.com/davidireland3/lense/blob/HEAD/IM/environment.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"v:int/0/int, model:str/0/str, graph:Graph/0/?","fixture_out_type":"list","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, davidireland3/lense when it was checked","mcp_get_code":{"code_sha256":"8b977e858e065127"}},{"code_sha256":"bfac2181c831ea72","code_sha256_prefix":"bfac2181c831ea72","entry":"generate_rr_ic","repo":"davidireland3/lense","repo_kind":"official","path":"IM/environment.py","file_url":"https://github.com/davidireland3/lense/blob/HEAD/IM/environment.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"node:int/0/int, graph:Graph/0/?","fixture_out_type":"list","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, davidireland3/lense when it was checked","mcp_get_code":{"code_sha256":"bfac2181c831ea72"}},{"code_sha256":"b47c4238e4bc15f3","code_sha256_prefix":"b47c4238e4bc15f3","entry":"generate_rr_lt","repo":"davidireland3/lense","repo_kind":"official","path":"IM/environment.py","file_url":"https://github.com/davidireland3/lense/blob/HEAD/IM/environment.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"node:int/0/int, graph:Graph/0/?","fixture_out_type":"list","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, davidireland3/lense when it was checked","mcp_get_code":{"code_sha256":"b47c4238e4bc15f3"}},{"code_sha256":"d43be97e1132fc8f","code_sha256_prefix":"d43be97e1132fc8f","entry":"get_graph","repo":"davidireland3/lense","repo_kind":"official","path":"IM/environment.py","file_url":"https://github.com/davidireland3/lense/blob/HEAD/IM/environment.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"network:DiGraph/0/?","fixture_out_type":"tuple","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":"/code/get-graph","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, davidireland3/lense when it was checked","mcp_get_code":{"code_sha256":"d43be97e1132fc8f"}},{"code_sha256":"9d331a19f8957fa6","code_sha256_prefix":"9d331a19f8957fa6","entry":"logcnk","repo":"davidireland3/lense","repo_kind":"official","path":"IM/environment.py","file_url":"https://github.com/davidireland3/lense/blob/HEAD/IM/environment.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"n:int/0/int, k:int/0/int","fixture_out_type":"float","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"9d331a19f8957fa6"},"code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, davidireland3/lense when it was checked","mcp_get_code":{"code_sha256":"9d331a19f8957fa6"}},{"code_sha256":"90d49c367c418c13","code_sha256_prefix":"90d49c367c418c13","entry":"make_graph_features_for_encoder","repo":"davidireland3/lense","repo_kind":"official","path":"IM/environment.py","file_url":"https://github.com/davidireland3/lense/blob/HEAD/IM/environment.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"graph:DiGraph/0/?, graph_name:str/0/str","fixture_out_type":"dict","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, davidireland3/lense when it was checked","mcp_get_code":{"code_sha256":"90d49c367c418c13"}},{"code_sha256":"23c3ca8a0aef28fd","code_sha256_prefix":"23c3ca8a0aef28fd","entry":"node_selection","repo":"davidireland3/lense","repo_kind":"official","path":"IM/environment.py","file_url":"https://github.com/davidireland3/lense/blob/HEAD/IM/environment.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"R:list/1/list, k:int/0/int, node_num:int/0/int","fixture_out_type":"tuple","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, davidireland3/lense when it was checked","mcp_get_code":{"code_sha256":"23c3ca8a0aef28fd"}},{"code_sha256":"c1ba64834670d871","code_sha256_prefix":"c1ba64834670d871","entry":"relabel_edgelist","repo":"davidireland3/lense","repo_kind":"official","path":"IM/environment.py","file_url":"https://github.com/davidireland3/lense/blob/HEAD/IM/environment.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"roots:list/1/int, dests:list/1/int, unique:list/1/int","fixture_out_type":"tuple","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"c1ba64834670d871"},"code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, davidireland3/lense when it was checked","mcp_get_code":{"code_sha256":"c1ba64834670d871"}},{"code_sha256":"fda53e336a8bdbfa","code_sha256_prefix":"fda53e336a8bdbfa","entry":"relabel_graph","repo":"davidireland3/lense","repo_kind":"official","path":"IM/environment.py","file_url":"https://github.com/davidireland3/lense/blob/HEAD/IM/environment.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"graph:Graph/0/?, return_reverse_transformation_dic:bool/0/bool, return_forward_transformation_dic:bool/0/bool","fixture_out_type":"tuple","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, davidireland3/lense when it was checked","mcp_get_code":{"code_sha256":"fda53e336a8bdbfa"}},{"code_sha256":"46936d1547cdad31","code_sha256_prefix":"46936d1547cdad31","entry":"sampling","repo":"davidireland3/lense","repo_kind":"official","path":"IM/environment.py","file_url":"https://github.com/davidireland3/lense/blob/HEAD/IM/environment.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"epsoid:float/0/float, l:int/0/int, node_num:int/0/int, seed_size:int/0/int, worker:list/1/empty, graph_:SimpleGraph/0/?, model:str/0/str","fixture_out_type":"list","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":"/code/sampling","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, davidireland3/lense when it was checked","mcp_get_code":{"code_sha256":"46936d1547cdad31"}},{"code_sha256":"ac916420d1fd853a","code_sha256_prefix":"ac916420d1fd853a","entry":"BaseEnvironment","repo":"davidireland3/lense","repo_kind":"official","path":"IM/environment.py","file_url":"https://github.com/davidireland3/lense/blob/HEAD/IM/environment.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":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, davidireland3/lense when it was checked","mcp_get_code":{"code_sha256":"ac916420d1fd853a"}},{"code_sha256":"615fee04c551f7eb","code_sha256_prefix":"615fee04c551f7eb","entry":"Graph","repo":"davidireland3/lense","repo_kind":"official","path":"IM/environment.py","file_url":"https://github.com/davidireland3/lense/blob/HEAD/IM/environment.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/graph","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, davidireland3/lense when it was checked","mcp_get_code":{"code_sha256":"615fee04c551f7eb"}},{"code_sha256":"97cd6b4c29a422a6","code_sha256_prefix":"97cd6b4c29a422a6","entry":"GraphModification","repo":"davidireland3/lense","repo_kind":"official","path":"IM/environment.py","file_url":"https://github.com/davidireland3/lense/blob/HEAD/IM/environment.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":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, davidireland3/lense when it was checked","mcp_get_code":{"code_sha256":"97cd6b4c29a422a6"}},{"code_sha256":"78b0e7b7e4da9f30","code_sha256_prefix":"78b0e7b7e4da9f30","entry":"GuidedExplorationEnv","repo":"davidireland3/lense","repo_kind":"official","path":"IM/environment.py","file_url":"https://github.com/davidireland3/lense/blob/HEAD/IM/environment.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":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, davidireland3/lense when it was checked","mcp_get_code":{"code_sha256":"78b0e7b7e4da9f30"}},{"code_sha256":"e027d64126246691","code_sha256_prefix":"e027d64126246691","entry":"create_worker","repo":"davidireland3/lense","repo_kind":"official","path":"IM/environment.py","file_url":"https://github.com/davidireland3/lense/blob/HEAD/IM/environment.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":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, davidireland3/lense when it was checked","mcp_get_code":{"code_sha256":"e027d64126246691"}},{"code_sha256":"596d1f7c21defb6c","code_sha256_prefix":"596d1f7c21defb6c","entry":"expected_spread","repo":"davidireland3/lense","repo_kind":"official","path":"IM/environment.py","file_url":"https://github.com/davidireland3/lense/blob/HEAD/IM/environment.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":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, davidireland3/lense when it was checked","mcp_get_code":{"code_sha256":"596d1f7c21defb6c"}},{"code_sha256":"5d2523ccb379f385","code_sha256_prefix":"5d2523ccb379f385","entry":"finish_worker","repo":"davidireland3/lense","repo_kind":"official","path":"IM/environment.py","file_url":"https://github.com/davidireland3/lense/blob/HEAD/IM/environment.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":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, davidireland3/lense when it was checked","mcp_get_code":{"code_sha256":"5d2523ccb379f385"}},{"code_sha256":"e202328780981f8d","code_sha256_prefix":"e202328780981f8d","entry":"imm","repo":"davidireland3/lense","repo_kind":"official","path":"IM/environment.py","file_url":"https://github.com/davidireland3/lense/blob/HEAD/IM/environment.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":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, davidireland3/lense when it was checked","mcp_get_code":{"code_sha256":"e202328780981f8d"}},{"code_sha256":"591f1210480b0800","code_sha256_prefix":"591f1210480b0800","entry":"spread","repo":"davidireland3/lense","repo_kind":"official","path":"IM/environment.py","file_url":"https://github.com/davidireland3/lense/blob/HEAD/IM/environment.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":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, davidireland3/lense when it was checked","mcp_get_code":{"code_sha256":"591f1210480b0800"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"0f98061a55caa6089879821a53c0494bc19f87384ec38e33bc4b30ddb983675a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}