Paper Citation Record · LEDGER

Testing Bipartiteness in Logarithmic Rounds

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

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

pith.paper-citation-record.v1
2606.13583 v1

Coverage vector

measured 30 of 30 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-06-27T04:52:09.324445Z

measured 30 of 30 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

30 of 30 outbound references displayed

verified exact2
verified fuzzy0
unresolved27
parse uncertain0
malformed identifier0
metadata mismatch1

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation faee855d-7d15-4dcf-b1b0-c03b9635c753 · outbound

This paper cites Property Testing in Bounded Degree Hypergraphs.

Testing Bipartiteness in Logarithmic Rounds Property Testing in Bounded Degree Hypergraphs

Reference 1

Resolution: verified exact; arxiv_id, observed 2026-07-03T16:58:42.790180Z

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 29e4a4ed-fb7f-4502-a10e-8d8e534462bb · outbound

This paper cites Proceedings of the ACM Web Conference 2023 , pages=.

Testing Bipartiteness in Logarithmic Rounds Proceedings of the ACM Web Conference 2023 , pages=

Reference 2

Resolution: unresolved; no resolver link, observed 2026-06-27T04:52:09.324445Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1c3266f1-d9a2-4c69-8def-f1633d95cf2d · outbound

This paper cites Testing closeness of discrete distributions , journal =.

Testing Bipartiteness in Logarithmic Rounds Testing closeness of discrete distributions , journal =

Reference 3

Resolution: metadata mismatch; arxiv_id, observed 2026-06-27T05:00:35.570356Z

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 19b47209-f63f-4a41-99a3-30b70a188b44 · outbound

This paper cites The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002.

Testing Bipartiteness in Logarithmic Rounds The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002

Reference 4

Resolution: unresolved; no resolver link, observed 2026-06-27T04:52:09.324445Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e0fb3b8d-c8c0-4ed0-a4c5-31dddd096a2a · outbound

This paper cites ACM Transactions on Algorithms (TALG) , volume=.

Testing Bipartiteness in Logarithmic Rounds ACM Transactions on Algorithms (TALG) , volume=

Reference 5

Resolution: unresolved; no resolver link, observed 2026-06-27T04:52:09.324445Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 914936df-944e-4d00-8fad-637bd0f68a9d · outbound

This paper cites 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) , pages=.

Testing Bipartiteness in Logarithmic Rounds 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) , pages=

Reference 6

Resolution: unresolved; no resolver link, observed 2026-06-27T04:52:09.324445Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7e0aa0de-bae4-47de-a6ec-9780ee0ab918 · outbound

This paper cites Combinatorics, Probability and Computing , volume=.

Testing Bipartiteness in Logarithmic Rounds Combinatorics, Probability and Computing , volume=

Reference 7

Resolution: unresolved; no resolver link, observed 2026-06-27T04:52:09.324445Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e962f474-d0da-4b98-b961-0ad491165b55 · outbound

This paper cites Random Structures & Algorithms , volume=.

Testing Bipartiteness in Logarithmic Rounds Random Structures & Algorithms , volume=

Reference 8

Resolution: unresolved; no resolver link, observed 2026-06-27T04:52:09.324445Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9db1c070-67ef-45ed-b434-d3c6c6b9ff29 · outbound

This paper cites Proceedings of the forty-seventh annual ACM symposium on Theory of Computing , pages=.

Testing Bipartiteness in Logarithmic Rounds Proceedings of the forty-seventh annual ACM symposium on Theory of Computing , pages=

Reference 9

Resolution: unresolved; no resolver link, observed 2026-06-27T04:52:09.324445Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d4db2c79-0697-4403-b0a3-e57bd510af72 · outbound

This paper cites 1st Symposium on Simplicity in Algorithms , year=.

Testing Bipartiteness in Logarithmic Rounds 1st Symposium on Simplicity in Algorithms , year=

Reference 10

Resolution: unresolved; no resolver link, observed 2026-06-27T04:52:09.324445Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c50bd711-7f04-42fe-a7eb-519aae221bb3 · outbound

This paper cites SIAM Journal on Computing , volume=.

Testing Bipartiteness in Logarithmic Rounds SIAM Journal on Computing , volume=

Reference 11

Resolution: unresolved; no resolver link, observed 2026-06-27T04:52:09.324445Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 94e43d69-1f3c-4559-b134-6da7a964f986 · outbound

This paper cites A dichotomy theorem for multi-pass streaming.

Testing Bipartiteness in Logarithmic Rounds A dichotomy theorem for multi-pass streaming

Reference 12

Resolution: unresolved; no resolver link, observed 2026-06-27T04:52:09.324445Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ef0cbfdb-be11-4589-97b4-2ce96c359a75 · outbound

This paper cites Unbounded-width.

Testing Bipartiteness in Logarithmic Rounds Unbounded-width

Reference 13

Resolution: unresolved; no resolver link, observed 2026-06-27T04:52:09.324445Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 369d6788-b75a-4a1d-8e87-41ab6369646a · outbound

This paper cites Near-Optimal Space Lower Bounds for Streaming.

Testing Bipartiteness in Logarithmic Rounds Near-Optimal Space Lower Bounds for Streaming

Reference 14

Resolution: unresolved; no resolver link, observed 2026-06-27T04:52:09.324445Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation db4a4e14-7ff1-4e04-b0ec-26fba1fcb3e2 · outbound

This paper cites Testing Properties of Edge Distributions.

Testing Bipartiteness in Logarithmic Rounds Testing Properties of Edge Distributions

Reference 15

Resolution: verified exact; arxiv_id, observed 2026-08-14T01:00:38.292295Z

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 d818d636-bc01-4b43-b0e6-84d58796b3f9 · outbound

This paper cites Journal of the ACM (JACM) , volume=.

Testing Bipartiteness in Logarithmic Rounds Journal of the ACM (JACM) , volume=

Reference 16

Resolution: unresolved; no resolver link, observed 2026-06-27T04:52:09.324445Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 414007a6-0b07-4635-b0b7-7d3b9cc0b790 · outbound

This paper cites Combinatorica , volume=.

Testing Bipartiteness in Logarithmic Rounds Combinatorica , volume=

Reference 17

Resolution: unresolved; no resolver link, observed 2026-06-27T04:52:09.324445Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d2127b35-6026-46bf-8f44-99e8e3e82801 · outbound

This paper cites Algorithmica , volume=.

Testing Bipartiteness in Logarithmic Rounds Algorithmica , volume=

Reference 18

Resolution: unresolved; no resolver link, observed 2026-06-27T04:52:09.324445Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 48aa142d-0ebf-443a-9c28-7126b3177449 · outbound

This paper cites Studies in Complexity and Cryptography , pages=.

Testing Bipartiteness in Logarithmic Rounds Studies in Complexity and Cryptography , pages=

Reference 19

Resolution: unresolved; no resolver link, observed 2026-06-27T04:52:09.324445Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 04dc72c8-98bf-4505-b984-4307cb4e494e · outbound

This paper cites 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024) , pages=.

Testing Bipartiteness in Logarithmic Rounds 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024) , pages=

Reference 20

Resolution: unresolved; no resolver link, observed 2026-06-27T04:52:09.324445Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ee7cd9b7-0abd-4e69-8f29-5cf9a9800367 · outbound

This paper cites SIAM Journal on Computing , volume=.

Testing Bipartiteness in Logarithmic Rounds SIAM Journal on Computing , volume=

Reference 21

Resolution: unresolved; no resolver link, observed 2026-06-27T04:52:09.324445Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b1d88d9d-164e-4626-a7bf-bbb0ce1a825d · outbound

This paper cites SIAM Journal on computing , volume=.

Testing Bipartiteness in Logarithmic Rounds SIAM Journal on computing , volume=

Reference 22

Resolution: unresolved; no resolver link, observed 2026-06-27T04:52:09.324445Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bc5ffbcd-5c3b-4e72-837f-5099a511bda9 · outbound

This paper cites Optimal inapproximability results for.

Testing Bipartiteness in Logarithmic Rounds Optimal inapproximability results for

Reference 23

Resolution: unresolved; no resolver link, observed 2026-06-27T04:52:09.324445Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2d76a4c2-4a11-44f7-9eb0-fb4eed58f313 · outbound

This paper cites Random Walks and Forbidden Minors.

Testing Bipartiteness in Logarithmic Rounds Random Walks and Forbidden Minors

Reference 24

Resolution: unresolved; no resolver link, observed 2026-06-27T04:52:09.324445Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0638adaa-e878-4538-9d37-67ea1c7f29ae · outbound

This paper cites Information and Computation , volume=.

Testing Bipartiteness in Logarithmic Rounds Information and Computation , volume=

Reference 25

Resolution: unresolved; no resolver link, observed 2026-06-27T04:52:09.324445Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fec0fdda-4123-4b81-aa36-d8388008f7e1 · outbound

This paper cites Proceedings of the fortieth annual ACM symposium on theory of computing , pages=.

Testing Bipartiteness in Logarithmic Rounds Proceedings of the fortieth annual ACM symposium on theory of computing , pages=

Reference 26

Resolution: unresolved; no resolver link, observed 2026-06-27T04:52:09.324445Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 37f02536-3d4d-4861-ac9e-2a0caffad557 · outbound

This paper cites Sublinear-time algorithms for.

Testing Bipartiteness in Logarithmic Rounds Sublinear-time algorithms for

Reference 27

Resolution: unresolved; no resolver link, observed 2026-06-27T04:52:09.324445Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5bc0abda-030a-48a8-b2d9-f21e8503ae3c · outbound

This paper cites IEICE TRANSACTIONS on Information and Systems , volume=.

Testing Bipartiteness in Logarithmic Rounds IEICE TRANSACTIONS on Information and Systems , volume=

Reference 28

Resolution: unresolved; no resolver link, observed 2026-06-27T04:52:09.324445Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7a1d1572-c5f6-493b-8bfb-9da630d2015f · outbound

This paper cites Lower bounds on query complexity for testing bounded-degree.

Testing Bipartiteness in Logarithmic Rounds Lower bounds on query complexity for testing bounded-degree

Reference 29

Resolution: unresolved; no resolver link, observed 2026-06-27T04:52:09.324445Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5393a46e-edd5-4760-8c49-73558e930621 · outbound

This paper cites Optimal constant-time approximation algorithms and (unconditional) inapproximability results for every bounded-degree.

Testing Bipartiteness in Logarithmic Rounds Optimal constant-time approximation algorithms and (unconditional) inapproximability results for every bounded-degree

Reference 30

Resolution: unresolved; no resolver link, observed 2026-06-27T04:52:09.324445Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.