{"as_of":"2026-08-09T02:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c0f894a21df78bdae6c6770d128c35c49285e72231ff45ac89e11d046157a2bb","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":12,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T12:56:50.559783Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-06-29T10:23:17.950956Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2108.06098","last_updated":"2023-01-19T08:21:44Z","snapshot_observed_at":"2026-07-06T11:38:02.479171Z","submitted_at":"2021-08-13T07:16:40Z","title":"FedPara: Low-Rank Hadamard Product for Communication-Efficient Federated Learning","version":3},"cited_work":{"arxiv_id":"2108.06098","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2108.06098","snapshot_observed_at":"2026-06-29T10:23:17.950956Z","title":"Fedpara: Low-rank hadamard product for communication-efficient federated learning.arXiv preprint arXiv: 2108.06098","venue":null,"work_id":"e2aaa36c-e39a-41a2-9820-5933399a4ef5","year":2021},"citing_paper":{"arxiv_id":"2410.06431","last_updated":"2026-05-13T22:22:18Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-10-09T00:09:15Z","title":"Functional-level Uncertainty Quantification for Calibrated Fine-tuning on LLMs","version":5},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-23T19:35:29.917096Z"},"links":{"cited_paper":"/paper/2108.06098","citing_paper":"/paper/2410.06431"},"observation_digest":"sha256:fa49a2a10c8923d138524961efca3c1eae7b8008c71bd701ab7abcee49de1f5a","observation_id":"51148b30-2db3-4c91-b1d7-a8a6ed590b43","resolution":{"observed_at":"2026-05-23T19:35:47.120177Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2108.06098","last_updated":"2023-01-19T08:21:44Z","snapshot_observed_at":"2026-07-06T11:38:02.479171Z","submitted_at":"2021-08-13T07:16:40Z","title":"FedPara: Low-Rank Hadamard Product for Communication-Efficient Federated Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.06098","snapshot_observed_at":"2026-08-07T12:56:50.559783Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.23094","last_updated":"2025-05-29T04:56:35Z","snapshot_observed_at":"2026-08-07T12:51:02.978270Z","submitted_at":"2025-05-29T04:56:35Z","title":"MAP: Revisiting Weight Decomposition for Low-Rank Adaptation","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T12:56:50.559783Z"},"links":{"cited_paper":"/paper/2108.06098","citing_paper":"/paper/2505.23094"},"observation_digest":"sha256:2a07a2e6cdba023d1cf5693ec4e85058e958b1dea23ddcc8ff20d4a32849af91","observation_id":"3250105b-6543-4f89-aeca-7a5a8124601c","resolution":{"observed_at":"2026-08-07T12:56:50.559783Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2108.06098","last_updated":"2023-01-19T08:21:44Z","snapshot_observed_at":"2026-07-06T11:38:02.479171Z","submitted_at":"2021-08-13T07:16:40Z","title":"FedPara: Low-Rank Hadamard Product for Communication-Efficient Federated Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.06098","snapshot_observed_at":"2026-08-07T12:05:54.572081Z","title":"Hyeon-Woo, M","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.00743","last_updated":"2025-05-31T23:09:26Z","snapshot_observed_at":"2026-08-07T11:56:43.158163Z","submitted_at":"2025-05-31T23:09:26Z","title":"Assortment of Attention Heads: Accelerating Federated PEFT with Head Pruning and Strategic Client Selection","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T12:05:54.572081Z"},"links":{"cited_paper":"/paper/2108.06098","citing_paper":"/paper/2506.00743"},"observation_digest":"sha256:86ae8fad473777f96268af9b4b09e27fac06e041e4bf3213ff59a74780b9beea","observation_id":"9415457f-5bae-4e19-8ae0-62ff1402d907","resolution":{"observed_at":"2026-08-07T12:05:54.572081Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2108.06098","last_updated":"2023-01-19T08:21:44Z","snapshot_observed_at":"2026-07-06T11:38:02.479171Z","submitted_at":"2021-08-13T07:16:40Z","title":"FedPara: Low-Rank Hadamard Product for Communication-Efficient Federated Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.06098","snapshot_observed_at":"2026-08-06T23:34:59.394542Z","title":"Fedpara: Low-rank hadamard product for communication-efficient federated learning,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.17562","last_updated":"2025-07-18T07:39:50Z","snapshot_observed_at":"2026-08-08T15:59:20.527991Z","submitted_at":"2025-06-21T03:13:08Z","title":"LLM-driven Medical Report Generation via Communication-efficient Heterogeneous Federated Learning","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-06T23:34:59.394542Z"},"links":{"cited_paper":"/paper/2108.06098","citing_paper":"/paper/2506.17562"},"observation_digest":"sha256:4432cc5e176efdc83fe7f15e56b23d47bd03cf5490b3664833edf7b21c10c2f6","observation_id":"21e15141-7da7-486f-b32b-788363ecd305","resolution":{"observed_at":"2026-08-06T23:34:59.394542Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2108.06098","last_updated":"2023-01-19T08:21:44Z","snapshot_observed_at":"2026-07-06T11:38:02.479171Z","submitted_at":"2021-08-13T07:16:40Z","title":"FedPara: Low-Rank Hadamard Product for Communication-Efficient Federated Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.06098","snapshot_observed_at":"2026-08-06T14:44:59.259766Z","title":"arXiv preprint arXiv:2108.06098 (2021)","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.18112","last_updated":"2025-07-24T05:51:51Z","snapshot_observed_at":"2026-08-06T14:36:15.584750Z","submitted_at":"2025-07-24T05:51:51Z","title":"Parameter-Efficient Fine-Tuning of 3D DDPM for MRI Image Generation Using Tensor Networks","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T14:44:59.259766Z"},"links":{"cited_paper":"/paper/2108.06098","citing_paper":"/paper/2507.18112"},"observation_digest":"sha256:b4bd1bbc260feb47dfc2e9ee0cb8a831819402edfa07518d40f7ad4fa07b5bf5","observation_id":"a18beec2-4c5b-4f58-94ef-427a7311415d","resolution":{"observed_at":"2026-08-06T14:44:59.259766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2108.06098","last_updated":"2023-01-19T08:21:44Z","snapshot_observed_at":"2026-07-06T11:38:02.479171Z","submitted_at":"2021-08-13T07:16:40Z","title":"FedPara: Low-Rank Hadamard Product for Communication-Efficient Federated Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.06098","snapshot_observed_at":"2026-08-05T12:43:43.165012Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.01314","last_updated":"2025-09-01T09:58:52Z","snapshot_observed_at":"2026-08-08T18:45:32.376784Z","submitted_at":"2025-09-01T09:58:52Z","title":"Can Smaller LLMs do better? Unlocking Cross-Domain Potential through Parameter-Efficient Fine-Tuning for Text Summarization","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-05T12:43:43.165012Z"},"links":{"cited_paper":"/paper/2108.06098","citing_paper":"/paper/2509.01314"},"observation_digest":"sha256:8cb150d3e369ab3ea8da366e1b83d71662eb9d55e0966e510ee31752e7cf9963","observation_id":"b19b4225-8f32-48b5-a87e-c1e360412efd","resolution":{"observed_at":"2026-08-05T12:43:43.165012Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2108.06098","last_updated":"2023-01-19T08:21:44Z","snapshot_observed_at":"2026-07-06T11:38:02.479171Z","submitted_at":"2021-08-13T07:16:40Z","title":"FedPara: Low-Rank Hadamard Product for Communication-Efficient Federated Learning","version":3},"cited_work":{"arxiv_id":"2108.06098","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2108.06098","snapshot_observed_at":"2026-06-29T10:23:17.950956Z","title":"Fedpara: Low-rank hadamard product for communication-efficient federated learning.arXiv preprint arXiv: 2108.06098","venue":null,"work_id":"e2aaa36c-e39a-41a2-9820-5933399a4ef5","year":2021},"citing_paper":{"arxiv_id":"2604.14751","last_updated":"2026-04-16T08:03:54Z","snapshot_observed_at":"2026-07-06T23:02:27.141640Z","submitted_at":"2026-04-16T08:03:54Z","title":"Exploiting Correlations in Federated Learning: Opportunities and Practical Limitations","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-05-10T10:39:23.347685Z"},"links":{"cited_paper":"/paper/2108.06098","citing_paper":"/paper/2604.14751"},"observation_digest":"sha256:f768030900d41fa021b2a43e7d70f0d276cfbc7ba9016f4b263aa7abadc7a78f","observation_id":"3d2bf92f-5aa7-4c0c-a0d5-aab2c7da08a0","resolution":{"observed_at":"2026-05-10T10:39:37.718801Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2108.06098","last_updated":"2023-01-19T08:21:44Z","snapshot_observed_at":"2026-07-06T11:38:02.479171Z","submitted_at":"2021-08-13T07:16:40Z","title":"FedPara: Low-Rank Hadamard Product for Communication-Efficient Federated Learning","version":3},"cited_work":{"arxiv_id":"2108.06098","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2108.06098","snapshot_observed_at":"2026-06-29T10:23:17.950956Z","title":"Fedpara: Low-rank hadamard product for communication-efficient federated learning.arXiv preprint arXiv: 2108.06098","venue":null,"work_id":"e2aaa36c-e39a-41a2-9820-5933399a4ef5","year":2021},"citing_paper":{"arxiv_id":"2604.16400","last_updated":"2026-05-15T08:08:50Z","snapshot_observed_at":"2026-08-03T05:06:36.867183Z","submitted_at":"2026-03-31T09:49:47Z","title":"CoLLM: Continuous Adaptation for SLO-Aware LLM Serving on Shared GPU Clusters","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-21T10:33:00.445749Z"},"links":{"cited_paper":"/paper/2108.06098","citing_paper":"/paper/2604.16400"},"observation_digest":"sha256:1b9da588eaf76de54808c80e8e7f02052ea625e4a57113a17e6c26cd4f658ad3","observation_id":"e3827efd-b301-4c5a-b170-b681ef926f0d","resolution":{"observed_at":"2026-05-21T10:34:07.204964Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2108.06098","last_updated":"2023-01-19T08:21:44Z","snapshot_observed_at":"2026-07-06T11:38:02.479171Z","submitted_at":"2021-08-13T07:16:40Z","title":"FedPara: Low-Rank Hadamard Product for Communication-Efficient Federated Learning","version":3},"cited_work":{"arxiv_id":"2108.06098","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2108.06098","snapshot_observed_at":"2026-06-29T10:23:17.950956Z","title":"Fedpara: Low-rank hadamard product for communication-efficient federated learning.arXiv preprint arXiv: 2108.06098","venue":null,"work_id":"e2aaa36c-e39a-41a2-9820-5933399a4ef5","year":2021},"citing_paper":{"arxiv_id":"2604.16615","last_updated":"2026-04-17T18:12:33Z","snapshot_observed_at":"2026-07-06T23:03:52.631613Z","submitted_at":"2026-04-17T18:12:33Z","title":"Beyond Feature Fusion: Contextual Bayesian PEFT for Multimodal Uncertainty Estimation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-10T08:40:13.279841Z"},"links":{"cited_paper":"/paper/2108.06098","citing_paper":"/paper/2604.16615"},"observation_digest":"sha256:6f52e52a4fcbb4329f21877396de46fb1e841f2d99b3040242b1779da077aff4","observation_id":"b5b88b36-3c51-414d-8524-2a444488cff1","resolution":{"observed_at":"2026-05-10T08:43:01.827471Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2108.06098","last_updated":"2023-01-19T08:21:44Z","snapshot_observed_at":"2026-07-06T11:38:02.479171Z","submitted_at":"2021-08-13T07:16:40Z","title":"FedPara: Low-Rank Hadamard Product for Communication-Efficient Federated Learning","version":3},"cited_work":{"arxiv_id":"2108.06098","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2108.06098","snapshot_observed_at":"2026-06-29T10:23:17.950956Z","title":"Fedpara: Low-rank hadamard product for communication-efficient federated learning.arXiv preprint arXiv: 2108.06098","venue":null,"work_id":"e2aaa36c-e39a-41a2-9820-5933399a4ef5","year":2021},"citing_paper":{"arxiv_id":"2605.16470","last_updated":"2026-05-15T12:26:17Z","snapshot_observed_at":"2026-08-02T20:17:44.756595Z","submitted_at":"2026-05-15T12:26:17Z","title":"Strategic Over-Parameterization for Generalizable Low-Rank Adaptation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-20T20:09:50.546911Z"},"links":{"cited_paper":"/paper/2108.06098","citing_paper":"/paper/2605.16470"},"observation_digest":"sha256:77c8dd62be6c020c99ddfbdc89dfdaa358e567d42ee492a532b93e7b127a5420","observation_id":"169aa03a-6c16-47fb-bea6-170814d001c0","resolution":{"observed_at":"2026-05-20T20:13:44.002052Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2108.06098","last_updated":"2023-01-19T08:21:44Z","snapshot_observed_at":"2026-07-06T11:38:02.479171Z","submitted_at":"2021-08-13T07:16:40Z","title":"FedPara: Low-Rank Hadamard Product for Communication-Efficient Federated Learning","version":3},"cited_work":{"arxiv_id":"2108.06098","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2108.06098","snapshot_observed_at":"2026-06-29T10:23:17.950956Z","title":"Fedpara: Low-rank hadamard product for communication-efficient federated learning.arXiv preprint arXiv: 2108.06098","venue":null,"work_id":"e2aaa36c-e39a-41a2-9820-5933399a4ef5","year":2021},"citing_paper":{"arxiv_id":"2605.17552","last_updated":"2026-05-17T17:23:23Z","snapshot_observed_at":"2026-07-06T23:28:30.942078Z","submitted_at":"2026-05-17T17:23:23Z","title":"Q-LocalAdam: Memory-Efficient Client-Side Adaptive Optimization for Edge Federated Learning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-20T14:11:53.371521Z"},"links":{"cited_paper":"/paper/2108.06098","citing_paper":"/paper/2605.17552"},"observation_digest":"sha256:bee6b39f0fb7bde4cd96cfb79bf7732f790345c333c9791948baf6fe5d6b7afa","observation_id":"4118c0d2-206c-4b9d-9a2e-dac133f33e55","resolution":{"observed_at":"2026-05-20T14:13:21.244565Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2108.06098","last_updated":"2023-01-19T08:21:44Z","snapshot_observed_at":"2026-07-06T11:38:02.479171Z","submitted_at":"2021-08-13T07:16:40Z","title":"FedPara: Low-Rank Hadamard Product for Communication-Efficient Federated Learning","version":3},"cited_work":{"arxiv_id":"2108.06098","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2108.06098","snapshot_observed_at":"2026-06-29T10:23:17.950956Z","title":"Fedpara: Low-rank hadamard product for communication-efficient federated learning.arXiv preprint arXiv: 2108.06098","venue":null,"work_id":"e2aaa36c-e39a-41a2-9820-5933399a4ef5","year":2021},"citing_paper":{"arxiv_id":"2605.28980","last_updated":"2026-05-27T18:35:40Z","snapshot_observed_at":"2026-08-08T06:20:23.318951Z","submitted_at":"2026-05-27T18:35:40Z","title":"Manifold-based Algorithms for the Hadamard Decomposition","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-29T10:21:51.030749Z"},"links":{"cited_paper":"/paper/2108.06098","citing_paper":"/paper/2605.28980"},"observation_digest":"sha256:5832c7dbe6a8d59932f6693f628a545cd3f64cb03bb290889e7ea7b4d3a4626b","observation_id":"e51ec249-fd3b-4394-9b4f-31325071072c","resolution":{"observed_at":"2026-06-29T10:23:17.952584Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2108.06098/citation-record","integrity":"/paper/2108.06098/integrity","json":"/paper/2108.06098/citation-record.json","paper":"/paper/2108.06098"},"outbound":[],"paper":{"arxiv_id":"2108.06098","last_updated":"2023-01-19T08:21:44Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T11:38:02.479171Z","submitted_at":"2021-08-13T07:16:40Z","title":"FedPara: Low-Rank Hadamard Product for Communication-Efficient Federated Learning"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 12 inbound Pith citation observations for arXiv:2108.06098."}