{"as_of":"2026-08-19T10:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e71bc9cb2fbcafafcb71da9a43fc164fa469072642d05080602c4068b38324a7","coverage":[{"denominator":37,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":37,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T15:33:45.358573Z","state":"measured"},{"denominator":37,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":37,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.22869/citation-record","integrity":"/paper/2607.22869/integrity","json":"/paper/2607.22869/citation-record.json","paper":"/paper/2607.22869"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:33:46.720967Z","title":"In: International Conference on Computers and Games, pp","venue":null,"work_id":"ef7d10ea-01ac-4957-9958-399ade4b9f88","year":2006},"citing_paper":{"arxiv_id":"2607.22869","last_updated":"2026-07-24T19:17:37Z","snapshot_observed_at":"2026-08-15T15:26:02.701139Z","submitted_at":"2026-07-24T19:17:37Z","title":"Multi-primitive in-memory computing for Monte Carlo tree search","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T15:33:45.174017Z"},"links":{"citing_paper":"/paper/2607.22869"},"observation_digest":"sha256:f91beab31484d6babeeb148e51224cc5d3b65a06b6a7b0dfa67457f639611a93","observation_id":"168dcf66-694b-46a1-8760-e6d85376c764","resolution":{"observed_at":"2026-08-15T15:33:46.726456Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:33:46.702777Z","title":"In: Euro- pean Conference on Machine Learning (ECML), pp","venue":null,"work_id":"83bec690-7544-404b-8ee9-7dd455369db6","year":2006},"citing_paper":{"arxiv_id":"2607.22869","last_updated":"2026-07-24T19:17:37Z","snapshot_observed_at":"2026-08-15T15:26:02.701139Z","submitted_at":"2026-07-24T19:17:37Z","title":"Multi-primitive in-memory computing for Monte Carlo tree search","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T15:33:45.179682Z"},"links":{"citing_paper":"/paper/2607.22869"},"observation_digest":"sha256:feb788d5dd66fb6ee2bf13be889ef5478a73058049426bb4d12370539f0faf37","observation_id":"4674d215-8d6b-423f-9910-d44c7911dfbc","resolution":{"observed_at":"2026-08-15T15:33:46.708545Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-319-50935-8_17","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-17T11:03:46.409680Z","title":"In: Computers and Games (CG 2016)","venue":"Lecture notes in computer science","work_id":"bc24833b-020f-4c8b-9772-7f1a305e3a80","year":2016},"citing_paper":{"arxiv_id":"2607.22869","last_updated":"2026-07-24T19:17:37Z","snapshot_observed_at":"2026-08-15T15:26:02.701139Z","submitted_at":"2026-07-24T19:17:37Z","title":"Multi-primitive in-memory computing for Monte Carlo tree search","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T15:33:45.184774Z"},"links":{"citing_paper":"/paper/2607.22869"},"observation_digest":"sha256:9bfdb7555033bfc3b8cc30104ce26cab3b9cf328019eca80bfc10b36dd567c80","observation_id":"f76a1bef-7aee-47ee-8937-62ace18ea452","resolution":{"observed_at":"2026-08-15T15:33:45.500116Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:33:45.190181Z","title":"Nature529(7587), 484–489 (2016) https://doi.org/10.1038/nature16961","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.22869","last_updated":"2026-07-24T19:17:37Z","snapshot_observed_at":"2026-08-15T15:26:02.701139Z","submitted_at":"2026-07-24T19:17:37Z","title":"Multi-primitive in-memory computing for Monte Carlo tree search","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T15:33:45.190181Z"},"links":{"citing_paper":"/paper/2607.22869"},"observation_digest":"sha256:14789613f1465dbfce4a6a88fd6b2650433ac003d716390c7198cf663aee6727","observation_id":"dec1aea6-8407-45f5-be1f-f9bfac8dbfb9","resolution":{"observed_at":"2026-08-15T15:33:45.190181Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:33:45.195621Z","title":"Science362(6419), 1140–1144 (2018) https: //doi.org/10.1126/science.aar6404","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.22869","last_updated":"2026-07-24T19:17:37Z","snapshot_observed_at":"2026-08-15T15:26:02.701139Z","submitted_at":"2026-07-24T19:17:37Z","title":"Multi-primitive in-memory computing for Monte Carlo tree search","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T15:33:45.195621Z"},"links":{"citing_paper":"/paper/2607.22869"},"observation_digest":"sha256:34d882b2dea0d21d6d8d8cec9d650e35bc1551c0d898a9120be6e92f143a0be7","observation_id":"20d9b1ee-3b52-4075-a901-89e46ea31939","resolution":{"observed_at":"2026-08-15T15:33:45.195621Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:33:46.685035Z","title":"Integration58, 74–81 (2017)","venue":null,"work_id":"e09f8237-264e-47f5-85b0-ec356b7763a3","year":2017},"citing_paper":{"arxiv_id":"2607.22869","last_updated":"2026-07-24T19:17:37Z","snapshot_observed_at":"2026-08-15T15:26:02.701139Z","submitted_at":"2026-07-24T19:17:37Z","title":"Multi-primitive in-memory computing for Monte Carlo tree search","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T15:33:45.200902Z"},"links":{"citing_paper":"/paper/2607.22869"},"observation_digest":"sha256:08ccae1f2d57cdae3fd27d7e5da60f27639c9a26f771503e00c9682d445a67a4","observation_id":"64557c08-682d-4e60-b799-edf7a6afa265","resolution":{"observed_at":"2026-08-15T15:33:46.690471Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:33:46.666961Z","title":"Technical Report HPL-2009-85, HP Labs (2009)","venue":null,"work_id":"365f860a-32e4-4666-b2f4-3cd2af1431b3","year":2009},"citing_paper":{"arxiv_id":"2607.22869","last_updated":"2026-07-24T19:17:37Z","snapshot_observed_at":"2026-08-15T15:26:02.701139Z","submitted_at":"2026-07-24T19:17:37Z","title":"Multi-primitive in-memory computing for Monte Carlo tree search","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T15:33:45.207029Z"},"links":{"citing_paper":"/paper/2607.22869"},"observation_digest":"sha256:00fb5c21af96b515a8641d665ba19a1f3f0e760d7f49f92364c51a787e486442","observation_id":"48ed7498-a999-4217-b3e5-1fa43dcc723a","resolution":{"observed_at":"2026-08-15T15:33:46.672566Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:33:46.647853Z","title":"IEEE Journal of Solid-State Circuits 41(3), 712–727 (2006)","venue":null,"work_id":"a2d34357-ec7a-4c3e-afdf-6fe6be664860","year":2006},"citing_paper":{"arxiv_id":"2607.22869","last_updated":"2026-07-24T19:17:37Z","snapshot_observed_at":"2026-08-15T15:26:02.701139Z","submitted_at":"2026-07-24T19:17:37Z","title":"Multi-primitive in-memory computing for Monte Carlo tree search","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T15:33:45.212755Z"},"links":{"citing_paper":"/paper/2607.22869"},"observation_digest":"sha256:1f0573e205c97beb7661c1426dc383a8a12b918fe1247b5827119050c3023f89","observation_id":"e102ae82-2d40-4f74-8a80-579f46ce6bb6","resolution":{"observed_at":"2026-08-15T15:33:46.654141Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2012.62424","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:33:46.370302Z","title":"In: 2012 Symposium on VLSI Technology (VLSIT), pp","venue":null,"work_id":"5c132481-ef12-4845-b1b0-bc2a334080bc","year":2012},"citing_paper":{"arxiv_id":"2607.22869","last_updated":"2026-07-24T19:17:37Z","snapshot_observed_at":"2026-08-15T15:26:02.701139Z","submitted_at":"2026-07-24T19:17:37Z","title":"Multi-primitive in-memory computing for Monte Carlo tree search","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T15:33:45.218921Z"},"links":{"citing_paper":"/paper/2607.22869"},"observation_digest":"sha256:64901a717abe9f70d586b9cbd62985cc22df6929b06d3272bd7a1c1409779e82","observation_id":"4f1ab897-ce01-4cb7-94a5-43ec8ee2bf49","resolution":{"observed_at":"2026-08-15T15:33:46.379005Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:33:45.224864Z","title":"IEEE Journal of Solid-State Circuits51(4), 1009–1021 (2016) https://doi.org/ 10.1109/JSSC.2016.2515510 27","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.22869","last_updated":"2026-07-24T19:17:37Z","snapshot_observed_at":"2026-08-15T15:26:02.701139Z","submitted_at":"2026-07-24T19:17:37Z","title":"Multi-primitive in-memory computing for Monte Carlo tree search","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T15:33:45.224864Z"},"links":{"citing_paper":"/paper/2607.22869"},"observation_digest":"sha256:84997facbc3dc6544ff8c47e44cbdab5eacb8524f8a9d9407dc90a4e923eff9c","observation_id":"49ac8a07-875b-4588-86b7-2d971050e706","resolution":{"observed_at":"2026-08-15T15:33:45.224864Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:33:46.629141Z","title":"SIGMETRICS Performance Evaluation Review38(4), 37–42 (2011)","venue":null,"work_id":"f23af2a8-679e-4cf0-ac4e-05bdf6c1619f","year":2011},"citing_paper":{"arxiv_id":"2607.22869","last_updated":"2026-07-24T19:17:37Z","snapshot_observed_at":"2026-08-15T15:26:02.701139Z","submitted_at":"2026-07-24T19:17:37Z","title":"Multi-primitive in-memory computing for Monte Carlo tree search","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T15:33:45.230003Z"},"links":{"citing_paper":"/paper/2607.22869"},"observation_digest":"sha256:429755c608684b44b0ca4f2c4087c207711b0c316f24f8c920178dbb01e0d45e","observation_id":"2a5203f7-bb24-4627-91bd-59a1adaec25c","resolution":{"observed_at":"2026-08-15T15:33:46.635322Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:33:46.611004Z","title":"Advanced Materials30(9), 1705914 (2018)","venue":null,"work_id":"86ef044d-8bd2-4a4b-90b5-f9f678d9a132","year":2018},"citing_paper":{"arxiv_id":"2607.22869","last_updated":"2026-07-24T19:17:37Z","snapshot_observed_at":"2026-08-15T15:26:02.701139Z","submitted_at":"2026-07-24T19:17:37Z","title":"Multi-primitive in-memory computing for Monte Carlo tree search","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T15:33:45.235312Z"},"links":{"citing_paper":"/paper/2607.22869"},"observation_digest":"sha256:64bcdaff0d678e66194fc7647e1617a6ceddc9112c09ce8ef6890029b814607c","observation_id":"303dd921-c32d-443f-b0b6-f9a025cc13bb","resolution":{"observed_at":"2026-08-15T15:33:46.616687Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:33:46.592740Z","title":"Advanced Electronic Materials5(9), 1800876 (2019)","venue":null,"work_id":"c56f8cf8-f374-4d5b-b3b6-bac83d68506e","year":2019},"citing_paper":{"arxiv_id":"2607.22869","last_updated":"2026-07-24T19:17:37Z","snapshot_observed_at":"2026-08-15T15:26:02.701139Z","submitted_at":"2026-07-24T19:17:37Z","title":"Multi-primitive in-memory computing for Monte Carlo tree search","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T15:33:45.240586Z"},"links":{"citing_paper":"/paper/2607.22869"},"observation_digest":"sha256:6e37f8c7ba07b929a757eb9c03ef339b62ba476ec9bf1e9f0b8e5e45b7b6634a","observation_id":"1bde002d-24f3-46c3-8fda-e095db5efdff","resolution":{"observed_at":"2026-08-15T15:33:46.598849Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:33:45.246104Z","title":"In: 2020 IEEE International Memory Work- shop (IMW), pp","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.22869","last_updated":"2026-07-24T19:17:37Z","snapshot_observed_at":"2026-08-15T15:26:02.701139Z","submitted_at":"2026-07-24T19:17:37Z","title":"Multi-primitive in-memory computing for Monte Carlo tree search","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T15:33:45.246104Z"},"links":{"citing_paper":"/paper/2607.22869"},"observation_digest":"sha256:718f9710873e033fed539acd54ef03111ab214fe298de820727e7498ff37b111","observation_id":"165505f5-2c7b-4809-94bf-048576182067","resolution":{"observed_at":"2026-08-15T15:33:45.246104Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:33:45.251161Z","title":"Nature 608, 504–512 (2022) https://doi.org/10.1038/s41586-022-04992-8","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.22869","last_updated":"2026-07-24T19:17:37Z","snapshot_observed_at":"2026-08-15T15:26:02.701139Z","submitted_at":"2026-07-24T19:17:37Z","title":"Multi-primitive in-memory computing for Monte Carlo tree search","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T15:33:45.251161Z"},"links":{"citing_paper":"/paper/2607.22869"},"observation_digest":"sha256:6edef27847f33b5816f21a7b1571269729555fae0f260bdd60724ff379594f53","observation_id":"ca785fc3-33c5-4f96-aabe-57d143d79323","resolution":{"observed_at":"2026-08-15T15:33:45.251161Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:33:45.257595Z","title":"ACM Transactions on Modeling and Performance Evaluation of Computing Systems3(2), 9 (2018) https://doi.org/10.1145/3177754","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.22869","last_updated":"2026-07-24T19:17:37Z","snapshot_observed_at":"2026-08-15T15:26:02.701139Z","submitted_at":"2026-07-24T19:17:37Z","title":"Multi-primitive in-memory computing for Monte Carlo tree search","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T15:33:45.257595Z"},"links":{"citing_paper":"/paper/2607.22869"},"observation_digest":"sha256:ca3f3ed88ac19149ffb9c6aefc8781f3d4f5b4879a7953d6ec4bf464f4422c3d","observation_id":"4aac7ad9-d4ca-4eb1-84cc-02335629b00a","resolution":{"observed_at":"2026-08-15T15:33:45.257595Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2025.10213","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:33:46.148762Z","title":"SoftwareX30, 102139 (2025) https: //doi.org/10.1016/j.softx.2025.102139","venue":null,"work_id":"ab80e733-5389-41c8-a3b5-654b9dccc54b","year":2025},"citing_paper":{"arxiv_id":"2607.22869","last_updated":"2026-07-24T19:17:37Z","snapshot_observed_at":"2026-08-15T15:26:02.701139Z","submitted_at":"2026-07-24T19:17:37Z","title":"Multi-primitive in-memory computing for Monte Carlo tree search","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T15:33:45.262691Z"},"links":{"citing_paper":"/paper/2607.22869"},"observation_digest":"sha256:01cf333dc7e2557b0ac88d977089eb1a7bd30157344ab4ad4cc7461ee1f0edc1","observation_id":"64b42e33-3467-4de4-b642-081a890a1611","resolution":{"observed_at":"2026-08-15T15:33:46.157104Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:33:45.267558Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.22869","last_updated":"2026-07-24T19:17:37Z","snapshot_observed_at":"2026-08-15T15:26:02.701139Z","submitted_at":"2026-07-24T19:17:37Z","title":"Multi-primitive in-memory computing for Monte Carlo tree search","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T15:33:45.267558Z"},"links":{"citing_paper":"/paper/2607.22869"},"observation_digest":"sha256:39a5cdac85c228c87aa56babe6b611848b3742a2056931d5bcf2ad4902d9346b","observation_id":"60318b33-6315-4bad-b88a-d7d64251f35b","resolution":{"observed_at":"2026-08-15T15:33:45.267558Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/jssc.2016","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:33:45.429509Z","title":"IEEE Journal of Solid-State Circuits52(1), 127–138 (2017) https://doi.org/10.1109/JSSC.2016","venue":null,"work_id":"61d2d7cb-8b47-439a-8cdb-362490f58bfc","year":2017},"citing_paper":{"arxiv_id":"2607.22869","last_updated":"2026-07-24T19:17:37Z","snapshot_observed_at":"2026-08-15T15:26:02.701139Z","submitted_at":"2026-07-24T19:17:37Z","title":"Multi-primitive in-memory computing for Monte Carlo tree search","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T15:33:45.272806Z"},"links":{"citing_paper":"/paper/2607.22869"},"observation_digest":"sha256:9e7d3c238faccd6f6cbe944ea8a6e85d10c810596153dcec8a9c730e96970dae","observation_id":"41aaeded-2875-4f26-8fcb-d133facdb4e5","resolution":{"observed_at":"2026-08-15T15:33:45.435678Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:33:45.278458Z","title":"ACM SIGARCH Computer Architecture News45(2), 1–12 (2017) https://doi.org/10.1145/3140659.3080246","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.22869","last_updated":"2026-07-24T19:17:37Z","snapshot_observed_at":"2026-08-15T15:26:02.701139Z","submitted_at":"2026-07-24T19:17:37Z","title":"Multi-primitive in-memory computing for Monte Carlo tree search","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T15:33:45.278458Z"},"links":{"citing_paper":"/paper/2607.22869"},"observation_digest":"sha256:21dadd8a8e7e2537c07d8266f1b51c286bcc5c498a8de0f1a9c060511827b9f7","observation_id":"0ea1f03c-ae0d-400d-b1ab-0f7fe529131c","resolution":{"observed_at":"2026-08-15T15:33:45.278458Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/tcsi.2025","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:33:45.411750Z","title":"IEEE Transactions on Cir- cuits and Systems I: Regular Papers (2025) https://doi.org/10.1109/TCSI.2025","venue":null,"work_id":"1c07c171-a4b3-44dc-b418-e7d1afda33f4","year":2025},"citing_paper":{"arxiv_id":"2607.22869","last_updated":"2026-07-24T19:17:37Z","snapshot_observed_at":"2026-08-15T15:26:02.701139Z","submitted_at":"2026-07-24T19:17:37Z","title":"Multi-primitive in-memory computing for Monte Carlo tree search","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T15:33:45.283331Z"},"links":{"citing_paper":"/paper/2607.22869"},"observation_digest":"sha256:1783d29f4736cb0bb8dace7e7e102a9ca73f0d308a3e7fb8756d4d22915ba4d8","observation_id":"33eaed62-3e26-42a2-b4ec-53667f87a4de","resolution":{"observed_at":"2026-08-15T15:33:45.417322Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:33:45.288770Z","title":"In: Proceedings of the 2023 ACM/SIGDA International Symposium on Field Programmable Gate Arrays (FPGA), pp","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.22869","last_updated":"2026-07-24T19:17:37Z","snapshot_observed_at":"2026-08-15T15:26:02.701139Z","submitted_at":"2026-07-24T19:17:37Z","title":"Multi-primitive in-memory computing for Monte Carlo tree search","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T15:33:45.288770Z"},"links":{"citing_paper":"/paper/2607.22869"},"observation_digest":"sha256:36777aee0427b014076431a42ac8a2230eb01ba53a9fa7f8a5ba88555e7bd8c0","observation_id":"9e0e8848-7b75-48c4-a1d2-f3b7db8d0e1f","resolution":{"observed_at":"2026-08-15T15:33:45.288770Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:33:46.575003Z","title":"In: 2022 32nd International Confer- ence on Field-Programmable Logic and Applications (FPL), pp","venue":null,"work_id":"626fbb26-7070-46ff-98cd-44a2dc968e0f","year":2022},"citing_paper":{"arxiv_id":"2607.22869","last_updated":"2026-07-24T19:17:37Z","snapshot_observed_at":"2026-08-15T15:26:02.701139Z","submitted_at":"2026-07-24T19:17:37Z","title":"Multi-primitive in-memory computing for Monte Carlo tree search","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T15:33:45.293276Z"},"links":{"citing_paper":"/paper/2607.22869"},"observation_digest":"sha256:1e3427e03e3e431d7804778256c2387e2cb977d1d30ba8477b026fc45863c0d2","observation_id":"f9995f85-5f1d-4265-ac50-61a55e4f877b","resolution":{"observed_at":"2026-08-15T15:33:46.580726Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:33:46.554797Z","title":"Master’s thesis, Instituto Superior Técnico, Universidade de Lisboa, Lisboa, Portugal (2019)","venue":null,"work_id":"c689444a-18f5-4b78-b1d6-7355ccc11d96","year":2019},"citing_paper":{"arxiv_id":"2607.22869","last_updated":"2026-07-24T19:17:37Z","snapshot_observed_at":"2026-08-15T15:26:02.701139Z","submitted_at":"2026-07-24T19:17:37Z","title":"Multi-primitive in-memory computing for Monte Carlo tree search","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T15:33:45.297494Z"},"links":{"citing_paper":"/paper/2607.22869"},"observation_digest":"sha256:917c3b23028a69c03a0172f84676186a2e070ca830802bce95947eabea1f5215","observation_id":"02da3b83-08ae-4789-82ee-1326e87f6c14","resolution":{"observed_at":"2026-08-15T15:33:46.561312Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:33:46.534369Z","title":"In: 2014 International Conference on Field- Programmable Technology (FPT), pp","venue":null,"work_id":"80447481-3382-4b9e-914a-cf51096a475c","year":2014},"citing_paper":{"arxiv_id":"2607.22869","last_updated":"2026-07-24T19:17:37Z","snapshot_observed_at":"2026-08-15T15:26:02.701139Z","submitted_at":"2026-07-24T19:17:37Z","title":"Multi-primitive in-memory computing for Monte Carlo tree search","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T15:33:45.301918Z"},"links":{"citing_paper":"/paper/2607.22869"},"observation_digest":"sha256:89c9886f3640a52a8d46d25efdf0ce656d23e7d8eef5b35798c25d0fab1dc474","observation_id":"95c0b315-f02d-44b0-a40f-ede54d722af8","resolution":{"observed_at":"2026-08-15T15:33:46.541129Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-031-44505-7_13","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-17T11:03:46.409680Z","title":"In: International Con- ference on Learning and Intelligent Optimization (LION)","venue":"Lecture notes in computer science","work_id":"4b018cc6-d6d9-48fb-9a4a-6b1a63da912d","year":2023},"citing_paper":{"arxiv_id":"2607.22869","last_updated":"2026-07-24T19:17:37Z","snapshot_observed_at":"2026-08-15T15:26:02.701139Z","submitted_at":"2026-07-24T19:17:37Z","title":"Multi-primitive in-memory computing for Monte Carlo tree search","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T15:33:45.306244Z"},"links":{"citing_paper":"/paper/2607.22869"},"observation_digest":"sha256:3a8d9ca1e5f7669530db7288d2b751d092b5cef434dae5490ce5ddca195d8264","observation_id":"ef69e000-60ec-46d5-976d-a96cedb747d8","resolution":{"observed_at":"2026-08-15T15:33:45.397334Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:33:46.514230Z","title":"In: 2022 3rd International Conference on Artificial Intelligence, Information Processing and Cloud Computing (AIIPCC), pp","venue":null,"work_id":"da5ff10f-b64a-48f2-8d28-127c47c3d122","year":2022},"citing_paper":{"arxiv_id":"2607.22869","last_updated":"2026-07-24T19:17:37Z","snapshot_observed_at":"2026-08-15T15:26:02.701139Z","submitted_at":"2026-07-24T19:17:37Z","title":"Multi-primitive in-memory computing for Monte Carlo tree search","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T15:33:45.310629Z"},"links":{"citing_paper":"/paper/2607.22869"},"observation_digest":"sha256:26f439b0c0c27831daca6476dd56f08d5d7414a4df21075b8a21b329a46b95be","observation_id":"69e1ae9f-3db3-47f3-af33-92c70da500f3","resolution":{"observed_at":"2026-08-15T15:33:46.520397Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:33:46.494738Z","title":"Available online (2022)","venue":null,"work_id":"4030599c-bd1c-4245-be5e-28abfc9f501c","year":2022},"citing_paper":{"arxiv_id":"2607.22869","last_updated":"2026-07-24T19:17:37Z","snapshot_observed_at":"2026-08-15T15:26:02.701139Z","submitted_at":"2026-07-24T19:17:37Z","title":"Multi-primitive in-memory computing for Monte Carlo tree search","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T15:33:45.315608Z"},"links":{"citing_paper":"/paper/2607.22869"},"observation_digest":"sha256:c958d136b4703d7509897645bb23f350b2075e1dcbd8800d7ae56290af1d322d","observation_id":"b9f4da0d-9796-49a6-ac50-db49dde40564","resolution":{"observed_at":"2026-08-15T15:33:46.500939Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:33:46.474285Z","title":"In: 2022 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pp","venue":null,"work_id":"d2f880ce-737e-40b1-a8b4-9e234ec860d0","year":2022},"citing_paper":{"arxiv_id":"2607.22869","last_updated":"2026-07-24T19:17:37Z","snapshot_observed_at":"2026-08-15T15:26:02.701139Z","submitted_at":"2026-07-24T19:17:37Z","title":"Multi-primitive in-memory computing for Monte Carlo tree search","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T15:33:45.320227Z"},"links":{"citing_paper":"/paper/2607.22869"},"observation_digest":"sha256:a419159d357f8cf2ab7c4595e8535f91ff4a4cc70b21e0b8e4525c835fd86938","observation_id":"78e1d022-935a-4769-ad1a-61c6c302c144","resolution":{"observed_at":"2026-08-15T15:33:46.481289Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:33:46.455886Z","title":"In: Latifi, S","venue":null,"work_id":"1aafbd00-9dc9-42e2-9710-2f608013b085","year":2016},"citing_paper":{"arxiv_id":"2607.22869","last_updated":"2026-07-24T19:17:37Z","snapshot_observed_at":"2026-08-15T15:26:02.701139Z","submitted_at":"2026-07-24T19:17:37Z","title":"Multi-primitive in-memory computing for Monte Carlo tree search","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T15:33:45.324451Z"},"links":{"citing_paper":"/paper/2607.22869"},"observation_digest":"sha256:a1b0e6bdb581b89b8acbdf1a876f7dbd850c993fe2185f71bb6cbb5d9f015fa8","observation_id":"18b638cc-e94c-4588-b14b-ea4b29ebbfe4","resolution":{"observed_at":"2026-08-15T15:33:46.461913Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:33:46.436989Z","title":"In: 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and PhD Forum, pp","venue":null,"work_id":"71d14a55-b00c-4e74-8c39-08b94215da50","year":2011},"citing_paper":{"arxiv_id":"2607.22869","last_updated":"2026-07-24T19:17:37Z","snapshot_observed_at":"2026-08-15T15:26:02.701139Z","submitted_at":"2026-07-24T19:17:37Z","title":"Multi-primitive in-memory computing for Monte Carlo tree search","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T15:33:45.328884Z"},"links":{"citing_paper":"/paper/2607.22869"},"observation_digest":"sha256:3f59e780a9f8bb99e6f93f95e3c61d3f20bb13297dfec86027bc843e3d0cd9f8","observation_id":"ac9dfa2b-7f40-4100-8452-d9be9b30bc8a","resolution":{"observed_at":"2026-08-15T15:33:46.443356Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:33:45.333487Z","title":"In: 2024 International Conference on Neuromorphic Systems (ICONS), pp","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22869","last_updated":"2026-07-24T19:17:37Z","snapshot_observed_at":"2026-08-15T15:26:02.701139Z","submitted_at":"2026-07-24T19:17:37Z","title":"Multi-primitive in-memory computing for Monte Carlo tree search","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T15:33:45.333487Z"},"links":{"citing_paper":"/paper/2607.22869"},"observation_digest":"sha256:4c3a845cf82c8dfadb3e2df41ac188b89483b623edd0711d1ad181dd6662b26c","observation_id":"c0017d52-46db-469d-ae19-c49baed873ab","resolution":{"observed_at":"2026-08-15T15:33:45.333487Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:33:45.338409Z","title":"IEEE Transactions on Games13(3), 315–320 (2021) https://doi.org/10","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.22869","last_updated":"2026-07-24T19:17:37Z","snapshot_observed_at":"2026-08-15T15:26:02.701139Z","submitted_at":"2026-07-24T19:17:37Z","title":"Multi-primitive in-memory computing for Monte Carlo tree search","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T15:33:45.338409Z"},"links":{"citing_paper":"/paper/2607.22869"},"observation_digest":"sha256:096767b678dcc414ab505606fc653d67355f4c79e57e8b6e513a3d322166839f","observation_id":"ae4cbbb3-9ea4-4e0b-a793-6d509a0a2622","resolution":{"observed_at":"2026-08-15T15:33:45.338409Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:33:45.343911Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.22869","last_updated":"2026-07-24T19:17:37Z","snapshot_observed_at":"2026-08-15T15:26:02.701139Z","submitted_at":"2026-07-24T19:17:37Z","title":"Multi-primitive in-memory computing for Monte Carlo tree search","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T15:33:45.343911Z"},"links":{"citing_paper":"/paper/2607.22869"},"observation_digest":"sha256:02a129835f35004fc0ee760d6015b6cab03a582e7332c33a4fce7e5886a4cd09","observation_id":"4560afe0-29ea-422d-a39e-7006bd7e25f0","resolution":{"observed_at":"2026-08-15T15:33:45.343911Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:33:46.417463Z","title":"In: Proceedings of the 41st International Conference on Machine Learning (ICML)","venue":null,"work_id":"9c0b5971-0ed9-45fd-9cb5-0e19a649ac85","year":2024},"citing_paper":{"arxiv_id":"2607.22869","last_updated":"2026-07-24T19:17:37Z","snapshot_observed_at":"2026-08-15T15:26:02.701139Z","submitted_at":"2026-07-24T19:17:37Z","title":"Multi-primitive in-memory computing for Monte Carlo tree search","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T15:33:45.348739Z"},"links":{"citing_paper":"/paper/2607.22869"},"observation_digest":"sha256:2103191185208c3418c7761d7bc7797dab88b62e8bb986c6bd087208d3583e1c","observation_id":"cc68e524-d3f0-41bc-8b68-398bdfbcacb5","resolution":{"observed_at":"2026-08-15T15:33:46.423489Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:33:45.353925Z","title":"In: 2016 IEEE Intelligent Vehicles Symposium (IV), pp","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.22869","last_updated":"2026-07-24T19:17:37Z","snapshot_observed_at":"2026-08-15T15:26:02.701139Z","submitted_at":"2026-07-24T19:17:37Z","title":"Multi-primitive in-memory computing for Monte Carlo tree search","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T15:33:45.353925Z"},"links":{"citing_paper":"/paper/2607.22869"},"observation_digest":"sha256:7514d4cc3e92f7c5ffc28b345da6cc7e9fb6bf7835ff48d6e38626ad9ae57b24","observation_id":"27e7c1ce-8a81-44ff-a92f-59c2c2e38841","resolution":{"observed_at":"2026-08-15T15:33:45.353925Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:33:46.396310Z","title":"MIT Press, Cambridge, MA, USA (2005) 30","venue":null,"work_id":"7f013b11-6bb7-4006-ad97-482f53a64eeb","year":2005},"citing_paper":{"arxiv_id":"2607.22869","last_updated":"2026-07-24T19:17:37Z","snapshot_observed_at":"2026-08-15T15:26:02.701139Z","submitted_at":"2026-07-24T19:17:37Z","title":"Multi-primitive in-memory computing for Monte Carlo tree search","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T15:33:45.358573Z"},"links":{"citing_paper":"/paper/2607.22869"},"observation_digest":"sha256:2a529d9331671510ae5526ce46786811f9b89aec5cb3c4d6e95d06a56a49d828","observation_id":"0a12fb9b-6d20-4177-a091-4b4353c0f74b","resolution":{"observed_at":"2026-08-15T15:33:46.402401Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2607.22869","last_updated":"2026-07-24T19:17:37Z","latest_version":1,"primary_category":"cs.AR","snapshot_observed_at":"2026-08-15T15:26:02.701139Z","submitted_at":"2026-07-24T19:17:37Z","title":"Multi-primitive in-memory computing for Monte Carlo tree search"},"reference_resolution":{"displayed":37,"state_counts":{"malformed_identifier":1,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":12,"verified_exact":4,"verified_fuzzy":18},"total_outbound_references":37},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 0 inbound Pith citation observations for arXiv:2607.22869."}