{"as_of":"2026-08-13T22:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3789d70b0e2cef9b0abd4e9bc21272fcac0c7e1a1c82d15a750c44c3db4bce3d","coverage":[{"denominator":90,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":90,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-13T04:56:33.944199Z","state":"measured"},{"denominator":90,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":90,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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.09170/citation-record","integrity":"/paper/2607.09170/integrity","json":"/paper/2607.09170/citation-record.json","paper":"/paper/2607.09170"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.24166/im.13.2017","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Typical distances in a geo- metric model for complex networks","venue":"Internet Mathematics","work_id":"e84bbf52-0b1a-4288-9656-67d6c0bd3aa0","year":2017},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:a343bd7a8f530d704624154e1d3474f7cc24274a1b0e554c53ee6b30ae55a465","observation_id":"4b4c6445-7771-45cb-81af-ecbc4d7f31eb","resolution":{"observed_at":"2026-07-13T04:59:20.269321Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T09:19:36.790714+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T09:19:36.790714+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+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-07-13T04:56:33.944199Z","title":"A fast and simple randomized parallel algorithm for the maximal independent set problem","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:eaabd922cc350c4990321e0b51eecf75c0a3069d0df220b8e0dd9da6aafa5001","observation_id":"5c727730-cd4d-4352-a50b-bdb4eead76ec","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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-13T04:56:33.944199Z","title":"Hyperbolic Random Graphs: Clique Number and Degeneracy with Implications for Colouring","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:fa552af82305d2700d0bf4d8cfcd5dc681bcbefe651f28faabf252af189f0c41","observation_id":"831d217f-f9f6-4b23-85e6-be2eddf70a1e","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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-13T04:56:33.944199Z","title":"Distributed Quantum Advantage for Local Problems","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:e14c46e05c9b894be2d2a4862160890ac5d3fbb88c8da73cca3e1c786ad595c1","observation_id":"670e49ba-0db2-4c8d-bb84-97a8ac651af0","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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":"10.1145/3461458.url:https://doi.org/10.1145/3461458","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T04:59:20.307041Z","title":"Lower Bounds for Maximal Matchings and Maximal Independent Sets","venue":null,"work_id":"2ace192a-bcb9-4441-a631-a413a712b9f1","year":2021},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:c5e1c1e27538902f41cc97a3ae7d0483afef8863727ed6225fc64f44f1e565e4","observation_id":"195ccead-9231-4332-9ca4-767bdde947ab","resolution":{"observed_at":"2026-07-13T04:59:20.309341Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T09:19:37.278375+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T09:19:37.278375+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+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-07-13T04:56:33.944199Z","title":"DistributedΔ-coloring plays hide-and-seek","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:cb85c5cf5723b14ed9af6a81ccf53a590739f2da1e2a759654cf7417828182d1","observation_id":"8bb10c13-b7f8-4cdc-93f2-4a54a4d8153d","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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-13T04:56:33.944199Z","title":"New Hardness Results for the LOCAL Model via a Simple Self-Reduction","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:a877bdf26857f58be1a8090d9390fcb3920462fde4615c8844c1f2f821658aec","observation_id":"afc316fe-7b42-4bbb-b467-9857c3a2fa3b","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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":"10.1137/1.9781611978971.49.url:","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T04:59:20.408466Z","title":"Distributed Quantum Advantage in Locally Checkable Labeling Problems","venue":null,"work_id":"af8b824a-de60-46eb-b5d1-e9ee35b18071","year":null},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:b4492dd6cde070cef8d4e071f433bc28c35dd81125c872f12c9fb8b68c099e32","observation_id":"8860183f-33c7-4a84-9f1a-d73d17bca800","resolution":{"observed_at":"2026-07-13T04:59:20.410111Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T09:19:37.764865+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T09:19:37.764865+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00446-023-00453-1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Node and edge averaged complex- ities of local graph problems","venue":"Distributed Computing","work_id":"ee1e1123-e798-4a8f-80e5-2369f186010a","year":2023},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:4d6145d6c2fe1a03254bcafe7fe23ed5189fcc652301438b81a16d8a959d54c6","observation_id":"67858e6e-0600-4949-bfd6-97ae11d57fc5","resolution":{"observed_at":"2026-07-13T04:59:20.424268Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T09:19:38.08765+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T09:19:38.08765+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+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-07-13T04:56:33.944199Z","title":"Emergence of Scaling in Random Networks","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:b38c9a5109fc75d6027a4a58d52f7206e51e7e6286f6f768a10e489361ca88c7","observation_id":"06fe01f7-d4b0-4a0d-90b2-553a91badea0","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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-13T04:56:33.944199Z","title":"Morgan & Claypool Publishers, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:088166275a56eac6e0e56c7c36b9ccdf925612610d6d51b2d4d5088f52da565a","observation_id":"73173036-a98a-4e86-b822-8548bbd81a4d","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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":"10.1145/2903137","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"The Locality of Distributed Symmetry Breaking","venue":"Journal of the ACM","work_id":"d599de24-8e73-4307-96ae-a1a9b2275125","year":2016},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:a8b206c67aefb949db1da2ac0fa66b9556f47fdb9db85f633719405c60190479","observation_id":"771c347b-5b53-426e-a7d3-12052ae11072","resolution":{"observed_at":"2026-07-13T04:59:20.359465Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T09:19:38.685424+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T09:19:38.685424+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+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-07-13T04:56:33.944199Z","title":"The Diameter of (Threshold) Geometric Inhomogeneous Random Graphs","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:f6edc21e3bb71ea004b58bb704ad0482d6d5883c10964b6ab13c0aad05e0d242","observation_id":"fc30240a-c52b-42a3-86ac-9721757dd016","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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-13T04:56:33.944199Z","title":"Localized geometry detection in scale-free random graphs","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:5d34bd46d6e1a7020835dcd90b69d326dab4a038f1eaa8e50522a8a137c4785c","observation_id":"e5572602-d96f-461c-8c99-ce5d0d85d806","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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-13T04:56:33.944199Z","title":"Product Structure and Treewidth of Hyperbolic Uniform Disk Graphs","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:da28df01f85ddbf63358661c3d9eb1b93b2edd1583ffc9ee4aa8f8e45f47a896","observation_id":"e54638ba-50bd-4ee0-92f8-885e9bc40e02","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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":"10.1145/3633778","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On the External Validity of Average-case Analyses of Graph Algorithms","venue":"ACM Transactions on Algorithms","work_id":"ed0a2218-c1cf-467a-81f2-2656751abedd","year":2024},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:35398374a7271656f3924a4d42f5042d5d6ae721820a242922cb638a13330afa","observation_id":"f5b6f093-7524-4001-8f8f-e28905356731","resolution":{"observed_at":"2026-07-13T04:59:20.259881Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T09:19:39.42789+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T09:19:39.42789+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+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-07-13T04:56:33.944199Z","title":"Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:8dfd71e02c117753e46e11a1d3db81db0c0a81bbce465726f867f4f36a627c64","observation_id":"8321290e-85f9-4547-bce0-b7092278b296","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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":"10.1145/3516483","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry","venue":"ACM Transactions on Algorithms","work_id":"d9385aab-bbc1-42cb-a983-3db94fb703f2","year":2022},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:d03e5cb44c5c9ef63615a68fec59e96c22f8ff437f4f80740ca9935bf49a4a6d","observation_id":"5c0c61eb-2451-49e7-8fa9-d38910fb0317","resolution":{"observed_at":"2026-07-13T04:59:20.326698Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T09:19:39.678057+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T09:19:39.678057+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+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-07-13T04:56:33.944199Z","title":"Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:3cf4686224b3b299c948403759382a96cb728834e674e08e1646b053144faa91","observation_id":"946d790f-6f83-493d-986c-f17601b0ab3c","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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-13T04:56:33.944199Z","title":"Efficiently generating geometric inhomogeneous and hyperbolic random graphs","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:6ca571e64b88947ef3f2f4de34d57f517a54a7d27d30f18833224055e7458870","observation_id":"f350c102-d426-4dc4-98e9-7999ec951927","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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-13T04:56:33.944199Z","title":"On the Giant Component of Geometric Inhomogeneous Random Graphs","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:4a167f7b23c7e12343b87bcf7781acea3cbda43e8a9a67998908f8f558802473","observation_id":"ed53d20c-619c-4e90-86c6-4884e66da241","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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":"10.4230/lipics.stacs.2023.13","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Strongly Hyperbolic Unit Disk Graphs","venue":"arXiv (Cornell University)","work_id":"0ceec90e-fddd-4a47-ad20-6abc4b8189cf","year":2023},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:3b1e3f3b6fcecca2a108817fbde6ca8c4be82162ffa7e268cadd52bf84f23e80","observation_id":"bfd2a8ef-1aab-4053-92f3-0735c0573cb5","resolution":{"observed_at":"2026-07-13T04:59:20.461993Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T09:19:40.172861+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T09:19:40.172861+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-017-0323-3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Cliques in Hyperbolic Random Graphs","venue":"Algorithmica","work_id":"0e2caca4-a945-43c4-84a4-bf0c109d84db","year":2018},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:b2ce4e4a6547afc2c55ac99e10c905bc78f732852d4a3d4c90f6c60864b3d5c7","observation_id":"563fb102-6217-42a5-95f5-a286062d652d","resolution":{"observed_at":"2026-07-13T04:59:20.354251Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T09:19:40.416449+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T09:19:40.416449+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.esa.2016.15","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Hyperbolic Random Graphs: Separators and Treewidth","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"8a2667e9-f62d-4936-98ee-eb45aa0972be","year":2016},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:0fda6a651435478c7e3ede07d6604fe06fe5fda779924a45937ed6c7b234e911","observation_id":"0f2a8706-4ae3-4362-accc-d65a20770b5b","resolution":{"observed_at":"2026-07-13T04:59:20.414404Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T09:19:40.663595+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T09:19:40.663595+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.socg.2025.21","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Structure and Independence in Hyperbolic Uniform Disk Graphs","venue":"Aaltodoc (Aalto University)","work_id":"31f67ece-ea4b-442b-a495-5e7a47427b07","year":2025},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:c985714961ae3b2e13cd667ec5a56763646a25df1291dd990f164678f00de895","observation_id":"063521ca-cd0a-4295-9b5f-4b818e21d337","resolution":{"observed_at":"2026-07-13T04:59:20.290536Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T09:19:40.924604+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T09:19:40.924604+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1017/nws.2024.13","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Maximal cliques in scale-free random graphs","venue":"Network Science","work_id":"46c6f867-6084-4d17-8e4d-fd8a1c1ec607","year":2024},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:6dab096a6874d9388cf034b0e8cb9cbce71252204e171a3c344e2f35f7c69de9","observation_id":"7f045c11-2fce-4fa5-a8d0-3549639d46b7","resolution":{"observed_at":"2026-07-13T04:59:20.320724Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T09:19:41.17627+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T09:19:41.17627+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+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-07-13T04:56:33.944199Z","title":"On the largest component of a hyperbolic model of complex networks","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:62c57ad24a5043d481cb73b913522639719235cac9f50343a41f1eeadab89e4c","observation_id":"1b26b838-d7d3-4747-94b3-8577bfca4444","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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":"10.1038/ncomms1063","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Sustaining the Internet with hyperbolic mapping","venue":"Nature Communications","work_id":"f8190da3-40d6-4c28-a053-698fcf64da1f","year":2010},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:749b1e1af7133d4e568449551740546890ab1e4953d291865baeee4037949d8b","observation_id":"3a5605e5-0699-42a9-98c9-d534195173a2","resolution":{"observed_at":"2026-07-13T04:59:20.340703Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T09:19:41.712032+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T09:19:41.712032+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+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-07-13T04:56:33.944199Z","title":"Truly Tight-in-ΔBounds for Bipartite Maximal Matching and Variants","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:51ebfb6a1bf2c8a691620cc1378948203e31923df1bc300571bf376cb3806216","observation_id":"6fa16441-4191-4032-ac1d-2010021c6828","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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-13T04:56:33.944199Z","title":"Geometric inhomogeneous random graphs","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:a0c6b7927534bb7b05b08addef7d4aaaba3379231b94a4a34d23b9294a84a4f0","observation_id":"a5721aa4-6079-4284-859c-b6e3a9c8f192","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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-13T04:56:33.944199Z","title":"Greedy routing and the algorithmic small-world phenomenon","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:aba1d8905424a99586db25255dc93948f7527ba5f40e9042e084c1a2eab5f40f","observation_id":"13d772fc-01fa-4fb3-aeba-9448a6b22d07","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.22186","last_updated":"2024-10-29T16:24:39Z","snapshot_observed_at":"2026-08-12T22:12:39.506957Z","submitted_at":"2024-10-29T16:24:39Z","title":"Balanced Bidirectional Breadth-First Search on Scale-Free Networks","version":1},"cited_work":{"arxiv_id":"2410.22186","doi":"10.48550/arxiv.2410.22186.url:https://arxiv.org/abs/2410.22186","metadata_source":"pith","pith_arxiv_id":"2410.22186","snapshot_observed_at":"2026-07-13T06:15:01.053796Z","title":"Balanced Bidirectional Breadth-First Search on Scale-Free Networks","venue":"cs.SI","work_id":"015e3de5-a4fc-4ee3-926d-90d8690e3872","year":2024},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"cited_paper":"/paper/2410.22186","citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:12bdaf294f30446baa99b725d56dfbfc0105247b2ba252d45a1f5229cf95b1a9","observation_id":"958aa520-aa62-4c1d-8123-1c0b5a84c913","resolution":{"observed_at":"2026-07-13T04:59:20.504675Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T09:19:42.519383+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T09:19:42.519383+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/17m1117537","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model","venue":"SIAM Journal on Computing","work_id":"60e69ab5-0db1-4bff-a216-48092698cafe","year":2019},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:4d7bbabca3b95fad3befd326c7eae836baefabca687b6fedf4b7fbb4313133b1","observation_id":"24c7e2d5-ef7e-493d-907b-4b0295391d95","resolution":{"observed_at":"2026-07-13T04:59:20.392415Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T09:19:42.798523+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T09:19:42.798523+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+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-07-13T04:56:33.944199Z","title":"An optimal distributed (Δ+1)-coloring algorithm?","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:a3893262442866054ff5aa0036beefe4d15937129b617a7e096a60d24042e254","observation_id":"ff8539fc-37b1-4ae2-abe6-2520257a89a2","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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-13T04:56:33.944199Z","title":"Connected Components in Random Graphs with Given Expected Degree Sequences","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:9d8d5b529820ba8603135db028feb003e6a65ddd63bb8708e6cfaaad0531b1c2","observation_id":"7420def9-cc46-4a69-a968-87ff253ccc12","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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-13T04:56:33.944199Z","title":"The Average Distances in Random Graphs with Given Expected Degrees","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:edef73f66e21a34eeaee731b40e805a9ad3eb307c30801c384459690b64746bf","observation_id":"e734ef93-0eee-49a6-a15c-b58a589d4c81","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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-13T04:56:33.944199Z","title":"A Breezing Proof of the KMW Bound","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:528c2553dcfa0c23baaa8cbb6d7e54aa814a49022ce6b1e3e210fb69a0948773","observation_id":"8a98d22c-bccd-476f-a7dd-ef40b39b7296","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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-13T04:56:33.944199Z","title":"On power-law relationships of the internet topology","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:b38c772ddfb54de59945b793a0b700081f4236bf695de4f68cc5eee0de1cf3b9","observation_id":"30abad16-9e23-498a-ad41-45b27c986926","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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-13T04:56:33.944199Z","title":"Local Dis- tributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:075480a5f9890d6c5610d03211c6adc075442c0f751d4a54eb97d97cb7db866a","observation_id":"f03931b9-caa3-4d9c-b8a7-ddc247381d93","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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-13T04:56:33.944199Z","title":"Improved deterministic distributed matching via rounding","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:adb9e80cbdb5b1301aac7e467b786f9e0d644de4ac3580d998c21854a04380a2","observation_id":"b420b7d1-bcc4-4ec9-b326-2b411cc532c8","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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-13T04:56:33.944199Z","title":"Law of large numbers for the largest component in a hyperbolic model of complex networks","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:a0a902839741efadcd4d6eed4bcdb6800cc5a6cd9837505aefe0eb52e487ceab","observation_id":"e06502ef-0500-46a1-8add-2c58da4b70c0","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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":"10.1137/17m1123961","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On the Diameter of Hyperbolic Random Graphs","venue":"SIAM Journal on Discrete Mathematics","work_id":"c0f2c4db-332e-4d9f-9b40-79edfa857409","year":2018},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:841254c5bc8cdb398634c9fc14549ce47d7eaf0f9a11536ab2ec965465d8096b","observation_id":"4378e860-0f50-45e3-a0c5-a4f8472e6bab","resolution":{"observed_at":"2026-07-13T04:59:20.314461Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T09:19:43.792845+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T09:19:43.792845+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+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-07-13T04:56:33.944199Z","title":"An Improved Distributed Algorithm for Maximal Independent Set","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:b699fc7a2245bd8ee19747bd7df0a6ea5627226c3b0f994e352cf9834fd28380","observation_id":"eb1a8d4f-ad1a-4006-8482-5182695190c0","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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":"10.1137/1.9781611975482.50.url:","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T04:59:20.381496Z","title":"Distributed Maximal Independent Set using Small Messages","venue":null,"work_id":"89118251-e2a0-4049-a9db-855863637630","year":2019},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:d69a83413227d5f89a1e7301c5125fd5981f64c18d59fb0a7ffcd90dad4e8f3d","observation_id":"f2587d4d-030c-4940-bcde-eae8383a826d","resolution":{"observed_at":"2026-07-13T04:59:20.384810Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T09:19:44.025497+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T09:19:44.025497+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+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-07-13T04:56:33.944199Z","title":"Faster deterministic distributed MIS and approximate matching","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:474e7ebb669ea57cf4e716fc83c9f5c5648b8293baf64593f583de46e6982547","observation_id":"b91bdd98-60b1-4dfc-9ec1-6c97c39b8a2a","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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-13T04:56:33.944199Z","title":"Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:4111015b3ec9a98bdd5689ee89da56c23c6a17e5cd31d1e1a8206c3ccd1b1eda","observation_id":"0df6a213-4f31-40f4-9c2d-5cb977f44bff","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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":"10.1137/1.9781611977554.ch97.url:","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T04:59:20.448021Z","title":"Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via Derandomization","venue":null,"work_id":"6ca77b81-acf0-4c4e-b725-31c1c6a90e67","year":2023},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:8290342c5840b9fff04b908b372e6c5c43c93aee0acb234e5e695379de571f85","observation_id":"1147daaa-c9a1-4d5a-bd50-a476d72a9067","resolution":{"observed_at":"2026-07-13T04:59:20.449950Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T09:19:44.526201+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T09:19:44.526201+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2606.27847","last_updated":"2026-06-26T08:41:17Z","snapshot_observed_at":"2026-08-11T22:14:40.130416Z","submitted_at":"2026-06-26T08:41:17Z","title":"Robust Shattering Arguments","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2606.27847","snapshot_observed_at":"2026-07-13T04:56:33.944199Z","title":"Halldórsson, Yannic Maus, and Alexandre Nolin.Robust Shattering Arguments","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"cited_paper":"/paper/2606.27847","citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:96f046066104e0fe03364b69eaf685eb86c8ce55479a7f5b1541d1bfeab43243","observation_id":"6efcc15e-8ecd-4c24-a201-58a1e24af49a","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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-13T04:56:33.944199Z","title":"Improved Network Decompositions Using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:fe4cc2184b50e87bf7207c6a70e13c5eaee64e06551e44294d0c82f6401bd68b","observation_id":"43d0c549-7dd9-46f5-8db5-c7af1fc85dfb","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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":"10.1007/978-3-642-31585-5_51","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Random Hyperbolic Graphs: Degree Sequence and Clustering","venue":"Lecture notes in computer science","work_id":"1ccae8cd-501a-4948-abc7-068f9c2606de","year":2012},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:516ccfc0dd816f606e6a6223df71abe7781560f6484d390465e0f5e032980bb5","observation_id":"04e6c316-dc09-4293-99c5-8ac0da886481","resolution":{"observed_at":"2026-07-13T04:59:20.418797Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T09:19:44.781848+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T09:19:44.781848+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3178120","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Distributed (Δ+1)-Coloring in Sublogarith- mic Rounds","venue":"Journal of the ACM","work_id":"6e05cb11-f55f-45ad-947c-5901b422e0f7","year":2018},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:5bd46c962257a61b608e25b9ded6eaa1459186e2a38146b5b6402f0e8c6cc09f","observation_id":"fff60b6a-3048-4094-b504-c0219af0071b","resolution":{"observed_at":"2026-07-13T04:59:20.405648Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T09:19:45.037339+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T09:19:45.037339+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1214/24-aop1742","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Cluster-size decay in supercritical kernel-based spatial random graphs","venue":"The Annals of Probability","work_id":"e2684c08-ffa0-4e99-a211-f791a4ce9d87","year":2025},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:5114b2f972ab0bbb3dd843a8518854837923c8710a0a1cc5fedb5e92a78ed295","observation_id":"32bb8470-a0aa-4dfe-9a0f-0e98d5589159","resolution":{"observed_at":"2026-07-13T04:59:20.345129Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T09:19:45.341674+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T09:19:45.341674+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+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-07-13T04:56:33.944199Z","title":"About the analysis of algorithms on networks with underlying hyperbolic geometry","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:f1e6fa8138b1cfe7d020b7a4f8e34de55b7777389e7456a19507b334116da071","observation_id":"05d7d380-9221-43cd-adf4-7182d3e3096e","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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":"10.1137/1.9781611978971.226.url:","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T04:59:20.472105Z","title":"Rumour Spreading Depends on the Latent Geometry and Degree Distribution in Social Network Models","venue":null,"work_id":"6ad1f262-aa00-4033-9bcd-9d1c5872c433","year":2026},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:46f721dc3ca7f8c35cdf6b2b7c4d2a9bdcb26439b7b6bf1a82d765de0f1e5f2d","observation_id":"a3b8a88c-3668-4b69-82eb-b26d847191e0","resolution":{"observed_at":"2026-07-13T04:59:20.476002Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T09:19:45.574099+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T09:19:45.574099+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+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-07-13T04:56:33.944199Z","title":"Breaking Barriers for Distributed MIS by Faster Degree Reduction","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:2005e26b8390b41865eb026a491f37138573ff104be96a0a647ed6742aad8747","observation_id":"7c21361f-35ba-4712-9b2c-6950a954ed3c","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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-13T04:56:33.944199Z","title":"Round Elimination via Self-Reduction: Closing Gaps for Distributed Maximal Matching","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:9a5cc816db29dad775f5293fdfa788977aa77765e0b602335b67fc4103c6a3fe","observation_id":"2b764fbc-d94d-4199-9020-3132c3d9b3b2","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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-13T04:56:33.944199Z","title":"Hyperbolic intersection graphs and (quasi)-polynomial time","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:b5171af81dc292b64a7f17bb7c9d3de349376259fc6d01209e0c77643265e453","observation_id":"17c31e7b-ee69-4bdd-b664-224945e2c0ed","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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":"10.1137/1.9781611973761.3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A Bound for the Diameter of Random Hyperbolic Graphs","venue":null,"work_id":"49361905-77db-433e-9612-e4fd34bff4b5","year":2015},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:ebdc4b3a66d5ec1418b5898f1ac774b749e7b6449c7fe71ecfc866b9e4ca4294","observation_id":"87d2bab3-016c-44e8-9aa0-96bdee45515c","resolution":{"observed_at":"2026-07-13T04:59:20.401148Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T09:19:46.066227+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T09:19:46.066227+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/18m121201x","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On the Second Largest Component of Random Hyperbolic Graphs","venue":"SIAM Journal on Discrete Mathematics","work_id":"6dbda3de-4cbf-4409-8130-6e7d38db6437","year":2019},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:20927d7759e2811db05f9515469e917712d0fd3b380c1a131e7fe59200f3af77","observation_id":"1403cf04-a1ee-4108-9d2e-d0e226b644f7","resolution":{"observed_at":"2026-07-13T04:59:20.492534Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T09:19:46.325154+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T09:19:46.325154+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1214/17-aap1323","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Spectral gap of random hyperbolic graphs and related parameters","venue":"The Annals of Applied Probability","work_id":"1d1334b9-5485-4264-9f3e-329ede5a4061","year":2018},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:876f4006bb3188cff95fca371554e82d6636e7804ca4547116426e673f01b0f3","observation_id":"10a2a3c2-0855-4aeb-b106-1722686c6dd5","resolution":{"observed_at":"2026-07-13T04:59:20.297610Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T09:19:46.578369+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T09:19:46.578369+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1002/rsa.21249","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Cover and hitting times of hyperbolic random graphs","venue":"Random Structures and Algorithms","work_id":"bbf18994-8e88-4350-bd74-480596938099","year":2024},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:9ca764a0c4609b263cc5263df7712f1899fb2b87f3709e79f227b3a32d993a90","observation_id":"7a4b34dc-a75c-49c3-8d7f-18f273c45c73","resolution":{"observed_at":"2026-07-13T04:59:20.519731Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T09:19:46.836819+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T09:19:46.836819+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1214/24-ejp1216.url:http://dx.doi.org/10.1214/24-ejp1216","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T04:59:20.434706Z","title":"Polynomial growth in degree- dependent first passage percolation on spatial random graphs","venue":null,"work_id":"14645d36-b3b3-4ed0-a631-a2b4745cf3d1","year":2024},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:3d4352b4e2841f850fd86eb0dea2f9110c8e3f1fe4a6bfd795147df7a0fdccf8","observation_id":"897670f4-6f3e-41f7-848d-081b0daf19c1","resolution":{"observed_at":"2026-07-13T04:59:20.436631Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T09:19:47.09079+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T09:19:47.09079+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+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-07-13T04:56:33.944199Z","title":"Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:9a66cd0f03387bc4fc22c80106b7f7fe17c19a55c7adbe3ef003f2a3b3fc559d","observation_id":"a9d5d9a9-c634-4a9d-b3eb-a540eef346a8","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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-13T04:56:33.944199Z","title":"Koonin, Yuri I","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:90a157c01ca7ee23e035a67152362bad3a0e179d08ad23400a75fd59e35c73de","observation_id":"3134bd01-b8da-4125-a639-d23f311a8ef2","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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-13T04:56:33.944199Z","title":"Hyperbolic Geometry of Complex Networks","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:6c7bd15c2f8fd0afd4f247b14c8b8d9f9900d1a25c711255680a90dbec370675","observation_id":"f9161940-8243-442d-9717-6ff4dc1cc0fa","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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-13T04:56:33.944199Z","title":"Structures & algorithms in hyperbolic random graphs","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:c834d22598006955681c5046d5a5bd5176fe5c62303fc43e9c595f8d45e56264","observation_id":"417a9416-f45e-4dc8-aa1a-25a9305b183b","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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-13T04:56:33.944199Z","title":"Fast Deterministic Dis- tributed Maximal Independent Set Computation on Growth-Bounded Graphs","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:604ffca4bad8464b2533a0365fd8566ec8907c514e96c59ed48cd0560a254a04","observation_id":"1b2ac24a-3543-4fe5-9605-dfecbcf3a56e","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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":"10.1145/2742012.url:","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T04:59:20.366653Z","title":"Local Computation: Lower and Upper Bounds","venue":null,"work_id":"3437c801-b0f8-4a72-9d5f-fd8f1d9381c9","year":2016},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:529133c24bc0904509be7daf99c622c9bf40e23ceda4c71dd3bd14b5c7ba87cb","observation_id":"2d1d458a-9bb7-471b-a678-f2ab5d6ae0cd","resolution":{"observed_at":"2026-07-13T04:59:20.368508Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T09:19:47.659861+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T09:19:47.659861+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+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-07-13T04:56:33.944199Z","title":"MIS on trees","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:29222116d9ead2a6ccb4f7f2d8a90aa3534d8c0c481d200e40a43e4c03097cd5","observation_id":"c337ce0b-96c2-4594-bad9-1355e6a08756","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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":"10.1109/sfcs.1987.20","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Distributive graph algorithms Global solutions from local data","venue":null,"work_id":"b95ff4c1-af43-4ec4-8854-3002c354e437","year":1987},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:af36cba06d800d0c8a96dd363282840ad770544bf919372899ec7b64823a2a7b","observation_id":"c441d97b-57eb-413b-a08c-0ca292ec71cc","resolution":{"observed_at":"2026-07-13T04:59:20.335109Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T09:19:47.90244+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T09:19:47.90244+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+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-07-13T04:56:33.944199Z","title":"Locality in Distributed Graph Algorithms","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:1aa2ebbf8546c2d0f52f72d8d752d71a78290f17b7c006b50f67446863b4ab12","observation_id":"1a9c3a5e-79d6-4e13-8de6-a5f006edbf3b","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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-13T04:56:33.944199Z","title":"A Simple Parallel Algorithm for the Maximal Independent Set Problem","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:2504b1dd8193d7840516f9cca5342cdbc75d48a85b5c33e942212aebcc3cd875","observation_id":"36c2797e-93c4-446a-af3b-5b137fad1c38","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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":"10.1137/1.9781611978971.91","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On Distributed Colouring of Hyperbolic Random Graphs","venue":"Society for Industrial and Applied Mathematics eBooks","work_id":"28110513-ac8b-4752-b00c-dfc06c81d047","year":2026},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:d3aa68b8c54f76821eee85a5036eb49983e038de9763255b2de1c7309da4ff21","observation_id":"c3eabcaf-b07a-47b1-8b7e-1c1a80054bab","resolution":{"observed_at":"2026-07-13T04:59:20.457648Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T09:19:48.407211+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T09:19:48.407211+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+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-07-13T04:56:33.944199Z","title":"An optimal bit complexity randomized distributed MIS algorithm","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:434776155ca4d932567fc004ee2e6c50676d35ccc8434e504fbdbd566d257ebc","observation_id":"cf9abf02-eff3-4611-8e84-198f1b2c9045","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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":"10.1093/comnet/cnac002","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Cliques in geometric inhomogeneous random graphs","venue":"Journal of Complex Networks","work_id":"50300027-ec93-43a4-8746-736002310773","year":2021},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:f8e33841319ebe1186b2e36ff9f42830c65ac34f5afdf196cbd485e092eac7e4","observation_id":"18313584-19da-4638-aa00-b1caa2df58c5","resolution":{"observed_at":"2026-07-13T04:59:20.303552Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T09:19:48.921734+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T09:19:48.921734+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jpdc.2019.05.012","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Optimal deterministic distributed algorithms for maximal independent set in geometric graphs","venue":"Journal of Parallel and Distributed Computing","work_id":"bc4036a3-9700-4657-aaad-7ea9d6349b8e","year":2019},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:f53a9fa06725b2699fc5a7637d2b59565e31f0302e749d2ccd57964f5ddf244c","observation_id":"9995b6c4-2a07-403d-b15f-c817ef4a477a","resolution":{"observed_at":"2026-07-13T04:59:20.484884Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T09:19:49.267406+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T09:19:49.267406+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1017/apr.2019.23","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"The Diameter of KPKVB Random Graphs","venue":"Advances in Applied Probability","work_id":"08c94412-2197-4801-98a5-aa342c93870d","year":2019},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:1bf4573aca27d871ceba84cee2bf7858436dd8fccee3e48a0b97b2c0990ac74d","observation_id":"193aa5fb-8dc2-4d10-b24f-aaef938c9b22","resolution":{"observed_at":"2026-07-13T04:59:20.274784Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T09:19:49.514795+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T09:19:49.514795+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+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-07-13T04:56:33.944199Z","title":"A Lower Bound on Probabilistic Algorithms for Distributive Ring Coloring","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:7cc784e026d584a22d751a8b4e2a2e93227c66bf00a7f14888c4cf055e603ba6","observation_id":"ce4568e6-597d-4272-9e6e-4a39f0c1d1ff","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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":"10.1103/physreve.68.036122","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Why social networks are different from other types of networks","venue":"Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics","work_id":"adb71aaf-ebf6-46ad-b812-4fe117b0785d","year":2003},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:e35eac166ee26aada393a8677aba0bbf66e96b7da028269b3219ee3fe5b30e68","observation_id":"d81e2f45-719c-4b27-865b-6e00192d286e","resolution":{"observed_at":"2026-07-13T04:59:20.469324Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T09:19:49.778649+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T09:19:49.778649+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2010.546213","doi":"10.1109/infcom.2010.5462131","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Greedy Forwarding in Dynamic Scale-Free Networks Embedded in Hyperbolic Metric Spaces","venue":null,"work_id":"55dfc20c-bd3f-4501-85d7-dc8669098158","year":2010},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:59282f455eaee7d5cad0521d5f6339bfeea10a3028a76b6dabe509d5701df736","observation_id":"9ce770f2-67be-43d1-a031-14dd8607fc62","resolution":{"observed_at":"2026-07-13T04:59:20.511254Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T09:19:50.042604+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T09:19:50.042604+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+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-07-13T04:56:33.944199Z","title":null,"venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:8eff30cc966376cdf1b3f3ca135a9e3cfc3997006cde2da539872b2431d5ad39","observation_id":"26106fa4-3359-485a-9771-8256eff1c024","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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-13T04:56:33.944199Z","title":"Using Read-k Inequalities to Analyze a Distributed MIS Algorithm","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:7dc0b1adb9e2b0a06bc4483d697447d64e6beb3b5da6988beaedaa6af04a7c6a","observation_id":"23d30dd5-2ef7-428c-aed6-0295eb93fdcb","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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-13T04:56:33.944199Z","title":"Oxford University Press, 2003.isbn: 9780198506263","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:71a7713fa6da6d54930fecb5741b70df56730d67eda626df865974966b9431bb","observation_id":"3ab8b7db-369e-45db-99b9-7bcc157a456d","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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-13T04:56:33.944199Z","title":"Polylogarithmic-time deterministic network decomposition and distributed derandomization","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:57414c3bc515846f0b31e9b5939c8f1569ee594790e10e5716c71b180f7b5651","observation_id":"ab7bd715-2807-420b-8e47-7ae9b9c1b046","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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-13T04:56:33.944199Z","title":"An optimal maximal independent set algorithm for bounded-independence graphs","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:809e9904d825704e4be11ec20a2e621a551fcdd001b42b22215e02f8c98e66da","observation_id":"8ff277d1-9f12-4a16-9433-36be930542de","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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":"10.1103/physreve.74.056114","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Clustering in complex networks. I. General formalism","venue":"Physical Review E","work_id":"b5653174-04ee-4de1-8b0a-e78ac5ce97cd","year":2006},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:b5038181783e6cb6a97a948a09dddfc72d2b7f0508f8690b4b325a2d178dcc95","observation_id":"6a7cd8e1-d186-4122-8bf6-9f5668252b6b","resolution":{"observed_at":"2026-07-13T04:59:20.378744Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T09:19:50.544229+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T09:19:50.544229+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+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-07-13T04:56:33.944199Z","title":"Self-Similarity of Complex Networks and Hidden Metric Spaces","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:6a9c5d0892132bae6afd0883cb780656eab87f21aeec4a60af5a4c5d2705906b","observation_id":"7c25196b-a80f-41c1-84ad-b237b4c7b729","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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-13T04:56:33.944199Z","title":"Scale-free Networks Well Done","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:c160f44155d038c9c769414c55596140e98cbdbc41b64aa0ff78a2b1c9bf8e66","observation_id":"df957411-c7e8-402c-93ab-09720003b42a","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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-13T04:56:33.944199Z","title":"Collective dynamics of ‘small-world’ networks","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:dc5772e064ba81d9b68846286c6664da1c814d9aec2da62dd69a1e4d2aff1aa9","observation_id":"ff778342-d3f1-47f6-b087-29570c27535d","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","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-13T04:56:33.944199Z","title":"remaining leaves","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs","version":1},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-07-13T04:56:33.944199Z"},"links":{"citing_paper":"/paper/2607.09170"},"observation_digest":"sha256:2a35b4e2c1d298fa69676c9aaf5231fb0db3aac35548e01b98178cb02aaf2983","observation_id":"62bbcb30-ac33-4f75-af4d-d59b1a3a82f5","resolution":{"observed_at":"2026-07-13T04:56:33.944199Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.09170","last_updated":"2026-07-10T07:57:15Z","latest_version":1,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-09T08:23:53.005409Z","submitted_at":"2026-07-10T07:57:15Z","title":"Distributed Symmetry Breaking on Hyperbolic Random Graphs"},"reference_resolution":{"displayed":90,"state_counts":{"malformed_identifier":8,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":46,"verified_exact":36,"verified_fuzzy":0},"total_outbound_references":90},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 90 of 90 outbound references and 0 inbound Pith citation observations for arXiv:2607.09170."}