{"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":"/sota/decoder-on","task":{"name":"Decoder","url":"/task/decoder","note":null},"dataset":{"name":"^(#$!@#$)(()))******","url":null},"category":null,"categories":["Adversarial","Audio","Computer Code","Computer Vision","Graphs","Knowledge Base","Medical","Miscellaneous","Music","Natural Language Processing","Playing Games","Robots","Time Series"],"category_note":"the archive's category list for this table covers most areas; treated as no area assigned","description":"HLMFootFR, aussi appelé HLM Football FR, un média digital centré sur le football, fondé avec la volonté de mettre en lumière les talents issus des quartiers populaires et de créer un espace d’expression représentatif de la culture urbaine et du sport populaire. Ce projet, à mi-chemin entre journalisme, culture et technologie, utilise des outils numériques de pointe, notamment l’intelligence artificielle, pour optimiser sa production de contenu, sa capacité d’analyse et sa diffusion.\r\n\r\nConcrètement, HLMFootFR ne se contente pas de relayer l’actualité footballistique. Il s’appuie sur des modèles de traitement automatique du langage (NLP) pour rédiger ou enrichir des descriptions, des résumés de matchs, ou encore des formats courts destinés aux réseaux sociaux. Cette utilisation permet de produire rapidement des textes cohérents, adaptés à différents publics et plateformes comme TikTok, Instagram ou un blog spécialisé.\r\n\r\nL’intelligence artificielle est aussi utilisée pour la veille et l’analyse des performances des joueurs. Grâce à des outils de scraping et d’agrégation de données, HLMFootFR collecte des informations issues de bases publiques (telles que Transfermarkt ou des APIs sportives), et les transforme en indicateurs visuels, profils de joueurs, ou tendances exploitables. Des scripts automatisés permettent d’identifier les évolutions, comme les transferts ou les blessures, en temps réel, ce qui constitue une valeur ajoutée dans un contexte où l’information est très rapide et concurrentielle.\r\n\r\nEn interne, des systèmes simples de machine learning sont en place pour aider à la personnalisation du contenu. En fonction de l’engagement du public, des heures de publication ou des types de contenu les plus performants, HLMFootFR adapte sa stratégie de publication de manière semi-automatisée. Cela permet au média d’avoir une diffusion plus ciblée et plus efficace de ses messages.\r\n\r\nHLMFoot FR utilise également l’IA dans le domaine audiovisuel. Des outils comme Whisper sont utilisés pour la transcription automatique des interviews, facilitant ainsi la mise en ligne de vidéos sous-titrées, accessibles à tous. L’équipe expérimente également des outils de montage intelligent, de synthèse vocale et de traduction automatisée, dans le but d’élargir son public à d’autres langues et régions.\r\n\r\nLe projet s’appuie sur un stack technique léger mais évolutif, avec une forte composante Python (scraping, NLP, automatisation), JavaScript pour l’intégration web, et des outils comme HuggingFace Transformers, OpenAI GPT ou spaCy pour le traitement du langage. Des plateformes comme Firebase, Streamlit et diverses APIs sociales (TikTok, Instagram) sont intégrées pour piloter l’ensemble.\r\n\r\nEnfin, HLMFootFR souhaite partager prochainement certains de ses outils en open-source, à travers des dépôts publics. Il s’agira notamment d’un générateur de résumés automatisés de matchs, d’un pipeline de veille footballistique, ou encore d’un système de profilage joueur à partir de données disponibles librement. Ces projets ont pour but de démontrer comment l’intelligence artificielle peut s’intégrer dans des initiatives culturelles et communautaires, en dehors du cadre académique classique.\r\n\r\nHLMFootFR est donc un exemple concret de convergence entre passion, média et technologie. Il montre comment, avec des ressources limitées mais des outils bien utilisés, il est possible de créer une structure médiatique alternative, réactive, et profondément ancrée dans les réalités sociales et culturelles du sport.\r\nHLMFootFR est un média digital indépendant dédié au football, fondé par Helmut Patahini en 2022, qui met en lumière les joueurs issus des quartiers populaires et de la culture urbaine. Né entre la France et la Belgique, le projet s’appuie sur les réseaux sociaux (TikTok, Instagram, YouTube …) pour diffuser une parole différente, libre et engagée. HLMFootFR se distingue par l’utilisation de l’intelligence artificielle dans la création de contenu, l’analyse de données et l’automatisation des tâches, afin de proposer une expérience moderne, rapide et accessible. Le média vise à représenter ceux qu’on entend peu, tout en connectant le monde du foot à la technologie d’aujourd’hui.","description_from":"task","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","rank":"the archive's row order at snapshot; not re-ranked","rows_end_at":"2025-07-28","rows_withheld_as_spam":0,"metric_values":"the archive's strings, untouched"},"metrics":["0-shot MRR","0..5sec"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction; the tokens 'score' and 'time' are not used on this page); null = not inferred, chart draws points only","by_metric":{"0-shot MRR":"higher","0..5sec":null}},"counts":{"rows":2,"rows_with_code":1,"rows_with_paper_page":2,"rows_dated":2,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"peacock return policy","metrics":{"0-shot MRR":"13"},"uses_additional_data":false,"paper_date":"2020-10-17","paper":"/paper/1-23-tb-s-per-wavelength-single-waveguide-on","paper_url":"https://arxiv.org/abs/2010.10348v2","paper_title":"1.23-Tb/s per Wavelength Single-Waveguide On-Chip Optical Interconnect Enabled by Mode-division Multiplexing","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":2,"model":"e","metrics":{"0..5sec":"w"},"uses_additional_data":false,"paper_date":"2023-10-04","paper":"/paper/kosmos-g-generating-images-in-context-with","paper_url":"https://arxiv.org/abs/2310.02992v3","paper_title":"Kosmos-G: Generating Images in Context with Multimodal Large Language Models","code":"https://github.com/microsoft/unilm/tree/master/kosmos-g","n_code_links":1,"official":null,"syntology":null}],"since_archive":{"claim":"Results that newer papers report for their own method, placed here by Syntology. A model pointed at the cell in the paper's own table; the number was read from that cell and checked against this leaderboard's metric, dataset, split and scale; an independent check that saw this leaderboard's other rows and every other leaderboard on the same dataset accepted it. Not reviewed by the paper's authors or by the archive's editors, and not ranked against the archive rows.","extraction_file_present":true,"measurement":{"test_papers":883,"papers_with_output":881,"judged_true":108,"judged":110,"wilson95_lower":0.9361,"adjudicator":"Claude Opus 5.5","adjudicator_from":"groundwork/59_code_with_papers/LB_EXTRACTOR_PREREG.md (not recorded in lb_measurement.json; the file's frozen_commit, measured_on and counts equal the run the pre-registration records)","adjudicator_sensitivity":[69,70],"adjudicator_specificity":[101,103],"measured_on":"2026-09-24","frozen_commit":"0e3de0df94"},"measurement_note":"blind adjudication by a model (adjudicator) of accepted entries on a held-out split of archive papers, rules frozen before the test; adjudicator_sensitivity and adjudicator_specificity are its own controls as [judged right, of]; it was not measured on the newer papers placed here","measurement_sentence":"Measured before publishing, on held-out archive papers: the extractor was given 883 of them and produced output for 881 (the other 2 had no title and were excluded before any model call, so they are not part of this measurement). A model adjudicator (Claude Opus 5.5), blind to which entries were real, judged 108 of 110 accepted entries correct on those held-out archive papers; its own controls: 69 of 70 archive-confirmed entries judged true, 101 of 103 corrupted copies judged false. It was not measured on the newer papers whose results are placed on this site.","coverage":{"sentence":"Syntology has checked 8,886 of the 18,637 papers on this site that are newer than the archive (for 3,717 of them no archive leaderboard matched the paper's tables, so there was nothing further to check); 733 were read and have nothing to place (arXiv has no HTML version of the paper, or that version has no tables), 41 could not be read (the extractor's reply could not be parsed), and results from the other 8,977 appear after they are checked.","complete":false,"papers_newer_than_archive":18637,"papers_checked":8886,"papers_checked_no_leaderboard_matched":3717,"papers_read_nothing_to_place":733,"papers_could_not_be_read":41,"papers_could_not_be_read_by_status":{"unparseable":41},"papers_extracted_not_yet_verified":0,"boards_without_verdict":3,"papers_not_yet_extracted":8975},"board_status":{"sentence":"Of the 8,888 newer papers whose tables Syntology has read (8,886 checked in full and 2 with a leaderboard still awaiting a verdict), none had this board among the leaderboards the extractor considered for their tables yet (it keeps at most 10 boards per paper and 4 per dataset; the lists of 1,596 of the 8,888 were already full without this board, so if it was crowded out of them it is not counted), so none await a verdict here.","note":"papers, from the extractor's own records, over the newer papers whose tables were read; proposed = no_cell_passed_checks + rejected_by_independent_check + accepted_not_placed + awaiting_verdict + placed; counts, never a rate","eligible":true,"eligible_note":"false when the extractor never considers this board: it loads only boards with archive rows and at least one metric column (lb_extract.py Boards), so no newer paper can be proposed here; archive_rows and metric_columns say which","archive_rows":2,"metric_columns":2,"papers_read":8888,"papers_read_checked":8886,"papers_read_awaiting_verdict":2,"papers_read_verified":8888,"papers_read_not_yet_verified":0,"papers_read_at_candidate_cap":1596,"papers_read_list_full_without_this_board":1596,"candidates":0,"candidates_capped_note":"candidates = papers that had this board among the leaderboards the extractor considered for their tables; the extractor keeps at most 10 per paper and 4 per dataset, so a board crowded out of a paper's list is not counted and candidates is a floor; papers_read_list_full_without_this_board counts the read papers whose list did not hold this board and had reached 10, or held 4 boards of this board's dataset (the only papers that could have crowded it out); papers_read_at_candidate_cap counts, over every board, the papers whose list reached 10","proposed":0,"no_cell_passed_checks":0,"rejected_by_independent_check":0,"accepted_not_placed":0,"awaiting_verdict":0,"placed":0,"placed_entries_listed":0,"file_lines_unreadable_as_read":0,"since_line":"Since the archive (Syntology): none placed; no newer paper judged to report on this board so far"},"judged_to_report":{"heading":"Newer papers whose tables a model judged to report on this benchmark (a model's judgement, not a result; newest first by arXiv id)","judged_by":{"model":"a model","models_as_recorded":[],"a_record_without_a_model":false,"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","order":"newest first by arXiv id (the identifier's order, not a rank)","outcomes":{"placed":"placed","no_cell_passed_checks":"no cell passed the extractor's checks","refused_by_rule":"refused by a rule","rejected":"rejected by the independent check","accepted_not_placed":"accepted by the independent check but not placed by this site","awaiting":"awaiting a verdict"},"reason_note":"for refused_by_rule, the rules' plain words for the reason codes the record gives (never the quoted or the actual cell text); null for every other outcome","total":0,"shown_on_page":0,"no_cell_split":{"no_cell_passed_checks_in_ledger":0,"rows_refused_by_rule":0,"rows_no_cell_passed_checks":0},"rows":[]},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":[],"entries":[]},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per row: of M harvested code samples from that row's paper, n_ran executed on a synthesized fixture (n_ran = n_ran_checked + n_instrument; n_instrument counts failures of Syntology's instrument, not of the code); the other M - n_ran are unverified. Not a reproduction of the row's number; not a correctness claim. n_pointer_only_licence counts samples the site points at rather than redistributes (a licence axis, independent of ran/unverified).","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)"},"rows_with_graph_line":0,"rows_with_any_sample_ran":0,"rows_with_a_run_with_no_instrument_failure":0,"official":{"state_rule":"the archive's official repositories have samples for this paper that ran: 'official (archive's flag): N ran' (N counts them, instrument failures included); they have samples, none ran: 'official: harvested, nothing ran'; they have no sample for this paper and another sample ran: 'community repositories only' when every sample that ran came from a repository the archive lists for the paper but neither marks official nor records as mentioned in it, or one Syntology harvested outside the archive's links, else 'official: no sample here; runs from other or unrecorded repositories' (a repository named in the paper or found in its text by Syntology, or no repository recorded); otherwise 'official: harvested for another paper' or 'official: not harvested'. Absent when the archive marks no repository official. Official is the archive's is_official flag, not an authorship verdict","flag":"the archive's is_official flag for the paper's code link; not a verdict on who wrote the code","rows_with_an_archive_official_repository":0,"rows_whose_official_repository_has_a_sample_that_ran":0,"rows_whose_official_repository_has_a_run_with_no_instrument_failure":0,"rows_community_repositories_only":0,"rows_runs_from_other_or_unrecorded_repositories":0,"note":"rows[].official, per row with a graph line: repos (marked official in the archive), state, n_ran and n_unverified (samples from those repositories), and ran_from_kinds (the kinds of repository the paper's samples that ran came from; 'unlocated' is no repository recorded)"},"filters":{"ran_modes":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"the page's filters hide rows and never renumber them; they read the Ran cell's counts, the same figures rows[].syntology and rows[].official carry"},"row_route":"rows[].syntology 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","distinct_papers_with_graph_line":0,"distinct_papers_with_any_sample_ran":0,"distinct_papers_with_a_run_with_no_instrument_failure":0,"samples_over_distinct_papers":{"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":0,"n_samples":0,"n_pointer_only_licence":0,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":0,"n_samples":0,"n_pointer_only_licence":0,"note":"row-weighted: a paper behind several rows is counted once per row; inflated relative to samples_over_distinct_papers by design, kept for readers summing the per-row syntology blocks"}},"record_sha256":"251173efbc76654de9963b03b2ab66b97bce476f1386a2267190e91e1394a089","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}