{"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/graph-augmented-normalizing-flows-for-anomaly-1","title":"Graph-Augmented Normalizing Flows for Anomaly Detection of Multiple Time Series","arxiv_id":"2202.07857","date":"2022-02-16","proceeding":"ICLR 2022 4","authors":["Enyan Dai","Jie Chen"],"abstract":"Anomaly detection is a widely studied task for a broad variety of data types; among them, multiple time series appear frequently in applications, including for example, power grids and traffic networks. Detecting anomalies for multiple time series, however, is a challenging subject, owing to the intricate interdependencies among the constituent series. We hypothesize that anomalies occur in low density regions of a distribution and explore the use of normalizing flows for unsupervised anomaly detection, because of their superior quality in density estimation. Moreover, we propose a novel flow model by imposing a Bayesian network among constituent series. A Bayesian network is a directed acyclic graph (DAG) that models causal relationships; it factorizes the joint probability of the series into the product of easy-to-evaluate conditional probabilities. We call such a graph-augmented normalizing flow approach GANF and propose joint estimation of the DAG with flow parameters. We conduct extensive experiments on real-world datasets and demonstrate the effectiveness of GANF for density estimation, anomaly detection, and identification of time series distribution drift.","url_abs":"https://arxiv.org/abs/2202.07857v2","url_pdf":"https://arxiv.org/pdf/2202.07857v2.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":"graph-augmented-normalizing-flows-for-anomaly-1","repo_url":"https://github.com/enyandai/ganf","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"graph-augmented-normalizing-flows-for-anomaly-1","repo_url":"https://github.com/D3-AI/Orion","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"graph-augmented-normalizing-flows-for-anomaly-1","repo_url":"https://github.com/signals-dev/Orion","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"graph-augmented-normalizing-flows-for-anomaly-1","repo_url":"https://github.com/sintel-dev/orion","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"anomaly-detection","task_name":"Anomaly Detection"},{"task_slug":"density-estimation","task_name":"Density Estimation"},{"task_slug":"time-series-1","task_name":"Time Series"},{"task_slug":"time-series","task_name":"Time Series Analysis"},{"task_slug":"unsupervised-anomaly-detection","task_name":"Unsupervised Anomaly Detection"}],"methods":[{"method_slug":"normalizing-flows","method_name":"Normalizing Flows"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/anomaly-detection-on-voraus-ad","task":"Anomaly Detection","dataset":"voraus-AD","model":"GANF","rank_in_archive_order":3,"of":3,"metrics":{"Avg. Detection AUROC":"79.9"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2202.07857","atlas_url":"https://app.syntology.ai/?focus=2202.07857","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.07857"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2202.07857"},"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":"2202.07857"},"call":"get_harvested_code_for_paper(arxiv_id=\"2202.07857\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2202.07857"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2202.07857\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2202.07857"},"call":"get_concepts_for_paper(arxiv_id=\"2202.07857\")"}],"by_repo":[{"repo":"enyandai/ganf","kind":"official","samples":10,"ran":7,"instrument":1,"unverified":3},{"repo":"D3-AI/Orion","kind":"listed","samples":5,"ran":3,"instrument":0,"unverified":2},{"repo":"signals-dev/Orion","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"sintel-dev/orion","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"microsoft/EdgeML","kind":"found_in_text","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":2,"harvested_for":["2002.11921","2002.12718"],"harvested_for_calls":[{"arxiv_id":"2002.11921","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2002.11921"},"call":"get_harvested_code_for_paper(arxiv_id=\"2002.11921\")"},{"arxiv_id":"2002.12718","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2002.12718"},"call":"get_harvested_code_for_paper(arxiv_id=\"2002.12718\")"}]},{"repo":"khalooei/ALOCC-CVPR2018","kind":"found_in_text","samples":9,"ran":3,"instrument":0,"unverified":6}],"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":"33fdab8ee2e650c3","source_kind":"harvested","method_name":"GANF","realizes_method":"GANF","graph_method":"GANF","realizes_severed":false,"claim":"The paper claims this code implements a Graph-Augmented Normalizing Flow (GANF) for anomaly detection in multiple time series by combining graph neural networks with normalizing flows.","centrality":"contribution","entry":"GANF","entry_sha256":"2a25b017dff45e00","n_bricks":10,"bricks":[{"entry":"GANF","code_sha256":"2a25b017dff45e00","role":"entry","order":0,"level":0,"status":"unverified"},{"entry":"GNN","code_sha256":"9115fcfda4b932e3","role":"model","order":1,"level":1,"status":"ran"},{"entry":"MAF","code_sha256":"02e105c797e3990c","role":"model","order":2,"level":0,"status":"unverified"},{"entry":"RealNVP","code_sha256":"0b745b7baaf925c0","role":"model","order":3,"level":1,"status":"ran"},{"entry":"BatchNorm","code_sha256":"161cda5cabbb68c3","role":"helper","order":4,"level":1,"status":"ran"},{"entry":"FlowSequential","code_sha256":"213315d48b01e0a7","role":"helper","order":5,"level":0,"status":"unverified"},{"entry":"MADE","code_sha256":"b5885c7b74843b05","role":"helper","order":6,"level":1,"status":"ran"},{"entry":"LinearMaskedCoupling","code_sha256":"892f63ab6c5f2f84","role":"helper","order":7,"level":1,"status":"ran"},{"entry":"MaskedLinear","code_sha256":"466de1ea4db58ebc","role":"helper","order":8,"level":1,"status":"ran"},{"entry":"create_masks","code_sha256":"e1243b39051334f9","role":"helper","order":9,"level":1,"status":"ran_draft_wrong"}],"ran_individually":7,"ran_individually_constructed":6,"ran_individually_by_status":{"ran":6,"ran_draft_wrong":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":"76c41b7d7849","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":"76c41b7d7849","realizes_method":"GANF","source_kind":"harvested","batch_at":"2026-09-09T22:44:46+00:00","members":["33fdab8ee2e650c3"]}],"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":"2202.07857"},"call":"assembly(arxiv_id=\"2202.07857\")"},"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/2202.07857.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/2202.07857.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/microsoft/EdgeML","reach":null},{"provenance":"deterministic:regex_extraction","url":"https://github.com/EnyanDai/GANF","reach":{"status":"ok"}},{"provenance":"deterministic:regex_extraction","url":"https://github.com/khalooei/ALOCC-CVPR2018","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/enyandai/ganf","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/D3-AI/Orion","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/signals-dev/Orion","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/sintel-dev/orion","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran":11,"ran_honours":1,"ran_draft_wrong":1,"unverified":11},"n_samples":24,"n_ran":13,"n_constructed":6,"n_ran_checked":12,"n_instrument":1,"n_unverified":11,"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":10,"ran":7,"n_ran_checked":6,"n_instrument":1,"repositories":1},"listed":{"samples":5,"ran":3,"n_ran_checked":3,"n_instrument":0,"repositories":1},"found_in_text":{"samples":9,"ran":3,"n_ran_checked":3,"n_instrument":0,"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":11,"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":1,"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":13,"n_ran_without_level_date":0,"n_ran_signature_not_shown":3,"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":"161cda5cabbb68c3","code_sha256_prefix":"161cda5cabbb68c3","entry":"BatchNorm","repo":"enyandai/ganf","repo_kind":"official","path":"models/GANF.py","file_url":"https://github.com/enyandai/ganf/blob/HEAD/models/GANF.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"signature_not_shown":true,"signature_not_shown_because":"signature_is_harness_probe_not_fixture_args","fixture_out_type":"BatchNorm","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"161cda5cabbb68c3"},"code_page":"/code/batchnorm","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, enyandai/ganf when it was checked","mcp_get_code":{"code_sha256":"161cda5cabbb68c3"}},{"code_sha256":"9115fcfda4b932e3","code_sha256_prefix":"9115fcfda4b932e3","entry":"GNN","repo":"enyandai/ganf","repo_kind":"official","path":"models/GANF.py","file_url":"https://github.com/enyandai/ganf/blob/HEAD/models/GANF.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"fixture_out_type":"GNN","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":"/code/gnn","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, enyandai/ganf when it was checked","mcp_get_code":{"code_sha256":"9115fcfda4b932e3"}},{"code_sha256":"892f63ab6c5f2f84","code_sha256_prefix":"892f63ab6c5f2f84","entry":"LinearMaskedCoupling","repo":"enyandai/ganf","repo_kind":"official","path":"models/GANF.py","file_url":"https://github.com/enyandai/ganf/blob/HEAD/models/GANF.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"fixture_out_type":"LinearMaskedCoupling","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, enyandai/ganf when it was checked","mcp_get_code":{"code_sha256":"892f63ab6c5f2f84"}},{"code_sha256":"b5885c7b74843b05","code_sha256_prefix":"b5885c7b74843b05","entry":"MADE","repo":"enyandai/ganf","repo_kind":"official","path":"models/GANF.py","file_url":"https://github.com/enyandai/ganf/blob/HEAD/models/GANF.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"signature_not_shown":true,"signature_not_shown_because":"signature_is_harness_probe_not_fixture_args","fixture_out_type":"MADE","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"b5885c7b74843b05"},"code_page":"/code/made","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, enyandai/ganf when it was checked","mcp_get_code":{"code_sha256":"b5885c7b74843b05"}},{"code_sha256":"466de1ea4db58ebc","code_sha256_prefix":"466de1ea4db58ebc","entry":"MaskedLinear","repo":"enyandai/ganf","repo_kind":"official","path":"models/GANF.py","file_url":"https://github.com/enyandai/ganf/blob/HEAD/models/GANF.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"signature_not_shown":true,"signature_not_shown_because":"signature_is_harness_probe_not_fixture_args","fixture_out_type":"MaskedLinear","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"466de1ea4db58ebc"},"code_page":"/code/maskedlinear","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, enyandai/ganf when it was checked","mcp_get_code":{"code_sha256":"466de1ea4db58ebc"}},{"code_sha256":"0b745b7baaf925c0","code_sha256_prefix":"0b745b7baaf925c0","entry":"RealNVP","repo":"enyandai/ganf","repo_kind":"official","path":"models/GANF.py","file_url":"https://github.com/enyandai/ganf/blob/HEAD/models/GANF.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"fixture_out_type":"RealNVP","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":"/code/realnvp","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, enyandai/ganf when it was checked","mcp_get_code":{"code_sha256":"0b745b7baaf925c0"}},{"code_sha256":"40125e1efb67fa92","code_sha256_prefix":"40125e1efb67fa92","entry":"conv_out_size_same","repo":"khalooei/ALOCC-CVPR2018","repo_kind":"found_in_text","path":"utils.py","file_url":"https://github.com/khalooei/ALOCC-CVPR2018/blob/HEAD/utils.py","link_basis":"harvester_set","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"signature":"size:int/0/int, stride:int/0/int","fixture_out_type":"int","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"40125e1efb67fa92"},"code_page":"/code/conv-out-size-same","census":null,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from xtarx/Unsupervised-Anomaly-Detection-with-Generative-Adversarial-Networks, and GitHub detected no licence in that repository when it was checked","mcp_get_code":{"code_sha256":"40125e1efb67fa92"}},{"code_sha256":"e1243b39051334f9","code_sha256_prefix":"e1243b39051334f9","entry":"create_masks","repo":"enyandai/ganf","repo_kind":"official","path":"models/GANF.py","file_url":"https://github.com/enyandai/ganf/blob/HEAD/models/GANF.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"signature":"input_size:int/0/int, hidden_size:int/0/int, n_hidden:int/0/int, input_order:str/0/str, input_degrees:NoneType/0/?","fixture_out_type":"tuple","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"e1243b39051334f9"},"code_page":"/code/create-masks","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, enyandai/ganf when it was checked","mcp_get_code":{"code_sha256":"e1243b39051334f9"}},{"code_sha256":"b1b2e280183a2f78","code_sha256_prefix":"b1b2e280183a2f78","entry":"download","repo":"D3-AI/Orion","repo_kind":"listed","path":"orion/data.py","file_url":"https://github.com/D3-AI/Orion/blob/HEAD/orion/data.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"fixture_out_type":"DataFrame","level_recorded_at":"2026-09-24T21:23:57.672461+00:00","code_page":"/code/download","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"b1b2e280183a2f78"}},{"code_sha256":"fc4f07905e94f225","code_sha256_prefix":"fc4f07905e94f225","entry":"format_csv","repo":"D3-AI/Orion","repo_kind":"listed","path":"orion/data.py","file_url":"https://github.com/D3-AI/Orion/blob/HEAD/orion/data.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"df:DataFrame/0/?, timestamp_column:int/0/int, value_columns:list/1/int","fixture_out_type":"DataFrame","level_recorded_at":"2026-09-24T21:23:57.672461+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"fc4f07905e94f225"}},{"code_sha256":"1267f9f70dc9e57e","code_sha256_prefix":"1267f9f70dc9e57e","entry":"get_f1_scores","repo":"D3-AI/Orion","repo_kind":"listed","path":"orion/results.py","file_url":"https://github.com/D3-AI/Orion/blob/HEAD/orion/results.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"results:DataFrame/0/?","fixture_out_type":"DataFrame","level_recorded_at":"2026-09-24T21:23:57.672461+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"1267f9f70dc9e57e"}},{"code_sha256":"489e2c5f7ad2b380","code_sha256_prefix":"489e2c5f7ad2b380","entry":"get_noisy_data","repo":"khalooei/ALOCC-CVPR2018","repo_kind":"found_in_text","path":"kh_tools.py","file_url":"https://github.com/khalooei/ALOCC-CVPR2018/blob/HEAD/kh_tools.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"data:list/1/ndarray","fixture_out_type":"ndarray","level_recorded_at":"2026-09-24T21:23:57.672461+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"489e2c5f7ad2b380"}},{"code_sha256":"3dff213b8ae5a2d4","code_sha256_prefix":"3dff213b8ae5a2d4","entry":"read_dataset_image_path","repo":"khalooei/ALOCC-CVPR2018","repo_kind":"found_in_text","path":"kh_tools.py","file_url":"https://github.com/khalooei/ALOCC-CVPR2018/blob/HEAD/kh_tools.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"s_dataset_url:str/0/str, n_number_count:NoneType/0/?","fixture_out_type":"list","level_recorded_at":"2026-09-24T21:23:57.672461+00:00","retrieve_with":{"tool":"get_code","code_sha256":"3dff213b8ae5a2d4"},"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"3dff213b8ae5a2d4"}},{"code_sha256":"213315d48b01e0a7","code_sha256_prefix":"213315d48b01e0a7","entry":"FlowSequential","repo":"enyandai/ganf","repo_kind":"official","path":"models/GANF.py","file_url":"https://github.com/enyandai/ganf/blob/HEAD/models/GANF.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, enyandai/ganf when it was checked","mcp_get_code":{"code_sha256":"213315d48b01e0a7"}},{"code_sha256":"2a25b017dff45e00","code_sha256_prefix":"2a25b017dff45e00","entry":"GANF","repo":"enyandai/ganf","repo_kind":"official","path":"models/GANF.py","file_url":"https://github.com/enyandai/ganf/blob/HEAD/models/GANF.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, enyandai/ganf when it was checked","mcp_get_code":{"code_sha256":"2a25b017dff45e00"}},{"code_sha256":"02e105c797e3990c","code_sha256_prefix":"02e105c797e3990c","entry":"MAF","repo":"enyandai/ganf","repo_kind":"official","path":"models/GANF.py","file_url":"https://github.com/enyandai/ganf/blob/HEAD/models/GANF.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, enyandai/ganf when it was checked","mcp_get_code":{"code_sha256":"02e105c797e3990c"}},{"code_sha256":"f0cb37d52c4b56e2","code_sha256_prefix":"f0cb37d52c4b56e2","entry":"conv2d","repo":"khalooei/ALOCC-CVPR2018","repo_kind":"found_in_text","path":"ops.py","file_url":"https://github.com/khalooei/ALOCC-CVPR2018/blob/HEAD/ops.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/conv2d","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"f0cb37d52c4b56e2"}},{"code_sha256":"97a17fbee43a92bd","code_sha256_prefix":"97a17fbee43a92bd","entry":"conv_cond_concat","repo":"khalooei/ALOCC-CVPR2018","repo_kind":"found_in_text","path":"ops.py","file_url":"https://github.com/khalooei/ALOCC-CVPR2018/blob/HEAD/ops.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/conv-cond-concat","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"97a17fbee43a92bd"}},{"code_sha256":"f43eeb47efdaf9c4","code_sha256_prefix":"f43eeb47efdaf9c4","entry":"deconv2d","repo":"khalooei/ALOCC-CVPR2018","repo_kind":"found_in_text","path":"ops.py","file_url":"https://github.com/khalooei/ALOCC-CVPR2018/blob/HEAD/ops.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/deconv2d","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"f43eeb47efdaf9c4"}},{"code_sha256":"a0b95d6b4e00d081","code_sha256_prefix":"a0b95d6b4e00d081","entry":"get_image","repo":"khalooei/ALOCC-CVPR2018","repo_kind":"found_in_text","path":"utils.py","file_url":"https://github.com/khalooei/ALOCC-CVPR2018/blob/HEAD/utils.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/get-image","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"a0b95d6b4e00d081"}},{"code_sha256":"0ac44cb4f2a04c3e","code_sha256_prefix":"0ac44cb4f2a04c3e","entry":"get_image_Slicization","repo":"khalooei/ALOCC-CVPR2018","repo_kind":"found_in_text","path":"utils.py","file_url":"https://github.com/khalooei/ALOCC-CVPR2018/blob/HEAD/utils.py","link_basis":"harvester_set","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":"0ac44cb4f2a04c3e"}},{"code_sha256":"6601ccd471fa6c41","code_sha256_prefix":"6601ccd471fa6c41","entry":"get_summary_page","repo":"D3-AI/Orion","repo_kind":"listed","path":"orion/results.py","file_url":"https://github.com/D3-AI/Orion/blob/HEAD/orion/results.py","link_basis":"harvester_set","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":"6601ccd471fa6c41"}},{"code_sha256":"04aff2c366db2eed","code_sha256_prefix":"04aff2c366db2eed","entry":"load_csv","repo":"D3-AI/Orion","repo_kind":"listed","path":"orion/data.py","file_url":"https://github.com/D3-AI/Orion/blob/HEAD/orion/data.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/load-csv","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"04aff2c366db2eed"}},{"code_sha256":"4c27080e85e975e7","code_sha256_prefix":"4c27080e85e975e7","entry":"read_image_w_noise","repo":"khalooei/ALOCC-CVPR2018","repo_kind":"found_in_text","path":"kh_tools.py","file_url":"https://github.com/khalooei/ALOCC-CVPR2018/blob/HEAD/kh_tools.py","link_basis":"harvester_set","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":"4c27080e85e975e7"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"21e5f2f86342356d74f7adae0777b8506e5cd43e763ced6103a71c818cc70082","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}