{"as_of":"2026-08-16T00:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b99f5056ca42eff2c1f06d401759a86be4cd33c06839f5ca146e72b1c5526121","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-15T06:32:42.880941+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-15T22:39:42.540144Z","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:39202f5083f1ee9f1065c3739e26063858be4f0ba253bde59ce6b43448d1f3e1","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-15T22:39:42.540144Z","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:d140088ffaf635291c6a327369a02b3edb694b3c3b73ad627ebe2758be88f0b3","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-15T22:39:42.540144Z","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:83de74a26c6f7116b59cfa2537ce6a682af466b1d7279e6a50414fafaf088dd5","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-15T22:39:42.540144Z","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:eb8f59aeac5e18e71a886c72602d64cad2d35fce2cf1b7b7907fcc1520b57832","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-15T22:39:42.540144Z","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:b6a2d7059a4d52993088caa3ad654e2717375a26c5a7d6602cc88b154a540a67","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-15T22:39:42.540144Z","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:0e34c9bf092b1e993a6fd8214720e3b3e8ee4b77edf6c2c83e57b518fe0d9917","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-15T22:39:42.540144Z","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:d6e76f2d719000dc660978ab44b732eb4468327075264e868ee4bdce8180d5c6","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-15T22:39:42.540144Z","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:e12766095247b26ca1e0fec591f83b52cd9c7dd3d911058aa80104cf7b2d44e8","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-15T22:39:42.540144Z","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:aa0faebc1cf2378c13799b865a98eaee0ef1bd3db4c8df85cb75a4bfa3e78c63","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-15T22:39:42.540144Z","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:f1811dceeda2b6e6830634736072562f36c26ccce2b6da4c91c33354c5c486ed","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-15T22:39:42.540144Z","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:ff0c0bab3239cf1410862dc388f1dc777d82d37b0fa426ae4483a8bc67d43e4c","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-15T22:39:42.540144Z","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:b528d9b0e6e675e1d7d93490b8ccc9fbeb400b716844fc0e515ce912bb975313","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-15T22:39:42.540144Z","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:82c56b43d14be585d229086edd2d1819916f266d8772f7c00089b14d3adf8a61","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-15T22:39:42.540144Z","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:d146adef936be85b7aa289d3e2a27586b10e135df817c1a72104f1e5f9ebaecc","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-15T22:39:42.540144Z","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:d774edbade925a31a68a6eb61df05e865b241004a482067358f37aa03d829f0b","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-15T22:39:42.540144Z","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:8c857db87fb846f28c27c41ea6c16c8743f91851f344c60b9eeca7d9178bbabc","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-15T22:39:42.540144Z","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:a5090ae15f531f5214bb23f38eaeb3dabc55f6d6825e5d0e0389b7d1d96242d0","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-15T22:39:42.540144Z","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:f1f1bd088391acc71ef932c311f42c6f738a472ce31609d1860fdbc1fea7e8b6","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-15T22:39:42.540144Z","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:2af457f9eecba99b6ce2538ae453186aae40c6699cd134f5d16b334437dd14cd","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-15T22:39:42.540144Z","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:58ef86222421e8d38cefaf01f109b35f7fe6133a0e472c06be82941c56b6f2b4","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-15T22:39:42.540144Z","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:1e12a85df9e1a7d914671b85e1f95bdc0d5da776adaab26462d5c92491d58b99","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-15T22:39:42.540144Z","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:edb5cfb8c7c460635b5d7d87509b5cb571dad32a7f929b985450a541f0ff41e2","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-15T22:39:42.540144Z","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:e3aeaf3cba1d7c66fcfb5de76c0a0f13100d3f1ffb15b834e8e248a757e6ffc3","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-15T22:39:42.540144Z","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:e6d7e6114728c6865e9e917938ca0c731c6119ee37f2240c3d3e27fa8779f57b","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-15T22:39:42.540144Z","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:e8f40cca0076f1480f1129dc7ec8d363765b967f578af625d80c5d73f0032965","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-15T22:39:42.540144Z","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:175708ec4edee26e0e6eaa3b4f042c6d3f0a6e32d543a08137038d15461179ef","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-15T22:39:42.540144Z","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:dd4a7221f1d14b92361ef4451c4a92b255ec28584ae326c761b2317f10631497","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-15T22:39:42.540144Z","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:70bad1499981f471b7170e6cf0a05394eee5b474dd5ca281517b3b7a0d996b2d","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-15T22:39:42.540144Z","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:f1b2df25fa1592787e1313482b0ca67c70af1a1629d9c430804aa24bd193cad8","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-15T22:39:42.540144Z","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:310e788563e31255b89277dc78461f74d76c5988a896df6a16af9c1270b39c35","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-15T22:39:42.540144Z","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:082485374e507b08ae2b95bbcec5898bc6b842be827426afbd2a8ea72aa5f025","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-15T22:39:42.540144Z","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:2cbbc4a6282fbffaac5d94343691516fda1b4ec823f180bf21552ecd73073623","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-15T22:39:42.540144Z","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:c8b0e51836181de9655aaa6fe64f4c3968868391a42e7ad701d53d9c25e9bc5d","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-15T22:39:42.540144Z","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:da6c2cfe9fa5e4d7d543c39cd8b5d3b23ac4d1c639a64903d8cfde2780534480","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-15T22:39:42.540144Z","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:39341449e6593305a09c54439db1e7d7cfab7faee1c71acc7b6264a20e23b58d","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-15T22:39:42.540144Z","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:93d6b555cb3d3d125d33bc5a3805461b67574b27ffe0c6fa2d7a99fbb1c029a3","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-15T22:39:42.540144Z","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:6a7fff76232b1abfc43b6444695f4749414d801e14a3ef7a298a2e81d22e9673","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-15T22:39:42.540144Z","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:5241f87c86fa6ed7f7ef0e93975928d678ea4fb76632d21f4732f0cb24a5f116","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-15T22:39:42.540144Z","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:3049febb6c08f35363a1389f0cc57afdde15c8ee0b3a92b53f8265ef947a150e","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-15T22:39:42.540144Z","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:c2455632758900581bedf05d273973fa7f342448d88cbd6e71f68d5908e9dadc","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-15T22:39:42.540144Z","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:386337665871d8011657bd4fb3fbbe24142168c7a50a215ffbb006d09b9f071e","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-15T22:39:42.540144Z","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:fa0cca026ec5a258c4130d401e42a1254e1e4844f94661324af8330ab3229c03","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-15T22:39:42.540144Z","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:b76ca7cb1aefe684af327e60562e4a89e4c814b148a8307844119eaafe7966ba","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-15T22:39:42.540144Z","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:0e9acccad31b96e2b0b86f0510a5cd80583c9a61bda0376272ceba5a679c3b0a","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-15T22:39:42.540144Z","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:34ba45a47975e55f28c3776c9caf8376d9706e981719d709efcacfb4f7c0400c","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-15T22:39:42.540144Z","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:7af04bfa74e311b136b0d987fe9b8568b3b771b37dca6c0e16d271eb9273ad9f","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-15T22:39:42.540144Z","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:a6b5bfce36940105d2702fd45793465c603a2c2646fbde173ac8e211e0d7d7b3","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-15T22:39:42.540144Z","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:d1e993662aca5a28068eee3a808feddaaa36059accc51f38b13e3eed6b8a9833","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-15T22:39:42.540144Z","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:d669cb8287858d3d41507d0ac7b64b706d730122c46fb97e59d329ebbe78ce31","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-15T22:39:42.540144Z","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:1287e14ef402b97569706edc3bb9f56b8e805742bf6d3caef815994ac433225c","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-15T22:39:42.540144Z","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:b82ca9e1b18e8f2f2be7e55b184df347e1b82858a12e023f2642b3ea5c6b9eea","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-15T22:39:42.540144Z","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:d90ef9ea4acf951e8971d83c15013d94a530f3c13afeb3f1c753057e27a732d0","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-15T22:39:42.540144Z","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:8fc324c22c5cf13143c6000b5f95927fb87fe7b7f010201645fc778103caa3c3","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-15T22:39:42.540144Z","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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 53 of 53 outbound references and 0 inbound Pith citation observations for arXiv:2601.15944."}