{"as_of":"2026-08-13T00:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b9327a160be4c5325402d1fd7e796066be004397063fb9dddc566d4d21adca01","coverage":[{"denominator":46,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":46,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T13:14:33.713563Z","state":"measured"},{"denominator":46,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":46,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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/2411.16464/citation-record","integrity":"/paper/2411.16464/integrity","json":"/paper/2411.16464/citation-record.json","paper":"/paper/2411.16464"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T13:14:34.327390Z","title":null,"venue":null,"work_id":"d903dcdd-cd8f-4afe-94ab-df9c599bbf74","year":null},"citing_paper":{"arxiv_id":"2411.16464","last_updated":"2024-11-25T15:11:07Z","snapshot_observed_at":"2026-08-12T13:02:57.923400Z","submitted_at":"2024-11-25T15:11:07Z","title":"Generating social networks with static and dynamic utility-maximization approaches","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T13:14:33.406480Z"},"links":{"citing_paper":"/paper/2411.16464"},"observation_digest":"sha256:4367bd50046c34a2d1b72ee1c0f9d1a8a0dd122b9e0c77323656fcc4fa83af79","observation_id":"93846d3a-0099-4f61-8848-31d2ebafc8ed","resolution":{"observed_at":"2026-08-12T13:14:34.331231Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:14:34.260627Z","title":null,"venue":null,"work_id":"7fc71e4a-29e2-4002-b529-6960d1fbc69c","year":2007},"citing_paper":{"arxiv_id":"2411.16464","last_updated":"2024-11-25T15:11:07Z","snapshot_observed_at":"2026-08-12T13:02:57.923400Z","submitted_at":"2024-11-25T15:11:07Z","title":"Generating social networks with static and dynamic utility-maximization approaches","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T13:14:33.434195Z"},"links":{"citing_paper":"/paper/2411.16464"},"observation_digest":"sha256:abc2d4dc8360b234b60884bcb17eb6bf54f68c9d7ac6f1dc0ee8f7d880108775","observation_id":"a9bdda85-72a4-446a-bacc-08c8381d8c4c","resolution":{"observed_at":"2026-08-12T13:14:34.264397Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:14:34.351618Z","title":"In addition, all generated networks verify pairwise stability [21] (see the supplementary materials for a proof)","venue":null,"work_id":"ffcdf8be-1ff2-4935-a029-bfd6923d25f2","year":null},"citing_paper":{"arxiv_id":"2411.16464","last_updated":"2024-11-25T15:11:07Z","snapshot_observed_at":"2026-08-12T13:02:57.923400Z","submitted_at":"2024-11-25T15:11:07Z","title":"Generating social networks with static and dynamic utility-maximization approaches","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T13:14:33.397766Z"},"links":{"citing_paper":"/paper/2411.16464"},"observation_digest":"sha256:6fce2bf9734c15873077f846e790708f20602f1da701cbb15c29f16d3f370534","observation_id":"723b2beb-13a7-4c9a-a353-21da42a64dd8","resolution":{"observed_at":"2026-08-12T13:14:34.355637Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:14:34.314991Z","title":null,"venue":null,"work_id":"721e09d6-1bef-474a-b619-2694ff2a6d06","year":null},"citing_paper":{"arxiv_id":"2411.16464","last_updated":"2024-11-25T15:11:07Z","snapshot_observed_at":"2026-08-12T13:02:57.923400Z","submitted_at":"2024-11-25T15:11:07Z","title":"Generating social networks with static and dynamic utility-maximization approaches","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T13:14:33.410697Z"},"links":{"citing_paper":"/paper/2411.16464"},"observation_digest":"sha256:457576b8f58dfed3e28b9feb2d0a039cf6d0d2f38cc63a0f90af6247d5b4ebb5","observation_id":"a452d3fc-16eb-463d-9f9c-1157a97d5556","resolution":{"observed_at":"2026-08-12T13:14:34.318764Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:14:34.289671Z","title":"Moreover, α∗∗ the solution of the associated SOP, verifies: ∀(i, j) ∈ J1..N K2, α∗∗ i,j = (αmax {i,j})∗ min {i,j} D","venue":null,"work_id":"c67e0999-8dca-4b4a-b6df-9de7e05d750c","year":null},"citing_paper":{"arxiv_id":"2411.16464","last_updated":"2024-11-25T15:11:07Z","snapshot_observed_at":"2026-08-12T13:02:57.923400Z","submitted_at":"2024-11-25T15:11:07Z","title":"Generating social networks with static and dynamic utility-maximization approaches","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T13:14:33.419754Z"},"links":{"citing_paper":"/paper/2411.16464"},"observation_digest":"sha256:a85281e6d81c1bd09f53a2b25fe538ecc4d539efc51a47077925425b31c4042f","observation_id":"7544d6af-ea77-4ac2-a24f-f90145ea7611","resolution":{"observed_at":"2026-08-12T13:14:34.293861Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:14:33.424802Z","title":null,"venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2411.16464","last_updated":"2024-11-25T15:11:07Z","snapshot_observed_at":"2026-08-12T13:02:57.923400Z","submitted_at":"2024-11-25T15:11:07Z","title":"Generating social networks with static and dynamic utility-maximization approaches","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T13:14:33.424802Z"},"links":{"citing_paper":"/paper/2411.16464"},"observation_digest":"sha256:be2edbbb19e81abbbce4537d5d7e2a6de63a02a92eda600ad9c78cbfecdbd044","observation_id":"718cfe7b-ee1b-4107-81c0-2c211a2cd949","resolution":{"observed_at":"2026-08-12T13:14:33.424802Z","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-12T13:14:34.271652Z","title":"Barab´ asi and R","venue":null,"work_id":"fc2c7f06-6c91-46af-8428-7d74149330be","year":1999},"citing_paper":{"arxiv_id":"2411.16464","last_updated":"2024-11-25T15:11:07Z","snapshot_observed_at":"2026-08-12T13:02:57.923400Z","submitted_at":"2024-11-25T15:11:07Z","title":"Generating social networks with static and dynamic utility-maximization approaches","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T13:14:33.429347Z"},"links":{"citing_paper":"/paper/2411.16464"},"observation_digest":"sha256:7f6ec330bec1814281148452c5c8a7c9ec200f6f9667e1ca69f6fab24e4f139f","observation_id":"88ad5a34-be21-4459-9568-f93d485bed14","resolution":{"observed_at":"2026-08-12T13:14:34.275663Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:14:34.249285Z","title":"Hamill and N","venue":null,"work_id":"0a283442-e407-40a9-bac5-1478f6865a83","year":2009},"citing_paper":{"arxiv_id":"2411.16464","last_updated":"2024-11-25T15:11:07Z","snapshot_observed_at":"2026-08-12T13:02:57.923400Z","submitted_at":"2024-11-25T15:11:07Z","title":"Generating social networks with static and dynamic utility-maximization approaches","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T13:14:33.438784Z"},"links":{"citing_paper":"/paper/2411.16464"},"observation_digest":"sha256:6bf5144963c558570355d9e75328998e7d5ec2647b522d1be7f5c882c1624b0f","observation_id":"b9166b40-9b76-4990-814e-fcd2b99ce770","resolution":{"observed_at":"2026-08-12T13:14:34.253184Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:14:34.237951Z","title":null,"venue":null,"work_id":"7f0dd696-917d-4d35-bf55-3c63c0cac4bf","year":2012},"citing_paper":{"arxiv_id":"2411.16464","last_updated":"2024-11-25T15:11:07Z","snapshot_observed_at":"2026-08-12T13:02:57.923400Z","submitted_at":"2024-11-25T15:11:07Z","title":"Generating social networks with static and dynamic utility-maximization approaches","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T13:14:33.443188Z"},"links":{"citing_paper":"/paper/2411.16464"},"observation_digest":"sha256:d18a36b12745b0c58aa14a708d7748164e45a01c2034f8f6a541f9e2ad1cf82e","observation_id":"a03d686e-d1d8-458f-beb6-251f590e39c4","resolution":{"observed_at":"2026-08-12T13:14:34.241720Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:14:34.227169Z","title":"Erling, A","venue":null,"work_id":"6d920f63-f9b6-4348-864a-76200e0f8d42","year":2015},"citing_paper":{"arxiv_id":"2411.16464","last_updated":"2024-11-25T15:11:07Z","snapshot_observed_at":"2026-08-12T13:02:57.923400Z","submitted_at":"2024-11-25T15:11:07Z","title":"Generating social networks with static and dynamic utility-maximization approaches","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T13:14:33.447564Z"},"links":{"citing_paper":"/paper/2411.16464"},"observation_digest":"sha256:33fefaa5db526c73d35aa15e8f0a99024930d4141e9720a77ccad4ac86bf8f74","observation_id":"2fa93d65-b38f-468f-9403-465b80217f62","resolution":{"observed_at":"2026-08-12T13:14:34.230731Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:14:34.214561Z","title":"Zhuge, C","venue":null,"work_id":"9869fd12-005e-4cfa-8a66-c634250af506","year":2018},"citing_paper":{"arxiv_id":"2411.16464","last_updated":"2024-11-25T15:11:07Z","snapshot_observed_at":"2026-08-12T13:02:57.923400Z","submitted_at":"2024-11-25T15:11:07Z","title":"Generating social networks with static and dynamic utility-maximization approaches","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T13:14:33.451895Z"},"links":{"citing_paper":"/paper/2411.16464"},"observation_digest":"sha256:ce5eeabbc2f30c60f18ed0c13c04584ad044278ea3a03e2eaed18a2ea5d7f2d3","observation_id":"9a844bb6-7165-4751-a7ca-e72ed85c8c75","resolution":{"observed_at":"2026-08-12T13:14:34.218825Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:14:34.202686Z","title":null,"venue":null,"work_id":"7ed27ecd-f652-4e3c-80a5-c6a36da79c71","year":2019},"citing_paper":{"arxiv_id":"2411.16464","last_updated":"2024-11-25T15:11:07Z","snapshot_observed_at":"2026-08-12T13:02:57.923400Z","submitted_at":"2024-11-25T15:11:07Z","title":"Generating social networks with static and dynamic utility-maximization approaches","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T13:14:33.456003Z"},"links":{"citing_paper":"/paper/2411.16464"},"observation_digest":"sha256:589e440096b7216bd233910f31f47ed3790575862aa3cc52d539b2574a9df7cf","observation_id":"eb585042-c638-437e-ac0f-dc7776368c28","resolution":{"observed_at":"2026-08-12T13:14:34.206723Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:14:34.191109Z","title":null,"venue":null,"work_id":"c285b2e3-c010-4b2c-bc55-538743a0f966","year":null},"citing_paper":{"arxiv_id":"2411.16464","last_updated":"2024-11-25T15:11:07Z","snapshot_observed_at":"2026-08-12T13:02:57.923400Z","submitted_at":"2024-11-25T15:11:07Z","title":"Generating social networks with static and dynamic utility-maximization approaches","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T13:14:33.459825Z"},"links":{"citing_paper":"/paper/2411.16464"},"observation_digest":"sha256:4974789a2f286a6597ab947811104a8beb7dfd433fdaf8d3cc3f9daa1713a056","observation_id":"0e9791f1-ec7c-404f-8469-9cf7872a207a","resolution":{"observed_at":"2026-08-12T13:14:34.194847Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:14:34.177974Z","title":"Duchemin and Y","venue":null,"work_id":"0e47d853-b7d9-46ab-a451-16801be67da0","year":2023},"citing_paper":{"arxiv_id":"2411.16464","last_updated":"2024-11-25T15:11:07Z","snapshot_observed_at":"2026-08-12T13:02:57.923400Z","submitted_at":"2024-11-25T15:11:07Z","title":"Generating social networks with static and dynamic utility-maximization approaches","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T13:14:33.463411Z"},"links":{"citing_paper":"/paper/2411.16464"},"observation_digest":"sha256:8fbd704d7d68cc3d9cabbee51f993c1f82f9940f5679281108eea9e511e121be","observation_id":"9b0e0229-f2d8-4880-8476-6d48a2cd58b1","resolution":{"observed_at":"2026-08-12T13:14:34.182208Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:14:34.165392Z","title":"Krioukov, Clustering implies geometry in networks, Physical review letters 116, 208302 (2016)","venue":null,"work_id":"6817a4cf-d70b-4d5a-b23b-2aeefabf4990","year":2016},"citing_paper":{"arxiv_id":"2411.16464","last_updated":"2024-11-25T15:11:07Z","snapshot_observed_at":"2026-08-12T13:02:57.923400Z","submitted_at":"2024-11-25T15:11:07Z","title":"Generating social networks with static and dynamic utility-maximization approaches","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T13:14:33.466993Z"},"links":{"citing_paper":"/paper/2411.16464"},"observation_digest":"sha256:99b9f3d9967dc6f161c2e833223791cadb8126363c103ae6588f0a5a3a76dfbf","observation_id":"abe12638-d2f1-43c7-83e1-d9575ac9dd10","resolution":{"observed_at":"2026-08-12T13:14:34.168842Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.07055","last_updated":"2020-04-02T13:08:36Z","snapshot_observed_at":"2026-08-09T15:29:08.258808Z","submitted_at":"2019-07-16T15:12:04Z","title":"Homophily as a Process Generating Social Networks: Insights from Social Distance Attachment Model","version":3},"cited_work":{"arxiv_id":"1907.07055","doi":null,"metadata_source":"pith","pith_arxiv_id":"1907.07055","snapshot_observed_at":"2026-08-12T13:14:33.853215Z","title":"Homophily as a Process Generating Social Networks: Insights from Social Distance Attachment Model","venue":"cs.SI","work_id":"0f241898-4376-4fb9-b592-17567b300e5b","year":2019},"citing_paper":{"arxiv_id":"2411.16464","last_updated":"2024-11-25T15:11:07Z","snapshot_observed_at":"2026-08-12T13:02:57.923400Z","submitted_at":"2024-11-25T15:11:07Z","title":"Generating social networks with static and dynamic utility-maximization approaches","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T13:14:33.470559Z"},"links":{"cited_paper":"/paper/1907.07055","citing_paper":"/paper/2411.16464"},"observation_digest":"sha256:dbd6d14819e7c2e5ceda8dccd06c846d6b5822063c552b0b6c3c9b215a5f284c","observation_id":"19e24f3e-026a-4eb5-a255-432e0ba84ace","resolution":{"observed_at":"2026-08-12T13:14:33.858482Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.3982/te1873","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T13:14:33.743830Z","title":"Iijima, R","venue":null,"work_id":"ff8c273b-9012-434a-ad0d-87c3844b9855","year":2017},"citing_paper":{"arxiv_id":"2411.16464","last_updated":"2024-11-25T15:11:07Z","snapshot_observed_at":"2026-08-12T13:02:57.923400Z","submitted_at":"2024-11-25T15:11:07Z","title":"Generating social networks with static and dynamic utility-maximization approaches","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T13:14:33.474695Z"},"links":{"citing_paper":"/paper/2411.16464"},"observation_digest":"sha256:69af917726ca1ec6dd60d6ac82537156d0d7b3a50201eb997dbf6f1f93ccb87a","observation_id":"a1023e3f-96a2-4fed-bb51-26269ddca503","resolution":{"observed_at":"2026-08-12T13:14:33.749218Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2109.03343","last_updated":"2022-02-10T07:14:21Z","snapshot_observed_at":"2026-07-06T11:45:24.981916Z","submitted_at":"2021-09-07T21:27:38Z","title":"Latent Space Network Modelling with Hyperbolic and Spherical Geometries","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2109.03343","snapshot_observed_at":"2026-08-12T13:14:33.478811Z","title":"Papamichalis, K","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.16464","last_updated":"2024-11-25T15:11:07Z","snapshot_observed_at":"2026-08-12T13:02:57.923400Z","submitted_at":"2024-11-25T15:11:07Z","title":"Generating social networks with static and dynamic utility-maximization approaches","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T13:14:33.478811Z"},"links":{"cited_paper":"/paper/2109.03343","citing_paper":"/paper/2411.16464"},"observation_digest":"sha256:6bba60e391191bdc0ce4c35932fcd7167bbf0669b4201f669f014e6c32ba8e60","observation_id":"6c20da4b-c455-4e3a-86ed-7ca384671189","resolution":{"observed_at":"2026-08-12T13:14:33.478811Z","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-12T13:14:34.154839Z","title":null,"venue":null,"work_id":"75170784-7672-41a2-bbc2-ae3530d6b449","year":2024},"citing_paper":{"arxiv_id":"2411.16464","last_updated":"2024-11-25T15:11:07Z","snapshot_observed_at":"2026-08-12T13:02:57.923400Z","submitted_at":"2024-11-25T15:11:07Z","title":"Generating social networks with static and dynamic utility-maximization approaches","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T13:14:33.483419Z"},"links":{"citing_paper":"/paper/2411.16464"},"observation_digest":"sha256:3c9da0062405d84a78d241fd698f3fffb68fe85193d3eb7f15227390d7b4123d","observation_id":"228af32d-4e01-486e-8cd1-05bd013f5f81","resolution":{"observed_at":"2026-08-12T13:14:34.158422Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:14:34.144266Z","title":null,"venue":null,"work_id":"3f4f9fba-0eed-45ec-850d-bcf7148789a8","year":2006},"citing_paper":{"arxiv_id":"2411.16464","last_updated":"2024-11-25T15:11:07Z","snapshot_observed_at":"2026-08-12T13:02:57.923400Z","submitted_at":"2024-11-25T15:11:07Z","title":"Generating social networks with static and dynamic utility-maximization approaches","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T13:14:33.488555Z"},"links":{"citing_paper":"/paper/2411.16464"},"observation_digest":"sha256:320a633948f5dadfbe746f5b7e9253c0545a7dbf824373522518403d3bc57bba","observation_id":"6a97c9be-b34c-4ce3-9d4a-213f16ceb767","resolution":{"observed_at":"2026-08-12T13:14:34.147750Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:14:34.132329Z","title":"De Caux, C","venue":null,"work_id":"efa76d66-3787-4a13-8c7c-1c4635f217db","year":2014},"citing_paper":{"arxiv_id":"2411.16464","last_updated":"2024-11-25T15:11:07Z","snapshot_observed_at":"2026-08-12T13:02:57.923400Z","submitted_at":"2024-11-25T15:11:07Z","title":"Generating social networks with static and dynamic utility-maximization approaches","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T13:14:33.494001Z"},"links":{"citing_paper":"/paper/2411.16464"},"observation_digest":"sha256:97eab35cf4495b6bccb6913f7ec28b5f9272c1e3bfa9ca5a7529022f9fbbe638","observation_id":"af64dec9-e98a-4d90-89ad-e138f39d8850","resolution":{"observed_at":"2026-08-12T13:14:34.136591Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:14:34.119806Z","title":"Klopp, A","venue":null,"work_id":"3ccb06f1-1fca-4fc7-9fd3-e1590b93c02c","year":2017},"citing_paper":{"arxiv_id":"2411.16464","last_updated":"2024-11-25T15:11:07Z","snapshot_observed_at":"2026-08-12T13:02:57.923400Z","submitted_at":"2024-11-25T15:11:07Z","title":"Generating social networks with static and dynamic utility-maximization approaches","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T13:14:33.497909Z"},"links":{"citing_paper":"/paper/2411.16464"},"observation_digest":"sha256:7913ab02f100ede6b7d1197219ca635a5fc5eef3d842ae0f9d1f1322770e5ae3","observation_id":"8db5bd42-59c0-448a-ae6e-b0203e026261","resolution":{"observed_at":"2026-08-12T13:14:34.124371Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:14:34.108792Z","title":"Klopp and N","venue":null,"work_id":"b5f62281-8417-4078-9d53-8dda5249af9c","year":2019},"citing_paper":{"arxiv_id":"2411.16464","last_updated":"2024-11-25T15:11:07Z","snapshot_observed_at":"2026-08-12T13:02:57.923400Z","submitted_at":"2024-11-25T15:11:07Z","title":"Generating social networks with static and dynamic utility-maximization approaches","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T13:14:33.501657Z"},"links":{"citing_paper":"/paper/2411.16464"},"observation_digest":"sha256:3cf3cf93279e7f0e7853208148c637be40adb52aab61237ad520e31433bac90d","observation_id":"c33e75ad-eae8-42fe-8f1a-179c047a6192","resolution":{"observed_at":"2026-08-12T13:14:34.112580Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:14:34.096829Z","title":null,"venue":null,"work_id":"da361557-4ecf-444c-9c26-43e2016baa43","year":null},"citing_paper":{"arxiv_id":"2411.16464","last_updated":"2024-11-25T15:11:07Z","snapshot_observed_at":"2026-08-12T13:02:57.923400Z","submitted_at":"2024-11-25T15:11:07Z","title":"Generating social networks with static and dynamic utility-maximization approaches","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T13:14:33.505648Z"},"links":{"citing_paper":"/paper/2411.16464"},"observation_digest":"sha256:7a45e9837dbae4fff66cf91dbb53dc46fe3cbcb9c819c034af68d37944762198","observation_id":"a5f17cc9-60de-4e9b-b24d-d386f6250279","resolution":{"observed_at":"2026-08-12T13:14:34.100815Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:14:33.509774Z","title":null,"venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2411.16464","last_updated":"2024-11-25T15:11:07Z","snapshot_observed_at":"2026-08-12T13:02:57.923400Z","submitted_at":"2024-11-25T15:11:07Z","title":"Generating social networks with static and dynamic utility-maximization approaches","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T13:14:33.509774Z"},"links":{"citing_paper":"/paper/2411.16464"},"observation_digest":"sha256:825d01930d94f29dc5eb4b9f1719fd8a6e5e3b974b096f6dcbda75a566b2d1ff","observation_id":"4a269d56-bbf9-4c87-9e2b-7ee030db78bf","resolution":{"observed_at":"2026-08-12T13:14:33.509774Z","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-12T13:14:34.085013Z","title":"Hellmann and M","venue":null,"work_id":"098d05f7-a1b9-4e03-9bd6-828fde214f14","year":2014},"citing_paper":{"arxiv_id":"2411.16464","last_updated":"2024-11-25T15:11:07Z","snapshot_observed_at":"2026-08-12T13:02:57.923400Z","submitted_at":"2024-11-25T15:11:07Z","title":"Generating social networks with static and dynamic utility-maximization approaches","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T13:14:33.630724Z"},"links":{"citing_paper":"/paper/2411.16464"},"observation_digest":"sha256:b124d5c261696545fd056ca130238ee996d4c730b8e2fd43a77ec85d382f4541","observation_id":"d475985c-a45e-4a8f-9e58-5eddaef55e32","resolution":{"observed_at":"2026-08-12T13:14:34.089454Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:14:34.073459Z","title":null,"venue":null,"work_id":"d8b24196-2a51-4f62-9204-8bba6b2532c6","year":2007},"citing_paper":{"arxiv_id":"2411.16464","last_updated":"2024-11-25T15:11:07Z","snapshot_observed_at":"2026-08-12T13:02:57.923400Z","submitted_at":"2024-11-25T15:11:07Z","title":"Generating social networks with static and dynamic utility-maximization approaches","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T13:14:33.634406Z"},"links":{"citing_paper":"/paper/2411.16464"},"observation_digest":"sha256:1ac8579ffc66a2f741c4c79dc1f1bffc11fdf4c619a47d26b6ed4804f3e042f5","observation_id":"f42d5fa9-6d69-49dc-a2c2-63f68470c159","resolution":{"observed_at":"2026-08-12T13:14:34.077320Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:14:34.061274Z","title":null,"venue":null,"work_id":"c5b8ce2f-00c5-427f-b709-a5c4c9131174","year":2011},"citing_paper":{"arxiv_id":"2411.16464","last_updated":"2024-11-25T15:11:07Z","snapshot_observed_at":"2026-08-12T13:02:57.923400Z","submitted_at":"2024-11-25T15:11:07Z","title":"Generating social networks with static and dynamic utility-maximization approaches","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-12T13:14:33.637837Z"},"links":{"citing_paper":"/paper/2411.16464"},"observation_digest":"sha256:b7bd5ddb6b3de38dc79ab12d37c8933c35a3f67c3caf1323e4c8c8e2489ba905","observation_id":"e297e103-2cdd-4ce7-9eb6-932e85855f8d","resolution":{"observed_at":"2026-08-12T13:14:34.065156Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:14:34.048270Z","title":"Bonacich, Power and centrality: A family of measures, American journal of sociology 92, 1170 (1987)","venue":null,"work_id":"9b2df0c6-d0fd-4104-8f67-92574f276b5f","year":1987},"citing_paper":{"arxiv_id":"2411.16464","last_updated":"2024-11-25T15:11:07Z","snapshot_observed_at":"2026-08-12T13:02:57.923400Z","submitted_at":"2024-11-25T15:11:07Z","title":"Generating social networks with static and dynamic utility-maximization approaches","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-12T13:14:33.641452Z"},"links":{"citing_paper":"/paper/2411.16464"},"observation_digest":"sha256:8747677864c2b6f043a1a52d0878576cc40b2e5b478ba46291aee779a8f42ea5","observation_id":"9d200c6f-a183-4b8b-86ef-ba30d7e7f3c5","resolution":{"observed_at":"2026-08-12T13:14:34.051769Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:14:34.035979Z","title":"Tesfatsion, A trade network game with endogenous partner selection, in Computational approaches to eco- nomic problems (Springer, 1997) pp","venue":null,"work_id":"d24a3909-192d-4d47-9a8b-44cd5acf62b9","year":1997},"citing_paper":{"arxiv_id":"2411.16464","last_updated":"2024-11-25T15:11:07Z","snapshot_observed_at":"2026-08-12T13:02:57.923400Z","submitted_at":"2024-11-25T15:11:07Z","title":"Generating social networks with static and dynamic utility-maximization approaches","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-12T13:14:33.645308Z"},"links":{"citing_paper":"/paper/2411.16464"},"observation_digest":"sha256:29aad2b9dfbb9970d7f65a5b7fa1071f2c9dc3a72d977b19041879c9f6fe3346","observation_id":"aad860ea-de22-4108-bc8a-a540ba130045","resolution":{"observed_at":"2026-08-12T13:14:34.040450Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:14:34.022850Z","title":null,"venue":null,"work_id":"b4c8f825-b218-4a7f-8691-01f9141f22ee","year":2017},"citing_paper":{"arxiv_id":"2411.16464","last_updated":"2024-11-25T15:11:07Z","snapshot_observed_at":"2026-08-12T13:02:57.923400Z","submitted_at":"2024-11-25T15:11:07Z","title":"Generating social networks with static and dynamic utility-maximization approaches","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-12T13:14:33.649186Z"},"links":{"citing_paper":"/paper/2411.16464"},"observation_digest":"sha256:61d72530c34e8a6549997d059a7f3d1573eeb37fc6ec713e9f5bc64183d1e1e0","observation_id":"1fc0419f-c35c-4aab-b226-4288e8e2c316","resolution":{"observed_at":"2026-08-12T13:14:34.027108Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:14:34.009947Z","title":"Kunegis, KONECT – The Koblenz Network Collec- tion, in Proc","venue":null,"work_id":"85d59565-626f-4ec2-b1b0-26189005d9b4","year":2013},"citing_paper":{"arxiv_id":"2411.16464","last_updated":"2024-11-25T15:11:07Z","snapshot_observed_at":"2026-08-12T13:02:57.923400Z","submitted_at":"2024-11-25T15:11:07Z","title":"Generating social networks with static and dynamic utility-maximization approaches","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-12T13:14:33.653081Z"},"links":{"citing_paper":"/paper/2411.16464"},"observation_digest":"sha256:ce87a003bfb682709c6d12d4ed2162f9dfe9dd43a8dcc38b1954a50107932ae0","observation_id":"72960471-858d-4ada-ba53-b0103d7b5e3e","resolution":{"observed_at":"2026-08-12T13:14:34.014255Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:14:33.996906Z","title":null,"venue":null,"work_id":"3e21422f-9184-427a-9b74-0541d7e7c2b2","year":2014},"citing_paper":{"arxiv_id":"2411.16464","last_updated":"2024-11-25T15:11:07Z","snapshot_observed_at":"2026-08-12T13:02:57.923400Z","submitted_at":"2024-11-25T15:11:07Z","title":"Generating social networks with static and dynamic utility-maximization approaches","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-12T13:14:33.657416Z"},"links":{"citing_paper":"/paper/2411.16464"},"observation_digest":"sha256:72d979eae10cf1dc69365db2602e68237288f73b1f6408c8da5cf854d1e5fb85","observation_id":"dc803417-f30b-47a1-b3ff-587f032ef150","resolution":{"observed_at":"2026-08-12T13:14:34.001305Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:14:33.986061Z","title":null,"venue":null,"work_id":"49d76f57-a101-4708-b7c3-bbacec757a2c","year":2016},"citing_paper":{"arxiv_id":"2411.16464","last_updated":"2024-11-25T15:11:07Z","snapshot_observed_at":"2026-08-12T13:02:57.923400Z","submitted_at":"2024-11-25T15:11:07Z","title":"Generating social networks with static and dynamic utility-maximization approaches","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-12T13:14:33.661406Z"},"links":{"citing_paper":"/paper/2411.16464"},"observation_digest":"sha256:cc45a5ae077b364b43f22dc3a3644055c0173788101779fdd100425c50d0e4fd","observation_id":"ac40f8ba-686e-4eaa-84f7-2230a23bc245","resolution":{"observed_at":"2026-08-12T13:14:33.990012Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:14:33.975689Z","title":"Johnson, Epidemic modelling requires knowledge of the social network, Journal of Physics: Complexity 5, 01LT01 (2024)","venue":null,"work_id":"1ce13b7b-1490-4f1e-ac81-f3443893e794","year":2024},"citing_paper":{"arxiv_id":"2411.16464","last_updated":"2024-11-25T15:11:07Z","snapshot_observed_at":"2026-08-12T13:02:57.923400Z","submitted_at":"2024-11-25T15:11:07Z","title":"Generating social networks with static and dynamic utility-maximization approaches","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-12T13:14:33.665192Z"},"links":{"citing_paper":"/paper/2411.16464"},"observation_digest":"sha256:4a17d0d25313d6815f8699cf4b45089176f74593babb0235c4cf1f31a1118be8","observation_id":"7f19963b-77d4-4f80-88db-c817cb104219","resolution":{"observed_at":"2026-08-12T13:14:33.979191Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:14:33.965222Z","title":"For a given I ∈ N∗, a utility function U (α, C) is an element of UI , the set of applications U : RI−1 × (R∗ +)I−1 − →R with [0, 1) ⊆ R ⊆R, and RI−1 convex","venue":null,"work_id":"3fc60a5a-c78a-4e39-aaa6-e6ad395298d9","year":null},"citing_paper":{"arxiv_id":"2411.16464","last_updated":"2024-11-25T15:11:07Z","snapshot_observed_at":"2026-08-12T13:02:57.923400Z","submitted_at":"2024-11-25T15:11:07Z","title":"Generating social networks with static and dynamic utility-maximization approaches","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-12T13:14:33.668884Z"},"links":{"citing_paper":"/paper/2411.16464"},"observation_digest":"sha256:e95c99e89039216626bcbc23c1d828ab87f0192ae368299e798809a2ea1a1b58","observation_id":"8f9a3def-851d-4989-9d33-66abf06fb597","resolution":{"observed_at":"2026-08-12T13:14:33.968810Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:14:33.954301Z","title":null,"venue":null,"work_id":"5497ff11-c7d5-45cc-a4c7-639d57f73c45","year":null},"citing_paper":{"arxiv_id":"2411.16464","last_updated":"2024-11-25T15:11:07Z","snapshot_observed_at":"2026-08-12T13:02:57.923400Z","submitted_at":"2024-11-25T15:11:07Z","title":"Generating social networks with static and dynamic utility-maximization approaches","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-12T13:14:33.673190Z"},"links":{"citing_paper":"/paper/2411.16464"},"observation_digest":"sha256:e1111506bd176b8f5049303a064d41a86a145c23a7e82f610f6fce332c672213","observation_id":"aa116277-4344-44fa-af31-616419c4e787","resolution":{"observed_at":"2026-08-12T13:14:33.958026Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:14:33.942057Z","title":"∀i, ∂U ∂αi = H(ci, αi) + S(α) 3","venue":null,"work_id":"21dbb989-2c9b-43ef-b8d6-55991d609b14","year":null},"citing_paper":{"arxiv_id":"2411.16464","last_updated":"2024-11-25T15:11:07Z","snapshot_observed_at":"2026-08-12T13:02:57.923400Z","submitted_at":"2024-11-25T15:11:07Z","title":"Generating social networks with static and dynamic utility-maximization approaches","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-12T13:14:33.677614Z"},"links":{"citing_paper":"/paper/2411.16464"},"observation_digest":"sha256:f5a800bfbbd2bc41ff8e1fa12a8171892e893c194e77840e3513931eb0e20e7a","observation_id":"8581c0dc-8aa7-42ca-ba61-8069de5df0e5","resolution":{"observed_at":"2026-08-12T13:14:33.946073Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:14:33.929698Z","title":"For a given individuals graph GN (I , α, C), we define for all individual i ∈ J1..N K the Individual Optimization Problem (IOP) as: ( argmaxαi Ui(αi, Ci) s.t","venue":null,"work_id":"40f060dd-c844-42f8-94e3-e8fe0369026b","year":null},"citing_paper":{"arxiv_id":"2411.16464","last_updated":"2024-11-25T15:11:07Z","snapshot_observed_at":"2026-08-12T13:02:57.923400Z","submitted_at":"2024-11-25T15:11:07Z","title":"Generating social networks with static and dynamic utility-maximization approaches","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-12T13:14:33.681827Z"},"links":{"citing_paper":"/paper/2411.16464"},"observation_digest":"sha256:4061b6c9fa663274cd05529d9b215ce25c7cea722837b3c56998cfd14b3e9226","observation_id":"d67c3587-382c-4836-b6de-daf5f4d72649","resolution":{"observed_at":"2026-08-12T13:14:33.933963Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:14:34.302824Z","title":"∀i ∈ J1..N K, Ci ∈ S (¯c), with S (¯c) the symmetric group of ¯c","venue":null,"work_id":"e8fce234-803c-4496-9c4a-d7ff2699e1be","year":null},"citing_paper":{"arxiv_id":"2411.16464","last_updated":"2024-11-25T15:11:07Z","snapshot_observed_at":"2026-08-12T13:02:57.923400Z","submitted_at":"2024-11-25T15:11:07Z","title":"Generating social networks with static and dynamic utility-maximization approaches","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-12T13:14:33.686656Z"},"links":{"citing_paper":"/paper/2411.16464"},"observation_digest":"sha256:c25b0436c88207dfbe758940d6b1392a827db25348bb8a1a3bc9eb2642bd6c59","observation_id":"c9b16d4d-582a-4007-a321-fcdbc3c73e8e","resolution":{"observed_at":"2026-08-12T13:14:34.306922Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:14:33.916334Z","title":"Moreover, α∗∗ the solution of the associated SOP, verifies: ∀(i, j) ∈ J1..N K2, α∗∗ i,j = (αmax {i,j})∗ min {i,j} Proof (Theorem 8)","venue":null,"work_id":"16c6a3c0-7e74-41be-abd8-b1f66eac195e","year":null},"citing_paper":{"arxiv_id":"2411.16464","last_updated":"2024-11-25T15:11:07Z","snapshot_observed_at":"2026-08-12T13:02:57.923400Z","submitted_at":"2024-11-25T15:11:07Z","title":"Generating social networks with static and dynamic utility-maximization approaches","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-12T13:14:33.691406Z"},"links":{"citing_paper":"/paper/2411.16464"},"observation_digest":"sha256:4f31a1c6f4a29347af90e0dab65f59290eb6ddb96f4284e1b4bbd298d2e955a3","observation_id":"cadf3426-3a6d-4338-92cd-ef3aad40bf3d","resolution":{"observed_at":"2026-08-12T13:14:33.920996Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:14:34.339416Z","title":null,"venue":null,"work_id":"07b55fcb-1492-458d-a777-0442cc61eb2b","year":null},"citing_paper":{"arxiv_id":"2411.16464","last_updated":"2024-11-25T15:11:07Z","snapshot_observed_at":"2026-08-12T13:02:57.923400Z","submitted_at":"2024-11-25T15:11:07Z","title":"Generating social networks with static and dynamic utility-maximization approaches","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-12T13:14:33.696888Z"},"links":{"citing_paper":"/paper/2411.16464"},"observation_digest":"sha256:0e085e8588c8829ed1e313f1cb067aa6690e434a3294ed7c121bb32aac3c62f6","observation_id":"fcda397e-192c-4571-bbc5-573f2a6320c1","resolution":{"observed_at":"2026-08-12T13:14:34.342938Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:14:33.904288Z","title":"C = ( C ∈ (R∗ +)nI , c ij ∈ ( {¯cij} if αij > 0 (0, ¯cij] if αij = 0 ) Proof (Theorem 9)","venue":null,"work_id":"0eb0382c-243a-43ed-a80b-78e205d39628","year":1996},"citing_paper":{"arxiv_id":"2411.16464","last_updated":"2024-11-25T15:11:07Z","snapshot_observed_at":"2026-08-12T13:02:57.923400Z","submitted_at":"2024-11-25T15:11:07Z","title":"Generating social networks with static and dynamic utility-maximization approaches","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-12T13:14:33.700884Z"},"links":{"citing_paper":"/paper/2411.16464"},"observation_digest":"sha256:7e637cea2b6f33c40b14402a46d2dca83b2bebc51aa34eea7d0dcdcfed080831","observation_id":"5c80a84d-330a-4e2c-8de5-928fe7249ebf","resolution":{"observed_at":"2026-08-12T13:14:33.908328Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:14:33.891620Z","title":null,"venue":null,"work_id":"8bcc43e4-323e-45ee-a545-001dbae58d02","year":null},"citing_paper":{"arxiv_id":"2411.16464","last_updated":"2024-11-25T15:11:07Z","snapshot_observed_at":"2026-08-12T13:02:57.923400Z","submitted_at":"2024-11-25T15:11:07Z","title":"Generating social networks with static and dynamic utility-maximization approaches","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-12T13:14:33.704683Z"},"links":{"citing_paper":"/paper/2411.16464"},"observation_digest":"sha256:e8a9d3ef046eb18860272a6dffdad6c4a399551930e730cbd7584240d543ab1d","observation_id":"1fb8e300-d43c-433b-aad0-9c0c35dc3b80","resolution":{"observed_at":"2026-08-12T13:14:33.895728Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:14:33.878826Z","title":"Every graph G(I , α, C) that is solution of the Social Optimization Problem (Definition 10) is pair- wise stable","venue":null,"work_id":"f17c3366-5ae3-4f3c-9008-1b7fbdf4c2b4","year":null},"citing_paper":{"arxiv_id":"2411.16464","last_updated":"2024-11-25T15:11:07Z","snapshot_observed_at":"2026-08-12T13:02:57.923400Z","submitted_at":"2024-11-25T15:11:07Z","title":"Generating social networks with static and dynamic utility-maximization approaches","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-12T13:14:33.708814Z"},"links":{"citing_paper":"/paper/2411.16464"},"observation_digest":"sha256:5b278b3ab3aaf211a0d27c174b21db9b13ac8f340da02ef037fb5a27744f78a0","observation_id":"762549e6-96b4-4963-9f7d-6ab0fe42e259","resolution":{"observed_at":"2026-08-12T13:14:33.883078Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:14:33.867408Z","title":null,"venue":null,"work_id":"3a8ed87f-844f-412e-9ec0-55a836677ba7","year":null},"citing_paper":{"arxiv_id":"2411.16464","last_updated":"2024-11-25T15:11:07Z","snapshot_observed_at":"2026-08-12T13:02:57.923400Z","submitted_at":"2024-11-25T15:11:07Z","title":"Generating social networks with static and dynamic utility-maximization approaches","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-12T13:14:33.713563Z"},"links":{"citing_paper":"/paper/2411.16464"},"observation_digest":"sha256:53df66f1e90e087b181400843ffd50d2e4c39cb3ee7e27e7a193824ebed0fcc1","observation_id":"aa36d775-d427-4c71-b212-64b535338950","resolution":{"observed_at":"2026-08-12T13:14:33.871305Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.16464","last_updated":"2024-11-25T15:11:07Z","latest_version":1,"primary_category":"math.PR","snapshot_observed_at":"2026-08-12T13:02:57.923400Z","submitted_at":"2024-11-25T15:11:07Z","title":"Generating social networks with static and dynamic utility-maximization approaches"},"reference_resolution":{"displayed":46,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":21,"verified_exact":2,"verified_fuzzy":22},"total_outbound_references":46},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 46 of 46 outbound references and 0 inbound Pith citation observations for arXiv:2411.16464."}