{"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-net","entry":"load_net","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":10,"n_papers_ran":3,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":0,"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":9,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":6,"n_samples_fingerprinted":0,"n_places":10,"n_places_pointer_only":1,"n_places_pointer_only_link_open":0,"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":0,"ran_fixture":0,"ran":3,"unverified":6},"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.11277","arxiv_id_is_arxiv":true,"paper":"/paper/target-conversation-extraction-source","title":"Target conversation extraction: Source separation using turn-taking dynamics","date":"2024-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chentuochao/target-conversation-extraction","path":"src/utils.py","file_url":"https://github.com/chentuochao/target-conversation-extraction/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":"f22b1d22bc27279d","code_sha256_prefix":"f22b1d22bc27279d","mcp_get_code":{"code_sha256":"f22b1d22bc27279d"}},{"arxiv_id":"2311.03415","arxiv_id_is_arxiv":true,"paper":"/paper/powerflownet-leveraging-message-passing-gnns","title":"PowerFlowNet: Power Flow Approximation Using Message Passing Graph Neural Networks","date":"2023-11-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"StavrosOrf/PoweFlowNet","path":"speedup_evaluator.py","file_url":"https://github.com/StavrosOrf/PoweFlowNet/blob/HEAD/speedup_evaluator.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":"3ea53c3f92e2f87b","code_sha256_prefix":"3ea53c3f92e2f87b","mcp_get_code":{"code_sha256":"3ea53c3f92e2f87b"}},{"arxiv_id":"2302.11813","arxiv_id_is_arxiv":true,"paper":"/paper/deep-oc-sort-multi-pedestrian-tracking-by","title":"Deep OC-SORT: Multi-Pedestrian Tracking by Adaptive Re-Identification","date":"2023-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gerardmaggiolino/deep-oc-sort","path":"trackers/motdt_tracker/reid_model.py","file_url":"https://github.com/gerardmaggiolino/deep-oc-sort/blob/HEAD/trackers/motdt_tracker/reid_model.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":"f817f88d2e7ca234","code_sha256_prefix":"f817f88d2e7ca234","mcp_get_code":{"code_sha256":"f817f88d2e7ca234"}},{"arxiv_id":"2110.06864","arxiv_id_is_arxiv":true,"paper":"/paper/bytetrack-multi-object-tracking-by-1","title":"ByteTrack: Multi-Object Tracking by Associating Every Detection Box","date":"2021-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ifzhang/ByteTrack","path":"yolox/motdt_tracker/reid_model.py","file_url":"https://github.com/ifzhang/ByteTrack/blob/HEAD/yolox/motdt_tracker/reid_model.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":"f817f88d2e7ca234","code_sha256_prefix":"f817f88d2e7ca234","mcp_get_code":{"code_sha256":"f817f88d2e7ca234"}},{"arxiv_id":"2005.06149","arxiv_id_is_arxiv":true,"paper":"/paper/deeprobust-a-pytorch-library-for-adversarial","title":"DeepRobust: A PyTorch Library for Adversarial Attacks and Defenses","date":"2020-05-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"I-am-Bot/DeepRobust","path":"deeprobust/image/evaluation_attack.py","file_url":"https://github.com/I-am-Bot/DeepRobust/blob/HEAD/deeprobust/image/evaluation_attack.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":"055d12d90bb8de9b","code_sha256_prefix":"055d12d90bb8de9b","mcp_get_code":{"code_sha256":"055d12d90bb8de9b"}},{"arxiv_id":"1906.07538","arxiv_id_is_arxiv":true,"paper":"/paper/locate-size-and-count-accurately-resolving","title":"Locate, Size and Count: Accurately Resolving People in Dense Crowds via Detection","date":"2019-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"val-iisc/lsc-cnn","path":"utils/logging_tools.py","file_url":"https://github.com/val-iisc/lsc-cnn/blob/HEAD/utils/logging_tools.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":"c0b38f026afda7d1","code_sha256_prefix":"c0b38f026afda7d1","mcp_get_code":{"code_sha256":"c0b38f026afda7d1"}},{"arxiv_id":"1905.00378","arxiv_id_is_arxiv":true,"paper":"/paper/gradient-free-activation-maximization-for","title":"Gradient-free activation maximization for identifying effective stimuli","date":"2019-05-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"willwx/XDream","path":"xdream/net_utils/net_loader.py","file_url":"https://github.com/willwx/XDream/blob/HEAD/xdream/net_utils/net_loader.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":"e98d5e11ca90b8c4","code_sha256_prefix":"e98d5e11ca90b8c4","mcp_get_code":{"code_sha256":"e98d5e11ca90b8c4"}},{"arxiv_id":"1607.01719","arxiv_id_is_arxiv":true,"paper":"/paper/deep-coral-correlation-alignment-for-deep","title":"Deep CORAL: Correlation Alignment for Deep Domain Adaptation","date":"2016-07-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"armavox/deepcoral-pchelkin","path":"models.py","file_url":"https://github.com/armavox/deepcoral-pchelkin/blob/HEAD/models.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, armavox/deepcoral-pchelkin when it was checked","code_sha256":"6d9d07aae0108daf","code_sha256_prefix":"6d9d07aae0108daf","mcp_get_code":{"code_sha256":"6d9d07aae0108daf"}},{"arxiv_id":"1602.01528","arxiv_id_is_arxiv":true,"paper":"/paper/eie-efficient-inference-engine-on-compressed","title":"EIE: Efficient Inference Engine on Compressed Deep Neural Network","date":"2016-02-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cucapra/fodlam","path":"fodlam.py","file_url":"https://github.com/cucapra/fodlam/blob/HEAD/fodlam.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":"a1c9b7bced69fd39","code_sha256_prefix":"a1c9b7bced69fd39","mcp_get_code":{"code_sha256":"a1c9b7bced69fd39"}},{"arxiv_id":"Seidenschwarz_Simple_Cues_Lead_to_a_Strong_Multi-Object_Tracker_CVPR_2023_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Seidenschwarz_Simple_Cues_Lead_to_a_Strong_Multi-Object_Tracker_CVPR_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"dvl-tum/GHOST","path":"ReID/net/load_trained_net.py","file_url":"https://github.com/dvl-tum/GHOST/blob/HEAD/ReID/net/load_trained_net.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":"e08880abd17c1bfe","code_sha256_prefix":"e08880abd17c1bfe","mcp_get_code":{"code_sha256":"e08880abd17c1bfe"}}],"record_sha256":"1b58dd927b98e3b812b2b8edb7599ca910691624c75d5e2114783c9372f2e916","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}