{"as_of":"2026-08-04T03:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c35d95b46e89c5271348fe374c0ae60f7128fe788fcb922f9d5db58d98fe25b3","coverage":[{"denominator":61,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":61,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-09T16:53:23.270122Z","state":"measured"},{"denominator":61,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":61,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-03T06:30:56.289259+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.07232/citation-record","integrity":"/paper/2607.07232/integrity","json":"/paper/2607.07232/citation-record.json","paper":"/paper/2607.07232"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T16:56:21.827372Z","title":"Score-based generative modeling of graphs via the system of stochastic differential equations","venue":null,"work_id":"b7f99ab5-046a-431a-b585-86cbdc57e023","year":2022},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:11aaf1e020ad9355266b702d8f7e2e07df34ebad49628b3ecbe3865a9851347c","observation_id":"8fc5175e-a306-48a8-bd8c-bbf7e0bc3ed9","resolution":{"observed_at":"2026-07-09T16:56:21.829012Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.903989Z","title":"Digress: Discrete denoising diffusion for graph generation","venue":null,"work_id":"aa6f94b5-8d1b-4ba8-9322-455ac30c3c26","year":2023},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:7ae953b17592063ddeed4a10465a9f469cb45cd7ce4199010c21fa66742d1d7f","observation_id":"d8d0bfb4-3aab-448a-9c4d-0ee9417f1c46","resolution":{"observed_at":"2026-07-09T16:56:21.905380Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.897714Z","title":"Midi: Mixed graph and 3d denoising diffusion for molecule generation","venue":null,"work_id":"f8ddc786-2146-4b90-b39a-8d154f53c338","year":2023},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:484e3a6be48991659e12b33c4bccac5f462aeb1044d769133224b7b32cd2db91","observation_id":"1660b6f9-b059-4c8a-8a73-23d9e2ccae42","resolution":{"observed_at":"2026-07-09T16:56:21.899950Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.895797Z","title":"Graphpnas: Learning probabilistic graph generators for neural architecture search.Transactions on Machine Learning Research, 2023","venue":null,"work_id":"2357291f-ee45-453e-af85-a08f59794c87","year":2023},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:78c1cec741cf16fd4bd9d67768ab6e2441b964ba279b192bcce0d36acca73141","observation_id":"75154aab-c04b-46db-b063-a5541547d5c5","resolution":{"observed_at":"2026-07-09T16:56:21.897153Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T18:37:31.773461Z","title":"Limits of dense graph sequences.Journal of Combinatorial Theory, Series B, 96(6):933–957","venue":null,"work_id":"e4c57d82-047f-4cae-a97c-cf6ffcb85bbf","year":2006},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:a6d0b16735022cea4b3be33e6623c609d6b727000d59ac8df257c8b5ef207749","observation_id":"1ae43138-931e-4ae7-aaf4-e7ffcff2d129","resolution":{"observed_at":"2026-07-09T16:56:21.907226Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T18:37:31.749469Z","title":"American Mathematical Soc., 2012","venue":null,"work_id":"3d06a0fe-45d0-41c0-bf94-cbd2f847b126","year":2012},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:400da64d03b392433740c6601a5028a3e44da93262d98551259ec2a1bb77daa2","observation_id":"a2cb90c9-f095-4c34-a396-ea0c0e5b087a","resolution":{"observed_at":"2026-07-09T16:56:21.887578Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.891184Z","title":"Graphon signal processing.IEEE Transactions on Signal Processing, 69:4961–4976, 2021","venue":null,"work_id":"f0116b86-7eb9-4e56-89fc-bb8cf0deb094","year":2021},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:b02efc01409d9fd5bd5535cbdf360e1e20f4fd87921d94fde08f7a397853c8f1","observation_id":"d1cba6a9-5741-48ff-a842-9d20c28a42cb","resolution":{"observed_at":"2026-07-09T16:56:21.892327Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.870824Z","title":"Graphon neural networks and the transferability of graph neural networks","venue":null,"work_id":"6b447809-a7cc-4739-aed2-9e9528c236fb","year":2020},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:c1e4d979342401107f0f4267c14f5c0235d874c0eabf902ece4fb07da7621039","observation_id":"35fdfbf7-ad0f-4a78-8531-51041a425ad1","resolution":{"observed_at":"2026-07-09T16:56:21.872424Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.888055Z","title":"Defog: Discrete flow matching for graph generation","venue":null,"work_id":"ec2c512d-3a80-497b-99d8-bfe3c683a910","year":2025},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:f5aac74fdeefb99e225c1bc0240966f20f843e4e647da8a3457e4c32b3761080","observation_id":"37cae9f7-2413-43ed-9068-798b5cfde3e4","resolution":{"observed_at":"2026-07-09T16:56:21.889320Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.875909Z","title":"Graph generation with diffusion mixture","venue":null,"work_id":"9a0168e6-9e66-49aa-a340-35b9787f5b66","year":2024},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:19b7acfa2b0e30454858c22db70ea933bbb1a0288cb40dbe8e4d03f7b25b93b0","observation_id":"04878f06-fb4a-435e-9703-6f8678c47f96","resolution":{"observed_at":"2026-07-09T16:56:21.877391Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.889823Z","title":"Dirichlet diffusion score model for biological sequence generation","venue":null,"work_id":"a58107d7-8ab2-4e36-86bb-c11277e8b5e7","year":2023},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:624de599a0950ca4aeca97bd647977cc8beeb8b088c19cf5182b17505909df82","observation_id":"26bba3b7-a506-4f32-83d4-fbcd1fb46198","resolution":{"observed_at":"2026-07-09T16:56:21.891330Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.868210Z","title":"Convergent sequences of dense graphs i: Subgraph frequencies, metric properties and testing.Advances in Mathematics, 219(6):1801–1851, 2008","venue":null,"work_id":"0f938be9-ee7d-423e-92a8-92fd089fb070","year":2008},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:838ad99f51a0068b0f03ba313671670980de4820421cc21b2ea42c271013e700","observation_id":"2a12f770-f65d-416a-be17-e007753702ab","resolution":{"observed_at":"2026-07-09T16:56:21.869986Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.835361Z","title":"Transferability of spectral graph convolutional neural networks.Journal of Machine Learning Research, 22(272):1–59","venue":null,"work_id":"194ad0da-c359-4c63-a350-e300128eef01","year":2021},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:ffc102fae31d28d472c60a0d8d340a68d01892c0deeca7aa29f7272419547c5c","observation_id":"895fcf1d-12c7-4c3b-97dd-3cbe7dd623c5","resolution":{"observed_at":"2026-07-09T16:56:21.836800Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T18:27:32.320838Z","title":"Transferability of graph neural networks: an extended graphon approach.Applied and Computational Harmonic Analysis, 63:48–83","venue":null,"work_id":"e55cac96-ef8d-4f28-a595-adbcac748a0b","year":2023},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:39b0b9c328bf873e51f55d52d3a6d29d2505408125fc9a85ed9ccbd6d0e042b4","observation_id":"b42b7b7c-57cf-4583-aa24-9159d4fc1250","resolution":{"observed_at":"2026-07-09T16:56:21.838957Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2105.14244","last_updated":"2021-05-29T08:11:40Z","snapshot_observed_at":"2026-07-06T11:13:54.995111Z","submitted_at":"2021-05-29T08:11:40Z","title":"Learning Graphon Autoencoders for Generative Graph Modeling","version":1},"cited_work":{"arxiv_id":"2105.14244","doi":null,"metadata_source":"pith","pith_arxiv_id":"2105.14244","snapshot_observed_at":"2026-07-09T16:56:21.647040Z","title":"Learning Graphon Autoencoders for Generative Graph Modeling","venue":"cs.LG","work_id":"ee3a5442-3c68-4649-b5df-5f668219fa0b","year":2021},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"cited_paper":"/paper/2105.14244","citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:e18a2c42c5051c05e1aea6676551f3d2b8c89acf85f7f0a15e48c5b398d1e0eb","observation_id":"0b472152-b807-4aba-b4cd-caa500ae6338","resolution":{"observed_at":"2026-07-09T16:56:21.648514Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.863658Z","title":"Implicit graphon neural representation","venue":null,"work_id":"204a2028-ec1d-490a-82c1-87d6cd0d5336","year":2023},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:89ca0f08ac414d192d21ec04e8b97fbc84bfea0044958731d24757f2121068b7","observation_id":"7eff4344-2564-4fe5-9996-a61e6e843930","resolution":{"observed_at":"2026-07-09T16:56:21.865478Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.907775Z","title":"Scalable implicit graphon learning","venue":null,"work_id":"23c4445e-3337-4514-b986-e7901758fb51","year":2025},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:ac1dada7ad34bf3680cb6f488cff458420d839657d10fc0e955ddb05aa04250a","observation_id":"d083a94f-7e63-4839-b314-3bdd21b17459","resolution":{"observed_at":"2026-07-09T16:56:21.908903Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2602.23566","last_updated":"2026-05-18T02:44:07Z","snapshot_observed_at":"2026-08-02T15:51:43.663896Z","submitted_at":"2026-02-27T00:22:21Z","title":"Flowette: Flow Matching with Graphette Priors for Graph Generation","version":3},"cited_work":{"arxiv_id":"2602.23566","doi":null,"metadata_source":"pith","pith_arxiv_id":"2602.23566","snapshot_observed_at":"2026-07-09T16:56:21.653181Z","title":"Flowette: Flow Matching with Graphette Priors for Graph Generation","venue":"cs.LG","work_id":"f78a60c7-61e9-41e6-ad9c-d3e11ac43419","year":2026},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"cited_paper":"/paper/2602.23566","citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:329e07811f465f4843f40c41649fa44e055edf63b8902d3e76039fc67846f246","observation_id":"a634ed2a-dd71-46b6-ad29-159fc697026d","resolution":{"observed_at":"2026-07-09T16:56:21.654524Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.893004Z","title":"Structured denoising diffusion models in discrete state-spaces","venue":null,"work_id":"71e07da4-f792-4d43-9a5c-f6a07646210e","year":2021},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:45f289efb401f652c1b9dd29c3160b2f3b85920b205912c5dc77e7ae1cd07feb","observation_id":"3e2f0b43-69b5-476b-8118-2c13a4335159","resolution":{"observed_at":"2026-07-09T16:56:21.894271Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.850230Z","title":"Permutation invariant graph generation via score-based generative modeling","venue":null,"work_id":"c1da3a83-e388-4f11-af36-9c53e9b4dc1e","year":2020},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:f3208bae4ff03dd26fc6b692e3364245009b93a9bc34b0c7c2b231274b27cb87","observation_id":"53760c12-f08b-4e82-b4f6-27a3663d3ab9","resolution":{"observed_at":"2026-07-09T16:56:21.851649Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.902156Z","title":"Dirichlet flow matching with applications to dna sequence design","venue":null,"work_id":"0fb7d234-8158-4b8f-a013-03965517e1e5","year":2024},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:e9a65e9e2fb35f8c6b5f6151d09ec5a3461d66e725cd7f738aabff469dec50a4","observation_id":"f4a7d2d3-e1b6-4f0c-92e1-6bbca7b5f7c5","resolution":{"observed_at":"2026-07-09T16:56:21.903349Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.859645Z","title":"Variational flow matching for graph generation","venue":null,"work_id":"61c0ed0a-b139-4d20-b620-1b0abf43b46b","year":2024},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:350998b892be2fd9796300b26b66953189e471d176d557bc7ecacb22fc1506f1","observation_id":"811fc0b9-ec5c-431e-94ed-1b2b47e0d032","resolution":{"observed_at":"2026-07-09T16:56:21.860922Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.852610Z","title":"Fisher flow matching for generative modeling over discrete data","venue":null,"work_id":"9ed37df1-e067-4033-a1a9-8fc129363f07","year":2024},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:f46001e196c5d06a5f781e3e8615ed5d27bf02ab270992f6649a04f389a4e3f0","observation_id":"4202211b-414e-49cd-8532-578d93d9aa1d","resolution":{"observed_at":"2026-07-09T16:56:21.853950Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2304.05364","last_updated":"2024-03-07T13:48:04Z","snapshot_observed_at":"2026-07-06T15:14:32.823996Z","submitted_at":"2023-04-11T17:19:45Z","title":"Diffusion Models for Constrained Domains","version":2},"cited_work":{"arxiv_id":"2304.05364","doi":"10.48550/arxiv.2304.05364","metadata_source":"pith","pith_arxiv_id":"2304.05364","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Diffusion models for constrained domains","venue":"cs.LG","work_id":"adcb8ef9-1f6a-49ab-8b50-8292565f783d","year":2023},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"cited_paper":"/paper/2304.05364","citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:6c664dbeabd55b45e1c62379c7fdc139f52160421ffb8739688f98220939f271","observation_id":"d0bb3c1e-d7ea-499b-a9a2-1294bd539314","resolution":{"observed_at":"2026-07-09T16:56:21.651658Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.880213Z","title":"Riemannian score-based generative modelling","venue":null,"work_id":"b2191659-5094-4570-b733-ec0a5821c9aa","year":2022},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:243dd24bd71ac5a475038af270fa4e5e78599d54fdbe3995099a71e1207ac249","observation_id":"1b05b7dd-b7a9-437e-bc1b-04cd715cb8ba","resolution":{"observed_at":"2026-07-09T16:56:21.881549Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.915372Z","title":"Se (3) diffusion model with application to protein backbone generation","venue":null,"work_id":"1de9a696-2d74-4752-b0b6-bb7eb7ba437b","year":2023},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:ec430f8ac10040f7fb7ef01ca2889bd17ba3b69cf06db32f4fa115ca42c91613","observation_id":"652668f4-ed32-421d-8e60-eb7213709182","resolution":{"observed_at":"2026-07-09T16:56:21.916904Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.844196Z","title":"Reverse-time diffusion equation models.Stochastic Processes and their Applications, 12 (3):313–326, 1982","venue":null,"work_id":"9814c004-9cf4-4ef0-990c-2d4220436219","year":1982},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:03d159ce5ab2caa79522dac1fa54c2c0bf571ac3cb926d1842704befaa483628","observation_id":"a5b931d8-dae8-4dbf-b4cb-e8c5ad881329","resolution":{"observed_at":"2026-07-09T16:56:21.845363Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.913371Z","title":"American Mathematical Soc","venue":null,"work_id":"fb57193a-d986-4131-b480-9406e3027fb6","year":1939},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:d454fa9be670cd8b9cf0a97d6e8140784b59cb71fe49745833d87d46c1dc7fd5","observation_id":"3b09768e-329f-4a89-bb24-95471d7b2140","resolution":{"observed_at":"2026-07-09T16:56:21.914836Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.854453Z","title":"Graph inductive biases in transformers without message passing","venue":null,"work_id":"a7136cb6-a0ad-4d7e-b39c-260266141eba","year":2023},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:3c3f02f5de6bb92b842e3afc4adefa90bdee335d6f2a524b61c2fb3ac10a24c2","observation_id":"c19a068a-3fa9-4e61-9fd7-255bc927d892","resolution":{"observed_at":"2026-07-09T16:56:21.855894Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.828771Z","title":"Cometh: A continuous-time discrete-state graph diffusion model.Transactions of Machine Learning Research, 2025","venue":null,"work_id":"6bc88703-d2bd-4b94-adb0-6c138527993f","year":2025},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:7ad27b26c448ca38709e4b678bb486776cf2e26c7c8977b141e909c785152691","observation_id":"e2fb95d2-5a5c-477c-ba52-d13291a4b285","resolution":{"observed_at":"2026-07-09T16:56:21.829984Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.01656","last_updated":"2025-07-05T01:43:57Z","snapshot_observed_at":"2026-08-01T21:17:51.568104Z","submitted_at":"2024-09-03T06:50:03Z","title":"Graphons of Line Graphs","version":3},"cited_work":{"arxiv_id":"2409.01656","doi":null,"metadata_source":"pith","pith_arxiv_id":"2409.01656","snapshot_observed_at":"2026-07-09T16:56:21.656188Z","title":"Graphons of Line Graphs","venue":"stat.ML","work_id":"44ee381c-b22e-4ad2-8f79-57085f118d18","year":2024},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"cited_paper":"/paper/2409.01656","citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:54c86d324689ef08b26615bd14de5347b315eae27d2589f24631530bf5950d32","observation_id":"da3c95d7-c7b8-4205-880a-c8914a4ca086","resolution":{"observed_at":"2026-07-09T16:56:21.657360Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.811936Z","title":"Spectre: Spectral conditioning helps to overcome the expressivity limits of one-shot graph generators","venue":null,"work_id":"1a9c1d48-122b-4f6d-ab54-a35768fca1b6","year":2022},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:d6589dc88192a207039568438080822797ab70166a3361cd04d6b65f29531552","observation_id":"aad1daa4-c9f4-45cc-8dae-949a6a074667","resolution":{"observed_at":"2026-07-09T16:56:21.813183Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.833396Z","title":"Convergent sequences of dense graphs ii","venue":null,"work_id":"e9529d07-0d66-428b-b04b-d35f1011f585","year":2012},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:26e8c64a617ddbd1929f215431ded97fe866169e30fd8e4af7f8eabdc081c5a9","observation_id":"d4fd197d-572b-43e0-b9f1-0be4d3460dd1","resolution":{"observed_at":"2026-07-09T16:56:21.834862Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.878175Z","title":"Stochastic blockmodels: First steps","venue":null,"work_id":"a4f8dc9d-c7d0-4263-8023-05cdcc607912","year":1983},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:aa49097778348663309bdd7f1ceda199f1c7216a7a72040b54e0017de4441df8","observation_id":"a0123517-d590-4084-bd62-8d66e765b91b","resolution":{"observed_at":"2026-07-09T16:56:21.879629Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.879953Z","title":"Stochastic blockmodel approximation of a graphon: Theory and consistent estimation","venue":null,"work_id":"5e6a6fbe-b711-42b2-ae2b-4f4dcf8d624b","year":2013},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:21679c7b800322c00dfeea44be0211722b15513f35645f22fdf94a634a67b731","observation_id":"74aec583-d22c-402f-9e3d-12f1ec3ca667","resolution":{"observed_at":"2026-07-09T16:56:21.881276Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.866081Z","title":"Diffstg: Probabilistic spatio-temporal graph forecasting with denoising diffusion models","venue":null,"work_id":"3031cbe7-46b9-494b-a633-0488383e567b","year":2023},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:910d7a1cbecb98c0a80c47c27194b21b7df2155b9e31252da84d49fa705f35a8","observation_id":"5e983b64-e465-4afe-8cfd-491b05fd8156","resolution":{"observed_at":"2026-07-09T16:56:21.867638Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.900448Z","title":"Graph signal generative diffusion models","venue":null,"work_id":"103bde41-523c-4751-a23a-f3c28ea58aa3","year":2026},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:4784e56ce0c6fe71dde33fcf16dbae78306505e835c47d486a2dd26ff27772d2","observation_id":"45d425a6-7c08-4044-b15a-290352e211c5","resolution":{"observed_at":"2026-07-09T16:56:21.901628Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.887458Z","title":"Marques, Hadi Jamali-Rad, and Elvin Isufi","venue":null,"work_id":"407d81c7-c5e3-40b9-bd76-970538dd7454","year":2026},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:1ed6870a361e6048269ad4783c51c88856b4119df5f45333abb9023455b1a2d2","observation_id":"6f1af0fc-17a3-4e2c-b750-b35c828f7692","resolution":{"observed_at":"2026-07-09T16:56:21.888600Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.873689Z","title":"Diffusion models for graphs benefit from discrete state spaces","venue":null,"work_id":"520aa888-ff94-405f-b60b-0beec5d8db83","year":2022},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:2abd19f06fb7415f3e51b962849b22261da716cc9fab8372147c192efc2730b0","observation_id":"5a93c65e-2fb9-4b39-832c-e73e90ce81f8","resolution":{"observed_at":"2026-07-09T16:56:21.875022Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.824435Z","title":"Discrete diffusion modeling by estimating the ratios of the data distribution","venue":null,"work_id":"387f3a34-23df-49b3-84e7-843c3472272f","year":2024},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:272770c0f9c7916adb8bf417b9aeac71ff358a377103744c8c852095a30f8052","observation_id":"e958308b-4335-4bb5-a83c-82c83cd00331","resolution":{"observed_at":"2026-07-09T16:56:21.825651Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.810918Z","title":"Deep unsupervised learning using nonequilibrium thermodynamics","venue":null,"work_id":"660d939a-a021-4be0-b8b7-97ac4aa2c900","year":2015},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:4e38b26d1340f18d160ad3d382aa47d2f4594c56c90666c2d2268edac0d709d0","observation_id":"c58aef7e-bfa3-4731-be55-2795b5429b67","resolution":{"observed_at":"2026-07-09T16:56:21.812322Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.869849Z","title":"Generative modeling by estimating gradients of the data distribution","venue":null,"work_id":"ee0e1ed5-fac4-4062-b866-70b182ef9ecd","year":2019},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:5e86740c67a2020215b1c174c0c9b24994d267acabbd63fa723091126276323c","observation_id":"0268ee77-156d-411f-870f-c3e22b7f0e60","resolution":{"observed_at":"2026-07-09T16:56:21.871135Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.885591Z","title":"Denoising diffusion probabilistic models","venue":null,"work_id":"8a68f02f-d319-4b24-a0f0-ff2c9d8029f5","year":2020},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:a62b4d8c7390202d8921bef98b111928b7a19cccefbbd844e34a287c4edf17ac","observation_id":"d32e5358-a218-4ae0-96cd-4f961eb108ba","resolution":{"observed_at":"2026-07-09T16:56:21.886843Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.855747Z","title":"Score-based generative modeling through stochastic differential equations","venue":null,"work_id":"53bea94a-9a2e-4bd5-8f7c-d6551201a3ad","year":2021},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:7d48223d4632272eaa88a90111b42d650e6d8fc6e65b7378064fcb3dfc750288","observation_id":"2d66c7e2-0481-40ac-bb90-127bf1995c95","resolution":{"observed_at":"2026-07-09T16:56:21.857179Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.909453Z","title":"Estimation of non-normalized statistical models by score matching","venue":null,"work_id":"b6110f24-fe4c-440b-821c-d1967e3c25fc","year":2005},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:4ec92daabcada10cd6c61ebd9a84b02e76021e828c4e2205da3089dbda27b255","observation_id":"4d7624d9-e2f1-41b5-89a1-723a63e4c0ce","resolution":{"observed_at":"2026-07-09T16:56:21.912813Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.891812Z","title":"A connection between score matching and denoising autoencoders.Neural computation, 23(7):1661–1674","venue":null,"work_id":"4916a397-3618-4c3f-932f-e99d927d0add","year":2011},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:5f4cec92842d1b2b2e16d0dfaa3486e5ea7be642258f0d362b665d056b87e34a","observation_id":"e1714cc3-3942-4579-93cd-a485407406ef","resolution":{"observed_at":"2026-07-09T16:56:21.893157Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.843402Z","title":"Evolution in mendelian populations.Genetics, 16(2):97, 1931","venue":null,"work_id":"1d27d380-4848-4a85-887e-e507fb05f3a2","year":1931},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:f24c545c0d1106fa49ce138fa6f77ca153ed06b15a564b82585421fbcea639f8","observation_id":"0afc6eeb-6af5-4214-b304-675e43d20ac1","resolution":{"observed_at":"2026-07-09T16:56:21.845074Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.861823Z","title":"Elsevier, 1981","venue":null,"work_id":"a8a7455a-274e-4338-bc6a-340d48dda189","year":1981},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:1ae7b02be198ff24d8688ccc4ed403d20527898e1cbe896594e57791ccac678e","observation_id":"0dd37a8d-0ba1-4823-b6b2-4c240dd79870","resolution":{"observed_at":"2026-07-09T16:56:21.863055Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.835780Z","title":"Springer Science & Business Media, 2011","venue":null,"work_id":"e4c9a9a9-6834-44bb-b976-ae408cfe6cfb","year":2009},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:f2ca69c9ecc52737842404038450e9b6c61bfbb968d967b7aa4682ad39853491","observation_id":"ac2a0b03-bf7e-48c3-b168-73efc1cac141","resolution":{"observed_at":"2026-07-09T16:56:21.837486Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.900148Z","title":"The pearson diffusions: A class of statistically tractable diffusion processes.Scandinavian Journal of Statistics, 35(3):438–465, 2008","venue":null,"work_id":"5f7e439e-97d0-4c4b-a899-3888201119f4","year":2008},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:cbea53ea553f6222938db347fd21de61bb25db933c5d481bc548690d07fcf367","observation_id":"8fca9310-c96d-4e39-90bc-6f2a27fa1c4c","resolution":{"observed_at":"2026-07-09T16:56:21.901451Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.865810Z","title":"Diffusion-type models with given marginal distribution and autocorrelation function.Bernoulli, 11(2):191–220, 2005","venue":null,"work_id":"77dba9e4-6a7c-448a-b718-651369cb04d7","year":2005},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:ec3a3069bf04b44323f9da814009006faf6908bb0d3fbdd66f304871cc6fca24","observation_id":"2b70892d-f05a-4060-b692-e38aa088441e","resolution":{"observed_at":"2026-07-09T16:56:21.867038Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.894818Z","title":"Large deviations for statistics of the jacobi process.Stochastic Processes and their Applications, 119(2):518–533, 2009","venue":null,"work_id":"6029434a-5fbd-4c12-9b60-48188a806d9d","year":2009},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:fe4bfffd8902dba4aecf5c5e65e8491a151d26fa979ba786244a4bbf03618701","observation_id":"4c42c151-712d-456e-98c1-06a2f1e1855c","resolution":{"observed_at":"2026-07-09T16:56:21.896323Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.815830Z","title":"Multivariate jacobi process with application to smooth transitions","venue":null,"work_id":"fd34d4c7-fb2c-4a56-8a94-fc8ecd7b5955","year":2006},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:9b970cb44259f08331632db353ed6217325e5560de8239e8d3c8e10399adf193","observation_id":"dc2e1bf4-2a7b-4697-b056-da3cb8e0a3b5","resolution":{"observed_at":"2026-07-09T16:56:21.816952Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-11T00:47:47.249439Z","title":"Springer, 2014","venue":null,"work_id":"647f19f3-3616-490a-aaff-9c4f85e88000","year":2014},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:9b9f18b3df91b23891a0f6e0229fcf5c34fcddeace83f66a527722e0b84eb24b","observation_id":"007f3b69-99da-4284-ac3a-e16b5ff4a8bc","resolution":{"observed_at":"2026-07-09T16:56:21.904225Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.897419Z","title":"On the method of bounded differences.Surveys in combinatorics, 141(1):148–188, 1989","venue":null,"work_id":"5e4c15e6-4204-4460-8b77-d5e375495207","year":1989},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:2eb70951f3c7810817080b6d1f2a61a8f3e753719be28fc9f3906d203297e024","observation_id":"ad2b0084-4e49-4bfa-900d-5650d0463f8c","resolution":{"observed_at":"2026-07-09T16:56:21.899029Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.882474Z","title":"The numerical solution of stochastic differential equations.The ANZIAM Journal, 20(1):8–12, 1977","venue":null,"work_id":"53439b64-66d1-46ec-b4c4-a815f86afe2a","year":1977},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:b3b4aeda7722ded044f67336d084a6a80472026ea34dcc2a4c04b40bf9e67929","observation_id":"b2aa9291-6f86-44e5-81be-359febfe7abb","resolution":{"observed_at":"2026-07-09T16:56:21.883941Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.876037Z","title":"N2 Z Ii×Ij 2Wt(x, y)dW t(x, y)dx dy # =E","venue":null,"work_id":"a374aa5e-3bd1-4852-9971-b64e47a47606","year":2022},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:e76446566c3273e5015e8d6e1e86b1c2118af3279b9ffcc96815be6defb27bfe","observation_id":"db1109de-633c-42d6-9ede-2591df441c3b","resolution":{"observed_at":"2026-07-09T16:56:21.877505Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.851209Z","title":"This family is the most naturally aligned with the graphon setting, since it admits a clear piecewise-constant graphon representation","venue":null,"work_id":"3018c090-6365-49cb-8eb8-93f2aa1b2619","year":null},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:3f325dfb6b962f136c6957f4751f998ae51fcbc5a2441cf4fc9691c320c47f00","observation_id":"b54baae4-a366-46af-9bab-0852853b391d","resolution":{"observed_at":"2026-07-09T16:56:21.852873Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.883803Z","title":null,"venue":null,"work_id":"b82cb1f8-ab20-4624-a4da-b99dfeea9cf8","year":null},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:112c016f96510ca75a536e906ce88568ebd33695b1e7036a550098a4681529fa","observation_id":"c682e183-87bf-4afd-afaf-a89051db92ca","resolution":{"observed_at":"2026-07-09T16:56:21.884974Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.826395Z","title":null,"venue":null,"work_id":"0d40273a-c8fe-45dc-b3dd-5af9eac88fbc","year":null},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:f5c09b2c01a060f780a783f633ada92af32138ca68aa015b0ba795cc0ab16cd7","observation_id":"f97f6f7b-4e5b-4c81-b1bc-c846d297fe72","resolution":{"observed_at":"2026-07-09T16:56:21.827816Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T16:56:21.808669Z","title":"Trees do not admit an associated graphon in the classical sense, so they provide a useful test of performance clearly outside the assumptions under which the theory is derived","venue":null,"work_id":"01779e38-2fb8-4d91-a2b7-eae913bf3471","year":null},"citing_paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-07-09T16:53:23.270122Z"},"links":{"citing_paper":"/paper/2607.07232"},"observation_digest":"sha256:e83543949a9039386658f91cd1d64fbb84a43e6033eef7a56e2fc18e33afc4a4","observation_id":"d7445e69-aaf5-452d-8251-df5fd24f819e","resolution":{"observed_at":"2026-07-09T16:56:21.810251Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2607.07232","last_updated":"2026-07-08T10:15:17Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-04T02:25:34.498507Z","submitted_at":"2026-07-08T10:15:17Z","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation"},"reference_resolution":{"displayed":61,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":4,"verified_fuzzy":55},"total_outbound_references":61},"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-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 61 of 61 outbound references and 0 inbound Pith citation observations for arXiv:2607.07232."}