{"as_of":"2026-08-19T16:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fda9bed33bf30a2e0427b3894cc39555cf0a1c6c09d710614d1a1048e55d8f6b","coverage":[{"denominator":27,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":27,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T22:27:55.759384Z","state":"measured"},{"denominator":27,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":27,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+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/2505.07171/citation-record","integrity":"/paper/2505.07171/integrity","json":"/paper/2505.07171/citation-record.json","paper":"/paper/2505.07171"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:27:55.655972Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2505.07171","last_updated":"2025-05-12T01:49:52Z","snapshot_observed_at":"2026-08-19T07:44:35.468259Z","submitted_at":"2025-05-12T01:49:52Z","title":"ReCDAP: Relation-Based Conditional Diffusion with Attention Pooling for Few-Shot Knowledge Graph Completion","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T22:27:55.655972Z"},"links":{"citing_paper":"/paper/2505.07171"},"observation_digest":"sha256:d75b0c3041d0f89efe3b4194c271b78c87e8c31a443a1241ef061509a9945b8d","observation_id":"97849011-d2e8-45f5-8455-7c5097219a3d","resolution":{"observed_at":"2026-08-15T22:27:55.655972Z","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-15T22:27:56.473307Z","title":"Hr- uschka, and Tom M","venue":null,"work_id":"793501d1-7887-434b-99f3-b943eac87ecd","year":2010},"citing_paper":{"arxiv_id":"2505.07171","last_updated":"2025-05-12T01:49:52Z","snapshot_observed_at":"2026-08-19T07:44:35.468259Z","submitted_at":"2025-05-12T01:49:52Z","title":"ReCDAP: Relation-Based Conditional Diffusion with Attention Pooling for Few-Shot Knowledge Graph Completion","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T22:27:55.660627Z"},"links":{"citing_paper":"/paper/2505.07171"},"observation_digest":"sha256:948170b90c756ba7d83c2f52ac68e5d5fcfec493f08ff5b60cde8859081a0830","observation_id":"0111bfd0-aee5-41eb-ae80-bff927e26946","resolution":{"observed_at":"2026-08-15T22:27:56.476736Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.18653/v1/d19-1431","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:27:55.820259Z","title":null,"venue":null,"work_id":"dd2b199d-e6ed-4b35-bd8c-d604e57b580c","year":2019},"citing_paper":{"arxiv_id":"2505.07171","last_updated":"2025-05-12T01:49:52Z","snapshot_observed_at":"2026-08-19T07:44:35.468259Z","submitted_at":"2025-05-12T01:49:52Z","title":"ReCDAP: Relation-Based Conditional Diffusion with Attention Pooling for Few-Shot Knowledge Graph Completion","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T22:27:55.664389Z"},"links":{"citing_paper":"/paper/2505.07171"},"observation_digest":"sha256:c625261d6d7db49fb577121b7e5683bd644deced9a1fe2e381015161a4934c69","observation_id":"00dc9396-f5af-445a-b640-7c4c4d2a2498","resolution":{"observed_at":"2026-08-15T22:27:55.824075Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T22:27:55.668367Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.07171","last_updated":"2025-05-12T01:49:52Z","snapshot_observed_at":"2026-08-19T07:44:35.468259Z","submitted_at":"2025-05-12T01:49:52Z","title":"ReCDAP: Relation-Based Conditional Diffusion with Attention Pooling for Few-Shot Knowledge Graph Completion","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T22:27:55.668367Z"},"links":{"citing_paper":"/paper/2505.07171"},"observation_digest":"sha256:c83a965ba32036816a99f5fd480522b804d655f5ccf5daf1ab382042458de4bd","observation_id":"72b56d20-2682-4db6-afbc-1c314be82c7b","resolution":{"observed_at":"2026-08-15T22:27:55.668367Z","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-15T22:27:55.672518Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.07171","last_updated":"2025-05-12T01:49:52Z","snapshot_observed_at":"2026-08-19T07:44:35.468259Z","submitted_at":"2025-05-12T01:49:52Z","title":"ReCDAP: Relation-Based Conditional Diffusion with Attention Pooling for Few-Shot Knowledge Graph Completion","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T22:27:55.672518Z"},"links":{"citing_paper":"/paper/2505.07171"},"observation_digest":"sha256:c0caa25ce6b38ba8a03cec6d400e95c3093fe0da7fbb9ed606e9c50490034b02","observation_id":"69de1fa7-065e-4efd-8df5-34e010402eec","resolution":{"observed_at":"2026-08-15T22:27:55.672518Z","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-15T22:27:55.676867Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.07171","last_updated":"2025-05-12T01:49:52Z","snapshot_observed_at":"2026-08-19T07:44:35.468259Z","submitted_at":"2025-05-12T01:49:52Z","title":"ReCDAP: Relation-Based Conditional Diffusion with Attention Pooling for Few-Shot Knowledge Graph Completion","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T22:27:55.676867Z"},"links":{"citing_paper":"/paper/2505.07171"},"observation_digest":"sha256:27fde7950d7b7827a37267c404fa7da59efd2258ca9e0d799c7264206a9d45c6","observation_id":"146a4c63-af18-4df2-a8fe-88b337f7aea5","resolution":{"observed_at":"2026-08-15T22:27:55.676867Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.18653/v1/2022.emnlp-main.524","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:27:55.807805Z","title":null,"venue":null,"work_id":"f7afa12f-d181-40e8-a5ad-45f99331288f","year":2022},"citing_paper":{"arxiv_id":"2505.07171","last_updated":"2025-05-12T01:49:52Z","snapshot_observed_at":"2026-08-19T07:44:35.468259Z","submitted_at":"2025-05-12T01:49:52Z","title":"ReCDAP: Relation-Based Conditional Diffusion with Attention Pooling for Few-Shot Knowledge Graph Completion","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T22:27:55.681955Z"},"links":{"citing_paper":"/paper/2505.07171"},"observation_digest":"sha256:75564503490365c3b6af19efdb52b681175a989e66f8dacf36b79716d450dab7","observation_id":"194c2bc9-c20e-403c-8c82-a2387fb60016","resolution":{"observed_at":"2026-08-15T22:27:55.812582Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2021.93908","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:27:56.300325Z","title":null,"venue":null,"work_id":"05e29368-a234-4221-bdb6-d77f586de647","year":2021},"citing_paper":{"arxiv_id":"2505.07171","last_updated":"2025-05-12T01:49:52Z","snapshot_observed_at":"2026-08-19T07:44:35.468259Z","submitted_at":"2025-05-12T01:49:52Z","title":"ReCDAP: Relation-Based Conditional Diffusion with Attention Pooling for Few-Shot Knowledge Graph Completion","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T22:27:55.686922Z"},"links":{"citing_paper":"/paper/2505.07171"},"observation_digest":"sha256:65629e308de38508a3dbecc724cb068f6bed88fee84a639271daabe2919be683","observation_id":"df1beae7-d354-4a64-94ee-10bd7779d966","resolution":{"observed_at":"2026-08-15T22:27:56.305913Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T22:27:55.690708Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.07171","last_updated":"2025-05-12T01:49:52Z","snapshot_observed_at":"2026-08-19T07:44:35.468259Z","submitted_at":"2025-05-12T01:49:52Z","title":"ReCDAP: Relation-Based Conditional Diffusion with Attention Pooling for Few-Shot Knowledge Graph Completion","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T22:27:55.690708Z"},"links":{"citing_paper":"/paper/2505.07171"},"observation_digest":"sha256:1ddbb16fe2298d8998052e57fbf0b94ed1969baf3ec2ed8f15e4c4ea5336d573","observation_id":"90907787-3ecd-4c0a-9b59-929fc093e71b","resolution":{"observed_at":"2026-08-15T22:27:55.690708Z","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-15T22:27:56.449438Z","title":null,"venue":null,"work_id":"1bd40adf-e2a2-449b-8deb-0e67a247c3e8","year":2024},"citing_paper":{"arxiv_id":"2505.07171","last_updated":"2025-05-12T01:49:52Z","snapshot_observed_at":"2026-08-19T07:44:35.468259Z","submitted_at":"2025-05-12T01:49:52Z","title":"ReCDAP: Relation-Based Conditional Diffusion with Attention Pooling for Few-Shot Knowledge Graph Completion","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T22:27:55.694497Z"},"links":{"citing_paper":"/paper/2505.07171"},"observation_digest":"sha256:e6afa9e8e5b31f26063a7b9a11be89fccfccecb8cf0bf5e81cfc45496badd6a7","observation_id":"e3b9564f-4d60-4f99-b9fe-5313b1e7be05","resolution":{"observed_at":"2026-08-15T22:27:56.453214Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T22:27:55.698272Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.07171","last_updated":"2025-05-12T01:49:52Z","snapshot_observed_at":"2026-08-19T07:44:35.468259Z","submitted_at":"2025-05-12T01:49:52Z","title":"ReCDAP: Relation-Based Conditional Diffusion with Attention Pooling for Few-Shot Knowledge Graph Completion","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T22:27:55.698272Z"},"links":{"citing_paper":"/paper/2505.07171"},"observation_digest":"sha256:588ad097c9fe3c8a43623c1770601de2c3e6a70f4b8c398c033e312ec90bee00","observation_id":"c1b2241e-eeb2-4727-83fd-490bf06418ee","resolution":{"observed_at":"2026-08-15T22:27:55.698272Z","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-15T22:27:55.702087Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.07171","last_updated":"2025-05-12T01:49:52Z","snapshot_observed_at":"2026-08-19T07:44:35.468259Z","submitted_at":"2025-05-12T01:49:52Z","title":"ReCDAP: Relation-Based Conditional Diffusion with Attention Pooling for Few-Shot Knowledge Graph Completion","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T22:27:55.702087Z"},"links":{"citing_paper":"/paper/2505.07171"},"observation_digest":"sha256:8d29ab6498575e7922f8cc81db0c95bf1def0ffe7cf7bd1f3dd19f2ea9897369","observation_id":"f2a2b402-5cfb-4b07-8f4e-c74d25f7b5c9","resolution":{"observed_at":"2026-08-15T22:27:55.702087Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.15393","last_updated":"2025-01-26T04:20:34Z","snapshot_observed_at":"2026-08-18T21:56:36.486435Z","submitted_at":"2025-01-26T04:20:34Z","title":"Diffusion-based Hierarchical Negative Sampling for Multimodal Knowledge Graph Completion","version":1},"cited_work":{"arxiv_id":"2501.15393","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.15393","snapshot_observed_at":"2026-08-15T22:27:56.060306Z","title":"Diffusion-based Hierarchical Negative Sampling for Multimodal Knowledge Graph Completion","venue":"cs.AI","work_id":"1edae8a4-2690-4c66-81fc-5e06005a7f50","year":2025},"citing_paper":{"arxiv_id":"2505.07171","last_updated":"2025-05-12T01:49:52Z","snapshot_observed_at":"2026-08-19T07:44:35.468259Z","submitted_at":"2025-05-12T01:49:52Z","title":"ReCDAP: Relation-Based Conditional Diffusion with Attention Pooling for Few-Shot Knowledge Graph Completion","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T22:27:55.706486Z"},"links":{"cited_paper":"/paper/2501.15393","citing_paper":"/paper/2505.07171"},"observation_digest":"sha256:e5f0f84db1326dbb1a13c1921fc23d2d2aec17cb4b0f8daf4c8d6445a12db3b4","observation_id":"3541efbc-e9ff-4292-ac9d-693faa507ec5","resolution":{"observed_at":"2026-08-15T22:27:56.065206Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T22:27:55.710640Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.07171","last_updated":"2025-05-12T01:49:52Z","snapshot_observed_at":"2026-08-19T07:44:35.468259Z","submitted_at":"2025-05-12T01:49:52Z","title":"ReCDAP: Relation-Based Conditional Diffusion with Attention Pooling for Few-Shot Knowledge Graph Completion","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T22:27:55.710640Z"},"links":{"citing_paper":"/paper/2505.07171"},"observation_digest":"sha256:613eb4256c389bd149c0fd6fc6f2dd48fca497f735007482eeaa096e2024f975","observation_id":"f12d45f0-6b84-4264-b6cc-023320aa84f7","resolution":{"observed_at":"2026-08-15T22:27:55.710640Z","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-15T22:27:56.431590Z","title":null,"venue":null,"work_id":"5391036b-85dc-42b2-b11e-0b4bc09bcfbc","year":2020},"citing_paper":{"arxiv_id":"2505.07171","last_updated":"2025-05-12T01:49:52Z","snapshot_observed_at":"2026-08-19T07:44:35.468259Z","submitted_at":"2025-05-12T01:49:52Z","title":"ReCDAP: Relation-Based Conditional Diffusion with Attention Pooling for Few-Shot Knowledge Graph Completion","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T22:27:55.714596Z"},"links":{"citing_paper":"/paper/2505.07171"},"observation_digest":"sha256:e78b501d66d790138ee29b59be628b1f2bd19d67872f55863ca4a7b5a5787739","observation_id":"b363ee17-d2cb-4337-ad5f-2ea306befdce","resolution":{"observed_at":"2026-08-15T22:27:56.435388Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T22:27:55.721755Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.07171","last_updated":"2025-05-12T01:49:52Z","snapshot_observed_at":"2026-08-19T07:44:35.468259Z","submitted_at":"2025-05-12T01:49:52Z","title":"ReCDAP: Relation-Based Conditional Diffusion with Attention Pooling for Few-Shot Knowledge Graph Completion","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T22:27:55.721755Z"},"links":{"citing_paper":"/paper/2505.07171"},"observation_digest":"sha256:4a0db5adf546f24011f67c273a1055b71eab75a4433d0e6096a5d22003b22b56","observation_id":"313b0705-f6fb-4e90-bf8e-2e2c066f70a2","resolution":{"observed_at":"2026-08-15T22:27:55.721755Z","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-15T22:27:55.729238Z","title":"Suchanek, Gjergji Kasneci, and Gerhard Weikum","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2505.07171","last_updated":"2025-05-12T01:49:52Z","snapshot_observed_at":"2026-08-19T07:44:35.468259Z","submitted_at":"2025-05-12T01:49:52Z","title":"ReCDAP: Relation-Based Conditional Diffusion with Attention Pooling for Few-Shot Knowledge Graph Completion","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T22:27:55.729238Z"},"links":{"citing_paper":"/paper/2505.07171"},"observation_digest":"sha256:f9c7eabc0efdada7eab21572348a855d84392b0afe70a4dfade5e10e23f3778b","observation_id":"12bfd097-0ba7-4158-bf03-2039b4705f11","resolution":{"observed_at":"2026-08-15T22:27:55.729238Z","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-15T22:27:55.732919Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.07171","last_updated":"2025-05-12T01:49:52Z","snapshot_observed_at":"2026-08-19T07:44:35.468259Z","submitted_at":"2025-05-12T01:49:52Z","title":"ReCDAP: Relation-Based Conditional Diffusion with Attention Pooling for Few-Shot Knowledge Graph Completion","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T22:27:55.732919Z"},"links":{"citing_paper":"/paper/2505.07171"},"observation_digest":"sha256:1737ddf197c789e9126509fc2d9956cb289d87aad2ccfa87f111a00382bc41a9","observation_id":"e637d7e6-8643-4753-8eaf-319430f07cc1","resolution":{"observed_at":"2026-08-15T22:27:55.732919Z","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-15T22:27:55.736792Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.07171","last_updated":"2025-05-12T01:49:52Z","snapshot_observed_at":"2026-08-19T07:44:35.468259Z","submitted_at":"2025-05-12T01:49:52Z","title":"ReCDAP: Relation-Based Conditional Diffusion with Attention Pooling for Few-Shot Knowledge Graph Completion","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T22:27:55.736792Z"},"links":{"citing_paper":"/paper/2505.07171"},"observation_digest":"sha256:12f07f41b648a5a7e0219b80e8d58f4d57a02bee7cd0415020a7789998a2a0d5","observation_id":"d044bea2-8b46-44a2-a0cb-eb822c8ca8a0","resolution":{"observed_at":"2026-08-15T22:27:55.736792Z","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-15T22:27:56.398305Z","title":null,"venue":null,"work_id":"9a50f577-01cb-4fe7-8465-88104bea860f","year":2021},"citing_paper":{"arxiv_id":"2505.07171","last_updated":"2025-05-12T01:49:52Z","snapshot_observed_at":"2026-08-19T07:44:35.468259Z","submitted_at":"2025-05-12T01:49:52Z","title":"ReCDAP: Relation-Based Conditional Diffusion with Attention Pooling for Few-Shot Knowledge Graph Completion","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T22:27:55.740539Z"},"links":{"citing_paper":"/paper/2505.07171"},"observation_digest":"sha256:f7e5e238a5174d0a39549e0bad7716a9a343908d71e66c76bb5877839bf61144","observation_id":"c2e5b6ec-770b-4ecd-8ad5-aa39773b9629","resolution":{"observed_at":"2026-08-15T22:27:56.402111Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T22:27:55.744392Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.07171","last_updated":"2025-05-12T01:49:52Z","snapshot_observed_at":"2026-08-19T07:44:35.468259Z","submitted_at":"2025-05-12T01:49:52Z","title":"ReCDAP: Relation-Based Conditional Diffusion with Attention Pooling for Few-Shot Knowledge Graph Completion","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T22:27:55.744392Z"},"links":{"citing_paper":"/paper/2505.07171"},"observation_digest":"sha256:ef1fc9ed8ec6377b01472056aff01f1447c2988a991a5568ddc57f0aca306695","observation_id":"cebdc34f-04f4-417a-adf3-d891f6714d21","resolution":{"observed_at":"2026-08-15T22:27:55.744392Z","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-15T22:27:55.748049Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.07171","last_updated":"2025-05-12T01:49:52Z","snapshot_observed_at":"2026-08-19T07:44:35.468259Z","submitted_at":"2025-05-12T01:49:52Z","title":"ReCDAP: Relation-Based Conditional Diffusion with Attention Pooling for Few-Shot Knowledge Graph Completion","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T22:27:55.748049Z"},"links":{"citing_paper":"/paper/2505.07171"},"observation_digest":"sha256:53ecddb8977afa9f035d951d364c3bdcdb4de40407576b07cdf99e35d01c061b","observation_id":"f41e4348-b0cc-470b-ba81-10678a77d978","resolution":{"observed_at":"2026-08-15T22:27:55.748049Z","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-15T22:27:56.377755Z","title":null,"venue":null,"work_id":"44606f79-8540-43f2-880b-0f7cd26a0361","year":2020},"citing_paper":{"arxiv_id":"2505.07171","last_updated":"2025-05-12T01:49:52Z","snapshot_observed_at":"2026-08-19T07:44:35.468259Z","submitted_at":"2025-05-12T01:49:52Z","title":"ReCDAP: Relation-Based Conditional Diffusion with Attention Pooling for Few-Shot Knowledge Graph Completion","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T22:27:55.755722Z"},"links":{"citing_paper":"/paper/2505.07171"},"observation_digest":"sha256:dc17dac5a26fa66f539fe6b9751d24d148d27f176459cce3438ad088f75512fe","observation_id":"2190d699-2259-4577-8a42-870cdec0dfc9","resolution":{"observed_at":"2026-08-15T22:27:56.381822Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T22:27:55.759384Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.07171","last_updated":"2025-05-12T01:49:52Z","snapshot_observed_at":"2026-08-19T07:44:35.468259Z","submitted_at":"2025-05-12T01:49:52Z","title":"ReCDAP: Relation-Based Conditional Diffusion with Attention Pooling for Few-Shot Knowledge Graph Completion","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T22:27:55.759384Z"},"links":{"citing_paper":"/paper/2505.07171"},"observation_digest":"sha256:58014298f006dc1452a21d8518c4d65fdac159f9cb5d3a2153011c4b9443eb2d","observation_id":"4221e9c7-d675-485a-82f5-634f4febfe0e","resolution":{"observed_at":"2026-08-15T22:27:55.759384Z","resolver_source":null,"status":"malformed_identifier"},"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-15T22:27:55.718158Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.07171","last_updated":"2025-05-12T01:49:52Z","snapshot_observed_at":"2026-08-19T07:44:35.468259Z","submitted_at":"2025-05-12T01:49:52Z","title":"ReCDAP: Relation-Based Conditional Diffusion with Attention Pooling for Few-Shot Knowledge Graph Completion","version":1},"reference_index":1691,"source":"pdf_text","source_observed_at":"2026-08-15T22:27:55.718158Z"},"links":{"citing_paper":"/paper/2505.07171"},"observation_digest":"sha256:b73692cf4f1da6064906904a8b782d7a090158789802c7c33d01487f959fe7dc","observation_id":"a9f817d0-9e6f-4671-932b-ab3b604a10db","resolution":{"observed_at":"2026-08-15T22:27:55.718158Z","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-15T22:27:55.725527Z","title":"In International conference on machine learning","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.07171","last_updated":"2025-05-12T01:49:52Z","snapshot_observed_at":"2026-08-19T07:44:35.468259Z","submitted_at":"2025-05-12T01:49:52Z","title":"ReCDAP: Relation-Based Conditional Diffusion with Attention Pooling for Few-Shot Knowledge Graph Completion","version":1},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-15T22:27:55.725527Z"},"links":{"citing_paper":"/paper/2505.07171"},"observation_digest":"sha256:a9b3b6209dbac3b17720249a1e14fef7b9e655d06fd481f92674125c4d1b5f14","observation_id":"5d0c5b21-e3dd-4c0b-ab7b-9549e83ea52c","resolution":{"observed_at":"2026-08-15T22:27:55.725527Z","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-15T22:27:55.752132Z","title":"In Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing , Ellen Riloff, David Chiang, Julia Hockenmaier, and Jun’ichi Tsujii (Eds.)","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.07171","last_updated":"2025-05-12T01:49:52Z","snapshot_observed_at":"2026-08-19T07:44:35.468259Z","submitted_at":"2025-05-12T01:49:52Z","title":"ReCDAP: Relation-Based Conditional Diffusion with Attention Pooling for Few-Shot Knowledge Graph Completion","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-15T22:27:55.752132Z"},"links":{"citing_paper":"/paper/2505.07171"},"observation_digest":"sha256:f32d6f389ce7573b773eb95647f482ac1923ae915e71c97a62b280680ab70783","observation_id":"827cabc3-08f2-4fc8-b8db-6d9bcc4dd0fd","resolution":{"observed_at":"2026-08-15T22:27:55.752132Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.07171","last_updated":"2025-05-12T01:49:52Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-19T07:44:35.468259Z","submitted_at":"2025-05-12T01:49:52Z","title":"ReCDAP: Relation-Based Conditional Diffusion with Attention Pooling for Few-Shot Knowledge Graph Completion"},"reference_resolution":{"displayed":27,"state_counts":{"malformed_identifier":2,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":20,"verified_exact":3,"verified_fuzzy":1},"total_outbound_references":27},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 27 of 27 outbound references and 0 inbound Pith citation observations for arXiv:2505.07171."}