{"as_of":"2026-08-10T11:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9412bca1b7c8bcebfb4a6e1f52d12c2543f1b1797e4c0688cdf16a49a0e39564","coverage":[{"denominator":65,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":65,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T20:10:41.088282Z","state":"measured"},{"denominator":65,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":65,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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/2507.03728/citation-record","integrity":"/paper/2507.03728/integrity","json":"/paper/2507.03728/citation-record.json","paper":"/paper/2507.03728"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.837951Z","title":"Hamilton","venue":null,"work_id":"c6aa52fd-049d-42b9-a43c-d1109b87bb1f","year":2020},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:40.902477Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:a508ab182895aaf47fd480817b0549b06a16dbbde739ebffa659862b85bcf0d7","observation_id":"e7e881ca-6b46-44ba-975d-e2fdfad830f8","resolution":{"observed_at":"2026-08-06T20:10:41.841705Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.825736Z","title":"Light- GCN: Simplifying and powering graph convolution network for recommendation","venue":null,"work_id":"083d1e21-71b9-4029-9bc7-03aca8c912bd","year":2020},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:40.906101Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:20840cb1c4b1b9677faad37a22f76bf439c0e49cba7ec56f196060b7e725c345","observation_id":"7b180bd4-d4d9-443f-a822-9c1cba7baedb","resolution":{"observed_at":"2026-08-06T20:10:41.829438Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.816001Z","title":"LightGCL: Simple yet effective graph contrastive learning for recommendation","venue":null,"work_id":"da699f8b-ea83-4fe6-9325-83227c1fd5e0","year":2023},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:40.909931Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:00ecf0d0b7d4e6f0b170c56db92761aa0670926762011846d45039b13e3aedb7","observation_id":"0d5378f0-abe5-473a-a78b-6b323c7be6bf","resolution":{"observed_at":"2026-08-06T20:10:41.819247Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.805838Z","title":"Drug-target interaction pre- diction with graph regularized matrix factorization","venue":null,"work_id":"dde13f68-15ee-4dfe-b298-663dc3bf4ed0","year":2017},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:40.913596Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:e204671b49ff8183946cd834db01361d8d6c200110ac99bd410cf1dcb57e080d","observation_id":"650e76b5-3d58-4d60-9bf5-7546589a5037","resolution":{"observed_at":"2026-08-06T20:10:41.809420Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.794581Z","title":"DMHGNN: double multi-view heterogeneous graph neural network framework for drug-target interaction prediction","venue":null,"work_id":"88104773-2d9d-483e-9798-ab6f4eb52625","year":2025},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:40.916647Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:02fb022bd19958ac22b4c348cb37f5968b9569c3371be21a0612a2bb8432b286","observation_id":"41f52d25-fb2c-4181-959a-5a07b28ce11d","resolution":{"observed_at":"2026-08-06T20:10:41.798096Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.784447Z","title":"Castro-Correa, Jhony H","venue":null,"work_id":"390e07aa-cc18-465c-92cc-72c63eda0536","year":2024},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:40.919481Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:8515c6c4e2ee34a5d23cc3b5acbc8a8c7b8379bdb1b80b8d01e320aa29099e88","observation_id":"2d68a742-c301-41e3-b5a7-d13804357ab8","resolution":{"observed_at":"2026-08-06T20:10:41.787798Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:40.922966Z","title":"The graph neural network model","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:40.922966Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:63e52af00fdf8936eba0158820888ce09acb07cd5b33967ec816e2d1e0bb7db0","observation_id":"f6ac6d49-bc31-4ade-bc64-4c4a8de82cd4","resolution":{"observed_at":"2026-08-06T20:10:40.922966Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.768132Z","title":"Graph neural networks are inherently good generalizers: Insights by bridging GNNs and MLPs","venue":null,"work_id":"f62766d8-e579-4dab-808e-975a46ba71f8","year":2023},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:40.925548Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:cf478c53709ba920c861d183a291c0b896f8f004a4af41f18f06a902577baeaa","observation_id":"f80381a3-2f7c-45e4-954d-a12dafb29dd6","resolution":{"observed_at":"2026-08-06T20:10:41.772429Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.758896Z","title":"Fairness in machine learning: A survey","venue":null,"work_id":"cf5c52fc-3cd1-4d99-87f4-4177ccad83fb","year":2024},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:40.928183Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:533a18278963c397ad8568377bc7851e5f4a3281bcf47de124512e8df3c25ed7","observation_id":"668ed0de-c045-4064-8662-4e9fa3fb9eb1","resolution":{"observed_at":"2026-08-06T20:10:41.761931Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.749450Z","title":"Say no to the discrimination: Learning fair graph neural networks with limited sensitive attribute information","venue":null,"work_id":"97eee901-12ad-4594-89a5-acc0ddb44c60","year":2021},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:40.931450Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:d0ce8a1d9d9fc20190a2efeaf6803ecedf5de20a34b896577695d5670112f12c","observation_id":"520ab8bc-1ec4-41a6-992a-9c14269bcb0f","resolution":{"observed_at":"2026-08-06T20:10:41.752856Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.740028Z","title":"On dyadic fairness: Exploring and mitigating bias in graph connections","venue":null,"work_id":"61cccab4-3d77-4a99-b827-3ed2d9d62f90","year":2021},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:40.934271Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:30f24c326069f75fa6866fca6c2236776ed0efc077ac5bd6db79d88abc17baec","observation_id":"f1edb3f7-8ee5-4a15-bf76-1c9c01ac36d8","resolution":{"observed_at":"2026-08-06T20:10:41.743194Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.730097Z","title":"Fairdrop: Biased edge dropout for enhancing fairness in graph representation learning","venue":null,"work_id":"9d918e55-d107-4a6c-8a1d-eb7877e8533a","year":2022},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:40.937631Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:b9781c98963efa53f0c8eefcecf35671c4d9fe95d1da2bda9e2f2a159a7904f4","observation_id":"e444b072-d0c9-4f5c-9998-7a36cb92d1c1","resolution":{"observed_at":"2026-08-06T20:10:41.733638Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.720683Z","title":"Fairgat: Fairness-aware graph attention networks","venue":null,"work_id":"d4ebee44-f280-4599-a578-2096235f82b3","year":2024},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:40.940250Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:aab9605c6cecf45b04282867df4a16ce9854987c239e4159d7df04a1c994cc19","observation_id":"9ffdc116-58b9-4f0e-b9f5-7786b2e1674d","resolution":{"observed_at":"2026-08-06T20:10:41.723799Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.710588Z","title":"Fair graph U-Net: A fair graph learning framework integrating group and individual awareness","venue":null,"work_id":"13cd1f51-4712-4ec2-a9f1-08b95e424a5f","year":2025},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:40.943350Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:8a340660faab12d8da7adeb30617b38ee91dddd6f2fe9c3ae1fe74bbd2cd164b","observation_id":"e2912ca2-3ce4-4012-aa02-8d1269bde1a0","resolution":{"observed_at":"2026-08-06T20:10:41.714150Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.701168Z","title":"FA*IR: A fair top-k ranking algorithm","venue":null,"work_id":"a4ac9da7-5412-41fc-93f1-568a68864426","year":2017},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:40.946160Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:4bb370ca0d9ac332a702f62d5eb7ffd7fc2fbb2a47d55f102284ddc01e53801c","observation_id":"9681d79e-65dd-498f-8196-fe5eee5ab345","resolution":{"observed_at":"2026-08-06T20:10:41.704145Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.691056Z","title":"Rossi, Namyong Park, Puja Trivedi, Yu Wang, Tong Yu, Sungchul Kim, Franck Dernoncourt, and Nesreen K","venue":null,"work_id":"051cbae7-fa5a-4c9e-ab51-832708507580","year":2024},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:40.949361Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:c6782ffd0e937e7f713589a28c578430ba14887fc87694d29804fd099b948edd","observation_id":"d5bc1223-ab9c-4232-ae0c-dcfa3d1e76b9","resolution":{"observed_at":"2026-08-06T20:10:41.694583Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.05396","last_updated":"2024-02-21T22:25:01Z","snapshot_observed_at":"2026-08-05T09:03:11.851427Z","submitted_at":"2022-05-11T10:40:56Z","title":"A Survey on Fairness for Machine Learning on Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.05396","snapshot_observed_at":"2026-08-06T20:10:40.952523Z","title":"A survey on fairness for machine learning on graphs","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:40.952523Z"},"links":{"cited_paper":"/paper/2205.05396","citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:fba259b9dd0b5a69daf894a080165d8166123c6ceebafcd3773f7e8874bac882","observation_id":"997747b4-c4aa-4347-911b-606abff19e34","resolution":{"observed_at":"2026-08-06T20:10:40.952523Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.681562Z","title":"Fairness in graph mining: A survey","venue":null,"work_id":"37230282-f3a1-468c-8b32-6c8e83cfe75f","year":2023},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:40.955331Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:d21044aed84deb35930450a880cba01c4e2e5cc656245b89eda8e87e9cff531f","observation_id":"28958691-ca5c-4590-8ada-767869246e93","resolution":{"observed_at":"2026-08-06T20:10:41.684725Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.671411Z","title":null,"venue":null,"work_id":"9aba31c5-f087-4efc-914a-7a5e01091bdd","year":2024},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:40.957979Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:c02a7575cc486111aa19ce7cd98252cd19ba5b44f61fe4653fde894f383d3fb8","observation_id":"cd4a2cdf-0f74-4e8d-92d2-58c4d3a6aacf","resolution":{"observed_at":"2026-08-06T20:10:41.675087Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.661158Z","title":"A survey on video diffusion models","venue":null,"work_id":"66b9015d-2c00-4d64-bb6f-6529fb3a0593","year":2025},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:40.961708Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:2d4db326f3051f08d6419decd5004150472df6fe7cefe66337f835f37232500f","observation_id":"f8a28fae-9b95-43e2-a884-8c29912ebb6b","resolution":{"observed_at":"2026-08-06T20:10:41.664297Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:40.964968Z","title":"Kingma and Max Welling","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:40.964968Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:f6b114d9f608a4ff2292b0ce551db9edb51962768c6194f7a995e5a642c1b950","observation_id":"74b861e5-c9e7-4d5c-bc9a-fe62d105f6bd","resolution":{"observed_at":"2026-08-06T20:10:40.964968Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1406.2661","last_updated":"2014-06-10T18:58:17Z","snapshot_observed_at":"2026-07-06T03:46:00.791740Z","submitted_at":"2014-06-10T18:58:17Z","title":"Generative Adversarial Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1406.2661","snapshot_observed_at":"2026-08-06T20:10:40.967445Z","title":"Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron C","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:40.967445Z"},"links":{"cited_paper":"/paper/1406.2661","citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:735bce36d5d9ab104cc7b8204047075fdea715a380dd0b2511c963d5be2ca767","observation_id":"f8caa6e9-53a7-45da-833a-88ec257b4c33","resolution":{"observed_at":"2026-08-06T20:10:40.967445Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.644494Z","title":"Compre- hensive exploration of diffusion models in image generation: a survey","venue":null,"work_id":"0d7ff982-a173-466b-bc3d-019cdd18c713","year":2025},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:40.970425Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:e216c0e4dea5f8958041844a764ca17b0152e49be4111bb462982ba0aa434388","observation_id":"62af146f-3104-485b-abd2-6b72ca726d59","resolution":{"observed_at":"2026-08-06T20:10:41.648436Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:40.973272Z","title":"Zero-shot text-to-image generation","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:40.973272Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:4d9e85de4a01257507634fcf05bd5288b59c4217bcfee97649c58a9df4665864","observation_id":"42a3de08-7b33-4b2b-b670-c1e1f4507cb4","resolution":{"observed_at":"2026-08-06T20:10:40.973272Z","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-06T20:10:40.975809Z","title":"High-resolution image synthesis with latent diffusion models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:40.975809Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:87542d4e77cfd26f847cf406c96027b605379f6166ae67c96ad688aa2e163995","observation_id":"6f4fdc25-b988-4090-8ac6-a35dcd6b6115","resolution":{"observed_at":"2026-08-06T20:10:40.975809Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.621072Z","title":"Very deep V AEs generalize autoregressive models and can outperform them on images","venue":null,"work_id":"72dc1edd-8f2c-4e8b-bc7a-2eb45eda423d","year":2021},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:40.978747Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:9aca9995ff812fd792e8d8dbe92cb439e3f9578575363ed158bbfa386c5392ce","observation_id":"323b6348-d4be-4d59-9929-cbd7b5a199a8","resolution":{"observed_at":"2026-08-06T20:10:41.624665Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.611590Z","title":"Fleet, and Mohammad Norouzi","venue":null,"work_id":"753fb2a8-ae90-4451-a043-c3e4b2572794","year":2023},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:40.981321Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:02c4d75b7f596044a91d663b3bb1fb49d67149721c942a9b8f4d3127dca513f1","observation_id":"7f500c32-a5b3-412b-a46e-251ed99ff00e","resolution":{"observed_at":"2026-08-06T20:10:41.614595Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.601784Z","title":"SSD-LM: semi-autoregressive simplex- based diffusion language model for text generation and modular control","venue":null,"work_id":"97976ef6-a38d-488e-909f-e429ce0071e2","year":2023},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:40.984055Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:e36d97f1f3869dd6b7ce69ab9e28567985206e4942a17e2357dbfd44864436ea","observation_id":"2361aa64-92b0-435e-b6df-9660fd55aff2","resolution":{"observed_at":"2026-08-06T20:10:41.605090Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.591960Z","title":"Hashimoto","venue":null,"work_id":"e6a3226f-5083-4e08-a508-38b0111dfa6a","year":2022},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:40.986610Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:a81f653d1f5a874fd8264e14533369374f5c5558c72e973d91d8b2905e3c25ea","observation_id":"79f524ac-c773-4b44-8b6d-11b7b3818bdc","resolution":{"observed_at":"2026-08-06T20:10:41.594984Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2204.06125","last_updated":"2022-04-13T01:10:33Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-04-13T01:10:33Z","title":"Hierarchical Text-Conditional Image Generation with CLIP Latents","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2204.06125","snapshot_observed_at":"2026-08-06T20:10:40.989075Z","title":"Hierarchical text-conditional image generation with CLIP latents","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:40.989075Z"},"links":{"cited_paper":"/paper/2204.06125","citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:8e70a2f7b838f29a0dac8970578cbe0998646189247df93e23cdc8a367be48c6","observation_id":"e1d18eed-02bb-4a7d-aa27-06b1a79db8fc","resolution":{"observed_at":"2026-08-06T20:10:40.989075Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.582088Z","title":"Mastering text-to-image diffusion: Recaptioning, planning, and generating with multimodal LLMs","venue":null,"work_id":"95015c19-d18d-4e5a-8ed1-6491e35a45ef","year":2024},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:40.991788Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:ff1b1fb2ba4ec4f20da5cf1662e539c5bfe4dbb723744c5a9d61ae2dd3f090d0","observation_id":"435f46af-a205-45bd-9306-c8abc144e6e5","resolution":{"observed_at":"2026-08-06T20:10:41.585698Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.572909Z","title":"Generative diffusion models on graphs: Methods and applications","venue":null,"work_id":"25a76c49-c11d-4fac-8b8b-c59202dbaf07","year":2023},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:40.994820Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:75b1e4d5b2e290edce11f1f58c263ecf46213fd4c3512672ab4878e7a757d0a4","observation_id":"6ddd4f7f-1fef-444c-a8dd-7f7e0c9d6e5a","resolution":{"observed_at":"2026-08-06T20:10:41.576047Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.563465Z","title":"A survey on deep graph generation: Methods and applications","venue":null,"work_id":"e7f4b10d-c70a-4875-9375-d700becc7420","year":2022},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:40.997713Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:7a45ecdae458ae1f9f988a518b13609c232b3dc573c1151a876f64d0452bf9c8","observation_id":"fb7bb783-7668-4504-8970-64120e26f4e5","resolution":{"observed_at":"2026-08-06T20:10:41.566475Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.554721Z","title":"A systematic survey on deep generative models for graph generation","venue":null,"work_id":"acf3d221-6f4b-4a83-9242-eee34bf3794b","year":2023},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:41.000254Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:fc4972f0bddc7ee6564addc2ab07c550b5ea8e766fae911b6a42fb6dba9035ee","observation_id":"7b9c68d9-35aa-4590-a2f7-ac0d316ad651","resolution":{"observed_at":"2026-08-06T20:10:41.557704Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.545751Z","title":"Equivariant diffusion for molecule generation in 3d","venue":null,"work_id":"00bb6943-1524-4e71-85fd-a66b2b4089b1","year":2022},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:41.003121Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:b2862882e00328b76c37c4d39ac8dbd3271539c77a2468b4c1440f749f60d0d1","observation_id":"abf129b5-2ec9-49eb-ba15-97ef3ca47ef8","resolution":{"observed_at":"2026-08-06T20:10:41.548893Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.535089Z","title":"GeoDiff: A geometric diffusion model for molecular conformation generation","venue":null,"work_id":"9916f759-fdc5-4077-8aa1-93b5431cde25","year":2022},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:41.005787Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:affe5acbc6e241fc688080f7804b8b7e98380f6ed1f5cae372df0a4c3b0e9ea0","observation_id":"cfeea93d-0b66-4e89-9723-02574cb76fd6","resolution":{"observed_at":"2026-08-06T20:10:41.538991Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2304.01565","last_updated":"2023-04-04T06:41:15Z","snapshot_observed_at":"2026-08-02T23:11:18.465571Z","submitted_at":"2023-04-04T06:41:15Z","title":"A Survey on Graph Diffusion Models: Generative AI in Science for Molecule, Protein and Material","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.01565","snapshot_observed_at":"2026-08-06T20:10:41.008152Z","title":"A survey on graph diffusion models: Generative AI in science for molecule, protein and material","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:41.008152Z"},"links":{"cited_paper":"/paper/2304.01565","citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:117ea7099e5c8202b1c1cd4b572b3748561b0f5ef263b0acb1f529e5d9b9b468","observation_id":"13a63aff-0430-41fa-92ff-11d3e653c0ea","resolution":{"observed_at":"2026-08-06T20:10:41.008152Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.525762Z","title":"Directional diffusion models for graph representation learning","venue":null,"work_id":"b4f48a11-dc65-43f0-b79c-155f402edcb2","year":2023},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:41.011072Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:42bb18dfb235908d35a9c045fb7472614ee8435000a30c623bcf96ab3a694c04","observation_id":"3cd6d1f6-d597-49e3-964f-6dea2ae285ef","resolution":{"observed_at":"2026-08-06T20:10:41.528965Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.515617Z","title":"Score-based generative modeling of graphs via the system of stochastic differential equations","venue":null,"work_id":"e0935855-36d7-4c69-83c4-2897fb76a634","year":2022},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:41.013435Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:d6336ec2b878cf0dabcc45d7dd41a97a5b32df6cb8448ccf0aa8b98f810b2236","observation_id":"011a0819-4144-4c11-b024-e75d07bee989","resolution":{"observed_at":"2026-08-06T20:10:41.519079Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.504604Z","title":"Permutation invariant graph generation via score-based generative modeling","venue":null,"work_id":"a36eddc0-30b1-4d93-b716-0b5929f39f77","year":2020},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:41.015930Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:50729c71fe524f15cb85f84cffb0f21adc361376c88c1be52d9ab3b8c0287a7e","observation_id":"b6bb12dc-1be5-4e62-a2c7-95be3e4d5e79","resolution":{"observed_at":"2026-08-06T20:10:41.508011Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.492602Z","title":"GraphGDP: Generative diffusion processes for permutation invariant graph generation","venue":null,"work_id":"94481a69-d3a5-43a0-aad7-d6bdc445d5bc","year":2022},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:41.018617Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:fbc92323443eb42ffe761638fe47880c5abe7092c234817d15ddc23641439f06","observation_id":"f733956b-23c7-4006-9ae9-116db0b03c98","resolution":{"observed_at":"2026-08-06T20:10:41.496588Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.481542Z","title":"Digress: Discrete denoising diffusion for graph generation","venue":null,"work_id":"3a2fa603-159e-4c76-8cd5-2b0de263a5c3","year":2023},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:41.021187Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:caccf6d7b5c8a4f6cf086d992fa6ed601f50e0dd989034131f612938238d4db5","observation_id":"c3a074fe-ed6f-4aaa-8e8d-80aa657b6cab","resolution":{"observed_at":"2026-08-06T20:10:41.484685Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.471029Z","title":"Discrete-state continuous-time diffusion for graph generation","venue":null,"work_id":"66b0fae3-1b43-4a5a-89bf-62d2c067d4f6","year":2024},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:41.024416Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:2f14b9bf3d4ae229d4f95ad6802ce96c4feeb2ca7317ea67e9ab04d1c481813e","observation_id":"74894202-e68e-4388-90b2-bca2101fc6a7","resolution":{"observed_at":"2026-08-06T20:10:41.474673Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.13858","last_updated":"2024-10-03T16:29:02Z","snapshot_observed_at":"2026-07-06T17:20:11.913242Z","submitted_at":"2024-01-24T23:45:31Z","title":"Graph Diffusion Transformers for Multi-Conditional Molecular Generation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.13858","snapshot_observed_at":"2026-08-06T20:10:41.027253Z","title":"Inverse molecular design with multi- conditional diffusion guidance","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:41.027253Z"},"links":{"cited_paper":"/paper/2401.13858","citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:c0b5ec1eb1b723eed745c54de01d704ef162b9a866d0b05eb9f43f653aa3689b","observation_id":"05ffd21a-e882-4a66-8795-abd62fdf82d4","resolution":{"observed_at":"2026-08-06T20:10:41.027253Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.462361Z","title":"Malliaros, and Christopher Morris","venue":null,"work_id":"b85d4710-1f0d-4bb1-be80-b8bdee37c282","year":2025},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:41.030539Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:04b8ec0ade8a7270be79edf34b5b1c46155f67408efd28f1a76b079e3e04138a","observation_id":"57910df7-7585-4ff2-94e7-7203730c243a","resolution":{"observed_at":"2026-08-06T20:10:41.465351Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.453770Z","title":"Potluru, and Pan Li","venue":null,"work_id":"713d776b-1077-49df-b21f-022fca7632bb","year":2024},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:41.033862Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:94e64e5f97476cf76fad28dc71f35b1ced9a343f9ce6e4362ff00b5f1cd51d22","observation_id":"a5e99766-6fef-431b-a594-e601b5446208","resolution":{"observed_at":"2026-08-06T20:10:41.456743Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.444886Z","title":"Rossi, David Arbour, Tong Yu, Franck Dernoncourt, Sungchul Kim, Nedim Lipka, Namyong Park, Nesreen K","venue":null,"work_id":"21cbd97a-7cc6-4130-bdae-c3e1d6e16d3d","year":2024},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:41.036669Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:6a71c01a512bc61b31b57fb53310a92dc53ebe5c8db8428be34c850417a4a45f","observation_id":"393cc834-2b98-435a-affe-c8c5d93bf415","resolution":{"observed_at":"2026-08-06T20:10:41.447605Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.10893","last_updated":"2023-07-17T12:13:46Z","snapshot_observed_at":"2026-08-10T01:19:25.179885Z","submitted_at":"2023-02-07T18:25:28Z","title":"Fair Diffusion: Instructing Text-to-Image Generation Models on Fairness","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.10893","snapshot_observed_at":"2026-08-06T20:10:41.039231Z","title":"Fair diffusion: Instructing text-to-image generation models on fairness","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:41.039231Z"},"links":{"cited_paper":"/paper/2302.10893","citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:a8e0263d4f7447a11e6486dafaf248b099259c6b612e0e3a8b7ebf9f4b28f2e6","observation_id":"3b0c1971-617a-4271-9a6b-25a064c4aa94","resolution":{"observed_at":"2026-08-06T20:10:41.039231Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.435847Z","title":"Easily accessible text-to- image generation amplifies demographic stereotypes at large scale","venue":null,"work_id":"756a2774-ae43-42dd-908b-26e5178c6500","year":2023},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:41.042074Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:d83d39aaef2cda46622afaf6dc68072f1e452a510bed3d317485044fafa1c661","observation_id":"7d35b0ad-dad6-4b0b-bd3e-f12aa7359a7e","resolution":{"observed_at":"2026-08-06T20:10:41.439038Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.427604Z","title":"DALL-EV AL: probing the reasoning skills and social biases of text-to-image generation models","venue":null,"work_id":"9cc87732-ecc0-4dfd-b4c0-5473b8c68274","year":2023},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:41.044899Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:cffbabae0d28c0c77c64f966b8369a1110eea81121969f4977d4aa96a42add83","observation_id":"f8c653c2-0ad0-4a15-a586-c11d8e2c8db7","resolution":{"observed_at":"2026-08-06T20:10:41.430542Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.04339","last_updated":"2025-08-10T06:24:04Z","snapshot_observed_at":"2026-07-06T19:11:36.358087Z","submitted_at":"2024-09-06T15:17:40Z","title":"How Fair is Your Diffusion Recommender Model?","version":2},"cited_work":{"arxiv_id":"2409.04339","doi":null,"metadata_source":"pith","pith_arxiv_id":"2409.04339","snapshot_observed_at":"2026-08-06T20:10:41.249913Z","title":"How Fair is Your Diffusion Recommender Model?","venue":"cs.IR","work_id":"ba15657e-054c-4527-9079-ca5bf946f1fd","year":2024},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:41.047508Z"},"links":{"cited_paper":"/paper/2409.04339","citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:5dafe4303414bbdc63167ce1497a87222a60d5b01fc47c8a218b25a0dcbd9450","observation_id":"a8874cc8-30b2-4d67-859f-f1b375b097a8","resolution":{"observed_at":"2026-08-06T20:10:41.255285Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.418770Z","title":"Fair sampling in diffusion models through switching mechanism","venue":null,"work_id":"e2775004-ad34-4622-8b3f-f20d0352c6c7","year":2024},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:41.050686Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:49cd7d7250e678451c08f5ae1bbf99dbb4655acf5c8bebfe5916fe59080878fc","observation_id":"0cac3ac9-99fc-4cbd-a9c2-9857d353af53","resolution":{"observed_at":"2026-08-06T20:10:41.421743Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.07604","last_updated":"2024-03-15T08:42:39Z","snapshot_observed_at":"2026-08-10T08:11:15.712191Z","submitted_at":"2023-11-11T05:40:54Z","title":"Finetuning Text-to-Image Diffusion Models for Fairness","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.07604","snapshot_observed_at":"2026-08-06T20:10:41.053250Z","title":"Kankanhalli","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:41.053250Z"},"links":{"cited_paper":"/paper/2311.07604","citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:79b4723dcabcadb41518f11d01773b2555d22adc34087e9b4b594f8f850459d2","observation_id":"7e234380-5ca1-4ae2-9931-0149d5bf597a","resolution":{"observed_at":"2026-08-06T20:10:41.053250Z","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-06T20:10:41.056099Z","title":"FairGen: Controlling sensi- tive attributes for fair generations in diffusion models via adaptive latent guidance","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:41.056099Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:8638d8ee59449fdc578579337c50a50e6c64e7c15ee427d95deeed14e6e452d6","observation_id":"fed03a7e-9e41-46b4-aa70-221dafab8da7","resolution":{"observed_at":"2026-08-06T20:10:41.056099Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.404866Z","title":"Marques, and Santiago Segarra","venue":null,"work_id":"d528d05f-69a8-4397-8cff-49e39c64b0ab","year":2024},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:41.058661Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:4711738f23e35dccbb83e9f874ea42ac007c0901538dc7f497a56a62bb65b345","observation_id":"1f38b9f9-d55a-496c-949c-fc7c8f81dd99","resolution":{"observed_at":"2026-08-06T20:10:41.413161Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.389743Z","title":"Marques, and Santiago Segarra","venue":null,"work_id":"b89d1491-62d5-41d1-a0c7-74d6cb247a92","year":2024},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:41.061207Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:547854d246a89f08a43d1d51d36966e94fcc60f4ae133630aa4f0e754ff3770a","observation_id":"7b06b3ca-b16c-407c-b1a0-924f501faf78","resolution":{"observed_at":"2026-08-06T20:10:41.393259Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.380881Z","title":"FairGen: Towards fair graph generation","venue":null,"work_id":"f5a50707-39ee-444d-8520-d6407fae99b0","year":2024},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:41.063758Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:233be85a980228ebe5d90a7c160326ce3b856ebcb2acd813393397b8dcc03d6a","observation_id":"15ca778d-626b-4672-93ee-579311dd68b4","resolution":{"observed_at":"2026-08-06T20:10:41.384049Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.372233Z","title":"FairWire: Fair graph generation","venue":null,"work_id":"29c0fc35-d035-4a54-aa15-6285eef749cc","year":2024},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:41.067642Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:c252ebec27a2dcb54eb0dd7c05781f2e8c4a3c915ed412fe26cdf26632e8e2e0","observation_id":"cb1b036d-ca7b-4b27-8091-fc106f2db586","resolution":{"observed_at":"2026-08-06T20:10:41.375116Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.362247Z","title":"Optimal transport for structured data with application on graphs","venue":null,"work_id":"f9b044ce-9bef-4c77-851f-26dcec314bf1","year":2019},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:41.070208Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:f90f72f31301397b54420918236691153727d7e6b90ae625805c1de64d9294ac","observation_id":"50ccd51d-d423-42b7-aa5f-a5f693988a41","resolution":{"observed_at":"2026-08-06T20:10:41.365620Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.352678Z","title":"Collective classification in network data","venue":null,"work_id":"1904a477-a514-4a71-ba43-e3fb1f023c3a","year":2008},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:41.073544Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:6229c94585ba3324c894fa59ca35b8ed427bf4a9822e88c2aa469a82a584e95b","observation_id":"c2c73deb-ad22-4787-9f92-8f469aa0a3b2","resolution":{"observed_at":"2026-08-06T20:10:41.355625Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1811.05868","last_updated":"2019-06-18T13:15:39Z","snapshot_observed_at":"2026-08-10T09:46:29.797564Z","submitted_at":"2018-11-14T15:53:19Z","title":"Pitfalls of Graph Neural Network Evaluation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.05868","snapshot_observed_at":"2026-08-06T20:10:41.076309Z","title":"Pitfalls of graph neural network evaluation","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:41.076309Z"},"links":{"cited_paper":"/paper/1811.05868","citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:35aff46f61decef3f59ef0abc1d86b03865213a8fc83a5790d93ca178b1233bf","observation_id":"1fc326de-2943-4c26-840d-047b0dc1962d","resolution":{"observed_at":"2026-08-06T20:10:41.076309Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.343243Z","title":"Sagess: A sampling graph denoising diffusion model for scalable graph generation","venue":null,"work_id":"0b6974bc-70f4-4e5f-81ad-f4243f21af66","year":2024},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:41.079574Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:1f3962acd08fbdaa1345467d416be35cf1028343ea9bf05c7888b45623a9feba","observation_id":"cac8f685-d665-4e3b-9955-818b6286a81d","resolution":{"observed_at":"2026-08-06T20:10:41.346733Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.333554Z","title":"Optimal Transport: Old and New","venue":null,"work_id":"96f30b11-f5d9-42e9-b4a0-42d5f258723f","year":2008},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:41.082516Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:cf1725fb359c184b897c7f355bbd52eaf38c051e848e107f156439496b2ac370","observation_id":"6702bd59-7cc2-4bc3-a85a-bed29180b657","resolution":{"observed_at":"2026-08-06T20:10:41.337046Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.323621Z","title":"Gromov-wasserstein distances and the metric approach to object matching","venue":null,"work_id":"54a42997-d919-4a2a-b149-7f793f4d543c","year":2011},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:41.085540Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:5fa0ea1ef206765012ada6a708155b62e7c3ca40346532fdaac744b106c1fd08","observation_id":"4b47dae6-9514-4d52-b537-7b30bab3d24b","resolution":{"observed_at":"2026-08-06T20:10:41.326775Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:10:41.314042Z","title":"original graph","venue":null,"work_id":"7257315a-1ae3-4de0-9b77-02665b0a17d3","year":2016},"citing_paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-06T20:10:41.088282Z"},"links":{"citing_paper":"/paper/2507.03728"},"observation_digest":"sha256:a1d39a785dfa101f3438d729f5bcc3e31f54e80c88cc6820c4e8a2f5c746ae77","observation_id":"d5df36af-edaf-4f47-87a7-b0931899dd34","resolution":{"observed_at":"2026-08-06T20:10:41.317337Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.03728","last_updated":"2025-07-04T17:31:41Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T10:13:09.495457Z","submitted_at":"2025-07-04T17:31:41Z","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms"},"reference_resolution":{"displayed":65,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":14,"verified_exact":0,"verified_fuzzy":50},"total_outbound_references":65},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 65 of 65 outbound references and 0 inbound Pith citation observations for arXiv:2507.03728."}