{"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":"/paper/learning-to-remember-patterns-pattern-1","title":"Learning to Remember Patterns: Pattern Matching Memory Networks for Traffic Forecasting","arxiv_id":"2110.10380","date":"2021-10-20","proceeding":"ICLR 2022 4","authors":["Hyunwook Lee","Seungmin Jin","Hyeshin Chu","Hongkyu Lim","Sungahn Ko"],"abstract":"Traffic forecasting is a challenging problem due to complex road networks and sudden speed changes caused by various events on roads. A number of models have been proposed to solve this challenging problem with a focus on learning spatio-temporal dependencies of roads. In this work, we propose a new perspective of converting the forecasting problem into a pattern matching task, assuming that large data can be represented by a set of patterns. To evaluate the validness of the new perspective, we design a novel traffic forecasting model, called Pattern-Matching Memory Networks (PM-MemNet), which learns to match input data to the representative patterns with a key-value memory structure. We first extract and cluster representative traffic patterns, which serve as keys in the memory. Then via matching the extracted keys and inputs, PM-MemNet acquires necessary information of existing traffic patterns from the memory and uses it for forecasting. To model spatio-temporal correlation of traffic, we proposed novel memory architecture GCMem, which integrates attention and graph convolution for memory enhancement. The experiment results indicate that PM-MemNet is more accurate than state-of-the-art models, such as Graph WaveNet with higher responsiveness. We also present a qualitative analysis result, describing how PM-MemNet works and achieves its higher accuracy when road speed rapidly changes.","url_abs":"https://arxiv.org/abs/2110.10380v2","url_pdf":"https://arxiv.org/pdf/2110.10380v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"learning-to-remember-patterns-pattern-1","repo_url":"https://github.com/hyunwookl/pm-memnet","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"traffic-prediction","task_name":"Traffic Prediction"}],"methods":[{"method_slug":"convolution","method_name":"Convolution"},{"method_slug":"dilated-causal-convolution","method_name":"Dilated Causal Convolution"},{"method_slug":"mixture-of-logistic-distributions","method_name":"Mixture of Logistic Distributions"},{"method_slug":"speed","method_name":"SPEED"},{"method_slug":"wavenet","method_name":"WaveNet"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/traffic-prediction-on-expy-tky-1","task":"Traffic Prediction","dataset":"EXPY-TKY","model":"PM-MemNet","rank_in_archive_order":5,"of":8,"metrics":{"1 step MAE":"5.94","3 step MAE":"6.52","6 step MAE":"6.87"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2110.10380","atlas_url":"https://app.syntology.ai/?focus=2110.10380","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.10380"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2110.10380"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2110.10380"},"call":"get_harvested_code_for_paper(arxiv_id=\"2110.10380\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2110.10380"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2110.10380\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2110.10380"},"call":"get_concepts_for_paper(arxiv_id=\"2110.10380\")"}],"by_repo":[{"repo":"hyunwookl/pm-memnet","kind":"official","samples":9,"ran":7,"instrument":4,"unverified":2}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code","assemblies":[{"assembly_sha256":"5c966be02191877e","source_kind":"harvested","method_name":"Pattern-Matching Memory Networks (PM-MemNet)","realizes_method":"Pattern-Matching Memory Networks (PM-MemNet)","graph_method":"Pattern-Matching Memory Networks (PM-MemNet)","realizes_severed":false,"claim":"The paper claims this code implements Pattern-Matching Memory Networks (PM-MemNet), a novel model for traffic forecasting that uses pattern matching to capture spatio-temporal dependencies.","centrality":"contribution","entry":"PMMemNet","entry_sha256":"bdc5b4d4d49862c9","n_bricks":6,"bricks":[{"entry":"PMMemNet","code_sha256":"bdc5b4d4d49862c9","role":"entry","order":0,"level":0,"status":"unverified"},{"entry":"Decoder","code_sha256":"7a49d4abe5662ef3","role":"model","order":1,"level":1,"status":"ran"},{"entry":"Encoder","code_sha256":"6e6df2f3f56776c5","role":"model","order":2,"level":1,"status":"ran"},{"entry":"fourier","code_sha256":"75b069b2a552c0b6","role":"helper","order":3,"level":1,"status":"ran_draft_wrong"},{"entry":"get_nearest_key","code_sha256":"5f4e9bd8c7711392","role":"helper","order":4,"level":1,"status":"ran_fixture"},{"entry":"gconv","code_sha256":"a2aea6636f88e641","role":"model","order":5,"level":0,"status":"unverified"}],"ran_individually":4,"ran_individually_constructed":2,"ran_individually_by_status":{"ran":2,"ran_draft_wrong":1,"ran_fixture":1},"end_to_end":{"ran":false,"level":0},"level_lowered":null,"claim_match":"IMPLEMENTS","claim_match_rule":"single_judge","claim_match_basis":"judge:global.anthropic.claude-sonnet-4-5-20250929-v1:0","claim_match_judges":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"label_verdict":"matches","label_verdict_judged":true,"suggested_method":null,"batch_at":"2026-09-09T22:44:46+00:00","sibling_group":"3f7e902a943c","n_siblings":0,"retention":"keep","provenance":"assembly:harvest_method_v6","attached_at":"2026-09-09T22:44:46+00:00","attached_provenance":"assembly:harvest_method_v6"}],"assembly_sibling_groups":[{"group":"3f7e902a943c","realizes_method":"Pattern-Matching Memory Networks (PM-MemNet)","source_kind":"harvested","batch_at":"2026-09-09T22:44:46+00:00","members":["5c966be02191877e"]}],"assemblies_is":{"about":"What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results.","harvested":"assembled from code harvested from a repository linked to the paper","generated":"generated from the paper text, not the repository's code","end_to_end":"for a harvested assembly, the assembly has not been run end-to-end; for a generated one, end_to_end.level is the assembly's own level and against_independent_peer says whether it ran against a peer: an independent peer is a second implementation generated separately from the same paper text; neither implementation read the authors' code. At level 2 the two agreed numerically on the fixture's inputs; level 3 is recorded when property tests derived from the paper also passed on both, and each level 3 card prints how many its report lists","bricks_level":"each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level","ran_individually":"a COUNT of bricks that ran on their own on a fixture (split by status in ran_individually_by_status), not a level; instrument statuses are failures of Syntology's instrument, not of the code","siblings":"assemblies lifted from this paper in the same batch for the same method: alternative readings kept side by side; none replaces or supersedes another","judged":"Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it. A generated assembly's label was set when its code was generated for the method, and no model judged it; its card prints it as \"by construction\" or \"not judged by a model\"","level_lowered":"a generated assembly whose level Syntology's graph lowered, with the level it had, the recorded reason and when","retention":"Syntology's spending triage for further verification, not a verdict","claim_match":"the claim_match vote: IMPLEMENTS, COMPONENT or UNCLEAR. Where claim_match_basis is \"judge:<model>\", it is one model's judgement of the assembly's label against the paper's claim (claim_match_rule single_judge, the model in claim_match_judges): not a verification and not a run. Where it is \"construction\", the value was set when the code was generated for this method and no model judged it, whatever claim_match_rule says. The page prints no claim match for any assembly","label_verdict":"whether the assembly's code is the method it is labelled with: matches, cannot_tell, mislabelled (suggested_method names what it looks like instead) or not_the_method; label_verdict_judged is true only when a model read the code (claim_match_basis \"judge:<model>\")","label_verdict_judged":"where true (claim_match_basis \"judge:<model>\"), label_verdict is a single model's judgement; not calibrated; not printed on the page; where false, it was set by construction, and the page prints it unless the node is shared with another paper (node_properties_written_for)","claim":"the claim text stored on the assembly node: for a harvested assembly, what the paper claims the code implements, as the lifting model wrote it; for a generated one, the specification the code was generated from. Not verified text","centrality":"how central the lifted method is to the paper, as the lifting step recorded it: contribution, component or incidental","v3_tests_passed_both_sides":"end_to_end.v3_tests_passed_both_sides: the number of property tests derived from the paper that passed on both implementations, as the attached report lists them; a level 3 card with 0 says its report lists none","ran_individually_constructed":"ran_individually_constructed: of the bricks counted in ran_individually, how many constructed an object rather than computing a result (Syntology's RAN record's rule, read from the graph-layer sample with the brick's code_sha256); a part of ran_individually, never subtracted from it and never a failure; null where a brick that ran has no sample in the graph layer this build read, so the figure was not counted"},"assemblies_call":{"tool":"assembly","arguments":{"arxiv_id":"2110.10380"},"call":"assembly(arxiv_id=\"2110.10380\")"},"read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/2110.10380.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/2110.10380.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/hyunwookl/pm-memnet","reach":null}],"summary":{"ran_honours":2,"ran":2,"ran_draft_wrong":2,"ran_fixture":2,"unverified":2},"n_samples":10,"n_ran":8,"n_constructed":2,"n_ran_checked":4,"n_instrument":4,"n_unverified":2,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"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)"},"by_repo_kind":{"official":{"samples":9,"ran":7,"n_ran_checked":3,"n_instrument":4,"repositories":1},"unlocated":{"samples":1,"ran":1,"n_ran_checked":1,"n_instrument":0,"repositories":0,"is":"identical to code Syntology harvested from another paper's repository; this paper's own copy was not located, so no repository is named and no licence is recorded"}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":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_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":2,"n_ran_without_level_date":6,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-22","last":"2026-09-22","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"506a63e8992f7432","code_sha256_prefix":"506a63e8992f7432","entry":"count_parameters","repo":"HyunWookL/PM-MemNet","repo_kind":"official","path":"model/PMMemNet.py","file_url":"https://github.com/HyunWookL/PM-MemNet/blob/HEAD/model/PMMemNet.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":2,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"signature":"model:callable/0/?","fixture_out_type":"int","code_page":"/code/count-parameters","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"506a63e8992f7432"}},{"code_sha256":"7a49d4abe5662ef3","code_sha256_prefix":"7a49d4abe5662ef3","entry":"Decoder","repo":"hyunwookl/pm-memnet","repo_kind":"official","path":"model/PMMemNet.py","file_url":"https://github.com/hyunwookl/pm-memnet/blob/HEAD/model/PMMemNet.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"fixture_out_type":"Decoder","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":"/code/decoder","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"7a49d4abe5662ef3"}},{"code_sha256":"6e6df2f3f56776c5","code_sha256_prefix":"6e6df2f3f56776c5","entry":"Encoder","repo":"hyunwookl/pm-memnet","repo_kind":"official","path":"model/PMMemNet.py","file_url":"https://github.com/hyunwookl/pm-memnet/blob/HEAD/model/PMMemNet.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"fixture_out_type":"Encoder","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":"/code/encoder","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"6e6df2f3f56776c5"}},{"code_sha256":"f6b944f50d3f15ae","code_sha256_prefix":"f6b944f50d3f15ae","entry":"count_parameters","repo":null,"repo_kind":null,"path":null,"file_url":null,"link_basis":"identical_code_first_harvested_elsewhere","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"signature":"model:callable/0/?","fixture_out_type":"int","code_page":"/code/count-parameters","census":null,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","mcp_get_code":{"code_sha256":"f6b944f50d3f15ae"}},{"code_sha256":"8014c8277fdd9f56","code_sha256_prefix":"8014c8277fdd9f56","entry":"fourier","repo":"HyunWookL/PM-MemNet","repo_kind":"official","path":"model/PMMemNet.py","file_url":"https://github.com/HyunWookL/PM-MemNet/blob/HEAD/model/PMMemNet.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"signature":"query:Tensor/3/float","fixture_out_type":"Tensor","retrieve_with":{"tool":"get_code","code_sha256":"8014c8277fdd9f56"},"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"8014c8277fdd9f56"}},{"code_sha256":"75b069b2a552c0b6","code_sha256_prefix":"75b069b2a552c0b6","entry":"fourier","repo":"hyunwookl/pm-memnet","repo_kind":"official","path":"model/PMMemNet.py","file_url":"https://github.com/hyunwookl/pm-memnet/blob/HEAD/model/PMMemNet.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"signature":"query:Tensor/3/float","fixture_out_type":"Tensor","retrieve_with":{"tool":"get_code","code_sha256":"75b069b2a552c0b6"},"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"75b069b2a552c0b6"}},{"code_sha256":"da1777082c154632","code_sha256_prefix":"da1777082c154632","entry":"get_nearest_key","repo":"HyunWookL/PM-MemNet","repo_kind":"official","path":"model/PMMemNet.py","file_url":"https://github.com/HyunWookL/PM-MemNet/blob/HEAD/model/PMMemNet.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"signature":"query:Tensor/3/float, key_dict:Tensor/2/float, k:int/0/int, sim:str/0/str","fixture_out_type":"tuple","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"da1777082c154632"}},{"code_sha256":"5f4e9bd8c7711392","code_sha256_prefix":"5f4e9bd8c7711392","entry":"get_nearest_key","repo":"hyunwookl/pm-memnet","repo_kind":"official","path":"model/PMMemNet.py","file_url":"https://github.com/hyunwookl/pm-memnet/blob/HEAD/model/PMMemNet.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"signature":"query:Tensor/3/float, key_dict:Tensor/2/float, k:int/0/int, sim:str/0/str","fixture_out_type":"tuple","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"5f4e9bd8c7711392"}},{"code_sha256":"bdc5b4d4d49862c9","code_sha256_prefix":"bdc5b4d4d49862c9","entry":"PMMemNet","repo":"hyunwookl/pm-memnet","repo_kind":"official","path":"model/PMMemNet.py","file_url":"https://github.com/hyunwookl/pm-memnet/blob/HEAD/model/PMMemNet.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"bdc5b4d4d49862c9"}},{"code_sha256":"a2aea6636f88e641","code_sha256_prefix":"a2aea6636f88e641","entry":"gconv","repo":"hyunwookl/pm-memnet","repo_kind":"official","path":"model/PMMemNet.py","file_url":"https://github.com/hyunwookl/pm-memnet/blob/HEAD/model/PMMemNet.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"a2aea6636f88e641"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"545b3c36c2368c23b3daeb4f5d0a5d178a133655d3fd70fa217183829dabd87b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}