{"as_of":"2026-08-17T19:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:29dad4fe6b1c9e98b3223c55150d0f75ebdadaf2a1eca6aef9c7d9c9e3768032","coverage":[{"denominator":48,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":48,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T17:49:10.727287Z","state":"measured"},{"denominator":48,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":48,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+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.20498/citation-record","integrity":"/paper/2507.20498/integrity","json":"/paper/2507.20498/citation-record.json","paper":"/paper/2507.20498"},"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-15T17:49:11.298484Z","title":null,"venue":null,"work_id":"652d66eb-05c4-43f5-bfc9-d52e0320df31","year":2022},"citing_paper":{"arxiv_id":"2507.20498","last_updated":"2025-07-28T03:30:28Z","snapshot_observed_at":"2026-08-15T17:40:13.501321Z","submitted_at":"2025-07-28T03:30:28Z","title":"Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-15T17:49:10.552331Z"},"links":{"citing_paper":"/paper/2507.20498"},"observation_digest":"sha256:24f652eb3d1765c0746d47e12ec5cd970bb1e8eb9d6a70ec74521efdf1c69be7","observation_id":"e42ab514-04f1-468c-931c-0a6b378fca56","resolution":{"observed_at":"2026-08-15T17:49:11.302262Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:49:11.286734Z","title":null,"venue":null,"work_id":"692e940b-3f01-4a99-a732-b93748eb17a4","year":2022},"citing_paper":{"arxiv_id":"2507.20498","last_updated":"2025-07-28T03:30:28Z","snapshot_observed_at":"2026-08-15T17:40:13.501321Z","submitted_at":"2025-07-28T03:30:28Z","title":"Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-15T17:49:10.556681Z"},"links":{"citing_paper":"/paper/2507.20498"},"observation_digest":"sha256:dc56d28e68f707bf724c2b802981a4514e6f83e25bed683b5a74f2b0c1d24c11","observation_id":"0f90039e-46c0-4e94-9830-f80b4bf7337a","resolution":{"observed_at":"2026-08-15T17:49:11.290797Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:49:11.275468Z","title":null,"venue":null,"work_id":"3511c0b3-d9a1-46dd-a46b-644397025709","year":2017},"citing_paper":{"arxiv_id":"2507.20498","last_updated":"2025-07-28T03:30:28Z","snapshot_observed_at":"2026-08-15T17:40:13.501321Z","submitted_at":"2025-07-28T03:30:28Z","title":"Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-15T17:49:10.560409Z"},"links":{"citing_paper":"/paper/2507.20498"},"observation_digest":"sha256:1a6b3bf3504e86b41727fdf9ffb46365d1181ff5b6b7323ac5cc3d8559e5e94d","observation_id":"b2676eba-a1e6-4f25-a178-8744f0d57384","resolution":{"observed_at":"2026-08-15T17:49:11.279054Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:49:11.264130Z","title":null,"venue":null,"work_id":"f75b2063-628f-489a-ba20-d6fb48c97e4e","year":2017},"citing_paper":{"arxiv_id":"2507.20498","last_updated":"2025-07-28T03:30:28Z","snapshot_observed_at":"2026-08-15T17:40:13.501321Z","submitted_at":"2025-07-28T03:30:28Z","title":"Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-15T17:49:10.564519Z"},"links":{"citing_paper":"/paper/2507.20498"},"observation_digest":"sha256:36c5b9d85aba52ec791485b4215c5b0634ca0f0eaaaf83003efe1d1de878c933","observation_id":"50ef5af5-da4d-48ef-bd50-876bfad316d0","resolution":{"observed_at":"2026-08-15T17:49:11.268052Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:49:11.252488Z","title":null,"venue":null,"work_id":"c8714d51-afd4-4eed-bef6-8c46d0e8f016","year":2017},"citing_paper":{"arxiv_id":"2507.20498","last_updated":"2025-07-28T03:30:28Z","snapshot_observed_at":"2026-08-15T17:40:13.501321Z","submitted_at":"2025-07-28T03:30:28Z","title":"Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-15T17:49:10.568347Z"},"links":{"citing_paper":"/paper/2507.20498"},"observation_digest":"sha256:926a85af79124cf6a8b6e7c6f157e88f0803be7fe10c0ea872b82ef0551c4c43","observation_id":"9e8494bb-d188-48b4-815e-c40fb2e2d66e","resolution":{"observed_at":"2026-08-15T17:49:11.256472Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:49:11.240809Z","title":null,"venue":null,"work_id":"c8a2e0e9-2491-46a5-b7e1-218446082047","year":2001},"citing_paper":{"arxiv_id":"2507.20498","last_updated":"2025-07-28T03:30:28Z","snapshot_observed_at":"2026-08-15T17:40:13.501321Z","submitted_at":"2025-07-28T03:30:28Z","title":"Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-15T17:49:10.572262Z"},"links":{"citing_paper":"/paper/2507.20498"},"observation_digest":"sha256:37bc9e55a4dbf83220a27904984caa820009ec9bffade558401a3705d08de612","observation_id":"96368fa0-ec7f-4047-858b-bdf52534bb6f","resolution":{"observed_at":"2026-08-15T17:49:11.244667Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.04562","last_updated":"2024-04-09T19:48:22Z","snapshot_observed_at":"2026-08-16T14:54:21.682492Z","submitted_at":"2023-10-06T20:00:07Z","title":"Towards Foundation Models for Knowledge Graph Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.04562","snapshot_observed_at":"2026-08-15T17:49:10.576328Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.20498","last_updated":"2025-07-28T03:30:28Z","snapshot_observed_at":"2026-08-15T17:40:13.501321Z","submitted_at":"2025-07-28T03:30:28Z","title":"Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-15T17:49:10.576328Z"},"links":{"cited_paper":"/paper/2310.04562","citing_paper":"/paper/2507.20498"},"observation_digest":"sha256:c85d6b43ce823c51cb9ff3c8e6ded53fd009bc2afa78f60cab737f38f65dc698","observation_id":"146d6426-d55b-419a-9706-d57238c8331b","resolution":{"observed_at":"2026-08-15T17:49:10.576328Z","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-15T17:49:11.229381Z","title":null,"venue":null,"work_id":"f714eb6d-e2a6-42c4-93b8-7fbf05358fd6","year":2025},"citing_paper":{"arxiv_id":"2507.20498","last_updated":"2025-07-28T03:30:28Z","snapshot_observed_at":"2026-08-15T17:40:13.501321Z","submitted_at":"2025-07-28T03:30:28Z","title":"Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-15T17:49:10.580164Z"},"links":{"citing_paper":"/paper/2507.20498"},"observation_digest":"sha256:5314ec1c1719bbdbdad59aa5a085426f7152550eb8806c530efbaf4f176952a8","observation_id":"7c1d1ace-f7cb-41e6-98e0-cd2a959320cf","resolution":{"observed_at":"2026-08-15T17:49:11.233390Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:49:11.217699Z","title":null,"venue":null,"work_id":"58a483cc-21de-4e20-adb2-6a78a282b559","year":2017},"citing_paper":{"arxiv_id":"2507.20498","last_updated":"2025-07-28T03:30:28Z","snapshot_observed_at":"2026-08-15T17:40:13.501321Z","submitted_at":"2025-07-28T03:30:28Z","title":"Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-15T17:49:10.583748Z"},"links":{"citing_paper":"/paper/2507.20498"},"observation_digest":"sha256:e680b78ec64d3a3e218175645524e13526a743f18ed50361b4fe7be906055bad","observation_id":"c6a40397-1bfa-42d6-a18a-78495505ea6b","resolution":{"observed_at":"2026-08-15T17:49:11.221706Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:49:11.204961Z","title":null,"venue":null,"work_id":"fa38da40-6afd-4605-9f90-94200bfd04a6","year":2021},"citing_paper":{"arxiv_id":"2507.20498","last_updated":"2025-07-28T03:30:28Z","snapshot_observed_at":"2026-08-15T17:40:13.501321Z","submitted_at":"2025-07-28T03:30:28Z","title":"Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-15T17:49:10.587142Z"},"links":{"citing_paper":"/paper/2507.20498"},"observation_digest":"sha256:076fa351ce48c9f132b0fec1bf91b3a7d15611a7f47c812104c7ea0bdfc75bf1","observation_id":"5179602a-689e-4741-ad81-ed1e7d025a6b","resolution":{"observed_at":"2026-08-15T17:49:11.208724Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:49:11.193091Z","title":null,"venue":null,"work_id":"17d8aba8-6f16-44e1-a8b5-b729c5cef444","year":2022},"citing_paper":{"arxiv_id":"2507.20498","last_updated":"2025-07-28T03:30:28Z","snapshot_observed_at":"2026-08-15T17:40:13.501321Z","submitted_at":"2025-07-28T03:30:28Z","title":"Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-15T17:49:10.590848Z"},"links":{"citing_paper":"/paper/2507.20498"},"observation_digest":"sha256:db6cac05c45159e436c6a6ea249f20e5c8cd741b25a04863945fae612efb508c","observation_id":"0e12820c-9a74-4fad-85a4-02e893e3ac76","resolution":{"observed_at":"2026-08-15T17:49:11.196840Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:49:11.172818Z","title":null,"venue":null,"work_id":"8c15cf7b-4c65-4ab1-9874-ad2498780853","year":1994},"citing_paper":{"arxiv_id":"2507.20498","last_updated":"2025-07-28T03:30:28Z","snapshot_observed_at":"2026-08-15T17:40:13.501321Z","submitted_at":"2025-07-28T03:30:28Z","title":"Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-15T17:49:10.594553Z"},"links":{"citing_paper":"/paper/2507.20498"},"observation_digest":"sha256:769935fcabb13d33561cff2e8372460e4121bb7dd8ab571c4ca7cc66724bd8e8","observation_id":"8a8635f3-5d8a-4313-875d-723595977cc6","resolution":{"observed_at":"2026-08-15T17:49:11.184390Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:49:11.159964Z","title":null,"venue":null,"work_id":"fe81bfe9-cacd-4b8d-807d-3746e382517e","year":2007},"citing_paper":{"arxiv_id":"2507.20498","last_updated":"2025-07-28T03:30:28Z","snapshot_observed_at":"2026-08-15T17:40:13.501321Z","submitted_at":"2025-07-28T03:30:28Z","title":"Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-15T17:49:10.598054Z"},"links":{"citing_paper":"/paper/2507.20498"},"observation_digest":"sha256:1b5b45ba5f5b7226b12b43d7ba1f6a392617941b700f9646b28c9fed067659f2","observation_id":"25a893b7-ee8b-47d8-b1f0-d2992d5947ce","resolution":{"observed_at":"2026-08-15T17:49:11.164660Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.16668","last_updated":"2020-06-30T10:42:02Z","snapshot_observed_at":"2026-08-07T09:27:36.420559Z","submitted_at":"2020-06-30T10:42:02Z","title":"GShard: Scaling Giant Models with Conditional Computation and Automatic Sharding","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.16668","snapshot_observed_at":"2026-08-15T17:49:10.601508Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.20498","last_updated":"2025-07-28T03:30:28Z","snapshot_observed_at":"2026-08-15T17:40:13.501321Z","submitted_at":"2025-07-28T03:30:28Z","title":"Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-15T17:49:10.601508Z"},"links":{"cited_paper":"/paper/2006.16668","citing_paper":"/paper/2507.20498"},"observation_digest":"sha256:d2e590715302d87fd7ce576fca2eeb00a8b7bd8c76bab7e90d1a1aa61cda2138","observation_id":"ff12f858-74ad-4f40-85ca-ec3ae3fbc645","resolution":{"observed_at":"2026-08-15T17:49:10.601508Z","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-15T17:49:11.147502Z","title":null,"venue":null,"work_id":"bbae9678-abe7-4ff6-a873-c0657690bad2","year":2024},"citing_paper":{"arxiv_id":"2507.20498","last_updated":"2025-07-28T03:30:28Z","snapshot_observed_at":"2026-08-15T17:40:13.501321Z","submitted_at":"2025-07-28T03:30:28Z","title":"Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-15T17:49:10.605401Z"},"links":{"citing_paper":"/paper/2507.20498"},"observation_digest":"sha256:b06c06ec4d71386e14e8b92bfa0148292b51891f59b878a2f1a1b92882a15999","observation_id":"5927c52f-a502-4292-8102-2a208db4a07f","resolution":{"observed_at":"2026-08-15T17:49:11.151549Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:49:10.609092Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.20498","last_updated":"2025-07-28T03:30:28Z","snapshot_observed_at":"2026-08-15T17:40:13.501321Z","submitted_at":"2025-07-28T03:30:28Z","title":"Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-15T17:49:10.609092Z"},"links":{"citing_paper":"/paper/2507.20498"},"observation_digest":"sha256:fc35bc5f95709d57dbf5050866f4b5052c36144d3199f3249ad58ed01636f6be","observation_id":"84c26f28-01d2-407c-a430-5d344fcabf39","resolution":{"observed_at":"2026-08-15T17:49:10.609092Z","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-15T17:49:11.125716Z","title":null,"venue":null,"work_id":"22be21ee-5bee-4a78-ab69-982e77ade99d","year":2021},"citing_paper":{"arxiv_id":"2507.20498","last_updated":"2025-07-28T03:30:28Z","snapshot_observed_at":"2026-08-15T17:40:13.501321Z","submitted_at":"2025-07-28T03:30:28Z","title":"Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-15T17:49:10.612610Z"},"links":{"citing_paper":"/paper/2507.20498"},"observation_digest":"sha256:e91e35694245116270585610f6e30cc4648b150810a9b4958eb420a2c86b0cb7","observation_id":"2df715bf-04c4-4d56-ae76-d499ae1ed079","resolution":{"observed_at":"2026-08-15T17:49:11.130377Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:49:11.112682Z","title":null,"venue":null,"work_id":"805087e8-4413-47fc-a347-0042774abed9","year":2025},"citing_paper":{"arxiv_id":"2507.20498","last_updated":"2025-07-28T03:30:28Z","snapshot_observed_at":"2026-08-15T17:40:13.501321Z","submitted_at":"2025-07-28T03:30:28Z","title":"Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-15T17:49:10.616254Z"},"links":{"citing_paper":"/paper/2507.20498"},"observation_digest":"sha256:0fd4774285c36f14c6fd1de71340b9846213492cd1f99f7a0600bc34aeafbf6c","observation_id":"dc60ef38-bb00-40fd-83b8-f6dcccbd3446","resolution":{"observed_at":"2026-08-15T17:49:11.116913Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2004.04412","last_updated":"2020-04-09T08:15:39Z","snapshot_observed_at":"2026-07-06T09:11:08.325778Z","submitted_at":"2020-04-09T08:15:39Z","title":"Reinforced Anytime Bottom Up Rule Learning for Knowledge Graph Completion","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.04412","snapshot_observed_at":"2026-08-15T17:49:10.619850Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.20498","last_updated":"2025-07-28T03:30:28Z","snapshot_observed_at":"2026-08-15T17:40:13.501321Z","submitted_at":"2025-07-28T03:30:28Z","title":"Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-15T17:49:10.619850Z"},"links":{"cited_paper":"/paper/2004.04412","citing_paper":"/paper/2507.20498"},"observation_digest":"sha256:bf73d47d94b9278525e08514821b08ae1688696a8d146f4b7b9e43fbbc53934c","observation_id":"f0eed523-ed7a-4505-b043-6d9dc3ca195f","resolution":{"observed_at":"2026-08-15T17:49:10.619850Z","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-15T17:49:11.099066Z","title":null,"venue":null,"work_id":"c7379c54-7899-4975-8cae-8a4eeb76af03","year":2018},"citing_paper":{"arxiv_id":"2507.20498","last_updated":"2025-07-28T03:30:28Z","snapshot_observed_at":"2026-08-15T17:40:13.501321Z","submitted_at":"2025-07-28T03:30:28Z","title":"Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-15T17:49:10.624035Z"},"links":{"citing_paper":"/paper/2507.20498"},"observation_digest":"sha256:d615e76defb625502fb4d5a430bbc50915e0c1de089a4a5b6f0dc1b6614d306f","observation_id":"d510044a-f60b-4470-88d1-69d67cc7c728","resolution":{"observed_at":"2026-08-15T17:49:11.103505Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2206.02770","last_updated":"2022-06-06T17:51:59Z","snapshot_observed_at":"2026-08-16T16:54:58.514236Z","submitted_at":"2022-06-06T17:51:59Z","title":"Multimodal Contrastive Learning with LIMoE: the Language-Image Mixture of Experts","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.02770","snapshot_observed_at":"2026-08-15T17:49:10.627798Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.20498","last_updated":"2025-07-28T03:30:28Z","snapshot_observed_at":"2026-08-15T17:40:13.501321Z","submitted_at":"2025-07-28T03:30:28Z","title":"Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-15T17:49:10.627798Z"},"links":{"cited_paper":"/paper/2206.02770","citing_paper":"/paper/2507.20498"},"observation_digest":"sha256:81b6e59104ba9e67351955929837195d8d0ffd4d7a7dd4a6a623c1b91d2b5cd2","observation_id":"c0ab1a7b-f61e-4f2e-90e1-510332d8d803","resolution":{"observed_at":"2026-08-15T17:49:10.627798Z","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-15T17:49:10.631655Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2507.20498","last_updated":"2025-07-28T03:30:28Z","snapshot_observed_at":"2026-08-15T17:40:13.501321Z","submitted_at":"2025-07-28T03:30:28Z","title":"Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-15T17:49:10.631655Z"},"links":{"citing_paper":"/paper/2507.20498"},"observation_digest":"sha256:418181f50f5f9c63dcaaaefab53171cbc3cb13c87ef60d1e905e74dc85a96ff4","observation_id":"2ca138a5-6c52-480d-bee6-8349663f05a6","resolution":{"observed_at":"2026-08-15T17:49:10.631655Z","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-15T17:49:11.078234Z","title":null,"venue":null,"work_id":"c18e6045-9396-4723-83d5-d8a9faac0da3","year":2021},"citing_paper":{"arxiv_id":"2507.20498","last_updated":"2025-07-28T03:30:28Z","snapshot_observed_at":"2026-08-15T17:40:13.501321Z","submitted_at":"2025-07-28T03:30:28Z","title":"Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-15T17:49:10.635775Z"},"links":{"citing_paper":"/paper/2507.20498"},"observation_digest":"sha256:5f8c13d8a8866431357637c873dcc435067bce51c7cb9d91ea1a20d692d372c2","observation_id":"ef7cfedb-39aa-422e-991c-53b4fb54538c","resolution":{"observed_at":"2026-08-15T17:49:11.082056Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:49:11.066372Z","title":null,"venue":null,"work_id":"dc0c42e6-b176-4459-ade7-4bd4c1fc7149","year":2021},"citing_paper":{"arxiv_id":"2507.20498","last_updated":"2025-07-28T03:30:28Z","snapshot_observed_at":"2026-08-15T17:40:13.501321Z","submitted_at":"2025-07-28T03:30:28Z","title":"Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-15T17:49:10.639029Z"},"links":{"citing_paper":"/paper/2507.20498"},"observation_digest":"sha256:de328a4f64d99692600b07bf80b8fa7b1880fc5c0f7c2ea01552d306675c87d7","observation_id":"2fe01ff5-4a1e-4064-a98e-cd87625e3d9f","resolution":{"observed_at":"2026-08-15T17:49:11.070042Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:49:11.055280Z","title":null,"venue":null,"work_id":"68ce13da-7c35-45a0-90ce-402060429018","year":2019},"citing_paper":{"arxiv_id":"2507.20498","last_updated":"2025-07-28T03:30:28Z","snapshot_observed_at":"2026-08-15T17:40:13.501321Z","submitted_at":"2025-07-28T03:30:28Z","title":"Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-15T17:49:10.642519Z"},"links":{"citing_paper":"/paper/2507.20498"},"observation_digest":"sha256:cbbdfa1cbb3bb2d47317226b0ad6c18f0f0df0c47f0d880255afaa9dc35fa1e8","observation_id":"414a1267-761d-438e-8054-1ca349a0e590","resolution":{"observed_at":"2026-08-15T17:49:11.058948Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:49:11.043963Z","title":null,"venue":null,"work_id":"5b13e8dc-3449-4ad1-9bb5-c154021a77da","year":2017},"citing_paper":{"arxiv_id":"2507.20498","last_updated":"2025-07-28T03:30:28Z","snapshot_observed_at":"2026-08-15T17:40:13.501321Z","submitted_at":"2025-07-28T03:30:28Z","title":"Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-15T17:49:10.646160Z"},"links":{"citing_paper":"/paper/2507.20498"},"observation_digest":"sha256:12f886c0cd10f29d0d6c4b3aaf3c02eb42d609d40196798cf007bfd88982852c","observation_id":"54c8ed20-ca50-4700-857a-e51d91f4e594","resolution":{"observed_at":"2026-08-15T17:49:11.047865Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:49:11.032283Z","title":null,"venue":null,"work_id":"8a92d750-7449-4ae4-bbd4-e2e2a2be9f3a","year":2007},"citing_paper":{"arxiv_id":"2507.20498","last_updated":"2025-07-28T03:30:28Z","snapshot_observed_at":"2026-08-15T17:40:13.501321Z","submitted_at":"2025-07-28T03:30:28Z","title":"Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-15T17:49:10.650059Z"},"links":{"citing_paper":"/paper/2507.20498"},"observation_digest":"sha256:5395e843149c5a8452cb871eef9a2bf75291c31334bf11ee82f710d4f81f19ef","observation_id":"304f22f8-324a-440f-ac09-2b79e853bfef","resolution":{"observed_at":"2026-08-15T17:49:11.036059Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:49:11.020644Z","title":null,"venue":null,"work_id":"a58f0307-90ab-40a1-bd70-cbdd6089e4e9","year":2019},"citing_paper":{"arxiv_id":"2507.20498","last_updated":"2025-07-28T03:30:28Z","snapshot_observed_at":"2026-08-15T17:40:13.501321Z","submitted_at":"2025-07-28T03:30:28Z","title":"Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-15T17:49:10.653730Z"},"links":{"citing_paper":"/paper/2507.20498"},"observation_digest":"sha256:e67a56c5dd00652e7f165cc446b114c89e4dbd2630cd3b62bc36601092858b40","observation_id":"9b4dd52c-e3ea-41f7-b0ef-3bcad3be144d","resolution":{"observed_at":"2026-08-15T17:49:11.024760Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:49:11.009024Z","title":null,"venue":null,"work_id":"73af756b-97fd-49f4-b940-73f7cf4a5301","year":2021},"citing_paper":{"arxiv_id":"2507.20498","last_updated":"2025-07-28T03:30:28Z","snapshot_observed_at":"2026-08-15T17:40:13.501321Z","submitted_at":"2025-07-28T03:30:28Z","title":"Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-15T17:49:10.657680Z"},"links":{"citing_paper":"/paper/2507.20498"},"observation_digest":"sha256:efe0cd10e297b74546b391ed6eb589b6aa1449cb492c5043e2b47c3783ba66d5","observation_id":"b91b7d7a-80b3-49b4-b16b-1e5996f33209","resolution":{"observed_at":"2026-08-15T17:49:11.012623Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1911.06962","last_updated":"2020-02-12T02:16:11Z","snapshot_observed_at":"2026-08-11T19:48:50.173870Z","submitted_at":"2019-11-16T05:25:56Z","title":"Inductive Relation Prediction by Subgraph Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.06962","snapshot_observed_at":"2026-08-15T17:49:10.661313Z","title":"K Teru, E","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.20498","last_updated":"2025-07-28T03:30:28Z","snapshot_observed_at":"2026-08-15T17:40:13.501321Z","submitted_at":"2025-07-28T03:30:28Z","title":"Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-15T17:49:10.661313Z"},"links":{"cited_paper":"/paper/1911.06962","citing_paper":"/paper/2507.20498"},"observation_digest":"sha256:d959c88c18682da9fe37f901b2452bb035dd17fcb835227aa60eeb58610bbe88","observation_id":"f3fa9729-0196-4041-b4d0-20656215649a","resolution":{"observed_at":"2026-08-15T17:49:10.661313Z","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-15T17:49:10.996710Z","title":null,"venue":null,"work_id":"19c903ef-342d-4d2e-bbd3-b8f182b66a00","year":2015},"citing_paper":{"arxiv_id":"2507.20498","last_updated":"2025-07-28T03:30:28Z","snapshot_observed_at":"2026-08-15T17:40:13.501321Z","submitted_at":"2025-07-28T03:30:28Z","title":"Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-15T17:49:10.664977Z"},"links":{"citing_paper":"/paper/2507.20498"},"observation_digest":"sha256:675746a63a21e92b347f673fdf20d675d0c196e87cfd4518b20724a6daa408c6","observation_id":"f0d205f9-22f6-45de-b6ed-65b2586ad14b","resolution":{"observed_at":"2026-08-15T17:49:11.000550Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:49:10.985688Z","title":"Nitin, and Partha Talukdar","venue":null,"work_id":"4ad6d726-d74e-4278-96ec-f831c281f2b5","year":2019},"citing_paper":{"arxiv_id":"2507.20498","last_updated":"2025-07-28T03:30:28Z","snapshot_observed_at":"2026-08-15T17:40:13.501321Z","submitted_at":"2025-07-28T03:30:28Z","title":"Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-15T17:49:10.668404Z"},"links":{"citing_paper":"/paper/2507.20498"},"observation_digest":"sha256:155a264fede1409c36cd0a0ca5d36c116f5ca6d7239e74d972c7edb844092185","observation_id":"b9deed67-0a7b-499a-ae08-5c695833172a","resolution":{"observed_at":"2026-08-15T17:49:10.989613Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:49:10.975267Z","title":null,"venue":null,"work_id":"dc138c47-4fb7-4c2c-8367-1c557d885a3c","year":2023},"citing_paper":{"arxiv_id":"2507.20498","last_updated":"2025-07-28T03:30:28Z","snapshot_observed_at":"2026-08-15T17:40:13.501321Z","submitted_at":"2025-07-28T03:30:28Z","title":"Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-15T17:49:10.671840Z"},"links":{"citing_paper":"/paper/2507.20498"},"observation_digest":"sha256:feeed58bdb4978f9c6965f181a9197c24df074bfd98a561db64b8f30a1937a23","observation_id":"83252e95-c99a-4cd6-b95f-3d77ab85b69a","resolution":{"observed_at":"2026-08-15T17:49:10.978725Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:49:10.964793Z","title":null,"venue":null,"work_id":"b5e5eca4-90dc-4aa5-9a37-955f4ba3387a","year":2023},"citing_paper":{"arxiv_id":"2507.20498","last_updated":"2025-07-28T03:30:28Z","snapshot_observed_at":"2026-08-15T17:40:13.501321Z","submitted_at":"2025-07-28T03:30:28Z","title":"Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-15T17:49:10.675806Z"},"links":{"citing_paper":"/paper/2507.20498"},"observation_digest":"sha256:a2e193e0e6688e6ae429dbec7a86273a8019c1422aa8d4371e15a7814ec464ad","observation_id":"5a3f4586-1c7a-4029-b89d-7e04c4a9ba03","resolution":{"observed_at":"2026-08-15T17:49:10.968328Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:49:10.954211Z","title":null,"venue":null,"work_id":"64cd0608-dd31-49c0-bb98-2a31fa53f366","year":2017},"citing_paper":{"arxiv_id":"2507.20498","last_updated":"2025-07-28T03:30:28Z","snapshot_observed_at":"2026-08-15T17:40:13.501321Z","submitted_at":"2025-07-28T03:30:28Z","title":"Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-15T17:49:10.679498Z"},"links":{"citing_paper":"/paper/2507.20498"},"observation_digest":"sha256:83c00681af8acf1d2e83a34a2032f4c9b2bd94c05a4b6d9de3d319cc610c5572","observation_id":"adf6a46e-e9c6-454e-b739-c3aac73d949d","resolution":{"observed_at":"2026-08-15T17:49:10.957603Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:49:10.942842Z","title":null,"venue":null,"work_id":"7985c776-2140-4e91-aacc-a869577733f5","year":2017},"citing_paper":{"arxiv_id":"2507.20498","last_updated":"2025-07-28T03:30:28Z","snapshot_observed_at":"2026-08-15T17:40:13.501321Z","submitted_at":"2025-07-28T03:30:28Z","title":"Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-15T17:49:10.684326Z"},"links":{"citing_paper":"/paper/2507.20498"},"observation_digest":"sha256:efd0a6b55fbd32db894701e6514ad5d2b9aa8a7f2e4ab1f81a185dbc79f30c0c","observation_id":"253c5816-c072-45c7-bc75-b4b5c036ffe7","resolution":{"observed_at":"2026-08-15T17:49:10.946839Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:49:10.931821Z","title":null,"venue":null,"work_id":"d53cde26-837a-429b-9e38-7964f5b8278f","year":2022},"citing_paper":{"arxiv_id":"2507.20498","last_updated":"2025-07-28T03:30:28Z","snapshot_observed_at":"2026-08-15T17:40:13.501321Z","submitted_at":"2025-07-28T03:30:28Z","title":"Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-15T17:49:10.688010Z"},"links":{"citing_paper":"/paper/2507.20498"},"observation_digest":"sha256:a1d76f3bc21975fa82073313c26c4ef47584e12aadcda19d4200732693ae06f2","observation_id":"bac5eecc-3357-4f31-8fc1-f3ec7ad86662","resolution":{"observed_at":"2026-08-15T17:49:10.935465Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:49:10.920422Z","title":null,"venue":null,"work_id":"41c7d318-2398-4644-908f-0e137fccf793","year":2023},"citing_paper":{"arxiv_id":"2507.20498","last_updated":"2025-07-28T03:30:28Z","snapshot_observed_at":"2026-08-15T17:40:13.501321Z","submitted_at":"2025-07-28T03:30:28Z","title":"Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-15T17:49:10.691608Z"},"links":{"citing_paper":"/paper/2507.20498"},"observation_digest":"sha256:1b167dcbde1dbba21a00933e45a1ef7cf669bab89df1c83de31903e126731a9a","observation_id":"2624bbdf-1050-4ddd-b4c8-165eca511aea","resolution":{"observed_at":"2026-08-15T17:49:10.924233Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:49:10.908907Z","title":null,"venue":null,"work_id":"8fb72318-96e4-4952-b3fa-bd0da2dc8b01","year":2019},"citing_paper":{"arxiv_id":"2507.20498","last_updated":"2025-07-28T03:30:28Z","snapshot_observed_at":"2026-08-15T17:40:13.501321Z","submitted_at":"2025-07-28T03:30:28Z","title":"Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-15T17:49:10.695022Z"},"links":{"citing_paper":"/paper/2507.20498"},"observation_digest":"sha256:09b5d3cf986c0fd8598fe92eeb4e008b8e558cf09080400a6eeb6e8209b49c98","observation_id":"ed130f64-47dd-4a9f-b575-daf257a32a7b","resolution":{"observed_at":"2026-08-15T17:49:10.912748Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:49:10.897172Z","title":null,"venue":null,"work_id":"4f9567c5-40ee-4d50-83c8-34d457211357","year":2022},"citing_paper":{"arxiv_id":"2507.20498","last_updated":"2025-07-28T03:30:28Z","snapshot_observed_at":"2026-08-15T17:40:13.501321Z","submitted_at":"2025-07-28T03:30:28Z","title":"Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-15T17:49:10.698386Z"},"links":{"citing_paper":"/paper/2507.20498"},"observation_digest":"sha256:5b72f4e9add390b46d94b6811425af574fa8056022da6ce348944e9d249eddba","observation_id":"f23725ac-2e0f-4bdf-99be-d0aa381998d1","resolution":{"observed_at":"2026-08-15T17:49:10.901182Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:49:10.885164Z","title":null,"venue":null,"work_id":"9b992bda-cec4-4b31-a149-9f15e68ba39c","year":2020},"citing_paper":{"arxiv_id":"2507.20498","last_updated":"2025-07-28T03:30:28Z","snapshot_observed_at":"2026-08-15T17:40:13.501321Z","submitted_at":"2025-07-28T03:30:28Z","title":"Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-15T17:49:10.701700Z"},"links":{"citing_paper":"/paper/2507.20498"},"observation_digest":"sha256:90c3babb8d186c19ba3dc2337051a6896331860573437f584187f96688cebc0c","observation_id":"344a1efb-28e9-4141-a3e9-36fc4768e715","resolution":{"observed_at":"2026-08-15T17:49:10.889085Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:49:10.874035Z","title":null,"venue":null,"work_id":"46f3a10c-60df-488b-bd95-74a86e871047","year":2023},"citing_paper":{"arxiv_id":"2507.20498","last_updated":"2025-07-28T03:30:28Z","snapshot_observed_at":"2026-08-15T17:40:13.501321Z","submitted_at":"2025-07-28T03:30:28Z","title":"Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-15T17:49:10.705105Z"},"links":{"citing_paper":"/paper/2507.20498"},"observation_digest":"sha256:0726f515dc8425bdaf4c90df76a64e7687fc365097b798f6aeecd0c971f0d036","observation_id":"1bdddc3e-6290-42ba-8952-4ece4f345d42","resolution":{"observed_at":"2026-08-15T17:49:10.877767Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:49:10.862464Z","title":null,"venue":null,"work_id":"80a566d5-8f0b-485a-a888-18cc679d9bd7","year":2024},"citing_paper":{"arxiv_id":"2507.20498","last_updated":"2025-07-28T03:30:28Z","snapshot_observed_at":"2026-08-15T17:40:13.501321Z","submitted_at":"2025-07-28T03:30:28Z","title":"Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-15T17:49:10.708628Z"},"links":{"citing_paper":"/paper/2507.20498"},"observation_digest":"sha256:157c7f866231298286215cec822dfe02b644f154415aa4132f69d8e71ad5dc5a","observation_id":"be0be30a-3986-45fe-a897-be99c84b32b0","resolution":{"observed_at":"2026-08-15T17:49:10.866276Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2206.04674","last_updated":"2022-07-05T07:56:01Z","snapshot_observed_at":"2026-08-16T16:54:05.607993Z","submitted_at":"2022-06-09T17:59:59Z","title":"Uni-Perceiver-MoE: Learning Sparse Generalist Models with Conditional MoEs","version":2},"cited_work":{"arxiv_id":"2206.04674","doi":null,"metadata_source":"pith","pith_arxiv_id":"2206.04674","snapshot_observed_at":"2026-08-15T17:49:10.758706Z","title":"Uni-Perceiver-MoE: Learning Sparse Generalist Models with Conditional MoEs","venue":"cs.CV","work_id":"504f362d-3c6b-440f-af1f-5cb3d9f66d4f","year":2022},"citing_paper":{"arxiv_id":"2507.20498","last_updated":"2025-07-28T03:30:28Z","snapshot_observed_at":"2026-08-15T17:40:13.501321Z","submitted_at":"2025-07-28T03:30:28Z","title":"Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-15T17:49:10.712387Z"},"links":{"cited_paper":"/paper/2206.04674","citing_paper":"/paper/2507.20498"},"observation_digest":"sha256:7c266c4328c04b30053a08e9dc8904b34b237e070363e82387e78d95c6d6874b","observation_id":"ef681272-f43a-4afd-8db2-208eb28fa4c2","resolution":{"observed_at":"2026-08-15T17:49:10.765083Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:49:10.850382Z","title":null,"venue":null,"work_id":"8045efe3-13c8-4ac6-be27-e99b5da20071","year":2023},"citing_paper":{"arxiv_id":"2507.20498","last_updated":"2025-07-28T03:30:28Z","snapshot_observed_at":"2026-08-15T17:40:13.501321Z","submitted_at":"2025-07-28T03:30:28Z","title":"Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-15T17:49:10.716258Z"},"links":{"citing_paper":"/paper/2507.20498"},"observation_digest":"sha256:be8d929eff16b69655f4835449e4769509bdbdcbd6dbcca8c5141d78118bc7bc","observation_id":"ae11bbfa-3a0b-4328-9464-0ceb91762974","resolution":{"observed_at":"2026-08-15T17:49:10.854561Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:49:10.838610Z","title":null,"venue":null,"work_id":"f03fd69d-84f0-4180-ad36-1af2d4ca9c24","year":2021},"citing_paper":{"arxiv_id":"2507.20498","last_updated":"2025-07-28T03:30:28Z","snapshot_observed_at":"2026-08-15T17:40:13.501321Z","submitted_at":"2025-07-28T03:30:28Z","title":"Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-15T17:49:10.719790Z"},"links":{"citing_paper":"/paper/2507.20498"},"observation_digest":"sha256:6c8074d116e597703e783b0fc9f330aa95044a9b6dfaacff1837bed0fa03a42d","observation_id":"419c234a-ac52-4852-a597-2ec9e8240aa0","resolution":{"observed_at":"2026-08-15T17:49:10.842260Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T17:49:10.723510Z","title":"online\" 'onlinestring :=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.20498","last_updated":"2025-07-28T03:30:28Z","snapshot_observed_at":"2026-08-15T17:40:13.501321Z","submitted_at":"2025-07-28T03:30:28Z","title":"Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-15T17:49:10.723510Z"},"links":{"citing_paper":"/paper/2507.20498"},"observation_digest":"sha256:8d651631275a28649c9406ccde6e26f47d3d7af0453cfdcfe1f3dc8e03b1f49c","observation_id":"8ba9182a-4727-4244-b19f-72a992b5e7ab","resolution":{"observed_at":"2026-08-15T17:49:10.723510Z","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-15T17:49:10.727287Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.20498","last_updated":"2025-07-28T03:30:28Z","snapshot_observed_at":"2026-08-15T17:40:13.501321Z","submitted_at":"2025-07-28T03:30:28Z","title":"Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-15T17:49:10.727287Z"},"links":{"citing_paper":"/paper/2507.20498"},"observation_digest":"sha256:42188828541311338c7b63e8c63d480b733af4846668e288a0fb9b88f1fdd20a","observation_id":"b03bb8c1-c928-4bc6-9a06-1490adba6149","resolution":{"observed_at":"2026-08-15T17:49:10.727287Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2507.20498","last_updated":"2025-07-28T03:30:28Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-15T17:40:13.501321Z","submitted_at":"2025-07-28T03:30:28Z","title":"Mixture of Length and Pruning Experts for Knowledge Graphs Reasoning"},"reference_resolution":{"displayed":48,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":46,"verified_exact":1,"verified_fuzzy":1},"total_outbound_references":48},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 48 of 48 outbound references and 0 inbound Pith citation observations for arXiv:2507.20498."}