{"as_of":"2026-07-22T08:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fcb1ce9619665fc7b2369beba96c64dfec6835a384d42ccfdea22afbdfdccacd","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-12T00:53:54.878244Z","state":"measured"},{"denominator":20,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":20,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-07-22T06:31:00.163083+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/2605.08615/citation-record","integrity":"/paper/2605.08615/integrity","json":"/paper/2605.08615/citation-record.json","paper":"/paper/2605.08615"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2401.02954","last_updated":"2024-01-05T18:59:13Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-01-05T18:59:13Z","title":"DeepSeek LLM: Scaling Open-Source Language Models with Longtermism","version":1},"cited_work":{"arxiv_id":"2401.02954","doi":"10.48550/arxiv.2401.02954","metadata_source":"pith","pith_arxiv_id":"2401.02954","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"DeepSeek LLM: Scaling Open-Source Language Models with Longtermism","venue":"cs.CL","work_id":"01b10587-025b-499d-8ba3-7a538d24c2d6","year":2024},"citing_paper":{"arxiv_id":"2605.08615","last_updated":"2026-05-09T02:18:59Z","snapshot_observed_at":"2026-07-06T23:20:47.880233Z","submitted_at":"2026-05-09T02:18:59Z","title":"DSPE: An Energy-Efficient Edge Processor for DeepSeek Inference with MerkleTree-based Incremental Pruning, Multi-Stage Boothing Lookup and Dynamic Adaptive Posit Processing","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-12T00:53:54.878244Z"},"links":{"cited_paper":"/paper/2401.02954","citing_paper":"/paper/2605.08615"},"observation_digest":"sha256:ca725e05f3766ab3df7e969e5462b5149cbe4c4aaaa379542e0157a15beb7eb0","observation_id":"c3272a36-9556-4c62-93f2-a07eb453c612","resolution":{"observed_at":"2026-05-12T08:36:26.405652Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Choquette","venue":null,"work_id":"b2c12e3b-f5af-49df-b8b3-e888ceaca09d","year":2022},"citing_paper":{"arxiv_id":"2605.08615","last_updated":"2026-05-09T02:18:59Z","snapshot_observed_at":"2026-07-06T23:20:47.880233Z","submitted_at":"2026-05-09T02:18:59Z","title":"DSPE: An Energy-Efficient Edge Processor for DeepSeek Inference with MerkleTree-based Incremental Pruning, Multi-Stage Boothing Lookup and Dynamic Adaptive Posit Processing","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-12T00:53:54.878244Z"},"links":{"citing_paper":"/paper/2605.08615"},"observation_digest":"sha256:715f7ef749991cf7b3a1d320a770bac6058b4e902b4311e04d152923eb61de8e","observation_id":"6df2af66-33cf-4243-a286-c2ca3e17171a","resolution":{"observed_at":"2026-05-14T09:33:26.479895Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Choquette and R","venue":null,"work_id":"46afd946-fa32-4fe1-ac25-85fe13e94331","year":2022},"citing_paper":{"arxiv_id":"2605.08615","last_updated":"2026-05-09T02:18:59Z","snapshot_observed_at":"2026-07-06T23:20:47.880233Z","submitted_at":"2026-05-09T02:18:59Z","title":"DSPE: An Energy-Efficient Edge Processor for DeepSeek Inference with MerkleTree-based Incremental Pruning, Multi-Stage Boothing Lookup and Dynamic Adaptive Posit Processing","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-12T00:53:54.878244Z"},"links":{"citing_paper":"/paper/2605.08615"},"observation_digest":"sha256:7481887b052897c30e12fbc58fa5a4cd5b54a75fc55ace37efb48331ddc0a507","observation_id":"91325a7b-6a4d-478b-a073-0b712c7f318d","resolution":{"observed_at":"2026-05-14T09:33:26.488208Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Huang, W","venue":null,"work_id":"db0d46c2-acfa-47aa-bb90-b1c9dbb42c8b","year":2024},"citing_paper":{"arxiv_id":"2605.08615","last_updated":"2026-05-09T02:18:59Z","snapshot_observed_at":"2026-07-06T23:20:47.880233Z","submitted_at":"2026-05-09T02:18:59Z","title":"DSPE: An Energy-Efficient Edge Processor for DeepSeek Inference with MerkleTree-based Incremental Pruning, Multi-Stage Boothing Lookup and Dynamic Adaptive Posit Processing","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-12T00:53:54.878244Z"},"links":{"citing_paper":"/paper/2605.08615"},"observation_digest":"sha256:851bcdc1a30c06daaf76e665a9612e5f18f6201f6fdfadb248d472e3812d8c9a","observation_id":"451122da-4591-44f8-8aa2-d2c5c3b63f1e","resolution":{"observed_at":"2026-05-14T09:33:26.471421Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Jouppi, G","venue":null,"work_id":"493d2080-bc2f-45be-b73a-3c931a221df9","year":2023},"citing_paper":{"arxiv_id":"2605.08615","last_updated":"2026-05-09T02:18:59Z","snapshot_observed_at":"2026-07-06T23:20:47.880233Z","submitted_at":"2026-05-09T02:18:59Z","title":"DSPE: An Energy-Efficient Edge Processor for DeepSeek Inference with MerkleTree-based Incremental Pruning, Multi-Stage Boothing Lookup and Dynamic Adaptive Posit Processing","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-12T00:53:54.878244Z"},"links":{"citing_paper":"/paper/2605.08615"},"observation_digest":"sha256:abcbcbc36988e7895e9c8da269c9d1bc24694248955261ad4c935919f38c71fa","observation_id":"2a8ab460-dec6-4639-9eb2-eed093ad6709","resolution":{"observed_at":"2026-05-14T09:33:26.467174Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"37376927-c358-48d4-a1f3-67d0726b24da","year":2017},"citing_paper":{"arxiv_id":"2605.08615","last_updated":"2026-05-09T02:18:59Z","snapshot_observed_at":"2026-07-06T23:20:47.880233Z","submitted_at":"2026-05-09T02:18:59Z","title":"DSPE: An Energy-Efficient Edge Processor for DeepSeek Inference with MerkleTree-based Incremental Pruning, Multi-Stage Boothing Lookup and Dynamic Adaptive Posit Processing","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-12T00:53:54.878244Z"},"links":{"citing_paper":"/paper/2605.08615"},"observation_digest":"sha256:fc0a4cea340257f6f5300f124ec5e534a0b995457ff033eb3f39088872ac7723","observation_id":"c91df4f0-1fda-472e-a222-2739680e6415","resolution":{"observed_at":"2026-05-14T09:33:26.475807Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Keller, R","venue":null,"work_id":"96d7ffcf-e6e8-44f7-9a48-8ec34431e2c0","year":2022},"citing_paper":{"arxiv_id":"2605.08615","last_updated":"2026-05-09T02:18:59Z","snapshot_observed_at":"2026-07-06T23:20:47.880233Z","submitted_at":"2026-05-09T02:18:59Z","title":"DSPE: An Energy-Efficient Edge Processor for DeepSeek Inference with MerkleTree-based Incremental Pruning, Multi-Stage Boothing Lookup and Dynamic Adaptive Posit Processing","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-12T00:53:54.878244Z"},"links":{"citing_paper":"/paper/2605.08615"},"observation_digest":"sha256:2e1d653b6fc756c6286a98eeafed9afdaedd287619f7ce4d427f520abde6d426","observation_id":"4f54370b-d951-4059-9196-4a540f27e571","resolution":{"observed_at":"2026-05-14T09:33:26.484147Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"c6de835b-08c7-495b-abd0-210cf4e16a35","year":2022},"citing_paper":{"arxiv_id":"2605.08615","last_updated":"2026-05-09T02:18:59Z","snapshot_observed_at":"2026-07-06T23:20:47.880233Z","submitted_at":"2026-05-09T02:18:59Z","title":"DSPE: An Energy-Efficient Edge Processor for DeepSeek Inference with MerkleTree-based Incremental Pruning, Multi-Stage Boothing Lookup and Dynamic Adaptive Posit Processing","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-12T00:53:54.878244Z"},"links":{"citing_paper":"/paper/2605.08615"},"observation_digest":"sha256:b0353e8f9b4ef6ecf19b459e60a86907dd316a00f9ee7ce8d18e68c2e32c564c","observation_id":"2e3210df-d547-4390-a1f0-c596cb1b6701","resolution":{"observed_at":"2026-05-14T09:33:26.492063Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.19437","last_updated":"2025-02-18T17:26:38Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-27T04:03:16Z","title":"DeepSeek-V3 Technical Report","version":2},"cited_work":{"arxiv_id":"2412.19437","doi":"10.1016/j.neucom.2023.127063.url:https://www.sciencedirect","metadata_source":"pith","pith_arxiv_id":"2412.19437","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"DeepSeek-V3 Technical Report","venue":"cs.CL","work_id":"57d2791d-2219-4c31-a077-afc04b12a75c","year":2024},"citing_paper":{"arxiv_id":"2605.08615","last_updated":"2026-05-09T02:18:59Z","snapshot_observed_at":"2026-07-06T23:20:47.880233Z","submitted_at":"2026-05-09T02:18:59Z","title":"DSPE: An Energy-Efficient Edge Processor for DeepSeek Inference with MerkleTree-based Incremental Pruning, Multi-Stage Boothing Lookup and Dynamic Adaptive Posit Processing","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-12T00:53:54.878244Z"},"links":{"cited_paper":"/paper/2412.19437","citing_paper":"/paper/2605.08615"},"observation_digest":"sha256:2b25c28e665c0fc2e2827feb1173c568d33f56c0ef2e3140fb9c922aef3922c2","observation_id":"4af8e3f7-774c-44cf-9876-71283efff3cf","resolution":{"observed_at":"2026-05-12T08:36:26.411895Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"8255ddbc-908a-4678-92f0-25529e03f6b8","year":2021},"citing_paper":{"arxiv_id":"2605.08615","last_updated":"2026-05-09T02:18:59Z","snapshot_observed_at":"2026-07-06T23:20:47.880233Z","submitted_at":"2026-05-09T02:18:59Z","title":"DSPE: An Energy-Efficient Edge Processor for DeepSeek Inference with MerkleTree-based Incremental Pruning, Multi-Stage Boothing Lookup and Dynamic Adaptive Posit Processing","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-12T00:53:54.878244Z"},"links":{"citing_paper":"/paper/2605.08615"},"observation_digest":"sha256:94332b8246c065a0058b34690f7eaadbce656f2b0391fb55fcac7c5674dbab0f","observation_id":"9b971dd7-92b4-410f-91e6-75c0f75c7415","resolution":{"observed_at":"2026-05-14T09:33:26.495932Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"931b2fe4-0fbe-4426-aa1d-0af622b20758","year":1999},"citing_paper":{"arxiv_id":"2605.08615","last_updated":"2026-05-09T02:18:59Z","snapshot_observed_at":"2026-07-06T23:20:47.880233Z","submitted_at":"2026-05-09T02:18:59Z","title":"DSPE: An Energy-Efficient Edge Processor for DeepSeek Inference with MerkleTree-based Incremental Pruning, Multi-Stage Boothing Lookup and Dynamic Adaptive Posit Processing","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-12T00:53:54.878244Z"},"links":{"citing_paper":"/paper/2605.08615"},"observation_digest":"sha256:9906f9a7019e0312fb0721929b29be367bab7a181e1e556c0f8f093f67d6be2f","observation_id":"17cb7238-c191-41c7-ad1c-6094e8c95384","resolution":{"observed_at":"2026-05-14T09:33:26.455446Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2615.2023","doi":"10.1109/isscc42615.2023.10067504","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"A Sub-0.8pJ/b 16.3Gbps/mm 2 Uni- versal Soft-Detection Decoder Using ORBGRAND in 40nm CMOS","venue":null,"work_id":"fdf93cf4-2834-4a04-9a9c-0e71ba83614d","year":2023},"citing_paper":{"arxiv_id":"2605.08615","last_updated":"2026-05-09T02:18:59Z","snapshot_observed_at":"2026-07-06T23:20:47.880233Z","submitted_at":"2026-05-09T02:18:59Z","title":"DSPE: An Energy-Efficient Edge Processor for DeepSeek Inference with MerkleTree-based Incremental Pruning, Multi-Stage Boothing Lookup and Dynamic Adaptive Posit Processing","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-12T00:53:54.878244Z"},"links":{"citing_paper":"/paper/2605.08615"},"observation_digest":"sha256:8f2191b6ee47232685b75af983779a35ee12776d6a8a5d6551556e1c9413aebb","observation_id":"5f43518a-13d2-4a58-998f-c695d3e591a2","resolution":{"observed_at":"2026-05-12T00:56:13.494881Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Taud and J","venue":null,"work_id":"1d9ca6cd-2a4f-44e1-a81b-24401490ae74","year":2017},"citing_paper":{"arxiv_id":"2605.08615","last_updated":"2026-05-09T02:18:59Z","snapshot_observed_at":"2026-07-06T23:20:47.880233Z","submitted_at":"2026-05-09T02:18:59Z","title":"DSPE: An Energy-Efficient Edge Processor for DeepSeek Inference with MerkleTree-based Incremental Pruning, Multi-Stage Boothing Lookup and Dynamic Adaptive Posit Processing","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-12T00:53:54.878244Z"},"links":{"citing_paper":"/paper/2605.08615"},"observation_digest":"sha256:32d734df41e43fcaf04bd59a519441b93944747ee8a7aecb2a6ffbb646b46a7d","observation_id":"61c3547c-bc4b-4aff-ba1b-9b280419771e","resolution":{"observed_at":"2026-05-14T09:33:26.463488Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"5aac085c-b016-4974-ad0d-24d12d9f7c52","year":2022},"citing_paper":{"arxiv_id":"2605.08615","last_updated":"2026-05-09T02:18:59Z","snapshot_observed_at":"2026-07-06T23:20:47.880233Z","submitted_at":"2026-05-09T02:18:59Z","title":"DSPE: An Energy-Efficient Edge Processor for DeepSeek Inference with MerkleTree-based Incremental Pruning, Multi-Stage Boothing Lookup and Dynamic Adaptive Posit Processing","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-12T00:53:54.878244Z"},"links":{"citing_paper":"/paper/2605.08615"},"observation_digest":"sha256:d8d3dc10674ead7bf1613aefe19fe064df76eece189b8634c5ef353f74cc4f52","observation_id":"f7fd31aa-e996-4aa7-956b-9b0141c1d97f","resolution":{"observed_at":"2026-05-14T09:33:26.450885Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2615.2023","doi":"10.1109/isscc42615.2023.10067504","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"A Sub-0.8pJ/b 16.3Gbps/mm 2 Uni- versal Soft-Detection Decoder Using ORBGRAND in 40nm CMOS","venue":null,"work_id":"fdf93cf4-2834-4a04-9a9c-0e71ba83614d","year":2023},"citing_paper":{"arxiv_id":"2605.08615","last_updated":"2026-05-09T02:18:59Z","snapshot_observed_at":"2026-07-06T23:20:47.880233Z","submitted_at":"2026-05-09T02:18:59Z","title":"DSPE: An Energy-Efficient Edge Processor for DeepSeek Inference with MerkleTree-based Incremental Pruning, Multi-Stage Boothing Lookup and Dynamic Adaptive Posit Processing","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-12T00:53:54.878244Z"},"links":{"citing_paper":"/paper/2605.08615"},"observation_digest":"sha256:6c2ac0b4681a1dd66ecece5d95fac01c7f5477cf70b126f688b828b1a65ee162","observation_id":"bc418f40-e97f-4a62-acde-17e008fb0425","resolution":{"observed_at":"2026-05-12T00:56:13.497551Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Varghese, N","venue":null,"work_id":"13eca39d-f7bd-4980-b341-dede7e5e5669","year":2016},"citing_paper":{"arxiv_id":"2605.08615","last_updated":"2026-05-09T02:18:59Z","snapshot_observed_at":"2026-07-06T23:20:47.880233Z","submitted_at":"2026-05-09T02:18:59Z","title":"DSPE: An Energy-Efficient Edge Processor for DeepSeek Inference with MerkleTree-based Incremental Pruning, Multi-Stage Boothing Lookup and Dynamic Adaptive Posit Processing","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-12T00:53:54.878244Z"},"links":{"citing_paper":"/paper/2605.08615"},"observation_digest":"sha256:468d20a7ec65cc9e4d2282aa79178f6da04053ecc517469ec0dcaef07ebf54c1","observation_id":"d0731c74-22b5-4542-b309-6cb7d22fe4bc","resolution":{"observed_at":"2026-05-14T09:33:26.459781Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"0731bd60-03ec-44fb-8b3d-bde4d70a1d34","year":2021},"citing_paper":{"arxiv_id":"2605.08615","last_updated":"2026-05-09T02:18:59Z","snapshot_observed_at":"2026-07-06T23:20:47.880233Z","submitted_at":"2026-05-09T02:18:59Z","title":"DSPE: An Energy-Efficient Edge Processor for DeepSeek Inference with MerkleTree-based Incremental Pruning, Multi-Stage Boothing Lookup and Dynamic Adaptive Posit Processing","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-12T00:53:54.878244Z"},"links":{"citing_paper":"/paper/2605.08615"},"observation_digest":"sha256:f43894039ede5cfd0bf6279d7d8a4e800a3074a31747482f831589646924730f","observation_id":"d13e7eef-f18e-40d5-964f-8a68f7fcfcb8","resolution":{"observed_at":"2026-05-14T09:33:26.433667Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"4570625a-dfed-4e49-8ef8-4e0a2e485a78","year":2022},"citing_paper":{"arxiv_id":"2605.08615","last_updated":"2026-05-09T02:18:59Z","snapshot_observed_at":"2026-07-06T23:20:47.880233Z","submitted_at":"2026-05-09T02:18:59Z","title":"DSPE: An Energy-Efficient Edge Processor for DeepSeek Inference with MerkleTree-based Incremental Pruning, Multi-Stage Boothing Lookup and Dynamic Adaptive Posit Processing","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-12T00:53:54.878244Z"},"links":{"citing_paper":"/paper/2605.08615"},"observation_digest":"sha256:4a40a874d0b79b017dc5a09bb3840488888519caa9001f48497bc7db05473ac0","observation_id":"0cf2f10d-159f-4f98-88d0-2f562c4c02ea","resolution":{"observed_at":"2026-05-14T09:33:26.438058Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"886d6302-1c6e-4053-8bd4-a90e9ed7c5b2","year":2023},"citing_paper":{"arxiv_id":"2605.08615","last_updated":"2026-05-09T02:18:59Z","snapshot_observed_at":"2026-07-06T23:20:47.880233Z","submitted_at":"2026-05-09T02:18:59Z","title":"DSPE: An Energy-Efficient Edge Processor for DeepSeek Inference with MerkleTree-based Incremental Pruning, Multi-Stage Boothing Lookup and Dynamic Adaptive Posit Processing","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-12T00:53:54.878244Z"},"links":{"citing_paper":"/paper/2605.08615"},"observation_digest":"sha256:dc18445241966b2ebfe4473042f039f70d9511fb98a3ef3587eac5f504161f91","observation_id":"69f0a743-aee2-4ac6-814d-404ecc36ffbe","resolution":{"observed_at":"2026-05-14T09:33:26.442654Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"02598e7c-c24a-4af2-a9ff-3328d2b8c365","year":2023},"citing_paper":{"arxiv_id":"2605.08615","last_updated":"2026-05-09T02:18:59Z","snapshot_observed_at":"2026-07-06T23:20:47.880233Z","submitted_at":"2026-05-09T02:18:59Z","title":"DSPE: An Energy-Efficient Edge Processor for DeepSeek Inference with MerkleTree-based Incremental Pruning, Multi-Stage Boothing Lookup and Dynamic Adaptive Posit Processing","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-12T00:53:54.878244Z"},"links":{"citing_paper":"/paper/2605.08615"},"observation_digest":"sha256:4d439b4ebb51a59b1f11a1568bf33e72d22a7aef72e43d6acfc815dbd876aca5","observation_id":"0b00c995-602e-47fa-ac5e-b75ae094836b","resolution":{"observed_at":"2026-05-14T09:33:26.446789Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.08615","last_updated":"2026-05-09T02:18:59Z","latest_version":1,"primary_category":"cs.AR","snapshot_observed_at":"2026-07-06T23:20:47.880233Z","submitted_at":"2026-05-09T02:18:59Z","title":"DSPE: An Energy-Efficient Edge Processor for DeepSeek Inference with MerkleTree-based Incremental Pruning, Multi-Stage Boothing Lookup and Dynamic Adaptive Posit Processing"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":0,"verified_exact":2,"verified_fuzzy":16},"total_outbound_references":20},"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-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+00:00","source":"retraction_watch"}],"thesis":"As of 22 July 2026, this Paper Citation Record lists 20 of 20 outbound references and 0 inbound Pith citation observations for arXiv:2605.08615."}