{"as_of":"2026-08-11T08:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ee4f1b64b786216d5e1b8b6b214a1fde72e49598bbcc0bc7f031a671a08ea2a8","coverage":[{"denominator":35,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":35,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-14T15:35:07.370155Z","state":"measured"},{"denominator":35,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":35,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+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/2607.08358/citation-record","integrity":"/paper/2607.08358/integrity","json":"/paper/2607.08358/citation-record.json","paper":"/paper/2607.08358"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2106.03753","last_updated":"2023-04-20T08:41:48Z","snapshot_observed_at":"2026-08-06T01:20:25.351715Z","submitted_at":"2021-06-07T16:18:19Z","title":"Energy-Efficient Naming in Beeping Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.03753","snapshot_observed_at":"2026-07-14T15:35:07.370155Z","title":"Energy-Efficient Naming in Beeping Networks, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.08358","last_updated":"2026-07-11T14:30:59Z","snapshot_observed_at":"2026-08-06T16:44:39.200483Z","submitted_at":"2026-07-09T11:13:17Z","title":"Computing in Anonymous Dynamic Networks with One-Bit Communications","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-14T15:35:07.370155Z"},"links":{"cited_paper":"/paper/2106.03753","citing_paper":"/paper/2607.08358"},"observation_digest":"sha256:0d9e280578faadfd35b1d5c5a8d91a925c9b3ef96fd93ea5df856c539c172330","observation_id":"8fb9b548-9944-4dc9-8423-0a5d68016374","resolution":{"observed_at":"2026-07-14T15:35:07.370155Z","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-07-14T15:35:07.370155Z","title":"Local and Global Properties in Networks of Processors (Extended Abstract)","venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2607.08358","last_updated":"2026-07-11T14:30:59Z","snapshot_observed_at":"2026-08-06T16:44:39.200483Z","submitted_at":"2026-07-09T11:13:17Z","title":"Computing in Anonymous Dynamic Networks with One-Bit Communications","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-14T15:35:07.370155Z"},"links":{"citing_paper":"/paper/2607.08358"},"observation_digest":"sha256:233be7e546f3556bb333ab1cdcc4151c639d7df0518922c4b4a5a2e753ea1177","observation_id":"9a03d4f4-f9de-4f8b-b129-a849f88ad38e","resolution":{"observed_at":"2026-07-14T15:35:07.370155Z","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-07-14T15:35:07.370155Z","title":"Optimal Multi-broadcast with Beeps Using Group Testing","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.08358","last_updated":"2026-07-11T14:30:59Z","snapshot_observed_at":"2026-08-06T16:44:39.200483Z","submitted_at":"2026-07-09T11:13:17Z","title":"Computing in Anonymous Dynamic Networks with One-Bit Communications","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-14T15:35:07.370155Z"},"links":{"citing_paper":"/paper/2607.08358"},"observation_digest":"sha256:7342812c000d40cb7e8c1cc16ea151080994b1ac8809c8aeda84796f8dfbedec","observation_id":"16bd673b-18ac-4388-afc9-53eecda1cee7","resolution":{"observed_at":"2026-07-14T15:35:07.370155Z","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-07-14T15:35:07.370155Z","title":"An Effective Characterization of Computability in Anony- mous Networks","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.08358","last_updated":"2026-07-11T14:30:59Z","snapshot_observed_at":"2026-08-06T16:44:39.200483Z","submitted_at":"2026-07-09T11:13:17Z","title":"Computing in Anonymous Dynamic Networks with One-Bit Communications","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-14T15:35:07.370155Z"},"links":{"citing_paper":"/paper/2607.08358"},"observation_digest":"sha256:5ca8475e342065e4044099295ffe833dcb2d7a9ecf6dc8ca66fe8ba47c74b978","observation_id":"8603371f-b82a-4807-8253-81fa728bea9e","resolution":{"observed_at":"2026-07-14T15:35:07.370155Z","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-07-14T15:35:07.370155Z","title":"Fast Size Approximation of a Radio Network in Beeping Model.Theoretical Computer Science, 810:15–25, 2020.doi:10.1016/j.tcs.2017.05.022","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.08358","last_updated":"2026-07-11T14:30:59Z","snapshot_observed_at":"2026-08-06T16:44:39.200483Z","submitted_at":"2026-07-09T11:13:17Z","title":"Computing in Anonymous Dynamic Networks with One-Bit Communications","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-14T15:35:07.370155Z"},"links":{"citing_paper":"/paper/2607.08358"},"observation_digest":"sha256:aa582e5c969e17a426cd602838e6bdf1325d5c1101abf3ae1813e029aebbdb41","observation_id":"939779f0-872b-4d94-98d8-488c85fd1b97","resolution":{"observed_at":"2026-07-14T15:35:07.370155Z","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-07-14T15:35:07.370155Z","title":"Counting in One-Hop Beeping Networks.Theoretical Computer Science, 780:20–28, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.08358","last_updated":"2026-07-11T14:30:59Z","snapshot_observed_at":"2026-08-06T16:44:39.200483Z","submitted_at":"2026-07-09T11:13:17Z","title":"Computing in Anonymous Dynamic Networks with One-Bit Communications","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-14T15:35:07.370155Z"},"links":{"citing_paper":"/paper/2607.08358"},"observation_digest":"sha256:c9ec9f40b88a33419adb9a5e6fa46d0bbe403f5efd564ea28b5ff74ab02a915e","observation_id":"fc5bd190-1966-45f2-a1b4-f76b72ca1f97","resolution":{"observed_at":"2026-07-14T15:35:07.370155Z","resolver_source":null,"status":"malformed_identifier"},"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-07-14T15:35:07.370155Z","title":"Distributed Computations in Fully-Defective Networks.Distributed Computing, 36(4):501–528, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.08358","last_updated":"2026-07-11T14:30:59Z","snapshot_observed_at":"2026-08-06T16:44:39.200483Z","submitted_at":"2026-07-09T11:13:17Z","title":"Computing in Anonymous Dynamic Networks with One-Bit Communications","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-14T15:35:07.370155Z"},"links":{"citing_paper":"/paper/2607.08358"},"observation_digest":"sha256:4aa1cdc7fb1a725369c6aeaa3bb5b3481b9651c4e95e3f4226982d6a22095f4c","observation_id":"80e79008-863e-4d36-bc13-607e2dae978b","resolution":{"observed_at":"2026-07-14T15:35:07.370155Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.08348","last_updated":"2025-08-19T15:22:01Z","snapshot_observed_at":"2026-08-06T18:18:21.791972Z","submitted_at":"2025-07-11T06:48:21Z","title":"Content-Oblivious Leader Election in 2-Edge-Connected Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.08348","snapshot_observed_at":"2026-07-14T15:35:07.370155Z","title":"Di Luna, and Haoran Zhou","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.08358","last_updated":"2026-07-11T14:30:59Z","snapshot_observed_at":"2026-08-06T16:44:39.200483Z","submitted_at":"2026-07-09T11:13:17Z","title":"Computing in Anonymous Dynamic Networks with One-Bit Communications","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-14T15:35:07.370155Z"},"links":{"cited_paper":"/paper/2507.08348","citing_paper":"/paper/2607.08358"},"observation_digest":"sha256:7801c72f305227619bf963d3780f1ef586ddf08578349e6040edc6a85a5f5452","observation_id":"c1e0f5e2-5139-4182-87e8-c9b955324345","resolution":{"observed_at":"2026-07-14T15:35:07.370155Z","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-07-14T15:35:07.370155Z","title":"Di Luna, and Haoran Zhou","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.08358","last_updated":"2026-07-11T14:30:59Z","snapshot_observed_at":"2026-08-06T16:44:39.200483Z","submitted_at":"2026-07-09T11:13:17Z","title":"Computing in Anonymous Dynamic Networks with One-Bit Communications","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-14T15:35:07.370155Z"},"links":{"citing_paper":"/paper/2607.08358"},"observation_digest":"sha256:dac4a61a868d88fdfe4326e49ddea02290216db3129787f16fb2f54a5817c32d","observation_id":"9d08b10d-c834-4578-8338-483173be3fb4","resolution":{"observed_at":"2026-07-14T15:35:07.370155Z","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-07-14T15:35:07.370155Z","title":"Di Luna, and Haoran Zhou","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.08358","last_updated":"2026-07-11T14:30:59Z","snapshot_observed_at":"2026-08-06T16:44:39.200483Z","submitted_at":"2026-07-09T11:13:17Z","title":"Computing in Anonymous Dynamic Networks with One-Bit Communications","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-14T15:35:07.370155Z"},"links":{"citing_paper":"/paper/2607.08358"},"observation_digest":"sha256:8d5b0e2f6e995d5d4455d7498ab6078dd619567e3ab32724f3f747dc2ac06ab8","observation_id":"7a99de70-4805-44ce-aba4-444bfacbde7b","resolution":{"observed_at":"2026-07-14T15:35:07.370155Z","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-07-14T15:35:07.370155Z","title":"Local Terminations and Distributed Computability in Anonymous Networks","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.08358","last_updated":"2026-07-11T14:30:59Z","snapshot_observed_at":"2026-08-06T16:44:39.200483Z","submitted_at":"2026-07-09T11:13:17Z","title":"Computing in Anonymous Dynamic Networks with One-Bit Communications","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-14T15:35:07.370155Z"},"links":{"citing_paper":"/paper/2607.08358"},"observation_digest":"sha256:1cc593e2d7ed6797fcc875d144cf338d4e6e4fd6f5a847145c6f8865de2ae4d1","observation_id":"1d230476-364c-43b8-a7bb-f4db7ee5a1ae","resolution":{"observed_at":"2026-07-14T15:35:07.370155Z","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-07-14T15:35:07.370155Z","title":"Enumeration and Leader Election in Partially Anonymous and Multi-hop Broadcast Networks.Fundamenta Informaticae, 120(1):1– 27, 2012.doi:10.3233/FI-2012-747","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.08358","last_updated":"2026-07-11T14:30:59Z","snapshot_observed_at":"2026-08-06T16:44:39.200483Z","submitted_at":"2026-07-09T11:13:17Z","title":"Computing in Anonymous Dynamic Networks with One-Bit Communications","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-14T15:35:07.370155Z"},"links":{"citing_paper":"/paper/2607.08358"},"observation_digest":"sha256:fe93675d1a27ec4084e0bd5b302460a4f4679b9d7b73c9400b05d5b595974326","observation_id":"f12965a3-022c-4e94-a18c-d16922ceaa5a","resolution":{"observed_at":"2026-07-14T15:35:07.370155Z","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-07-14T15:35:07.370155Z","title":"Beyond 2-Edge-Connectivity: Algorithms and Impossibility for Content-Oblivious Leader Election, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.08358","last_updated":"2026-07-11T14:30:59Z","snapshot_observed_at":"2026-08-06T16:44:39.200483Z","submitted_at":"2026-07-09T11:13:17Z","title":"Computing in Anonymous Dynamic Networks with One-Bit Communications","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-14T15:35:07.370155Z"},"links":{"citing_paper":"/paper/2607.08358"},"observation_digest":"sha256:44ea8528f8ee34530b9b278139231b3daafaa8f7e25e39b756bc08bf12187db3","observation_id":"6acb89b8-a0fd-42f3-8d36-1587fd485e21","resolution":{"observed_at":"2026-07-14T15:35:07.370155Z","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-07-14T15:35:07.370155Z","title":"Chlebus, Gianluca De Marco, and Muhammed Talo","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.08358","last_updated":"2026-07-11T14:30:59Z","snapshot_observed_at":"2026-08-06T16:44:39.200483Z","submitted_at":"2026-07-09T11:13:17Z","title":"Computing in Anonymous Dynamic Networks with One-Bit Communications","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-14T15:35:07.370155Z"},"links":{"citing_paper":"/paper/2607.08358"},"observation_digest":"sha256:2153ef7fc860843c2fbfb1a90371a253dd57131bac3b4da889ad1dfe11867563","observation_id":"bab6df7a-bea8-4deb-b711-574f0bdb61c2","resolution":{"observed_at":"2026-07-14T15:35:07.370155Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1005.2567","last_updated":"2010-05-14T16:32:02Z","snapshot_observed_at":"2026-08-06T11:42:45.090644Z","submitted_at":"2010-05-14T16:32:02Z","title":"Deploying Wireless Networks with Beeps","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1005.2567","snapshot_observed_at":"2026-07-14T15:35:07.370155Z","title":"Deploying Wireless Networks with Beeps","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.08358","last_updated":"2026-07-11T14:30:59Z","snapshot_observed_at":"2026-08-06T16:44:39.200483Z","submitted_at":"2026-07-09T11:13:17Z","title":"Computing in Anonymous Dynamic Networks with One-Bit Communications","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-14T15:35:07.370155Z"},"links":{"cited_paper":"/paper/1005.2567","citing_paper":"/paper/2607.08358"},"observation_digest":"sha256:14b7e77eb743d9967cc5e81539f0c69b43964e3572b20b511d0989a4b2d7e87d","observation_id":"05bfdf69-9246-4b75-9991-e1c20db7c232","resolution":{"observed_at":"2026-07-14T15:35:07.370155Z","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-07-14T15:35:07.370155Z","title":"Communicating with Beeps","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.08358","last_updated":"2026-07-11T14:30:59Z","snapshot_observed_at":"2026-08-06T16:44:39.200483Z","submitted_at":"2026-07-09T11:13:17Z","title":"Computing in Anonymous Dynamic Networks with One-Bit Communications","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-14T15:35:07.370155Z"},"links":{"citing_paper":"/paper/2607.08358"},"observation_digest":"sha256:55b28b3b0492ad7684592eb4410134b15a70643a4d97d9b42bb345369655bc6d","observation_id":"03199373-d994-409d-ab8d-852cabcf0fb0","resolution":{"observed_at":"2026-07-14T15:35:07.370155Z","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-07-14T15:35:07.370155Z","title":"Communicating with Beeps.Journal of Parallel and Distributed Computing, 130:98–109, 2019.doi:10.1016/j.jpdc.2019.03.020","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.08358","last_updated":"2026-07-11T14:30:59Z","snapshot_observed_at":"2026-08-06T16:44:39.200483Z","submitted_at":"2026-07-09T11:13:17Z","title":"Computing in Anonymous Dynamic Networks with One-Bit Communications","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-14T15:35:07.370155Z"},"links":{"citing_paper":"/paper/2607.08358"},"observation_digest":"sha256:f47c50e6aa7f1eaf747acfee15d6e65f9a7b4b5d8785a7ce950c8fff9e7ce8bf","observation_id":"82faf19e-a15c-4f5c-ae46-d492b441022a","resolution":{"observed_at":"2026-07-14T15:35:07.370155Z","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-07-14T15:35:07.370155Z","title":"Optimal Message-Passing with Noisy Beeps.Distributed Computing, 38(3):247–260, 2025.doi:10.1007/s00446-025-00488-6","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.08358","last_updated":"2026-07-11T14:30:59Z","snapshot_observed_at":"2026-08-06T16:44:39.200483Z","submitted_at":"2026-07-09T11:13:17Z","title":"Computing in Anonymous Dynamic Networks with One-Bit Communications","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-14T15:35:07.370155Z"},"links":{"citing_paper":"/paper/2607.08358"},"observation_digest":"sha256:3ed9b30707fc7d2030ca8e9b92d49808be8795144d9c78d2606125c7d504239f","observation_id":"68ff9659-c495-49b2-a65f-0764275bd718","resolution":{"observed_at":"2026-07-14T15:35:07.370155Z","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-07-14T15:35:07.370155Z","title":"Di Luna, Roberto Baldoni, Silvia Bonomi, and Ioannis Chatzigiannakis","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.08358","last_updated":"2026-07-11T14:30:59Z","snapshot_observed_at":"2026-08-06T16:44:39.200483Z","submitted_at":"2026-07-09T11:13:17Z","title":"Computing in Anonymous Dynamic Networks with One-Bit Communications","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-14T15:35:07.370155Z"},"links":{"citing_paper":"/paper/2607.08358"},"observation_digest":"sha256:d96b0ba2d93c17d2e9ed8465590d7f6d9320018e61ab6e6455f52ce7734b7614","observation_id":"92392edf-cb5e-4202-a829-b1e727134999","resolution":{"observed_at":"2026-07-14T15:35:07.370155Z","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-07-14T15:35:07.370155Z","title":"Di Luna and Giovanni Viglietta","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.08358","last_updated":"2026-07-11T14:30:59Z","snapshot_observed_at":"2026-08-06T16:44:39.200483Z","submitted_at":"2026-07-09T11:13:17Z","title":"Computing in Anonymous Dynamic Networks with One-Bit Communications","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-14T15:35:07.370155Z"},"links":{"citing_paper":"/paper/2607.08358"},"observation_digest":"sha256:3ea3816c6f44127150fb575c3df1d5b23393b1603dcecd765ecf3c66f066db61","observation_id":"6a2bb240-be37-4caf-90ad-78d50bafb7d3","resolution":{"observed_at":"2026-07-14T15:35:07.370155Z","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-07-14T15:35:07.370155Z","title":"Di Luna and Giovanni Viglietta","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.08358","last_updated":"2026-07-11T14:30:59Z","snapshot_observed_at":"2026-08-06T16:44:39.200483Z","submitted_at":"2026-07-09T11:13:17Z","title":"Computing in Anonymous Dynamic Networks with One-Bit Communications","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-14T15:35:07.370155Z"},"links":{"citing_paper":"/paper/2607.08358"},"observation_digest":"sha256:18fab32973a3becdb85a4c280e3240f82581aa382db640b21a19f7b291c242c3","observation_id":"a7c1974e-0db9-4f7e-ac45-30b1ee1b7d58","resolution":{"observed_at":"2026-07-14T15:35:07.370155Z","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-07-14T15:35:07.370155Z","title":"Di Luna and Giovanni Viglietta","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.08358","last_updated":"2026-07-11T14:30:59Z","snapshot_observed_at":"2026-08-06T16:44:39.200483Z","submitted_at":"2026-07-09T11:13:17Z","title":"Computing in Anonymous Dynamic Networks with One-Bit Communications","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-14T15:35:07.370155Z"},"links":{"citing_paper":"/paper/2607.08358"},"observation_digest":"sha256:595a84360abe90feab29b0471330334d317e38ca9b6b00b63d75b11f1071c971","observation_id":"8cf69db2-641b-470f-9509-9bce497fd54f","resolution":{"observed_at":"2026-07-14T15:35:07.370155Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.07849","last_updated":"2025-03-23T13:43:19Z","snapshot_observed_at":"2026-08-10T06:03:48.052420Z","submitted_at":"2023-01-19T02:11:47Z","title":"Efficient Computation in Congested Anonymous Dynamic Networks","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.07849","snapshot_observed_at":"2026-07-14T15:35:07.370155Z","title":"Di Luna and Giovanni Viglietta","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.08358","last_updated":"2026-07-11T14:30:59Z","snapshot_observed_at":"2026-08-06T16:44:39.200483Z","submitted_at":"2026-07-09T11:13:17Z","title":"Computing in Anonymous Dynamic Networks with One-Bit Communications","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-14T15:35:07.370155Z"},"links":{"cited_paper":"/paper/2301.07849","citing_paper":"/paper/2607.08358"},"observation_digest":"sha256:72ba02d480796124bb8a828be2c187ae2a73c7519406046d1a1f11f2fec01e5a","observation_id":"e9735eb4-39c0-44cc-8333-49fdf73ee158","resolution":{"observed_at":"2026-07-14T15:35:07.370155Z","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-07-14T15:35:07.370155Z","title":"Assigning Labels in Unknown Anonymous Networks (Extended Abstract)","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.08358","last_updated":"2026-07-11T14:30:59Z","snapshot_observed_at":"2026-08-06T16:44:39.200483Z","submitted_at":"2026-07-09T11:13:17Z","title":"Computing in Anonymous Dynamic Networks with One-Bit Communications","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-14T15:35:07.370155Z"},"links":{"citing_paper":"/paper/2607.08358"},"observation_digest":"sha256:e693fbd9cfdf8a8d90147084e6d91d14cca20d08b3263525e71e6fb43d9e1e1c","observation_id":"40f2da9f-b690-4ec0-9b78-2ccd20d2627f","resolution":{"observed_at":"2026-07-14T15:35:07.370155Z","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-07-14T15:35:07.370155Z","title":"Content-Oblivious Leader Election on Rings","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.08358","last_updated":"2026-07-11T14:30:59Z","snapshot_observed_at":"2026-08-06T16:44:39.200483Z","submitted_at":"2026-07-09T11:13:17Z","title":"Computing in Anonymous Dynamic Networks with One-Bit Communications","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-14T15:35:07.370155Z"},"links":{"citing_paper":"/paper/2607.08358"},"observation_digest":"sha256:987c0ea78275fed4aa5e81ddab35b2a2f15e87e1f1b5a9919f83f26fcf772a62","observation_id":"9668c422-65e4-4466-b843-7a151bc81736","resolution":{"observed_at":"2026-07-14T15:35:07.370155Z","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-07-14T15:35:07.370155Z","title":"Kowalski, Shay Kutten, and Miguel A","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.08358","last_updated":"2026-07-11T14:30:59Z","snapshot_observed_at":"2026-08-06T16:44:39.200483Z","submitted_at":"2026-07-09T11:13:17Z","title":"Computing in Anonymous Dynamic Networks with One-Bit Communications","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-14T15:35:07.370155Z"},"links":{"citing_paper":"/paper/2607.08358"},"observation_digest":"sha256:2ed5cd7f7990e105952f9d116b0545ca9553a4b698267d026a0f8a3ba1a4e4d8","observation_id":"6fe67055-f25c-4772-a6de-58cc176463da","resolution":{"observed_at":"2026-07-14T15:35:07.370155Z","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-07-14T15:35:07.370155Z","title":"Kowalski and Miguel A","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.08358","last_updated":"2026-07-11T14:30:59Z","snapshot_observed_at":"2026-08-06T16:44:39.200483Z","submitted_at":"2026-07-09T11:13:17Z","title":"Computing in Anonymous Dynamic Networks with One-Bit Communications","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-14T15:35:07.370155Z"},"links":{"citing_paper":"/paper/2607.08358"},"observation_digest":"sha256:deb187e90f79f6e0eacf9ef4f68ea78accff8b7b8e435b77e87f5cea3b0ae234","observation_id":"d9ca6913-68b6-4897-9809-8ff108778d6f","resolution":{"observed_at":"2026-07-14T15:35:07.370155Z","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-07-14T15:35:07.370155Z","title":"Kowalski and Miguel A","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.08358","last_updated":"2026-07-11T14:30:59Z","snapshot_observed_at":"2026-08-06T16:44:39.200483Z","submitted_at":"2026-07-09T11:13:17Z","title":"Computing in Anonymous Dynamic Networks with One-Bit Communications","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-14T15:35:07.370155Z"},"links":{"citing_paper":"/paper/2607.08358"},"observation_digest":"sha256:3ad1fbe1bb644de0539b2d17769dd0fecaf0b91c1c7437b887aa7dc6afdd7f61","observation_id":"d437404f-50e9-4f91-86f8-9053746222a7","resolution":{"observed_at":"2026-07-14T15:35:07.370155Z","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-07-14T15:35:07.370155Z","title":"Lynch.Distributed Algorithms","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2607.08358","last_updated":"2026-07-11T14:30:59Z","snapshot_observed_at":"2026-08-06T16:44:39.200483Z","submitted_at":"2026-07-09T11:13:17Z","title":"Computing in Anonymous Dynamic Networks with One-Bit Communications","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-14T15:35:07.370155Z"},"links":{"citing_paper":"/paper/2607.08358"},"observation_digest":"sha256:0ea3d3b648dce50c8f7432d6f50b4b369c0c9755f0ab8d317609f398d52185ef","observation_id":"d3b5b518-0092-4e13-8999-3f44caf0904e","resolution":{"observed_at":"2026-07-14T15:35:07.370155Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1507.02721","last_updated":"2015-07-23T07:58:23Z","snapshot_observed_at":"2026-08-09T07:15:26.373596Z","submitted_at":"2015-07-09T21:44:45Z","title":"On Distributed Computing with Beeps","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1507.02721","snapshot_observed_at":"2026-07-14T15:35:07.370155Z","title":"On Distributed Computing with Beeps, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.08358","last_updated":"2026-07-11T14:30:59Z","snapshot_observed_at":"2026-08-06T16:44:39.200483Z","submitted_at":"2026-07-09T11:13:17Z","title":"Computing in Anonymous Dynamic Networks with One-Bit Communications","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-14T15:35:07.370155Z"},"links":{"cited_paper":"/paper/1507.02721","citing_paper":"/paper/2607.08358"},"observation_digest":"sha256:5a7bf70e0cef3bd5591fa4bee9ead30dd4ae47166a4febedc9442971f45adce4","observation_id":"fd12718d-f79e-43aa-b9b9-58ea45ee4c10","resolution":{"observed_at":"2026-07-14T15:35:07.370155Z","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-07-14T15:35:07.370155Z","title":"Spirakis","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.08358","last_updated":"2026-07-11T14:30:59Z","snapshot_observed_at":"2026-08-06T16:44:39.200483Z","submitted_at":"2026-07-09T11:13:17Z","title":"Computing in Anonymous Dynamic Networks with One-Bit Communications","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-14T15:35:07.370155Z"},"links":{"citing_paper":"/paper/2607.08358"},"observation_digest":"sha256:efa80b236d2015aaf75258daa2519da3ab28c392231b294770a649d81392b7ac","observation_id":"e8e28677-3e97-4057-b010-182f52a3db20","resolution":{"observed_at":"2026-07-14T15:35:07.370155Z","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-07-14T15:35:07.370155Z","title":"Linear Time Average Consensus and Distributed Optimization on Fixed Graphs.SIAM Journal on Control and Optimization, 55(6):3990–4014, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.08358","last_updated":"2026-07-11T14:30:59Z","snapshot_observed_at":"2026-08-06T16:44:39.200483Z","submitted_at":"2026-07-09T11:13:17Z","title":"Computing in Anonymous Dynamic Networks with One-Bit Communications","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-14T15:35:07.370155Z"},"links":{"citing_paper":"/paper/2607.08358"},"observation_digest":"sha256:b29b662bae5a266179e450a5eb7b827473dac393eed538fe3d39fbe72aae5597","observation_id":"57ab2b4d-d8c6-445f-832d-c9ae5ef8a099","resolution":{"observed_at":"2026-07-14T15:35:07.370155Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.02673","last_updated":"2024-06-29T12:50:28Z","snapshot_observed_at":"2026-08-10T15:11:16.239886Z","submitted_at":"2024-04-03T12:17:49Z","title":"History Trees and Their Applications","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.02673","snapshot_observed_at":"2026-07-14T15:35:07.370155Z","title":"History Trees and Their Applications","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.08358","last_updated":"2026-07-11T14:30:59Z","snapshot_observed_at":"2026-08-06T16:44:39.200483Z","submitted_at":"2026-07-09T11:13:17Z","title":"Computing in Anonymous Dynamic Networks with One-Bit Communications","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-14T15:35:07.370155Z"},"links":{"cited_paper":"/paper/2404.02673","citing_paper":"/paper/2607.08358"},"observation_digest":"sha256:14cdc074d3825d6ece4102a8c23f75159790244d06f3877e05c5dd7c75d64ac8","observation_id":"821bd5bd-3221-4d4b-8217-7837f5244ef0","resolution":{"observed_at":"2026-07-14T15:35:07.370155Z","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-07-14T15:35:07.370155Z","title":"Computing on an Anonymous Network","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2607.08358","last_updated":"2026-07-11T14:30:59Z","snapshot_observed_at":"2026-08-06T16:44:39.200483Z","submitted_at":"2026-07-09T11:13:17Z","title":"Computing in Anonymous Dynamic Networks with One-Bit Communications","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-14T15:35:07.370155Z"},"links":{"citing_paper":"/paper/2607.08358"},"observation_digest":"sha256:d18aa1f18bcad37a071eafe110773de2ac201f1c7e993ebc6919dabeba6f44e4","observation_id":"3ecf5b71-b31e-4e61-a628-a23d2de7d31f","resolution":{"observed_at":"2026-07-14T15:35:07.370155Z","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-07-14T15:35:07.370155Z","title":"Computing on Anonymous Networks","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2607.08358","last_updated":"2026-07-11T14:30:59Z","snapshot_observed_at":"2026-08-06T16:44:39.200483Z","submitted_at":"2026-07-09T11:13:17Z","title":"Computing in Anonymous Dynamic Networks with One-Bit Communications","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-14T15:35:07.370155Z"},"links":{"citing_paper":"/paper/2607.08358"},"observation_digest":"sha256:5de26a4163b67f63d1cb88e86a468f531f6eacdd97c8336fe294f63676a9cfa5","observation_id":"047b0e4e-4ab3-4802-9fa3-ebb21b8df261","resolution":{"observed_at":"2026-07-14T15:35:07.370155Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.08358","last_updated":"2026-07-11T14:30:59Z","latest_version":2,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-06T16:44:39.200483Z","submitted_at":"2026-07-09T11:13:17Z","title":"Computing in Anonymous Dynamic Networks with One-Bit Communications"},"reference_resolution":{"displayed":35,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":33,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":35},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 35 of 35 outbound references and 0 inbound Pith citation observations for arXiv:2607.08358."}