{"as_of":"2026-08-19T15:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:20ed90572de7f75be1e87031ce3c8139c64c3cbb93a8eddeedfbe57826a72ee3","coverage":[{"denominator":119,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T18:00:23.150401Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"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/2509.10372/citation-record","integrity":"/paper/2509.10372/integrity","json":"/paper/2509.10372/citation-record.json","paper":"/paper/2509.10372"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:00:22.673920Z","title":null,"venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.673920Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:d5b57943e23b6c2641d9070580c48be84b640ff4b32a9f92dcacd7ac262b1c66","observation_id":"899ca41c-0435-4cae-bd00-5e63e485cd69","resolution":{"observed_at":"2026-08-04T18:00:22.673920Z","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-04T18:00:22.678683Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.678683Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:ef062f18745b8ce94e938b394b9f58fef58493ae13f251e3b543405c934e8b8b","observation_id":"7d750f67-68f3-4aa8-aff4-e4342e498875","resolution":{"observed_at":"2026-08-04T18:00:22.678683Z","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-04T18:00:22.683446Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.683446Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:c5383ac1c6b0b5c8c6791bab72ab3da9860589455e445bbec097f97f479aa89d","observation_id":"dd05b149-b7b1-483e-9f88-bdb0a56f1e1b","resolution":{"observed_at":"2026-08-04T18:00:22.683446Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.10403","last_updated":"2023-09-13T20:35:45Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-05-17T17:46:53Z","title":"PaLM 2 Technical Report","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.10403","snapshot_observed_at":"2026-08-04T18:00:22.687556Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.687556Z"},"links":{"cited_paper":"/paper/2305.10403","citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:2fcdbb34803be1b03af84c29be71a5babe9ac6d89761c2b702553b5633985e51","observation_id":"78218767-5253-4b2a-888f-b4c755745d68","resolution":{"observed_at":"2026-08-04T18:00:22.687556Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2108.07732","last_updated":"2021-08-16T03:57:30Z","snapshot_observed_at":"2026-08-15T17:40:38.050939Z","submitted_at":"2021-08-16T03:57:30Z","title":"Program Synthesis with Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.07732","snapshot_observed_at":"2026-08-04T18:00:22.692220Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.692220Z"},"links":{"cited_paper":"/paper/2108.07732","citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:6a21f33fbac5ad56c7ab70260a52962caf41f227e8c70226b3998cba4e17602f","observation_id":"46401148-68de-4db3-a450-9f242acc34f0","resolution":{"observed_at":"2026-08-04T18:00:22.692220Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.16609","last_updated":"2023-09-28T17:07:49Z","snapshot_observed_at":"2026-08-09T21:25:20.369782Z","submitted_at":"2023-09-28T17:07:49Z","title":"Qwen Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.16609","snapshot_observed_at":"2026-08-04T18:00:22.696730Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.696730Z"},"links":{"cited_paper":"/paper/2309.16609","citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:be1e4e568cc42e01a3299c153286216e7448dd596df6bdd44d7e580e4631c3d0","observation_id":"244f2555-efe6-470a-8389-3bc0216bb22a","resolution":{"observed_at":"2026-08-04T18:00:22.696730Z","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-04T18:00:22.701669Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.701669Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:afb988a74ae9d62eb1e3d3631d5dc1e12e68784cb26b9737b3df7ea1a8ff0969","observation_id":"cfda3c83-9fbd-4222-aaec-2da690b97ab2","resolution":{"observed_at":"2026-08-04T18:00:22.701669Z","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-04T18:00:22.705631Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.705631Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:94047d9c7a3ca667a60592bddb0237e02100e45e41cbe4cc18adf1f4352ee44b","observation_id":"fecb0c16-3cc7-4d6f-9777-1672bc05749e","resolution":{"observed_at":"2026-08-04T18:00:22.705631Z","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-04T18:00:22.709408Z","title":"Yu, Qiang Yang, and Xing Xie","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.709408Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:6d1dd07f042bff9c0ad6814d76df0402c5a4eff1d7dc65ebb9c2057425f9f390","observation_id":"e71194bc-6a3d-4f03-9427-5a5452df3de8","resolution":{"observed_at":"2026-08-04T18:00:22.709408Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2107.03374","last_updated":"2021-07-14T17:16:02Z","snapshot_observed_at":"2026-08-08T11:58:24.516369Z","submitted_at":"2021-07-07T17:41:24Z","title":"Evaluating Large Language Models Trained on Code","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.03374","snapshot_observed_at":"2026-08-04T18:00:22.713553Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.713553Z"},"links":{"cited_paper":"/paper/2107.03374","citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:727b72b03ae215aad5479022df210adedbbe34a31a81711c8b8d0c370d5ac428","observation_id":"c8097d5d-b60c-4b5e-953e-7ad34d1da445","resolution":{"observed_at":"2026-08-04T18:00:22.713553Z","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-04T18:00:22.718044Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.718044Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:3c0d316708701c0216b974ea94c53063a81db8e99acf3d26d970cc8ebdacb284","observation_id":"b0d6700e-d38b-415b-a225-2bda823be649","resolution":{"observed_at":"2026-08-04T18:00:22.718044Z","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-04T18:00:22.721994Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.721994Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:2d06a27a6fc9b5dc2aee6d28448b652914a6aebeb537f88864c5935f6b96ccdc","observation_id":"2afef43b-d544-4ca7-83f5-c76a01d17525","resolution":{"observed_at":"2026-08-04T18:00:22.721994Z","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-04T18:00:22.730064Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.730064Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:4a24b32506cdd2b028be9ee1f3de7dd6f72aeab57faeab8d46640623b7c29a59","observation_id":"696d3d5a-96ab-49cc-abf4-c1c4fdba8801","resolution":{"observed_at":"2026-08-04T18:00:22.730064Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1706.00504","last_updated":"2017-06-01T21:57:32Z","snapshot_observed_at":"2026-08-15T21:10:04.465620Z","submitted_at":"2017-06-01T21:57:32Z","title":"Dynamic Stripes: Exploiting the Dynamic Precision Requirements of Activation Values in Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.00504","snapshot_observed_at":"2026-08-04T18:00:22.734137Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.734137Z"},"links":{"cited_paper":"/paper/1706.00504","citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:a16a67eadb31e79d1c87390b0a78a0c3672f8019f3a9e4c960d2d433c021d8f0","observation_id":"ff75796a-d969-4be6-a65a-b1cb02486804","resolution":{"observed_at":"2026-08-04T18:00:22.734137Z","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-04T18:00:22.738283Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.738283Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:47f5b8abba661927a3ab23e7be72245bce65aab1ec1c23e7c6a8b2bd1ff913eb","observation_id":"dde259e0-12f5-4ddf-8228-2622b62133ef","resolution":{"observed_at":"2026-08-04T18:00:22.738283Z","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-04T18:00:22.742346Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.742346Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:60cbc1b6d71235e37fb3194d89642459df767ecffa3bac00d68e1b48156c9399","observation_id":"da7d145d-e336-4b16-ade6-f7e5fc02ffbc","resolution":{"observed_at":"2026-08-04T18:00:22.742346Z","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-04T18:00:22.746252Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.746252Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:8aeefd1939cf39e3907594785a3a650cbaa19ddaca68ff105cb5613fb8599a67","observation_id":"573c06e2-e199-4ed2-958b-14fea60daafc","resolution":{"observed_at":"2026-08-04T18:00:22.746252Z","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-04T18:00:22.750463Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.750463Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:a33d93c3134cbd9a2c4f614f53ab0a1dbfa4931995b436e7d77c76c8dd93a8d9","observation_id":"29d433e2-3bdd-4125-8013-7e3726002579","resolution":{"observed_at":"2026-08-04T18:00:22.750463Z","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-04T18:00:22.754519Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.754519Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:0a237b65082b7ef2bd9766857f971c00b2572f0c02e5b57769dd2cafab8f3b2b","observation_id":"3b08d5a6-fba7-438e-82bd-6f71eb2000e4","resolution":{"observed_at":"2026-08-04T18:00:22.754519Z","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-04T18:00:22.759124Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.759124Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:e5d2dec4bff64e8095769ee20d22b919ff3731fdecdb090036fd067317fe1584","observation_id":"38541c56-4f60-455a-9844-74bb7773933d","resolution":{"observed_at":"2026-08-04T18:00:22.759124Z","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-04T18:00:22.763200Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.763200Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:1724a4b0c2a085f9447e1a218b2435c6335991706361e2e4d3cdc1b516e295db","observation_id":"10e348b1-c6d8-43e6-94b5-eb9543635f78","resolution":{"observed_at":"2026-08-04T18:00:22.763200Z","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-04T18:00:22.767989Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.767989Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:6d18a7c37f7066e0e933ff7394ee88c926b8ec185e33980fd839e02e095db663","observation_id":"f854843d-d0a9-4a5a-b03a-7bb271c5266d","resolution":{"observed_at":"2026-08-04T18:00:22.767989Z","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-04T18:00:22.772749Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.772749Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:9fabe02f89c7d03bb73d0c4bc7bd5fb3fe0fb653aae3769d78ef52d8504c0cbd","observation_id":"a015a98b-2f82-4353-b091-2c7161bc9963","resolution":{"observed_at":"2026-08-04T18:00:22.772749Z","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-04T18:00:22.781601Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.781601Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:3d0bb7ddeb5f33fb118e0265b5b7b3b6a4b5530ca9b35e2f011cc72bfb6fb0db","observation_id":"1ab890a0-6806-49af-a8f5-d49308611d76","resolution":{"observed_at":"2026-08-04T18:00:22.781601Z","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-04T18:00:22.785841Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.785841Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:2bc913a188aae63ae9971b339787d7b793b352a63739d2bde953297724f3da45","observation_id":"4af4ecc5-9d7d-41aa-a2cc-f85a2266a33b","resolution":{"observed_at":"2026-08-04T18:00:22.785841Z","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-04T18:00:22.790123Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.790123Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:6c81e374d8384243d4c80ee44a07248d53e6d6e0ee2c84d4157399aea042c09e","observation_id":"bc4c9b6c-1991-4b95-8e69-b79e7102906a","resolution":{"observed_at":"2026-08-04T18:00:22.790123Z","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-04T18:00:22.794524Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.794524Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:5577c20c72bcb885cfb8b309eddb84f9edcf9cc2aa91f1f25d48d3e624948cf7","observation_id":"bd2f0c50-779c-4666-a339-bba8b97fe371","resolution":{"observed_at":"2026-08-04T18:00:22.794524Z","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-04T18:00:22.799419Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.799419Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:b07cd9b05a7aa2591a521abe99f1b24fe95725b2d5c3a3a17fdb2e38e3d4bd62","observation_id":"a6876353-12fe-4cca-a86b-ac7801f2729e","resolution":{"observed_at":"2026-08-04T18:00:22.799419Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1510.00149","last_updated":"2016-02-15T06:25:40Z","snapshot_observed_at":"2026-08-04T16:59:47.843960Z","submitted_at":"2015-10-01T09:03:44Z","title":"Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Coding","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1510.00149","snapshot_observed_at":"2026-08-04T18:00:22.803818Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.803818Z"},"links":{"cited_paper":"/paper/1510.00149","citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:3b07814805cf5c871c0121f133f0698596912ef723dea15e233a6fd386068f1c","observation_id":"ff015d7a-bd3c-4a89-9b6d-1e7da8cbf7ef","resolution":{"observed_at":"2026-08-04T18:00:22.803818Z","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-04T18:00:22.809343Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.809343Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:8a1ab8d5b17c7a52633bd5e3c0e5711659ed218e88e53d5a95d1c3115612d844","observation_id":"d7eab06a-ffa1-4688-a1bb-76c0e6956949","resolution":{"observed_at":"2026-08-04T18:00:22.809343Z","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-04T18:00:22.813945Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.813945Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:1aacb1c0273aa4e4b321e9e789de54c86d86e2f5307f756a63dfdef20626167b","observation_id":"dae115f8-4633-4d1c-bd75-7ea6be4bd7a9","resolution":{"observed_at":"2026-08-04T18:00:22.813945Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.03300","last_updated":"2021-01-12T18:57:11Z","snapshot_observed_at":"2026-08-13T20:44:28.824685Z","submitted_at":"2020-09-07T17:59:25Z","title":"Measuring Massive Multitask Language Understanding","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.03300","snapshot_observed_at":"2026-08-04T18:00:22.819198Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.819198Z"},"links":{"cited_paper":"/paper/2009.03300","citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:dd1a995e760ed931391c1329470bc88e781bebee683f205d37bcdb63033f85bc","observation_id":"58e46372-3cbc-4886-b595-5df88085add8","resolution":{"observed_at":"2026-08-04T18:00:22.819198Z","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-04T18:00:22.823358Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.823358Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:81cdfda5eada8e0c9b372528c307cae2e1f66db08a098b4b994c5953d86322f9","observation_id":"bfc4e4ad-065f-4eff-8109-cb4d4260af2f","resolution":{"observed_at":"2026-08-04T18:00:22.823358Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.19353","last_updated":"2025-03-25T05:03:56Z","snapshot_observed_at":"2026-08-16T12:47:06.455534Z","submitted_at":"2025-03-25T05:03:56Z","title":"QUAD: Quantization and Parameter-Efficient Tuning of LLM with Activation Decomposition","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.19353","snapshot_observed_at":"2026-08-04T18:00:22.827837Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.827837Z"},"links":{"cited_paper":"/paper/2503.19353","citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:3494770ace788393deed95e294268a1cc384e4dbc075b28ef061ec244be9a254","observation_id":"4a287cb0-2fd5-42f1-ba8e-ecc0fc29a82a","resolution":{"observed_at":"2026-08-04T18:00:22.827837Z","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-04T18:00:22.832504Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.832504Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:22c5430804db568e7dedae14c2ce2358e49746c6316984245076cf9c424c0356","observation_id":"f21f294d-974e-43d8-883d-b2a280cd3a73","resolution":{"observed_at":"2026-08-04T18:00:22.832504Z","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-04T18:00:22.836647Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.836647Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:42e3ecd5d01cba4488533e3f0d0da2f750eeb96f2a702191d856f4eb13cfc677","observation_id":"d1809d9e-38e8-4c65-92b9-2bceb93621a7","resolution":{"observed_at":"2026-08-04T18:00:22.836647Z","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-04T18:00:22.840972Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.840972Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:016a47abbf5c186752d008327e03283177668e73530015e31f762369b751ee3b","observation_id":"9e674fcc-c38c-455a-aff8-9ac191f6f1db","resolution":{"observed_at":"2026-08-04T18:00:22.840972Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.10059","last_updated":"2024-12-13T11:44:09Z","snapshot_observed_at":"2026-08-15T16:13:57.246396Z","submitted_at":"2024-12-13T11:44:09Z","title":"Panacea: Novel DNN Accelerator using Accuracy-Preserving Asymmetric Quantization and Energy-Saving Bit-Slice Sparsity","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.10059","snapshot_observed_at":"2026-08-04T18:00:22.845750Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.845750Z"},"links":{"cited_paper":"/paper/2412.10059","citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:140e18c812d1101627a77330c7e32349cc62ff9a05abb056a99ab2a8f48e4140","observation_id":"6e63e0d7-cc04-4ea7-8cdd-28a2c0b013f7","resolution":{"observed_at":"2026-08-04T18:00:22.845750Z","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-04T18:00:22.851068Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.851068Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:9c5309c0da31e22af48c7c744128ad292483d223d478a548bbc3177757bf6f0b","observation_id":"7bf399fa-df9e-4a52-b95a-846fd4185f5e","resolution":{"observed_at":"2026-08-04T18:00:22.851068Z","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-04T18:00:22.856114Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.856114Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:e9ce1742c8d6dbfc19fd6b7f59e5b41cd69a6f346559f4379ecb1ae3fa2708f6","observation_id":"643c32a2-0362-48f3-bbd7-92b4a3d96c9d","resolution":{"observed_at":"2026-08-04T18:00:22.856114Z","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-04T18:00:22.860787Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.860787Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:eac22a133bbe0fdebb219d307bb71375fcc0e05a426fab05cb5ccc0d6ea25c7a","observation_id":"1eec1e53-a308-4d3b-abfb-4f13d491d447","resolution":{"observed_at":"2026-08-04T18:00:22.860787Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.05100","last_updated":"2023-06-27T09:57:58Z","snapshot_observed_at":"2026-08-04T18:56:03.233715Z","submitted_at":"2022-11-09T18:48:09Z","title":"BLOOM: A 176B-Parameter Open-Access Multilingual Language Model","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.05100","snapshot_observed_at":"2026-08-04T18:00:22.865286Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.865286Z"},"links":{"cited_paper":"/paper/2211.05100","citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:9e60f9efeae5e5021f3c532c96d27d6c6a82df3224959e284eacf1dcb7d17ac6","observation_id":"34a7758d-c533-41a8-8511-8085578e43f9","resolution":{"observed_at":"2026-08-04T18:00:22.865286Z","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-04T18:00:22.870147Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.870147Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:69341d9eb009186417e2382ab1466bae0f4ea0e8cce1b622fee5a521d3152012","observation_id":"209e4494-3eef-4464-adc5-17c939638f41","resolution":{"observed_at":"2026-08-04T18:00:22.870147Z","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-04T18:00:22.874549Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.874549Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:816ddba2fad1199d5fe7b73dd646d69091095b0d95f926d6cdffd3591d307b9c","observation_id":"d5c4ff74-e9eb-425e-817c-04e290590319","resolution":{"observed_at":"2026-08-04T18:00:22.874549Z","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-04T18:00:22.879112Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.879112Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:0d898862c47f4af9924153a2037cd0f4247eb6e5f4a8386a281febe8601bcd2e","observation_id":"9f8ad665-b2b9-4ac9-9552-deaafdfbfedc","resolution":{"observed_at":"2026-08-04T18:00:22.879112Z","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-04T18:00:22.883780Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.883780Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:f38dbc1779bd7c41f388e02560f8757e4d7255492191320d17ced5bf318b6fe6","observation_id":"3602f6b2-d3be-47b2-860c-455096476455","resolution":{"observed_at":"2026-08-04T18:00:22.883780Z","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-04T18:00:22.888253Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.888253Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:2f56e8c2560b5c25ed28b01da7eb25678d3704c009ac7bf5714968f8803589af","observation_id":"50b6f901-3898-4c69-90c8-37b458a84721","resolution":{"observed_at":"2026-08-04T18:00:22.888253Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.10658","last_updated":"2025-01-18T05:27:25Z","snapshot_observed_at":"2026-08-16T13:40:20.965481Z","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.10658","snapshot_observed_at":"2026-08-04T18:00:22.893297Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.893297Z"},"links":{"cited_paper":"/paper/2501.10658","citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:322d2031b8d07e0e2948e8cc7ed54370fdcf301929556585f5cb496cbcbb8e8f","observation_id":"28d25403-e5eb-461c-858a-f3f9b86db23f","resolution":{"observed_at":"2026-08-04T18:00:22.893297Z","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-04T18:00:22.898104Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.898104Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:5fc212e4c8f05d462769e4e3e718a0d039126420534d8048a56d9bde120ba628","observation_id":"22b8579b-3caf-407c-ba35-edea6049df77","resolution":{"observed_at":"2026-08-04T18:00:22.898104Z","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-04T18:00:22.902412Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.902412Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:5fb0bc5acfd5d7644f8624ac241a14e08df6a8c1aaede2dcc6ec25ae92b9cf43","observation_id":"191e4194-8e0b-4bc4-b00b-9c532b2931c0","resolution":{"observed_at":"2026-08-04T18:00:22.902412Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.02669","last_updated":"2024-07-04T15:12:54Z","snapshot_observed_at":"2026-08-17T04:58:55.259763Z","submitted_at":"2024-01-05T06:53:00Z","title":"Infinite-LLM: Efficient LLM Service for Long Context with DistAttention and Distributed KVCache","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.02669","snapshot_observed_at":"2026-08-04T18:00:22.906958Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.906958Z"},"links":{"cited_paper":"/paper/2401.02669","citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:7d66b0e2b014c0e9b33c8c7bb7588fd17c78078c0173bc8ea1aaf57e596d3bb8","observation_id":"ad07febf-f548-439d-87dc-15467a593779","resolution":{"observed_at":"2026-08-04T18:00:22.906958Z","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-04T18:00:22.911672Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.911672Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:b09e7bee02f4da978ba99676aca5c55aa82996badfd04bbe2a2c9ad50f548f62","observation_id":"8cd3cccd-c055-45da-b884-9545dc57b17e","resolution":{"observed_at":"2026-08-04T18:00:22.911672Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.08041","last_updated":"2024-04-06T10:22:57Z","snapshot_observed_at":"2026-08-16T14:52:50.059474Z","submitted_at":"2023-10-12T05:25:49Z","title":"QLLM: Accurate and Efficient Low-Bitwidth Quantization for Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.08041","snapshot_observed_at":"2026-08-04T18:00:22.916334Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.916334Z"},"links":{"cited_paper":"/paper/2310.08041","citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:2154c6d0d9c2d7d0cdd939fcb7967f1cd1d4ace5e9af7e749b0108d4eaf0187f","observation_id":"31834f89-43df-4f5c-98ca-e7943060c11a","resolution":{"observed_at":"2026-08-04T18:00:22.916334Z","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-04T18:00:22.921305Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.921305Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:5bd1ac57e9c81e9bb41f79824cbd4ce47dcbcb22dccf8d2cc88d5b08c28c800e","observation_id":"579a2d3e-09e7-4d7f-9349-32331e6a7a98","resolution":{"observed_at":"2026-08-04T18:00:22.921305Z","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-04T18:00:22.925694Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.925694Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:d48cac1dcee22280f724d5cbfaa52ab6068bcff708e72c7fa11138575b242c47","observation_id":"d09ce35b-c5ca-42aa-a0f5-6a9b3acba461","resolution":{"observed_at":"2026-08-04T18:00:22.925694Z","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-04T18:00:22.930405Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.930405Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:8bde3338d33618cce62d5a6e408f870f92de2e210094dcf55ecc0bff01be7fc5","observation_id":"e893339d-bc3e-40a3-832b-0547094fe946","resolution":{"observed_at":"2026-08-04T18:00:22.930405Z","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-04T18:00:22.935190Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.935190Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:d03a7e526ab72d2e49830db04dd51fa85e40eb734f58342ec14c41049917e289","observation_id":"0e0b1dd7-d078-48a8-a711-d6f8151ea004","resolution":{"observed_at":"2026-08-04T18:00:22.935190Z","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-04T18:00:22.939872Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.939872Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:183475c092c2e96f0f7befd60793d38da319978676e3ff3cfd2b0a7f6c3f6f67","observation_id":"d5cd1cd4-668c-4af1-b288-59fa9f715442","resolution":{"observed_at":"2026-08-04T18:00:22.939872Z","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-04T18:00:22.944408Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.944408Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:615dfdf093c14187b7806f6bfe3ead0393b467642173e35990345cd985d25a91","observation_id":"8d6d2567-cf6d-4376-a704-ce77e6209033","resolution":{"observed_at":"2026-08-04T18:00:22.944408Z","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-04T18:00:22.948978Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.948978Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:1593f787e8aefa7d04a0305e15826c805354b0333527fa202c42836b03b5302d","observation_id":"a712890c-a081-446f-af48-c7bcb80caa3f","resolution":{"observed_at":"2026-08-04T18:00:22.948978Z","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-04T18:00:22.953534Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.953534Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:a8feffe9d79d7805cd466918d8b4d38544bff781d42496f57bceec4565e87936","observation_id":"7982b81f-9080-4f56-8886-35ef7d8c2178","resolution":{"observed_at":"2026-08-04T18:00:22.953534Z","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-04T18:00:22.958026Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.958026Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:99e52aaf5a3c602cdb995a88e3a24ab4ef465b72e0dd006098297944b0783e28","observation_id":"0ce4e096-674e-4324-853e-ac62f68f8ae4","resolution":{"observed_at":"2026-08-04T18:00:22.958026Z","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-04T18:00:22.962120Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.962120Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:f0cfff1de760e9d138b2f35363477f25c48f111495dfe8dfce06534160498c63","observation_id":"9d975148-8629-482b-b7f6-ab80978a97d1","resolution":{"observed_at":"2026-08-04T18:00:22.962120Z","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-04T18:00:22.966613Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.966613Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:4dae370ed0699e591badf7361974510b208e98b0cc148c867300a8e0866b3d47","observation_id":"3fd967c4-d955-4309-84fa-73241ef96be9","resolution":{"observed_at":"2026-08-04T18:00:22.966613Z","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-04T18:00:22.970843Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.970843Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:8c8afcf99c48b33979346f5e834073cbdbcb78f742e234ee5d99455f03c90d4f","observation_id":"91e80b67-de71-499d-b8e5-cf869831861c","resolution":{"observed_at":"2026-08-04T18:00:22.970843Z","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-04T18:00:22.975477Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.975477Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:3b822531ae634a395449e0f6cdaedb1be86548ce6e09f2f256a6f64dfaa2b6c2","observation_id":"047eeaae-b20c-4245-9b8c-033c56724586","resolution":{"observed_at":"2026-08-04T18:00:22.975477Z","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-04T18:00:22.980161Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.980161Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:92102b96b4fa608d5ccb6384c4485066edb81ae417e5cc65cb7a03fae9772d99","observation_id":"65412886-f51e-4695-9636-1501d32b7037","resolution":{"observed_at":"2026-08-04T18:00:22.980161Z","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-04T18:00:22.984892Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.984892Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:f7d24852ed83db396be0896d0d624d0af787a4938301a40ccf813e82b21dea42","observation_id":"dec2b104-2085-400f-9721-d1f009ea3a08","resolution":{"observed_at":"2026-08-04T18:00:22.984892Z","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-04T18:00:22.989389Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.989389Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:88a8bec2ba3b6b3438ec61fd672769fb650074820bfb612e6dd6dea8f080245c","observation_id":"f5b88b6e-ff80-4623-acd1-f309adb594fb","resolution":{"observed_at":"2026-08-04T18:00:22.989389Z","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-04T18:00:22.999203Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:22.999203Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:d29998b15a75c5ce23e36c4c622ccb9300be1a5ac6413029002634f4abf415ce","observation_id":"9113bdfc-f1d2-41f7-800a-733d5cc0382d","resolution":{"observed_at":"2026-08-04T18:00:22.999203Z","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-04T18:00:23.003915Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:23.003915Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:632aab5ca3730fb215c2e338cddd1f3b5a380d6c690d06a87890a9a2810e9050","observation_id":"49ea5eaf-9067-4c51-aa46-87579cdab054","resolution":{"observed_at":"2026-08-04T18:00:23.003915Z","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-04T18:00:23.008315Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:23.008315Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:e1d14f9d9d0b5b9212f92228ae594c723057bd820f86ee336a197fa7167198d4","observation_id":"2d49f7ae-6799-4dba-9179-841404768f83","resolution":{"observed_at":"2026-08-04T18:00:23.008315Z","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-04T18:00:23.012968Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:23.012968Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:bfc450b4bce3e37b6e480819fc8a4eea0841af7c6d792a13925120c5b608e385","observation_id":"80c96b1d-4b6c-4140-85e4-c1713fa325fa","resolution":{"observed_at":"2026-08-04T18:00:23.012968Z","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-04T18:00:23.017372Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:23.017372Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:f9e6482ecaf1218e5dd83a5a90e1fa7846a5cdaa46e0499ce479e5c08150dfd0","observation_id":"6f1ee95a-608e-4bd5-9e21-67b81ca9b2f0","resolution":{"observed_at":"2026-08-04T18:00:23.017372Z","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-04T18:00:23.022048Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:23.022048Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:7142a4f7c8a2afb76fccbe855fcc5c61bda3f42d4bef3053774885bfb9acfcf3","observation_id":"b6f823fd-7c80-48f2-ace5-82c61e278766","resolution":{"observed_at":"2026-08-04T18:00:23.022048Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.12950","last_updated":"2024-01-31T19:47:26Z","snapshot_observed_at":"2026-08-18T03:59:39.242039Z","submitted_at":"2023-08-24T17:39:13Z","title":"Code Llama: Open Foundation Models for Code","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.12950","snapshot_observed_at":"2026-08-04T18:00:23.026825Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:23.026825Z"},"links":{"cited_paper":"/paper/2308.12950","citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:f2b07fdc9063805c82f7047a73e60074716f38f36504fbaa9069374b78a4456a","observation_id":"52d0c5f9-f28f-406f-9027-5576193eefaf","resolution":{"observed_at":"2026-08-04T18:00:23.026825Z","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-04T18:00:23.032621Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:23.032621Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:5e772783749ea39ceedce59586cc95e95e29d7e7b09627b73912ba3caabc03d5","observation_id":"d3b71530-5557-47db-9ee6-6426d5a8f207","resolution":{"observed_at":"2026-08-04T18:00:23.032621Z","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-04T18:00:23.037048Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:23.037048Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:bf2c61e1b3bda8fa784fd0fe967f365b151a285832c0fdf996faffee663374dc","observation_id":"f9e92675-e0fb-4208-b993-97cd8b50058e","resolution":{"observed_at":"2026-08-04T18:00:23.037048Z","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-04T18:00:23.041876Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:23.041876Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:03ed6ee899fd9dc9803d86e8def6114385c1521cb058ea317af142db0cc5937f","observation_id":"7c6be9d8-f931-478a-9e92-6a81a71e6585","resolution":{"observed_at":"2026-08-04T18:00:23.041876Z","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-04T18:00:23.046362Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:23.046362Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:56ce58395a2bb27c04117ad4874f3c62dc215191e3150f879f1d7fdca01795c2","observation_id":"4403e714-4a21-4c7b-859a-94b8ae02afc3","resolution":{"observed_at":"2026-08-04T18:00:23.046362Z","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-04T18:00:23.056429Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:23.056429Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:58dae6429e4298239658520e91f2599738ecfe9c2a645af0043ca3f28d02c56b","observation_id":"91bb5eaf-cc71-4527-af23-74b910b614dd","resolution":{"observed_at":"2026-08-04T18:00:23.056429Z","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-04T18:00:23.061406Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:23.061406Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:c8769f5bed27b186464eeba792887b9cb96f54a98c39e75bfb4b4d4efd14a947","observation_id":"eddaa143-4e08-44d0-bc9e-6898e8b778ce","resolution":{"observed_at":"2026-08-04T18:00:23.061406Z","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-04T18:00:23.066128Z","title":null,"venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:23.066128Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:19e07c2f65e56b5cb49b7c39622593a826ce38187ace9b2cf52f40a4458fd7c3","observation_id":"51091a6a-76d2-4934-a36c-f21e3afcabd4","resolution":{"observed_at":"2026-08-04T18:00:23.066128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.04623","last_updated":"2023-08-08T23:29:55Z","snapshot_observed_at":"2026-08-16T16:45:25.532419Z","submitted_at":"2023-08-08T23:29:55Z","title":"Accelerating LLM Inference with Staged Speculative Decoding","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.04623","snapshot_observed_at":"2026-08-04T18:00:23.070830Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:23.070830Z"},"links":{"cited_paper":"/paper/2308.04623","citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:ac0e2ffae3754a1a0920b4a32056a67c952f65e4d0c58881fa3209cecbb6d24d","observation_id":"bffb920d-7ab7-4387-aa4f-1f8b83e64e53","resolution":{"observed_at":"2026-08-04T18:00:23.070830Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.15887","last_updated":"2023-06-28T03:03:51Z","snapshot_observed_at":"2026-08-16T15:20:34.029231Z","submitted_at":"2023-06-28T03:03:51Z","title":"Beyond the Hype: Assessing the Performance, Trustworthiness, and Clinical Suitability of GPT3.5","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.15887","snapshot_observed_at":"2026-08-04T18:00:23.075462Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:23.075462Z"},"links":{"cited_paper":"/paper/2306.15887","citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:efde71670ed81aa1a6d3d94bb4321df962ac37f71e0b698627e5f393f792db2a","observation_id":"6e11e3ca-90f5-4092-a26b-706a4a4183c0","resolution":{"observed_at":"2026-08-04T18:00:23.075462Z","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-04T18:00:23.080654Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:23.080654Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:e53182d3023607e495da956885015e8258406237e54d093625c30b43a2c810be","observation_id":"6bcfeed1-f636-42f4-9f78-986663362244","resolution":{"observed_at":"2026-08-04T18:00:23.080654Z","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-04T18:00:23.085319Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:23.085319Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:f2fc72df35ebf0a6937eb0cf825b98bdb449d982b0ef3e7fed2baf3a23ed7333","observation_id":"fee52e96-c450-4a32-a6a2-b863b53ac494","resolution":{"observed_at":"2026-08-04T18:00:23.085319Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.09288","last_updated":"2023-07-19T17:08:59Z","snapshot_observed_at":"2026-08-07T12:56:43.323460Z","submitted_at":"2023-07-18T14:31:57Z","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.09288","snapshot_observed_at":"2026-08-04T18:00:23.089946Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:23.089946Z"},"links":{"cited_paper":"/paper/2307.09288","citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:528f77c3c8b936707546750a498a70bddd5ef4150d6199efc8ffe2bd35caa2b0","observation_id":"a53a29f5-4e5d-4c76-9c63-834b242e0ba0","resolution":{"observed_at":"2026-08-04T18:00:23.089946Z","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-04T18:00:23.094994Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:23.094994Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:0563d3e414cf6ceaefd0269b13d728720d3687a4d335dad976a342497f2e17eb","observation_id":"b79ed396-6eef-46ec-9efe-8e7de7d2db44","resolution":{"observed_at":"2026-08-04T18:00:23.094994Z","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-04T18:00:23.099434Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:23.099434Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:281cdd3f429c26fc3a51b8f8febbce2678ec8c4c14831419561543ba40ac8efa","observation_id":"66a4b78c-92ad-4f27-89f3-609011676fe2","resolution":{"observed_at":"2026-08-04T18:00:23.099434Z","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-04T18:00:23.103813Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:23.103813Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:fb0ea68d473f4a25fe6cc91022a41922d09854243f5fef5a921f7cf1cf1a3d06","observation_id":"72ade34c-a2de-4336-b696-9b620b69af78","resolution":{"observed_at":"2026-08-04T18:00:23.103813Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.10416","last_updated":"2024-07-15T03:44:33Z","snapshot_observed_at":"2026-08-16T13:34:17.926330Z","submitted_at":"2024-07-15T03:44:33Z","title":"SOFA: A Compute-Memory Optimized Sparsity Accelerator via Cross-Stage Coordinated Tiling","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.10416","snapshot_observed_at":"2026-08-04T18:00:23.108339Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:23.108339Z"},"links":{"cited_paper":"/paper/2407.10416","citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:a325fbe756626a2512db4630f9cf2730e869c72cea9df33171e8a2e5e9dc32fd","observation_id":"3e17a2d6-08e1-445e-b27f-68c4c169fc46","resolution":{"observed_at":"2026-08-04T18:00:23.108339Z","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-04T18:00:23.113017Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:23.113017Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:d79de2fb3eaafa52548a098897a7277b7163d0ebc18c55e4fabd01a344f5d0cb","observation_id":"f689bc78-4cda-466e-8fea-1cb19b4dfa14","resolution":{"observed_at":"2026-08-04T18:00:23.113017Z","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-04T18:00:23.122814Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:23.122814Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:f04a0aaa8edfd04313eaf7037b31d5a33dcd62b31281091d22ee8cf0a674008c","observation_id":"9e7af661-3d03-413b-b82c-65fdb629acb8","resolution":{"observed_at":"2026-08-04T18:00:23.122814Z","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-04T18:00:23.127293Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:23.127293Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:713412a9d9337fd86f7dca66b0273f6b485f9dd3d328ae8edbcf28cd3cb02632","observation_id":"761905dd-433e-435a-bd7f-c0fbba124e73","resolution":{"observed_at":"2026-08-04T18:00:23.127293Z","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-04T18:00:23.132183Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:23.132183Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:fc78873cd04ca76a947e13f53c5dea188c74129ce994656bb148cdd151051a33","observation_id":"c2e44030-76f2-48ad-b0bb-6a5886f66636","resolution":{"observed_at":"2026-08-04T18:00:23.132183Z","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-04T18:00:23.136815Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:23.136815Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:809f8400c61cdf922a2b62c193cfed409303fd6b008180a597ba76a5c3101063","observation_id":"40460c05-1fb9-4d64-b245-4b0a190bf6b5","resolution":{"observed_at":"2026-08-04T18:00:23.136815Z","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-04T18:00:23.141659Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":98,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:23.141659Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:a2c848b8d4cd42eb8711ba76964dabb479bcda5522bc862128d2ab99963667cc","observation_id":"c21e31e9-24e5-462c-829e-cceb7772fbd1","resolution":{"observed_at":"2026-08-04T18:00:23.141659Z","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-04T18:00:23.145984Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:23.145984Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:98e0454c7b8ea97d0485cb9bc41bb65261362031082c88e164412dd39f40d5eb","observation_id":"1d4ab064-583e-4917-903d-21c37520bfd6","resolution":{"observed_at":"2026-08-04T18:00:23.145984Z","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-04T18:00:23.150401Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","version":1},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-04T18:00:23.150401Z"},"links":{"citing_paper":"/paper/2509.10372"},"observation_digest":"sha256:66a296c6f3ccffde38d33ca5e429f732c2a97b92d60b1d7b504f81e47e2c1e3d","observation_id":"474c2870-0281-4b51-a160-5a5cabca90f5","resolution":{"observed_at":"2026-08-04T18:00:23.150401Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2509.10372","last_updated":"2025-09-12T16:05:27Z","latest_version":1,"primary_category":"cs.AR","snapshot_observed_at":"2026-08-17T23:35:19.032850Z","submitted_at":"2025-09-12T16:05:27Z","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":100,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":119},"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 100 of 119 outbound references and 0 inbound Pith citation observations for arXiv:2509.10372."}