{"as_of":"2026-08-09T16:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a8a4656fb781fb4134d3ad8daa2d8bbbef4767ee4badba1fba37c4eafbf42bf1","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":20,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":20,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":20,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T20:00:46.045823Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-04T19:20:06.897069Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1911.03082","last_updated":"2020-01-18T22:50:01Z","snapshot_observed_at":"2026-07-06T08:35:28.740170Z","submitted_at":"2019-11-08T06:48:40Z","title":"Composition-based Multi-Relational Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.03082","snapshot_observed_at":"2026-08-07T15:42:26.183124Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.14020","last_updated":"2025-05-29T07:45:13Z","snapshot_observed_at":"2026-08-08T01:32:27.239864Z","submitted_at":"2025-05-20T07:22:03Z","title":"Disentangled Multi-span Evolutionary Network against Temporal Knowledge Graph Reasoning","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T15:42:26.183124Z"},"links":{"cited_paper":"/paper/1911.03082","citing_paper":"/paper/2505.14020"},"observation_digest":"sha256:1e3c02d9271b3bfa6a0706c50e870cffac691f2b79809ef0e00955f43afeba51","observation_id":"222f7b60-c1f9-4e44-a585-d873ad098555","resolution":{"observed_at":"2026-08-07T15:42:26.183124Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.03082","last_updated":"2020-01-18T22:50:01Z","snapshot_observed_at":"2026-07-06T08:35:28.740170Z","submitted_at":"2019-11-08T06:48:40Z","title":"Composition-based Multi-Relational Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.03082","snapshot_observed_at":"2026-08-07T13:25:19.078976Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.21926","last_updated":"2025-05-28T03:21:28Z","snapshot_observed_at":"2026-08-08T22:38:43.420698Z","submitted_at":"2025-05-28T03:21:28Z","title":"Beyond Completion: A Foundation Model for General Knowledge Graph Reasoning","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T13:25:19.078976Z"},"links":{"cited_paper":"/paper/1911.03082","citing_paper":"/paper/2505.21926"},"observation_digest":"sha256:17ea5cce095011292cfe89190da9bd82dfb19f943d497b4b1f1751419302a6fd","observation_id":"f1ec09b6-ae1b-4db5-bc48-8d9c0a13a359","resolution":{"observed_at":"2026-08-07T13:25:19.078976Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.03082","last_updated":"2020-01-18T22:50:01Z","snapshot_observed_at":"2026-07-06T08:35:28.740170Z","submitted_at":"2019-11-08T06:48:40Z","title":"Composition-based Multi-Relational Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.03082","snapshot_observed_at":"2026-08-07T13:23:44.872150Z","title":"Composition- based multi-relational graph convolutional networks,","venue":null,"work_id":null,"year":1911},"citing_paper":{"arxiv_id":"2505.21973","last_updated":"2025-05-28T04:50:58Z","snapshot_observed_at":"2026-08-09T02:29:30.226783Z","submitted_at":"2025-05-28T04:50:58Z","title":"Towards Structure-aware Model for Multi-modal Knowledge Graph Completion","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T13:23:44.872150Z"},"links":{"cited_paper":"/paper/1911.03082","citing_paper":"/paper/2505.21973"},"observation_digest":"sha256:acd702082238e948de6fd715908e13412fd775aa0bec911806e719d190636894","observation_id":"b81a8526-d8a2-465d-95bf-c008af37d153","resolution":{"observed_at":"2026-08-07T13:23:44.872150Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.03082","last_updated":"2020-01-18T22:50:01Z","snapshot_observed_at":"2026-07-06T08:35:28.740170Z","submitted_at":"2019-11-08T06:48:40Z","title":"Composition-based Multi-Relational Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.03082","snapshot_observed_at":"2026-08-07T12:01:08.214374Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.00826","last_updated":"2025-08-08T18:42:44Z","snapshot_observed_at":"2026-08-09T05:55:51.471536Z","submitted_at":"2025-06-01T04:12:25Z","title":"HERGC: Heterogeneous Experts Representation and Generative Completion for Multimodal Knowledge Graphs","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T12:01:08.214374Z"},"links":{"cited_paper":"/paper/1911.03082","citing_paper":"/paper/2506.00826"},"observation_digest":"sha256:cd4c4cdb838cde0412ed0def26d84f4ba12657bddb25914e27b3fdeb1da30219","observation_id":"a5eac48f-baa2-4d36-a8c6-0e56fa59c02d","resolution":{"observed_at":"2026-08-07T12:01:08.214374Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.03082","last_updated":"2020-01-18T22:50:01Z","snapshot_observed_at":"2026-07-06T08:35:28.740170Z","submitted_at":"2019-11-08T06:48:40Z","title":"Composition-based Multi-Relational Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.03082","snapshot_observed_at":"2026-08-07T11:52:19.193433Z","title":"Composition-based multi-relational graph convolutional networks","venue":null,"work_id":null,"year":1911},"citing_paper":{"arxiv_id":"2506.01376","last_updated":"2025-06-02T07:08:39Z","snapshot_observed_at":"2026-08-07T11:41:22.179693Z","submitted_at":"2025-06-02T07:08:39Z","title":"Modeling All-Atom Glycan Structures via Hierarchical Message Passing and Multi-Scale Pre-training","version":1},"reference_index":2008,"source":"pdf_text","source_observed_at":"2026-08-07T11:52:19.193433Z"},"links":{"cited_paper":"/paper/1911.03082","citing_paper":"/paper/2506.01376"},"observation_digest":"sha256:23c4cc8745c8f41b83c7a9d20366c4410cffee4dc1b532ca3164bf3f6f98a238","observation_id":"7dc69a14-6ba1-4474-9b95-0a22a69acbb9","resolution":{"observed_at":"2026-08-07T11:52:19.193433Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.03082","last_updated":"2020-01-18T22:50:01Z","snapshot_observed_at":"2026-07-06T08:35:28.740170Z","submitted_at":"2019-11-08T06:48:40Z","title":"Composition-based Multi-Relational Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.03082","snapshot_observed_at":"2026-08-07T11:04:38.604651Z","title":"Composition-based multi-relational graph convolutional networks","venue":null,"work_id":null,"year":1911},"citing_paper":{"arxiv_id":"2506.03576","last_updated":"2025-06-04T04:47:24Z","snapshot_observed_at":"2026-08-09T02:28:51.329515Z","submitted_at":"2025-06-04T04:47:24Z","title":"KG-BiLM: Knowledge Graph Embedding via Bidirectional Language Models","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:38.604651Z"},"links":{"cited_paper":"/paper/1911.03082","citing_paper":"/paper/2506.03576"},"observation_digest":"sha256:7f68c5755e0f8babc116e207625cd548a6e261e2d92517ecf0d8c642caf1257c","observation_id":"8a5b1650-be7c-4ccb-a96e-37d81e62dd31","resolution":{"observed_at":"2026-08-07T11:04:38.604651Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.03082","last_updated":"2020-01-18T22:50:01Z","snapshot_observed_at":"2026-07-06T08:35:28.740170Z","submitted_at":"2019-11-08T06:48:40Z","title":"Composition-based Multi-Relational Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.03082","snapshot_observed_at":"2026-08-07T10:18:56.319671Z","title":"Composition- based multi-relational graph convolutional networks,","venue":null,"work_id":null,"year":1911},"citing_paper":{"arxiv_id":"2506.05626","last_updated":"2025-06-29T19:40:42Z","snapshot_observed_at":"2026-08-09T00:16:45.140562Z","submitted_at":"2025-06-05T22:59:39Z","title":"Two-dimensional Taxonomy for N-ary Knowledge Representation Learning Methods","version":2},"reference_index":172,"source":"pdf_text","source_observed_at":"2026-08-07T10:18:56.319671Z"},"links":{"cited_paper":"/paper/1911.03082","citing_paper":"/paper/2506.05626"},"observation_digest":"sha256:9d2d78cd870be518669f020163b713f5eb2fb7d5f056c526b29d44f517712327","observation_id":"39067e30-d493-4afb-8490-66bbb30030b7","resolution":{"observed_at":"2026-08-07T10:18:56.319671Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.03082","last_updated":"2020-01-18T22:50:01Z","snapshot_observed_at":"2026-07-06T08:35:28.740170Z","submitted_at":"2019-11-08T06:48:40Z","title":"Composition-based Multi-Relational Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.03082","snapshot_observed_at":"2026-08-06T21:54:43.772007Z","title":"arXiv preprint arXiv:1911.03082 (2019)","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.23141","last_updated":"2025-09-10T16:23:48Z","snapshot_observed_at":"2026-08-09T02:29:29.756066Z","submitted_at":"2025-06-29T08:37:48Z","title":"Context-Driven Knowledge Graph Completion with Semantic-Aware Relational Message Passing","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T21:54:43.772007Z"},"links":{"cited_paper":"/paper/1911.03082","citing_paper":"/paper/2506.23141"},"observation_digest":"sha256:dbefb316ac36375423c1476fc660dbd8e3dccaf366c06f09f1b176dcdba95e4d","observation_id":"63c3c206-f963-4878-af44-2f8c281597e1","resolution":{"observed_at":"2026-08-06T21:54:43.772007Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.03082","last_updated":"2020-01-18T22:50:01Z","snapshot_observed_at":"2026-07-06T08:35:28.740170Z","submitted_at":"2019-11-08T06:48:40Z","title":"Composition-based Multi-Relational Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.03082","snapshot_observed_at":"2026-08-06T18:45:18.020329Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.07595","last_updated":"2025-07-10T09:54:37Z","snapshot_observed_at":"2026-08-09T04:07:20.143114Z","submitted_at":"2025-07-10T09:54:37Z","title":"Context Pooling: Query-specific Graph Pooling for Generic Inductive Link Prediction in Knowledge Graphs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T18:45:18.020329Z"},"links":{"cited_paper":"/paper/1911.03082","citing_paper":"/paper/2507.07595"},"observation_digest":"sha256:2557d6792c8a615d5ddcd525645aacf70ec2dec0a14f3f8bf88f16c3dc0db641","observation_id":"3a027452-8669-4e3f-9e34-51708190606a","resolution":{"observed_at":"2026-08-06T18:45:18.020329Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.03082","last_updated":"2020-01-18T22:50:01Z","snapshot_observed_at":"2026-07-06T08:35:28.740170Z","submitted_at":"2019-11-08T06:48:40Z","title":"Composition-based Multi-Relational Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.03082","snapshot_observed_at":"2026-08-06T15:58:46.131735Z","title":"Vashishth, S","venue":null,"work_id":null,"year":1911},"citing_paper":{"arxiv_id":"2507.14468","last_updated":"2025-07-22T04:03:12Z","snapshot_observed_at":"2026-08-06T15:52:46.064089Z","submitted_at":"2025-07-19T04:03:42Z","title":"BioGraphFusion: Graph Knowledge Embedding for Biological Completion and Reasoning","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-06T15:58:46.131735Z"},"links":{"cited_paper":"/paper/1911.03082","citing_paper":"/paper/2507.14468"},"observation_digest":"sha256:b3d102024ad9092605b19d5f86324b281f0d14174fa2f2e186d8ef6e27c9b8b9","observation_id":"d5d901e4-5453-4df7-8b1a-5ad56e309f0e","resolution":{"observed_at":"2026-08-06T15:58:46.131735Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.03082","last_updated":"2020-01-18T22:50:01Z","snapshot_observed_at":"2026-07-06T08:35:28.740170Z","submitted_at":"2019-11-08T06:48:40Z","title":"Composition-based Multi-Relational Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.03082","snapshot_observed_at":"2026-08-05T13:44:09.782647Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.00387","last_updated":"2025-08-30T06:53:36Z","snapshot_observed_at":"2026-08-05T13:43:56.438025Z","submitted_at":"2025-08-30T06:53:36Z","title":"Unifying Adversarial Perturbation for Graph Neural Networks","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-05T13:44:09.782647Z"},"links":{"cited_paper":"/paper/1911.03082","citing_paper":"/paper/2509.00387"},"observation_digest":"sha256:0d7c849d26294b7053efdb845d7ebf2684fd5690f3bf37a388e95a8d590fef43","observation_id":"3e71bc7d-7281-4c52-90f7-15dd90c81186","resolution":{"observed_at":"2026-08-05T13:44:09.782647Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.03082","last_updated":"2020-01-18T22:50:01Z","snapshot_observed_at":"2026-07-06T08:35:28.740170Z","submitted_at":"2019-11-08T06:48:40Z","title":"Composition-based Multi-Relational Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.03082","snapshot_observed_at":"2026-08-05T12:53:32.058640Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.01166","last_updated":"2025-09-01T06:38:11Z","snapshot_observed_at":"2026-08-05T12:53:26.181748Z","submitted_at":"2025-09-01T06:38:11Z","title":"Enhancing Large Language Model for Knowledge Graph Completion via Structure-Aware Alignment-Tuning","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-05T12:53:32.058640Z"},"links":{"cited_paper":"/paper/1911.03082","citing_paper":"/paper/2509.01166"},"observation_digest":"sha256:490e16d476bb51fd71bda683bdefe7489bf7a21a342dd45600e4cd8a6bb5c9c0","observation_id":"3a05779c-d1e8-4a3c-86fe-7be36915d646","resolution":{"observed_at":"2026-08-05T12:53:32.058640Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.03082","last_updated":"2020-01-18T22:50:01Z","snapshot_observed_at":"2026-07-06T08:35:28.740170Z","submitted_at":"2019-11-08T06:48:40Z","title":"Composition-based Multi-Relational Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":"1911.03082","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1911.03082","snapshot_observed_at":"2026-07-04T19:20:06.897069Z","title":"Composition- based multi-relational graph convolutional networks","venue":null,"work_id":"bc86b897-bb18-4686-b208-e1914bfb1f2c","year":1911},"citing_paper":{"arxiv_id":"2604.18344","last_updated":"2026-04-20T14:41:47Z","snapshot_observed_at":"2026-07-06T23:05:13.178333Z","submitted_at":"2026-04-20T14:41:47Z","title":"One Pass for All: A Discrete Diffusion Model for Knowledge Graph Triple Set Prediction","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-10T05:11:15.653424Z"},"links":{"cited_paper":"/paper/1911.03082","citing_paper":"/paper/2604.18344"},"observation_digest":"sha256:de5e7e414bbe3620184aedfc85f51ee7874506956cb154f57ac4d5b9a37696dd","observation_id":"01d7821f-8a0b-469c-bc67-e662740a2e95","resolution":{"observed_at":"2026-05-10T09:38:42.999325Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1911.03082","last_updated":"2020-01-18T22:50:01Z","snapshot_observed_at":"2026-07-06T08:35:28.740170Z","submitted_at":"2019-11-08T06:48:40Z","title":"Composition-based Multi-Relational Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":"1911.03082","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1911.03082","snapshot_observed_at":"2026-07-04T19:20:06.897069Z","title":"Composition- based multi-relational graph convolutional networks","venue":null,"work_id":"bc86b897-bb18-4686-b208-e1914bfb1f2c","year":1911},"citing_paper":{"arxiv_id":"2605.07999","last_updated":"2026-05-08T16:55:44Z","snapshot_observed_at":"2026-07-06T23:20:19.821342Z","submitted_at":"2026-05-08T16:55:44Z","title":"Graph-Structured Hyperdimensional Computing for Data-Efficient and Explainable Process-Structure-Property Prediction","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-11T02:57:47.504977Z"},"links":{"cited_paper":"/paper/1911.03082","citing_paper":"/paper/2605.07999"},"observation_digest":"sha256:518444dcb03669d8aab51103466bfd1bb90aba1cee28b3e9926bd621d5ead890","observation_id":"d2243c79-6409-4840-b546-794a3291ec1e","resolution":{"observed_at":"2026-05-11T03:00:56.719052Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1911.03082","last_updated":"2020-01-18T22:50:01Z","snapshot_observed_at":"2026-07-06T08:35:28.740170Z","submitted_at":"2019-11-08T06:48:40Z","title":"Composition-based Multi-Relational Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":"1911.03082","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1911.03082","snapshot_observed_at":"2026-07-04T19:20:06.897069Z","title":"Composition- based multi-relational graph convolutional networks","venue":null,"work_id":"bc86b897-bb18-4686-b208-e1914bfb1f2c","year":1911},"citing_paper":{"arxiv_id":"2606.07583","last_updated":"2026-05-26T23:38:29Z","snapshot_observed_at":"2026-08-06T19:02:16.267883Z","submitted_at":"2026-05-26T23:38:29Z","title":"Outage Detection in Self-Healing Smart Grids Using Reinforcement Learning with Spectral Graph Neural Networks","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-06-29T17:55:58.403621Z"},"links":{"cited_paper":"/paper/1911.03082","citing_paper":"/paper/2606.07583"},"observation_digest":"sha256:6074cbb95c7a679d3c3c72a63f30846917362e8658c149d0d4d3573b9eab1ed4","observation_id":"587e4090-ccb0-46a4-b209-fc99de7b8328","resolution":{"observed_at":"2026-06-29T18:03:48.185112Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1911.03082","last_updated":"2020-01-18T22:50:01Z","snapshot_observed_at":"2026-07-06T08:35:28.740170Z","submitted_at":"2019-11-08T06:48:40Z","title":"Composition-based Multi-Relational Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":"1911.03082","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1911.03082","snapshot_observed_at":"2026-07-04T19:20:06.897069Z","title":"Composition- based multi-relational graph convolutional networks","venue":null,"work_id":"bc86b897-bb18-4686-b208-e1914bfb1f2c","year":1911},"citing_paper":{"arxiv_id":"2606.20208","last_updated":"2026-06-18T13:21:04Z","snapshot_observed_at":"2026-08-07T21:02:21.928934Z","submitted_at":"2026-06-18T13:21:04Z","title":"Beyond Accuracy: Measuring Logical Compliance of Predictive Models","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-26T17:30:46.782503Z"},"links":{"cited_paper":"/paper/1911.03082","citing_paper":"/paper/2606.20208"},"observation_digest":"sha256:5ed4e76e9c14dc326c59700d9379a78d369259b7310994e235d87214379d74de","observation_id":"ed74f73f-f622-4c0f-9734-5123959b3688","resolution":{"observed_at":"2026-07-04T03:59:32.367412Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1911.03082","last_updated":"2020-01-18T22:50:01Z","snapshot_observed_at":"2026-07-06T08:35:28.740170Z","submitted_at":"2019-11-08T06:48:40Z","title":"Composition-based Multi-Relational Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":"1911.03082","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1911.03082","snapshot_observed_at":"2026-07-04T19:20:06.897069Z","title":"Composition- based multi-relational graph convolutional networks","venue":null,"work_id":"bc86b897-bb18-4686-b208-e1914bfb1f2c","year":1911},"citing_paper":{"arxiv_id":"2606.25497","last_updated":"2026-06-24T07:24:39Z","snapshot_observed_at":"2026-08-02T15:43:17.804530Z","submitted_at":"2026-06-24T07:24:39Z","title":"SAGE-Nav: Leveraging LLM Planning and Alignment Fusion for Hierarchical Scene Graph-Guided Navigation","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-06-25T21:28:01.593510Z"},"links":{"cited_paper":"/paper/1911.03082","citing_paper":"/paper/2606.25497"},"observation_digest":"sha256:3858aae0084051116017d810bcd085d6813b99d158d513f9cc9a457826a4b525","observation_id":"49ac169c-455b-40bf-90d0-7fe60825dc3e","resolution":{"observed_at":"2026-07-04T19:20:06.898688Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1911.03082","last_updated":"2020-01-18T22:50:01Z","snapshot_observed_at":"2026-07-06T08:35:28.740170Z","submitted_at":"2019-11-08T06:48:40Z","title":"Composition-based Multi-Relational Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.03082","snapshot_observed_at":"2026-08-01T13:01:51.659552Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.19253","last_updated":"2026-07-21T16:23:16Z","snapshot_observed_at":"2026-08-07T21:10:55.913812Z","submitted_at":"2026-07-21T16:23:16Z","title":"Sequential Learner Modeling Using Multi-Relational Graph Convolutional Networks","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-01T13:01:51.659552Z"},"links":{"cited_paper":"/paper/1911.03082","citing_paper":"/paper/2607.19253"},"observation_digest":"sha256:14846ea0b635f21fd0c981a14ecde46f6e77f70901350ced68830d3615a41ede","observation_id":"8c9b5dae-1b98-45c8-af3e-79044b905e70","resolution":{"observed_at":"2026-08-01T13:01:51.659552Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.03082","last_updated":"2020-01-18T22:50:01Z","snapshot_observed_at":"2026-07-06T08:35:28.740170Z","submitted_at":"2019-11-08T06:48:40Z","title":"Composition-based Multi-Relational Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.03082","snapshot_observed_at":"2026-08-05T00:21:37.574219Z","title":"arXiv preprint arXiv:1911.03082 , year=","venue":null,"work_id":null,"year":1911},"citing_paper":{"arxiv_id":"2608.00836","last_updated":"2026-08-01T19:30:15Z","snapshot_observed_at":"2026-08-07T21:07:07.179204Z","submitted_at":"2026-08-01T19:30:15Z","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-05T00:21:37.574219Z"},"links":{"cited_paper":"/paper/1911.03082","citing_paper":"/paper/2608.00836"},"observation_digest":"sha256:f8f66f0674a219ed4f15a6f034eadfe1dac26ee1c41bbe71e7ae0dfefd52ce60","observation_id":"db2e48ff-b90a-46a1-a2af-c5cc154c2f05","resolution":{"observed_at":"2026-08-05T00:21:37.574219Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.03082","last_updated":"2020-01-18T22:50:01Z","snapshot_observed_at":"2026-07-06T08:35:28.740170Z","submitted_at":"2019-11-08T06:48:40Z","title":"Composition-based Multi-Relational Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.03082","snapshot_observed_at":"2026-08-07T20:00:46.045823Z","title":"Nitin, and P","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.05982","last_updated":"2026-08-06T12:59:05Z","snapshot_observed_at":"2026-08-09T16:12:20.059452Z","submitted_at":"2026-08-06T12:59:05Z","title":"THBKG: A Temporal Biomedical Knowledge Graph for Decision-Aligned Clinical Advancement Prediction","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T20:00:46.045823Z"},"links":{"cited_paper":"/paper/1911.03082","citing_paper":"/paper/2608.05982"},"observation_digest":"sha256:793f738697b68840798c0679c9ec4b42bd946c6c69f52b4cb57ea9818118b07b","observation_id":"d688c4f6-145c-41c4-a570-e67a0788e247","resolution":{"observed_at":"2026-08-07T20:00:46.045823Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1911.03082/citation-record","integrity":"/paper/1911.03082/integrity","json":"/paper/1911.03082/citation-record.json","paper":"/paper/1911.03082"},"outbound":[],"paper":{"arxiv_id":"1911.03082","last_updated":"2020-01-18T22:50:01Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T08:35:28.740170Z","submitted_at":"2019-11-08T06:48:40Z","title":"Composition-based Multi-Relational Graph Convolutional Networks"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 20 inbound Pith citation observations for arXiv:1911.03082."}