{"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/tet-loss","entry":"TET_loss","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":7,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":3,"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":3,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":4,"n_places_pointer_only_link_open":1,"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":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":2,"unverified":0},"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":"2407.05106","arxiv_id_is_arxiv":true,"paper":"/paper/dailydvs-200-a-comprehensive-benchmark","title":"DailyDVS-200: A Comprehensive Benchmark Dataset for Event-Based Action Recognition","date":"2024-07-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qiwang233/dailydvs-200","path":"models/SDT/criterion.py","file_url":"https://github.com/qiwang233/dailydvs-200/blob/HEAD/models/SDT/criterion.py","status":"ran","verification_level":1,"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, qiwang233/dailydvs-200 when it was checked","code_sha256":"a71accca7675fc44","code_sha256_prefix":"a71accca7675fc44","mcp_get_code":{"code_sha256":"a71accca7675fc44"}},{"arxiv_id":"2405.16466","arxiv_id_is_arxiv":true,"paper":"/paper/high-performance-temporal-reversible-spiking","title":"High-Performance Temporal Reversible Spiking Neural Networks with $O(L)$ Training Memory and $O(1)$ Inference Cost","date":"2024-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"biclab/t-revsnn","path":"loss.py","file_url":"https://github.com/biclab/t-revsnn/blob/HEAD/loss.py","status":"ran","verification_level":1,"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, biclab/t-revsnn when it was checked","code_sha256":"a71accca7675fc44","code_sha256_prefix":"a71accca7675fc44","mcp_get_code":{"code_sha256":"a71accca7675fc44"}},{"arxiv_id":"2403.09274","arxiv_id_is_arxiv":true,"paper":"/paper/eventrpg-event-data-augmentation-with","title":"EventRPG: Event Data Augmentation with Relevance Propagation Guidance","date":"2024-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"myuansun/EventRPG","path":"snn_utils/functions.py","file_url":"https://github.com/myuansun/EventRPG/blob/HEAD/snn_utils/functions.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":"127b8f6110c5249c","code_sha256_prefix":"127b8f6110c5249c","mcp_get_code":{"code_sha256":"127b8f6110c5249c"}},{"arxiv_id":"2308.06582","arxiv_id_is_arxiv":true,"paper":"/paper/gated-attention-coding-for-training-high","title":"Gated Attention Coding for Training High-performance and Efficient Spiking Neural Networks","date":"2023-08-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bollossom/GAC","path":"CODE/ImageNet/functions.py","file_url":"https://github.com/bollossom/GAC/blob/HEAD/CODE/ImageNet/functions.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, bollossom/GAC when it was checked","code_sha256":"e63c09a8d741cb95","code_sha256_prefix":"e63c09a8d741cb95","mcp_get_code":{"code_sha256":"e63c09a8d741cb95"}},{"arxiv_id":"2307.01694","arxiv_id_is_arxiv":true,"paper":"/paper/spike-driven-transformer-1","title":"Spike-driven Transformer","date":"2023-07-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"biclab/spike-driven-transformer","path":"criterion.py","file_url":"https://github.com/biclab/spike-driven-transformer/blob/HEAD/criterion.py","status":"ran","verification_level":1,"contract_check":null,"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 qiwang233/dailydvs-200, and GitHub detected no licence in that repository when it was checked","code_sha256":"a71accca7675fc44","code_sha256_prefix":"a71accca7675fc44","mcp_get_code":{"code_sha256":"a71accca7675fc44"}},{"arxiv_id":"2304.13098","arxiv_id_is_arxiv":true,"paper":"/paper/uncovering-the-representation-of-spiking","title":"Uncovering the Representation of Spiking Neural Networks Trained with Surrogate Gradient","date":"2023-04-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"intelligent-computing-lab-yale/snncka","path":"functions.py","file_url":"https://github.com/intelligent-computing-lab-yale/snncka/blob/HEAD/functions.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e63c09a8d741cb95","code_sha256_prefix":"e63c09a8d741cb95","mcp_get_code":{"code_sha256":"e63c09a8d741cb95"}},{"arxiv_id":"2202.11946","arxiv_id_is_arxiv":true,"paper":"/paper/temporal-efficient-training-of-spiking-neural-1","title":"Temporal Efficient Training of Spiking Neural Network via Gradient Re-weighting","date":"2022-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gus-lab/temporal_efficient_training","path":"functions.py","file_url":"https://github.com/gus-lab/temporal_efficient_training/blob/HEAD/functions.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e63c09a8d741cb95","code_sha256_prefix":"e63c09a8d741cb95","mcp_get_code":{"code_sha256":"e63c09a8d741cb95"}}],"record_sha256":"5816b47bde6b12917db4d0c724d03eede70c1ae4fc1e36edcf37d838ddad3d8e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}