{"as_of":"2026-08-16T02:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:42d7df6e5c898f6ca3e82a6040aa10a94d8830ff402ec4042a52cf1247206bac","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":13,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":13,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":13,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":13,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T18:40:58.504833Z","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-07-04T10:39:45.186557Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2211.12875","last_updated":"2023-09-12T08:34:18Z","snapshot_observed_at":"2026-08-13T13:36:07.271504Z","submitted_at":"2022-11-23T11:31:11Z","title":"A Survey of Deep Graph Clustering: Taxonomy, Challenge, Application, and Open Resource","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.12875","snapshot_observed_at":"2026-08-12T19:06:55.840649Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.11074","last_updated":"2024-11-17T13:22:15Z","snapshot_observed_at":"2026-08-13T13:18:22.169133Z","submitted_at":"2024-11-17T13:22:15Z","title":"Spectral Subspace Clustering for Attributed Graphs","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-12T19:06:55.840649Z"},"links":{"cited_paper":"/paper/2211.12875","citing_paper":"/paper/2411.11074"},"observation_digest":"sha256:22583c58254df68b9d91a3f19e100643c7ba6c47044727723d8fec156fb9634c","observation_id":"c2600d06-cd31-43d0-b76c-ea06c2a5fff1","resolution":{"observed_at":"2026-08-12T19:06:55.840649Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.12875","last_updated":"2023-09-12T08:34:18Z","snapshot_observed_at":"2026-08-13T13:36:07.271504Z","submitted_at":"2022-11-23T11:31:11Z","title":"A Survey of Deep Graph Clustering: Taxonomy, Challenge, Application, and Open Resource","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.12875","snapshot_observed_at":"2026-08-11T14:53:48.446457Z","title":"Z.; Liu, X.; and He, K","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.11550","last_updated":"2025-02-14T03:40:30Z","snapshot_observed_at":"2026-08-13T16:11:08.987761Z","submitted_at":"2024-12-16T08:33:56Z","title":"THESAURUS: Contrastive Graph Clustering by Swapping Fused Gromov-Wasserstein Couplings","version":3},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-11T14:53:48.446457Z"},"links":{"cited_paper":"/paper/2211.12875","citing_paper":"/paper/2412.11550"},"observation_digest":"sha256:88aca98a0ccc74be8f1d6fa8260a859ca4cfb83f2c967b0f278cdfc00d3a01ae","observation_id":"a073ff6c-ca6c-4b0c-bae5-b96bcda26c35","resolution":{"observed_at":"2026-08-11T14:53:48.446457Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.12875","last_updated":"2023-09-12T08:34:18Z","snapshot_observed_at":"2026-08-13T13:36:07.271504Z","submitted_at":"2022-11-23T11:31:11Z","title":"A Survey of Deep Graph Clustering: Taxonomy, Challenge, Application, and Open Resource","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.12875","snapshot_observed_at":"2026-08-11T14:28:10.720502Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.11983","last_updated":"2025-05-16T06:58:58Z","snapshot_observed_at":"2026-08-15T19:37:15.325308Z","submitted_at":"2024-12-16T17:04:40Z","title":"Leveraging Large Language Models for Effective Label-free Node Classification in Text-Attributed Graphs","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-11T14:28:10.720502Z"},"links":{"cited_paper":"/paper/2211.12875","citing_paper":"/paper/2412.11983"},"observation_digest":"sha256:c85986f37841de85166614ec121cd063febf04f2abae5e0b8381ea035ad44785","observation_id":"6910cd85-ad44-44fa-9316-7a4a85afad90","resolution":{"observed_at":"2026-08-11T14:28:10.720502Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.12875","last_updated":"2023-09-12T08:34:18Z","snapshot_observed_at":"2026-08-13T13:36:07.271504Z","submitted_at":"2022-11-23T11:31:11Z","title":"A Survey of Deep Graph Clustering: Taxonomy, Challenge, Application, and Open Resource","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.12875","snapshot_observed_at":"2026-08-10T00:33:44.035768Z","title":"A survey of deep graph clustering: Taxonomy, challenge, and application,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.18154","last_updated":"2025-01-30T05:39:01Z","snapshot_observed_at":"2026-08-14T20:37:14.064524Z","submitted_at":"2025-01-30T05:39:01Z","title":"Mixed-Precision Graph Neural Quantization for Low Bit Large Language Models","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-10T00:33:44.035768Z"},"links":{"cited_paper":"/paper/2211.12875","citing_paper":"/paper/2501.18154"},"observation_digest":"sha256:90370c43b24103b4b80a00a161612c4ba455b293e32c472753a457a53a7a7a24","observation_id":"41984acf-84d1-4a43-b4d8-7f602e240b6d","resolution":{"observed_at":"2026-08-10T00:33:44.035768Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.12875","last_updated":"2023-09-12T08:34:18Z","snapshot_observed_at":"2026-08-13T13:36:07.271504Z","submitted_at":"2022-11-23T11:31:11Z","title":"A Survey of Deep Graph Clustering: Taxonomy, Challenge, Application, and Open Resource","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.12875","snapshot_observed_at":"2026-08-15T18:40:58.504833Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.19343","last_updated":"2025-08-14T08:05:43Z","snapshot_observed_at":"2026-08-15T18:30:57.351477Z","submitted_at":"2025-06-24T06:15:44Z","title":"Discrepancy-Aware Graph Mask Auto-Encoder","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:58.504833Z"},"links":{"cited_paper":"/paper/2211.12875","citing_paper":"/paper/2506.19343"},"observation_digest":"sha256:b1fd448aea24cff7049be1c4641a3ecedfb86d6b6f0867cc35078830abe32bdc","observation_id":"914d3e0c-ce53-4f6c-8e52-c86412940a6c","resolution":{"observed_at":"2026-08-15T18:40:58.504833Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.12875","last_updated":"2023-09-12T08:34:18Z","snapshot_observed_at":"2026-08-13T13:36:07.271504Z","submitted_at":"2022-11-23T11:31:11Z","title":"A Survey of Deep Graph Clustering: Taxonomy, Challenge, Application, and Open Resource","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.12875","snapshot_observed_at":"2026-08-06T18:10:14.689888Z","title":"Li, Xinwang Liu, and Kunlun He","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.10595","last_updated":"2025-08-05T09:10:42Z","snapshot_observed_at":"2026-08-10T14:12:06.629673Z","submitted_at":"2025-07-12T03:33:19Z","title":"Divide-Then-Rule: A Cluster-Driven Hierarchical Interpolator for Attribute-Missing Graphs","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T18:10:14.689888Z"},"links":{"cited_paper":"/paper/2211.12875","citing_paper":"/paper/2507.10595"},"observation_digest":"sha256:4fc6d064d4abe5e8a94b4a55618b1ff525ffb7cb12b08d2b5f0dbe5391edec29","observation_id":"d9bfe688-e44f-4b40-9413-56e97ba918de","resolution":{"observed_at":"2026-08-06T18:10:14.689888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.12875","last_updated":"2023-09-12T08:34:18Z","snapshot_observed_at":"2026-08-13T13:36:07.271504Z","submitted_at":"2022-11-23T11:31:11Z","title":"A Survey of Deep Graph Clustering: Taxonomy, Challenge, Application, and Open Resource","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.12875","snapshot_observed_at":"2026-08-06T18:59:15.078824Z","title":"Z., Liu, X., and He, K","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-15T14:40:37.797467Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:15.078824Z"},"links":{"cited_paper":"/paper/2211.12875","citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:e9ec8d83e34b92c8b1db5a77b266a630bf1691db0fe059cf964eb077bd5035c5","observation_id":"c508602a-69a5-442a-a7b2-c760fd3616f4","resolution":{"observed_at":"2026-08-06T18:59:15.078824Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.12875","last_updated":"2023-09-12T08:34:18Z","snapshot_observed_at":"2026-08-13T13:36:07.271504Z","submitted_at":"2022-11-23T11:31:11Z","title":"A Survey of Deep Graph Clustering: Taxonomy, Challenge, Application, and Open Resource","version":4},"cited_work":{"arxiv_id":"2211.12875","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2211.12875","snapshot_observed_at":"2026-07-04T10:39:45.186557Z","title":"arXiv preprint arXiv:2211.12875 , year=","venue":null,"work_id":"1628c51b-4932-42c1-9ba7-1f6a981517e8","year":2023},"citing_paper":{"arxiv_id":"2509.24662","last_updated":"2025-09-29T12:08:22Z","snapshot_observed_at":"2026-08-01T21:57:42.497862Z","submitted_at":"2025-09-29T12:08:22Z","title":"Community detection robustness of graph neural networks","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-18T12:50:07.311967Z"},"links":{"cited_paper":"/paper/2211.12875","citing_paper":"/paper/2509.24662"},"observation_digest":"sha256:b3312a429274ec8f84243cc6f84ba977bca5d3f13e153e5b6763a600a0742a49","observation_id":"513d0bae-6720-480b-9f12-c797d108b311","resolution":{"observed_at":"2026-05-18T12:51:23.339506Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.12875","last_updated":"2023-09-12T08:34:18Z","snapshot_observed_at":"2026-08-13T13:36:07.271504Z","submitted_at":"2022-11-23T11:31:11Z","title":"A Survey of Deep Graph Clustering: Taxonomy, Challenge, Application, and Open Resource","version":4},"cited_work":{"arxiv_id":"2211.12875","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2211.12875","snapshot_observed_at":"2026-07-04T10:39:45.186557Z","title":"arXiv preprint arXiv:2211.12875 , year=","venue":null,"work_id":"1628c51b-4932-42c1-9ba7-1f6a981517e8","year":2023},"citing_paper":{"arxiv_id":"2605.05463","last_updated":"2026-05-06T21:38:38Z","snapshot_observed_at":"2026-08-15T14:52:37.385638Z","submitted_at":"2026-05-06T21:38:38Z","title":"Robustness of Graph Self-Supervised Learning to Real-World Noise: A Case Study on Text-Driven Biomedical Graphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-08T17:14:19.708464Z"},"links":{"cited_paper":"/paper/2211.12875","citing_paper":"/paper/2605.05463"},"observation_digest":"sha256:00f30264257730ffb5bb724667ad1ae9198ff794db1d0e0b34f687895c70441f","observation_id":"18a9b4f6-6b7a-4467-a5fb-7b55ad6304a8","resolution":{"observed_at":"2026-05-11T17:46:08.120350Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.12875","last_updated":"2023-09-12T08:34:18Z","snapshot_observed_at":"2026-08-13T13:36:07.271504Z","submitted_at":"2022-11-23T11:31:11Z","title":"A Survey of Deep Graph Clustering: Taxonomy, Challenge, Application, and Open Resource","version":4},"cited_work":{"arxiv_id":"2211.12875","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2211.12875","snapshot_observed_at":"2026-07-04T10:39:45.186557Z","title":"arXiv preprint arXiv:2211.12875 , year=","venue":null,"work_id":"1628c51b-4932-42c1-9ba7-1f6a981517e8","year":2023},"citing_paper":{"arxiv_id":"2605.05476","last_updated":"2026-05-06T21:53:49Z","snapshot_observed_at":"2026-08-10T23:19:14.775158Z","submitted_at":"2026-05-06T21:53:49Z","title":"A Unified Benchmark for Evaluating Knowledge Graph Construction Methods and Graph Neural Networks","version":1},"reference_index":131,"source":"arxiv_source","source_observed_at":"2026-05-08T17:08:49.668765Z"},"links":{"cited_paper":"/paper/2211.12875","citing_paper":"/paper/2605.05476"},"observation_digest":"sha256:97b308a0a6ba3f78a1aa5a93b5c68e75403576fb77be23328cb0eff8d6a7cf47","observation_id":"4c2a22a6-3c2e-45ae-922d-b4d330bbd3df","resolution":{"observed_at":"2026-05-11T17:46:14.393643Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.12875","last_updated":"2023-09-12T08:34:18Z","snapshot_observed_at":"2026-08-13T13:36:07.271504Z","submitted_at":"2022-11-23T11:31:11Z","title":"A Survey of Deep Graph Clustering: Taxonomy, Challenge, Application, and Open Resource","version":4},"cited_work":{"arxiv_id":"2211.12875","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2211.12875","snapshot_observed_at":"2026-07-04T10:39:45.186557Z","title":"arXiv preprint arXiv:2211.12875 , year=","venue":null,"work_id":"1628c51b-4932-42c1-9ba7-1f6a981517e8","year":2023},"citing_paper":{"arxiv_id":"2606.23199","last_updated":"2026-06-22T11:46:07Z","snapshot_observed_at":"2026-08-14T08:10:47.082985Z","submitted_at":"2026-06-22T11:46:07Z","title":"Bridge the Gaps: Heterogeneous Attributed Graph Clustering via Quaternion Representation Learning","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-06-26T08:39:35.139965Z"},"links":{"cited_paper":"/paper/2211.12875","citing_paper":"/paper/2606.23199"},"observation_digest":"sha256:e72642e75a6e963587a92846f88f5acca36ba21674c6f6001c810d7e823dc701","observation_id":"9771d326-ab08-418c-b565-40a78f324e1b","resolution":{"observed_at":"2026-07-04T10:39:45.188884Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.12875","last_updated":"2023-09-12T08:34:18Z","snapshot_observed_at":"2026-08-13T13:36:07.271504Z","submitted_at":"2022-11-23T11:31:11Z","title":"A Survey of Deep Graph Clustering: Taxonomy, Challenge, Application, and Open Resource","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.12875","snapshot_observed_at":"2026-07-11T13:58:57.633463Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.05469","last_updated":"2026-07-06T07:55:53Z","snapshot_observed_at":"2026-08-07T00:14:36.602852Z","submitted_at":"2026-07-06T07:55:53Z","title":"Breaking Structural Isolation: Scalable Graph Clustering via Community-Aware Sampling and Structural Entropy","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-11T13:58:57.633463Z"},"links":{"cited_paper":"/paper/2211.12875","citing_paper":"/paper/2607.05469"},"observation_digest":"sha256:bbc28b2e71a4218db88d9c54772775322dc0871667644c014ed34498fef6b573","observation_id":"d9265636-55e5-43c3-917f-d061af5a19e7","resolution":{"observed_at":"2026-07-11T13:58:57.633463Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.12875","last_updated":"2023-09-12T08:34:18Z","snapshot_observed_at":"2026-08-13T13:36:07.271504Z","submitted_at":"2022-11-23T11:31:11Z","title":"A Survey of Deep Graph Clustering: Taxonomy, Challenge, Application, and Open Resource","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.12875","snapshot_observed_at":"2026-08-01T07:36:10.044244Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.21435","last_updated":"2026-07-23T15:39:01Z","snapshot_observed_at":"2026-08-15T11:57:25.901949Z","submitted_at":"2026-07-23T15:39:01Z","title":"Revisiting Degree-Corrected Spectral Clustering: a Condition-Free Spectral Analysis and Extension","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-01T07:36:10.044244Z"},"links":{"cited_paper":"/paper/2211.12875","citing_paper":"/paper/2607.21435"},"observation_digest":"sha256:8a91f6dc764317b30531f0c09f6eba49d7a301293fafe8cdf5980f0412adde03","observation_id":"4499490b-2e78-49c4-bc01-039083398e4a","resolution":{"observed_at":"2026-08-01T07:36:10.044244Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2211.12875/citation-record","integrity":"/paper/2211.12875/integrity","json":"/paper/2211.12875/citation-record.json","paper":"/paper/2211.12875"},"outbound":[],"paper":{"arxiv_id":"2211.12875","last_updated":"2023-09-12T08:34:18Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T13:36:07.271504Z","submitted_at":"2022-11-23T11:31:11Z","title":"A Survey of Deep Graph Clustering: Taxonomy, Challenge, Application, and Open Resource"},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 13 inbound Pith citation observations for arXiv:2211.12875."}