{"as_of":"2026-08-08T22:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6b21c026b0d1ec7fe2cafcdbbebf17560032dc3e33a9f14012e699a1ae258cbd","coverage":[{"denominator":26,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":26,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T08:58:44.086193Z","state":"measured"},{"denominator":26,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":26,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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/2607.20506/citation-record","integrity":"/paper/2607.20506/integrity","json":"/paper/2607.20506/citation-record.json","paper":"/paper/2607.20506"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T08:58:41.304958Z","title":"Introducing contextual retrieval, 2024.https://www.anthropic.com/ engineering/contextual-retrieval","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20506","last_updated":"2026-07-02T21:36:54Z","snapshot_observed_at":"2026-08-05T06:35:44.762457Z","submitted_at":"2026-07-02T21:36:54Z","title":"Optimizing Hypergraph-Based RAG: Toward Better Fact Extraction and Chunk Retrieval","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-02T08:58:41.304958Z"},"links":{"citing_paper":"/paper/2607.20506"},"observation_digest":"sha256:2f1b0b910d86ddf95cafd176cfb0b5bb41cd4343169f582ad9cf4b7ce19f1a8b","observation_id":"da60f3fd-82ff-4ece-b8dd-e7e846cca096","resolution":{"observed_at":"2026-08-02T08:58:41.304958Z","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-02T08:58:41.425173Z","title":"Pathrag: Pruning graph-based retrieval aug- mented generation with relational paths, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.20506","last_updated":"2026-07-02T21:36:54Z","snapshot_observed_at":"2026-08-05T06:35:44.762457Z","submitted_at":"2026-07-02T21:36:54Z","title":"Optimizing Hypergraph-Based RAG: Toward Better Fact Extraction and Chunk Retrieval","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-02T08:58:41.425173Z"},"links":{"citing_paper":"/paper/2607.20506"},"observation_digest":"sha256:4f858b18014583ab89379b8b00377abc52111d2acd2edfcd4b565cd9737f4a13","observation_id":"f7c616b4-24a3-47cd-84e2-a50174ddda98","resolution":{"observed_at":"2026-08-02T08:58:41.425173Z","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-02T08:58:41.537975Z","title":"Universal self-consistency for large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20506","last_updated":"2026-07-02T21:36:54Z","snapshot_observed_at":"2026-08-05T06:35:44.762457Z","submitted_at":"2026-07-02T21:36:54Z","title":"Optimizing Hypergraph-Based RAG: Toward Better Fact Extraction and Chunk Retrieval","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-02T08:58:41.537975Z"},"links":{"citing_paper":"/paper/2607.20506"},"observation_digest":"sha256:7f541f8fd4723e66f57c1a7d4c2d640791166c5713468b5ae1005d1897061dd0","observation_id":"d0d8d8f7-891e-42b0-8c32-885a5f9e2228","resolution":{"observed_at":"2026-08-02T08:58:41.537975Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.16130","last_updated":"2025-02-19T10:49:41Z","snapshot_observed_at":"2026-07-06T18:05:11.700127Z","submitted_at":"2024-04-24T18:38:11Z","title":"From Local to Global: A Graph RAG Approach to Query-Focused Summarization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.16130","snapshot_observed_at":"2026-08-02T08:58:41.694240Z","title":"From local to global: A graph rag ap- proach to query-focused summarization.arXiv pre- print arXiv:2404.16130, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20506","last_updated":"2026-07-02T21:36:54Z","snapshot_observed_at":"2026-08-05T06:35:44.762457Z","submitted_at":"2026-07-02T21:36:54Z","title":"Optimizing Hypergraph-Based RAG: Toward Better Fact Extraction and Chunk Retrieval","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-02T08:58:41.694240Z"},"links":{"cited_paper":"/paper/2404.16130","citing_paper":"/paper/2607.20506"},"observation_digest":"sha256:5b23d7ca7fcc7425e7145b28c94fb891aa3c1ffab2be03fcca8eeac15ba4fd91","observation_id":"ab8ab678-2b17-4e45-9254-e0d78200f23b","resolution":{"observed_at":"2026-08-02T08:58:41.694240Z","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-02T08:58:41.791670Z","title":"RAGAs: Automated evaluation of re- trieval augmented generation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20506","last_updated":"2026-07-02T21:36:54Z","snapshot_observed_at":"2026-08-05T06:35:44.762457Z","submitted_at":"2026-07-02T21:36:54Z","title":"Optimizing Hypergraph-Based RAG: Toward Better Fact Extraction and Chunk Retrieval","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-02T08:58:41.791670Z"},"links":{"citing_paper":"/paper/2607.20506"},"observation_digest":"sha256:3965791a51d6c43eb3c1a343be012c483aec958b15fb8df6dcc185a5c222a16e","observation_id":"f1edcd80-700b-4bf9-a495-589506d82d38","resolution":{"observed_at":"2026-08-02T08:58:41.791670Z","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-02T08:58:41.877702Z","title":"Hyper-rag: Combating llm hallucinations using hypergraph-driven retrieval-augmented genera- tion, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.20506","last_updated":"2026-07-02T21:36:54Z","snapshot_observed_at":"2026-08-05T06:35:44.762457Z","submitted_at":"2026-07-02T21:36:54Z","title":"Optimizing Hypergraph-Based RAG: Toward Better Fact Extraction and Chunk Retrieval","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-02T08:58:41.877702Z"},"links":{"citing_paper":"/paper/2607.20506"},"observation_digest":"sha256:2a0bc7e11f147539bbd084255a5101851ab131f19b875a29e51f15f77f503cb9","observation_id":"bc70b2a4-aa09-47dc-8c02-7dc4018913db","resolution":{"observed_at":"2026-08-02T08:58:41.877702Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.05779","last_updated":"2025-04-28T17:36:27Z","snapshot_observed_at":"2026-07-31T06:48:41.810549Z","submitted_at":"2024-10-08T08:00:12Z","title":"LightRAG: Simple and Fast Retrieval-Augmented Generation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.05779","snapshot_observed_at":"2026-08-02T08:58:41.941607Z","title":"Lightrag: Constructing and utilizing light-weight knowledge graph for retrieval-augmented generation.arXiv preprint arXiv:2410.05779, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20506","last_updated":"2026-07-02T21:36:54Z","snapshot_observed_at":"2026-08-05T06:35:44.762457Z","submitted_at":"2026-07-02T21:36:54Z","title":"Optimizing Hypergraph-Based RAG: Toward Better Fact Extraction and Chunk Retrieval","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-02T08:58:41.941607Z"},"links":{"cited_paper":"/paper/2410.05779","citing_paper":"/paper/2607.20506"},"observation_digest":"sha256:8b68159516aeaaf24cda17bc575a00d473c3678f5fa4053815da84dca21abe27","observation_id":"161b2ae1-4252-413a-aa35-0ba01aab4f74","resolution":{"observed_at":"2026-08-02T08:58:41.941607Z","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-02T08:58:42.005394Z","title":"From RAG to memory: Non- parametric continual learning for large language mo- dels","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.20506","last_updated":"2026-07-02T21:36:54Z","snapshot_observed_at":"2026-08-05T06:35:44.762457Z","submitted_at":"2026-07-02T21:36:54Z","title":"Optimizing Hypergraph-Based RAG: Toward Better Fact Extraction and Chunk Retrieval","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-02T08:58:42.005394Z"},"links":{"citing_paper":"/paper/2607.20506"},"observation_digest":"sha256:7c5c07c4cd934141284af7b69dfde7e45511081dfe31296d5656c007cdfcfc0e","observation_id":"5b9b3ff8-7825-44f9-bceb-2194e88b807b","resolution":{"observed_at":"2026-08-02T08:58:42.005394Z","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-02T08:58:42.045180Z","title":"G-retriever: Retrieval-augmented gene- ration for textual graph understanding and question answering","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20506","last_updated":"2026-07-02T21:36:54Z","snapshot_observed_at":"2026-08-05T06:35:44.762457Z","submitted_at":"2026-07-02T21:36:54Z","title":"Optimizing Hypergraph-Based RAG: Toward Better Fact Extraction and Chunk Retrieval","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-02T08:58:42.045180Z"},"links":{"citing_paper":"/paper/2607.20506"},"observation_digest":"sha256:05b909ffe29d0f5017cda53f8f7eded8b3399270f459ca5dddeb27c95d5a9d22","observation_id":"69251d9f-71b2-4696-a090-82fcd421aed9","resolution":{"observed_at":"2026-08-02T08:58:42.045180Z","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-02T08:58:42.149271Z","title":"GRAG: Graph retrieval- augmented generation","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.20506","last_updated":"2026-07-02T21:36:54Z","snapshot_observed_at":"2026-08-05T06:35:44.762457Z","submitted_at":"2026-07-02T21:36:54Z","title":"Optimizing Hypergraph-Based RAG: Toward Better Fact Extraction and Chunk Retrieval","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-02T08:58:42.149271Z"},"links":{"citing_paper":"/paper/2607.20506"},"observation_digest":"sha256:4865f5abd186263d0d28a4c026e02bf0de1d445fb5630a6dcba85c7742a554ef","observation_id":"7e3993f3-471d-4956-9a71-28e3f9215fe7","resolution":{"observed_at":"2026-08-02T08:58:42.149271Z","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-02T08:58:42.254250Z","title":"Ket- rag: A cost-efficient multi-granular indexing frame- work for graph-rag","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.20506","last_updated":"2026-07-02T21:36:54Z","snapshot_observed_at":"2026-08-05T06:35:44.762457Z","submitted_at":"2026-07-02T21:36:54Z","title":"Optimizing Hypergraph-Based RAG: Toward Better Fact Extraction and Chunk Retrieval","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-02T08:58:42.254250Z"},"links":{"citing_paper":"/paper/2607.20506"},"observation_digest":"sha256:636750997d65679deaab4c584a17761859927a69a869a7c9a7e03bd243c510b5","observation_id":"5ad9127f-e338-4062-9312-4ca32480f609","resolution":{"observed_at":"2026-08-02T08:58:42.254250Z","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-02T08:58:42.314188Z","title":"Retrieval- augmented generation for knowledge-intensive nlp tasks","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.20506","last_updated":"2026-07-02T21:36:54Z","snapshot_observed_at":"2026-08-05T06:35:44.762457Z","submitted_at":"2026-07-02T21:36:54Z","title":"Optimizing Hypergraph-Based RAG: Toward Better Fact Extraction and Chunk Retrieval","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-02T08:58:42.314188Z"},"links":{"citing_paper":"/paper/2607.20506"},"observation_digest":"sha256:3a961e611ef12607a00dca7f47d4a1aeb0c84deaf431cfff76f817033a292e61","observation_id":"0374c47a-c16a-44c7-b2d0-9421879faeee","resolution":{"observed_at":"2026-08-02T08:58:42.314188Z","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-02T08:58:42.388740Z","title":"Kag: Boosting llms in professional do- mains via knowledge augmented generation","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.20506","last_updated":"2026-07-02T21:36:54Z","snapshot_observed_at":"2026-08-05T06:35:44.762457Z","submitted_at":"2026-07-02T21:36:54Z","title":"Optimizing Hypergraph-Based RAG: Toward Better Fact Extraction and Chunk Retrieval","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-02T08:58:42.388740Z"},"links":{"citing_paper":"/paper/2607.20506"},"observation_digest":"sha256:e1178d46cc4073c2a7cb48cdee4aaa7d1bf9f6caeeeb257c929d778ad29f2b88","observation_id":"b495719c-783c-45ca-911a-d83c4f8c3c20","resolution":{"observed_at":"2026-08-02T08:58:42.388740Z","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-02T08:58:42.488320Z","title":"Hypergraphrag: Retrieval-augmented genera- tion via hypergraph-structured knowledge representa- tion, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.20506","last_updated":"2026-07-02T21:36:54Z","snapshot_observed_at":"2026-08-05T06:35:44.762457Z","submitted_at":"2026-07-02T21:36:54Z","title":"Optimizing Hypergraph-Based RAG: Toward Better Fact Extraction and Chunk Retrieval","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-02T08:58:42.488320Z"},"links":{"citing_paper":"/paper/2607.20506"},"observation_digest":"sha256:86c72d1179062d2bb13e95aab9d61ad9003e506e9c06aad591c920fe4770d2df","observation_id":"26ef39d6-32e3-44e2-b37b-80fc216059ef","resolution":{"observed_at":"2026-08-02T08:58:42.488320Z","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-02T08:58:42.648159Z","title":"Creating knowledge graphs from unstructured data.https://neo4j","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20506","last_updated":"2026-07-02T21:36:54Z","snapshot_observed_at":"2026-08-05T06:35:44.762457Z","submitted_at":"2026-07-02T21:36:54Z","title":"Optimizing Hypergraph-Based RAG: Toward Better Fact Extraction and Chunk Retrieval","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-02T08:58:42.648159Z"},"links":{"citing_paper":"/paper/2607.20506"},"observation_digest":"sha256:34f7ffbce91411569b07d2eb8dcfb0ce384e8102f3479d5e1a194adae9cdc2b0","observation_id":"629bae7c-2f76-4848-9fa7-da408ff1b7a9","resolution":{"observed_at":"2026-08-02T08:58:42.648159Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.10343","last_updated":"2024-08-19T18:30:18Z","snapshot_observed_at":"2026-07-06T19:03:09.004554Z","submitted_at":"2024-08-19T18:30:18Z","title":"LegalBench-RAG: A Benchmark for Retrieval-Augmented Generation in the Legal Domain","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.10343","snapshot_observed_at":"2026-08-02T08:58:42.760654Z","title":"Legalbench-rag: A benchmark for retrieval- augmented generation in the legal domain.arXiv preprint arXiv:2408.10343, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20506","last_updated":"2026-07-02T21:36:54Z","snapshot_observed_at":"2026-08-05T06:35:44.762457Z","submitted_at":"2026-07-02T21:36:54Z","title":"Optimizing Hypergraph-Based RAG: Toward Better Fact Extraction and Chunk Retrieval","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-02T08:58:42.760654Z"},"links":{"cited_paper":"/paper/2408.10343","citing_paper":"/paper/2607.20506"},"observation_digest":"sha256:019126e4e8d499910cb5d748e4262d8ed9899a4649a25d966d34615ee85bdbc7","observation_id":"b59db531-16e1-4e12-a0f6-4dcb096afe17","resolution":{"observed_at":"2026-08-02T08:58:42.760654Z","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-02T08:58:42.901743Z","title":"Memorag: Boosting long context processing with glo- bal memory-enhanced retrieval augmentation","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.20506","last_updated":"2026-07-02T21:36:54Z","snapshot_observed_at":"2026-08-05T06:35:44.762457Z","submitted_at":"2026-07-02T21:36:54Z","title":"Optimizing Hypergraph-Based RAG: Toward Better Fact Extraction and Chunk Retrieval","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-02T08:58:42.901743Z"},"links":{"citing_paper":"/paper/2607.20506"},"observation_digest":"sha256:37f267605b89629a3010e42d2c2fdf55d859bee44377a5dd1e35a1b18a1a8150","observation_id":"14de4922-65e5-4fc7-85f4-61870c9eb355","resolution":{"observed_at":"2026-08-02T08:58:42.901743Z","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-02T08:58:43.058776Z","title":"Le, Ed H","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.20506","last_updated":"2026-07-02T21:36:54Z","snapshot_observed_at":"2026-08-05T06:35:44.762457Z","submitted_at":"2026-07-02T21:36:54Z","title":"Optimizing Hypergraph-Based RAG: Toward Better Fact Extraction and Chunk Retrieval","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-02T08:58:43.058776Z"},"links":{"citing_paper":"/paper/2607.20506"},"observation_digest":"sha256:f99b263e89889fb1fb09fc892d03754a111ca66218d2158a39c401e9898279b5","observation_id":"074c95b1-0f28-4ccd-916a-fccbe1ef4053","resolution":{"observed_at":"2026-08-02T08:58:43.058776Z","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-02T08:58:43.160614Z","title":"Large language models for gene- rative information extraction: a survey.Frontiers of Computer Science, 18, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20506","last_updated":"2026-07-02T21:36:54Z","snapshot_observed_at":"2026-08-05T06:35:44.762457Z","submitted_at":"2026-07-02T21:36:54Z","title":"Optimizing Hypergraph-Based RAG: Toward Better Fact Extraction and Chunk Retrieval","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-02T08:58:43.160614Z"},"links":{"citing_paper":"/paper/2607.20506"},"observation_digest":"sha256:5fb2f2557fc679e318e820faa7f0329470ea48d11e3908b3b9f2149ddf47f41a","observation_id":"ff3e9096-c1e2-4a96-a2b1-7dac37c5a8d6","resolution":{"observed_at":"2026-08-02T08:58:43.160614Z","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-02T08:58:43.329081Z","title":"Recent advances in hypergraph neural networks.Journal of the Opera- tions Research Society of China, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.20506","last_updated":"2026-07-02T21:36:54Z","snapshot_observed_at":"2026-08-05T06:35:44.762457Z","submitted_at":"2026-07-02T21:36:54Z","title":"Optimizing Hypergraph-Based RAG: Toward Better Fact Extraction and Chunk Retrieval","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-02T08:58:43.329081Z"},"links":{"citing_paper":"/paper/2607.20506"},"observation_digest":"sha256:ff1940dfdeb4232e63df857a59bcd1bd51f4c8709387219c3c091a98c1d1c536","observation_id":"ecee93c7-2c8a-470d-8e92-6a80b9d6ae63","resolution":{"observed_at":"2026-08-02T08:58:43.329081Z","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-02T08:58:43.468737Z","title":"Proh: Dynamic plan- ning and reasoning over knowledge hypergraphs for retrieval-augmented generation, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.20506","last_updated":"2026-07-02T21:36:54Z","snapshot_observed_at":"2026-08-05T06:35:44.762457Z","submitted_at":"2026-07-02T21:36:54Z","title":"Optimizing Hypergraph-Based RAG: Toward Better Fact Extraction and Chunk Retrieval","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-02T08:58:43.468737Z"},"links":{"citing_paper":"/paper/2607.20506"},"observation_digest":"sha256:c843d87dfc184dc67ec5f389bdc0335050f7adf5d4a1c845d4d92f5ab5b2dda2","observation_id":"3e81255a-8bc1-47e0-aa46-7d488fbbb95e","resolution":{"observed_at":"2026-08-02T08:58:43.468737Z","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-02T08:58:43.544342Z","title":"Graph-based ap- proaches and functionalities in retrieval-augmented generation: A comprehensive survey.ACM Comput","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.20506","last_updated":"2026-07-02T21:36:54Z","snapshot_observed_at":"2026-08-05T06:35:44.762457Z","submitted_at":"2026-07-02T21:36:54Z","title":"Optimizing Hypergraph-Based RAG: Toward Better Fact Extraction and Chunk Retrieval","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-02T08:58:43.544342Z"},"links":{"citing_paper":"/paper/2607.20506"},"observation_digest":"sha256:f4cf67ab26f0b2f32c0a748c6cccc00386627ad2d9140e3c37c6002bc866926f","observation_id":"1f7b19e0-b8f2-4142-bf53-698e510e78e2","resolution":{"observed_at":"2026-08-02T08:58:43.544342Z","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-02T08:58:43.710504Z","title":"•Each run must complete all steps as a separate, uninfluenced process","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20506","last_updated":"2026-07-02T21:36:54Z","snapshot_observed_at":"2026-08-05T06:35:44.762457Z","submitted_at":"2026-07-02T21:36:54Z","title":"Optimizing Hypergraph-Based RAG: Toward Better Fact Extraction and Chunk Retrieval","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-02T08:58:43.710504Z"},"links":{"citing_paper":"/paper/2607.20506"},"observation_digest":"sha256:828a23bb612263a0da096a6e0b4db4c953f4e0f45946d8c662eac8eb21b10306","observation_id":"394dd4a8-64f2-43e0-95c6-9acc5907f3dc","resolution":{"observed_at":"2026-08-02T08:58:43.710504Z","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-02T08:58:43.858536Z","title":"•If multiple segments describe the same concept/relationship, combine them into ONE segment with the highest comple- teness score","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20506","last_updated":"2026-07-02T21:36:54Z","snapshot_observed_at":"2026-08-05T06:35:44.762457Z","submitted_at":"2026-07-02T21:36:54Z","title":"Optimizing Hypergraph-Based RAG: Toward Better Fact Extraction and Chunk Retrieval","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-02T08:58:43.858536Z"},"links":{"citing_paper":"/paper/2607.20506"},"observation_digest":"sha256:9c41386efb2c068eaea9e96d4d501e693d234108ac1b1e57ec0d39a4b97891c6","observation_id":"55e84344-7814-4279-abf4-ef7adb58a102","resolution":{"observed_at":"2026-08-02T08:58:43.858536Z","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-02T08:58:43.970099Z","title":"For each knowledge segment, extract the following information: •knowledge_segment: Extract 1–3 consecutive sentences EXACTLY as they appear in the source text","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20506","last_updated":"2026-07-02T21:36:54Z","snapshot_observed_at":"2026-08-05T06:35:44.762457Z","submitted_at":"2026-07-02T21:36:54Z","title":"Optimizing Hypergraph-Based RAG: Toward Better Fact Extraction and Chunk Retrieval","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-02T08:58:43.970099Z"},"links":{"citing_paper":"/paper/2607.20506"},"observation_digest":"sha256:6a0271440ccd7dd7678267e5a0b19e1221e54bd6034ba198c18a8a673317abeb","observation_id":"51bbe655-0982-4fe7-a119-8e063d7c5167","resolution":{"observed_at":"2026-08-02T08:58:43.970099Z","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-02T08:58:44.086193Z","title":"How does Vadassy’s plan to trap the spy ultimately fail?","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20506","last_updated":"2026-07-02T21:36:54Z","snapshot_observed_at":"2026-08-05T06:35:44.762457Z","submitted_at":"2026-07-02T21:36:54Z","title":"Optimizing Hypergraph-Based RAG: Toward Better Fact Extraction and Chunk Retrieval","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-02T08:58:44.086193Z"},"links":{"citing_paper":"/paper/2607.20506"},"observation_digest":"sha256:dc9ad5781f2d898a22cc23da2d2db689bbb01bff8378caf423863e22a5385608","observation_id":"27c387d3-4a58-4ce7-8948-8533074d9066","resolution":{"observed_at":"2026-08-02T08:58:44.086193Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.20506","last_updated":"2026-07-02T21:36:54Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-05T06:35:44.762457Z","submitted_at":"2026-07-02T21:36:54Z","title":"Optimizing Hypergraph-Based RAG: Toward Better Fact Extraction and Chunk Retrieval"},"reference_resolution":{"displayed":26,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":26,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":26},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 26 of 26 outbound references and 0 inbound Pith citation observations for arXiv:2607.20506."}