{"as_of":"2026-08-12T15:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:992a5291b99aeab747b539797a70776a0895cf3cdf224779f56f7f6067f1e45a","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-12T06:34:41.77262+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-11T19:41:31.646882Z","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-12T13:10:58.875620Z","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:3331578e065d24b8abf089b7bb74e9ebc97720272dce6fb64903e6d95cb37162","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-12T13:10:58.875620Z","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:09e876ddf271c4c510547b83e4ce5da6df9cf5402c188c1c8de0fb723d1b2fc9","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-12T13:10:58.875620Z","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:4d9c2d7dea3df1e957793e27cf36cb8f7c952f2043088c3d1863ea2c04586249","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-12T13:10:58.875620Z","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:3e0d839dbbe1b24e1dd16f24df2e68c650500edbcc6c001945111f6a6065728b","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-12T13:10:58.875620Z","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:2357dc3687eb7beaee9ffcb21fd8de2b0e9be0f47a425f673a155d761756fa4c","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-12T13:10:58.875620Z","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:f9a9a427d0d87f37fbbccb46f7310288cee62aeaba16fc8a4913783aa31fb09f","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-12T13:10:58.875620Z","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:fda9dbb52224529b10028ff8563047ae64c40ffc6e95ab0b7f55fb935b0d4d38","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-12T03:25:30.184474Z","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-12T13:10:58.875620Z","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:fbd41e48530542354197bc85056e09d332f50b6972bd3282174d50308850a083","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-12T13:10:58.875620Z","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:6108ff1a4f451edbb2c19b5b3859f822e611da64d1b381cda57e8616e2de1901","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-12T13:10:58.875620Z","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:c3571d1254dd2e7cd774398541357de85916d86f3df7dcd5da6a17c5b973a99d","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-12T13:10:58.875620Z","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:ffdd955e323939a3aa95264cabc885c0f9e1e10d69e117705f6cbda4ab22f5f8","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-12T13:10:58.875620Z","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:e330d7b09cbed1f2e9dafd6bc17b683fc9fa831d1589563f704f7b1abdc5ebac","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-12T13:10:58.875620Z","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:1d7ab667459caa4d4839841c02b7464ff82a8e40688edba2378bbe318889c3b0","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-12T13:10:58.875620Z","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:7fe1be5629d9a13fd88a530a15404a114ef8ae2ca251f4ed614fed594f533687","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-12T13:10:58.875620Z","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:cec4376374740eb5a894e00b00b015a3455b6ac6d482dfbd84ee8ff034f6cb31","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-12T13:10:58.875620Z","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:44d69f8dedaa7abc8c7a0809cb4a13f3fdc4f3d3608be56ffeff175050646b1f","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-12T13:10:58.875620Z","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:a14401d736d9380ccf56a81fc870fac8a27d9a62c840743f0f802c86380ae7cb","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-12T13:10:58.875620Z","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:25c3a14a7845d1bc7e8ed729eef4de2594417e3c3293e54c901010b6c9d20e19","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-12T13:10:58.875620Z","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:b908e2f018952a60c139f67c2e1bd3b12836e916c3a23977bc511024dab1a33c","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-12T13:10:58.875620Z","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:47ff6db5608f50ffc12e8b0955f115474810e018881b117e36b68edca87cc4a1","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-12T13:10:58.875620Z","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:c8bbc991b530f58917d1bbbceb41a8e8b877c7d2e05f05d33523fb3ed12b9d06","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-12T13:10:58.875620Z","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:b80fc84f84053eef2f3af5315f5878866b03edebce16b00648887111b827ae27","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-12T15:34:22.153517Z","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-12T13:10:58.875620Z","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:94a620fda2e2c9f62f8bb9608030c1c05f3dd600cafeb17da9a16db77a2febc1","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-12T13:10:58.875620Z","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:8b61c50e17ff5cbf582dd0e11703b50c69e704e881056610131f49610263e9a8","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-12T13:10:58.875620Z","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:a13beeb291b7496e987f9665ced6bacf255050e039daab47f174ab7acba9b81b","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-12T13:10:58.875620Z","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:833cd43b9351b1262c78c1a429b7c7f0a5519de6c4f39299eb010d833dc685bc","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-12T13:10:58.875620Z","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:7906befc08948394e442987295666905b45b7f9282e94d78e0eda151b401223f","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-12T13:10:58.875620Z","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:8a9bd78a5b1bdf50728f67f5851cfd20ab0dbec7dcace873b24b2ffdc6c8dce9","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-12T13:10:58.875620Z","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:c955b7d067079e576089bdef7816bb5935b095ab9bb04fdf721a7ccdcb655133","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-11T09:47:44.692325Z","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-12T13:10:58.875620Z","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:72b9c0bbb2ce90e1e4d26d0c4030eb2e1c162df47cc12a7fd2f85443aef5273a","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-12T13:10:58.875620Z","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:b12096c79ba6daa423d4e38d27d52e405fd0532173f394fa3feeed3f90d162bd","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-12T13:10:58.875620Z","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:5874b86d2637515c6668c20d68dde0eeec3b77ee7bfd440b249aea1372300925","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-12T15:28:52.791113Z","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-12T13:10:58.875620Z","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:a07670476e8b3fbed836668b4f2f0e9513300add31ab0438fe4e1aa5bf53e6e4","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-12T13:10:58.875620Z","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:3102f62511e1573927e09e785d114c508ce475d5f5f16c485849e1b146ee64b7","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-12T13:10:58.875620Z","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:e61e9701c0f57f327e10c6fc9f03b84b0077456b8a0bf0ff80e6af6145aa9688","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-12T13:10:58.875620Z","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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 35 of 35 outbound references and 0 inbound Pith citation observations for arXiv:2607.08358."}