{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/aggregate","entry":"aggregate","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":35,"n_papers_ran":22,"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":18,"n_samples_fingerprinted":4,"n_places":35,"n_places_pointer_only":16,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":5,"ran_fixture":0,"ran":13,"unverified":13},"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.03109","paper":"/paper/arxiv-2609-03109","title":"SLIDEFORGE: An LLM Agent for Controllable Editing of Slides as Structured Artifacts","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"UIUC-MONET/SLIDEFORGE","path":"decomposition/usage_report.py","file_url":"https://github.com/UIUC-MONET/SLIDEFORGE/blob/HEAD/decomposition/usage_report.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"13b4b017794fcb7a","mcp_get_code":{"code_sha256":"13b4b017794fcb7a"}},{"arxiv_id":"2609.01761","paper":"/paper/arxiv-2609-01761","title":"Pooling and Drift in Delayed Bandits","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"melikabaghi/state-exp3","path":"code/data_driven_grouping.py","file_url":"https://github.com/melikabaghi/state-exp3/blob/HEAD/code/data_driven_grouping.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5a0afb39de3d2007","mcp_get_code":{"code_sha256":"5a0afb39de3d2007"}},{"arxiv_id":"2608.24876","paper":"/paper/arxiv-2608-24876","title":"Recursive Experiential-Working Memory Evolution for Long-Horizon Agent Harnesses","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"Gen-Verse/Recuris","path":"src/recuris/fingerprint.py","file_url":"https://github.com/Gen-Verse/Recuris/blob/HEAD/src/recuris/fingerprint.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"bc6e12863e45a0d8","mcp_get_code":{"code_sha256":"bc6e12863e45a0d8"}},{"arxiv_id":"2608.16190","paper":"/paper/arxiv-2608-16190","title":"Decorrelation Is Not Complementarity: Skill, Not Lineage, Governs Trusted-Monitor Ensembles","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"anik-jha/challenger-panels","path":"src/panel.py","file_url":"https://github.com/anik-jha/challenger-panels/blob/HEAD/src/panel.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"505bc8d187a78387","mcp_get_code":{"code_sha256":"505bc8d187a78387"}},{"arxiv_id":"2608.00718","paper":"/paper/arxiv-2608-00718","title":"Adversarial Attacks in Multi-Agent LLM Pipelines: Unveiling Structural Vulnerabilities in Agentic AI Architectures","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"SPaDeS-Lab/adversarial-llm-pipeline","path":"evaluation/metrics.py","file_url":"https://github.com/SPaDeS-Lab/adversarial-llm-pipeline/blob/HEAD/evaluation/metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d7174b60320702f5","mcp_get_code":{"code_sha256":"d7174b60320702f5"}},{"arxiv_id":"2607.24165","paper":"/paper/arxiv-2607-24165","title":"Do Current Retrievers Cover All the Evidence? A Controlled Study of Conjunctive Cross-Page Retrieval","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"sunggukcha/n_clue","path":"code/nclue_decompose_dense.py","file_url":"https://github.com/sunggukcha/n_clue/blob/HEAD/code/nclue_decompose_dense.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"728037e175779011","mcp_get_code":{"code_sha256":"728037e175779011"}},{"arxiv_id":"2606.27783","paper":"/paper/arxiv-2606-27783","title":"CANNs: A Toolkit for Research on Continuous Attractor Neural Networks","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Routhleck/canns-lib","path":"benchmarks/ripser/analysis_results.py","file_url":"https://github.com/Routhleck/canns-lib/blob/HEAD/benchmarks/ripser/analysis_results.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"419b2fa83115ff7a","mcp_get_code":{"code_sha256":"419b2fa83115ff7a"}},{"arxiv_id":"2605.20978","paper":"/paper/arxiv-2605-20978","title":"Point Cloud Sequence Encoding for Material-conditioned Graph Network Simulators","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"ALRhub/mango","path":"src/mango/simulator/gnn/egno/egno.py","file_url":"https://github.com/ALRhub/mango/blob/HEAD/src/mango/simulator/gnn/egno/egno.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c13557c4c4b42aff","mcp_get_code":{"code_sha256":"c13557c4c4b42aff"}},{"arxiv_id":"2605.12768","paper":"/paper/arxiv-2605-12768","title":"ISOMORPH: A Supply Chain Digital Twin for Simulation, Dataset Generation, and Forecasting Benchmarks","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"tuhinsahai/ISOMORPH","path":"analysis/bullwhip_analysis.py","file_url":"https://github.com/tuhinsahai/ISOMORPH/blob/HEAD/analysis/bullwhip_analysis.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1be08f6fc669dd12","mcp_get_code":{"code_sha256":"1be08f6fc669dd12"}},{"arxiv_id":"2604.20161","paper":"/paper/arxiv-2604-20161","title":"SMART: A Spectral Transfer Approach to Multi-Task Learning","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"boxinz17/smart","path":"simulation/visualize_simulation.py","file_url":"https://github.com/boxinz17/smart/blob/HEAD/simulation/visualize_simulation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0081a5c9782d6868","mcp_get_code":{"code_sha256":"0081a5c9782d6868"}},{"arxiv_id":"2603.22754","paper":"/paper/arxiv-2603-22754","title":"PRISM: A Dual View of LLM Reasoning through Semantic Flow and Latent Computation","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"chili-lab/PRISM","path":"prism_code/aggregate_lib.py","file_url":"https://github.com/chili-lab/PRISM/blob/HEAD/prism_code/aggregate_lib.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"521cdb0c455d1b35","mcp_get_code":{"code_sha256":"521cdb0c455d1b35"}},{"arxiv_id":"2510.23190","paper":"/paper/arxiv-2510-23190","title":"Evaluation of Vision-LLMs in Surveillance Video","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"pascalbenschopTU/VLLM_AnomalyRecognition","path":"models/aggregate_and_plot_synthetic.py","file_url":"https://github.com/pascalbenschopTU/VLLM_AnomalyRecognition/blob/HEAD/models/aggregate_and_plot_synthetic.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"75dcdcd29a42d46f","mcp_get_code":{"code_sha256":"75dcdcd29a42d46f"}},{"arxiv_id":"2510.07364","paper":"/paper/arxiv-2510-07364","title":"Base Models Know How to Reason, Thinking Models Learn When","date":"2025-10-08","month_inferred_from_arxiv_id":null,"title_source":"syntology","repo":"cvenhoff/thinking-llms-interp","path":"hybrid/aggregate_samples_final.py","file_url":"https://github.com/cvenhoff/thinking-llms-interp/blob/HEAD/hybrid/aggregate_samples_final.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f057a2fcae4eb4e3","mcp_get_code":{"code_sha256":"f057a2fcae4eb4e3"}},{"arxiv_id":"2510.04233","paper":"/paper/arxiv-2510-04233","title":"PAINET: A Principled Efficient Transformer for 3D Dynamics Modeling","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"Icarus1411/PAINET","path":"model/PAINET_md17.py","file_url":"https://github.com/Icarus1411/PAINET/blob/HEAD/model/PAINET_md17.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c13557c4c4b42aff","mcp_get_code":{"code_sha256":"c13557c4c4b42aff"}},{"arxiv_id":"2501.09214","paper":"/paper/boosting-short-text-classification-with-multi","title":"Boosting Short Text Classification with Multi-Source Information Exploration and Dual-Level Contrastive Learning","date":"2025-01-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KEAML-JLU/MI-DELIGHT","path":"model.py","file_url":"https://github.com/KEAML-JLU/MI-DELIGHT/blob/HEAD/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"df0dbeb2fb94a5f7","mcp_get_code":{"code_sha256":"df0dbeb2fb94a5f7"}},{"arxiv_id":"2411.06116","paper":"/paper/supernotes-driving-consensus-in-crowd-sourced","title":"Supernotes: Driving Consensus in Crowd-Sourced Fact-Checking","date":null,"month_inferred_from_arxiv_id":"2024-11","title_source":"archive","repo":"saveski-lab/supernotes","path":"supernotes/aggregator.py","file_url":"https://github.com/saveski-lab/supernotes/blob/HEAD/supernotes/aggregator.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC-BY-4.0","inline_ok":false,"code_sha256_prefix":"aeb810e59fc176ec","mcp_get_code":{"code_sha256":"aeb810e59fc176ec"}},{"arxiv_id":"2410.10476","paper":"/paper/will-llms-replace-the-encoder-only-models-in","title":"Will LLMs Replace the Encoder-Only Models in Temporal Relation Classification?","date":"2024-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BrownFortress/LLMs-TRC","path":"XAI_analysis/utils/attribution_scores.py","file_url":"https://github.com/BrownFortress/LLMs-TRC/blob/HEAD/XAI_analysis/utils/attribution_scores.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4e80b769da0a37b8","mcp_get_code":{"code_sha256":"4e80b769da0a37b8"}},{"arxiv_id":"2410.04332","paper":"/paper/gradient-routing-masking-gradients-to","title":"Gradient Routing: Masking Gradients to Localize Computation in Neural Networks","date":"2024-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kxcloud/gradient-routing","path":"projects/mnist/analyze_runs_for_paper_main.py","file_url":"https://github.com/kxcloud/gradient-routing/blob/HEAD/projects/mnist/analyze_runs_for_paper_main.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3fb7c31e0071ab22","mcp_get_code":{"code_sha256":"3fb7c31e0071ab22"}},{"arxiv_id":"2408.00169","paper":"/paper/2408-00169","title":"Strike the Balance: On-the-Fly Uncertainty based User Interactions for Long-Term Video Object Segmentation","date":"2024-07-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vujas-eteph/lazyxmem","path":"model/aggregate.py","file_url":"https://github.com/vujas-eteph/lazyxmem/blob/HEAD/model/aggregate.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"add9d1273a2b1e30","mcp_get_code":{"code_sha256":"add9d1273a2b1e30"}},{"arxiv_id":"2405.13432","paper":"/paper/disperse-then-merge-pushing-the-limits-of","title":"Disperse-Then-Merge: Pushing the Limits of Instruction Tuning via Alignment Tax Reduction","date":"2024-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TingchenFu/ACL24-ExpertFusion","path":"code/merge_utils.py","file_url":"https://github.com/TingchenFu/ACL24-ExpertFusion/blob/HEAD/code/merge_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"beaf421b457284c5","mcp_get_code":{"code_sha256":"beaf421b457284c5"}},{"arxiv_id":"2401.11037","paper":"/paper/equivariant-graph-neural-operator-for","title":"Equivariant Graph Neural Operator for Modeling 3D Dynamics","date":"2024-01-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"minkaixu/egno","path":"model/basic.py","file_url":"https://github.com/minkaixu/egno/blob/HEAD/model/basic.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c13557c4c4b42aff","mcp_get_code":{"code_sha256":"c13557c4c4b42aff"}},{"arxiv_id":"2310.20410","paper":"/paper/followbench-a-multi-level-fine-grained","title":"FollowBench: A Multi-level Fine-grained Constraints Following Benchmark for Large Language Models","date":"2023-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yjiangcm/followbench","path":"aggregator.py","file_url":"https://github.com/yjiangcm/followbench/blob/HEAD/aggregator.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"8d6ef831d2b39bd8","mcp_get_code":{"code_sha256":"8d6ef831d2b39bd8"}},{"arxiv_id":"2310.15080","paper":"/paper/federated-learning-of-large-language-models","title":"Federated Learning of Large Language Models with Parameter-Efficient Prompt Tuning and Adaptive Optimization","date":"2023-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"llm-eff/FedPepTAO","path":"decoder-only-gpt2/evaluations.py","file_url":"https://github.com/llm-eff/FedPepTAO/blob/HEAD/decoder-only-gpt2/evaluations.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4a1d825b123f1168","mcp_get_code":{"code_sha256":"4a1d825b123f1168"}},{"arxiv_id":"2304.11968","paper":"/paper/track-anything-segment-anything-meets-videos","title":"Track Anything: Segment Anything Meets Videos","date":"2023-04-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gaomingqi/track-anything","path":"tracker/model/aggregate.py","file_url":"https://github.com/gaomingqi/track-anything/blob/HEAD/tracker/model/aggregate.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"db0ab43be2a00330","mcp_get_code":{"code_sha256":"db0ab43be2a00330"}},{"arxiv_id":"2304.00755","paper":"/paper/effective-and-stable-role-based-multi-agent","title":"Effective and Stable Role-Based Multi-Agent Collaboration by Structural Information Principles","date":"2023-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RingBDStack/SR-MARL","path":"src/clusters/structural_entropy.py","file_url":"https://github.com/RingBDStack/SR-MARL/blob/HEAD/src/clusters/structural_entropy.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"bb1a5a3343993a03","mcp_get_code":{"code_sha256":"bb1a5a3343993a03"}},{"arxiv_id":"2209.10931","paper":"/paper/making-byzantine-decentralized-learning","title":"Robust Collaborative Learning with Linear Gradient Overhead","date":"2022-09-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lpd-epfl/robust-collaborative-learning","path":"aggregators/cenna.py","file_url":"https://github.com/lpd-epfl/robust-collaborative-learning/blob/HEAD/aggregators/cenna.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"aab536b772e8870b","mcp_get_code":{"code_sha256":"aab536b772e8870b"}},{"arxiv_id":"2208.04529","paper":"/paper/motif-based-graph-representation-learning","title":"Motif-based Graph Representation Learning with Application to Chemical Molecules","date":"2022-08-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yifeiwang15/motifconv","path":"graph_match/run_gm.py","file_url":"https://github.com/yifeiwang15/motifconv/blob/HEAD/graph_match/run_gm.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cfca0c1bd45d6400","mcp_get_code":{"code_sha256":"cfca0c1bd45d6400"}},{"arxiv_id":"2208.01924","paper":"/paper/per-clip-video-object-segmentation-1","title":"Per-Clip Video Object Segmentation","date":"2022-08-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pkyong95/PCVOS","path":"inference_core_yv.py","file_url":"https://github.com/pkyong95/PCVOS/blob/HEAD/inference_core_yv.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"e7f0c41c3a51a187","mcp_get_code":{"code_sha256":"e7f0c41c3a51a187"}},{"arxiv_id":"2207.07115","paper":"/paper/xmem-long-term-video-object-segmentation-with","title":"XMem: Long-Term Video Object Segmentation with an Atkinson-Shiffrin Memory Model","date":"2022-07-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tianyuan168326/videosemanticcompression-pytorch","path":"XMem/model/network.py","file_url":"https://github.com/tianyuan168326/videosemanticcompression-pytorch/blob/HEAD/XMem/model/network.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"db0ab43be2a00330","mcp_get_code":{"code_sha256":"db0ab43be2a00330"}},{"arxiv_id":"2202.10643","paper":"/paper/equivariant-graph-hierarchy-based-neural","title":"Equivariant Graph Hierarchy-Based Neural Networks","date":"2022-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hanjq17/eghn","path":"model/basic.py","file_url":"https://github.com/hanjq17/eghn/blob/HEAD/model/basic.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c13557c4c4b42aff","mcp_get_code":{"code_sha256":"c13557c4c4b42aff"}},{"arxiv_id":"2201.11945","paper":"/paper/learning-proximal-operators-to-discover","title":"Learning Proximal Operators to Discover Multiple Optima","date":"2022-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lingxiaoli94/pol","path":"pol/utils/loss_aggregation.py","file_url":"https://github.com/lingxiaoli94/pol/blob/HEAD/pol/utils/loss_aggregation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"063a0fdf435680a0","mcp_get_code":{"code_sha256":"063a0fdf435680a0"}},{"arxiv_id":"2106.06981","paper":"/paper/thinking-like-transformers-1","title":"Thinking Like Transformers","date":"2021-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"princeton-nlp/transformerprograms","path":"programs/rasp/double_hist/double_hist.py","file_url":"https://github.com/princeton-nlp/transformerprograms/blob/HEAD/programs/rasp/double_hist/double_hist.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"fec1c122bc1ffea7","mcp_get_code":{"code_sha256":"fec1c122bc1ffea7"}},{"arxiv_id":"1803.06272","paper":"/paper/graph-partition-neural-networks-for-semi","title":"Graph Partition Neural Networks for Semi-Supervised Classification","date":"2018-03-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Microsoft/graph-partition-neural-network-samples","path":"gpnn/model/model_helper.py","file_url":"https://github.com/Microsoft/graph-partition-neural-network-samples/blob/HEAD/gpnn/model/model_helper.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b4d3f127a57bf846","mcp_get_code":{"code_sha256":"b4d3f127a57bf846"}},{"arxiv_id":"aaai_29835","paper":null,"title":"arXiv:aaai_29835","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"KEAML-JLU/GIFT","path":"utils.py","file_url":"https://github.com/KEAML-JLU/GIFT/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"61922e31cc76a05c","mcp_get_code":{"code_sha256":"61922e31cc76a05c"}},{"arxiv_id":"2023.findings-acl.586","paper":null,"title":"arXiv:2023.findings-acl.586","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"THU-KEG/OmniEvent","path":"OmniEvent/aggregation/aggregation.py","file_url":"https://github.com/THU-KEG/OmniEvent/blob/HEAD/OmniEvent/aggregation/aggregation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c322a7844c5cd041","mcp_get_code":{"code_sha256":"c322a7844c5cd041"}}]}