{"as_of":"2026-08-10T03:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6f603e1e7ebdfdf4a036a9280b40b955792ca23f72ef26f783027f383dd1e441","coverage":[{"denominator":34,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":34,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T19:22:44.229485Z","state":"measured"},{"denominator":34,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":34,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2512.01193/citation-record","integrity":"/paper/2512.01193/integrity","json":"/paper/2512.01193/citation-record.json","paper":"/paper/2512.01193"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T19:22:44.129383Z","title":"Overall, our design is three orders of magnitude more energy efficient than GraphR and achieves 7.23× and 2.3× energy efficiency compared to SparseMEM and TARe, respectively","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.01193","last_updated":"2025-12-01T02:19:56Z","snapshot_observed_at":"2026-08-09T03:51:57.120289Z","submitted_at":"2025-12-01T02:19:56Z","title":"Leveraging Recurrent Patterns in Graph Accelerators","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:44.129383Z"},"links":{"citing_paper":"/paper/2512.01193"},"observation_digest":"sha256:8c32959e122cfafb6b1a933cfd26ad7dbad1a3594e2d8786e22d1d3f02f596a1","observation_id":"a7065ba4-d8e2-4c55-84a2-c838c51e6832","resolution":{"observed_at":"2026-08-03T19:22:44.129383Z","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-03T19:22:44.133331Z","title":"On average, our design achieves three orders of magnitude higher speedup than GraphR, and 2.38× and 1.27× over SparseMEM and TARe, respectively","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.01193","last_updated":"2025-12-01T02:19:56Z","snapshot_observed_at":"2026-08-09T03:51:57.120289Z","submitted_at":"2025-12-01T02:19:56Z","title":"Leveraging Recurrent Patterns in Graph Accelerators","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:44.133331Z"},"links":{"citing_paper":"/paper/2512.01193"},"observation_digest":"sha256:60de7da43a4cb94692d318b811ddc5ead8f5145f58020d84e95c5238105b47e2","observation_id":"2e6c54db-caf8-4d72-a553-ba1abbae02f5","resolution":{"observed_at":"2026-08-03T19:22:44.133331Z","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-03T19:22:44.136827Z","title":"Finding High-Quality Content in Social Media,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2512.01193","last_updated":"2025-12-01T02:19:56Z","snapshot_observed_at":"2026-08-09T03:51:57.120289Z","submitted_at":"2025-12-01T02:19:56Z","title":"Leveraging Recurrent Patterns in Graph Accelerators","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:44.136827Z"},"links":{"citing_paper":"/paper/2512.01193"},"observation_digest":"sha256:adbb3005a6ebb296754e20edc4bd9639c4d907b0389e779593ec9cab957f2673","observation_id":"0cb4ecca-bd98-4e3c-a9e6-4bc4dc5462c5","resolution":{"observed_at":"2026-08-03T19:22:44.136827Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2003.11673","last_updated":"2020-03-25T23:13:50Z","snapshot_observed_at":"2026-08-08T02:50:05.521164Z","submitted_at":"2020-03-25T23:13:50Z","title":"Explicit expanders of every degree and size","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.11673","snapshot_observed_at":"2026-08-03T19:22:44.139937Z","title":"Amazon.com recommendations: item- to-item collaborative filtering,","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2512.01193","last_updated":"2025-12-01T02:19:56Z","snapshot_observed_at":"2026-08-09T03:51:57.120289Z","submitted_at":"2025-12-01T02:19:56Z","title":"Leveraging Recurrent Patterns in Graph Accelerators","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:44.139937Z"},"links":{"cited_paper":"/paper/2003.11673","citing_paper":"/paper/2512.01193"},"observation_digest":"sha256:bf2d9eb3855a74aef6ab4b97ebbd34b6d8f15c89184189fb378fdb434914492f","observation_id":"77021c19-0f4d-434b-8858-2d03dc1d3115","resolution":{"observed_at":"2026-08-03T19:22:44.139937Z","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-03T19:22:44.143204Z","title":"Collaborative Fil- tering Recommender Systems,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2512.01193","last_updated":"2025-12-01T02:19:56Z","snapshot_observed_at":"2026-08-09T03:51:57.120289Z","submitted_at":"2025-12-01T02:19:56Z","title":"Leveraging Recurrent Patterns in Graph Accelerators","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:44.143204Z"},"links":{"citing_paper":"/paper/2512.01193"},"observation_digest":"sha256:79faf63b8df7c0892af12c147ff55af4c2087e3dffc3e3c9536313041061d015","observation_id":"0d47636c-0b8e-4775-b0f7-c3831371c392","resolution":{"observed_at":"2026-08-03T19:22:44.143204Z","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.1093/bioinformatics/bti610","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Blast2GO: a universal tool for annotation, visualization and analysis in functional genomics research,","venue":"Bioinformatics","work_id":"29e6b61c-2fc6-4c7c-907f-b857b7e66265","year":2005},"citing_paper":{"arxiv_id":"2512.01193","last_updated":"2025-12-01T02:19:56Z","snapshot_observed_at":"2026-08-09T03:51:57.120289Z","submitted_at":"2025-12-01T02:19:56Z","title":"Leveraging Recurrent Patterns in Graph Accelerators","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:44.146385Z"},"links":{"citing_paper":"/paper/2512.01193"},"observation_digest":"sha256:9d3f9593c62233d4782bafeb2ac3c90af992c88db1405d5450a4bf7ddd721214","observation_id":"3bc70189-5337-45ed-b828-3d5e0799eaa4","resolution":{"observed_at":"2026-08-03T19:23:24.575734Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-03T19:22:44.149488Z","title":"SNAP Datasets: Stanford Large Network Da- taset Collection","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2512.01193","last_updated":"2025-12-01T02:19:56Z","snapshot_observed_at":"2026-08-09T03:51:57.120289Z","submitted_at":"2025-12-01T02:19:56Z","title":"Leveraging Recurrent Patterns in Graph Accelerators","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:44.149488Z"},"links":{"citing_paper":"/paper/2512.01193"},"observation_digest":"sha256:06dbfa590ff5f4d246d5a18c20a566a32a1f4cf811caa52cf5832fccc20b4e77","observation_id":"df3b2f87-b6b1-41a3-8e80-99ae883133e0","resolution":{"observed_at":"2026-08-03T19:22:44.149488Z","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-03T19:22:44.152346Z","title":"The Network Data Repository with Inter- active Graph Analytics and Visualization,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2512.01193","last_updated":"2025-12-01T02:19:56Z","snapshot_observed_at":"2026-08-09T03:51:57.120289Z","submitted_at":"2025-12-01T02:19:56Z","title":"Leveraging Recurrent Patterns in Graph Accelerators","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:44.152346Z"},"links":{"citing_paper":"/paper/2512.01193"},"observation_digest":"sha256:eb0d6c17beb130376932f9c9a94fdd51af1a6ac608862574dc217a6bc4f86abc","observation_id":"017d1106-f9cd-4822-9c34-c13530cf6f11","resolution":{"observed_at":"2026-08-03T19:22:44.152346Z","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-03T19:22:44.155488Z","title":"KONECT: the Koblenz network collection,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2512.01193","last_updated":"2025-12-01T02:19:56Z","snapshot_observed_at":"2026-08-09T03:51:57.120289Z","submitted_at":"2025-12-01T02:19:56Z","title":"Leveraging Recurrent Patterns in Graph Accelerators","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:44.155488Z"},"links":{"citing_paper":"/paper/2512.01193"},"observation_digest":"sha256:fa83e6d963abd2e0696c862572bcd8ed0e3a0063950c862beef6db17516eee48","observation_id":"e64f85fc-4899-45ee-8d33-d146a08f5849","resolution":{"observed_at":"2026-08-03T19:22:44.155488Z","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.1007/s11390-019-1914-z","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A Survey on Graph Processing Accelerators: Challenges and Opportunities,","venue":"Journal of Computer Science and Technology","work_id":"0173ad46-a175-4e86-8772-cd3a136059f1","year":2019},"citing_paper":{"arxiv_id":"2512.01193","last_updated":"2025-12-01T02:19:56Z","snapshot_observed_at":"2026-08-09T03:51:57.120289Z","submitted_at":"2025-12-01T02:19:56Z","title":"Leveraging Recurrent Patterns in Graph Accelerators","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:44.158217Z"},"links":{"citing_paper":"/paper/2512.01193"},"observation_digest":"sha256:8aae076208191974701e02632475384fe88e66f9e0e943761429c8b505574b59","observation_id":"3282ed2e-0a45-4631-b6c4-9752a35ca321","resolution":{"observed_at":"2026-08-03T19:23:24.435371Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-03T19:22:44.161044Z","title":"A Survey of Memory-Centric Energy Efficient Computer Architecture,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2512.01193","last_updated":"2025-12-01T02:19:56Z","snapshot_observed_at":"2026-08-09T03:51:57.120289Z","submitted_at":"2025-12-01T02:19:56Z","title":"Leveraging Recurrent Patterns in Graph Accelerators","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:44.161044Z"},"links":{"citing_paper":"/paper/2512.01193"},"observation_digest":"sha256:c3b54cc8fbf0567efca0d43f4f030c3a47900f3a17ff4df038f48d07c5a1bedc","observation_id":"5171f334-a605-4232-9873-721264aba624","resolution":{"observed_at":"2026-08-03T19:22:44.161044Z","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-03T19:22:44.164059Z","title":"GraphR: Accelerating Graph Processing Using ReRAM,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2512.01193","last_updated":"2025-12-01T02:19:56Z","snapshot_observed_at":"2026-08-09T03:51:57.120289Z","submitted_at":"2025-12-01T02:19:56Z","title":"Leveraging Recurrent Patterns in Graph Accelerators","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:44.164059Z"},"links":{"citing_paper":"/paper/2512.01193"},"observation_digest":"sha256:cafe9e64f6662d55088582b2500dbf691a6ac7704438bcf645a01f808b64f0c6","observation_id":"eb6ade8a-9cfa-4575-b385-611e6e7b6aeb","resolution":{"observed_at":"2026-08-03T19:22:44.164059Z","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-03T19:22:44.167041Z","title":"Performance and Accuracy Tradeoffs for Training Graph Neural Net- works on ReRAM -Based Architectures,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2512.01193","last_updated":"2025-12-01T02:19:56Z","snapshot_observed_at":"2026-08-09T03:51:57.120289Z","submitted_at":"2025-12-01T02:19:56Z","title":"Leveraging Recurrent Patterns in Graph Accelerators","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:44.167041Z"},"links":{"citing_paper":"/paper/2512.01193"},"observation_digest":"sha256:7a51b774c9ada842bd7d3a28926665ab77fe35b4a3d1fe254bfa70aeac96c86f","observation_id":"044995ee-6204-4eb2-aa23-297443895629","resolution":{"observed_at":"2026-08-03T19:22:44.167041Z","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-03T19:22:44.169960Z","title":"Accelerating Graph Convolutional Networks Using Crossbar-based Processing -In-Memory Architectures,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2512.01193","last_updated":"2025-12-01T02:19:56Z","snapshot_observed_at":"2026-08-09T03:51:57.120289Z","submitted_at":"2025-12-01T02:19:56Z","title":"Leveraging Recurrent Patterns in Graph Accelerators","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:44.169960Z"},"links":{"citing_paper":"/paper/2512.01193"},"observation_digest":"sha256:cc2beb1aa7f07781e8295cd56ae08b84a627169e99092a2f5e294c325c218cf1","observation_id":"0b001133-2ec6-476d-a462-3fa0bd626222","resolution":{"observed_at":"2026-08-03T19:22:44.169960Z","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-03T19:22:44.173134Z","title":"ReGraphX: NoC -enabled 3D Heterogeneous ReRAM Architecture for Training Graph Neural Networks,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2512.01193","last_updated":"2025-12-01T02:19:56Z","snapshot_observed_at":"2026-08-09T03:51:57.120289Z","submitted_at":"2025-12-01T02:19:56Z","title":"Leveraging Recurrent Patterns in Graph Accelerators","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:44.173134Z"},"links":{"citing_paper":"/paper/2512.01193"},"observation_digest":"sha256:5591582cf6e11b56a44f3ec6de33bf4c23ede14d6316c5e4eca2c137e1d8984f","observation_id":"47eb79e3-865f-4c6d-98a7-2e984c567c04","resolution":{"observed_at":"2026-08-03T19:22:44.173134Z","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-03T19:22:44.176027Z","title":"Spara: An Energy -Efficient ReRAM-Based Accelerator for Sparse Graph Analytics Applications,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2512.01193","last_updated":"2025-12-01T02:19:56Z","snapshot_observed_at":"2026-08-09T03:51:57.120289Z","submitted_at":"2025-12-01T02:19:56Z","title":"Leveraging Recurrent Patterns in Graph Accelerators","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:44.176027Z"},"links":{"citing_paper":"/paper/2512.01193"},"observation_digest":"sha256:a9ad09662bdb9cb7b74583e7913415ab8fef3c380297718cc96362e9f95e4a15","observation_id":"df0dc111-816c-44ad-977b-f3fea80a56d9","resolution":{"observed_at":"2026-08-03T19:22:44.176027Z","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-03T19:22:44.181663Z","title":"A Task-Adaptive In-Situ ReRAM Computing for Graph Convolutional Networks,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2512.01193","last_updated":"2025-12-01T02:19:56Z","snapshot_observed_at":"2026-08-09T03:51:57.120289Z","submitted_at":"2025-12-01T02:19:56Z","title":"Leveraging Recurrent Patterns in Graph Accelerators","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:44.181663Z"},"links":{"citing_paper":"/paper/2512.01193"},"observation_digest":"sha256:27b1eb01588a971701183e47a5296debbe1a6cd427daf6c121792eca99d9f2ec","observation_id":"ba76aa29-9ad0-42f8-a179-981d1174f48c","resolution":{"observed_at":"2026-08-03T19:22:44.181663Z","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-03T19:22:44.184391Z","title":"Metal–Oxide RRAM,","venue":null,"work_id":null,"year":1951},"citing_paper":{"arxiv_id":"2512.01193","last_updated":"2025-12-01T02:19:56Z","snapshot_observed_at":"2026-08-09T03:51:57.120289Z","submitted_at":"2025-12-01T02:19:56Z","title":"Leveraging Recurrent Patterns in Graph Accelerators","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:44.184391Z"},"links":{"citing_paper":"/paper/2512.01193"},"observation_digest":"sha256:8526cf8ee137d6c025d9e4534b3162b7071848df37de557845f0afe533d83ede","observation_id":"cca3e751-43b0-48c4-8dc2-3ea2c53a8b93","resolution":{"observed_at":"2026-08-03T19:22:44.184391Z","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-03T19:22:44.187125Z","title":"19.7 A 16Gb ReRAM with 200MB/s write and 1GB/s read in 27nm technology,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2512.01193","last_updated":"2025-12-01T02:19:56Z","snapshot_observed_at":"2026-08-09T03:51:57.120289Z","submitted_at":"2025-12-01T02:19:56Z","title":"Leveraging Recurrent Patterns in Graph Accelerators","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:44.187125Z"},"links":{"citing_paper":"/paper/2512.01193"},"observation_digest":"sha256:3ca1af397766d0e97487cc8762125fe3f8e79fe3242faa1e900be4e9f18a2a8e","observation_id":"b0809fdc-9e01-4dc1-b4ca-9758bf48dd12","resolution":{"observed_at":"2026-08-03T19:22:44.187125Z","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-03T19:22:44.189932Z","title":"Performance-based comparative study of exist- ing and emerging non-volatile memories: a review,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2512.01193","last_updated":"2025-12-01T02:19:56Z","snapshot_observed_at":"2026-08-09T03:51:57.120289Z","submitted_at":"2025-12-01T02:19:56Z","title":"Leveraging Recurrent Patterns in Graph Accelerators","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:44.189932Z"},"links":{"citing_paper":"/paper/2512.01193"},"observation_digest":"sha256:dc6dbded3e68f30f6c58455bde92523755ed82baadc8bac06a1f36edb1f536ff","observation_id":"e5b65ed2-963d-4b13-813e-b8975b98f57d","resolution":{"observed_at":"2026-08-03T19:22:44.189932Z","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-03T19:22:44.192862Z","title":"PRIME: A Novel Processing -in-Memory Architecture for Neural Network Computation in ReRAM -Based Main Memory,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2512.01193","last_updated":"2025-12-01T02:19:56Z","snapshot_observed_at":"2026-08-09T03:51:57.120289Z","submitted_at":"2025-12-01T02:19:56Z","title":"Leveraging Recurrent Patterns in Graph Accelerators","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:44.192862Z"},"links":{"citing_paper":"/paper/2512.01193"},"observation_digest":"sha256:b47d85a14cabc93234431b2f4f0670b4e4e49d0bc3b5db3f25a674ea45d3b26d","observation_id":"949c865d-0188-4c68-82fd-580d7b802757","resolution":{"observed_at":"2026-08-03T19:22:44.192862Z","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-03T19:22:44.195804Z","title":"EMBER: Efficient Multiple- Bits-Per-Cell Embedded RRAM Macro for High-Density Digital Storage,","venue":null,"work_id":null,"year":2081},"citing_paper":{"arxiv_id":"2512.01193","last_updated":"2025-12-01T02:19:56Z","snapshot_observed_at":"2026-08-09T03:51:57.120289Z","submitted_at":"2025-12-01T02:19:56Z","title":"Leveraging Recurrent Patterns in Graph Accelerators","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:44.195804Z"},"links":{"citing_paper":"/paper/2512.01193"},"observation_digest":"sha256:ef21be0d45846fdd8541cbdfe532a65ed96afe2812e93a9d657b8386e18198be","observation_id":"bc86cc50-acaa-4fd9-a587-d93b4d078a8c","resolution":{"observed_at":"2026-08-03T19:22:44.195804Z","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-03T19:22:44.198829Z","title":"Automated Testing Algorithm for the Improvement of 1T1R ReRAM Endurance,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2512.01193","last_updated":"2025-12-01T02:19:56Z","snapshot_observed_at":"2026-08-09T03:51:57.120289Z","submitted_at":"2025-12-01T02:19:56Z","title":"Leveraging Recurrent Patterns in Graph Accelerators","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:44.198829Z"},"links":{"citing_paper":"/paper/2512.01193"},"observation_digest":"sha256:d01bf5dbfd4a328235732226dff7ac78a934c9ce512adbd92aa7bb46b05d5b26","observation_id":"e6981c5f-7bf3-4fcd-bf80-cb249e12fb6f","resolution":{"observed_at":"2026-08-03T19:22:44.198829Z","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/led.2011","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T19:23:24.128351Z","title":"Transparent Resistive Switching Memory Using ITO/AlN/ITO Capacitors,","venue":null,"work_id":"70bfa947-7948-4545-a7c0-cef689d54275","year":2011},"citing_paper":{"arxiv_id":"2512.01193","last_updated":"2025-12-01T02:19:56Z","snapshot_observed_at":"2026-08-09T03:51:57.120289Z","submitted_at":"2025-12-01T02:19:56Z","title":"Leveraging Recurrent Patterns in Graph Accelerators","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:44.201625Z"},"links":{"citing_paper":"/paper/2512.01193"},"observation_digest":"sha256:175c4f28f081dd3669affe416371c9ae492edc4167af51f2b9ce39330526e9b2","observation_id":"ab8dc26b-8038-4d63-8824-5e171fceb425","resolution":{"observed_at":"2026-08-03T19:23:24.237074Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-03T19:22:44.204380Z","title":"Overcoming the challenges of crossbar resistive memory ar- chitectures,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2512.01193","last_updated":"2025-12-01T02:19:56Z","snapshot_observed_at":"2026-08-09T03:51:57.120289Z","submitted_at":"2025-12-01T02:19:56Z","title":"Leveraging Recurrent Patterns in Graph Accelerators","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:44.204380Z"},"links":{"citing_paper":"/paper/2512.01193"},"observation_digest":"sha256:9688056ea00788cbb49a172935863eb1cce20dc12b888eb136bb15f63ac2db23","observation_id":"ea5c3b88-b2ea-43be-8fad-28f0e22164d2","resolution":{"observed_at":"2026-08-03T19:22:44.204380Z","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-03T19:22:44.207089Z","title":"Dot-product engine for neuromorphic computing: Program- ming 1T1M crossbar to accelerate matrix -vector multiplication,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2512.01193","last_updated":"2025-12-01T02:19:56Z","snapshot_observed_at":"2026-08-09T03:51:57.120289Z","submitted_at":"2025-12-01T02:19:56Z","title":"Leveraging Recurrent Patterns in Graph Accelerators","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:44.207089Z"},"links":{"citing_paper":"/paper/2512.01193"},"observation_digest":"sha256:1699fc70812eac34338ffb675592c0e5d39ec2bbf34b340711c229f333e6ef68","observation_id":"9317ad88-63d4-415a-af5f-8e1293a63de4","resolution":{"observed_at":"2026-08-03T19:22:44.207089Z","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-03T19:22:44.210062Z","title":"GIM: Versatile GNN Acceleration with Reconfigurable Processing -in-Memory,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2512.01193","last_updated":"2025-12-01T02:19:56Z","snapshot_observed_at":"2026-08-09T03:51:57.120289Z","submitted_at":"2025-12-01T02:19:56Z","title":"Leveraging Recurrent Patterns in Graph Accelerators","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:44.210062Z"},"links":{"citing_paper":"/paper/2512.01193"},"observation_digest":"sha256:fb2ad973831ad19fe7160d48a35a0c704b7cecf2fb0f5c955653f8606eae9d62","observation_id":"1f02c615-3bd7-4a7d-acab-37e6ac2e6b09","resolution":{"observed_at":"2026-08-03T19:22:44.210062Z","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-03T19:22:44.212780Z","title":"Janus: A Flexible Processing-in-Memory Graph Accelerator Toward Sparsity,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2512.01193","last_updated":"2025-12-01T02:19:56Z","snapshot_observed_at":"2026-08-09T03:51:57.120289Z","submitted_at":"2025-12-01T02:19:56Z","title":"Leveraging Recurrent Patterns in Graph Accelerators","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:44.212780Z"},"links":{"citing_paper":"/paper/2512.01193"},"observation_digest":"sha256:fae95f53c1a6eec7918a0481ddce3d05b2655e9d527fe6ee46e7a0e8e56406a6","observation_id":"3885b916-298e-49b5-95cf-29538f0297ba","resolution":{"observed_at":"2026-08-03T19:22:44.212780Z","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-03T19:22:44.215572Z","title":"GraphIte: Accelerating Iterative Graph Algorithms on ReRAM Architectures via Approximate Computing,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2512.01193","last_updated":"2025-12-01T02:19:56Z","snapshot_observed_at":"2026-08-09T03:51:57.120289Z","submitted_at":"2025-12-01T02:19:56Z","title":"Leveraging Recurrent Patterns in Graph Accelerators","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:44.215572Z"},"links":{"citing_paper":"/paper/2512.01193"},"observation_digest":"sha256:2b852876616dbb35f233ef1d50445094bde9396cd3a59e487c2a754527d772d1","observation_id":"f4586ac2-4b51-4d18-83af-c31279d68b30","resolution":{"observed_at":"2026-08-03T19:22:44.215572Z","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.1007/978-1-4615-0005-6_4","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Random Evolution in Massive Graphs,","venue":"Massive computing","work_id":"08ef1dd2-3ade-4244-87c6-09de038be5f7","year":2002},"citing_paper":{"arxiv_id":"2512.01193","last_updated":"2025-12-01T02:19:56Z","snapshot_observed_at":"2026-08-09T03:51:57.120289Z","submitted_at":"2025-12-01T02:19:56Z","title":"Leveraging Recurrent Patterns in Graph Accelerators","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:44.218440Z"},"links":{"citing_paper":"/paper/2512.01193"},"observation_digest":"sha256:de710bc83e20e7d9e9d5ea8759774666a21fb110c58d1f913413e5377c30ab92","observation_id":"43e5d0e7-5a2a-4ab4-8778-a0ce817f0aa7","resolution":{"observed_at":"2026-08-03T19:23:24.006256Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/tcad.2012","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T19:23:23.672854Z","title":"NVSim: A Circuit- Level Per- formance, Energy, and Area Model for Emerging Nonvolatile Memory,","venue":null,"work_id":"1d03866f-365f-41e3-bcc2-7613b203349d","year":2012},"citing_paper":{"arxiv_id":"2512.01193","last_updated":"2025-12-01T02:19:56Z","snapshot_observed_at":"2026-08-09T03:51:57.120289Z","submitted_at":"2025-12-01T02:19:56Z","title":"Leveraging Recurrent Patterns in Graph Accelerators","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:44.221128Z"},"links":{"citing_paper":"/paper/2512.01193"},"observation_digest":"sha256:5ba06db626b5740c0d606bee934dd6429cb8ce704a2e4a025175f10ed43bd586","observation_id":"7456c3f0-b0fb-4611-934c-8cf28e6fd902","resolution":{"observed_at":"2026-08-03T19:23:23.813117Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-03T19:22:44.224078Z","title":"Cacti 6.0: A tool to model large caches,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2512.01193","last_updated":"2025-12-01T02:19:56Z","snapshot_observed_at":"2026-08-09T03:51:57.120289Z","submitted_at":"2025-12-01T02:19:56Z","title":"Leveraging Recurrent Patterns in Graph Accelerators","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:44.224078Z"},"links":{"citing_paper":"/paper/2512.01193"},"observation_digest":"sha256:c92a06c14d09bb147c1c9b2cd79b6104f8314002850b576d88b688bc521a2b2b","observation_id":"411df184-122c-4701-836e-9f6c1cbebe58","resolution":{"observed_at":"2026-08-03T19:22:44.224078Z","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-03T19:22:44.226784Z","title":"A 3.1 mW 8b 1.2 GS/s Single-Channel Asynchronous SAR ADC With Alternate Comparators for Enhanced Speed in 32 nm Digital SOI CMOS,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2512.01193","last_updated":"2025-12-01T02:19:56Z","snapshot_observed_at":"2026-08-09T03:51:57.120289Z","submitted_at":"2025-12-01T02:19:56Z","title":"Leveraging Recurrent Patterns in Graph Accelerators","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:44.226784Z"},"links":{"citing_paper":"/paper/2512.01193"},"observation_digest":"sha256:b63d7699f9854d2990a432e99e1709c37a28466ef78897b55939aa1cfbd22689","observation_id":"73a46f4e-e3e0-4970-a9ec-cf734240d499","resolution":{"observed_at":"2026-08-03T19:22:44.226784Z","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-03T19:22:44.229485Z","title":"RRAM Defect Modeling and Failure Analysis Based on March Test and a Novel Squeeze-Search Scheme,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2512.01193","last_updated":"2025-12-01T02:19:56Z","snapshot_observed_at":"2026-08-09T03:51:57.120289Z","submitted_at":"2025-12-01T02:19:56Z","title":"Leveraging Recurrent Patterns in Graph Accelerators","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-03T19:22:44.229485Z"},"links":{"citing_paper":"/paper/2512.01193"},"observation_digest":"sha256:41c9cbad9abbce89f25d45ac51a96abaebccf78534662392c496981506386707","observation_id":"69c70b2f-40d0-46c7-85d1-d05e4642785f","resolution":{"observed_at":"2026-08-03T19:22:44.229485Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2512.01193","last_updated":"2025-12-01T02:19:56Z","latest_version":1,"primary_category":"cs.AR","snapshot_observed_at":"2026-08-09T03:51:57.120289Z","submitted_at":"2025-12-01T02:19:56Z","title":"Leveraging Recurrent Patterns in Graph Accelerators"},"reference_resolution":{"displayed":34,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":28,"verified_exact":5,"verified_fuzzy":0},"total_outbound_references":34},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 34 of 34 outbound references and 0 inbound Pith citation observations for arXiv:2512.01193."}