Paper Citation Record · LEDGER

Computationally Efficient Collaborative Communication Via Regularity-Based Coarsening

As of 22 August 2026, this Paper Citation Record lists 15 of 15 outbound references and 0 inbound Pith citation observations for arXiv:2608.05327.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2608.05327 v1

Coverage vector

measured 15 of 15 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-08T15:24:32.322062Z

measured 15 of 15 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-22T06:32:14.747728+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

15 of 15 outbound references displayed

verified exact3
verified fuzzy8
unresolved2
parse uncertain0
malformed identifier0
metadata mismatch2

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 47b24962-7b63-4ba9-af99-ea3cd92c3d2a · outbound

This paper cites NP-Completeness of Deterministic Communication Complexity via Relaxed Interlacing.

Computationally Efficient Collaborative Communication Via Regularity-Based Coarsening NP-Completeness of Deterministic Communication Complexity via Relaxed Interlacing

Reference 4

Resolution: verified exact; local_arxiv, observed 2026-08-08T15:24:32.411844Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation de41e77c-8b0f-4249-b7f7-15edb4e33781 · outbound

This paper cites Oracle efficient online multicalibration and omniprediction.

Computationally Efficient Collaborative Communication Via Regularity-Based Coarsening Oracle efficient online multicalibration and omniprediction

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T15:24:32.510558Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation e2824cef-500c-42ef-9f5e-8b0cdb6e906c · outbound

This paper cites Communicating with anecdotes.

Computationally Efficient Collaborative Communication Via Regularity-Based Coarsening Communicating with anecdotes

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T15:24:32.488925Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation d12b3ec8-a24f-4395-8ee8-2a4b3f61da20 · outbound

This paper cites Communication Complexity is NP-hard.

Computationally Efficient Collaborative Communication Via Regularity-Based Coarsening Communication Complexity is NP-hard

Reference 9

Resolution: verified exact; local_arxiv, observed 2026-08-08T15:24:32.385985Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation ae143d0e-ce44-45d2-a301-7c6fb92d97aa · outbound

This paper cites Multical- ibration: Calibration for the (computationally-identifiable) masses.

Computationally Efficient Collaborative Communication Via Regularity-Based Coarsening Multical- ibration: Calibration for the (computationally-identifiable) masses

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T15:24:32.478745Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 06fc25e3-43b8-48c2-96a3-39efd326b643 · outbound

This paper cites Platforms for efficient and incentive-aware collaboration.

Computationally Efficient Collaborative Communication Via Regularity-Based Coarsening Platforms for efficient and incentive-aware collaboration

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T15:24:32.468296Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation f8d05ecd-d8a3-47a1-8cf8-37b71ed97d23 · outbound

This paper cites Np-hardness of circuit minimization for multi-output functions.

Computationally Efficient Collaborative Communication Via Regularity-Based Coarsening Np-hardness of circuit minimization for multi-output functions

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T15:24:32.457863Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 2afb2216-9130-419e-8fae-dd6a276a1956 · outbound

This paper cites False Consensus, Information Theory, and Prediction Markets.

Computationally Efficient Collaborative Communication Via Regularity-Based Coarsening False Consensus, Information Theory, and Prediction Markets

Reference 13

Resolution: metadata mismatch; local_arxiv, observed 2026-08-08T15:24:32.371564Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 57e2fde3-3afc-452f-a261-1a5010e6a24a · outbound

This paper cites A direct proof for Lovett's bound on the communication complexity of low rank matrices.

Computationally Efficient Collaborative Communication Via Regularity-Based Coarsening A direct proof for Lovett's bound on the communication complexity of low rank matrices

Reference 1995

Resolution: metadata mismatch; local_arxiv, observed 2026-08-08T15:24:32.356564Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 9d0abf30-1568-4d3d-b269-86b05468cdac · outbound

This paper cites Hardness of constant-round com- munication complexity.

Computationally Efficient Collaborative Communication Via Regularity-Based Coarsening Hardness of constant-round com- munication complexity

Reference 2007

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T15:24:32.500211Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 839dbf5d-f9e5-4b11-9084-2233a198731a · outbound

This paper cites Lattices, mobius functions and communications complexity.

Computationally Efficient Collaborative Communication Via Regularity-Based Coarsening Lattices, mobius functions and communications complexity

Reference 2016

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T15:24:32.447370Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation f21efd88-b287-4eb4-b199-92b3df665a66 · outbound

This paper cites From Pseudorandomness to Multi-Group Fairness and Back.

Computationally Efficient Collaborative Communication Via Regularity-Based Coarsening From Pseudorandomness to Multi-Group Fairness and Back

Reference 2021

Resolution: verified exact; local_arxiv, observed 2026-08-08T15:24:32.435988Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 981a8bb0-e61f-45d5-bc1d-8eed6557d1e6 · outbound

This paper cites Loss Minimization through the Lens of Outcome Indistinguishability.

Computationally Efficient Collaborative Communication Via Regularity-Based Coarsening Loss Minimization through the Lens of Outcome Indistinguishability

Reference 2022

Resolution: unresolved; no resolver link, observed 2026-08-08T15:24:32.275321Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9f695d6e-547b-4b1c-8600-fa71fded7f4d · outbound

This paper cites Omnipredictors.

Computationally Efficient Collaborative Communication Via Regularity-Based Coarsening Omnipredictors

Reference 2024

Resolution: unresolved; no resolver link, observed 2026-08-08T15:24:32.287673Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4bc14ac5-d111-43c5-8f6f-c5677da1e7b1 · outbound

This paper cites Collaborative prediction: Tractable information aggregation via agreement.

Computationally Efficient Collaborative Communication Via Regularity-Based Coarsening Collaborative prediction: Tractable information aggregation via agreement

Reference 2025

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T15:24:32.521061Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Pith citing papers

No inbound Pith citation observations are available.