{"as_of":"2026-08-20T00:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b4ed3eac2312a5b9af217b206c0bd35d7b77efe9d06fdf6652e6b716bad86e9d","coverage":[{"denominator":89,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":89,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T17:29:58.715647Z","state":"measured"},{"denominator":89,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":89,"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.10934/citation-record","integrity":"/paper/2509.10934/integrity","json":"/paper/2509.10934/citation-record.json","paper":"/paper/2509.10934"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:29:51.527772Z","title":"[Online]","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:51.527772Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:a7fb8b0161f6913b7d96882ce2dd6f3b4d9cce33096bfa731ce5db116e1b82b4","observation_id":"0589fc76-0aba-497c-807f-a12b5f448140","resolution":{"observed_at":"2026-08-04T17:29:51.527772Z","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-04T17:29:51.637843Z","title":"Lofreq poisson binomial distribution implementation","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:51.637843Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:69dd61b11c9d5bdecf912461f7367165a01c7ab981d306ac307a95dea52c7eb1","observation_id":"7d66c6a9-b0f2-4777-b3e8-6810cf10cbeb","resolution":{"observed_at":"2026-08-04T17:29:51.637843Z","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-04T17:29:51.736598Z","title":"[Online]","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:51.736598Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:a1ce17b886b542545eb76ddabd9be181cf2659cfa549e197d41211fa552cb47a","observation_id":"2b06a620-02eb-4e15-aa80-57d68789a17d","resolution":{"observed_at":"2026-08-04T17:29:51.736598Z","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-04T17:29:51.815646Z","title":"Stan poisson binomial distribution implementation","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:51.815646Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:326c5e86a30c5bd1fdf8b82e0129549feaf48923cd0fb1265409c4df9aa6be23","observation_id":"073128f4-8363-4a69-9521-eaea25b8dd0e","resolution":{"observed_at":"2026-08-04T17:29:51.815646Z","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-04T17:29:51.892649Z","title":"Ieee standard for floating-point arithmetic,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:51.892649Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:2b6ae1be3e42c28d076037daece531342e1655c29270b400fbf9cd33e7aa26c8","observation_id":"22671a91-ba3d-48e2-97de-06870591eb5e","resolution":{"observed_at":"2026-08-04T17:29:51.892649Z","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-04T17:29:52.006774Z","title":"Low-precision logarithmic number systems: beyond base-2,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:52.006774Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:7744ad670422f88f8c5b809dc72f15b4d04a9583f72f70395f072e318df3530e","observation_id":"d945bcc0-e98a-4b02-8c46-296ccb998f70","resolution":{"observed_at":"2026-08-04T17:29:52.006774Z","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-04T17:29:52.091561Z","title":"Sneakysnake: a fast and accurate universal genome pre-alignment filter for cpus, gpus and fpgas,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:52.091561Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:bd36667244c6fb53dfeee389ef8e1166e6619112dc8ecb9d01e360184da2a238","observation_id":"977648ee-bfda-419f-b6da-a2ec183a0077","resolution":{"observed_at":"2026-08-04T17:29:52.091561Z","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-04T17:29:52.145778Z","title":"Acmc 2: Accelerating markov chain monte carlo algorithms for probabilistic models,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:52.145778Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:e0e2e4808c52a2c5a238e0600ee31f5cf4969a21386c6029149a06ebab7486fc","observation_id":"bbbc6b59-f67e-4b20-9f19-19b2e943f5db","resolution":{"observed_at":"2026-08-04T17:29:52.145778Z","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-04T17:29:52.253394Z","title":"Efficient ancestry and mutation simulation with msprime 1.0,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:52.253394Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:d1574f015d74ab113ffcc998cd3af1f4759e35ea2f6fb847fb5b216d2358cebd","observation_id":"a65559e3-32f6-4424-bf9e-42e6e0b1d6a6","resolution":{"observed_at":"2026-08-04T17:29:52.253394Z","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-04T17:29:52.332440Z","title":"Accurately computing the log-sum-exp and softmax functions,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:52.332440Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:af0b433da428e67098e0d4295b1bbb4d70c43f2d2a65db8ae7b7222da46dd5a9","observation_id":"4725de0d-9f79-462e-9970-d765f6f868e4","resolution":{"observed_at":"2026-08-04T17:29:52.332440Z","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-04T17:29:52.408546Z","title":"Variational inference: A review for statisticians,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:52.408546Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:2580f4ba530a2de95448c9eadafc8c6f0f0524a98a3256b90c069ceae3977160","observation_id":"9d3201bc-8e18-476b-aa3a-ca611bc60c0f","resolution":{"observed_at":"2026-08-04T17:29:52.408546Z","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-04T17:29:52.469110Z","title":"Stan: A probabilistic programming language,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:52.469110Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:c36c8021a052d717b1b7894cef3e219654ba017e9cea53017d1f2b1138cd9f4d","observation_id":"35cbd3a9-6f12-4149-b9a1-47be53a02931","resolution":{"observed_at":"2026-08-04T17:29:52.469110Z","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-04T17:29:52.557807Z","title":"Coopmc: Algorithm-architecture co-optimization for markov chain monte carlo accelerators,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:52.557807Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:52a911d4bc73a0992f1a2241103375be68bf2dff046b4bd93d3e1efd99d361e4","observation_id":"57658501-b7ab-4533-92e3-a76a31c7a7f8","resolution":{"observed_at":"2026-08-04T17:29:52.557807Z","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-04T17:29:52.666411Z","title":"Parameterized posit arithmetic hardware generator,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:52.666411Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:94e730c2f67710f6104697ca737c8f3983acadf1bc13b973cec2f76cf251988e","observation_id":"581223a5-114b-4f8a-8304-c3a21a204be4","resolution":{"observed_at":"2026-08-04T17:29:52.666411Z","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-04T17:29:52.743938Z","title":"Posit npb: Assessing the precision improvement in hpc scientific applications,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:52.743938Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:799834a092d4f5468c98d3f8e44362502a3aceb36189fb1de96952da25a823cc","observation_id":"fe23629b-c66e-40e1-b259-938a1467fd81","resolution":{"observed_at":"2026-08-04T17:29:52.743938Z","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-04T17:29:52.820544Z","title":"Debugging and detecting numerical errors in computation with posits,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:52.820544Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:a7cf2e51c51b07ecf66642e8d59c06efb0bad0e199731b891f981ad4fcb88276","observation_id":"54731152-d139-4789-a048-9d4ca3ae1cd8","resolution":{"observed_at":"2026-08-04T17:29:52.820544Z","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-04T17:29:52.936487Z","title":"Posits: the good, the bad and the ugly,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:52.936487Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:770977103218225710cacd05ebb63c0c7ed5ff119455e31e873152bc8b1102f3","observation_id":"21228353-78ed-4c7b-b7bf-1f1735571e79","resolution":{"observed_at":"2026-08-04T17:29:52.936487Z","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-04T17:29:53.069365Z","title":"Statistical significance: p value, 0.05 threshold, and applications to radiomics—reasons for a conservative approach,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:53.069365Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:1fe251279ec3a81950fbfe5216c93e2c951f625bebccf1665fb8a5422ca54666","observation_id":"8753099d-347f-49f4-8839-b685c995abc5","resolution":{"observed_at":"2026-08-04T17:29:53.069365Z","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-04T17:29:53.140964Z","title":"Durbin, S","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:53.140964Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:777e5c9370e2d7dd740f17ec928cad834b5ac807071d98344ddceae58057b7e0","observation_id":"3406b1d6-1182-42a4-b2b4-45c5eed5fa26","resolution":{"observed_at":"2026-08-04T17:29:53.140964Z","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-04T17:29:53.223070Z","title":"Hidden markov models,","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:53.223070Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:42379bf8673b9ffa7f971ea2c821e6f1dd4c3e908c88439200711183336c7430","observation_id":"2b5615eb-2f69-48cc-8e37-b5b1feeb10c1","resolution":{"observed_at":"2026-08-04T17:29:53.223070Z","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-04T17:29:53.288403Z","title":"Accelerated profile hmm searches,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:53.288403Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:c9a4edbfaf2c08e2c627a53550445f574012feb74f9d2d01d5211edbedbe21ae","observation_id":"51c30181-82aa-4046-9901-7abb28150e0d","resolution":{"observed_at":"2026-08-04T17:29:53.288403Z","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-04T17:29:53.353679Z","title":"High- performance fpga-based accelerator for bayesian neural networks,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:53.353679Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:b833a42800cfdfaf5a66c39306eb61e7cf06db4ed4f6b10b81d036eaa3c24143","observation_id":"6cbfcc0b-c9be-4012-8f06-21daa9d0d09d","resolution":{"observed_at":"2026-08-04T17:29:53.353679Z","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-04T17:29:53.440648Z","title":"Closed-form expression for the poisson- binomial probability density function,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:53.440648Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:ad8b3ce368f79acf607201725b875f405f5c8aab7ddf7f808828bc6863a79ec4","observation_id":"2d8bc543-8780-42ed-a4d8-54e72c8ee6c1","resolution":{"observed_at":"2026-08-04T17:29:53.440648Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2207.09765","last_updated":"2023-10-21T21:42:25Z","snapshot_observed_at":"2026-08-19T03:44:18.536929Z","submitted_at":"2022-07-20T09:16:12Z","title":"ApHMM: Accelerating Profile Hidden Markov Models for Fast and Energy-Efficient Genome Analysis","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2207.09765","snapshot_observed_at":"2026-08-04T17:29:53.505805Z","title":"Aphmm: Accelerating profile hidden markov models for fast and energy-efficient genome analysis,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:53.505805Z"},"links":{"cited_paper":"/paper/2207.09765","citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:76eaa6d0104fa2e9516bc77ca1f600858267c4e9c20e45d3ab4f33f5c92d26c0","observation_id":"8c39ca2c-b767-45e7-9823-b97ebbef5f36","resolution":{"observed_at":"2026-08-04T17:29:53.505805Z","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-04T17:29:53.567563Z","title":"Comparing posit and ieee-754 hardware cost,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:53.567563Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:a2b0c298a5687519a162c8d3676e1352dedc6295de5d8dacc0f011433fcd3874","observation_id":"ea8b47db-9359-4b3b-8d21-2ee581e41b6c","resolution":{"observed_at":"2026-08-04T17:29:53.567563Z","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-04T17:29:53.638850Z","title":"Mpfr: A multiple-precision binary floating-point library with correct rounding,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:53.638850Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:4450f968ff222db53079499b2846ca0240f631f820c8cfb47513ac3d0b89a3c5","observation_id":"41790ab3-48d4-40d0-bd32-1eb17b860af1","resolution":{"observed_at":"2026-08-04T17:29:53.638850Z","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-04T17:29:53.722930Z","title":"Gendp: A framework of dynamic programming acceleration for genome sequencing analysis,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:53.722930Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:d6d441f9aa714648b8273a5afc7d144d8269a35f47938075b8e9f4e1a6989cb8","observation_id":"11f088b3-e468-419c-b370-daf5aed9492a","resolution":{"observed_at":"2026-08-04T17:29:53.722930Z","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-04T17:29:53.795033Z","title":"Gundersen","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:53.795033Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:7d31deb9efb48aefff6212b2e9186bf76d58eeef7b726a2d3cac2031fc6814dd","observation_id":"284c2d99-f15b-4fff-86f8-abcd9cb18f45","resolution":{"observed_at":"2026-08-04T17:29:53.795033Z","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-04T17:29:53.872006Z","title":"Hardware acceleration of long read pairwise overlapping in genome sequencing: A race between fpga and gpu,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:53.872006Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:1a792e474aebdd19fe27960863c491dbf7e503e9d7449767697636cdc3c70771","observation_id":"cd13a894-751c-4186-a918-a18bb9be3aaa","resolution":{"observed_at":"2026-08-04T17:29:53.872006Z","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-04T17:29:53.975765Z","title":"Beating floating point at its own game: Posit arithmetic,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:53.975765Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:570dfacd61ce3c7236fb9b81e13e67ba5996a65fb5080a36b17efa348d44613b","observation_id":"473259ca-6177-49d1-8c09-7266195dd51b","resolution":{"observed_at":"2026-08-04T17:29:53.975765Z","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-04T17:29:54.048246Z","title":"Bridging the gap between llms and lns with dynamic data format and architecture codesign,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:54.048246Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:b8df249c973b3a2edbd11f6436da9b9211034dd0e1b1b37a0e9361a2d0e3807c","observation_id":"bc3350dc-0ac9-4dad-be26-b087aef00e0b","resolution":{"observed_at":"2026-08-04T17:29:54.048246Z","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-04T17:29:54.105421Z","title":"On computing the distribution function for the poisson binomial distribution,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:54.105421Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:5b46329741d287af1ece840111fe9426edb8077ec3c34d40b3bdf1b9c014dffd","observation_id":"ad97f135-d882-4ca5-91f0-c38cf5d32be4","resolution":{"observed_at":"2026-08-04T17:29:54.105421Z","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-04T17:29:54.222286Z","title":"Hardware acceleration of the pair-hmm algorithm for dna variant calling,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:54.222286Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:b928a9933990323944b53dac116b0a9c1d9e54752e2af76bce1a95802244202a","observation_id":"c30bea89-e8d2-489d-a0a1-709bbad9e477","resolution":{"observed_at":"2026-08-04T17:29:54.222286Z","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-04T17:29:54.288647Z","title":"Universal number posit arithmetic generator on fpga,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:54.288647Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:4f6aae4458cf6b46ed7d7b75c4d32a3be37a8938224c63c8a8602901523ac123","observation_id":"46273cde-6e56-49ab-9e10-74b47b87eb19","resolution":{"observed_at":"2026-08-04T17:29:54.288647Z","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-04T17:29:54.353171Z","title":"Pacogen: A hardware posit arithmetic core generator,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:54.353171Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:5835337aacec72e9e2e046d58511f9d8d58097d0558baf15b953e905a928f337","observation_id":"48a6b682-d533-4195-8dcf-232eeb74e2b0","resolution":{"observed_at":"2026-08-04T17:29:54.353171Z","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-04T17:29:54.475908Z","title":"Exma: A genomics accelerator for exact- matching,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:54.475908Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:d7c48082e6f1db206a756d50b6a012abb9c28fcd59c93e602ae5f9d0e387839b","observation_id":"9e5ac733-c43b-490b-bc8d-35e9ae9fe4aa","resolution":{"observed_at":"2026-08-04T17:29:54.475908Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1811.01721","last_updated":"2018-11-01T22:13:57Z","snapshot_observed_at":"2026-08-18T01:57:49.789649Z","submitted_at":"2018-11-01T22:13:57Z","title":"Rethinking floating point for deep learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.01721","snapshot_observed_at":"2026-08-04T17:29:54.539112Z","title":"Rethinking floating point for deep learning,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:54.539112Z"},"links":{"cited_paper":"/paper/1811.01721","citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:d5fe9a03424eff630a0f57ef52b6b665630f5c6afbd708332fc2fff52f5c0bec","observation_id":"259b39cc-8072-491d-a451-050807d49298","resolution":{"observed_at":"2026-08-04T17:29:54.539112Z","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-04T17:29:54.637595Z","title":"Jurafsky and J","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:54.637595Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:5de631f55111d00a714c278cb0919549f432bd9c1d0c973f803c235b345a164a","observation_id":"64f04b78-edae-437e-a78d-668a8268b7bd","resolution":{"observed_at":"2026-08-04T17:29:54.637595Z","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-04T17:29:54.692596Z","title":"Towards weather and climate models in 16-bit arithmetic","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:54.692596Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:a5f6a76c3ab7d9de244d30e370c86aba26286b842feac832d8242c956baa6c67","observation_id":"a3fd45cb-1e49-413a-9fb6-0c26e9adff51","resolution":{"observed_at":"2026-08-04T17:29:54.692596Z","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-04T17:29:54.778716Z","title":"A scalable bayesian inference accelerator for unsupervised learning,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:54.778716Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:301903cf7034d43ca0379660c79e48dd10e621dac6318670d364b8825e090ff6","observation_id":"4a8244ae-f6b6-4a52-b86f-49e8e5446c61","resolution":{"observed_at":"2026-08-04T17:29:54.778716Z","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-04T17:29:54.899878Z","title":"A 3mm 2 programmable bayesian inference accelerator for unsupervised machine perception using parallel gibbs sampling in 16nm,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:54.899878Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:1179baec443d2f1faf2f74d68291e674bee1c1cfef09dcbb2a0d9bd1ec6b670c","observation_id":"5d247894-a397-4a6a-919e-9b7a10df5c32","resolution":{"observed_at":"2026-08-04T17:29:54.899878Z","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-04T17:29:54.966180Z","title":"Flexgibbs: Reconfigurable parallel gibbs sampling accelerator for structured graphs,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:54.966180Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:968aad0bf38e80059a427542edc566935137a0f8152aa418bafd0cebd413bdf2","observation_id":"61aaf091-94e1-4090-a697-fd95a2335086","resolution":{"observed_at":"2026-08-04T17:29:54.966180Z","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-04T17:29:55.029404Z","title":"High-level. net software implementations of unum type i and posit with simultaneous fpga implementation using hastlayer,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:55.029404Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:fbab3f7c0e3d2e8ef277a62c133f4b655bf2c26c23a98aed242560a95d0ad923","observation_id":"84827d8a-1a55-4f83-8264-0660fd45c3c6","resolution":{"observed_at":"2026-08-04T17:29:55.029404Z","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-04T17:29:55.144739Z","title":"A robust scaling approach for implementation of hsmms,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:55.144739Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:da495fe727c5902ce7fddba0492f4fc617fdc0533a856b0633c56a41f0936711","observation_id":"56ace9a8-52da-4c9e-add5-cd826e7609d7","resolution":{"observed_at":"2026-08-04T17:29:55.144739Z","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-04T17:29:55.234786Z","title":"An approach to generate correctly rounded math libraries for new floating point variants,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:55.234786Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:e26a3074815848dad63f69e8105fd30b6d8adb6aa0141cef09eb981998de3b8f","observation_id":"16e94b26-0560-4e1e-8783-dd2785b7848a","resolution":{"observed_at":"2026-08-04T17:29:55.234786Z","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-04T17:29:55.331401Z","title":"High performance correctly rounded math libraries for 32-bit floating point representations,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:55.331401Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:2d6bc2579e9240e146eb7e493e244d7068b60e6883ad77692a4a190e5e617a27","observation_id":"64236f32-4fd3-43e6-a3c5-04710b9311ee","resolution":{"observed_at":"2026-08-04T17:29:55.331401Z","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-04T17:29:55.421696Z","title":"Variational inference using approximate likelihood under the coalescent with recombination,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:55.421696Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:be97422c648ca184653737ab49e87ab54e2a3ca7b8e1c38853ac10fe3479cb43","observation_id":"fdc80da4-d598-46db-abc4-2a1499904dc0","resolution":{"observed_at":"2026-08-04T17:29:55.421696Z","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-04T17:29:55.514776Z","title":"Algorithm-hardware co-design for bqsr acceleration in genome analysis toolkit,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:55.514776Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:9e033ddba35fff65b6037ad2067cc72046603e5ff7713782e0dd31453a61f0f6","observation_id":"9b1ce0ac-61dc-4c68-8fed-fc18c05139be","resolution":{"observed_at":"2026-08-04T17:29:55.514776Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.06946","last_updated":"2024-03-14T15:08:04Z","snapshot_observed_at":"2026-08-16T15:33:47.941873Z","submitted_at":"2023-05-11T16:23:51Z","title":"Big-PERCIVAL: Exploring the Native Use of 64-Bit Posit Arithmetic in Scientific Computing","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.06946","snapshot_observed_at":"2026-08-04T17:29:55.605574Z","title":"Big-percival: Exploring the native use of 64-bit posit arithmetic in scientific computing,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:55.605574Z"},"links":{"cited_paper":"/paper/2305.06946","citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:b50c76294dd0b7962b7d0d058b0e587c75bff14680e935b561e89d09661c9bd6","observation_id":"1e32028a-0d49-434e-bca5-ebce2636b8cf","resolution":{"observed_at":"2026-08-04T17:29:55.605574Z","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-04T17:29:55.679416Z","title":"Customizing the cva6 risc-v core to integrate posit and quire instructions,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:55.679416Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:72bea6038db7cf70763fc21c268c1b6a823d7871fefafd7feba9d1541b42117e","observation_id":"f0543492-e5fa-458f-85c3-2f9fc869a04c","resolution":{"observed_at":"2026-08-04T17:29:55.679416Z","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-04T17:29:55.860898Z","title":"Percival: open-source posit risc-v core with quire capability,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:55.860898Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:86775e4e8dfe035960bd59e4d9b29202199d8dae8b220dcefc905afe537c4810","observation_id":"1868e1cc-b90d-4567-9343-9e97e33704f7","resolution":{"observed_at":"2026-08-04T17:29:55.860898Z","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-04T17:29:55.948474Z","title":"Numerically stable hidden markov model implementation,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:55.948474Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:dc2e386fc69d98f20d10703c36f758143d3bc0db7dfbe9ce8f14e91b32fe7e0b","observation_id":"ae9d7173-c6ea-418b-82e0-fe7a544a5148","resolution":{"observed_at":"2026-08-04T17:29:55.948474Z","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-04T17:29:56.035100Z","title":"A systematic review of hidden markov models and their applications,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:56.035100Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:b7ef695d68ca3c894aa977e64964ed6191a60da7531bbcd3a3d457b9f1cdde9f","observation_id":"d341a8d2-4a30-4dc2-a716-2acde1d4ec2e","resolution":{"observed_at":"2026-08-04T17:29:56.035100Z","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-04T17:29:56.070055Z","title":"Customized posit adders and multipliers using the flopoco core generator,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:56.070055Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:eeb5958bc426039e6bcf7edd8eaacb8487fdcdbc4aad4f35ba59843cebc6704d","observation_id":"9ee029fa-f0b2-4ba1-b56f-f8a74d97f404","resolution":{"observed_at":"2026-08-04T17:29:56.070055Z","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-04T17:29:56.147195Z","title":"Generating posit-based accelerators with high-level synthesis,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:56.147195Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:a4bdb868ae0bcbd9be5dec7b5d46e176e980b02531ba5fb91d576b385f1d4647","observation_id":"5ea08005-90eb-4f51-86e4-2b2b7a6dd6c2","resolution":{"observed_at":"2026-08-04T17:29:56.147195Z","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-04T17:29:56.209954Z","title":"Compar- ing different decodings for posit arithmetic,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:56.209954Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:7fe61dac6e5f441672ea6c0df88b69f4c0912d27a49448eac611927c6b3a59fd","observation_id":"e903b8fe-6564-4378-9e8c-8a1a78489672","resolution":{"observed_at":"2026-08-04T17:29:56.209954Z","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-04T17:29:56.284286Z","title":"Plaus: Posit logarithmic approximate units to implement low- cost operations with real numbers,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:56.284286Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:068f595a41047202f2cac7cd8d4e492b869512df14bf6b2b3aff6993407829ef","observation_id":"ea2bf671-ba95-44fb-b5b4-adf2da3812c8","resolution":{"observed_at":"2026-08-04T17:29:56.284286Z","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-04T17:29:56.338570Z","title":"Hidden semi-markov models (hsmms),","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:56.338570Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:029d4678d50b03e9986dc42935f7a55ac1d36358d9ffec03d9b8308709d08c6b","observation_id":"968156f1-62d6-4bac-bbb6-b62e399971dd","resolution":{"observed_at":"2026-08-04T17:29:56.338570Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1093/bioinformatics/btm388","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"AWTY (are we there yet?): a system for graphical exploration of MCMC convergence in Bayesian phylogenetics,","venue":"Bioinformatics","work_id":"c9c32f08-48f7-420a-adef-66637f76ac0c","year":2007},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:56.392292Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:f43e9e5701e5ed603e02a2d97c1311f02efd11903455477f5efcefdef394b391","observation_id":"eca3bc5a-e3b0-4c72-bebf-7feda72e710b","resolution":{"observed_at":"2026-08-04T17:34:00.950074Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:29:56.459641Z","title":"Universal: reliable, reproducible, and energy-efficient numerics,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:56.459641Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:e2cfaed6b83b89b7b55bac5a3f150fc43584a03e2b6e3930822a2b99149eea90","observation_id":"080b59df-1c5a-4060-b4fa-8b00ae4c5910","resolution":{"observed_at":"2026-08-04T17:29:56.459641Z","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-04T17:29:56.509440Z","title":"Computing with logarithmic number system arithmetic: Implementation methods and performance benefits,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:56.509440Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:5f07ccba91a72b83de8adc83b33a688e3d3f4122dccacd9d5b5d776c852cb8f0","observation_id":"3e53a192-e0a4-4da4-9ee3-07b845caf9bd","resolution":{"observed_at":"2026-08-04T17:29:56.509440Z","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-04T17:29:56.568113Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:56.568113Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:5b55df0d7c2efb7a640d836ec2205c8e3ed328caaccbcc3f630ab68f90972ce2","observation_id":"6ec17836-6075-4702-bdb5-398001a5d649","resolution":{"observed_at":"2026-08-04T17:29:56.568113Z","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-04T17:29:56.667937Z","title":"Hardware implementation of posits and their application in fpgas,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:56.667937Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:4acc11b054391d9d8fce57b9d5546476e72a7bbfa93ed36d7eff6f64e3df428e","observation_id":"729e2b6a-c23c-441b-9a1d-e5e909ede2e8","resolution":{"observed_at":"2026-08-04T17:29:56.667937Z","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-04T17:29:56.740401Z","title":"A tutorial on hidden markov models and selected applica- tions in speech recognition,","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:56.740401Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:0bc5deeeb9296d56b0b4f8461125189a1661ab64d9b666321dc891da07ca601b","observation_id":"a02b890a-d36d-4212-bdb0-cb395348b28c","resolution":{"observed_at":"2026-08-04T17:29:56.740401Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.09053","last_updated":"2019-07-21T23:42:07Z","snapshot_observed_at":"2026-08-19T17:21:05.905217Z","submitted_at":"2019-07-21T23:42:07Z","title":"Some New Results for Poisson Binomial Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.09053","snapshot_observed_at":"2026-08-04T17:29:56.822015Z","title":"Some new results for poisson binomial models,","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:56.822015Z"},"links":{"cited_paper":"/paper/1907.09053","citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:08e9d1aca835baf7955cb6a4abe145b81a1710eab4843a90a1ad9967b96f2788","observation_id":"0d0bd107-4fb2-44ae-bcb4-5dab5f0c266c","resolution":{"observed_at":"2026-08-04T17:29:56.822015Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.02394","last_updated":"2020-07-28T02:45:14Z","snapshot_observed_at":"2026-07-06T08:55:23.638036Z","submitted_at":"2020-02-05T00:33:22Z","title":"FPGA Acceleration of Sequence Alignment: A Survey","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.02394","snapshot_observed_at":"2026-08-04T17:29:56.899064Z","title":"Fpga acceleration of sequence alignment: A survey,","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:56.899064Z"},"links":{"cited_paper":"/paper/2002.02394","citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:4ac31fbc0e710083ff837e6e272a5af70e16fdc43bff0cc40a57daea7eb97589","observation_id":"fac0546f-63a4-45d6-a8db-6748b8302886","resolution":{"observed_at":"2026-08-04T17:29:56.899064Z","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-04T17:29:56.977630Z","title":"Techniques for assessing water infrastructure for nonstationary extreme events: a review,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:56.977630Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:44e1a008eb5c9799e53a24a30aed7db73fffee89c8059e20c2e72c8c4fed71dd","observation_id":"3324accd-c2e9-4d56-b4e7-fc911ad86d0c","resolution":{"observed_at":"2026-08-04T17:29:56.977630Z","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-04T17:29:57.054099Z","title":"Binomial option pricing with nonidentically distributed returns and its implications,","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:57.054099Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:b2182986ebc27a9a501829c18331a0a66ac6ba17bd8883cc1c4f10d4c30e4fd9","observation_id":"6851c496-a250-400c-bdd1-f008cc77b153","resolution":{"observed_at":"2026-08-04T17:29:57.054099Z","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-04T17:29:57.132411Z","title":"Clarinet: A quire-enabled risc-v- based framework for posit arithmetic empiricism,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:57.132411Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:af4fd90206a1a17a9a1f77e5e2d45ddbd719085cbc52dcc4f1e793ef847b52bd","observation_id":"feff44eb-9612-4dc4-a304-e4ab16cc9550","resolution":{"observed_at":"2026-08-04T17:29:57.132411Z","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-04T17:29:57.190060Z","title":"Phac: Posit hardware accelerator for efficient arithmetic logic operations,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:57.190060Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:5eeef2ea0bd91cafc3468f07bad388c817258b906d4478f2c7c3d35eb202ac58","observation_id":"483af437-8136-4deb-935f-f75d82817df7","resolution":{"observed_at":"2026-08-04T17:29:57.190060Z","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-04T17:29:57.239085Z","title":"Comparison of arithmetic number formats for inference in sum-product networks on fpgas,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:57.239085Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:3329edb7ef3da9abbca83a4ee56f5c4b338aa0737e45fe6819161a204d6617da","observation_id":"c9cde31c-a04a-4587-9fd6-9f367cfc7ea0","resolution":{"observed_at":"2026-08-04T17:29:57.239085Z","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-04T17:29:57.320710Z","title":"Accelerated seeding for genome sequence alignment with enumerated radix trees,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:57.320710Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:d0322a217390fd1c75c1ffe17a403eed7074de4627e561d93713ebcb1857dbc7","observation_id":"e229ce01-bc9d-4b14-8c62-272537f49cf6","resolution":{"observed_at":"2026-08-04T17:29:57.320710Z","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-04T17:29:57.397459Z","title":"The poisson binomial distribution—old & new,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:57.397459Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:f72dbfcb89f7c2ecbfe50cd683771eb36d01f1ba2dc998aa021f4cb4aac2629e","observation_id":"9fd04004-20d4-427a-8dd3-c2d3ef5f1eda","resolution":{"observed_at":"2026-08-04T17:29:57.397459Z","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-04T17:29:57.483401Z","title":"Stan user’s guide, version 2.35,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:57.483401Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:40613b51636fee664871297ff49dfb97c54c4e2455bde6abe21c02bd15eada5a","observation_id":"ea64301a-be89-48f8-94db-42d8127c0a2c","resolution":{"observed_at":"2026-08-04T17:29:57.483401Z","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-04T17:29:57.541760Z","title":"The role of poisson’s binomial distribution in the analysis of tem images,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:57.541760Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:fddb961323d951ccf78c76f12048d2ce125642e8ec7afa5d17303fd0223e575b","observation_id":"d3ef523a-0262-46c8-9edc-2e3cc528a833","resolution":{"observed_at":"2026-08-04T17:29:57.541760Z","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-04T17:29:57.594858Z","title":"Peri: A configurable posit enabled risc-v core,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:57.594858Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:0584ba959144d3fecb34e2fc2b0547dbfc26c31fe9d4ec30086432b0c867065b","observation_id":"7eccbe87-dced-462b-80ee-5b98fa5abec9","resolution":{"observed_at":"2026-08-04T17:29:57.594858Z","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-04T17:29:57.648713Z","title":"Darwin: A genomics co- processor provides up to 15,000 x acceleration on long read assembly,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:57.648713Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:c62d3eb4a0293cd56662f59f398d4b0eb2024e22aa34c64d39b2a1f561705da9","observation_id":"b3cc3f9a-edf1-4aa0-a967-caf03629af0b","resolution":{"observed_at":"2026-08-04T17:29:57.648713Z","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-04T17:29:57.725318Z","title":"Evaluating the hardware cost of the posit number system,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:57.725318Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:a783ae4d17453701d8de30900221d3055b5f5e01f93495e7e91383068443fa6b","observation_id":"bd30cdca-0ded-44fc-9986-8d7609babf70","resolution":{"observed_at":"2026-08-04T17:29:57.725318Z","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-04T17:29:57.816860Z","title":"Enabling high performance posit arithmetic applications using hardware acceleration,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:57.816860Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:ea90e0f9c0abaa90db739c1bfd4389cc55ce1bd0e6a4db5eadb2427d48614d92","observation_id":"7acebd4a-c235-47c9-83ed-1f30cb923ad9","resolution":{"observed_at":"2026-08-04T17:29:57.816860Z","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-04T17:29:57.885389Z","title":"An accelerator for posit arithmetic targeting posit level 1 blas routines and pair-hmm,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:57.885389Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:2d09b5a87e415884d440f22d6650626ceec97cbc38ada58b6045cd3e3d5c8ec7","observation_id":"205263df-78dd-403e-bb45-9fe73918638c","resolution":{"observed_at":"2026-08-04T17:29:57.885389Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1093/sysbio/syx085","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Coestimating Reticulate Phylogenies and Gene Trees from Multilocus Sequence Data,","venue":"Systematic Biology","work_id":"2145bfba-6138-4cf8-b473-1ecb1427798f","year":2017},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:57.954092Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:cdfab214f57988442f1ea60d1271369d57732a461b785ffa0783192ecf7c1284","observation_id":"7f057f13-2833-4f87-bfbb-6b617abbd8c9","resolution":{"observed_at":"2026-08-04T17:34:00.715649Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:29:58.009077Z","title":"Lofreq: a sequence-quality aware, ultra-sensitive variant caller for uncovering cell- population heterogeneity from high-throughput sequencing datasets,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:58.009077Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:667ea6d7f45b38240c8ef84705766a251da18f11650448d30ae0bb29136c5291","observation_id":"da658424-5193-4e8f-9f20-6ea32ccaffe7","resolution":{"observed_at":"2026-08-04T17:29:58.009077Z","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-04T17:29:58.066332Z","title":"Posit arithmetic hardware implementations with the minimum cost divider and squareroot,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:58.066332Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:63bb5633d5b9a6d0583ad1ad8a4283e615d4b1da925267ec499899b9d6283aa4","observation_id":"0dde72bc-62c6-414b-a913-67ff9c9074d2","resolution":{"observed_at":"2026-08-04T17:29:58.066332Z","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-04T17:29:58.202384Z","title":"(2017) Ultrascale architecture configurable logic block user guide","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:58.202384Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:8d0b62b93e91446d90cd1dbb5755ad1f223382900263bbc003eb92ce3574fd0d","observation_id":"d8a80dfb-29c7-4e6a-91c6-4a45ec7a2436","resolution":{"observed_at":"2026-08-04T17:29:58.202384Z","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-04T17:29:58.444722Z","title":"(2020) Floating-point operator v7.1 - logicore ip product guide","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:58.444722Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:7290b49dacc747bd90190d1d022ee9eca69894d3550838c864cfef7f10da0054","observation_id":"85ae969a-36f6-42cd-bbfc-3999e10bae99","resolution":{"observed_at":"2026-08-04T17:29:58.444722Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3595297","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An fpga accelerator for genome variant calling,","venue":"ACM Transactions on Reconfigurable Technology and Systems","work_id":"a9431292-7c29-4cd5-bbfd-908c78ef7d22","year":2023},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:58.507689Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:9b32aa69545124f4cc9f06591bfa2da4b142f7ffca14978ea174555c9736eace","observation_id":"1460a65f-338a-4258-835a-178e2c20c902","resolution":{"observed_at":"2026-08-04T17:34:00.494277Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:29:58.565639Z","title":"Accelerating probabilistic computing with a stochastic processing unit,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:58.565639Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:0f67f94e64fac1743cae98d96c338b0406ec045ad998f71944a52c6d43a8b303","observation_id":"03bd9bc6-8411-43ed-8cab-3b505084b5a1","resolution":{"observed_at":"2026-08-04T17:29:58.565639Z","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-04T17:29:58.660383Z","title":"Statistical robustness of markov chain monte carlo accelerators,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:58.660383Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:f53c42efb766ca741eee4b7cc02f3038ba2c539efe6d8bb66dadbe1d64ef655b","observation_id":"f1c4122f-a1fa-4b38-8729-edea4004026c","resolution":{"observed_at":"2026-08-04T17:29:58.660383Z","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-04T17:29:58.715647Z","title":"Lns-madam: Low-precision training in logarithmic number system using multiplicative weight update,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics","version":1},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-04T17:29:58.715647Z"},"links":{"citing_paper":"/paper/2509.10934"},"observation_digest":"sha256:798aa372b57ba08e52b770100a1fb6ac2f47d66fc60a298a8b37d9f1f1287f77","observation_id":"bfd66104-92bd-4055-90c4-2f7cffd7f034","resolution":{"observed_at":"2026-08-04T17:29:58.715647Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2509.10934","last_updated":"2025-09-13T18:18:17Z","latest_version":1,"primary_category":"math.NA","snapshot_observed_at":"2026-08-12T12:15:57.508181Z","submitted_at":"2025-09-13T18:18:17Z","title":"Design and accuracy trade-offs in Computational Statistics"},"reference_resolution":{"displayed":89,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":86,"verified_exact":3,"verified_fuzzy":0},"total_outbound_references":89},"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 20 August 2026, this Paper Citation Record lists 89 of 89 outbound references and 0 inbound Pith citation observations for arXiv:2509.10934."}