{"as_of":"2026-08-23T22:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7167c4d2a4a7aa4b299dfdc8e652eb55456af22d067b9b5fe8d34e64e5cd6b23","coverage":[{"denominator":53,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":53,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T08:48:26.686096Z","state":"measured"},{"denominator":53,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":53,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+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/2601.15944/citation-record","integrity":"/paper/2601.15944/integrity","json":"/paper/2601.15944/citation-record.json","paper":"/paper/2601.15944"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:48:20.164874Z","title":"Barab´ asi,Network Science, Cambridge University Press, Cambridge, (2016)","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:20.164874Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:1e173fae2e96fdcc2795ca7d0afd6da8d6126d7b242d5b45822850e60d85809a","observation_id":"9adbee6c-e884-4378-80e8-281c8105b2a7","resolution":{"observed_at":"2026-08-03T08:48:20.164874Z","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-03T08:48:20.314881Z","title":"Newman, Networks: An Introduction , Oxford Univer- sity Press, Oxford, (2018)","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:20.314881Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:ca7f52acc1f55453c10cc29c8fc924910b2615734cf4f53093e7774361484e53","observation_id":"77a74276-5427-4dda-acb0-3a6bc45a3459","resolution":{"observed_at":"2026-08-03T08:48:20.314881Z","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-03T08:48:20.477378Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:20.477378Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:5092b6a636301a480de3f12a28f20a4675de08c5a723b4a8e7f137934af6866e","observation_id":"585627ee-a5e7-4179-90dd-83ca17a3007c","resolution":{"observed_at":"2026-08-03T08:48:20.477378Z","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-03T08:48:20.594971Z","title":"Dean and S","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:20.594971Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:41ca742dfc252b7e1ebef9779c61b6ff21b7249f1202b43283968abb0dbab236","observation_id":"bdc8afb9-6a65-46d4-9c36-47b0dc6e0e39","resolution":{"observed_at":"2026-08-03T08:48:20.594971Z","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-03T08:48:20.774746Z","title":"Manyika et al., Big Data: The Next Frontier for Inno- vation, Competition, and Productivity, McKinsey Global Institute Report (2011)","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:20.774746Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:637d0f7ac4c0dc60deab9a0736baa0401ef4b9343d271b21aac393645ee56d5a","observation_id":"bc2e2cb1-cb61-4175-a3e0-e237eee6b1d7","resolution":{"observed_at":"2026-08-03T08:48:20.774746Z","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-03T08:48:20.938150Z","title":"Gandomi and M","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:20.938150Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:84a8f28561dbe720307dd10379ece90f94a7536917179c5d3d0ded1576b49f57","observation_id":"b637fbfa-07a6-4606-837e-fd12f9fc2a17","resolution":{"observed_at":"2026-08-03T08:48:20.938150Z","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-03T08:48:21.084782Z","title":"Dorogovtsev, A.V","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:21.084782Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:4a3ddff003535d81f92feafde64be1942606c6c04688e71bb767792bde2dd441","observation_id":"1f274985-bfe7-48cd-b53c-0da510011224","resolution":{"observed_at":"2026-08-03T08:48:21.084782Z","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-03T08:48:21.197306Z","title":"Kelling et al., Data-Intensive Science: A New Paradigm for Biodiversity Studies, BioScience, 59, 7, 613 (2009)","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:21.197306Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:d5f4743468aa454271f02a5aa458519ae26d7b6a9189036b62ab7584623dd76a","observation_id":"ff1f7964-355e-45a6-8da0-983e17e60c15","resolution":{"observed_at":"2026-08-03T08:48:21.197306Z","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-03T08:48:21.291974Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:21.291974Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:3346c3c64d889a63854ed053c40d2df942fe05ebc86dd70ca4355fadd06856cd","observation_id":"1fa0d3c0-09af-491b-9f14-3cb0d3e96e1c","resolution":{"observed_at":"2026-08-03T08:48:21.291974Z","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-03T08:48:21.383833Z","title":"Marx, Biology: The Big Challenges of Big Data, Na- ture, 498, 255 (2013)","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:21.383833Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:ef44d98c79ef16aeb5a69de80e5850dc92b864d982341ecf1179c76c3e839b65","observation_id":"153d2970-a19e-42dd-b80a-78c3a7fd623f","resolution":{"observed_at":"2026-08-03T08:48:21.383833Z","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-03T08:48:21.509568Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:21.509568Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:dda2ba3569a1a5fbfa5f86f94526a95727d617834146aada595a4f9aa7beb909","observation_id":"071057b4-de89-486a-85f5-7cd09a56a4db","resolution":{"observed_at":"2026-08-03T08:48:21.509568Z","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-03T08:48:21.608319Z","title":"Ravasz and A.-L","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:21.608319Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:f8d25e014459e6952db670d607211d58d1d95cb9a9ca9325778d6f9cfd192743","observation_id":"9325d85d-c3c4-46cb-9ad8-08eb2d5fd3fa","resolution":{"observed_at":"2026-08-03T08:48:21.608319Z","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-03T08:48:21.717920Z","title":"Fortunato, Community detection in graphs, Phys","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:21.717920Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:ce52ec432352753d8881f81bbed220ea30e2f484007cd0f9af93b074d1e78cbd","observation_id":"27f112db-138f-4210-bf8e-b55cb086dcc6","resolution":{"observed_at":"2026-08-03T08:48:21.717920Z","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-03T08:48:21.785791Z","title":"Fortunato, Community detection in networks: A user guide, Phys","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:21.785791Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:0eb08da6fdcbcc80749d599d3126a233161172f75b0a9c32aee345d3e8f31961","observation_id":"a62d74a2-4fbc-431a-a594-fb5c59841305","resolution":{"observed_at":"2026-08-03T08:48:21.785791Z","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-03T08:48:21.977919Z","title":"local matrices","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:21.977919Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:d1709a9e244ec4be5fd90bd5d27143b4f235bb45de68bfd238dea9f80111f8ff","observation_id":"4f80baa0-6756-4a24-947b-f6aae002db67","resolution":{"observed_at":"2026-08-03T08:48:21.977919Z","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-03T08:48:22.125535Z","title":"edges.txt","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:22.125535Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:d7ebee511fa7839f1476bec137ecb52d917f0b6570e5768f1969c97808633718","observation_id":"500c814f-3e79-40e7-9e03-487b34b64b67","resolution":{"observed_at":"2026-08-03T08:48:22.125535Z","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-03T08:48:22.245505Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:22.245505Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:059cde4357c95d1803463b538f8469ca601cbe1fd1594ae0556722089fafc34c","observation_id":"8867ee99-dde3-4574-9171-b1fdd6d9f646","resolution":{"observed_at":"2026-08-03T08:48:22.245505Z","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-03T08:48:22.322173Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:22.322173Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:10be6b3e9e25397e5a5b732ebaeab8eaeae0431ac7d862dffcfd08a5671f8825","observation_id":"078ac621-83d3-4069-a7ae-94e2cdad9141","resolution":{"observed_at":"2026-08-03T08:48:22.322173Z","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-03T08:48:22.396631Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:22.396631Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:0fe83dc3fe90bebd28e8da1d84b14c51252a3a165acb9bd0b8a9d533b41dbbd8","observation_id":"f626c4b8-9f38-431a-a42f-1b8198d26f62","resolution":{"observed_at":"2026-08-03T08:48:22.396631Z","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-03T08:48:22.497604Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:22.497604Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:7418e1dfbeef8e57fe907bad7513c9592d802c7af8ec4b218be3e220bf5b4bdf","observation_id":"200e9552-75b6-4e00-a042-192f0ca7fe54","resolution":{"observed_at":"2026-08-03T08:48:22.497604Z","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-03T08:48:22.607389Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:22.607389Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:eaf96ef8280e42d9254b773f9c3ce066c710d399815e9a7a9ea1968a8eb085de","observation_id":"c1a43a5d-423b-4d01-8ddf-53730a016f81","resolution":{"observed_at":"2026-08-03T08:48:22.607389Z","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-03T08:48:22.675045Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:22.675045Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:35264d3df28a9805600aa119f8216a78d221c02cd2db3dca4850f59f6da13c26","observation_id":"3a28f65e-b8de-43b7-ab54-651e47093b75","resolution":{"observed_at":"2026-08-03T08:48:22.675045Z","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-03T08:48:22.764904Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:22.764904Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:582273c40908387b5133fe5bf20080583f51793a1724b0c2955439f99088a1be","observation_id":"52cc92a3-99e2-41db-82e5-b522fe3b9171","resolution":{"observed_at":"2026-08-03T08:48:22.764904Z","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-03T08:48:22.873600Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:22.873600Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:a83b0afe8b7ae708ecb987b9f3eda562b044ff1c78f330a2b548d621ea32018f","observation_id":"83d16178-2dde-492b-9108-1e600ac54dc2","resolution":{"observed_at":"2026-08-03T08:48:22.873600Z","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-03T08:48:22.945066Z","title":"non stationarity","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:22.945066Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:d139a95978d0ced139e58751f1b0a8b671db844e45d7f4b4b95bb88cb02d27f9","observation_id":"c270f871-e6ba-49aa-ba8e-fd648ff0fa39","resolution":{"observed_at":"2026-08-03T08:48:22.945066Z","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-03T08:48:23.021152Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:23.021152Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:8b8705e22618aee5b189b8b19d2b5bd5575d6775be76677ffb88d0fa82214e28","observation_id":"1c97dd7e-d26f-4144-8b5d-c53e332c5cbb","resolution":{"observed_at":"2026-08-03T08:48:23.021152Z","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-03T08:48:23.111144Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:23.111144Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:7cff587b00d91bd164ce9b594cfeb3f7ee41a1af5d5ff0e0ee2e2663f939993d","observation_id":"a463cf41-6286-42ba-ba43-d23743db2409","resolution":{"observed_at":"2026-08-03T08:48:23.111144Z","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-03T08:48:23.221963Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:23.221963Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:359ba41a9b1e35b1d3678a0b0316e3cb14f78cb588182d475de53a85278c64cd","observation_id":"52dafbd8-3789-4d83-8ea8-feddea3556f1","resolution":{"observed_at":"2026-08-03T08:48:23.221963Z","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-03T08:48:23.296747Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:23.296747Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:001bc869e4950d39483cbc9cb53cadb1f38974f017dd4167d4f294113f2b0f41","observation_id":"3e158a71-e045-45d2-bda4-4df38654605b","resolution":{"observed_at":"2026-08-03T08:48:23.296747Z","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-03T08:48:23.379201Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:23.379201Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:1921faae906ab099578584a6c1e5ad9b347f21adb171c1ef6395e8d39c4f3986","observation_id":"bd89f6a8-9c43-48ea-ad20-7941d37a8a1d","resolution":{"observed_at":"2026-08-03T08:48:23.379201Z","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-03T08:48:23.444844Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:23.444844Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:7cc307f57d116e67ba66eb7cc8358ecd6830a2b819f1cf9930887d6546126566","observation_id":"6359a90a-bbc2-449c-9a9b-4d4c77f6cdec","resolution":{"observed_at":"2026-08-03T08:48:23.444844Z","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-03T08:48:23.567712Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:23.567712Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:6756f6e030289607e1919ed0a70380cb97028870db3f9c219e122ca9cd5e4d7f","observation_id":"b0f4d83b-eb07-4ae3-8852-896ecbdb4378","resolution":{"observed_at":"2026-08-03T08:48:23.567712Z","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-03T08:48:23.723484Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:23.723484Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:dc37c361ddbc7d8fcf9282723d92cfe5f463d655528d72419473fe052a3d6bf6","observation_id":"1a305bdc-abe8-4327-8915-3ea2fd6a09ce","resolution":{"observed_at":"2026-08-03T08:48:23.723484Z","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-03T08:48:23.897614Z","title":"Fiore, G","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:23.897614Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:200a3fb3cacafd5f23b9b97234cb565d2775e34403e589fd0e8f98f782b8e33a","observation_id":"94e69253-9980-40e6-b7af-de8f3a0e7b7c","resolution":{"observed_at":"2026-08-03T08:48:23.897614Z","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-03T08:48:24.054561Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:24.054561Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:89ddcaa577e33c01b2af4ef39c050aa6835cdc554b21909959353be7759043b9","observation_id":"a44afd8b-a2d0-459d-884f-695d9093cca0","resolution":{"observed_at":"2026-08-03T08:48:24.054561Z","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-03T08:48:24.243765Z","title":"Della Rossa, L","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:24.243765Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:873f5de798e68890ead80aac6ccff9ee3cb2b5e0e81da06afe6398a7af902fea","observation_id":"90d80da2-2914-4012-9dfb-2dcb46cd0068","resolution":{"observed_at":"2026-08-03T08:48:24.243765Z","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-03T08:48:24.471355Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:24.471355Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:26f0fc7e2d959a8507e74ea65bf99ef2b4afd425a1bb767ccbdea8b6295d63f7","observation_id":"7f434e79-c5d5-4127-9671-c4cfd8abbb45","resolution":{"observed_at":"2026-08-03T08:48:24.471355Z","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-03T08:48:24.574644Z","title":"Ostilli, Topologically protected synchronization in net- works, Phys","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:24.574644Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:50f1a8b43ad2ec9e2934d2d33721825f4f83934dbc83703b5e4f478fb3b136cb","observation_id":"6f6446a0-2ed8-4c5a-8559-40ec9aa8560e","resolution":{"observed_at":"2026-08-03T08:48:24.574644Z","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-03T08:48:24.683341Z","title":"Bayani, F","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:24.683341Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:da78da4e2e9bd29aa2f762fc23fcee70412ccdef5e190c56cb0f1ca1d1dee195","observation_id":"0f1b7712-0858-405e-a6f4-ac6ba35ff6cf","resolution":{"observed_at":"2026-08-03T08:48:24.683341Z","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-03T08:48:24.756612Z","title":null,"venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:24.756612Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:0b78013a2453188519461ce98cf8a00a4cc5654b066678ea178a2eba2b2d1eff","observation_id":"f5201cc9-a0c8-48fd-addc-b78ffa3ff90c","resolution":{"observed_at":"2026-08-03T08:48:24.756612Z","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-03T08:48:24.898894Z","title":"S., Freeman, W","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:24.898894Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:003da35257246e05865ff95ede8ed6a73f36474567e127237fd1de31b66c5318","observation_id":"dedffce7-0229-4f1c-9247-5ed1ba8d5695","resolution":{"observed_at":"2026-08-03T08:48:24.898894Z","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-03T08:48:24.972662Z","title":"M´ ezard and G","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:24.972662Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:5b970427ca5b9836b3dc777a4b5034ea8a6aa9c9a7b5e4ea1e451255a37c0a27","observation_id":"b4c17452-4db8-4fb4-97ed-fb6b25447395","resolution":{"observed_at":"2026-08-03T08:48:24.972662Z","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-03T08:48:25.152807Z","title":"M´ ezard and A","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:25.152807Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:4e8400854ade68e355190db9e6ef5dac904075b8b3c07441c3a2c638d97d0c1b","observation_id":"01632166-68be-4617-bb85-acea7199137f","resolution":{"observed_at":"2026-08-03T08:48:25.152807Z","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-03T08:48:25.325220Z","title":"S.Skardal and A","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:25.325220Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:4c2d887be381005dc1c85ace6ac5ba2308cfcb6173aec44e4879be7737779e32","observation_id":"0dee2ff0-eb91-4548-8e36-391e7565f5f4","resolution":{"observed_at":"2026-08-03T08:48:25.325220Z","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-03T08:48:25.513731Z","title":null,"venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:25.513731Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:8e3c23bb9999e29d7058d74792904d2a44a887fce06defd5f89fb6103f3fef04","observation_id":"70939d8f-8e88-48a0-b3ad-b8ea07ada180","resolution":{"observed_at":"2026-08-03T08:48:25.513731Z","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-03T08:48:25.640015Z","title":"Pikovsky, M","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:25.640015Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:20a75b78f09148bfc12d1615472ba92bb6c719720a00bca0c9997f9d29729725","observation_id":"86defc14-3676-4880-8d96-de012b8d91ca","resolution":{"observed_at":"2026-08-03T08:48:25.640015Z","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-03T08:48:25.776845Z","title":"Arenas, A","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:25.776845Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:f2cf3c916a727754da336cad914690b22e347af5d607b0c28cea417a993635b5","observation_id":"4dccb287-54c4-4a29-b2e4-0230e5b27cf6","resolution":{"observed_at":"2026-08-03T08:48:25.776845Z","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-03T08:48:25.916468Z","title":"Krzakala, F","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:25.916468Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:80f86f0b8e4f7804c54a7644f4eaa71785010f335e7b1536f3e1fd458e0199c1","observation_id":"8c2b68fa-cc12-4f2a-84e8-b656a79ae108","resolution":{"observed_at":"2026-08-03T08:48:25.916468Z","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-03T08:48:26.050698Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:26.050698Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:7b82ed58b65197d177cb3d10b2d07cc61816a293cdf8a1a1a8d640362597e734","observation_id":"669c66cb-b4dd-4b02-a96a-4fbe94d4a594","resolution":{"observed_at":"2026-08-03T08:48:26.050698Z","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-03T08:48:26.224519Z","title":"Peixoto, Network Reconstruction and Community De- tection from Dynamics , Phys","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:26.224519Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:89f6af68fdf855ad0d1abe39eee93138c8f5a1e934d5b9f830c920dba8a052f3","observation_id":"62267f79-6845-4cfe-b8d9-4bcabd82ee32","resolution":{"observed_at":"2026-08-03T08:48:26.224519Z","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-03T08:48:26.361703Z","title":"J Duncan and S","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:26.361703Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:4182cad57bd415fe5ef7f2062493f66845998e29275df99ec58c6fd16bc73907","observation_id":"b2135c80-86ac-48d5-b2e3-6b7f1a1f275e","resolution":{"observed_at":"2026-08-03T08:48:26.361703Z","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-03T08:48:26.549695Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:26.549695Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:99749570e93060c92d2982a5aa7f8ec96805b0e579985875f37c2e2f18ae9e45","observation_id":"037dad77-b046-4b9d-9d21-7bea7eb8e3fc","resolution":{"observed_at":"2026-08-03T08:48:26.549695Z","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-03T08:48:26.686096Z","title":null,"venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-03T08:48:26.686096Z"},"links":{"citing_paper":"/paper/2601.15944"},"observation_digest":"sha256:974a11c0559daa7687bacd3113a430a0cb3e7e8c97e4e3d85c1bead3a508e72f","observation_id":"2c047f89-44ce-4e53-a805-4e91833537b4","resolution":{"observed_at":"2026-08-03T08:48:26.686096Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2601.15944","last_updated":"2026-01-22T13:26:31Z","latest_version":1,"primary_category":"physics.soc-ph","snapshot_observed_at":"2026-08-16T05:23:54.794739Z","submitted_at":"2026-01-22T13:26:31Z","title":"Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach"},"reference_resolution":{"displayed":53,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":53,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":53},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 53 of 53 outbound references and 0 inbound Pith citation observations for arXiv:2601.15944."}