{"as_of":"2026-08-17T23:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7ff07d944d045abd6068af72ce7fce96d67d75a892446b1249430aa559ea195d","coverage":[{"denominator":12,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T22:10:40.357136Z","state":"measured"},{"denominator":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"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/2505.08155/citation-record","integrity":"/paper/2505.08155/integrity","json":"/paper/2505.08155/citation-record.json","paper":"/paper/2505.08155"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2301.12313","last_updated":"2023-07-11T15:48:48Z","snapshot_observed_at":"2026-08-17T22:12:56.450832Z","submitted_at":"2023-01-29T00:17:16Z","title":"Adapting Neural Link Predictors for Data-Efficient Complex Query Answering","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.12313","snapshot_observed_at":"2026-08-15T22:10:40.269875Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.08155","last_updated":"2026-05-25T16:05:45Z","snapshot_observed_at":"2026-08-15T21:59:56.642260Z","submitted_at":"2025-05-13T01:24:09Z","title":"Efficient and Scalable Neural Symbolic Search for Knowledge Graph Complex Query Answering","version":4},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T22:10:40.269875Z"},"links":{"cited_paper":"/paper/2301.12313","citing_paper":"/paper/2505.08155"},"observation_digest":"sha256:0e8df1bca52bd29ec5419432d7f7d5cd623bfa969144e9ce9599ff07937d9028","observation_id":"68fa2f67-5fa2-4100-b007-6f8d426ff5de","resolution":{"observed_at":"2026-08-15T22:10:40.269875Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.15578","last_updated":"2023-04-22T14:54:08Z","snapshot_observed_at":"2026-08-16T17:26:21.132866Z","submitted_at":"2022-10-27T16:15:11Z","title":"GammaE: Gamma Embeddings for Logical Queries on Knowledge Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.15578","snapshot_observed_at":"2026-08-15T22:10:40.307343Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.08155","last_updated":"2026-05-25T16:05:45Z","snapshot_observed_at":"2026-08-15T21:59:56.642260Z","submitted_at":"2025-05-13T01:24:09Z","title":"Efficient and Scalable Neural Symbolic Search for Knowledge Graph Complex Query Answering","version":4},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T22:10:40.307343Z"},"links":{"cited_paper":"/paper/2210.15578","citing_paper":"/paper/2505.08155"},"observation_digest":"sha256:0a033f315cc564311d7dd2540e7c377acd2af220e8cdce88ebaa8055d6c56a89","observation_id":"a0668f3f-3066-4e9c-8c2f-63aea1dc9086","resolution":{"observed_at":"2026-08-15T22:10:40.307343Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:10:41.300129Z","title":null,"venue":null,"work_id":"28d59229-639c-4df5-b24d-10fb997ae4d8","year":2021},"citing_paper":{"arxiv_id":"2505.08155","last_updated":"2026-05-25T16:05:45Z","snapshot_observed_at":"2026-08-15T21:59:56.642260Z","submitted_at":"2025-05-13T01:24:09Z","title":"Efficient and Scalable Neural Symbolic Search for Knowledge Graph Complex Query Answering","version":4},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T22:10:40.286724Z"},"links":{"citing_paper":"/paper/2505.08155"},"observation_digest":"sha256:df7502009a4a5cb799c4744b6aedf9868cef19326b1d01f0ddacf178d52a8b7a","observation_id":"20857c86-a92e-4b93-ae8f-26b784060417","resolution":{"observed_at":"2026-08-15T22:10:41.305169Z","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-15T22:10:41.282768Z","title":null,"venue":null,"work_id":"e9d0efb8-65d6-477e-8df5-510dc7425be8","year":2022},"citing_paper":{"arxiv_id":"2505.08155","last_updated":"2026-05-25T16:05:45Z","snapshot_observed_at":"2026-08-15T21:59:56.642260Z","submitted_at":"2025-05-13T01:24:09Z","title":"Efficient and Scalable Neural Symbolic Search for Knowledge Graph Complex Query Answering","version":4},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T22:10:40.300671Z"},"links":{"citing_paper":"/paper/2505.08155"},"observation_digest":"sha256:49f16715639307fd2f244452dfdc3c74710030a588064e4ad8c3f7563f5d00c4","observation_id":"d5b11602-b2da-4226-a64c-8b8e3903f120","resolution":{"observed_at":"2026-08-15T22:10:41.288523Z","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-15T22:10:41.175503Z","title":"NLISA maintains a smaller fuzzy vector by preserving only the indices within the relevant domains, resulting in greater flexibility","venue":null,"work_id":"b32ff03c-513f-4315-83de-da8767d8f21f","year":2024},"citing_paper":{"arxiv_id":"2505.08155","last_updated":"2026-05-25T16:05:45Z","snapshot_observed_at":"2026-08-15T21:59:56.642260Z","submitted_at":"2025-05-13T01:24:09Z","title":"Efficient and Scalable Neural Symbolic Search for Knowledge Graph Complex Query Answering","version":4},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T22:10:40.349655Z"},"links":{"citing_paper":"/paper/2505.08155"},"observation_digest":"sha256:9f3019dee5127b4c069cc6e0dfc322a55c166b7e38b231901a10543c94100401","observation_id":"8953b0a8-6920-48b3-93a6-76b8f0db65e3","resolution":{"observed_at":"2026-08-15T22:10:41.182374Z","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-15T22:10:40.466158Z","title":"3 and Fig","venue":null,"work_id":"11576b1d-e6c4-442b-b950-b220388c3877","year":2023},"citing_paper":{"arxiv_id":"2505.08155","last_updated":"2026-05-25T16:05:45Z","snapshot_observed_at":"2026-08-15T21:59:56.642260Z","submitted_at":"2025-05-13T01:24:09Z","title":"Efficient and Scalable Neural Symbolic Search for Knowledge Graph Complex Query Answering","version":4},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T22:10:40.357136Z"},"links":{"citing_paper":"/paper/2505.08155"},"observation_digest":"sha256:963c40ce8b697ba01aa4fbd695f1950c5aa9e1655ea6d7306e4ebb616e3d5aee","observation_id":"f432a6fe-e168-4cbc-9eed-1b682fc752d8","resolution":{"observed_at":"2026-08-15T22:10:41.158073Z","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-15T22:10:41.316374Z","title":"Chen, H., Dalmau, V ., and Grußien, B","venue":null,"work_id":"902a8738-7fa1-4233-806e-31ca7460fb41","year":2011},"citing_paper":{"arxiv_id":"2505.08155","last_updated":"2026-05-25T16:05:45Z","snapshot_observed_at":"2026-08-15T21:59:56.642260Z","submitted_at":"2025-05-13T01:24:09Z","title":"Efficient and Scalable Neural Symbolic Search for Knowledge Graph Complex Query Answering","version":4},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T22:10:40.280814Z"},"links":{"citing_paper":"/paper/2505.08155"},"observation_digest":"sha256:9fae6b5a78907f6e273f54651f55967bb3351c42a1bcdbfad572ced4be0bd60e","observation_id":"27e6d419-77cd-41d1-b423-c1fa46ad6389","resolution":{"observed_at":"2026-08-15T22:10:41.320679Z","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":{"arxiv_id":"2412.10390","last_updated":"2024-11-30T18:54:08Z","snapshot_observed_at":"2026-08-16T09:04:00.961222Z","submitted_at":"2024-11-30T18:54:08Z","title":"Neural-Symbolic Reasoning over Knowledge Graphs: A Survey from a Query Perspective","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.10390","snapshot_observed_at":"2026-08-15T22:10:40.292670Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.08155","last_updated":"2026-05-25T16:05:45Z","snapshot_observed_at":"2026-08-15T21:59:56.642260Z","submitted_at":"2025-05-13T01:24:09Z","title":"Efficient and Scalable Neural Symbolic Search for Knowledge Graph Complex Query Answering","version":4},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T22:10:40.292670Z"},"links":{"cited_paper":"/paper/2412.10390","citing_paper":"/paper/2505.08155"},"observation_digest":"sha256:c54f4ce1f7257665f4c88b27de0f86a8ba6bd3609560a7d37a6514a07588e273","observation_id":"e1f3218b-300e-4589-81f8-e65677ce25dd","resolution":{"observed_at":"2026-08-15T22:10:40.292670Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:10:41.260070Z","title":"Recently, Tsang et al","venue":null,"work_id":"54903e72-04aa-4b00-8385-70d9531c2767","year":2025},"citing_paper":{"arxiv_id":"2505.08155","last_updated":"2026-05-25T16:05:45Z","snapshot_observed_at":"2026-08-15T21:59:56.642260Z","submitted_at":"2025-05-13T01:24:09Z","title":"Efficient and Scalable Neural Symbolic Search for Knowledge Graph Complex Query Answering","version":4},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-15T22:10:40.314786Z"},"links":{"citing_paper":"/paper/2505.08155"},"observation_digest":"sha256:8392c7a0dc20ab857ddeb0b78ce3aeb564500199e1fb9ddaf99dc1d328ae8479","observation_id":"73c74fe3-f594-4d31-a07c-67b8296a3a2a","resolution":{"observed_at":"2026-08-15T22:10:41.266762Z","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-15T22:10:41.236500Z","title":"In particular, the neural symbolic search method combining the knowledge graph embedding with symbolic search is of particular interest","venue":null,"work_id":"05674fd7-6b91-4388-87ac-59aff8e8b9d0","year":2020},"citing_paper":{"arxiv_id":"2505.08155","last_updated":"2026-05-25T16:05:45Z","snapshot_observed_at":"2026-08-15T21:59:56.642260Z","submitted_at":"2025-05-13T01:24:09Z","title":"Efficient and Scalable Neural Symbolic Search for Knowledge Graph Complex Query Answering","version":4},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-15T22:10:40.321076Z"},"links":{"citing_paper":"/paper/2505.08155"},"observation_digest":"sha256:46e500b24882fe55a89b5f85a618051ea7189de2873dfdfe86955151d6d776c7","observation_id":"0ffbd7fd-0a99-4650-ae43-e7f57217616e","resolution":{"observed_at":"2026-08-15T22:10:41.243154Z","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-15T22:10:41.217132Z","title":"CQD-CO uses gradient optimization to estimate the embedding of existential variables (Arakelyan et al., 2020)","venue":null,"work_id":"b8902868-a72e-46ed-ab5c-f544e9421bac","year":2020},"citing_paper":{"arxiv_id":"2505.08155","last_updated":"2026-05-25T16:05:45Z","snapshot_observed_at":"2026-08-15T21:59:56.642260Z","submitted_at":"2025-05-13T01:24:09Z","title":"Efficient and Scalable Neural Symbolic Search for Knowledge Graph Complex Query Answering","version":4},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-15T22:10:40.330509Z"},"links":{"citing_paper":"/paper/2505.08155"},"observation_digest":"sha256:1055e3e4e03f1fe8263365288b1e6d7093a60468967e2dfc511a11b46d1c5269","observation_id":"307de3ba-093d-40ff-bc59-6ffb2b6fdba9","resolution":{"observed_at":"2026-08-15T22:10:41.223139Z","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-15T22:10:41.198747Z","title":"However, the complexity is|E|n (Yin et al., 2024), where n is the variable number of query","venue":null,"work_id":"9b00e45b-04a0-4e21-bf50-c1592623fbde","year":2024},"citing_paper":{"arxiv_id":"2505.08155","last_updated":"2026-05-25T16:05:45Z","snapshot_observed_at":"2026-08-15T21:59:56.642260Z","submitted_at":"2025-05-13T01:24:09Z","title":"Efficient and Scalable Neural Symbolic Search for Knowledge Graph Complex Query Answering","version":4},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-15T22:10:40.342532Z"},"links":{"citing_paper":"/paper/2505.08155"},"observation_digest":"sha256:8eef2f5f07db37d45e99e2aa2d474e5d81b81b5d6a46b7527b20087630c010aa","observation_id":"f47c0df2-5a7d-477b-8391-e1a2dadd098a","resolution":{"observed_at":"2026-08-15T22:10:41.204927Z","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"}}],"paper":{"arxiv_id":"2505.08155","last_updated":"2026-05-25T16:05:45Z","latest_version":4,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-15T21:59:56.642260Z","submitted_at":"2025-05-13T01:24:09Z","title":"Efficient and Scalable Neural Symbolic Search for Knowledge Graph Complex Query Answering"},"reference_resolution":{"displayed":12,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":0,"verified_fuzzy":7},"total_outbound_references":12},"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 12 of 12 outbound references and 0 inbound Pith citation observations for arXiv:2505.08155."}