{"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":"/task/edge-classification","name":"Edge Classification","slug":"edge-classification","description_markdown":null,"categories":[],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":56,"papers_with_code":27,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":1,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[{"url":"/dataset/dtgb","name":"DTGB","full_name":"Dynamic Text-attributed Graph Benchmark","num_papers_in_archive":2}],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":1,"rows_per_page":100,"shown":56,"of":56,"of_with_code":27,"tagged_in_all":56,"counts":{"archive_papers_tagged":56,"with_a_code_link":27,"where_syntology_ran_a_sample":9,"not_listed_spam_title":0,"listed":56,"listed_where_code_ran":9,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":8,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":8,"listed_every_run_a_failure_of_syntologys_instrument":1,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/evolvegcn-evolving-graph-convolutional","slug":"evolvegcn-evolving-graph-convolutional","title":"EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs","date":"2019-02-26","arxiv_id":"1902.10191","repositories_listed":10,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":6,"n_pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 1 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/evolvegcn-evolving-graph-convolutional#ran","syntology_url":"https://syntology.ai/paper/1902.10191","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.10191"}},"official":{"repos":["IBM/AMLSim","IBM/EvolveGCN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/digress-discrete-denoising-diffusion-for","slug":"digress-discrete-denoising-diffusion-for","title":"DiGress: Discrete Denoising diffusion for graph generation","date":"2022-09-29","arxiv_id":"2209.14734","repositories_listed":3,"syntology":{"n":25,"n_ran":15,"n_constructed":10,"n_ran_checked":10,"n_instrument":5,"n_unverified":10,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"15 ran (of which 10 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 5 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/digress-discrete-denoising-diffusion-for#ran","syntology_url":"https://syntology.ai/paper/2209.14734","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.14734"}},"official":{"repos":["cvignac/digress"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":["listed"]}}},{"url":"/paper/edge-augmented-graph-transformers-global-self","slug":"edge-augmented-graph-transformers-global-self","title":"Global Self-Attention as a Replacement for Graph Convolution","date":"2021-08-07","arxiv_id":"2108.03348","repositories_listed":3,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/edge-augmented-graph-transformers-global-self#ran","syntology_url":"https://syntology.ai/paper/2108.03348","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.03348"}},"official":{"repos":["shamim-hussain/egt","shamim-hussain/egt_pytorch","shamim-hussain/egt_triangular"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-populating-generalizable-engineering","slug":"towards-populating-generalizable-engineering","title":"Retrieval Augmented Generation using Engineering Design Knowledge","date":"2023-07-13","arxiv_id":"2307.06985","repositories_listed":2,"syntology":null},{"url":"/paper/graph-neural-network-for-cell-tracking-in","slug":"graph-neural-network-for-cell-tracking-in","title":"Graph Neural Network for Cell Tracking in Microscopy Videos","date":"2022-02-09","arxiv_id":"2202.04731","repositories_listed":2,"syntology":null},{"url":"/paper/grape-fast-and-scalable-graph-processing-and","slug":"grape-fast-and-scalable-graph-processing-and","title":"GRAPE for Fast and Scalable Graph Processing and random walk-based Embedding","date":"2021-10-12","arxiv_id":"2110.06196","repositories_listed":2,"syntology":null},{"url":"/paper/adaptive-edge-attention-for-graph-matching","slug":"adaptive-edge-attention-for-graph-matching","title":"Adaptive Edge Attention for Graph Matching with Outliers","date":"2021-08-19","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/learning-and-reasoning-with-the-graph","slug":"learning-and-reasoning-with-the-graph","title":"Learning and Reasoning with the Graph Structure Representation in Robotic Surgery","date":"2020-07-07","arxiv_id":"2007.03357","repositories_listed":2,"syntology":{"n":8,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":8,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/learning-and-reasoning-with-the-graph#ran","syntology_url":"https://syntology.ai/paper/2007.03357","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.03357"}},"official":{"repos":["mobarakol/Surgical_SceneGraph_Generation"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["listed"]}}},{"url":"/paper/lanenet-real-time-lane-detection-networks-for","slug":"lanenet-real-time-lane-detection-networks-for","title":"LaneNet: Real-Time Lane Detection Networks for Autonomous Driving","date":"2018-07-04","arxiv_id":"1807.01726","repositories_listed":2,"syntology":null},{"url":"/paper/scaling-graph-neural-networks-for-particle","slug":"scaling-graph-neural-networks-for-particle","title":"Scaling Graph Neural Networks for Particle Track Reconstruction","date":"2025-04-07","arxiv_id":"2504.04670","repositories_listed":1,"syntology":null},{"url":"/paper/a-great-architecture-for-edge-based-graph","slug":"a-great-architecture-for-edge-based-graph","title":"A GREAT Architecture for Edge-Based Graph Problems Like TSP","date":"2024-08-29","arxiv_id":"2408.16717","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-great-architecture-for-edge-based-graph#ran","syntology_url":"https://syntology.ai/paper/2408.16717","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.16717"}},"official":{"repos":["attila-lischka/GREAT"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/dtgb-a-comprehensive-benchmark-for-dynamic","slug":"dtgb-a-comprehensive-benchmark-for-dynamic","title":"DTGB: A Comprehensive Benchmark for Dynamic Text-Attributed Graphs","date":"2024-06-17","arxiv_id":"2406.12072","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/dtgb-a-comprehensive-benchmark-for-dynamic#ran","syntology_url":"https://syntology.ai/paper/2406.12072","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.12072"}},"official":{"repos":["zjs123/DTGB"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/edge-classification-on-graphs-new-directions","slug":"edge-classification-on-graphs-new-directions","title":"Edge Classification on Graphs: New Directions in Topological Imbalance","date":"2024-06-17","arxiv_id":"2406.11685","repositories_listed":1,"syntology":null},{"url":"/paper/multi-modal-uav-detection-classification-and","slug":"multi-modal-uav-detection-classification-and","title":"Multi-Modal UAV Detection, Classification and Tracking Algorithm -- Technical Report for CVPR 2024 UG2 Challenge","date":"2024-05-26","arxiv_id":"2405.16464","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":6,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/multi-modal-uav-detection-classification-and#ran","syntology_url":"https://syntology.ai/paper/2405.16464","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.16464"}},"official":{"repos":["dtc111111/multi-modal-uav"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/high-pileup-particle-tracking-with-object","slug":"high-pileup-particle-tracking-with-object","title":"High Pileup Particle Tracking with Object Condensation","date":"2023-12-06","arxiv_id":"2312.03823","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":4,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/high-pileup-particle-tracking-with-object#ran","syntology_url":"https://syntology.ai/paper/2312.03823","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.03823"}},"official":{"repos":["gnn-tracking/gnn_tracking"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/3dmotformer-graph-transformer-for-online-3d","slug":"3dmotformer-graph-transformer-for-online-3d","title":"3DMOTFormer: Graph Transformer for Online 3D Multi-Object Tracking","date":"2023-08-12","arxiv_id":"2308.06635","repositories_listed":1,"syntology":null},{"url":"/paper/edgeformers-graph-empowered-transformers-for","slug":"edgeformers-graph-empowered-transformers-for","title":"Edgeformers: Graph-Empowered Transformers for Representation Learning on Textual-Edge Networks","date":"2023-02-21","arxiv_id":"2302.11050","repositories_listed":1,"syntology":{"n":7,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/edgeformers-graph-empowered-transformers-for#ran","syntology_url":"https://syntology.ai/paper/2302.11050","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.11050"}},"official":{"repos":["petergriffinjin/edgeformers"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/a-framework-for-large-scale-synthetic-graph","slug":"a-framework-for-large-scale-synthetic-graph","title":"A Framework for Large Scale Synthetic Graph Dataset Generation","date":"2022-10-04","arxiv_id":"2210.01944","repositories_listed":1,"syntology":null},{"url":"/paper/graph-representation-learning-beyond-node-and","slug":"graph-representation-learning-beyond-node-and","title":"Graph Representation Learning Beyond Node and Homophily","date":"2022-03-03","arxiv_id":"2203.01564","repositories_listed":1,"syntology":null},{"url":"/paper/heat-holistic-edge-attention-transformer-for","slug":"heat-holistic-edge-attention-transformer-for","title":"HEAT: Holistic Edge Attention Transformer for Structured Reconstruction","date":"2021-11-30","arxiv_id":"2111.15143","repositories_listed":1,"syntology":null},{"url":"/paper/classifying-dyads-for-militarized-conflict","slug":"classifying-dyads-for-militarized-conflict","title":"Classifying Dyads for Militarized Conflict Analysis","date":"2021-09-27","arxiv_id":"2109.12860","repositories_listed":1,"syntology":null},{"url":"/paper/stack-sentence-ordering-with-temporal","slug":"stack-sentence-ordering-with-temporal","title":"STaCK: Sentence Ordering with Temporal Commonsense Knowledge","date":"2021-09-06","arxiv_id":"2109.02247","repositories_listed":1,"syntology":null},{"url":"/paper/charged-particle-tracking-via-edge","slug":"charged-particle-tracking-via-edge","title":"Charged particle tracking via edge-classifying interaction networks","date":"2021-03-30","arxiv_id":"2103.16701","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":2,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 2 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/charged-particle-tracking-via-edge#ran","syntology_url":"https://syntology.ai/paper/2103.16701","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.16701"}},"official":{"repos":["GageDeZoort/interaction_network_paper"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/unmixing-convolutional-features-for-crisp","slug":"unmixing-convolutional-features-for-crisp","title":"Unmixing Convolutional Features for Crisp Edge Detection","date":"2020-11-19","arxiv_id":"2011.09808","repositories_listed":1,"syntology":null},{"url":"/paper/real-time-edge-classification-optimal","slug":"real-time-edge-classification-optimal","title":"Real-Time Edge Classification: Optimal Offloading under Token Bucket Constraints","date":"2020-10-26","arxiv_id":"2010.13737","repositories_listed":1,"syntology":null},{"url":"/paper/shearlets-as-feature-extractor-for-semantic","slug":"shearlets-as-feature-extractor-for-semantic","title":"Shearlets as Feature Extractor for Semantic Edge Detection: The Model-Based and Data-Driven Realm","date":"2019-11-27","arxiv_id":"1911.12159","repositories_listed":1,"syntology":null},{"url":"/paper/tensor-graph-convolutional-networks-for","slug":"tensor-graph-convolutional-networks-for","title":"Dynamic Graph Convolutional Networks Using the Tensor M-Product","date":"2019-10-16","arxiv_id":"1910.07643","repositories_listed":1,"syntology":null},{"url":null,"slug":"llm-driven-knowledge-distillation-for-dynamic","title":"LLM-driven Knowledge Distillation for Dynamic Text-Attributed Graphs","date":"2025-02-15","arxiv_id":"2502.10914","repositories_listed":0,"syntology":null},{"url":null,"slug":"disentangling-popularity-and-quality-an-edge","title":"Disentangling Popularity and Quality: An Edge Classification Approach for Fair Recommendation","date":"2025-01-06","arxiv_id":"2502.15699","repositories_listed":0,"syntology":null},{"url":null,"slug":"local-and-global-graph-modeling-with-edge","title":"Local and Global Graph Modeling with Edge-weighted Graph Attention Network for Handwritten Mathematical Expression Recognition","date":"2024-10-24","arxiv_id":"2410.18555","repositories_listed":0,"syntology":null},{"url":null,"slug":"metric-semantic-factor-graph-generation-based","title":"Metric-Semantic Factor Graph Generation based on Graph Neural Networks","date":"2024-09-18","arxiv_id":"2409.11972","repositories_listed":0,"syntology":null},{"url":null,"slug":"rtat-a-robust-two-stage-association-tracker","title":"RTAT: A Robust Two-stage Association Tracker for Multi-Object Tracking","date":"2024-08-14","arxiv_id":"2408.07344","repositories_listed":0,"syntology":null},{"url":null,"slug":"eggnet-an-evolving-graph-based-graph","title":"EggNet: An Evolving Graph-based Graph Attention Network for Particle Track Reconstruction","date":"2024-07-18","arxiv_id":"2407.13925","repositories_listed":0,"syntology":null},{"url":null,"slug":"effective-edge-wise-representation-learning","title":"Effective Edge-wise Representation Learning in Edge-Attributed Bipartite Graphs","date":"2024-06-19","arxiv_id":"2406.13369","repositories_listed":0,"syntology":null},{"url":null,"slug":"lift-your-molecules-molecular-graph","title":"Lift Your Molecules: Molecular Graph Generation in Latent Euclidean Space","date":"2024-06-15","arxiv_id":"2406.10513","repositories_listed":0,"syntology":null},{"url":null,"slug":"vision-mamba-cutting-edge-classification-of","title":"Vision Mamba: Cutting-Edge Classification of Alzheimer's Disease with 3D MRI Scans","date":"2024-06-09","arxiv_id":"2406.05757","repositories_listed":0,"syntology":null},{"url":null,"slug":"reasoning-algorithmically-in-graph-neural","title":"Reasoning Algorithmically in Graph Neural Networks","date":"2024-02-21","arxiv_id":"2402.13744","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-omics-sampling-based-graph-transformer","title":"Multi-omics Sampling-based Graph Transformer for Synthetic Lethality Prediction","date":"2023-10-17","arxiv_id":"2310.11082","repositories_listed":0,"syntology":null},{"url":null,"slug":"low-latency-edge-classification-gnn-for","title":"Low Latency Edge Classification GNN for Particle Trajectory Tracking on FPGAs","date":"2023-06-20","arxiv_id":"2306.11330","repositories_listed":0,"syntology":null},{"url":null,"slug":"lyapunov-driven-deep-reinforcement-learning","title":"Lyapunov-Driven Deep Reinforcement Learning for Edge Inference Empowered by Reconfigurable Intelligent Surfaces","date":"2023-05-18","arxiv_id":"2305.10931","repositories_listed":0,"syntology":null},{"url":null,"slug":"grande-a-neural-model-over-directed","title":"GRANDE: a neural model over directed multigraphs with application to anti-money laundering","date":"2023-02-04","arxiv_id":"2302.02101","repositories_listed":0,"syntology":null},{"url":null,"slug":"visuotactile-affordances-for-cloth","title":"Visuotactile Affordances for Cloth Manipulation with Local Control","date":"2022-12-09","arxiv_id":"2212.05108","repositories_listed":0,"syntology":null},{"url":null,"slug":"evince-the-artifacts-of-spoof-speech-by","title":"Evince the artifacts of Spoof Speech by blending Vocal Tract and Voice Source Features","date":"2022-12-05","arxiv_id":"2212.02013","repositories_listed":0,"syntology":null},{"url":null,"slug":"direct-embedding-of-temporal-network-edges","title":"Direct Embedding of Temporal Network Edges via Time-Decayed Line Graphs","date":"2022-09-30","arxiv_id":"2210.00032","repositories_listed":0,"syntology":null},{"url":null,"slug":"polarmot-how-far-can-geometric-relations-take","title":"PolarMOT: How Far Can Geometric Relations Take Us in 3D Multi-Object Tracking?","date":"2022-08-03","arxiv_id":"2208.01957","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-and-effective-training-of-language","title":"Efficient and effective training of language and graph neural network models","date":"2022-06-22","arxiv_id":"2206.10781","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-heterophilious-edge-to-drop-a","title":"Revisiting the role of heterophily in graph representation learning: An edge classification perspective","date":"2022-05-23","arxiv_id":"2205.11322","repositories_listed":0,"syntology":null},{"url":null,"slug":"artificial-intelligence-based-tool-wear-and","title":"Artificial Intelligence based tool wear and defect prediction for special purpose milling machinery using low-cost acceleration sensor retrofits","date":"2022-02-07","arxiv_id":"2202.03068","repositories_listed":0,"syntology":null},{"url":null,"slug":"neighborhood-random-walk-graph-sampling-for","title":"Neighborhood Random Walk Graph Sampling for Regularized Bayesian Graph Convolutional Neural Networks","date":"2021-12-14","arxiv_id":"2112.07743","repositories_listed":0,"syntology":null},{"url":null,"slug":"attre2vec-unsupervised-attributed-edge","title":"AttrE2vec: Unsupervised Attributed Edge Representation Learning","date":"2020-12-29","arxiv_id":"2012.14727","repositories_listed":0,"syntology":null},{"url":null,"slug":"analyzing-the-performance-of-graph-neural","title":"Analyzing the Performance of Graph Neural Networks with Pipe Parallelism","date":"2020-12-20","arxiv_id":"2012.10840","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-multi-scale-feature-learning-for-defocus","title":"Deep Multi-Scale Feature Learning for Defocus Blur Estimation","date":"2020-09-24","arxiv_id":"2009.11939","repositories_listed":0,"syntology":null},{"url":null,"slug":"locec-local-community-based-edge","title":"LoCEC: Local Community-based Edge Classification in Large Online Social Networks","date":"2020-02-11","arxiv_id":"2002.04180","repositories_listed":0,"syntology":null},{"url":null,"slug":"leaf-segmentation-through-the-classification","title":"Leaf segmentation through the classification of edges","date":"2019-04-05","arxiv_id":"1904.03124","repositories_listed":0,"syntology":null},{"url":null,"slug":"salprop-salient-object-proposals-via","title":"SalProp: Salient object proposals via aggregated edge cues","date":"2017-06-14","arxiv_id":"1706.04472","repositories_listed":0,"syntology":null},{"url":null,"slug":"classification-in-biological-networks-with","title":"Classification in biological networks with hypergraphlet kernels","date":"2017-03-14","arxiv_id":"1703.04823","repositories_listed":0,"syntology":null}],"syntology_records":10,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":9,"papers_where_code_ran_first_page":"/task/edge-classification/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/task/edge-classification/papers/ran/1","json":"/task/edge-classification/papers/ran/1.json","rows":9}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","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)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"390486eb1d10ef8c36a394ee67b2c6a05f68347d8fe1603839afad4d6db7a088","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}