{"as_of":"2026-08-14T12:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e18c60ef7cccf506bc360d11876e12b2183d499785ed33a1edbf7988e2b723df","coverage":[{"denominator":154,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T14:12:44.321245Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+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/2502.01892/citation-record","integrity":"/paper/2502.01892/integrity","json":"/paper/2502.01892/citation-record.json","paper":"/paper/2502.01892"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T14:12:43.806155Z","title":"The duality of persons and groups.Soc Forces, 53(2):181–190, 1974","venue":null,"work_id":null,"year":1974},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:43.806155Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:cc08ec22dadc9f333198abb2c429e4f3ee6850fe4bd0557f6992d0af3ef4bdcc","observation_id":"f17d785e-1ed7-4364-89ab-abd087c5a2dc","resolution":{"observed_at":"2026-08-09T14:12:43.806155Z","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-09T14:12:43.811341Z","title":"Neal, Annabell Cadieux, Diego Garlaschelli, Nicholas J","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:43.811341Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:58fe5e06f07e7d4d6e2d8e7156afb6ad5efbaafbdb6371b90fcb2a885284564d","observation_id":"17528110-16a8-4fe3-b2c0-46fe8c0d0ba4","resolution":{"observed_at":"2026-08-09T14:12:43.811341Z","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-09T14:12:43.815948Z","title":"Exponential random graph models for multilevel networks.Soc Netw, 35(1):96–115, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:43.815948Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:1d9205ff91b358c964eb9e9318e2ccda1d9cbbb2fc2efee8b22c0be13643529e","observation_id":"527f243b-3975-4e2d-ab1e-e31386bfb335","resolution":{"observed_at":"2026-08-09T14:12:43.815948Z","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-09T14:12:43.926949Z","title":"Basic notions for the analysis of large two- mode networks.Soc Netw, 30(1):31–48, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:43.926949Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:2259f7f95a37107a195e7f6ff69ec64a50a31751c4f8db6535caadd77b4e6f0a","observation_id":"5b63c500-5033-434c-b13e-465694937690","resolution":{"observed_at":"2026-08-09T14:12:43.926949Z","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-09T14:12:43.931461Z","title":"The dual-projection approach for two-mode networks.Soc Netw, 35(2):204–210, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:43.931461Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:9ef320e39512c857fc8f8a11f8c69419a17af6712c67d6aedf63ff47c474c2f9","observation_id":"209a1f9f-55f8-4e58-95c5-0495e2fb3fbe","resolution":{"observed_at":"2026-08-09T14:12:43.931461Z","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-09T14:12:43.936024Z","title":"Centrality and the dual-projection approach for two-mode social network data.Method Innov, 9:2059799116630662, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:43.936024Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:cba2b551cecc91b5f30bcad089242de74f5d54d0c2a490d8bc47b9aa2629aafc","observation_id":"e32a5d06-2226-413e-ac02-854c78e41858","resolution":{"observed_at":"2026-08-09T14:12:43.936024Z","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-09T14:12:43.941008Z","title":"Granovetter","venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:43.941008Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:fb42f044db3ce0e2980f90b490457bef1ffeac8b7d3b5c3b4d6942cfed7553bd","observation_id":"81f6b2c4-5bcc-4393-a6d1-41230b3f2d82","resolution":{"observed_at":"2026-08-09T14:12:43.941008Z","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-09T14:12:43.945255Z","title":"Weisstein","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:43.945255Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:0b7dcd6e9c632fe7879e4914c96fd343b994430b6b918238084dc8d653283572","observation_id":"9fc5aae8-b28a-4538-a79d-a8d8a803de68","resolution":{"observed_at":"2026-08-09T14:12:43.945255Z","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-09T14:12:43.949622Z","title":"Small worlds among interlocking directors: Network structure and distance in bipartite graphs.Comput Math Organ Theory, 10(1):69–94, 2004","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:43.949622Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:211a17ce077d612d6a4336f42d170e3342a7b7d92f0c754b9028800999ad7626","observation_id":"3c22767e-91c9-4894-a34b-7aae2cbaf07d","resolution":{"observed_at":"2026-08-09T14:12:43.949622Z","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-09T14:12:43.953788Z","title":"Triadic closure in two-mode networks: Redefining the global and local clustering coefficients","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:43.953788Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:9dd550bbba685cccf0898ee60ebd2fa58751a3f6a65505fd283668e0649d7dec","observation_id":"570c24cc-f55d-4db9-ba53-cd6fc0249c85","resolution":{"observed_at":"2026-08-09T14:12:43.953788Z","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-09T14:12:43.958400Z","title":"Modelling the evolution of a bipartite network—peer referral in inter- locking directorates.Soc Netw, 34(3):309–322, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:43.958400Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:1a5d575b07061cd51d8347f3b468ff7672494bd6c1e08516822c2e7ec5435ea0","observation_id":"6a946fce-2c0f-47c7-8e5d-494cdaaa8f73","resolution":{"observed_at":"2026-08-09T14:12:43.958400Z","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-09T14:12:43.962654Z","title":"Transitivity and degree assortativity explained: The bipartite structure of social networks.Phys Rev E, 101(5):052305, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:43.962654Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:772be26c1797bf7f13fa8980ea6188427f1056dcae91540708bd646897d8a539","observation_id":"d434b6e9-c926-4a41-92bb-9b9e7a9e902c","resolution":{"observed_at":"2026-08-09T14:12:43.962654Z","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-09T14:12:43.966890Z","title":"The role of bipartite structure in R&D collaboration networks","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:43.966890Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:44cc161ff71187bcd29c1660b6c55ef2ebde4506df071894b8ad5747fd01e8a5","observation_id":"8ca43713-1521-41a3-89df-9ae214056829","resolution":{"observed_at":"2026-08-09T14:12:43.966890Z","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-09T14:12:43.970456Z","title":"Structural Analysis in the Social Sciences","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:43.970456Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:566269c929d6fe8329e70d33ee7fb5df7184bf865c4aebe464d11d9e20ed8a87","observation_id":"80028fb2-ca13-4656-8973-f504dc499de6","resolution":{"observed_at":"2026-08-09T14:12:43.970456Z","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-09T14:12:43.974516Z","title":"Social network modeling.Annu Rev Stat Appl, 5:343– 369, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:43.974516Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:79396ee9a18679fc277437a2b7443d442f6f9e59f871dc0762c8c86bea708053","observation_id":"8058ff82-f4b4-4e4a-8c5e-fc30695fe673","resolution":{"observed_at":"2026-08-09T14:12:43.974516Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4135/9781526421036888175","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Koskinen","venue":"SAGE Research Methods Foundations","work_id":"3aced1ba-bd38-467a-ae42-16af4de97330","year":2020},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:43.978161Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:3945c530b758256b37c484cdaf862facdf8e0de8fecb14c254aa48ed79b0498d","observation_id":"ea20fe90-ce3b-4555-af81-bc9277db8f22","resolution":{"observed_at":"2026-08-09T14:12:44.605648Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T14:12:43.982048Z","title":"Exponential random graph models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:43.982048Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:fc1d55c899d697aef4b4d858794c3fd9e0618dc915abd03f4a7b6cce3f98e55f","observation_id":"27ce799a-e060-438a-a957-2e07350669fc","resolution":{"observed_at":"2026-08-09T14:12:43.982048Z","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-09T14:12:43.985744Z","title":"The statistical physics of real-world networks.Nat Rev Phys, 1(1):58–71, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:43.985744Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:f7f096c98482dd80feabe2ed368bea765db38d5d291fb1d2e1c81a697d51cd00","observation_id":"d7de9a2e-0c66-46d0-9cc4-82bed5faeafb","resolution":{"observed_at":"2026-08-09T14:12:43.985744Z","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-09T14:12:43.989564Z","title":"A survey on exponential random graph models: an application perspective.PeerJ Comput Sci, 6:e269, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:43.989564Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:d76fdeab67bab14426dbf9306564da47fc9bdcaea6989affc5116b00548ae447","observation_id":"90854f72-9b65-415c-ba9d-0e64f089b7f2","resolution":{"observed_at":"2026-08-09T14:12:43.989564Z","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-09T14:12:43.993134Z","title":"Generating synthetic power grids using expo- nential random graph models.PRX Energy, 3(2):023005, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:43.993134Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:03c1e260d7c1a3794058bef33439bddf2aebf8a225e2b433924d1466f84eb36b","observation_id":"5cb17968-b292-4ba6-8c9c-fedb3871be9a","resolution":{"observed_at":"2026-08-09T14:12:43.993134Z","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-09T14:12:43.996797Z","title":"Exponential random graph (p*) models for affiliation networks.Soc Netw, 31(1):12–25, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:43.996797Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:46e2be1aa0934c0cfcd44561fd32339b29055b303a6db2e34d24b127d055bc79","observation_id":"4165c803-6a7e-4668-b88a-ce23ac19999c","resolution":{"observed_at":"2026-08-09T14:12:43.996797Z","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-09T14:12:44.000353Z","title":"Exponential random graph model specifications for bipartite networks—a dependence hierarchy.Soc Netw, 35(2):211–222, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.000353Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:27fb2ff36d55aa0d647900c0ec02f26aed0204d80d12c405c2c426ac4d67a297","observation_id":"9b5b7185-486a-4d64-8b1e-9b5da3c42769","resolution":{"observed_at":"2026-08-09T14:12:44.000353Z","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-09T14:12:44.004430Z","title":"Exponential random graph model extensions: Models for multiple networks and bipartite net- works","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.004430Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:45bc5fc34acea79958ed328702509abcd149361191ea7ed996388035f0027cee","observation_id":"35a0aa8d-e6ec-4a4b-b1a5-f2c87ed3ba38","resolution":{"observed_at":"2026-08-09T14:12:44.004430Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.05673","last_updated":"2023-12-09T20:28:51Z","snapshot_observed_at":"2026-08-13T05:05:57.942348Z","submitted_at":"2023-12-09T20:28:51Z","title":"Modeling Homophily in Exponential-Family Random Graph Models for Bipartite Networks","version":1},"cited_work":{"arxiv_id":"2312.05673","doi":null,"metadata_source":"pith","pith_arxiv_id":"2312.05673","snapshot_observed_at":"2026-08-09T14:12:44.746716Z","title":"Modeling Homophily in Exponential-Family Random Graph Models for Bipartite Networks","venue":"cs.SI","work_id":"e52da124-c0c4-4360-b515-3baaca144c0a","year":2023},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.008570Z"},"links":{"cited_paper":"/paper/2312.05673","citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:a4efdc27b0164da1e3329180f0d2a7c3ad20911a1471a3c4f73f0fd6b493a828","observation_id":"c4b93642-bb73-4f9b-a4d5-fc79c4b1cdd6","resolution":{"observed_at":"2026-08-09T14:12:44.752080Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T14:12:44.013102Z","title":"Pattison and T.A.B","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.013102Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:863474cb48e0bd28eb20c0858da1ffbbd9caecb587afb8a042557bcab4fda4ed","observation_id":"257b35b9-07df-4eae-8136-87de9a5049d7","resolution":{"observed_at":"2026-08-09T14:12:44.013102Z","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-09T14:12:44.017144Z","title":"Constrained Monte Carlo maximum likelihood for dependent data.J R Stat Soc B, 54(3):657–683, 1992","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.017144Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:6278506de5033d2727175082997ac496bae2d24311c294b3121d69b8417a05f4","observation_id":"c7f9e745-911f-4e8d-bc85-e79bba432343","resolution":{"observed_at":"2026-08-09T14:12:44.017144Z","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-09T14:12:44.021585Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.021585Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:350b6fc3c63ad95d4bf24e037dfc32eba560dd23aa26b96eebc3b44bd1c8fc33","observation_id":"148f5bc0-d968-4b88-bff9-45e84059482d","resolution":{"observed_at":"2026-08-09T14:12:44.021585Z","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-09T14:12:44.025569Z","title":"Computational statistical methods for social network models.J Comput Graph Stat, 21(4):856–882, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.025569Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:49e0eb1c42f604c143192fc011f78c76849a55d80bd079d6934a0ca9e76ecc23","observation_id":"74fca0a2-c590-47a5-9965-ebe15c8c2a1d","resolution":{"observed_at":"2026-08-09T14:12:44.025569Z","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-09T14:12:44.029648Z","title":"Auxiliary parameter MCMC for exponential random graph models.J Stat Phys, 165(4):740–754, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.029648Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:b8d8f6049dce16999b18b6cb46c4ab4910779ab9fb20d550f192072971feaf29","observation_id":"e65e07c4-fa51-45b4-a5f8-d3f2df281cf2","resolution":{"observed_at":"2026-08-09T14:12:44.029648Z","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-09T14:12:44.033700Z","title":"Fast maximum likeli- hood estimation via equilibrium expectation for large network data.Sci Rep, 8(1):11509, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.033700Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:a016e1f01b876822650469999585fc002e0ee61c8980f0baddf8745f821d8e63","observation_id":"9856e554-75b6-4757-8b57-f17b517aefac","resolution":{"observed_at":"2026-08-09T14:12:44.033700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1901.00533","last_updated":"2020-02-11T14:02:02Z","snapshot_observed_at":"2026-08-12T08:11:01.602441Z","submitted_at":"2019-01-02T20:59:47Z","title":"A Simple Algorithm for Scalable Monte Carlo Inference","version":4},"cited_work":{"arxiv_id":"1901.00533","doi":null,"metadata_source":"pith","pith_arxiv_id":"1901.00533","snapshot_observed_at":"2026-08-09T14:12:44.727792Z","title":"A Simple Algorithm for Scalable Monte Carlo Inference","venue":"stat.CO","work_id":"c182b7a7-9c6b-4c63-bd7c-4c1d37376ead","year":2019},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.037777Z"},"links":{"cited_paper":"/paper/1901.00533","citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:a4a6ff7986d009dcf0d6e21c2d477948357a9ab239f9ee094bb959452da015bb","observation_id":"7add7811-3972-4046-b2d5-36d765ead413","resolution":{"observed_at":"2026-08-09T14:12:44.732522Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T14:12:44.042475Z","title":"Assessing degeneracy in statistical models of social networks","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.042475Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:8bb1b53bf292f0309dec701c566c44fb42c5248383e95b61ed6b9dd4e07be169","observation_id":"357959f5-4172-41af-b3e0-51140a7dc3be","resolution":{"observed_at":"2026-08-09T14:12:44.042475Z","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-09T14:12:44.046685Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.046685Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:8b7aff3d43704612ea084af5ea9ca1774271af04e192c46178694aaa6902374d","observation_id":"a9cedf93-0ec3-47c1-9e63-632fd173f2bf","resolution":{"observed_at":"2026-08-09T14:12:44.046685Z","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-09T14:12:44.051032Z","title":"Removing phase transitions from Gibbs measures","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.051032Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:72fe166d23e3d8c6e6347469e90ad21bafdeea8cfcf3e634800d5e9044b59759","observation_id":"d89abd3c-e6a7-47a3-b0fb-98b3b00b6c25","resolution":{"observed_at":"2026-08-09T14:12:44.051032Z","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-09T14:12:44.055481Z","title":"Instability, sensitivity, and degeneracy of discrete exponential families.J Am Stat Assoc, 106(496):1361–1370, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.055481Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:21e96d726989f5cc2105f3a7cddcf02706e17fad2a3c45e99df1bd8dbb13fd22","observation_id":"70482249-e832-457f-ad16-193341a527d6","resolution":{"observed_at":"2026-08-09T14:12:44.055481Z","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-09T14:12:44.059787Z","title":"Estimating and understanding exponential random graph models.Ann Stat, 41(5):2428–2461, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.059787Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:d857d060573c2a2400fa8188295cfb7b3f8e0d145250fcfdd8ab4123af734ab2","observation_id":"ea39ab20-8429-4883-b9a8-0f216ceebe25","resolution":{"observed_at":"2026-08-09T14:12:44.059787Z","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-09T14:12:44.063928Z","title":"Consistent structure estimation of exponential-family random graph models with block structure.Bernoulli, 26(2):1205–1233, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.063928Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:3ea1d24a94316f3731bf03ed00411803ce48965d4d3786c2d8b6c68c5074052d","observation_id":"28ac40bc-9eed-4a69-8287-3d26ca27f1db","resolution":{"observed_at":"2026-08-09T14:12:44.063928Z","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-09T14:12:44.068183Z","title":"Practical network modeling via tapered exponential-family random graph models.J Comput Graph Stat, 32(2):388–401, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.068183Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:10d10c2b325cb595cc57bbd2ff5728209c8369a249d1a3fb63ae261bfdf3b091","observation_id":"3832572e-e9b8-42eb-80dc-5b022898362b","resolution":{"observed_at":"2026-08-09T14:12:44.068183Z","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-09T14:12:44.072561Z","title":null,"venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.072561Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:75ce456313a8c0012e570c6688a437d4527ea55cde9e7a4756a46ce7614344e7","observation_id":"380998e2-6ca2-459c-830a-a0fcae7b1416","resolution":{"observed_at":"2026-08-09T14:12:44.072561Z","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-09T14:12:44.077671Z","title":"Koskinen and G","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.077671Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:bcf3d58e7231b2febc47f7f1b1aa27099499d4c9019ae38a50e32d2596efcbb2","observation_id":"881928e6-3677-4d3f-807b-ea8bc9c8c05f","resolution":{"observed_at":"2026-08-09T14:12:44.077671Z","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-09T14:12:44.081855Z","title":null,"venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.081855Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:43760f1ca4d77fcd7b4f4143fb477d7ce71bdf7f9b2cdff7651e1dbcc2c72929","observation_id":"911015c9-388c-43f2-86c1-43c0d6bb26d1","resolution":{"observed_at":"2026-08-09T14:12:44.081855Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.07338","last_updated":"2023-09-21T22:32:43Z","snapshot_observed_at":"2026-08-13T10:14:06.731699Z","submitted_at":"2023-09-13T22:14:12Z","title":"Overcoming near-degeneracy in the autologistic actor attribute model","version":2},"cited_work":{"arxiv_id":"2309.07338","doi":null,"metadata_source":"pith","pith_arxiv_id":"2309.07338","snapshot_observed_at":"2026-08-09T14:12:44.708535Z","title":"Overcoming near-degeneracy in the autologistic actor attribute model","venue":"stat.ME","work_id":"ccc33f24-1166-44af-8e04-e62a8bc90a40","year":2023},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.086126Z"},"links":{"cited_paper":"/paper/2309.07338","citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:1a8007fcb047ee3dea45e60cf880463b2290b4a74a27785b931e8cffa4cfbfca","observation_id":"c88be5be-2a31-4849-9494-e82a15ac0422","resolution":{"observed_at":"2026-08-09T14:12:44.713263Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T14:12:44.090879Z","title":"Hunter and Mark S","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.090879Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:5be519d8afa8daf7c90bbcd162edb6628fab5f97dedaa538eb5f60bd3e0f1ad5","observation_id":"15ed59fc-f0db-4be6-8e30-6e5838b4c5d6","resolution":{"observed_at":"2026-08-09T14:12:44.090879Z","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-09T14:12:44.094892Z","title":"Melbourne School of Psychological Sciences, The University of Melbourne, 2014.http://www.melnet.org.au/s/MPNetManual.pdf","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.094892Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:c2a3d86f2ae80ac2acc41db7585fa4f2d63231e0482134fd5bee97d7ece1b2f0","observation_id":"08f00347-372c-44d8-aeb8-e4b6ac3f7e96","resolution":{"observed_at":"2026-08-09T14:12:44.094892Z","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-09T14:12:44.099062Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.099062Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:47aa50ef108e82398c86e51e818cbf49010f974435a49b8dfa0f0c5eac66fe43","observation_id":"d83aafad-929a-49b4-80ec-ab1dae17d820","resolution":{"observed_at":"2026-08-09T14:12:44.099062Z","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-09T14:12:44.102966Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.102966Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:45cff8944b16f3b5e68931116ee47b5ed6175196d267c0dfaef8d48e6ffbb886","observation_id":"771ec062-56ad-42ec-bc29-e8a07ffec3b7","resolution":{"observed_at":"2026-08-09T14:12:44.102966Z","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-09T14:12:44.107023Z","title":"Handcock, David R","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.107023Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:4f97a4269e8f512c922ea4de08735ad4e9efb19be9384c3987ea3b808324cd8f","observation_id":"fb7eab04-0933-4b4c-8e12-0d6776a13fef","resolution":{"observed_at":"2026-08-09T14:12:44.107023Z","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-09T14:12:44.111057Z","title":"ergm: A package to fit, simulate and diagnose exponential-family models for networks.J Stat Softw, 24(3):1–29, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.111057Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:7fb8617dec16c4490d97a2ba2008b112a1a3a2d9f90ca1a52827500afa99e038","observation_id":"95df866e-db91-4b78-9a18-51858c6959b4","resolution":{"observed_at":"2026-08-09T14:12:44.111057Z","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-09T14:12:44.115074Z","title":"Hummel, David R","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.115074Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:924cb6cb564f98137b617ce69cf6b0b69398e55b98805c1bb82c71a9cea364c9","observation_id":"a0f1a653-36e8-42a0-b12f-b9afdb624c4a","resolution":{"observed_at":"2026-08-09T14:12:44.115074Z","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-09T14:12:44.118593Z","title":"Handcock, David R","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.118593Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:d2b66fd1344e3582f14f3d686904ca0f08e3418b70183608587e55f0e44c432c","observation_id":"fbc0de4d-b421-48fa-b8f9-76e4a5efa820","resolution":{"observed_at":"2026-08-09T14:12:44.118593Z","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-09T14:12:44.122453Z","title":"Handcock, David R","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.122453Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:9eceeaa8a6e8fa313a060afa39e5bfd648530d48aa16c677fe5dd8814c4023fc","observation_id":"251450ec-a2eb-4cba-bde4-685ee3d84218","resolution":{"observed_at":"2026-08-09T14:12:44.122453Z","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-09T14:12:44.125990Z","title":"Krivitsky, David R","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.125990Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:399434dd7fd02ff5845026919e3ff1ced73dc72ea9869c034f65aa9756a01aae","observation_id":"71ad954c-069a-4c28-9cc2-62f7f42e510e","resolution":{"observed_at":"2026-08-09T14:12:44.125990Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.08198","last_updated":"2022-03-15T18:53:24Z","snapshot_observed_at":"2026-08-13T16:22:30.904746Z","submitted_at":"2022-03-15T18:53:24Z","title":"ergm 4: Computational Improvements","version":1},"cited_work":{"arxiv_id":"2203.08198","doi":null,"metadata_source":"pith","pith_arxiv_id":"2203.08198","snapshot_observed_at":"2026-08-09T14:12:44.688977Z","title":"ergm 4: Computational Improvements","venue":"stat.CO","work_id":"5b42bf92-2646-4da4-9fe7-b90fae42ced6","year":2022},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.129524Z"},"links":{"cited_paper":"/paper/2203.08198","citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:823aca5eaee113ef333220e0352bb65526507c9b5903a5c3b5521d200a4cd096","observation_id":"c58e2b79-c2bd-4d21-ac96-3b6570e8487a","resolution":{"observed_at":"2026-08-09T14:12:44.693457Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T14:12:44.133348Z","title":"Bergm: Bayesian exponential random graphs in R.J Stat Softw, 61(2):1–25, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.133348Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:bb486737047cfd5c68e97c39ad46d270404c683e24abfb0b9cc47c0982285110","observation_id":"af9a85f0-4e4e-4430-a86b-4a1b141192d7","resolution":{"observed_at":"2026-08-09T14:12:44.133348Z","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-09T14:12:44.136861Z","title":"Statistical network analysis with Bergm.J Stat Softw, 104(1):1–23, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.136861Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:feedad48d9e607f42a0dbcf5451119b9232ab96c700a2ed3687e1c7c6d462f9d","observation_id":"6e251f71-3cbe-4685-bb71-ee6ac550c412","resolution":{"observed_at":"2026-08-09T14:12:44.136861Z","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-09T14:12:44.140357Z","title":"Sustainable energy governance in South Tyrol (Italy): A probabilistic bipartite network model.J Clean Prod, 221:854–862, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.140357Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:a4e93aa580d5ebbcab95a0c26af01ca3ed8998674b958d2d080c1a2b6cd3c6aa","observation_id":"ac89a9f8-00f3-456f-9ca7-6899c6777239","resolution":{"observed_at":"2026-08-09T14:12:44.140357Z","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-09T14:12:44.143933Z","title":"Local structural properties and attribute characteristics in 2-mode networks: p* models to map choices of theater events.J Math Sociol, 32(3):204–237, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.143933Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:cbb8c901defa003923f77048c853f4b864c57eda2e86fe7c814fdb473b9459b7","observation_id":"1d55fd61-d8cb-42f4-bee8-989a1618706a","resolution":{"observed_at":"2026-08-09T14:12:44.143933Z","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-09T14:12:44.148303Z","title":"Benton and Jihae You","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.148303Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:1d9115d5faf5fd3e1d52ce2d8ada9920a8e15c6d36970ad494fb3f0572cdbe76","observation_id":"7e6d7594-cf3d-4eb3-8d54-e57f447d5c32","resolution":{"observed_at":"2026-08-09T14:12:44.148303Z","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-09T14:12:44.152826Z","title":"Adapting to sea-level rise: Centralization or decentralization in polycentric governance systems?Policy Stud J, 50(1):143–175, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.152826Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:120861ae89fdccfafb1a6aad975b446643dfbe646372e74e9610e97be9b6b6f5","observation_id":"99609a0d-5704-4c91-bd74-d09470e0e45c","resolution":{"observed_at":"2026-08-09T14:12:44.152826Z","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-09T14:12:44.156947Z","title":"Watts and Steven H","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.156947Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:c1605c5bdd7e7f482119fe29de021b082c3ba58ba2986ad37a425d630c0a1fb4","observation_id":"8cdb260f-0aa3-48ee-b061-4e78d551ae9c","resolution":{"observed_at":"2026-08-09T14:12:44.156947Z","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-09T14:12:44.161156Z","title":"Why social networks are different from other types of networks.Phys Rev E, 68(3):036122, 2003","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.161156Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:f0bc466a007f33b7fbea67e3a60eae79c58e68dc45fb773cab5317c194467207","observation_id":"163f4ea2-00c7-4c22-8edf-b695d229ce7d","resolution":{"observed_at":"2026-08-09T14:12:44.161156Z","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-09T14:12:44.165427Z","title":"Comparing the real-world performance of exponential-family random graph models and latent order logistic models for social network analysis.J R Stat Soc A, 185(2):566–587, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.165427Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:a51385b1781052213bbaae3071ebcc3ec67701cfbdb9722554b35989bdbb2e7c","observation_id":"3852d128-5393-4441-ac11-23b4f6b67775","resolution":{"observed_at":"2026-08-09T14:12:44.165427Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1804.04583","last_updated":"2018-04-12T15:59:33Z","snapshot_observed_at":"2026-08-10T04:10:21.651896Z","submitted_at":"2018-04-12T15:59:33Z","title":"A New Generative Statistical Model for Graphs: The Latent Order Logistic (LOLOG) Model","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1804.04583","snapshot_observed_at":"2026-08-09T14:12:44.169596Z","title":"A new generative statistical model for graphs: The latent order logistic (LOLOG) model.arXiv preprint arXiv:1804.04583v1, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.169596Z"},"links":{"cited_paper":"/paper/1804.04583","citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:f20fef51ce00d610b36344ce67cfa5ed02ba580ab49008bb0a6263d7e6bd6129","observation_id":"64ad0b80-c119-4fcc-b875-b9a90d9a3504","resolution":{"observed_at":"2026-08-09T14:12:44.169596Z","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-09T14:12:44.174050Z","title":"Who speaks up to whom? a relational approach to employee voice.Soc Netw, 33(4):303–316, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.174050Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:d9459e2b4ef44874afc2044a2d74f3869da832fb430fe9a800a1dd37e75cd864","observation_id":"65ff92e5-5ddb-4998-81ec-1f467c1ca108","resolution":{"observed_at":"2026-08-09T14:12:44.174050Z","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-09T14:12:44.178281Z","title":"Social context, spatial structure and social network structure.Soc Netw, 34(1):32–46, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.178281Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:919b18ab135421eddbad1e55ad75c9338524cd6458ece07b090f31d944ff8215","observation_id":"cf07f707-ab8f-4b0d-a4dd-6ba6b70eaf35","resolution":{"observed_at":"2026-08-09T14:12:44.178281Z","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-09T14:12:44.182548Z","title":"Gygax, and Peng Wang","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.182548Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:23bba204fbf96ca9298d01af54f75e9508c184bb9f15db9d8ef204137291d03d","observation_id":"19aba213-1b10-456c-9c2c-a60a64309712","resolution":{"observed_at":"2026-08-09T14:12:44.182548Z","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-09T14:12:44.186707Z","title":"Goodreau","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.186707Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:c02cfbb7a7b9ee5c8d2661dbaf9fa8978d3c5dbdbdd9e4ad633026765f9e6e88","observation_id":"11011952-fc02-4fda-96fd-71439cdea491","resolution":{"observed_at":"2026-08-09T14:12:44.186707Z","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-09T14:12:44.190866Z","title":"Relationship patterns in the 19th century: The friendship network in a German boys’ school class from 1880 to 1881 revisited.Soc Netw, 37:1–13, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.190866Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:0800fb83057cc9bdcbff408b32850f98bd99fd1590c01f335749832839b057fe","observation_id":"341ffb7c-9e88-424b-bf7e-3379a069f415","resolution":{"observed_at":"2026-08-09T14:12:44.190866Z","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-09T14:12:44.194886Z","title":"Social networks and spatial configuration—how office layouts drive so- cial interaction.Soc Netw, 34(1):47–58, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.194886Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:ae0bb54087ea6aeba5cbbc7216477647bb25156fc3b1a1ff1bd8c11d591646e8","observation_id":"8e918ddb-9e8e-4ba1-b24b-f5cf3388d010","resolution":{"observed_at":"2026-08-09T14:12:44.194886Z","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-09T14:12:44.199111Z","title":"Unpacking reputational power: Intended and unintended determinants of the assessment of actors’ power.Soc Netw, 42:60–71, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.199111Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:fe35757eb2291b6ee0958dbc904f4862ee75d03c0bdec1d0e5bc2384fab99390","observation_id":"2f094638-c92d-4c33-901a-48be972240bd","resolution":{"observed_at":"2026-08-09T14:12:44.199111Z","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-09T14:12:44.203297Z","title":"A comparative study of social network models: Network evolution models and nodal attribute models.Soc Netw, 31(4):240–254, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.203297Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:0261c04ebd16cba4acb909a0f827750ff06165bbaa848e43aa85be89a2622c5f","observation_id":"4b03ef35-6cc6-498d-95a8-d4ca5eb5282f","resolution":{"observed_at":"2026-08-09T14:12:44.203297Z","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-09T14:12:44.207542Z","title":"Online collective identity: The case of the environmental movement.Soc Netw, 33(3):177–190, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.207542Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:2e2016cf0472ed0d7fc17af234e659ef6dfbae2d5f9ef315d248f89d3ed9e480","observation_id":"73b83568-6834-4c69-a7f1-e9b36f3c13dd","resolution":{"observed_at":"2026-08-09T14:12:44.207542Z","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-09T14:12:44.211628Z","title":"A p* primer: logit models for social networks","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.211628Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:85eaad2babd3b996569480538a00ec9deea11de3d69c6fc11575ff7d25bb1e19","observation_id":"6a6defaf-f0ca-408c-bffd-ede54b0be1fd","resolution":{"observed_at":"2026-08-09T14:12:44.211628Z","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-09T14:12:44.215606Z","title":"Exponential random graph model parameter estimation for very large directed networks.PLoS One, 15(1):e0227804, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.215606Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:e32cea9ac5b5d41fdb7ffe582d903501f587ecd7b7faad29dc04734e2778e8b3","observation_id":"5cac1ae3-4243-4a59-ba79-2cc0e99f0e25","resolution":{"observed_at":"2026-08-09T14:12:44.215606Z","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-09T14:12:44.219844Z","title":"Differential impact of directors’ social and financial capital on corporate interlock formation","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.219844Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:25e31031d81d0a938bd01de8d53929062ac2cddf3ebc77cc5fd9a48a65808f5a","observation_id":"8ccbb579-35f4-42e7-93ad-1b91fcbf20e9","resolution":{"observed_at":"2026-08-09T14:12:44.219844Z","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-09T14:12:44.224250Z","title":"Geodesic cycle length distributions in delusional and other social networks.J Soc Struct, 21(1):35–76, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.224250Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:ace184a42a220cefed56cacc62133ebb1c335f43854fd9d67396396a04c5edb5","observation_id":"9540d3ff-df20-48b1-a259-0db4ece69afe","resolution":{"observed_at":"2026-08-09T14:12:44.224250Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.11597","last_updated":"2023-03-21T05:19:29Z","snapshot_observed_at":"2026-08-13T12:20:14.337472Z","submitted_at":"2023-03-21T05:19:29Z","title":"Geodesic cycle length distributions in fictional character networks","version":1},"cited_work":{"arxiv_id":"2303.11597","doi":null,"metadata_source":"pith","pith_arxiv_id":"2303.11597","snapshot_observed_at":"2026-08-09T14:12:44.654547Z","title":"Geodesic cycle length distributions in fictional character networks","venue":"cs.SI","work_id":"b5a48c24-486e-4eca-899f-f00779a560e9","year":2023},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.228524Z"},"links":{"cited_paper":"/paper/2303.11597","citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:8664b453c0619388cb66e577e91dde1d223a902acf1405618277924eb1987467","observation_id":"cb56182e-05de-4925-be2a-4f81f666a8df","resolution":{"observed_at":"2026-08-09T14:12:44.659104Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T14:12:44.232953Z","title":"Comment on geodesic cycle length distributions in delusional and other social networks.J Soc Struct, 21(1):77–93, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.232953Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:8b77a51b68b4ab52d12c1ee11becc03fc37dba3fdb8f4a5e18c6d92d2e411009","observation_id":"d7b053ad-a294-41e5-9aaf-f049358b2791","resolution":{"observed_at":"2026-08-09T14:12:44.232953Z","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-09T14:12:44.236513Z","title":"Stochastic weighted graphs: Flexible model specification and simulation.Soc Netw, 49:37–47, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.236513Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:0655b6f43e2d4180e2fbff1770ef638b7b9c4c05983ea55477fa8f6f7d309a62","observation_id":"dabc80b8-8a42-4f6a-90b8-f3ab70f0bd35","resolution":{"observed_at":"2026-08-09T14:12:44.236513Z","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-09T14:12:44.240091Z","title":"Pattison, Garry L","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.240091Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:7f9c87bc575f6a12ed3a3a25860bd4adf00c771869aa61c1cb0b5e920afaa6be","observation_id":"a75840f9-99f7-44da-a543-77113ce31c65","resolution":{"observed_at":"2026-08-09T14:12:44.240091Z","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-09T14:12:44.243793Z","title":"Neighborhood–based models for social networks.Sociol Methodol, 32(1):301–337, 2002","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.243793Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:60727c0239172c32202595095d8d4f523923eed291bdacab617a3e619395b992","observation_id":"85cb2019-837a-405f-b928-780291399261","resolution":{"observed_at":"2026-08-09T14:12:44.243793Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T14:12:45.656045Z","title":"Building models for social space: Neighourhood-based models for social networks and affiliation structures.Math & Sci Hum, 42(168):11–29, 2004","venue":null,"work_id":"f7d88a54-a8d4-4cd6-b0bf-e1e467009cc7","year":2004},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.247473Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:bd28bd712711764161b708a9c5d6746be09c5a212cd9c19986ee698b1b5466f3","observation_id":"3474325b-b5ff-42e8-8bdf-ac974473fb1c","resolution":{"observed_at":"2026-08-09T14:12:45.660444Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T14:12:45.643182Z","title":"Hunter, Steven M","venue":null,"work_id":"69d65e26-db72-447f-9b31-8d67b16a392f","year":2013},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.251523Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:3cf5b6a1d9b66cc4c0401f2e7b9476d09b01f29d68e536bd632cd1531f5a02fe","observation_id":"7f8fdc7b-5894-4cad-b709-375e810133d3","resolution":{"observed_at":"2026-08-09T14:12:45.647473Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T14:12:45.629896Z","title":"Extending ERGM functionality within statnet: Building custom user terms.https://statnet.org/workshop-ergm-userterms/ergm.userterms_tutorial .pdf, 2019","venue":null,"work_id":"b3917036-17ec-4a58-8eef-d7a066064a06","year":2019},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.255118Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:37d6feef3c301fa95a1bf7e94a2d64cfbfb0e1836da9a0ebc30560d3aaf144ca","observation_id":"d3aa59e7-6bd8-4233-bda5-a8c46d2e7612","resolution":{"observed_at":"2026-08-09T14:12:45.634259Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T14:12:45.617038Z","title":"An efficient algorithm for enumerating chordless cycles and chordless paths","venue":null,"work_id":"1c1a9fec-3893-4b3b-9fe9-5304a8a449a2","year":2014},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.258947Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:5d39190b0bd6b491eda9b9116490bf36c49b95daf6d1df2542d9118544b2c75d","observation_id":"9b014750-5a08-4d2c-947b-fc31ae8eb149","resolution":{"observed_at":"2026-08-09T14:12:45.621247Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T14:12:45.603654Z","title":"R Foundation for Statistical Com- puting, Vienna, Austria, 2022","venue":null,"work_id":"4131c4c0-0e8e-427c-a320-a05dd61a830f","year":2022},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.262524Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:eda33237b264760270dd0bfffc4dcd152b055df4537087585a20b4f2cfde9206","observation_id":"f1fdc5dc-00df-4524-bc6e-664e3ff498e7","resolution":{"observed_at":"2026-08-09T14:12:45.608215Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T14:12:45.590622Z","title":"The igraph software package for complex network research.InterJournal, Complex Systems:1695, 2006","venue":null,"work_id":"c97159db-9f18-486d-a2a4-535b559cbd17","year":2006},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.266724Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:8bd348bfff2513aa9a68ee1a826b49c56d6cd55a4d83c28dd574262ee5e00e14","observation_id":"a7387bb0-6703-4fc0-b22f-670e6e2db484","resolution":{"observed_at":"2026-08-09T14:12:45.595014Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.10260","last_updated":"2023-11-17T01:05:13Z","snapshot_observed_at":"2026-08-13T05:23:29.736813Z","submitted_at":"2023-11-17T01:05:13Z","title":"igraph enables fast and robust network analysis across programming languages","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.10260","snapshot_observed_at":"2026-08-09T14:12:44.270712Z","title":"igraph enables fast and robust network analysis across programming languages.arXiv preprint arXiv:2311.10260v1, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.270712Z"},"links":{"cited_paper":"/paper/2311.10260","citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:169c1050fc4d0598d1bb257d8bc9d63b1455953d5afe4880df7e3e559424041d","observation_id":"47e37ab4-3472-4a9e-96cd-42e754cd127d","resolution":{"observed_at":"2026-08-09T14:12:44.270712Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T14:12:45.577886Z","title":"Springer-Verlag, New York, 2016","venue":null,"work_id":"7aac3c79-0ba7-4081-99f3-798a9983f7e1","year":2016},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.275178Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:499b5c39df27502a39761b98a284bf1bb617e069aeaacb4a9e6ef37c97993fae","observation_id":"94105339-674f-4c1d-8909-83411d958b07","resolution":{"observed_at":"2026-08-09T14:12:45.582046Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T14:12:45.563849Z","title":"Specification of exponential-family random graph models: Terms and computational aspects.J Stat Softw, 24(4):1–24, 2008","venue":null,"work_id":"876e3e38-4590-49a7-90a5-7ef75e0b300a","year":2008},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.279196Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:3077813be4e3d15d9201fee44082f9d598f407b9e2be0b88ef1b2ab2ac7ea179","observation_id":"65332dae-7ff5-496f-9438-e606382c6705","resolution":{"observed_at":"2026-08-09T14:12:45.568778Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T14:12:45.550979Z","title":"University of Chicago Press, 1941","venue":null,"work_id":"ee42abb8-c81b-4d1b-b786-d8398e2601ba","year":1941},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.283596Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:c05f4538f16d12d0a93b3891eabf597e56bf9fccc478860614c031126b80f086","observation_id":"c09736b5-82cb-458c-a07e-feb5c8e4e45b","resolution":{"observed_at":"2026-08-09T14:12:45.555208Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T14:12:45.537527Z","title":"Krivitsky and Mark S","venue":null,"work_id":"0ea66603-3f45-488f-a28b-ef09524b4958","year":2008},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.287727Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:1667787acaa0c9048d501e45a0654f053c1b5678db2671a448cb7b5ba2bd6b15","observation_id":"9aff407e-86a1-4fff-b5e5-34a55e8afffb","resolution":{"observed_at":"2026-08-09T14:12:45.542187Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T14:12:45.524723Z","title":"Krivitsky and Mark S","venue":null,"work_id":"c70ef06c-8e59-4f2e-9121-3184d1d1751f","year":2024},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.291653Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:5f14c6720dc0a5f8ecfe38a8b730ee94404ae23bfb1ccd0b581a5d9c65991521","observation_id":"8dd6352d-db46-4858-8f40-5748825daa29","resolution":{"observed_at":"2026-08-09T14:12:45.528766Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T14:12:45.512206Z","title":"A dynamic model for the mutual constitution of individuals and events.J Complex Netw, 10(2):cnac004, 03 2022","venue":null,"work_id":"572966f0-36de-4a65-8b01-06ee0eb4cdbb","year":2022},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.295922Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:4c230e3ad9fa07a6a29834559756041cf331d09d5be1d9267b50024494a339a6","observation_id":"c604086c-a584-4256-b19c-4c41167a307b","resolution":{"observed_at":"2026-08-09T14:12:45.516390Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T14:12:45.499794Z","title":"Bipartite exponential random graph models with nodal random effects","venue":null,"work_id":"5a5bf519-9d1f-4ab1-8d16-fc9c1eb7aa1c","year":2022},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.300007Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:297a39bd20e472dde24b11c4fd86a2a6342f8d8bd9fbd5f1cdfa1c780e95109d","observation_id":"0954e151-f6cc-4e47-b9c5-4d9d0e797473","resolution":{"observed_at":"2026-08-09T14:12:45.503764Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T14:12:45.487260Z","title":"Measuring knowledge and experience in two mode temporal networks.Soc Netw, 55:63–73, 2018","venue":null,"work_id":"fadce5e3-a627-4259-a3f5-0a577c4dfc39","year":2018},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.304009Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:cdd6fe38190842b0db4d44fa1f508b5f6cb5602d4e68ca54dcbe56c1033cf610","observation_id":"672cceeb-aae2-46f3-b44c-91545776ae19","resolution":{"observed_at":"2026-08-09T14:12:45.491173Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T14:12:45.474041Z","title":"texreg: Conversion of statistical model output in R to L ATEX and HTML tables.J Stat Softw, 55(8):1–24, 2013","venue":null,"work_id":"d67c3cc1-e4eb-45f8-aa02-eacfad85ad0f","year":2013},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.308136Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:72beca01d0d5d534721e7bc94fa2cba5983ca6d6e231f97358dbfc0719ddc474","observation_id":"80cf4e2f-9668-4b83-9d91-09435855bb3b","resolution":{"observed_at":"2026-08-09T14:12:45.478406Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.6084/m9.figshare.3465020.v1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Interpretation of gw-degree estimates in ERGMs, June 2016.https://doi.org/10.6084/m9.figshare.3465020.v1","venue":"Figshare","work_id":"20a4df57-3181-4483-9386-77aa245c4d59","year":2016},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":98,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.312325Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:6f6d38db15b97fb9478cbbbf8abc27aa1c9f9108ccc2691408491a8683eb6a55","observation_id":"119a665f-e5c8-4a46-bc34-2f5b7d0f9a68","resolution":{"observed_at":"2026-08-09T14:12:44.592313Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T14:12:45.460211Z","title":"gwdegree: Improving interpretation of geometrically-weighted degree estimates in exponential random graph models.J Open Source Softw, 1(3):36, 2016","venue":null,"work_id":"b0a7fff5-0d9a-4cee-9b12-a7092bb8f680","year":2016},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.317155Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:a305f0506883bcba2551cfffb9648869ec6f8724eaa8e55eaaa2b935657b6ec7","observation_id":"44ce9157-1df8-4763-97e4-fba457fc3190","resolution":{"observed_at":"2026-08-09T14:12:45.464819Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T14:12:45.446501Z","title":"Comment on geodesic cycle length distributions in delusional and other social net- works","venue":null,"work_id":"3b7d3db3-0b84-4800-9afe-4eac0355e55f","year":2020},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.321245Z"},"links":{"citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:6cd0c9bd12701f73a9f61030f9702107b6a69b0e6fad5721a1eea21f2ae6740a","observation_id":"0d439bb9-d744-4dbc-a6ba-0b64bfe2df1c","resolution":{"observed_at":"2026-08-09T14:12:45.451306Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","latest_version":3,"primary_category":"stat.ME","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":76,"verified_exact":7,"verified_fuzzy":17},"total_outbound_references":154},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 100 of 154 outbound references and 0 inbound Pith citation observations for arXiv:2502.01892."}