{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/load-graph","entry":"load_graph","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":36,"n_papers_ran":23,"n_papers_ran_no_instrument_failure":14,"n_papers_ran_instrument_only":9,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":31,"n_samples_ran":19,"n_samples_constructed":0,"n_samples_ran_checked":11,"n_samples_instrument":8,"n_samples_unverified":12,"n_samples_fingerprinted":0,"n_places":37,"n_places_pointer_only":11,"n_places_pointer_only_link_open":2,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":2,"ran_violates":0,"ran_draft_wrong":8,"ran_fixture":0,"ran":9,"unverified":12},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2609.01286","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-01286","title":"Analog-DB: An Agent-First Analog Integrated Circuit Database, From Blocks to Systems","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"MacAnalog/spicexplorer-release","path":"analog-db/src/spicexplorer_analog_db/params.py","file_url":"https://github.com/MacAnalog/spicexplorer-release/blob/HEAD/analog-db/src/spicexplorer_analog_db/params.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, MacAnalog/spicexplorer-release when it was checked","code_sha256":"86676e5340a972ba","code_sha256_prefix":"86676e5340a972ba","mcp_get_code":{"code_sha256":"86676e5340a972ba"}},{"arxiv_id":"2608.17501","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-17501","title":"SGHA: Evidence-Grounded Research Problem Discovery with Local Language Models","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"SarveshVGharat/structural-gap-hypothesis-agent","path":"src/sgha/gap_detection.py","file_url":"https://github.com/SarveshVGharat/structural-gap-hypothesis-agent/blob/HEAD/src/sgha/gap_detection.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"02ec7d29f5aba8e5","code_sha256_prefix":"02ec7d29f5aba8e5","mcp_get_code":{"code_sha256":"02ec7d29f5aba8e5"}},{"arxiv_id":"2607.05095","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-05095","title":"FAST: A Holistic Framework for Optimizing Memory-I/O, Computation, and Sampling in Temporal GNN Training","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"NoneBone/FAST","path":"utils.py","file_url":"https://github.com/NoneBone/FAST/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, NoneBone/FAST when it was checked","code_sha256":"30b343adb02308b6","code_sha256_prefix":"30b343adb02308b6","mcp_get_code":{"code_sha256":"30b343adb02308b6"}},{"arxiv_id":"2506.07972","arxiv_id_is_arxiv":true,"paper":"/paper/heurigym-an-agentic-benchmark-for-llm-crafted","title":"HeuriGym: An Agentic Benchmark for LLM-Crafted Heuristics in Combinatorial Optimization","date":"2025-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cornell-zhang/heurigym","path":"egraph_extraction/program/verifier.py","file_url":"https://github.com/cornell-zhang/heurigym/blob/HEAD/egraph_extraction/program/verifier.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ba48fb31f2879a84","code_sha256_prefix":"ba48fb31f2879a84","mcp_get_code":{"code_sha256":"ba48fb31f2879a84"}},{"arxiv_id":"2410.15020","arxiv_id_is_arxiv":true,"paper":"/paper/iterative-methods-via-locally-evolving-set","title":"Iterative Methods via Locally Evolving Set Process","date":"2024-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"baojian/localch","path":"utils.py","file_url":"https://github.com/baojian/localch/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"dd34b3632156be22","code_sha256_prefix":"dd34b3632156be22","mcp_get_code":{"code_sha256":"dd34b3632156be22"}},{"arxiv_id":"2410.15020","arxiv_id_is_arxiv":true,"paper":"/paper/iterative-methods-via-locally-evolving-set","title":"Iterative Methods via Locally Evolving Set Process","date":"2024-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"baojian/LocalCH","path":"utils.py","file_url":"https://github.com/baojian/LocalCH/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5145ec7c856366ac","code_sha256_prefix":"5145ec7c856366ac","mcp_get_code":{"code_sha256":"5145ec7c856366ac"}},{"arxiv_id":"2408.07569","arxiv_id_is_arxiv":true,"paper":"/paper/multi-task-heterogeneous-graph-learning-on","title":"Multi-task Heterogeneous Graph Learning on Electronic Health Records","date":"2024-08-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hku-medai/mult-ehr","path":"data.py","file_url":"https://github.com/hku-medai/mult-ehr/blob/HEAD/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, hku-medai/mult-ehr when it was checked","code_sha256":"60e21a7efc8c4db1","code_sha256_prefix":"60e21a7efc8c4db1","mcp_get_code":{"code_sha256":"60e21a7efc8c4db1"}},{"arxiv_id":"2405.01483","arxiv_id_is_arxiv":true,"paper":"/paper/mantis-interleaved-multi-image-instruction","title":"MANTIS: Interleaved Multi-Image Instruction Tuning","date":"2024-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TIGER-AI-Lab/Mantis","path":"mantis/benchmark/mementos_eval_utils.py","file_url":"https://github.com/TIGER-AI-Lab/Mantis/blob/HEAD/mantis/benchmark/mementos_eval_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"29a942c0eb6bb78d","code_sha256_prefix":"29a942c0eb6bb78d","mcp_get_code":{"code_sha256":"29a942c0eb6bb78d"}},{"arxiv_id":"2404.14720","arxiv_id_is_arxiv":true,"paper":"/paper/incorporating-gradients-to-rules-towards","title":"Incorporating Gradients to Rules: Towards Lightweight, Adaptive Provenance-based Intrusion Detection","date":null,"month_inferred_from_arxiv_id":"2024-04","title_source":"archive","repo":"lexuswang/captain","path":"train_by_benign.py","file_url":"https://github.com/lexuswang/captain/blob/HEAD/train_by_benign.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"75352af881cc33e5","code_sha256_prefix":"75352af881cc33e5","mcp_get_code":{"code_sha256":"75352af881cc33e5"}},{"arxiv_id":"2402.12132","arxiv_id_is_arxiv":true,"paper":"/paper/sstkg-simple-spatio-temporal-knowledge-graph","title":"SSTKG: Simple Spatio-Temporal Knowledge Graph for Intepretable and Versatile Dynamic Information Embedding","date":"2024-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Hippopotamus0308/SSTKG","path":"model/KG_construction.py","file_url":"https://github.com/Hippopotamus0308/SSTKG/blob/HEAD/model/KG_construction.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Hippopotamus0308/SSTKG when it was checked","code_sha256":"57158b422e2bdc85","code_sha256_prefix":"57158b422e2bdc85","mcp_get_code":{"code_sha256":"57158b422e2bdc85"}},{"arxiv_id":"2312.08098","arxiv_id_is_arxiv":true,"paper":"/paper/adversarial-socialbots-modeling-based-on","title":"Adversarial Socialbots Modeling Based on Structural Information Principles","date":"2023-12-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"selgroup/siasm","path":"utils.py","file_url":"https://github.com/selgroup/siasm/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, selgroup/siasm when it was checked","code_sha256":"632953e731dce2d0","code_sha256_prefix":"632953e731dce2d0","mcp_get_code":{"code_sha256":"632953e731dce2d0"}},{"arxiv_id":"2312.02708","arxiv_id_is_arxiv":true,"paper":"/paper/provable-adversarial-robustness-for-group-1","title":"Provable Adversarial Robustness for Group Equivariant Tasks: Graphs, Point Clouds, Molecules, and More","date":"2023-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RobustGraph/RoboGraph","path":"robograph/utils.py","file_url":"https://github.com/RobustGraph/RoboGraph/blob/HEAD/robograph/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b6d7cd2f3295bedf","code_sha256_prefix":"b6d7cd2f3295bedf","mcp_get_code":{"code_sha256":"b6d7cd2f3295bedf"}},{"arxiv_id":"2307.04514","arxiv_id_is_arxiv":true,"paper":"/paper/improving-heterogeneous-graph-learning-with","title":"Improving Heterogeneous Graph Learning with Weighted Mixed-Curvature Product Manifold","date":"2023-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sharecodesubmission/weighted_product_manifold","path":"hyperbolics/utils/data_prep.py","file_url":"https://github.com/sharecodesubmission/weighted_product_manifold/blob/HEAD/hyperbolics/utils/data_prep.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, sharecodesubmission/weighted_product_manifold when it was checked","code_sha256":"5bef3545103c5952","code_sha256_prefix":"5bef3545103c5952","mcp_get_code":{"code_sha256":"5bef3545103c5952"}},{"arxiv_id":"2305.08750","arxiv_id_is_arxiv":true,"paper":"/paper/fast-and-attributed-change-detection-on","title":"Fast and Attributed Change Detection on Dynamic Graphs with Density of States","date":"2023-05-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shenyanghuang/scpd","path":"subroutines/dos.py","file_url":"https://github.com/shenyanghuang/scpd/blob/HEAD/subroutines/dos.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, shenyanghuang/scpd when it was checked","code_sha256":"cbfd8eda7d721d16","code_sha256_prefix":"cbfd8eda7d721d16","mcp_get_code":{"code_sha256":"cbfd8eda7d721d16"}},{"arxiv_id":"2211.08568","arxiv_id_is_arxiv":true,"paper":"/paper/graph-sequential-neural-ode-process-for-link","title":"Graph Sequential Neural ODE Process for Link Prediction on Dynamic and Sparse Graphs","date":"2022-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rmanluo/gsnop","path":"code/utils.py","file_url":"https://github.com/rmanluo/gsnop/blob/HEAD/code/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"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 NoneBone/FAST, and GitHub detected no licence in that repository when it was checked","code_sha256":"30b343adb02308b6","code_sha256_prefix":"30b343adb02308b6","mcp_get_code":{"code_sha256":"30b343adb02308b6"}},{"arxiv_id":"2208.03523","arxiv_id_is_arxiv":true,"paper":"/paper/graph-pooling-with-maximum-weight-k","title":"Generalizing Downsampling from Regular Data to Graphs","date":"2022-08-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"flandolfi/k-mis-pool","path":"benchmark/datasets.py","file_url":"https://github.com/flandolfi/k-mis-pool/blob/HEAD/benchmark/datasets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b6050f01e3a66bcb","code_sha256_prefix":"b6050f01e3a66bcb","mcp_get_code":{"code_sha256":"b6050f01e3a66bcb"}},{"arxiv_id":"2204.05125","arxiv_id_is_arxiv":true,"paper":"/paper/escm-2-entire-space-counterfactual-multi-task","title":"ESCM$^2$: Entire Space Counterfactual Multi-Task Model for Post-Click Conversion Rate Estimation","date":"2022-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PaddlePaddle/PaddleRec","path":"datasets/AmazonBook/preprocess.py","file_url":"https://github.com/PaddlePaddle/PaddleRec/blob/HEAD/datasets/AmazonBook/preprocess.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e192b64a7c6ac2de","code_sha256_prefix":"e192b64a7c6ac2de","mcp_get_code":{"code_sha256":"e192b64a7c6ac2de"}},{"arxiv_id":"2203.14883","arxiv_id_is_arxiv":true,"paper":"/paper/tgl-a-general-framework-for-temporal-gnn","title":"TGL: A General Framework for Temporal GNN Training on Billion-Scale Graphs","date":"2022-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amazon-research/tgl","path":"utils.py","file_url":"https://github.com/amazon-research/tgl/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from NoneBone/FAST, and GitHub detected no licence in that repository when it was checked","code_sha256":"30b343adb02308b6","code_sha256_prefix":"30b343adb02308b6","mcp_get_code":{"code_sha256":"30b343adb02308b6"}},{"arxiv_id":"2202.08956","arxiv_id_is_arxiv":true,"paper":"/paper/gnn-surrogate-a-hierarchical-and-adaptive","title":"GNN-Surrogate: A Hierarchical and Adaptive Graph Neural Network for Parameter Space Exploration of Unstructured-Mesh Ocean Simulations","date":"2022-02-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"trainsn/gnn-surrogate","path":"model/graph.py","file_url":"https://github.com/trainsn/gnn-surrogate/blob/HEAD/model/graph.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"74c5087e0c728e46","code_sha256_prefix":"74c5087e0c728e46","mcp_get_code":{"code_sha256":"74c5087e0c728e46"}},{"arxiv_id":"2106.03760","arxiv_id_is_arxiv":true,"paper":"/paper/dselect-k-differentiable-selection-in-the","title":"DSelect-k: Differentiable Selection in the Mixture of Experts with Applications to Multi-Task Learning","date":"2021-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Andy1314Chen/PaddleRec","path":"datasets/AmazonBook/preprocess.py","file_url":"https://github.com/Andy1314Chen/PaddleRec/blob/HEAD/datasets/AmazonBook/preprocess.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e192b64a7c6ac2de","code_sha256_prefix":"e192b64a7c6ac2de","mcp_get_code":{"code_sha256":"e192b64a7c6ac2de"}},{"arxiv_id":"2010.10016","arxiv_id_is_arxiv":true,"paper":"/paper/early-anomaly-detection-by-learning-and","title":"Action Sequence Augmentation for Early Graph-based Anomaly Detection","date":"2020-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dm2-nd/eland","path":"main_e2e.py","file_url":"https://github.com/dm2-nd/eland/blob/HEAD/main_e2e.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, dm2-nd/eland when it was checked","code_sha256":"24dbf7b15163a084","code_sha256_prefix":"24dbf7b15163a084","mcp_get_code":{"code_sha256":"24dbf7b15163a084"}},{"arxiv_id":"2008.13535","arxiv_id_is_arxiv":true,"paper":"/paper/dcn-m-improved-deep-cross-network-for-feature","title":"DCN V2: Improved Deep & Cross Network and Practical Lessons for Web-scale Learning to Rank Systems","date":"2020-08-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LinJayan/DCN_V2_Paddle","path":"datasets/AmazonBook/preprocess.py","file_url":"https://github.com/LinJayan/DCN_V2_Paddle/blob/HEAD/datasets/AmazonBook/preprocess.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e192b64a7c6ac2de","code_sha256_prefix":"e192b64a7c6ac2de","mcp_get_code":{"code_sha256":"e192b64a7c6ac2de"}},{"arxiv_id":"2007.09454","arxiv_id_is_arxiv":true,"paper":"/paper/face-super-resolution-guided-by-3d-facial-1","title":"Face Super-Resolution Guided by 3D Facial Priors","date":"2020-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HUuxiaobin/Face-Super-Resolution-Guided-by-3D-Facial-Priors","path":"3Dface_priors/demo_render.py","file_url":"https://github.com/HUuxiaobin/Face-Super-Resolution-Guided-by-3D-Facial-Priors/blob/HEAD/3Dface_priors/demo_render.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"effa45a7df1ea25f","code_sha256_prefix":"effa45a7df1ea25f","mcp_get_code":{"code_sha256":"effa45a7df1ea25f"}},{"arxiv_id":"2006.11184","arxiv_id_is_arxiv":true,"paper":"/paper/poisson-learning-graph-based-semi-supervised","title":"Poisson Learning: Graph Based Semi-Supervised Learning At Very Low Label Rates","date":"2020-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jwcalder/GraphLearning","path":"graphlearning/datasets.py","file_url":"https://github.com/jwcalder/GraphLearning/blob/HEAD/graphlearning/datasets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"caa96ed5b3bb0bfa","code_sha256_prefix":"caa96ed5b3bb0bfa","mcp_get_code":{"code_sha256":"caa96ed5b3bb0bfa"}},{"arxiv_id":"2006.09773","arxiv_id_is_arxiv":true,"paper":"/paper/nnc-neural-network-control-of-dynamical","title":"Neural Ordinary Differential Equation Control of Dynamics on Graphs","date":"2020-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"asikist/nnc","path":"nnc/helpers/graph_helper.py","file_url":"https://github.com/asikist/nnc/blob/HEAD/nnc/helpers/graph_helper.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e5e8b476ae4b1435","code_sha256_prefix":"e5e8b476ae4b1435","mcp_get_code":{"code_sha256":"e5e8b476ae4b1435"}},{"arxiv_id":"2005.07959","arxiv_id_is_arxiv":true,"paper":"/paper/characteristic-functions-on-graphs-birds-of-a","title":"Characteristic Functions on Graphs: Birds of a Feather, from Statistical Descriptors to Parametric Models","date":"2020-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"benedekrozemberczki/FEATHER","path":"src/utils.py","file_url":"https://github.com/benedekrozemberczki/FEATHER/blob/HEAD/src/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fceef8ee85172430","code_sha256_prefix":"fceef8ee85172430","mcp_get_code":{"code_sha256":"fceef8ee85172430"}},{"arxiv_id":"2004.01024","arxiv_id_is_arxiv":true,"paper":"/paper/modeling-dynamic-heterogeneous-network-for","title":"Modeling Dynamic Heterogeneous Network for Link Prediction using Hierarchical Attention with Temporal RNN","date":"2020-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"skx300/DyHATR","path":"src/utils/data_helper.py","file_url":"https://github.com/skx300/DyHATR/blob/HEAD/src/utils/data_helper.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"534b65288641dbdd","code_sha256_prefix":"534b65288641dbdd","mcp_get_code":{"code_sha256":"534b65288641dbdd"}},{"arxiv_id":"2003.11235","arxiv_id_is_arxiv":true,"paper":"/paper/autofis-automatic-feature-interaction","title":"AutoFIS: Automatic Feature Interaction Selection in Factorization Models for Click-Through Rate Prediction","date":"2020-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"renmada/PaddleRec","path":"datasets/AmazonBook/preprocess.py","file_url":"https://github.com/renmada/PaddleRec/blob/HEAD/datasets/AmazonBook/preprocess.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e192b64a7c6ac2de","code_sha256_prefix":"e192b64a7c6ac2de","mcp_get_code":{"code_sha256":"e192b64a7c6ac2de"}},{"arxiv_id":"2002.01633","arxiv_id_is_arxiv":true,"paper":"/paper/structural-deep-clustering-network","title":"Structural Deep Clustering Network","date":"2020-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"461054993/SDCN","path":"utils.py","file_url":"https://github.com/461054993/SDCN/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"25fe78ad026472c5","code_sha256_prefix":"25fe78ad026472c5","mcp_get_code":{"code_sha256":"25fe78ad026472c5"}},{"arxiv_id":"1909.04063","arxiv_id_is_arxiv":true,"paper":"/paper/exploratory-combinatorial-optimization-with","title":"Exploratory Combinatorial Optimization with Reinforcement Learning","date":"2019-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ilBarbara/BioRL","path":"experiments/utils.py","file_url":"https://github.com/ilBarbara/BioRL/blob/HEAD/experiments/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"159da52928b75420","code_sha256_prefix":"159da52928b75420","mcp_get_code":{"code_sha256":"159da52928b75420"}},{"arxiv_id":"1904.01569","arxiv_id_is_arxiv":true,"paper":"/paper/exploring-randomly-wired-neural-networks-for","title":"Exploring Randomly Wired Neural Networks for Image Recognition","date":"2019-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hebo1221/RandWireNN","path":"utils/graph.py","file_url":"https://github.com/hebo1221/RandWireNN/blob/HEAD/utils/graph.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"174138ce951dc5a6","code_sha256_prefix":"174138ce951dc5a6","mcp_get_code":{"code_sha256":"174138ce951dc5a6"}},{"arxiv_id":"1903.08527","arxiv_id_is_arxiv":true,"paper":"/paper/accurate-3d-face-reconstruction-with-weakly","title":"Accurate 3D Face Reconstruction with Weakly-Supervised Learning: From Single Image to Image Set","date":"2019-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Microsoft/Deep3DFaceReconstruction","path":"utils.py","file_url":"https://github.com/Microsoft/Deep3DFaceReconstruction/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"effa45a7df1ea25f","code_sha256_prefix":"effa45a7df1ea25f","mcp_get_code":{"code_sha256":"effa45a7df1ea25f"}},{"arxiv_id":"1810.06111","arxiv_id_is_arxiv":true,"paper":"/paper/novel-deep-learning-methods-for-track","title":"Novel deep learning methods for track reconstruction","date":null,"month_inferred_from_arxiv_id":"2018-10","title_source":"archive","repo":"savvy379/princeton_gnn_tracking","path":"models/EC1/graph.py","file_url":"https://github.com/savvy379/princeton_gnn_tracking/blob/HEAD/models/EC1/graph.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, savvy379/princeton_gnn_tracking when it was checked","code_sha256":"38dc38562d48e8d2","code_sha256_prefix":"38dc38562d48e8d2","mcp_get_code":{"code_sha256":"38dc38562d48e8d2"}},{"arxiv_id":"1805.11921","arxiv_id_is_arxiv":true,"paper":"/paper/anonymous-walk-embeddings","title":"Anonymous Walk Embeddings","date":"2018-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"paulmorio/geo2dr","path":"geometric2dr/decomposition/anonymous_walk_patterns.py","file_url":"https://github.com/paulmorio/geo2dr/blob/HEAD/geometric2dr/decomposition/anonymous_walk_patterns.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4f3654b5c497f71c","code_sha256_prefix":"4f3654b5c497f71c","mcp_get_code":{"code_sha256":"4f3654b5c497f71c"}},{"arxiv_id":"1804.03619","arxiv_id_is_arxiv":true,"paper":"/paper/looking-to-listen-at-the-cocktail-party-a","title":"Looking to Listen at the Cocktail Party: A Speaker-Independent Audio-Visual Model for Speech Separation","date":"2018-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bill9800/speech_separation","path":"model/lib/model_ops.py","file_url":"https://github.com/bill9800/speech_separation/blob/HEAD/model/lib/model_ops.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3429f0df7ba92cab","code_sha256_prefix":"3429f0df7ba92cab","mcp_get_code":{"code_sha256":"3429f0df7ba92cab"}},{"arxiv_id":"1611.07004","arxiv_id_is_arxiv":true,"paper":"/paper/image-to-image-translation-with-conditional","title":"Image-to-Image Translation with Conditional Adversarial Networks","date":"2016-11-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"abods/generative_painting","path":"face-landmark/run_webcam.py","file_url":"https://github.com/abods/generative_painting/blob/HEAD/face-landmark/run_webcam.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e256df3356f624e8","code_sha256_prefix":"e256df3356f624e8","mcp_get_code":{"code_sha256":"e256df3356f624e8"}},{"arxiv_id":"2023.acl-long.776","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.acl-long.776","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"PreferredAI/topic-metrics","path":"topic_metrics/io_utils.py","file_url":"https://github.com/PreferredAI/topic-metrics/blob/HEAD/topic_metrics/io_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e2d2aab1f358a004","code_sha256_prefix":"e2d2aab1f358a004","mcp_get_code":{"code_sha256":"e2d2aab1f358a004"}}],"record_sha256":"35c6c6ce5fa17a45a66b0f403060f614f80dec82a0e47431765c87713c60d886","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}