{"as_of":"2026-08-09T10:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:49f254eb1011fe7665e95486350d5ca743df8b17c3850b7c0656e978e5ace9ab","coverage":[{"denominator":15,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T15:24:32.322062Z","state":"measured"},{"denominator":15,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":15,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2608.05327/citation-record","integrity":"/paper/2608.05327/integrity","json":"/paper/2608.05327/citation-record.json","paper":"/paper/2608.05327"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2508.05597","last_updated":"2026-04-13T07:17:28Z","snapshot_observed_at":"2026-07-06T22:09:33.606473Z","submitted_at":"2025-08-07T17:39:40Z","title":"NP-Completeness of Deterministic Communication Complexity via Relaxed Interlacing","version":4},"cited_work":{"arxiv_id":"2508.05597","doi":null,"metadata_source":"pith","pith_arxiv_id":"2508.05597","snapshot_observed_at":"2026-08-08T15:24:32.407544Z","title":"NP-Completeness of Deterministic Communication Complexity via Relaxed Interlacing","venue":"cs.CC","work_id":"f5e28c0d-f147-48c0-89b1-1f58098d6389","year":2025},"citing_paper":{"arxiv_id":"2608.05327","last_updated":"2026-08-05T18:34:19Z","snapshot_observed_at":"2026-08-09T10:10:28.211735Z","submitted_at":"2026-08-05T18:34:19Z","title":"Computationally Efficient Collaborative Communication Via Regularity-Based Coarsening","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-08T15:24:32.279371Z"},"links":{"cited_paper":"/paper/2508.05597","citing_paper":"/paper/2608.05327"},"observation_digest":"sha256:0f3a3effe974d48ef331ffd8cc679f32ba123c23335c1ce8c20204e46dd77699","observation_id":"47b24962-7b63-4ba9-af99-ea3cd92c3d2a","resolution":{"observed_at":"2026-08-08T15:24:32.411844Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:24:32.506939Z","title":"Oracle efficient online multicalibration and omniprediction","venue":null,"work_id":"5f0ed4a7-c8ac-400f-8347-33725ab12270","year":2024},"citing_paper":{"arxiv_id":"2608.05327","last_updated":"2026-08-05T18:34:19Z","snapshot_observed_at":"2026-08-09T10:10:28.211735Z","submitted_at":"2026-08-05T18:34:19Z","title":"Computationally Efficient Collaborative Communication Via Regularity-Based Coarsening","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-08T15:24:32.283836Z"},"links":{"citing_paper":"/paper/2608.05327"},"observation_digest":"sha256:abbffbda7697f3e9d42d9631ff056722c95b11ba8e1f3b508f812ea9305cbdde","observation_id":"de41e77c-8b0f-4249-b7f7-15edb4e33781","resolution":{"observed_at":"2026-08-08T15:24:32.510558Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:24:32.485305Z","title":"Communicating with anecdotes","venue":null,"work_id":"22eaf46a-a9bc-4101-9241-a4967696048b","year":2024},"citing_paper":{"arxiv_id":"2608.05327","last_updated":"2026-08-05T18:34:19Z","snapshot_observed_at":"2026-08-09T10:10:28.211735Z","submitted_at":"2026-08-05T18:34:19Z","title":"Computationally Efficient Collaborative Communication Via Regularity-Based Coarsening","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-08T15:24:32.295241Z"},"links":{"citing_paper":"/paper/2608.05327"},"observation_digest":"sha256:4386b357cb201fbb1c3b13858b12ad07b355e83cda2f05290273baa8baa7e5f1","observation_id":"e2824cef-500c-42ef-9f5e-8b0cdb6e906c","resolution":{"observed_at":"2026-08-08T15:24:32.488925Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.10426","last_updated":"2025-07-14T16:15:54Z","snapshot_observed_at":"2026-08-06T17:29:00.619564Z","submitted_at":"2025-07-14T16:15:54Z","title":"Communication Complexity is NP-hard","version":1},"cited_work":{"arxiv_id":"2507.10426","doi":null,"metadata_source":"pith","pith_arxiv_id":"2507.10426","snapshot_observed_at":"2026-08-08T15:24:32.382105Z","title":"Communication Complexity is NP-hard","venue":"cs.CC","work_id":"af9716a7-ec60-4b80-859c-e80ec848ad7a","year":2025},"citing_paper":{"arxiv_id":"2608.05327","last_updated":"2026-08-05T18:34:19Z","snapshot_observed_at":"2026-08-09T10:10:28.211735Z","submitted_at":"2026-08-05T18:34:19Z","title":"Computationally Efficient Collaborative Communication Via Regularity-Based Coarsening","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-08T15:24:32.298912Z"},"links":{"cited_paper":"/paper/2507.10426","citing_paper":"/paper/2608.05327"},"observation_digest":"sha256:41940cb2678f340480837ea59423c10bc38b385dcce8d0ebe3061d2f33d69770","observation_id":"d12b3ec8-a24f-4395-8ee8-2a4b3f61da20","resolution":{"observed_at":"2026-08-08T15:24:32.385985Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:24:32.475102Z","title":"Multical- ibration: Calibration for the (computationally-identifiable) masses","venue":null,"work_id":"e6545ffe-9674-4a47-8a3d-d8e12053c050","year":1939},"citing_paper":{"arxiv_id":"2608.05327","last_updated":"2026-08-05T18:34:19Z","snapshot_observed_at":"2026-08-09T10:10:28.211735Z","submitted_at":"2026-08-05T18:34:19Z","title":"Computationally Efficient Collaborative Communication Via Regularity-Based Coarsening","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-08T15:24:32.303155Z"},"links":{"citing_paper":"/paper/2608.05327"},"observation_digest":"sha256:ec1f8023f856d0048d567315132674f53fd888930f76588a2c689c1afc57b0ea","observation_id":"ae143d0e-ce44-45d2-a301-7c6fb92d97aa","resolution":{"observed_at":"2026-08-08T15:24:32.478745Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:24:32.464653Z","title":"Platforms for efficient and incentive-aware collaboration","venue":null,"work_id":"8dc0aa28-04e6-499e-ad6b-2d845b87212c","year":2025},"citing_paper":{"arxiv_id":"2608.05327","last_updated":"2026-08-05T18:34:19Z","snapshot_observed_at":"2026-08-09T10:10:28.211735Z","submitted_at":"2026-08-05T18:34:19Z","title":"Computationally Efficient Collaborative Communication Via Regularity-Based Coarsening","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-08T15:24:32.306818Z"},"links":{"citing_paper":"/paper/2608.05327"},"observation_digest":"sha256:08133986ddefb588193bdf36f8a8d26dd57872ad06d221160906ff5f199b2f69","observation_id":"06fc25e3-43b8-48c2-96a3-39efd326b643","resolution":{"observed_at":"2026-08-08T15:24:32.468296Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:24:32.454001Z","title":"Np-hardness of circuit minimization for multi-output functions","venue":null,"work_id":"0c00fd49-1bef-4a56-95ab-7ed33f7814d3","year":2020},"citing_paper":{"arxiv_id":"2608.05327","last_updated":"2026-08-05T18:34:19Z","snapshot_observed_at":"2026-08-09T10:10:28.211735Z","submitted_at":"2026-08-05T18:34:19Z","title":"Computationally Efficient Collaborative Communication Via Regularity-Based Coarsening","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-08T15:24:32.310537Z"},"links":{"citing_paper":"/paper/2608.05327"},"observation_digest":"sha256:997d30de4d6168de9232ee0dbaa3bc3d9f19aee9f1ac4dc3c145f8dbd0fee4ae","observation_id":"f8d05ecd-d8a3-47a1-8cf8-37b71ed97d23","resolution":{"observed_at":"2026-08-08T15:24:32.457863Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2206.02993","last_updated":"2022-11-24T12:17:52Z","snapshot_observed_at":"2026-07-06T13:18:06.376608Z","submitted_at":"2022-06-07T03:46:11Z","title":"False Consensus, Information Theory, and Prediction Markets","version":2},"cited_work":{"arxiv_id":"2206.02993","doi":null,"metadata_source":"pith","pith_arxiv_id":"2206.02993","snapshot_observed_at":"2026-08-08T15:24:32.367425Z","title":"False Consensus, Information Theory, and Prediction Markets","venue":"cs.GT","work_id":"9c729487-6a7b-4ec3-b3a3-b2b4e0d119a0","year":2022},"citing_paper":{"arxiv_id":"2608.05327","last_updated":"2026-08-05T18:34:19Z","snapshot_observed_at":"2026-08-09T10:10:28.211735Z","submitted_at":"2026-08-05T18:34:19Z","title":"Computationally Efficient Collaborative Communication Via Regularity-Based Coarsening","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-08T15:24:32.314360Z"},"links":{"cited_paper":"/paper/2206.02993","citing_paper":"/paper/2608.05327"},"observation_digest":"sha256:2d7289d0eb71bc6f0402bed8ad28e61dcfdbbb245ecca5591a261794d6838bac","observation_id":"2afb2216-9130-419e-8fae-dd6a276a1956","resolution":{"observed_at":"2026-08-08T15:24:32.371564Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1409.6366","last_updated":"2014-09-22T22:40:24Z","snapshot_observed_at":"2026-08-09T10:11:49.232731Z","submitted_at":"2014-09-22T22:40:24Z","title":"A direct proof for Lovett's bound on the communication complexity of low rank matrices","version":1},"cited_work":{"arxiv_id":"1409.6366","doi":null,"metadata_source":"pith","pith_arxiv_id":"1409.6366","snapshot_observed_at":"2026-08-08T15:24:32.350587Z","title":"A direct proof for Lovett's bound on the communication complexity of low rank matrices","venue":"cs.CC","work_id":"ef16ac76-185f-4c94-8548-2ff22cfd095f","year":2014},"citing_paper":{"arxiv_id":"2608.05327","last_updated":"2026-08-05T18:34:19Z","snapshot_observed_at":"2026-08-09T10:10:28.211735Z","submitted_at":"2026-08-05T18:34:19Z","title":"Computationally Efficient Collaborative Communication Via Regularity-Based Coarsening","version":1},"reference_index":1995,"source":"pdf_text","source_observed_at":"2026-08-08T15:24:32.322062Z"},"links":{"cited_paper":"/paper/1409.6366","citing_paper":"/paper/2608.05327"},"observation_digest":"sha256:558e66a514dce25540af7e69012781691cfe9a5c9a44fba12dcbe5ac4152f026","observation_id":"57e2fde3-3afc-452f-a261-1a5010e6a24a","resolution":{"observed_at":"2026-08-08T15:24:32.356564Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:24:32.496085Z","title":"Hardness of constant-round com- munication complexity","venue":null,"work_id":"2db5f5fd-ec46-41ce-a098-9ac5e4e8e33d","year":2021},"citing_paper":{"arxiv_id":"2608.05327","last_updated":"2026-08-05T18:34:19Z","snapshot_observed_at":"2026-08-09T10:10:28.211735Z","submitted_at":"2026-08-05T18:34:19Z","title":"Computationally Efficient Collaborative Communication Via Regularity-Based Coarsening","version":1},"reference_index":2007,"source":"pdf_text","source_observed_at":"2026-08-08T15:24:32.291637Z"},"links":{"citing_paper":"/paper/2608.05327"},"observation_digest":"sha256:5a856d0a8fbc348497b156ab7a08d7210e5904e347f8c74262a24f4cba32bcfc","observation_id":"9d0abf30-1568-4d3d-b269-86b05468cdac","resolution":{"observed_at":"2026-08-08T15:24:32.500211Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:24:32.443546Z","title":"Lattices, mobius functions and communications complexity","venue":null,"work_id":"efd8212a-5ad3-4831-8caf-3bb56fad86c6","year":1988},"citing_paper":{"arxiv_id":"2608.05327","last_updated":"2026-08-05T18:34:19Z","snapshot_observed_at":"2026-08-09T10:10:28.211735Z","submitted_at":"2026-08-05T18:34:19Z","title":"Computationally Efficient Collaborative Communication Via Regularity-Based Coarsening","version":1},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-08T15:24:32.318653Z"},"links":{"citing_paper":"/paper/2608.05327"},"observation_digest":"sha256:0806499b91b2e483335ea47c6ea24164473e41d0f02dd234888679cff85cf50b","observation_id":"839dbf5d-f9e5-4b11-9084-2233a198731a","resolution":{"observed_at":"2026-08-08T15:24:32.447370Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.08837","last_updated":"2025-07-09T17:56:58Z","snapshot_observed_at":"2026-07-06T14:43:20.254593Z","submitted_at":"2023-01-21T00:37:12Z","title":"From Pseudorandomness to Multi-Group Fairness and Back","version":4},"cited_work":{"arxiv_id":"2301.08837","doi":null,"metadata_source":"pith","pith_arxiv_id":"2301.08837","snapshot_observed_at":"2026-08-08T15:24:32.432259Z","title":"From Pseudorandomness to Multi-Group Fairness and Back","venue":"cs.LG","work_id":"7663fa9c-c0b9-41ae-8b93-6c4a06e7d486","year":2023},"citing_paper":{"arxiv_id":"2608.05327","last_updated":"2026-08-05T18:34:19Z","snapshot_observed_at":"2026-08-09T10:10:28.211735Z","submitted_at":"2026-08-05T18:34:19Z","title":"Computationally Efficient Collaborative Communication Via Regularity-Based Coarsening","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-08T15:24:32.270923Z"},"links":{"cited_paper":"/paper/2301.08837","citing_paper":"/paper/2608.05327"},"observation_digest":"sha256:958bdaff8ee6ae2424c71b1fd52eba58c0ac9d4686f83775cc9ec9adb430f946","observation_id":"f21efd88-b287-4eb4-b199-92b3df665a66","resolution":{"observed_at":"2026-08-08T15:24:32.435988Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.08649","last_updated":"2022-12-08T18:40:52Z","snapshot_observed_at":"2026-08-03T13:44:34.198055Z","submitted_at":"2022-10-16T22:25:27Z","title":"Loss Minimization through the Lens of Outcome Indistinguishability","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.08649","snapshot_observed_at":"2026-08-08T15:24:32.275321Z","title":"Kim, Omer Reingold, and Udi Wieder","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.05327","last_updated":"2026-08-05T18:34:19Z","snapshot_observed_at":"2026-08-09T10:10:28.211735Z","submitted_at":"2026-08-05T18:34:19Z","title":"Computationally Efficient Collaborative Communication Via Regularity-Based Coarsening","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-08T15:24:32.275321Z"},"links":{"cited_paper":"/paper/2210.08649","citing_paper":"/paper/2608.05327"},"observation_digest":"sha256:cfdad1a81461b24c80f1de599c414f126a0967386655e24ce852ab0d1033039d","observation_id":"981a8bb0-e61f-45d5-bc1d-8eed6557d1e6","resolution":{"observed_at":"2026-08-08T15:24:32.275321Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2109.05389","last_updated":"2021-09-11T23:28:49Z","snapshot_observed_at":"2026-08-05T00:26:50.900339Z","submitted_at":"2021-09-11T23:28:49Z","title":"Omnipredictors","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2109.05389","snapshot_observed_at":"2026-08-08T15:24:32.287673Z","title":"Omnipredictors.arXiv preprint arXiv:2109.05389,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.05327","last_updated":"2026-08-05T18:34:19Z","snapshot_observed_at":"2026-08-09T10:10:28.211735Z","submitted_at":"2026-08-05T18:34:19Z","title":"Computationally Efficient Collaborative Communication Via Regularity-Based Coarsening","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-08T15:24:32.287673Z"},"links":{"cited_paper":"/paper/2109.05389","citing_paper":"/paper/2608.05327"},"observation_digest":"sha256:33aec8006a16908006a3453e1cd0a43ed0eb66f18fe10b14bc0ff5e8bcf3ca4f","observation_id":"9f695d6e-547b-4b1c-8600-fa71fded7f4d","resolution":{"observed_at":"2026-08-08T15:24:32.287673Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:24:32.517351Z","title":"Collaborative prediction: Tractable information aggregation via agreement","venue":null,"work_id":"c8019790-2ea4-46a0-886a-0c9830824027","year":2026},"citing_paper":{"arxiv_id":"2608.05327","last_updated":"2026-08-05T18:34:19Z","snapshot_observed_at":"2026-08-09T10:10:28.211735Z","submitted_at":"2026-08-05T18:34:19Z","title":"Computationally Efficient Collaborative Communication Via Regularity-Based Coarsening","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-08T15:24:32.266697Z"},"links":{"citing_paper":"/paper/2608.05327"},"observation_digest":"sha256:69a22a7a7cb407a4626aa548824adc2e3d7d53a3932b8826ae4625825f70b73f","observation_id":"4bc14ac5-d111-43c5-8f6f-c5677da1e7b1","resolution":{"observed_at":"2026-08-08T15:24:32.521061Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.05327","last_updated":"2026-08-05T18:34:19Z","latest_version":1,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-09T10:10:28.211735Z","submitted_at":"2026-08-05T18:34:19Z","title":"Computationally Efficient Collaborative Communication Via Regularity-Based Coarsening"},"reference_resolution":{"displayed":15,"state_counts":{"malformed_identifier":0,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":2,"verified_exact":3,"verified_fuzzy":8},"total_outbound_references":15},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 15 of 15 outbound references and 0 inbound Pith citation observations for arXiv:2608.05327."}