{"as_of":"2026-08-13T14:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f8bc9807dee0848eec46ff7a7e19f46de19edd2401701b97fc506f25e90d2bfb","coverage":[{"denominator":54,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":54,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T10:10:39.582338Z","state":"measured"},{"denominator":54,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":54,"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.20360/citation-record","integrity":"/paper/2607.20360/integrity","json":"/paper/2607.20360/citation-record.json","paper":"/paper/2607.20360"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:10:34.950096Z","title":"Four degrees of separation","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:34.950096Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:92164afd348f161e3ddd6217764e84da7c7b475d5e8f8292dc3214e245383f48","observation_id":"1b8b3a62-4c22-449b-9352-445d98972ba9","resolution":{"observed_at":"2026-08-01T10:10:34.950096Z","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-08-01T10:10:35.172006Z","title":"Hyperbolic random graphs: Clique number and degeneracy with implications for colouring","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:35.172006Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:a19de376d399893ccabe5c8523e17e524876e8c0b2a057dff019b59f9faf0450","observation_id":"63eb856c-c94f-443a-b037-68ed27db9378","resolution":{"observed_at":"2026-08-01T10:10:35.172006Z","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-08-01T10:10:35.234037Z","title":"Improved distributed fractional coloring algorithms","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:35.234037Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:4596cf13cc79506237d6d89c5337bd38cfe2fadb32f8bac86cee397635577be7","observation_id":"8bb53816-dc88-4585-a781-2fcef3d28d1e","resolution":{"observed_at":"2026-08-01T10:10:35.234037Z","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-08-01T10:10:35.330050Z","title":"Distributed coloring of graphs with an optimal number of colors","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:35.330050Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:057523b994de61c2e00f1d35265a4ca2a57279afdc24c8b1e34a2ae4c1502e46","observation_id":"e4977d60-5518-40ff-984d-883ef5a9c2ac","resolution":{"observed_at":"2026-08-01T10:10:35.330050Z","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-08-01T10:10:35.419266Z","title":"Deterministic distributed vertex coloring in polylogarith- mic time.Journal of the ACM, 58(5):23:1–23:25, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:35.419266Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:1ae656e60a877263f58c569016470d5b3766ffeb8566d3ea53974eac1e125e4c","observation_id":"7c80c835-0a79-49ac-922d-c466a72ba089","resolution":{"observed_at":"2026-08-01T10:10:35.419266Z","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-08-01T10:10:35.505955Z","title":"A fast network-decomposition algorithm and its applications to constant-time distributed computation.Theoretical Computer Science, 751:2–23, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:35.505955Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:31ea1c53ce487c8ac694f48299811d2cf06c71557c274f3a767bc6ed64f4206b","observation_id":"0975d0de-a6dd-457e-b544-15ad0745c134","resolution":{"observed_at":"2026-08-01T10:10:35.505955Z","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-08-01T10:10:35.624350Z","title":"The diameter of (threshold) geometric inhomogeneous random graphs","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:35.624350Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:03e8346f819ab6ebf6e7b7cd62a770d9e369182541ddca27643cc86afd19497c","observation_id":"67f644ef-4272-4d03-812d-aa0bb02cd5f1","resolution":{"observed_at":"2026-08-01T10:10:35.624350Z","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-08-01T10:10:35.725094Z","title":"On the external validity of average-case analyses of graph algorithms.ACM Transactions on Algorithms, 20(1):1–42, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:35.725094Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:6786f77b63fe4253ef46e5915a0643e6ae480285dc7f1b8b393a24a9a024456e","observation_id":"fbdc0ae4-f5fd-44c7-b79a-6d9327904377","resolution":{"observed_at":"2026-08-01T10:10:35.725094Z","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-08-01T10:10:35.829448Z","title":"On the giant component of geometric inhomogeneous random graphs","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:35.829448Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:d21f46a8743c6a184371de6e976e17a2caf06db5678bd024adf2c0f8cc153dd9","observation_id":"0f5ec040-928f-4af1-8154-0f64a1e95fc8","resolution":{"observed_at":"2026-08-01T10:10:35.829448Z","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-08-01T10:10:35.956249Z","title":"Strongly hyperbolic unit disk graphs","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:35.956249Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:83ed4f47da8c4d0a3a3dd015a30a5389cdbdcc5e2b4c2e1bb433c6e1b60e3322","observation_id":"4cafb5e5-bf55-4011-822f-2a79a8d6b621","resolution":{"observed_at":"2026-08-01T10:10:35.956249Z","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-08-01T10:10:36.066920Z","title":"Hyperbolic random graphs: Separators and treewidth","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:36.066920Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:b4f811ca83183cc7e0eddf3e853cc9b69a687838b850a6777a9f2fa3251bc04d","observation_id":"0c8a27f9-d910-4152-a2a7-4186eb7d974b","resolution":{"observed_at":"2026-08-01T10:10:36.066920Z","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-08-01T10:10:36.162703Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:36.162703Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:c94074f743be1211c4fe59363f228373ac6ad4df36c3681c01fa21e1227cfab5","observation_id":"89cb7587-912e-4969-9f1f-f93d8df1f658","resolution":{"observed_at":"2026-08-01T10:10:36.162703Z","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-08-01T10:10:36.277198Z","title":"Ángeles Serrano","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:36.277198Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:892ecda501d59d2e3a59b3e31aa5880383e9ceb0ca03a133a638c09ec59b497a","observation_id":"7ff10806-067d-42ef-9771-3251818888fc","resolution":{"observed_at":"2026-08-01T10:10:36.277198Z","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-08-01T10:10:36.359574Z","title":"Sustaining the internet with hyperbolic mapping.Nature Communications, 1:62, 2010","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:36.359574Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:60bb89b55caaa643885ee42b15e827479153edd65265b7ffbca04b129ee17eb5","observation_id":"7f926e0f-39b5-4cdb-bcf2-cb5bdde9fd3c","resolution":{"observed_at":"2026-08-01T10:10:36.359574Z","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-08-01T10:10:36.449189Z","title":"Faster distributed∆-coloring via a reduction to MIS","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:36.449189Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:528e921087ff03ea3a2418fe8159666c2de4463257ca9c3ea265f4684c207fb6","observation_id":"2b590548-5a03-4a5a-91bf-e3a9b9d2b427","resolution":{"observed_at":"2026-08-01T10:10:36.449189Z","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-08-01T10:10:36.600755Z","title":"Distributed recoloring of interval and chordal graphs","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:36.600755Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:a0190ceb93eabbe39e92a2b8aa8ae04c6194c7b34eaad2fb1081960aa464f073","observation_id":"57735818-c780-4691-b1cc-aeeccd83b556","resolution":{"observed_at":"2026-08-01T10:10:36.600755Z","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-08-01T10:10:36.665955Z","title":"Sampling geometric inhomogeneous random graphs in linear time","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:36.665955Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:083a41eadee41e3a1a42a452aa26093cc5e4a4026e446ef3ed7972c98a2afb5a","observation_id":"0aa5bfe3-e9e5-41f8-a31a-017d7b63bdde","resolution":{"observed_at":"2026-08-01T10:10:36.665955Z","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-08-01T10:10:36.746838Z","title":"Geometric inhomogeneous random graphs.Theoretical Computer Science, 760:35–54, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:36.746838Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:21dfa6237f5bc80357552bf0c79b884aa67f58e23f4a19fc6565a23376704448","observation_id":"bad9aa7f-e7d9-461a-a62b-d529249d655b","resolution":{"observed_at":"2026-08-01T10:10:36.746838Z","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-08-01T10:10:36.816597Z","title":"Average distance in a general class of scale-free networks.Advances in Applied Probability, 57(2):371–406, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:36.816597Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:babbf9ce10381bfe000f1f9b8754e431831df510bc7026285f08cf065754eefe","observation_id":"202846bc-94b1-4b5e-8d59-94654e26fa4a","resolution":{"observed_at":"2026-08-01T10:10:36.816597Z","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-08-01T10:10:36.910061Z","title":"Greedy routing and the algorithmic small-world phenomenon.Journal of Computer and System Sciences, 125:59–105, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:36.910061Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:adce82eb6d317467204967eb69d40261a1def25c7067826e6dcb9571fe2a4778","observation_id":"1ee1ab6c-a306-4169-b976-a58576a54eae","resolution":{"observed_at":"2026-08-01T10:10:36.910061Z","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-08-01T10:10:37.015359Z","title":"Graph structure in the web.Computer Networks, 33(1–6):309–320, 2000","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:37.015359Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:9efbcf22f3eb0cbf61d24902be4bbb14cf53922ed1d92a7f5313aca1b79eddfc","observation_id":"7a537ab9-1630-4c33-a7d4-58d1ead65b2a","resolution":{"observed_at":"2026-08-01T10:10:37.015359Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.22186","snapshot_observed_at":"2026-08-01T10:10:37.107175Z","title":"Balanced bidirectional breadth-first search on scale-free networks","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:37.107175Z"},"links":{"cited_paper":"/paper/2410.22186","citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:0da9c9a234ca9240d8cc27e88c842c24e757b4867b8605182c283a365b95b6e1","observation_id":"b682fc8c-8bca-46b3-8262-e253e50a934d","resolution":{"observed_at":"2026-08-01T10:10:37.107175Z","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-08-01T10:10:37.214668Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:37.214668Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:17708a033fdb339c247f5d6cee603d22f80a981157a307f563c5acc905c72f6f","observation_id":"1e093755-13d9-4905-abd3-c403e329897b","resolution":{"observed_at":"2026-08-01T10:10:37.214668Z","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-08-01T10:10:37.271956Z","title":"No distributed quantum advantage for approximate graph coloring","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:37.271956Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:92c4197d5c0743f80afc5ba51ed5493578bd10c92ad2585254482e86cdf4368d","observation_id":"6698e67a-2882-4954-a83b-5f1b634e2eb5","resolution":{"observed_at":"2026-08-01T10:10:37.271956Z","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-08-01T10:10:37.365438Z","title":"Location- oblivious distributed unit disk graph coloring.Algorithmica, 60:236–249, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:37.365438Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:8d543c5151c4bd739c9e7b5c55f067031121ffa78b603df95d51bf33f7c7fb4e","observation_id":"75c6c055-237c-4316-8f54-79fc77510e23","resolution":{"observed_at":"2026-08-01T10:10:37.365438Z","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-08-01T10:10:37.457529Z","title":"Probabilistic tools for the analysis of randomized optimization heuristics","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:37.457529Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:3fc5883f898dca2eceabd61a69f8d4f57e0dddd7f66125a36b8d55bcd9c640bb","observation_id":"1c58f969-f078-4978-941a-6f28bca78fb4","resolution":{"observed_at":"2026-08-01T10:10:37.457529Z","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-08-01T10:10:37.547800Z","title":"Three and a half degrees of separation","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:37.547800Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:f752e5bff6865d0881d0bd0e01ad5aa9c0416888e9d1cb0f6fed3d3d1200964b","observation_id":"448cfe04-52db-479a-a3c2-075f287f0ee8","resolution":{"observed_at":"2026-08-01T10:10:37.547800Z","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-08-01T10:10:37.558597Z","title":"Distributed coloring and the local structure of unit-disk graphs.Theoretical Computer Science, 944:113674, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:37.558597Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:bd295ad27e07b77e7fd1c94441c29cd97cfc4dbbc22d7f8083302a08117f9ef2","observation_id":"d3ba8604-b7d1-4323-a6f2-f7354be0db22","resolution":{"observed_at":"2026-08-01T10:10:37.558597Z","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-08-01T10:10:37.614912Z","title":"On power-law relationships of the internet topology.ACM SIGCOMM Computer Communication Review, 29(4):251–262, 1999","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:37.614912Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:e602d6c1aacc5a4e1e735b4b8624d8bd3288a3cca918fc5f47f355b16870ae29","observation_id":"1af14286-aebc-4b3e-b307-097474b63c21","resolution":{"observed_at":"2026-08-01T10:10:37.614912Z","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-08-01T10:10:37.709014Z","title":"Halldórsson, Fabian Kuhn, and Alexandre Nolin","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:37.709014Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:9a928b01ebd29b9cc242c41a161cea4dcf1ecf95ea5693721bbc1817f186f564","observation_id":"2eea7291-29f9-4a13-bc29-baf7c65e0cc8","resolution":{"observed_at":"2026-08-01T10:10:37.709014Z","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-08-01T10:10:37.780830Z","title":"Halldórsson, Manuel Jakob, and Yannic Maus","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:37.780830Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:9d38e18fbc80bfe8dd7ba977ed317963d7a182c153d1b1f0620315bc9a577fd7","observation_id":"b94ab36d-7dc5-46bc-a2c2-1a1154cf5d07","resolution":{"observed_at":"2026-08-01T10:10:37.780830Z","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-08-01T10:10:37.847008Z","title":"Near-optimal deterministic network decomposition and ruling set, and improved MIS","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:37.847008Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:821447103ce261d95ecd0c9ee5bd0a60d267b28edc5407730547ce887d7076c0","observation_id":"7ef17f0c-1a97-465e-bb63-74dc7f4a44e2","resolution":{"observed_at":"2026-08-01T10:10:37.847008Z","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-08-01T10:10:37.920434Z","title":"Deterministic distributed vertex coloring: Simpler, faster, and without network decomposition","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:37.920434Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:4ac8999623ee812227e1f7aa546b88bd949e25b872b00b56c43986d3b42f711a","observation_id":"7d40d041-7a06-4034-af75-c9c0630f33d3","resolution":{"observed_at":"2026-08-01T10:10:37.920434Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.15347","last_updated":"2025-02-21T10:01:36Z","snapshot_observed_at":"2026-08-07T17:59:11.641644Z","submitted_at":"2025-02-21T10:01:36Z","title":"From descriptive to distributed","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.15347","snapshot_observed_at":"2026-08-01T10:10:37.972964Z","title":"From descriptive to distributed","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:37.972964Z"},"links":{"cited_paper":"/paper/2502.15347","citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:489d3870121ad7cc90525018f88da57447234eae42ba8837e955c271a9bd2c93","observation_id":"d040aef2-d993-43a9-8d05-c2ab0fb97a7f","resolution":{"observed_at":"2026-08-01T10:10:37.972964Z","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-08-01T10:10:38.044402Z","title":"Random hyperbolic graphs: Degree sequence and clustering","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:38.044402Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:8fdd6a3ea939ac0169ba7214c8d370c9c6ad27860669e5d7f06c238c2396d037","observation_id":"584c93ca-1cdf-4910-b17d-d590d1bbcbd0","resolution":{"observed_at":"2026-08-01T10:10:38.044402Z","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-08-01T10:10:38.201872Z","title":"Halldórsson and Christian Konrad","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:38.201872Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:af4f8ee4e3a21df53f46e681d2dc9339eead2779da08d94e1ee7c07ee3579090","observation_id":"de891417-65cc-4652-a626-fea09e44ef30","resolution":{"observed_at":"2026-08-01T10:10:38.201872Z","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-08-01T10:10:38.272367Z","title":"Halldórsson and Yannic Maus","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:38.272367Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:000da9c0dbc6dcef0bfdb4715d4b2efd7da35c99dd7b503b3fbce4b44d6642f6","observation_id":"9acec360-5d5b-4fc0-a4ce-9d7e92f096c9","resolution":{"observed_at":"2026-08-01T10:10:38.272367Z","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-08-01T10:10:38.350967Z","title":"Oltvai, and Albert-László Barabási","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:38.350967Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:f6e3e90320764ee5e12582c56f719142887cd3e06abc7fd1757f3f9447b13e06","observation_id":"43e1f373-1ec2-4f74-8a1b-29b636795292","resolution":{"observed_at":"2026-08-01T10:10:38.350967Z","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-08-01T10:10:38.463496Z","title":"Simple distributed∆ + 1-coloring of graphs.Information Processing Letters, 70(5):229–232, 1999","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:38.463496Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:f3f902aa6aaeb4dfb626d5715da59ad4b56565cc60eaa12115c17e49cdf120f3","observation_id":"677907d1-640a-4930-b3b2-d0ef9a0e79d7","resolution":{"observed_at":"2026-08-01T10:10:38.463496Z","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-08-01T10:10:38.520119Z","title":null,"venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:38.520119Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:2db1f1bee441541a90310e64efbd752b6fcbb7fb264ef2be8ea97446228ef50c","observation_id":"be8a4a2c-4219-44ef-9ca6-ad012a71fbcc","resolution":{"observed_at":"2026-08-01T10:10:38.520119Z","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-08-01T10:10:38.633881Z","title":null,"venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:38.633881Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:9f5a002318ec688dcfab52af1e623cd197d805c7416e67ae14fab89f99845638","observation_id":"b4d61253-93e5-4940-a7ac-5e722193810f","resolution":{"observed_at":"2026-08-01T10:10:38.633881Z","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-08-01T10:10:38.723187Z","title":"On the second largest component of random hyperbolic graphs.SIAM Journal on Discrete Mathematics, 33(4):2200–2217, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:38.723187Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:d0e413ed4c61f7bef88eb21f87f7ddc591a7018fa385be50dbe64775714f4ddf","observation_id":"10ba8b71-800a-407d-8984-0d8eccc3ebd0","resolution":{"observed_at":"2026-08-01T10:10:38.723187Z","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-08-01T10:10:38.799382Z","title":"Distributed minimum vertex coloring and maximum independent set in chordal graphs.Theoretical Computer Science, 922:486–502, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:38.799382Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:2e75351030cf0a66e943931cdbe5ba600f6741ffdffcdcc291bca8df28661416","observation_id":"a7f24084-c360-4a53-b53c-f6fab5077e9e","resolution":{"observed_at":"2026-08-01T10:10:38.799382Z","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-08-01T10:10:38.860921Z","title":"Hyperbolic geometry of complex networks.Physical Review E, 82(3):036106, 2010","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:38.860921Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:556a60592d3f68963bd24c5c9df3e7569a476d556f459fc10b6ad84b2f38c851","observation_id":"054c671d-bdd7-42e7-9e13-de8a775c2160","resolution":{"observed_at":"2026-08-01T10:10:38.860921Z","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-08-01T10:10:38.946157Z","title":"Low-diameter graph decompositions.Combinatorica, 13(4):441– 454, 1993","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:38.946157Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:b6ec217dc32dfcdadb3cdd02611d546aa38cb384919ca4fb8df4864e1dadc026","observation_id":"5ab95794-c70d-4ca5-90c9-a6679467697e","resolution":{"observed_at":"2026-08-01T10:10:38.946157Z","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-08-01T10:10:39.019575Z","title":"On distributed colouring of hyperbolic random graphs","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:39.019575Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:b6054642f49d42c14af6c0db937f29e31076f1bac61cba3c50b70e1ab9ff4539","observation_id":"f5e63e3c-c79f-4066-8eb1-83d16a47c353","resolution":{"observed_at":"2026-08-01T10:10:39.019575Z","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-08-01T10:10:39.080882Z","title":"Concentration for self-bounding functions and an inequality of talagrand.Random Structures & Algorithms, 29(4):549–557, 2006","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:39.080882Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:6709e05e9e21b9d611d9ec391e679eea5e07fcd79373316ccc678bf9fbffe750","observation_id":"5d6b9e0e-b31c-4775-8b91-3b941d347c94","resolution":{"observed_at":"2026-08-01T10:10:39.080882Z","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-08-01T10:10:39.177846Z","title":"Cambridge University Press, 2005","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:39.177846Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:af3cf00db2dec2911489ecd038f8751dc2be3c2c27328ac311e192599331a833","observation_id":"e652eb80-3256-4202-a399-88c34d604f47","resolution":{"observed_at":"2026-08-01T10:10:39.177846Z","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-08-01T10:10:39.262369Z","title":"Colouring graphs when the number of colours is almost the maximum degree.Journal of Combinatorial Theory, Series B, 109:134–195, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:39.262369Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:ca55ed26d33a2562b0a62741b2749ef5cd93f17e02f17eb7c8aa41845a334fda","observation_id":"f12d4afb-d736-403c-b6d1-1f6bda58b7c0","resolution":{"observed_at":"2026-08-01T10:10:39.262369Z","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-08-01T10:10:39.311994Z","title":"The diameter of KPKVB random graphs.Advances in Applied Probability, 51(2):358–377, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:39.311994Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:e50db1b8cffa65bcc9b4bb3a55eece1d733a20d2f69144a6871f86de3c372a81","observation_id":"d6b05a0b-3244-4962-81e3-d8ddc02ac2fb","resolution":{"observed_at":"2026-08-01T10:10:39.311994Z","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-08-01T10:10:39.391769Z","title":"Ángeles Serrano, Marián Boguná, and Dmitri Krioukov","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:39.391769Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:655aa474f76e5259a6d292ef27cc201cae491837c0a3816b444a07749d420fde","observation_id":"a2e6ee68-ffcc-4136-9cb3-3522a122e869","resolution":{"observed_at":"2026-08-01T10:10:39.391769Z","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-08-01T10:10:39.451877Z","title":"Greedy forwarding in dynamic scale-free networks embedded in hyperbolic metric spaces","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:39.451877Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:677ac2f9f7844aaae6049971e71f4192ae03e22ca5919f999666a92c3ae03fc1","observation_id":"89efef97-4316-4dc7-b2a7-bceef8fe7f90","resolution":{"observed_at":"2026-08-01T10:10:39.451877Z","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-08-01T10:10:39.526129Z","title":"Network mapping by replaying hyperbolic growth.IEEE/ACM Transactions on Networking, 23(1):198–211, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:39.526129Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:1af532dc3e4ec87eb2ec087241dd3e0e433d1b756c9fe410f84835ccbc83121f","observation_id":"0e273a13-b695-484f-b21b-4c0c0991789c","resolution":{"observed_at":"2026-08-01T10:10:39.526129Z","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-08-01T10:10:39.582338Z","title":"Ángeles Serrano, Dmitri Krioukov, and Marián Boguná","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-01T10:10:39.582338Z"},"links":{"citing_paper":"/paper/2607.20360"},"observation_digest":"sha256:fcaddabd4b6ec93fc30e6ab3cb2330bf64c719e57638d4b11562399d9e8f74b3","observation_id":"7b87d919-06dd-4f46-883a-ac89e1ec9176","resolution":{"observed_at":"2026-08-01T10:10:39.582338Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.20360","last_updated":"2026-07-22T16:50:51Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-10T08:00:18.879341Z","submitted_at":"2026-07-22T16:50:51Z","title":"Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs"},"reference_resolution":{"displayed":54,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":54,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":54},"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 54 of 54 outbound references and 0 inbound Pith citation observations for arXiv:2607.20360."}