{"as_of":"2026-08-14T14:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e8079f4b65fba11e063d215cf3601c9751dfc0d55511ec73c11474bda1ea6867","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-01T05:03:44.764040Z","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-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/2607.22383/citation-record","integrity":"/paper/2607.22383/integrity","json":"/paper/2607.22383/citation-record.json","paper":"/paper/2607.22383"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:03:36.946643Z","title":"Limits of multi-relational graphs","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.22383","last_updated":"2026-07-24T15:08:24Z","snapshot_observed_at":"2026-08-12T14:48:28.857766Z","submitted_at":"2026-07-24T15:08:24Z","title":"Constrained Multi-Relational Graphons with Maximum Entropy","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T05:03:36.946643Z"},"links":{"citing_paper":"/paper/2607.22383"},"observation_digest":"sha256:69262d8804846d4081b2cc6ce5f84e41ece9f22c5628b3dbc087b962bc99fa1b","observation_id":"2275394d-f882-4ba0-9d1e-890e4d98532e","resolution":{"observed_at":"2026-08-01T05:03:36.946643Z","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-01T05:03:37.067141Z","title":"Bose-einstein condensation in complex networks.Physical review letters, 86(24):5632, 2001","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.22383","last_updated":"2026-07-24T15:08:24Z","snapshot_observed_at":"2026-08-12T14:48:28.857766Z","submitted_at":"2026-07-24T15:08:24Z","title":"Constrained Multi-Relational Graphons with Maximum Entropy","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-01T05:03:37.067141Z"},"links":{"citing_paper":"/paper/2607.22383"},"observation_digest":"sha256:8b79a3e6728c0d501b183c0e6e6c9e88ef03de0a76f31f116d48e97ddab2d895","observation_id":"a4e1578f-e9ab-466c-a1bf-e995196c24db","resolution":{"observed_at":"2026-08-01T05:03:37.067141Z","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-01T05:03:37.223608Z","title":"A nonparametric view of network models and newman–girvan and other modularities.Proceedings of the National Academy of Sciences, 106(50):21068–21073, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.22383","last_updated":"2026-07-24T15:08:24Z","snapshot_observed_at":"2026-08-12T14:48:28.857766Z","submitted_at":"2026-07-24T15:08:24Z","title":"Constrained Multi-Relational Graphons with Maximum Entropy","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-01T05:03:37.223608Z"},"links":{"citing_paper":"/paper/2607.22383"},"observation_digest":"sha256:a64d95304457a7a675a87696ca85296f73d5ad8383968202d7605903631f4d7b","observation_id":"b6461fff-f00d-469d-bf13-83ca7d0f45fb","resolution":{"observed_at":"2026-08-01T05:03:37.223608Z","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-01T05:03:37.451884Z","title":"The structure and dynamics of multilayer networks.Physics Reports, 544(1):1–122, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.22383","last_updated":"2026-07-24T15:08:24Z","snapshot_observed_at":"2026-08-12T14:48:28.857766Z","submitted_at":"2026-07-24T15:08:24Z","title":"Constrained Multi-Relational Graphons with Maximum Entropy","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T05:03:37.451884Z"},"links":{"citing_paper":"/paper/2607.22383"},"observation_digest":"sha256:e493e54dc8fa3a3d5df5c19efa6ca8f9d1a2d826e5338e4244176567e0eef36b","observation_id":"c84511ee-e0ff-4708-89fb-06b3f1b1c870","resolution":{"observed_at":"2026-08-01T05:03:37.451884Z","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-01T05:03:37.653834Z","title":"Pattern formation in random networks using graphons.SIAM Journal on Mathematical Analysis, 55(3):2150–2185, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.22383","last_updated":"2026-07-24T15:08:24Z","snapshot_observed_at":"2026-08-12T14:48:28.857766Z","submitted_at":"2026-07-24T15:08:24Z","title":"Constrained Multi-Relational Graphons with Maximum Entropy","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T05:03:37.653834Z"},"links":{"citing_paper":"/paper/2607.22383"},"observation_digest":"sha256:11e34af79ad19c5e90883a262263c17ad81d6341b6fa0519b92a92d4f30bd6bf","observation_id":"3ad31cce-bae5-4aa3-8ee2-5b8bba9cc23d","resolution":{"observed_at":"2026-08-01T05:03:37.653834Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.13822","last_updated":"2024-09-16T05:15:46Z","snapshot_observed_at":"2026-08-13T00:25:04.500832Z","submitted_at":"2024-04-22T01:53:25Z","title":"Higher-Order Graphon Theory: Fluctuations, Degeneracies, and Inference","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.13822","snapshot_observed_at":"2026-08-01T05:03:37.905300Z","title":"Higher- order graphon theory: Fluctuations, degeneracies, and inference.arXiv preprint arXiv:2404.13822, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22383","last_updated":"2026-07-24T15:08:24Z","snapshot_observed_at":"2026-08-12T14:48:28.857766Z","submitted_at":"2026-07-24T15:08:24Z","title":"Constrained Multi-Relational Graphons with Maximum Entropy","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T05:03:37.905300Z"},"links":{"cited_paper":"/paper/2404.13822","citing_paper":"/paper/2607.22383"},"observation_digest":"sha256:d209c935ed54d3bf49710b165aa6676ca7107ad91731b4bdd079a320a87e7ec6","observation_id":"1578352f-6ad0-44d6-910e-c752a39fc25b","resolution":{"observed_at":"2026-08-01T05:03:37.905300Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.12339","last_updated":"2026-07-25T10:42:01Z","snapshot_observed_at":"2026-08-12T22:59:20.699881Z","submitted_at":"2024-08-22T12:35:13Z","title":"Graphon estimation beyond binary edges: inference for decorated graphs with applications to multiplex and weighted networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.12339","snapshot_observed_at":"2026-08-01T05:03:38.143834Z","title":"Inference for decorated graphs and applica- tion to multiplex networks.arXiv preprint arXiv:2408.12339, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22383","last_updated":"2026-07-24T15:08:24Z","snapshot_observed_at":"2026-08-12T14:48:28.857766Z","submitted_at":"2026-07-24T15:08:24Z","title":"Constrained Multi-Relational Graphons with Maximum Entropy","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T05:03:38.143834Z"},"links":{"cited_paper":"/paper/2408.12339","citing_paper":"/paper/2607.22383"},"observation_digest":"sha256:2a26812f06604c1e3a4308c23e6f427024427a903e415143e49f80eaa6e6383c","observation_id":"c2228855-e57e-48a7-a02c-331a3075b7e1","resolution":{"observed_at":"2026-08-01T05:03:38.143834Z","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-01T05:03:38.306144Z","title":"Markovgraphs.JournaloftheamericanStatistical association, 81(395):832–842, 1986","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2607.22383","last_updated":"2026-07-24T15:08:24Z","snapshot_observed_at":"2026-08-12T14:48:28.857766Z","submitted_at":"2026-07-24T15:08:24Z","title":"Constrained Multi-Relational Graphons with Maximum Entropy","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T05:03:38.306144Z"},"links":{"citing_paper":"/paper/2607.22383"},"observation_digest":"sha256:1e3b34578a358ab315f09a805ede05accbecc8385852b312c6521c244e705303","observation_id":"9d4ce260-bfbf-473d-9f6d-76d817457710","resolution":{"observed_at":"2026-08-01T05:03:38.306144Z","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-01T05:03:38.560556Z","title":"Rate-optimal graphon estimation.The Annals of Statistics, 43(6):2624–2652, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.22383","last_updated":"2026-07-24T15:08:24Z","snapshot_observed_at":"2026-08-12T14:48:28.857766Z","submitted_at":"2026-07-24T15:08:24Z","title":"Constrained Multi-Relational Graphons with Maximum Entropy","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T05:03:38.560556Z"},"links":{"citing_paper":"/paper/2607.22383"},"observation_digest":"sha256:4830285586449a39d7566a4c1e6d7ed40f8628af25ba42f7b9ac8569dd40b28c","observation_id":"065d5145-717c-4019-bae6-d32f125a0855","resolution":{"observed_at":"2026-08-01T05:03:38.560556Z","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-01T05:03:38.726829Z","title":"Elusive extremal graphs.Proceedings of the London Mathematical Society, 121(6):1685–1736, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.22383","last_updated":"2026-07-24T15:08:24Z","snapshot_observed_at":"2026-08-12T14:48:28.857766Z","submitted_at":"2026-07-24T15:08:24Z","title":"Constrained Multi-Relational Graphons with Maximum Entropy","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T05:03:38.726829Z"},"links":{"citing_paper":"/paper/2607.22383"},"observation_digest":"sha256:cba273677e49a29dc154a65392f39efe1d61067692bf3367badc34232888eec2","observation_id":"4a505dc7-13e4-4753-bf01-e2da5434f883","resolution":{"observed_at":"2026-08-01T05:03:38.726829Z","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-01T05:03:38.945291Z","title":"Stochastic blockmodels: First steps.Social networks, 5(2):109–137, 1983","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2607.22383","last_updated":"2026-07-24T15:08:24Z","snapshot_observed_at":"2026-08-12T14:48:28.857766Z","submitted_at":"2026-07-24T15:08:24Z","title":"Constrained Multi-Relational Graphons with Maximum Entropy","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T05:03:38.945291Z"},"links":{"citing_paper":"/paper/2607.22383"},"observation_digest":"sha256:dda71ae4aec7c4e4c45332de7ce11e11b1b61a11183f0bfb31a1df789f48ffac","observation_id":"486bd91b-7b43-4d2a-9aba-d6fe51dda19a","resolution":{"observed_at":"2026-08-01T05:03:38.945291Z","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-01T05:03:39.085783Z","title":"The economic conse- quences of social-network structure.Journal of Economic Literature, 55(1):49– 95, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.22383","last_updated":"2026-07-24T15:08:24Z","snapshot_observed_at":"2026-08-12T14:48:28.857766Z","submitted_at":"2026-07-24T15:08:24Z","title":"Constrained Multi-Relational Graphons with Maximum Entropy","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T05:03:39.085783Z"},"links":{"citing_paper":"/paper/2607.22383"},"observation_digest":"sha256:60e9fe9c86ac7215ae02b6eb9137e98aaf63a9f9290f24a7b2750e23ff1743b3","observation_id":"ea30f218-aa37-43c4-a7f1-2fa131796b99","resolution":{"observed_at":"2026-08-01T05:03:39.085783Z","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-01T05:03:39.244202Z","title":"Spinger, 2006","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.22383","last_updated":"2026-07-24T15:08:24Z","snapshot_observed_at":"2026-08-12T14:48:28.857766Z","submitted_at":"2026-07-24T15:08:24Z","title":"Constrained Multi-Relational Graphons with Maximum Entropy","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T05:03:39.244202Z"},"links":{"citing_paper":"/paper/2607.22383"},"observation_digest":"sha256:ccbb6246ef6306e27f869d2fa720af782fe55e6de97a28a921a14bf2e3f1a7b6","observation_id":"bd4b20f5-3f0b-4f5c-87f8-9125b02dd28f","resolution":{"observed_at":"2026-08-01T05:03:39.244202Z","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-01T05:03:39.381940Z","title":"Springer Science & Business Media, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.22383","last_updated":"2026-07-24T15:08:24Z","snapshot_observed_at":"2026-08-12T14:48:28.857766Z","submitted_at":"2026-07-24T15:08:24Z","title":"Constrained Multi-Relational Graphons with Maximum Entropy","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-01T05:03:39.381940Z"},"links":{"citing_paper":"/paper/2607.22383"},"observation_digest":"sha256:8f295b42541014a9cf427e006f9dfdd05fcbf6a7e1495a773bfedea01d7020f5","observation_id":"02f55723-f266-4d62-9b23-6a7cb4ac093d","resolution":{"observed_at":"2026-08-01T05:03:39.381940Z","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-01T05:03:39.627767Z","title":"Bipodal structure in oversaturated random graphs.International Mathematics Research Notices, 2018(4):1009–1044, 2016","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.22383","last_updated":"2026-07-24T15:08:24Z","snapshot_observed_at":"2026-08-12T14:48:28.857766Z","submitted_at":"2026-07-24T15:08:24Z","title":"Constrained Multi-Relational Graphons with Maximum Entropy","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-01T05:03:39.627767Z"},"links":{"citing_paper":"/paper/2607.22383"},"observation_digest":"sha256:c9a4b56323ed157d15fedcba9af5778a2d620ce5c9b3b26f970dcda43c7854a0","observation_id":"f0ea668f-baa4-45cd-9511-4c0fa6a4c6a2","resolution":{"observed_at":"2026-08-01T05:03:39.627767Z","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-01T05:03:39.881502Z","title":"Multipodal struc- ture and phase transitions in large constrained graphs.Journal of Statistical Physics, 168(2):233–258, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.22383","last_updated":"2026-07-24T15:08:24Z","snapshot_observed_at":"2026-08-12T14:48:28.857766Z","submitted_at":"2026-07-24T15:08:24Z","title":"Constrained Multi-Relational Graphons with Maximum Entropy","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-01T05:03:39.881502Z"},"links":{"citing_paper":"/paper/2607.22383"},"observation_digest":"sha256:01618ec6d3a1dd6e740377aa891bc46da084419654e0693921af73b912456170","observation_id":"1736eeaf-230d-475d-837a-0a2f99336cd3","resolution":{"observed_at":"2026-08-01T05:03:39.881502Z","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-01T05:03:40.123675Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.22383","last_updated":"2026-07-24T15:08:24Z","snapshot_observed_at":"2026-08-12T14:48:28.857766Z","submitted_at":"2026-07-24T15:08:24Z","title":"Constrained Multi-Relational Graphons with Maximum Entropy","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-01T05:03:40.123675Z"},"links":{"citing_paper":"/paper/2607.22383"},"observation_digest":"sha256:2a66cfe0046b2696622e825962cd712e3e79eec80015403eb6783c3f0effca1e","observation_id":"7084fc78-ee12-42c1-94e9-6fa61d1d9bc5","resolution":{"observed_at":"2026-08-01T05:03:40.123675Z","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-01T05:03:40.345454Z","title":"Oracleinequalitiesfor network models and sparse graphon estimation.Annals of Statistics, 45(1):316– 354, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.22383","last_updated":"2026-07-24T15:08:24Z","snapshot_observed_at":"2026-08-12T14:48:28.857766Z","submitted_at":"2026-07-24T15:08:24Z","title":"Constrained Multi-Relational Graphons with Maximum Entropy","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T05:03:40.345454Z"},"links":{"citing_paper":"/paper/2607.22383"},"observation_digest":"sha256:859128226febe730880ee3bb918a21534d81baade7a2873380d63cf687f41188","observation_id":"1fc2da1d-969e-4977-9356-9123db453395","resolution":{"observed_at":"2026-08-01T05:03:40.345454Z","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-01T05:03:40.492985Z","title":"Springer, 2 edition, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.22383","last_updated":"2026-07-24T15:08:24Z","snapshot_observed_at":"2026-08-12T14:48:28.857766Z","submitted_at":"2026-07-24T15:08:24Z","title":"Constrained Multi-Relational Graphons with Maximum Entropy","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-01T05:03:40.492985Z"},"links":{"citing_paper":"/paper/2607.22383"},"observation_digest":"sha256:204317f90932b3535e19127002763b7317717abbf9a9d2227329d3d536badbfb","observation_id":"dcb3ac63-ce2d-4f5d-8ffd-e401fa394245","resolution":{"observed_at":"2026-08-01T05:03:40.492985Z","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-01T05:03:40.687818Z","title":"Emerginglandscapeof molecularinteractionnetworks: Opportunities,challengesandprospects.Journal of Biosciences, 47:24, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.22383","last_updated":"2026-07-24T15:08:24Z","snapshot_observed_at":"2026-08-12T14:48:28.857766Z","submitted_at":"2026-07-24T15:08:24Z","title":"Constrained Multi-Relational Graphons with Maximum Entropy","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-01T05:03:40.687818Z"},"links":{"citing_paper":"/paper/2607.22383"},"observation_digest":"sha256:5c8f53243dda84bf05fdb90623c01ca61310de3bde35384171aabe1931132d79","observation_id":"2e6df077-6453-4d3f-a12f-48f5e54e0d44","resolution":{"observed_at":"2026-08-01T05:03:40.687818Z","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-01T05:03:40.915234Z","title":"Elsevier, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.22383","last_updated":"2026-07-24T15:08:24Z","snapshot_observed_at":"2026-08-12T14:48:28.857766Z","submitted_at":"2026-07-24T15:08:24Z","title":"Constrained Multi-Relational Graphons with Maximum Entropy","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-01T05:03:40.915234Z"},"links":{"citing_paper":"/paper/2607.22383"},"observation_digest":"sha256:bd012fe866a6f9c5f745dffa324b4d1474cbac83274fb4a28d5665c864e2091e","observation_id":"6413dafe-e557-4f0c-afb8-45d19f4a0eb5","resolution":{"observed_at":"2026-08-01T05:03:40.915234Z","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-01T05:03:41.117654Z","title":"Springer, 2003","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.22383","last_updated":"2026-07-24T15:08:24Z","snapshot_observed_at":"2026-08-12T14:48:28.857766Z","submitted_at":"2026-07-24T15:08:24Z","title":"Constrained Multi-Relational Graphons with Maximum Entropy","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-01T05:03:41.117654Z"},"links":{"citing_paper":"/paper/2607.22383"},"observation_digest":"sha256:9dad591cc9cd88e2762701c5323be66ef66a457951a5d267dac4e674512f2083","observation_id":"8ae11c58-d0d9-4ba7-85a4-3fd3eacb6c2c","resolution":{"observed_at":"2026-08-01T05:03:41.117654Z","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-01T05:03:41.299159Z","title":"Dbpedia–a large-scale, multilingual knowledge base extracted from wikipedia.Semantic Web, 6(2):167–195, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.22383","last_updated":"2026-07-24T15:08:24Z","snapshot_observed_at":"2026-08-12T14:48:28.857766Z","submitted_at":"2026-07-24T15:08:24Z","title":"Constrained Multi-Relational Graphons with Maximum Entropy","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-01T05:03:41.299159Z"},"links":{"citing_paper":"/paper/2607.22383"},"observation_digest":"sha256:3a48f55b42787c7811ca17f0f3d39cb601cea53740c51049fd1dea1b59a5856d","observation_id":"a0d2b44c-260d-47cd-a6ba-3ab28e9e5609","resolution":{"observed_at":"2026-08-01T05:03:41.299159Z","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-01T05:03:41.543804Z","title":"Limits of dense graph sequences.Journal of Combinatorial Theory, Series B, 96(6):933–957, 2006","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.22383","last_updated":"2026-07-24T15:08:24Z","snapshot_observed_at":"2026-08-12T14:48:28.857766Z","submitted_at":"2026-07-24T15:08:24Z","title":"Constrained Multi-Relational Graphons with Maximum Entropy","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-01T05:03:41.543804Z"},"links":{"citing_paper":"/paper/2607.22383"},"observation_digest":"sha256:89446891aa50b943711cce068c83e4758961e5025e32efab921fadadefed3a48","observation_id":"3a5e32e0-22d3-4a12-868b-bcf61abd2ab5","resolution":{"observed_at":"2026-08-01T05:03:41.543804Z","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-01T05:03:41.744681Z","title":"Finitely forcible graphons.Journal of Com- binatorial Theory, Series B, 101(5):269–301, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.22383","last_updated":"2026-07-24T15:08:24Z","snapshot_observed_at":"2026-08-12T14:48:28.857766Z","submitted_at":"2026-07-24T15:08:24Z","title":"Constrained Multi-Relational Graphons with Maximum Entropy","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-01T05:03:41.744681Z"},"links":{"citing_paper":"/paper/2607.22383"},"observation_digest":"sha256:5c3e751058f07916432b4dae639f9dc832188aac674271a1c0764d9ffd5ff949","observation_id":"b2ad624f-8576-4b9c-b466-8dc5eed7281e","resolution":{"observed_at":"2026-08-01T05:03:41.744681Z","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-01T05:03:41.994660Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.22383","last_updated":"2026-07-24T15:08:24Z","snapshot_observed_at":"2026-08-12T14:48:28.857766Z","submitted_at":"2026-07-24T15:08:24Z","title":"Constrained Multi-Relational Graphons with Maximum Entropy","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-01T05:03:41.994660Z"},"links":{"citing_paper":"/paper/2607.22383"},"observation_digest":"sha256:1628cd003bcc4f539a1f9f9d4fb25110e9d76ccec64c5f52c77af9dc06ca79c3","observation_id":"ad4823ba-41e3-4de6-a5bc-bc4ff3f7b212","resolution":{"observed_at":"2026-08-01T05:03:41.994660Z","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-01T05:03:42.228368Z","title":"Yago3: Aknowl- edge base from multilingual wikipedias","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.22383","last_updated":"2026-07-24T15:08:24Z","snapshot_observed_at":"2026-08-12T14:48:28.857766Z","submitted_at":"2026-07-24T15:08:24Z","title":"Constrained Multi-Relational Graphons with Maximum Entropy","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-01T05:03:42.228368Z"},"links":{"citing_paper":"/paper/2607.22383"},"observation_digest":"sha256:08be59d8bcf7e00070853b34dc3d1ef6eb9f917f8515291bffec40ad567842ff","observation_id":"5db7f45d-1c39-49c3-a370-d07f8b75ecc4","resolution":{"observed_at":"2026-08-01T05:03:42.228368Z","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-01T05:03:42.395783Z","title":"Disease networks","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.22383","last_updated":"2026-07-24T15:08:24Z","snapshot_observed_at":"2026-08-12T14:48:28.857766Z","submitted_at":"2026-07-24T15:08:24Z","title":"Constrained Multi-Relational Graphons with Maximum Entropy","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-01T05:03:42.395783Z"},"links":{"citing_paper":"/paper/2607.22383"},"observation_digest":"sha256:5953a5f8dbc1da7f035fceeb14b7b6ebbbec5490321d3dec4b397e74b0582198","observation_id":"9f494dbb-a6eb-424b-8b20-0c60cfc369fd","resolution":{"observed_at":"2026-08-01T05:03:42.395783Z","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-01T05:03:42.588522Z","title":"Existence of a symmetric bipo- dal phase in the edge-triangle model.Journal of Physics A: Mathematical and Theoretical, 57(9):095003, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22383","last_updated":"2026-07-24T15:08:24Z","snapshot_observed_at":"2026-08-12T14:48:28.857766Z","submitted_at":"2026-07-24T15:08:24Z","title":"Constrained Multi-Relational Graphons with Maximum Entropy","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-01T05:03:42.588522Z"},"links":{"citing_paper":"/paper/2607.22383"},"observation_digest":"sha256:86c3d733ceb5aee4e7dd0083fff94a35f6f57b1c25b187f523f9506d8ebb09d8","observation_id":"16ecf32e-d9aa-4a03-896b-92fe89a68204","resolution":{"observed_at":"2026-08-01T05:03:42.588522Z","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-01T05:03:42.803359Z","title":"Graphongames: Astatisticalframework for network games and interventions.Econometrica, 91(1):191–225, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.22383","last_updated":"2026-07-24T15:08:24Z","snapshot_observed_at":"2026-08-12T14:48:28.857766Z","submitted_at":"2026-07-24T15:08:24Z","title":"Constrained Multi-Relational Graphons with Maximum Entropy","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-01T05:03:42.803359Z"},"links":{"citing_paper":"/paper/2607.22383"},"observation_digest":"sha256:c0634bf1fb456a28af8920295c0d0282ffe4ee353753d775a22d2ebb06fa0234","observation_id":"d71b403b-8dab-4a0c-80a7-7944db8c62b5","resolution":{"observed_at":"2026-08-01T05:03:42.803359Z","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-01T05:03:42.986227Z","title":"An empirical bayes approach to stochastic block- modelsandgraphons: shrinkageestimationandmodelselection.PeerJComputer Science, 8:e1006, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.22383","last_updated":"2026-07-24T15:08:24Z","snapshot_observed_at":"2026-08-12T14:48:28.857766Z","submitted_at":"2026-07-24T15:08:24Z","title":"Constrained Multi-Relational Graphons with Maximum Entropy","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-01T05:03:42.986227Z"},"links":{"citing_paper":"/paper/2607.22383"},"observation_digest":"sha256:275da0dc58f6bf9ffcb2456efb936af96ec7eeb1678f670a6c019e06f1a88193","observation_id":"67525760-62fe-484f-a94b-027dc153d843","resolution":{"observed_at":"2026-08-01T05:03:42.986227Z","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-01T05:03:43.194339Z","title":"Dynamic network models and graphon estimation.The Annals of Statistics, 47(4):2378–2403, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.22383","last_updated":"2026-07-24T15:08:24Z","snapshot_observed_at":"2026-08-12T14:48:28.857766Z","submitted_at":"2026-07-24T15:08:24Z","title":"Constrained Multi-Relational Graphons with Maximum Entropy","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-01T05:03:43.194339Z"},"links":{"citing_paper":"/paper/2607.22383"},"observation_digest":"sha256:30b72eee2c7ca939544fec96f48b6773ff33200cefc249500fa4b47c021f8250","observation_id":"be9b5fe0-d1fe-4c1f-8902-fe28ac60c17e","resolution":{"observed_at":"2026-08-01T05:03:43.194339Z","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-01T05:03:43.410601Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.22383","last_updated":"2026-07-24T15:08:24Z","snapshot_observed_at":"2026-08-12T14:48:28.857766Z","submitted_at":"2026-07-24T15:08:24Z","title":"Constrained Multi-Relational Graphons with Maximum Entropy","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-01T05:03:43.410601Z"},"links":{"citing_paper":"/paper/2607.22383"},"observation_digest":"sha256:9e86c34f0455ac5edbb5e1eb9f6a2f769ed3d6af73ba7a81612f306217c94304","observation_id":"6447f681-ff0b-413f-a291-d7a1e71a8e03","resolution":{"observed_at":"2026-08-01T05:03:43.410601Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.14556","last_updated":"2025-08-28T04:01:45Z","snapshot_observed_at":"2026-08-14T01:42:17.043851Z","submitted_at":"2024-11-21T19:57:53Z","title":"Emergence in graphs with near-extreme constraints","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.14556","snapshot_observed_at":"2026-08-01T05:03:43.538099Z","title":"Emergence in graphs with near-extreme con- straints.arXiv preprint arXiv:2411.14556, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22383","last_updated":"2026-07-24T15:08:24Z","snapshot_observed_at":"2026-08-12T14:48:28.857766Z","submitted_at":"2026-07-24T15:08:24Z","title":"Constrained Multi-Relational Graphons with Maximum Entropy","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-01T05:03:43.538099Z"},"links":{"cited_paper":"/paper/2411.14556","citing_paper":"/paper/2607.22383"},"observation_digest":"sha256:36807d0399d6c1ba1a2715280e3834f753e918e77f63133c9e51253e92055057","observation_id":"0b4d6ede-e469-4c7e-a41b-f6962d00c238","resolution":{"observed_at":"2026-08-01T05:03:43.538099Z","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-01T05:03:43.647754Z","title":"Markov logic networks.Machine learning, 62(1-2):107–136, 2006","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.22383","last_updated":"2026-07-24T15:08:24Z","snapshot_observed_at":"2026-08-12T14:48:28.857766Z","submitted_at":"2026-07-24T15:08:24Z","title":"Constrained Multi-Relational Graphons with Maximum Entropy","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-01T05:03:43.647754Z"},"links":{"citing_paper":"/paper/2607.22383"},"observation_digest":"sha256:c3e1c14512dbde7094596890b5ef908f2631213fea1435f89d797970af4e00c6","observation_id":"249f35cb-d7aa-4342-8ef2-58bbd2c6feef","resolution":{"observed_at":"2026-08-01T05:03:43.647754Z","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-01T05:03:43.762120Z","title":"One knowledge graph to rule them all? an- alyzing the differences between dbpedia, yago, wikidata & co","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.22383","last_updated":"2026-07-24T15:08:24Z","snapshot_observed_at":"2026-08-12T14:48:28.857766Z","submitted_at":"2026-07-24T15:08:24Z","title":"Constrained Multi-Relational Graphons with Maximum Entropy","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-01T05:03:43.762120Z"},"links":{"citing_paper":"/paper/2607.22383"},"observation_digest":"sha256:24cd75577264f1aee751c165957d2bf137212e815aaf99163031faf085f8e433","observation_id":"e7fa7e0b-ea5d-4a98-8323-438b40192a41","resolution":{"observed_at":"2026-08-01T05:03:43.762120Z","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-01T05:03:43.921739Z","title":"Protein-protein interaction networks (ppi) and complexdiseases.GastroenterologyandHepatologyfromBedtoBench,7(1):17, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.22383","last_updated":"2026-07-24T15:08:24Z","snapshot_observed_at":"2026-08-12T14:48:28.857766Z","submitted_at":"2026-07-24T15:08:24Z","title":"Constrained Multi-Relational Graphons with Maximum Entropy","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-01T05:03:43.921739Z"},"links":{"citing_paper":"/paper/2607.22383"},"observation_digest":"sha256:e537b2db2fe6f6e464c354840d4116a53bf91955ef44c6cba6db072a9611b31b","observation_id":"c995228f-83b9-4647-ad33-bcf43f037ec0","resolution":{"observed_at":"2026-08-01T05:03:43.921739Z","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-01T05:03:44.028225Z","title":"Modeling relational data with graph convolutional net- works","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.22383","last_updated":"2026-07-24T15:08:24Z","snapshot_observed_at":"2026-08-12T14:48:28.857766Z","submitted_at":"2026-07-24T15:08:24Z","title":"Constrained Multi-Relational Graphons with Maximum Entropy","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-01T05:03:44.028225Z"},"links":{"citing_paper":"/paper/2607.22383"},"observation_digest":"sha256:609b71f54bbbf583d3885fff318935d68a03b1ac7df233a21b5a71b02d1e6b9f","observation_id":"354102dd-fc4b-41a1-a9df-e2dfd9de1fb8","resolution":{"observed_at":"2026-08-01T05:03:44.028225Z","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-01T05:03:44.146375Z","title":"Network estimation via graphon with node features.IEEE Transactions on Network Science and Engi- neering, 7(3):2078–2089, 2020","venue":null,"work_id":null,"year":2078},"citing_paper":{"arxiv_id":"2607.22383","last_updated":"2026-07-24T15:08:24Z","snapshot_observed_at":"2026-08-12T14:48:28.857766Z","submitted_at":"2026-07-24T15:08:24Z","title":"Constrained Multi-Relational Graphons with Maximum Entropy","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-01T05:03:44.146375Z"},"links":{"citing_paper":"/paper/2607.22383"},"observation_digest":"sha256:c0250fbe0d18ff2e5e24b99a2ff57830d2c944f2637c309f89c303b721c937de","observation_id":"c4b0e2a5-f861-46ce-8863-96c37da84dc4","resolution":{"observed_at":"2026-08-01T05:03:44.146375Z","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-01T05:03:44.266688Z","title":"Yago: a core of semantic knowledge unifying wordnet and wikipedia","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.22383","last_updated":"2026-07-24T15:08:24Z","snapshot_observed_at":"2026-08-12T14:48:28.857766Z","submitted_at":"2026-07-24T15:08:24Z","title":"Constrained Multi-Relational Graphons with Maximum Entropy","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-01T05:03:44.266688Z"},"links":{"citing_paper":"/paper/2607.22383"},"observation_digest":"sha256:3e9c9de17752c46dfbbe6233931d8d35d37476331e94e3f579f7cbbf9972a861","observation_id":"c9996105-688e-4b97-b131-f6e3c2059458","resolution":{"observed_at":"2026-08-01T05:03:44.266688Z","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-01T05:03:44.337542Z","title":"Multirelational organiza- tionoflarge-scalesocialnetworksinanonlineworld.ProceedingsoftheNational Academy of Sciences, 107(31):13636–13641, 2010","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.22383","last_updated":"2026-07-24T15:08:24Z","snapshot_observed_at":"2026-08-12T14:48:28.857766Z","submitted_at":"2026-07-24T15:08:24Z","title":"Constrained Multi-Relational Graphons with Maximum Entropy","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-01T05:03:44.337542Z"},"links":{"citing_paper":"/paper/2607.22383"},"observation_digest":"sha256:5c07a35c811a10fc447558c185a41af53e8629e24c56dae488cc8f5f28630bc7","observation_id":"9bda645c-b776-4382-aa3b-ec0adaba28e3","resolution":{"observed_at":"2026-08-01T05:03:44.337542Z","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-01T05:03:44.392165Z","title":"Thelow-rankhypoth- esis of complex systems.Nature Physics, pages 1–9, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22383","last_updated":"2026-07-24T15:08:24Z","snapshot_observed_at":"2026-08-12T14:48:28.857766Z","submitted_at":"2026-07-24T15:08:24Z","title":"Constrained Multi-Relational Graphons with Maximum Entropy","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-01T05:03:44.392165Z"},"links":{"citing_paper":"/paper/2607.22383"},"observation_digest":"sha256:bd074072986ffc2c14c75443118d8c3c4563f85f0838cdf190defd8c9d27d62b","observation_id":"f83a0085-2a62-4317-9893-0dca022b541a","resolution":{"observed_at":"2026-08-01T05:03:44.392165Z","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-01T05:03:44.479095Z","title":"Iowa State University, 1968","venue":null,"work_id":null,"year":1968},"citing_paper":{"arxiv_id":"2607.22383","last_updated":"2026-07-24T15:08:24Z","snapshot_observed_at":"2026-08-12T14:48:28.857766Z","submitted_at":"2026-07-24T15:08:24Z","title":"Constrained Multi-Relational Graphons with Maximum Entropy","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-01T05:03:44.479095Z"},"links":{"citing_paper":"/paper/2607.22383"},"observation_digest":"sha256:d26f12be65a0e7542bd9acdb85447ea4880e8031aab5637adacc910e4e36b205","observation_id":"47281837-8453-4248-8b1a-7482d32f67ef","resolution":{"observed_at":"2026-08-01T05:03:44.479095Z","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-01T05:03:44.578165Z","title":"Random walk withrestartonmultiplexandheterogeneousbiologicalnetworks.Bioinformatics, 35(3):497–505, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.22383","last_updated":"2026-07-24T15:08:24Z","snapshot_observed_at":"2026-08-12T14:48:28.857766Z","submitted_at":"2026-07-24T15:08:24Z","title":"Constrained Multi-Relational Graphons with Maximum Entropy","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-01T05:03:44.578165Z"},"links":{"citing_paper":"/paper/2607.22383"},"observation_digest":"sha256:c9862d2ddafa2046d445bcf145b14e780d6b9636db41e69dfceb9835c631bda1","observation_id":"06def0c2-c928-444d-843f-85a4b22284b8","resolution":{"observed_at":"2026-08-01T05:03:44.578165Z","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-01T05:03:44.668856Z","title":"Wikidata: a free collaborative knowl- edgebase.Communications of the ACM, 57(10):78–85, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.22383","last_updated":"2026-07-24T15:08:24Z","snapshot_observed_at":"2026-08-12T14:48:28.857766Z","submitted_at":"2026-07-24T15:08:24Z","title":"Constrained Multi-Relational Graphons with Maximum Entropy","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-01T05:03:44.668856Z"},"links":{"citing_paper":"/paper/2607.22383"},"observation_digest":"sha256:b1313959342af5de38f009d6c931e092eb061df97924a521a3c16f8eb16802a2","observation_id":"7df593d9-3129-4615-afc6-321037247f7e","resolution":{"observed_at":"2026-08-01T05:03:44.668856Z","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-01T05:03:44.764040Z","title":"Ratesofconvergenceofspectralmethodsforgraphonestimation","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.22383","last_updated":"2026-07-24T15:08:24Z","snapshot_observed_at":"2026-08-12T14:48:28.857766Z","submitted_at":"2026-07-24T15:08:24Z","title":"Constrained Multi-Relational Graphons with Maximum Entropy","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-01T05:03:44.764040Z"},"links":{"citing_paper":"/paper/2607.22383"},"observation_digest":"sha256:7c1db4972ab4cdc5d073ce791ee1e0add784153cfc6eb9a9df9a2ed123db0278","observation_id":"d2673414-050e-4e27-bde0-fabc4269397f","resolution":{"observed_at":"2026-08-01T05:03:44.764040Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.22383","last_updated":"2026-07-24T15:08:24Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-12T14:48:28.857766Z","submitted_at":"2026-07-24T15:08:24Z","title":"Constrained Multi-Relational Graphons with Maximum Entropy"},"reference_resolution":{"displayed":46,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":46,"verified_exact":0,"verified_fuzzy":0},"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-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 46 of 46 outbound references and 0 inbound Pith citation observations for arXiv:2607.22383."}