{"as_of":"2026-08-22T02:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:12e6201d5bda520a6d2b3f7ef0a5c9235beb6e90beeedd357ee25a8c8bc06a71","coverage":[{"denominator":30,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":30,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-27T04:52:09.324445Z","state":"measured"},{"denominator":30,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":30,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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/2606.13583/citation-record","integrity":"/paper/2606.13583/integrity","json":"/paper/2606.13583/citation-record.json","paper":"/paper/2606.13583"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.18382","last_updated":"2025-03-13T13:07:38Z","snapshot_observed_at":"2026-08-21T08:51:33.090435Z","submitted_at":"2025-02-25T17:25:16Z","title":"Property Testing in Bounded Degree Hypergraphs","version":2},"cited_work":{"arxiv_id":"2502.18382","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.18382","snapshot_observed_at":"2026-07-03T16:58:42.788325Z","title":"arXiv preprint arXiv:2502.18382 , year=","venue":null,"work_id":"b470bef6-cb95-4ee1-8a22-312cd1c6e81b","year":null},"citing_paper":{"arxiv_id":"2606.13583","last_updated":"2026-06-11T17:07:00Z","snapshot_observed_at":"2026-08-17T20:27:24.095587Z","submitted_at":"2026-06-11T17:07:00Z","title":"Testing Bipartiteness in Logarithmic Rounds","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-06-27T04:52:09.324445Z"},"links":{"cited_paper":"/paper/2502.18382","citing_paper":"/paper/2606.13583"},"observation_digest":"sha256:a2fd8c83b1863b677e28427f95ee2ed5d8d609d3ce43200cbfdcb51177ccd834","observation_id":"faee855d-7d15-4dcf-b1b0-c03b9635c753","resolution":{"observed_at":"2026-07-03T16:58:42.790180Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:52:09.324445Z","title":"Proceedings of the ACM Web Conference 2023 , pages=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.13583","last_updated":"2026-06-11T17:07:00Z","snapshot_observed_at":"2026-08-17T20:27:24.095587Z","submitted_at":"2026-06-11T17:07:00Z","title":"Testing Bipartiteness in Logarithmic Rounds","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-06-27T04:52:09.324445Z"},"links":{"citing_paper":"/paper/2606.13583"},"observation_digest":"sha256:3593737f4056a45c1aeb9c200a8121aa710f1b09923fd5f4277b0f59c089d022","observation_id":"29e4a4ed-fb7f-4502-a10e-8d8e534462bb","resolution":{"observed_at":"2026-06-27T04:52:09.324445Z","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":"2622.243262","doi":"10.1145/2432622.2432624","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Testing closeness of discrete distributions , journal =","venue":"Journal of the ACM","work_id":"239f02d0-52c2-4278-9fb4-50419ef02c83","year":2013},"citing_paper":{"arxiv_id":"2606.13583","last_updated":"2026-06-11T17:07:00Z","snapshot_observed_at":"2026-08-17T20:27:24.095587Z","submitted_at":"2026-06-11T17:07:00Z","title":"Testing Bipartiteness in Logarithmic Rounds","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-06-27T04:52:09.324445Z"},"links":{"citing_paper":"/paper/2606.13583"},"observation_digest":"sha256:aecdbb185fb044fc9a44156467e6f2ad8928e51d01e82df602188aa770be8a88","observation_id":"1c3266f1-d9a2-4c69-8def-f1633d95cf2d","resolution":{"observed_at":"2026-06-27T05:00:35.570356Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:52:09.324445Z","title":"The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2606.13583","last_updated":"2026-06-11T17:07:00Z","snapshot_observed_at":"2026-08-17T20:27:24.095587Z","submitted_at":"2026-06-11T17:07:00Z","title":"Testing Bipartiteness in Logarithmic Rounds","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-06-27T04:52:09.324445Z"},"links":{"citing_paper":"/paper/2606.13583"},"observation_digest":"sha256:128840f663b3f0f1caf638839895305a54620d874fef674bc65e60d3ea75fb17","observation_id":"19b47209-f63f-4a41-99a3-30b70a188b44","resolution":{"observed_at":"2026-06-27T04:52:09.324445Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:52:09.324445Z","title":"ACM Transactions on Algorithms (TALG) , volume=","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2606.13583","last_updated":"2026-06-11T17:07:00Z","snapshot_observed_at":"2026-08-17T20:27:24.095587Z","submitted_at":"2026-06-11T17:07:00Z","title":"Testing Bipartiteness in Logarithmic Rounds","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-06-27T04:52:09.324445Z"},"links":{"citing_paper":"/paper/2606.13583"},"observation_digest":"sha256:dac085b5b608fc4d4bdd175cf4d6399c28ae948d796830f5b63721ef3072fd21","observation_id":"e0fb3b8d-c8c0-4ed0-a4c5-31dddd096a2a","resolution":{"observed_at":"2026-06-27T04:52:09.324445Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:52:09.324445Z","title":"2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) , pages=","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.13583","last_updated":"2026-06-11T17:07:00Z","snapshot_observed_at":"2026-08-17T20:27:24.095587Z","submitted_at":"2026-06-11T17:07:00Z","title":"Testing Bipartiteness in Logarithmic Rounds","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-06-27T04:52:09.324445Z"},"links":{"citing_paper":"/paper/2606.13583"},"observation_digest":"sha256:e090c39b3a09c9e993c18305c60791e28c1519c7c0f8bf77b392b1ca477d1514","observation_id":"914936df-944e-4d00-8fad-637bd0f68a9d","resolution":{"observed_at":"2026-06-27T04:52:09.324445Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:52:09.324445Z","title":"Combinatorics, Probability and Computing , volume=","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2606.13583","last_updated":"2026-06-11T17:07:00Z","snapshot_observed_at":"2026-08-17T20:27:24.095587Z","submitted_at":"2026-06-11T17:07:00Z","title":"Testing Bipartiteness in Logarithmic Rounds","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-06-27T04:52:09.324445Z"},"links":{"citing_paper":"/paper/2606.13583"},"observation_digest":"sha256:389d1382aad9de6e1b53a559c1a8082e3ad1effc6d6a3fd5952f37cbf541b7af","observation_id":"7e0aa0de-bae4-47de-a6ec-9780ee0ab918","resolution":{"observed_at":"2026-06-27T04:52:09.324445Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:52:09.324445Z","title":"Random Structures & Algorithms , volume=","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.13583","last_updated":"2026-06-11T17:07:00Z","snapshot_observed_at":"2026-08-17T20:27:24.095587Z","submitted_at":"2026-06-11T17:07:00Z","title":"Testing Bipartiteness in Logarithmic Rounds","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-06-27T04:52:09.324445Z"},"links":{"citing_paper":"/paper/2606.13583"},"observation_digest":"sha256:acbe1b8fccbf19774a729af6eeb651af73aa3b38654a19bc13bd31a85a65ae42","observation_id":"e962f474-d0da-4b98-b961-0ad491165b55","resolution":{"observed_at":"2026-06-27T04:52:09.324445Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:52:09.324445Z","title":"Proceedings of the forty-seventh annual ACM symposium on Theory of Computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.13583","last_updated":"2026-06-11T17:07:00Z","snapshot_observed_at":"2026-08-17T20:27:24.095587Z","submitted_at":"2026-06-11T17:07:00Z","title":"Testing Bipartiteness in Logarithmic Rounds","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-06-27T04:52:09.324445Z"},"links":{"citing_paper":"/paper/2606.13583"},"observation_digest":"sha256:729b4730cce985ddd258722b8f4e8ae36dbc9111ffa2fb9c067a600857a458fc","observation_id":"9db1c070-67ef-45ed-b434-d3c6c6b9ff29","resolution":{"observed_at":"2026-06-27T04:52:09.324445Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:52:09.324445Z","title":"1st Symposium on Simplicity in Algorithms , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.13583","last_updated":"2026-06-11T17:07:00Z","snapshot_observed_at":"2026-08-17T20:27:24.095587Z","submitted_at":"2026-06-11T17:07:00Z","title":"Testing Bipartiteness in Logarithmic Rounds","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-06-27T04:52:09.324445Z"},"links":{"citing_paper":"/paper/2606.13583"},"observation_digest":"sha256:9af3a1f7cf253fca0cece1f8339897381276852ab40cf840b808cb53077cb062","observation_id":"d4db2c79-0697-4403-b0a3-e57bd510af72","resolution":{"observed_at":"2026-06-27T04:52:09.324445Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:52:09.324445Z","title":"SIAM Journal on Computing , volume=","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2606.13583","last_updated":"2026-06-11T17:07:00Z","snapshot_observed_at":"2026-08-17T20:27:24.095587Z","submitted_at":"2026-06-11T17:07:00Z","title":"Testing Bipartiteness in Logarithmic Rounds","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-06-27T04:52:09.324445Z"},"links":{"citing_paper":"/paper/2606.13583"},"observation_digest":"sha256:bd5a772f536426c830550fb7ca513dbddf0945d4bbfdfa09a5ac82b1940944fc","observation_id":"c50bd711-7f04-42fe-a7eb-519aae221bb3","resolution":{"observed_at":"2026-06-27T04:52:09.324445Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:52:09.324445Z","title":"A dichotomy theorem for multi-pass streaming","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.13583","last_updated":"2026-06-11T17:07:00Z","snapshot_observed_at":"2026-08-17T20:27:24.095587Z","submitted_at":"2026-06-11T17:07:00Z","title":"Testing Bipartiteness in Logarithmic Rounds","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-06-27T04:52:09.324445Z"},"links":{"citing_paper":"/paper/2606.13583"},"observation_digest":"sha256:a1e68e7aad4e9003299e6679986f1bb853dd26dc4a753bf65267cdb9493f04dd","observation_id":"94e43d69-1f3c-4559-b134-6da7a964f986","resolution":{"observed_at":"2026-06-27T04:52:09.324445Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:52:09.324445Z","title":"Unbounded-width","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.13583","last_updated":"2026-06-11T17:07:00Z","snapshot_observed_at":"2026-08-17T20:27:24.095587Z","submitted_at":"2026-06-11T17:07:00Z","title":"Testing Bipartiteness in Logarithmic Rounds","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-06-27T04:52:09.324445Z"},"links":{"citing_paper":"/paper/2606.13583"},"observation_digest":"sha256:ddaa306c52a416ccee9d76601bc003f424f8fc49d3c1d36d0c558d114d323703","observation_id":"ef0cbfdb-be11-4589-97b4-2ce96c359a75","resolution":{"observed_at":"2026-06-27T04:52:09.324445Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:52:09.324445Z","title":"Near-Optimal Space Lower Bounds for Streaming","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.13583","last_updated":"2026-06-11T17:07:00Z","snapshot_observed_at":"2026-08-17T20:27:24.095587Z","submitted_at":"2026-06-11T17:07:00Z","title":"Testing Bipartiteness in Logarithmic Rounds","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-06-27T04:52:09.324445Z"},"links":{"citing_paper":"/paper/2606.13583"},"observation_digest":"sha256:4812e43565fe66d820a3cbf6509310d7be884fbe01c641280bf83dd47c384a0e","observation_id":"369d6788-b75a-4a1d-8e87-41ab6369646a","resolution":{"observed_at":"2026-06-27T04:52:09.324445Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2603.22702","last_updated":"2026-08-12T23:44:13Z","snapshot_observed_at":"2026-08-16T23:09:29.818024Z","submitted_at":"2026-03-24T01:49:11Z","title":"Testing Properties of Edge Distributions","version":2},"cited_work":{"arxiv_id":"2603.22702","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2603.22702","snapshot_observed_at":"2026-08-14T01:00:38.292295Z","title":"arXiv preprint arXiv:2603.22702 , year=","venue":null,"work_id":"1dcc5134-ac3c-4216-9eb1-0dffde37b37c","year":null},"citing_paper":{"arxiv_id":"2606.13583","last_updated":"2026-06-11T17:07:00Z","snapshot_observed_at":"2026-08-17T20:27:24.095587Z","submitted_at":"2026-06-11T17:07:00Z","title":"Testing Bipartiteness in Logarithmic Rounds","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-06-27T04:52:09.324445Z"},"links":{"cited_paper":"/paper/2603.22702","citing_paper":"/paper/2606.13583"},"observation_digest":"sha256:d1d6fbfd5dd5effdcfaeaab400b0ddedfe80aa482089d8f3c8322146295dcc9a","observation_id":"db4a4e14-7ff1-4e04-b0ec-26fba1fcb3e2","resolution":{"observed_at":"2026-08-14T01:00:38.292295Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:52:09.324445Z","title":"Journal of the ACM (JACM) , volume=","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2606.13583","last_updated":"2026-06-11T17:07:00Z","snapshot_observed_at":"2026-08-17T20:27:24.095587Z","submitted_at":"2026-06-11T17:07:00Z","title":"Testing Bipartiteness in Logarithmic Rounds","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-06-27T04:52:09.324445Z"},"links":{"citing_paper":"/paper/2606.13583"},"observation_digest":"sha256:3a0b0b57cd66365676faa3d1e6df1c10f95e3e597dbde16f73a19447460ded2c","observation_id":"d818d636-bc01-4b43-b0e6-84d58796b3f9","resolution":{"observed_at":"2026-06-27T04:52:09.324445Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:52:09.324445Z","title":"Combinatorica , volume=","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2606.13583","last_updated":"2026-06-11T17:07:00Z","snapshot_observed_at":"2026-08-17T20:27:24.095587Z","submitted_at":"2026-06-11T17:07:00Z","title":"Testing Bipartiteness in Logarithmic Rounds","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-06-27T04:52:09.324445Z"},"links":{"citing_paper":"/paper/2606.13583"},"observation_digest":"sha256:b94d7bdab751a6f9567be21318e92f9a2b39cb046bf0f001d010e2f11dbbab63","observation_id":"414007a6-0b07-4635-b0b7-7d3b9cc0b790","resolution":{"observed_at":"2026-06-27T04:52:09.324445Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:52:09.324445Z","title":"Algorithmica , volume=","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2606.13583","last_updated":"2026-06-11T17:07:00Z","snapshot_observed_at":"2026-08-17T20:27:24.095587Z","submitted_at":"2026-06-11T17:07:00Z","title":"Testing Bipartiteness in Logarithmic Rounds","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-06-27T04:52:09.324445Z"},"links":{"citing_paper":"/paper/2606.13583"},"observation_digest":"sha256:c37d4744d6b57f7c410f98bf2a5046daa0abb1b92f53c309095933c018a01d43","observation_id":"d2127b35-6026-46bf-8f44-99e8e3e82801","resolution":{"observed_at":"2026-06-27T04:52:09.324445Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:52:09.324445Z","title":"Studies in Complexity and Cryptography , pages=","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.13583","last_updated":"2026-06-11T17:07:00Z","snapshot_observed_at":"2026-08-17T20:27:24.095587Z","submitted_at":"2026-06-11T17:07:00Z","title":"Testing Bipartiteness in Logarithmic Rounds","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-06-27T04:52:09.324445Z"},"links":{"citing_paper":"/paper/2606.13583"},"observation_digest":"sha256:56341261e7624fb1b44d5f5ea426356cfb5ed3481bbdc1ea9132baa8fe813d15","observation_id":"48aa142d-0ebf-443a-9c28-7126b3177449","resolution":{"observed_at":"2026-06-27T04:52:09.324445Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:52:09.324445Z","title":"51st International Colloquium on Automata, Languages, and Programming (ICALP 2024) , pages=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.13583","last_updated":"2026-06-11T17:07:00Z","snapshot_observed_at":"2026-08-17T20:27:24.095587Z","submitted_at":"2026-06-11T17:07:00Z","title":"Testing Bipartiteness in Logarithmic Rounds","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-06-27T04:52:09.324445Z"},"links":{"citing_paper":"/paper/2606.13583"},"observation_digest":"sha256:69d049574f35fb3e3226eadc4628bdbc1611b2c64c66455dff5ce136076bea27","observation_id":"04dc72c8-98bf-4505-b984-4307cb4e494e","resolution":{"observed_at":"2026-06-27T04:52:09.324445Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:52:09.324445Z","title":"SIAM Journal on Computing , volume=","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.13583","last_updated":"2026-06-11T17:07:00Z","snapshot_observed_at":"2026-08-17T20:27:24.095587Z","submitted_at":"2026-06-11T17:07:00Z","title":"Testing Bipartiteness in Logarithmic Rounds","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-06-27T04:52:09.324445Z"},"links":{"citing_paper":"/paper/2606.13583"},"observation_digest":"sha256:ee1545b0f6816171bc661653055504d0f1b8ebf5a1775febf39753b05324ebb7","observation_id":"ee7cd9b7-0abd-4e69-8f29-5cf9a9800367","resolution":{"observed_at":"2026-06-27T04:52:09.324445Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:52:09.324445Z","title":"SIAM Journal on computing , volume=","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2606.13583","last_updated":"2026-06-11T17:07:00Z","snapshot_observed_at":"2026-08-17T20:27:24.095587Z","submitted_at":"2026-06-11T17:07:00Z","title":"Testing Bipartiteness in Logarithmic Rounds","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-06-27T04:52:09.324445Z"},"links":{"citing_paper":"/paper/2606.13583"},"observation_digest":"sha256:ef16925aace1449e8b05b65073eb900f62659184bbe623d582f59bd1f3df50ac","observation_id":"b1d88d9d-164e-4626-a7bf-bbb0ce1a825d","resolution":{"observed_at":"2026-06-27T04:52:09.324445Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:52:09.324445Z","title":"Optimal inapproximability results for","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2606.13583","last_updated":"2026-06-11T17:07:00Z","snapshot_observed_at":"2026-08-17T20:27:24.095587Z","submitted_at":"2026-06-11T17:07:00Z","title":"Testing Bipartiteness in Logarithmic Rounds","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-06-27T04:52:09.324445Z"},"links":{"citing_paper":"/paper/2606.13583"},"observation_digest":"sha256:db941ff77bda989aa8742b2e53c348141b334dccbd493f53bc0d9da50db6a217","observation_id":"bc5ffbcd-5c3b-4e72-837f-5099a511bda9","resolution":{"observed_at":"2026-06-27T04:52:09.324445Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:52:09.324445Z","title":"Random Walks and Forbidden Minors","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.13583","last_updated":"2026-06-11T17:07:00Z","snapshot_observed_at":"2026-08-17T20:27:24.095587Z","submitted_at":"2026-06-11T17:07:00Z","title":"Testing Bipartiteness in Logarithmic Rounds","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-06-27T04:52:09.324445Z"},"links":{"citing_paper":"/paper/2606.13583"},"observation_digest":"sha256:ef6e6ef16dfa716b618b7d81fdb694116216f6bce1aabe20808dba860c060264","observation_id":"2d76a4c2-4a11-44f7-9eb0-fb4eed58f313","resolution":{"observed_at":"2026-06-27T04:52:09.324445Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:52:09.324445Z","title":"Information and Computation , volume=","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2606.13583","last_updated":"2026-06-11T17:07:00Z","snapshot_observed_at":"2026-08-17T20:27:24.095587Z","submitted_at":"2026-06-11T17:07:00Z","title":"Testing Bipartiteness in Logarithmic Rounds","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-06-27T04:52:09.324445Z"},"links":{"citing_paper":"/paper/2606.13583"},"observation_digest":"sha256:cb1d146e6d434075b6ff5902b4b3133c42807c8c1cfd94d5eacae5d1159ca060","observation_id":"0638adaa-e878-4538-9d37-67ea1c7f29ae","resolution":{"observed_at":"2026-06-27T04:52:09.324445Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:52:09.324445Z","title":"Proceedings of the fortieth annual ACM symposium on theory of computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.13583","last_updated":"2026-06-11T17:07:00Z","snapshot_observed_at":"2026-08-17T20:27:24.095587Z","submitted_at":"2026-06-11T17:07:00Z","title":"Testing Bipartiteness in Logarithmic Rounds","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-06-27T04:52:09.324445Z"},"links":{"citing_paper":"/paper/2606.13583"},"observation_digest":"sha256:29047cf84d5ad7825a800c23697ae0b365c450bfa9833d5a86eaa67887704a5f","observation_id":"fec0fdda-4123-4b81-aa36-d8388008f7e1","resolution":{"observed_at":"2026-06-27T04:52:09.324445Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:52:09.324445Z","title":"Sublinear-time algorithms for","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.13583","last_updated":"2026-06-11T17:07:00Z","snapshot_observed_at":"2026-08-17T20:27:24.095587Z","submitted_at":"2026-06-11T17:07:00Z","title":"Testing Bipartiteness in Logarithmic Rounds","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-06-27T04:52:09.324445Z"},"links":{"citing_paper":"/paper/2606.13583"},"observation_digest":"sha256:5acda31d01879d09dc29c452bd3bf44a90a043c8a1d97ccf2901d57cd4941492","observation_id":"37f02536-3d4d-4861-ac9e-2a0caffad557","resolution":{"observed_at":"2026-06-27T04:52:09.324445Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:52:09.324445Z","title":"IEICE TRANSACTIONS on Information and Systems , volume=","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2606.13583","last_updated":"2026-06-11T17:07:00Z","snapshot_observed_at":"2026-08-17T20:27:24.095587Z","submitted_at":"2026-06-11T17:07:00Z","title":"Testing Bipartiteness in Logarithmic Rounds","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-06-27T04:52:09.324445Z"},"links":{"citing_paper":"/paper/2606.13583"},"observation_digest":"sha256:ac036a8b648cdf07549b00f06f06f3ecfd98914140d7672697346fc32ea7df7f","observation_id":"5bc0abda-030a-48a8-b2d9-f21e8503ae3c","resolution":{"observed_at":"2026-06-27T04:52:09.324445Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:52:09.324445Z","title":"Lower bounds on query complexity for testing bounded-degree","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.13583","last_updated":"2026-06-11T17:07:00Z","snapshot_observed_at":"2026-08-17T20:27:24.095587Z","submitted_at":"2026-06-11T17:07:00Z","title":"Testing Bipartiteness in Logarithmic Rounds","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-06-27T04:52:09.324445Z"},"links":{"citing_paper":"/paper/2606.13583"},"observation_digest":"sha256:cdb97be51fd124db2f8580b9e0e37d8ba5e498565b0d7b919e4fb6ddbffc40f6","observation_id":"7a1d1572-c5f6-493b-8bfb-9da630d2015f","resolution":{"observed_at":"2026-06-27T04:52:09.324445Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:52:09.324445Z","title":"Optimal constant-time approximation algorithms and (unconditional) inapproximability results for every bounded-degree","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.13583","last_updated":"2026-06-11T17:07:00Z","snapshot_observed_at":"2026-08-17T20:27:24.095587Z","submitted_at":"2026-06-11T17:07:00Z","title":"Testing Bipartiteness in Logarithmic Rounds","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-06-27T04:52:09.324445Z"},"links":{"citing_paper":"/paper/2606.13583"},"observation_digest":"sha256:1b5bd8c50bf984decbc973e1036e803651ee3addf1ebc6c15f9ab08aae1bd5b1","observation_id":"5393a46e-edd5-4760-8c49-73558e930621","resolution":{"observed_at":"2026-06-27T04:52:09.324445Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.13583","last_updated":"2026-06-11T17:07:00Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-17T20:27:24.095587Z","submitted_at":"2026-06-11T17:07:00Z","title":"Testing Bipartiteness in Logarithmic Rounds"},"reference_resolution":{"displayed":30,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":27,"verified_exact":2,"verified_fuzzy":0},"total_outbound_references":30},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"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."}