{"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/convert-secs2time","entry":"convert_secs2time","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":5,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":5,"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":2,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":5,"n_places_pointer_only":0,"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":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":"2311.13613","arxiv_id_is_arxiv":true,"paper":"/paper/spanning-training-progress-temporal-dual","title":"Spanning Training Progress: Temporal Dual-Depth Scoring (TDDS) for Enhanced Dataset Pruning","date":"2023-11-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhangxin-xd/Dataset-Pruning-TDDS","path":"utils.py","file_url":"https://github.com/zhangxin-xd/Dataset-Pruning-TDDS/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"09b3d0b3ea772a30","code_sha256_prefix":"09b3d0b3ea772a30","mcp_get_code":{"code_sha256":"09b3d0b3ea772a30"}},{"arxiv_id":"2108.11939","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-and-accelerating-neural","title":"Understanding and Accelerating Neural Architecture Search with Training-Free and Theory-Grounded Metrics","date":"2021-08-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vita-group/tegnas","path":"lib/log_utils/time_utils.py","file_url":"https://github.com/vita-group/tegnas/blob/HEAD/lib/log_utils/time_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":"a7d5163e9c07e8a6","code_sha256_prefix":"a7d5163e9c07e8a6","mcp_get_code":{"code_sha256":"a7d5163e9c07e8a6"}},{"arxiv_id":"2008.05369","arxiv_id_is_arxiv":true,"paper":"/paper/anomaly-localization-by-modeling-perceptual","title":"Anomaly localization by modeling perceptual features","date":"2020-08-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiahaifeng1995/FAVAE-anomaly-detection-localization-master","path":"utils.py","file_url":"https://github.com/xiahaifeng1995/FAVAE-anomaly-detection-localization-master/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"09b3d0b3ea772a30","code_sha256_prefix":"09b3d0b3ea772a30","mcp_get_code":{"code_sha256":"09b3d0b3ea772a30"}},{"arxiv_id":"2006.07794","arxiv_id_is_arxiv":true,"paper":"/paper/patchup-a-regularization-technique-for","title":"PatchUp: A Feature-Space Block-Level Regularization Technique for Convolutional Neural Networks","date":"2020-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chandar-lab/PatchUp","path":"utility/utils.py","file_url":"https://github.com/chandar-lab/PatchUp/blob/HEAD/utility/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"09b3d0b3ea772a30","code_sha256_prefix":"09b3d0b3ea772a30","mcp_get_code":{"code_sha256":"09b3d0b3ea772a30"}},{"arxiv_id":"1811.09310","arxiv_id_is_arxiv":true,"paper":"/paper/parametric-noise-injection-trainable","title":"Parametric Noise Injection: Trainable Randomness to Improve Deep Neural Network Robustness against Adversarial Attack","date":"2018-11-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"elliothe/CVPR_2019_PNI","path":"code/utils.py","file_url":"https://github.com/elliothe/CVPR_2019_PNI/blob/HEAD/code/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"09b3d0b3ea772a30","code_sha256_prefix":"09b3d0b3ea772a30","mcp_get_code":{"code_sha256":"09b3d0b3ea772a30"}}],"record_sha256":"1e2a5c3b8b43d0801a4d9395cdbfbe8b6897a54390f4ccd1910174f9586778ab","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}