Pith. sign in

Paper Citation Record · LEDGER

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2601.15944 v1

Coverage vector

measured 53 of 53 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-03T08:48:26.686096Z

measured 53 of 53 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-23T06:30:58.430688+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

53 of 53 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved53
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 9adbee6c-e884-4378-80e8-281c8105b2a7 · outbound

This paper cites Barab´ asi,Network Science, Cambridge University Press, Cambridge, (2016).

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach Barab´ asi,Network Science, Cambridge University Press, Cambridge, (2016)

Reference 1

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:20.164874Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:20.164874Z digest=sha256:1e173fae2e96fdcc2795ca7d0afd6da8d6126d7b242d5b45822850e60d85809a

Observation 77a74276-5427-4dda-acb0-3a6bc45a3459 · outbound

This paper cites Newman, Networks: An Introduction , Oxford Univer- sity Press, Oxford, (2018).

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach Newman, Networks: An Introduction , Oxford Univer- sity Press, Oxford, (2018)

Reference 2

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:20.314881Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:20.314881Z digest=sha256:ca7f52acc1f55453c10cc29c8fc924910b2615734cf4f53093e7774361484e53

Observation 585627ee-a5e7-4179-90dd-83ca17a3007c · outbound

This paper cites an unresolved cited work.

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach Unresolved cited work

Reference 3

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:20.477378Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:20.477378Z digest=sha256:5092b6a636301a480de3f12a28f20a4675de08c5a723b4a8e7f137934af6866e

Observation bdc8afb9-6a65-46d4-9c36-47b0dc6e0e39 · outbound

This paper cites Dean and S.

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach Dean and S

Reference 4

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:20.594971Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:20.594971Z digest=sha256:41ca742dfc252b7e1ebef9779c61b6ff21b7249f1202b43283968abb0dbab236

Observation bc2e2cb1-cb61-4175-a3e0-e237eee6b1d7 · outbound

This paper cites Manyika et al., Big Data: The Next Frontier for Inno- vation, Competition, and Productivity, McKinsey Global Institute Report (2011).

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach Manyika et al., Big Data: The Next Frontier for Inno- vation, Competition, and Productivity, McKinsey Global Institute Report (2011)

Reference 5

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:20.774746Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:20.774746Z digest=sha256:637d0f7ac4c0dc60deab9a0736baa0401ef4b9343d271b21aac393645ee56d5a

Observation b637fbfa-07a6-4606-837e-fd12f9fc2a17 · outbound

This paper cites Gandomi and M.

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach Gandomi and M

Reference 6

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:20.938150Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:20.938150Z digest=sha256:84a8f28561dbe720307dd10379ece90f94a7536917179c5d3d0ded1576b49f57

Observation 1f274985-bfe7-48cd-b53c-0da510011224 · outbound

This paper cites Dorogovtsev, A.V.

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach Dorogovtsev, A.V

Reference 7

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:21.084782Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:21.084782Z digest=sha256:4a3ddff003535d81f92feafde64be1942606c6c04688e71bb767792bde2dd441

Observation ff1f7964-355e-45a6-8da0-983e17e60c15 · outbound

This paper cites Kelling et al., Data-Intensive Science: A New Paradigm for Biodiversity Studies, BioScience, 59, 7, 613 (2009).

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach Kelling et al., Data-Intensive Science: A New Paradigm for Biodiversity Studies, BioScience, 59, 7, 613 (2009)

Reference 8

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:21.197306Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:21.197306Z digest=sha256:d5f4743468aa454271f02a5aa458519ae26d7b6a9189036b62ab7584623dd76a

Observation 1fa0d3c0-09af-491b-9f14-3cb0d3e96e1c · outbound

This paper cites an unresolved cited work.

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach Unresolved cited work

Reference 9

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:21.291974Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:21.291974Z digest=sha256:3346c3c64d889a63854ed053c40d2df942fe05ebc86dd70ca4355fadd06856cd

Observation 153d2970-a19e-42dd-b80a-78c3a7fd623f · outbound

This paper cites Marx, Biology: The Big Challenges of Big Data, Na- ture, 498, 255 (2013).

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach Marx, Biology: The Big Challenges of Big Data, Na- ture, 498, 255 (2013)

Reference 10

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:21.383833Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:21.383833Z digest=sha256:ef44d98c79ef16aeb5a69de80e5850dc92b864d982341ecf1179c76c3e839b65

Observation 071057b4-de89-486a-85f5-7cd09a56a4db · outbound

This paper cites an unresolved cited work.

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach Unresolved cited work

Reference 11

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:21.509568Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:21.509568Z digest=sha256:dda2ba3569a1a5fbfa5f86f94526a95727d617834146aada595a4f9aa7beb909

Observation 9325d85d-c3c4-46cb-9ad8-08eb2d5fd3fa · outbound

This paper cites Ravasz and A.-L.

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach Ravasz and A.-L

Reference 12

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:21.608319Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:21.608319Z digest=sha256:f8d25e014459e6952db670d607211d58d1d95cb9a9ca9325778d6f9cfd192743

Observation 27f112db-138f-4210-bf8e-b55cb086dcc6 · outbound

This paper cites Fortunato, Community detection in graphs, Phys.

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach Fortunato, Community detection in graphs, Phys

Reference 13

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:21.717920Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:21.717920Z digest=sha256:ce52ec432352753d8881f81bbed220ea30e2f484007cd0f9af93b074d1e78cbd

Observation a62d74a2-4fbc-431a-a594-fb5c59841305 · outbound

This paper cites Fortunato, Community detection in networks: A user guide, Phys.

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach Fortunato, Community detection in networks: A user guide, Phys

Reference 14

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:21.785791Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:21.785791Z digest=sha256:0eb08da6fdcbcc80749d599d3126a233161172f75b0a9c32aee345d3e8f31961

Observation 4f80baa0-6756-4a24-947b-f6aae002db67 · outbound

This paper cites local matrices.

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach local matrices

Reference 15

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:21.977919Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:21.977919Z digest=sha256:d1709a9e244ec4be5fd90bd5d27143b4f235bb45de68bfd238dea9f80111f8ff

Observation 500c814f-3e79-40e7-9e03-487b34b64b67 · outbound

This paper cites edges.txt.

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach edges.txt

Reference 16

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:22.125535Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:22.125535Z digest=sha256:d7ebee511fa7839f1476bec137ecb52d917f0b6570e5768f1969c97808633718

Observation 8867ee99-dde3-4574-9171-b1fdd6d9f646 · outbound

This paper cites an unresolved cited work.

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach Unresolved cited work

Reference 17

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:22.245505Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:22.245505Z digest=sha256:059cde4357c95d1803463b538f8469ca601cbe1fd1594ae0556722089fafc34c

Observation 078ac621-83d3-4069-a7ae-94e2cdad9141 · outbound

This paper cites an unresolved cited work.

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach Unresolved cited work

Reference 18

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:22.322173Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:22.322173Z digest=sha256:10be6b3e9e25397e5a5b732ebaeab8eaeae0431ac7d862dffcfd08a5671f8825

Observation f626c4b8-9f38-431a-a42f-1b8198d26f62 · outbound

This paper cites an unresolved cited work.

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach Unresolved cited work

Reference 19

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:22.396631Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:22.396631Z digest=sha256:0fe83dc3fe90bebd28e8da1d84b14c51252a3a165acb9bd0b8a9d533b41dbbd8

Observation 200e9552-75b6-4e00-a042-192f0ca7fe54 · outbound

This paper cites an unresolved cited work.

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach Unresolved cited work

Reference 20

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:22.497604Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:22.497604Z digest=sha256:7418e1dfbeef8e57fe907bad7513c9592d802c7af8ec4b218be3e220bf5b4bdf

Observation c1a43a5d-423b-4d01-8ddf-53730a016f81 · outbound

This paper cites an unresolved cited work.

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach Unresolved cited work

Reference 21

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:22.607389Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:22.607389Z digest=sha256:eaf96ef8280e42d9254b773f9c3ce066c710d399815e9a7a9ea1968a8eb085de

Observation 3a28f65e-b8de-43b7-ab54-651e47093b75 · outbound

This paper cites an unresolved cited work.

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach Unresolved cited work

Reference 22

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:22.675045Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:22.675045Z digest=sha256:35264d3df28a9805600aa119f8216a78d221c02cd2db3dca4850f59f6da13c26

Observation 52cc92a3-99e2-41db-82e5-b522fe3b9171 · outbound

This paper cites an unresolved cited work.

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach Unresolved cited work

Reference 23

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:22.764904Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:22.764904Z digest=sha256:582273c40908387b5133fe5bf20080583f51793a1724b0c2955439f99088a1be

Observation 83d16178-2dde-492b-9108-1e600ac54dc2 · outbound

This paper cites an unresolved cited work.

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach Unresolved cited work

Reference 24

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:22.873600Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:22.873600Z digest=sha256:a83b0afe8b7ae708ecb987b9f3eda562b044ff1c78f330a2b548d621ea32018f

Observation c270f871-e6ba-49aa-ba8e-fd648ff0fa39 · outbound

This paper cites non stationarity.

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach non stationarity

Reference 25

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:22.945066Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:22.945066Z digest=sha256:d139a95978d0ced139e58751f1b0a8b671db844e45d7f4b4b95bb88cb02d27f9

Observation 1c97dd7e-d26f-4144-8b5d-c53e332c5cbb · outbound

This paper cites an unresolved cited work.

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach Unresolved cited work

Reference 26

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:23.021152Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:23.021152Z digest=sha256:8b8705e22618aee5b189b8b19d2b5bd5575d6775be76677ffb88d0fa82214e28

Observation a463cf41-6286-42ba-ba43-d23743db2409 · outbound

This paper cites an unresolved cited work.

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach Unresolved cited work

Reference 27

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:23.111144Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:23.111144Z digest=sha256:7cff587b00d91bd164ce9b594cfeb3f7ee41a1af5d5ff0e0ee2e2663f939993d

Observation 52dafbd8-3789-4d83-8ea8-feddea3556f1 · outbound

This paper cites an unresolved cited work.

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach Unresolved cited work

Reference 28

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:23.221963Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:23.221963Z digest=sha256:359ba41a9b1e35b1d3678a0b0316e3cb14f78cb588182d475de53a85278c64cd

Observation 3e158a71-e045-45d2-bda4-4df38654605b · outbound

This paper cites an unresolved cited work.

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach Unresolved cited work

Reference 29

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:23.296747Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:23.296747Z digest=sha256:001bc869e4950d39483cbc9cb53cadb1f38974f017dd4167d4f294113f2b0f41

Observation bd89f6a8-9c43-48ea-ad20-7941d37a8a1d · outbound

This paper cites an unresolved cited work.

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach Unresolved cited work

Reference 30

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:23.379201Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:23.379201Z digest=sha256:1921faae906ab099578584a6c1e5ad9b347f21adb171c1ef6395e8d39c4f3986

Observation 6359a90a-bbc2-449c-9a9b-4d4c77f6cdec · outbound

This paper cites an unresolved cited work.

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach Unresolved cited work

Reference 31

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:23.444844Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:23.444844Z digest=sha256:7cc307f57d116e67ba66eb7cc8358ecd6830a2b819f1cf9930887d6546126566

Observation b0f4d83b-eb07-4ae3-8852-896ecbdb4378 · outbound

This paper cites an unresolved cited work.

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach Unresolved cited work

Reference 32

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:23.567712Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:23.567712Z digest=sha256:6756f6e030289607e1919ed0a70380cb97028870db3f9c219e122ca9cd5e4d7f

Observation 1a305bdc-abe8-4327-8915-3ea2fd6a09ce · outbound

This paper cites an unresolved cited work.

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach Unresolved cited work

Reference 33

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:23.723484Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:23.723484Z digest=sha256:dc37c361ddbc7d8fcf9282723d92cfe5f463d655528d72419473fe052a3d6bf6

Observation 94e69253-9980-40e6-b7af-de8f3a0e7b7c · outbound

This paper cites Fiore, G.

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach Fiore, G

Reference 34

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:23.897614Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:23.897614Z digest=sha256:200a3fb3cacafd5f23b9b97234cb565d2775e34403e589fd0e8f98f782b8e33a

Observation a44afd8b-a2d0-459d-884f-695d9093cca0 · outbound

This paper cites an unresolved cited work.

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach Unresolved cited work

Reference 35

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:24.054561Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:24.054561Z digest=sha256:89ddcaa577e33c01b2af4ef39c050aa6835cdc554b21909959353be7759043b9

Observation 90d80da2-2914-4012-9dfb-2dcb46cd0068 · outbound

This paper cites Della Rossa, L.

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach Della Rossa, L

Reference 36

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:24.243765Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:24.243765Z digest=sha256:873f5de798e68890ead80aac6ccff9ee3cb2b5e0e81da06afe6398a7af902fea

Observation 7f434e79-c5d5-4127-9671-c4cfd8abbb45 · outbound

This paper cites an unresolved cited work.

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach Unresolved cited work

Reference 37

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:24.471355Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:24.471355Z digest=sha256:26f0fc7e2d959a8507e74ea65bf99ef2b4afd425a1bb767ccbdea8b6295d63f7

Observation 6f6446a0-2ed8-4c5a-8559-40ec9aa8560e · outbound

This paper cites Ostilli, Topologically protected synchronization in net- works, Phys.

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach Ostilli, Topologically protected synchronization in net- works, Phys

Reference 38

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:24.574644Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:24.574644Z digest=sha256:50f1a8b43ad2ec9e2934d2d33721825f4f83934dbc83703b5e4f478fb3b136cb

Observation 0f1b7712-0858-405e-a6f4-ac6ba35ff6cf · outbound

This paper cites Bayani, F.

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach Bayani, F

Reference 39

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:24.683341Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:24.683341Z digest=sha256:da78da4e2e9bd29aa2f762fc23fcee70412ccdef5e190c56cb0f1ca1d1dee195

Observation f5201cc9-a0c8-48fd-addc-b78ffa3ff90c · outbound

This paper cites an unresolved cited work.

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach Unresolved cited work

Reference 40

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:24.756612Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:24.756612Z digest=sha256:0b78013a2453188519461ce98cf8a00a4cc5654b066678ea178a2eba2b2d1eff

Observation dedffce7-0229-4f1c-9247-5ed1ba8d5695 · outbound

This paper cites S., Freeman, W.

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach S., Freeman, W

Reference 41

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:24.898894Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:24.898894Z digest=sha256:003da35257246e05865ff95ede8ed6a73f36474567e127237fd1de31b66c5318

Observation b4c17452-4db8-4fb4-97ed-fb6b25447395 · outbound

This paper cites M´ ezard and G.

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach M´ ezard and G

Reference 42

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:24.972662Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:24.972662Z digest=sha256:5b970427ca5b9836b3dc777a4b5034ea8a6aa9c9a7b5e4ea1e451255a37c0a27

Observation 01632166-68be-4617-bb85-acea7199137f · outbound

This paper cites M´ ezard and A.

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach M´ ezard and A

Reference 43

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:25.152807Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:25.152807Z digest=sha256:4e8400854ade68e355190db9e6ef5dac904075b8b3c07441c3a2c638d97d0c1b

Observation 0dee2ff0-eb91-4548-8e36-391e7565f5f4 · outbound

This paper cites S.Skardal and A.

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach S.Skardal and A

Reference 44

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:25.325220Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:25.325220Z digest=sha256:4c2d887be381005dc1c85ace6ac5ba2308cfcb6173aec44e4879be7737779e32

Observation 70939d8f-8e88-48a0-b3ad-b8ea07ada180 · outbound

This paper cites an unresolved cited work.

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach Unresolved cited work

Reference 45

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:25.513731Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:25.513731Z digest=sha256:8e3c23bb9999e29d7058d74792904d2a44a887fce06defd5f89fb6103f3fef04

Observation 86defc14-3676-4880-8d96-de012b8d91ca · outbound

This paper cites Pikovsky, M.

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach Pikovsky, M

Reference 46

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:25.640015Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:25.640015Z digest=sha256:20a75b78f09148bfc12d1615472ba92bb6c719720a00bca0c9997f9d29729725

Observation 4dccb287-54c4-4a29-b2e4-0230e5b27cf6 · outbound

This paper cites Arenas, A.

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach Arenas, A

Reference 47

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:25.776845Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:25.776845Z digest=sha256:f2cf3c916a727754da336cad914690b22e347af5d607b0c28cea417a993635b5

Observation 8c2b68fa-cc12-4f2a-84e8-b656a79ae108 · outbound

This paper cites Krzakala, F.

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach Krzakala, F

Reference 48

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:25.916468Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:25.916468Z digest=sha256:80f86f0b8e4f7804c54a7644f4eaa71785010f335e7b1536f3e1fd458e0199c1

Observation 669c66cb-b4dd-4b02-a96a-4fbe94d4a594 · outbound

This paper cites an unresolved cited work.

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach Unresolved cited work

Reference 49

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:26.050698Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:26.050698Z digest=sha256:7b82ed58b65197d177cb3d10b2d07cc61816a293cdf8a1a1a8d640362597e734

Observation 62267f79-6845-4cfe-b8d9-4bcabd82ee32 · outbound

This paper cites Peixoto, Network Reconstruction and Community De- tection from Dynamics , Phys.

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach Peixoto, Network Reconstruction and Community De- tection from Dynamics , Phys

Reference 50

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:26.224519Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:26.224519Z digest=sha256:89f6af68fdf855ad0d1abe39eee93138c8f5a1e934d5b9f830c920dba8a052f3

Observation b2135c80-86ac-48d5-b2e3-6b7f1a1f275e · outbound

This paper cites J Duncan and S.

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach J Duncan and S

Reference 51

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:26.361703Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:26.361703Z digest=sha256:4182cad57bd415fe5ef7f2062493f66845998e29275df99ec58c6fd16bc73907

Observation 037dad77-b046-4b9d-9d21-7bea7eb8e3fc · outbound

This paper cites an unresolved cited work.

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach Unresolved cited work

Reference 52

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:26.549695Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:26.549695Z digest=sha256:99749570e93060c92d2982a5aa7f8ec96805b0e579985875f37c2e2f18ae9e45

Observation 2c047f89-44ce-4e53-a805-4e91833537b4 · outbound

This paper cites an unresolved cited work.

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach Unresolved cited work

Reference 53

Resolution
unresolved
no resolver link, observed 2026-08-03T08:48:26.686096Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T08:48:26.686096Z digest=sha256:974a11c0559daa7687bacd3113a430a0cb3e7e8c97e4e3d85c1bead3a508e72f

Pith citing papers

No inbound Pith citation observations are available.