{"as_of":"2026-08-04T20:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8ada87fed68c92b135fc2b81d6f3056ccb6592bca671ba04a59074c08afdb8ae","coverage":[{"denominator":57,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":57,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-04T01:45:36.335508Z","state":"measured"},{"denominator":57,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":57,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+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.01241/citation-record","integrity":"/paper/2607.01241/integrity","json":"/paper/2607.01241/citation-record.json","paper":"/paper/2607.01241"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.12968","last_updated":"2024-08-12T04:48:11Z","snapshot_observed_at":"2026-08-03T18:40:17.238986Z","submitted_at":"2024-03-19T17:59:56Z","title":"LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compression","version":2},"cited_work":{"arxiv_id":"2403.12968","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.12968","snapshot_observed_at":"2026-07-10T01:36:44.313151Z","title":"Llmlingua-2: Data distillation for efficient and faithful task-agnostic prompt compression.arXiv preprint arXiv:2403.12968","venue":"cs.CL","work_id":"d55c1763-27e9-4f9e-98ad-4c732485bb07","year":2024},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"cited_paper":"/paper/2403.12968","citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:9d680573c84037b2949f889cffcb92c5832a6ccecb3e79eb93421bc2dae56563","observation_id":"876ee509-ace5-4827-92f2-b35936117c4b","resolution":{"observed_at":"2026-07-04T01:49:21.537057Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.06839","last_updated":"2024-08-12T03:53:35Z","snapshot_observed_at":"2026-07-06T16:30:41.852589Z","submitted_at":"2023-10-10T17:59:58Z","title":"LongLLMLingua: Accelerating and Enhancing LLMs in Long Context Scenarios via Prompt Compression","version":2},"cited_work":{"arxiv_id":"2310.06839","doi":null,"metadata_source":"pith","pith_arxiv_id":"2310.06839","snapshot_observed_at":"2026-07-10T01:36:44.274003Z","title":"Longllmlingua: Accelerating and enhancing llms in long context scenarios via prompt compression","venue":"cs.CL","work_id":"216713e7-eb05-4ec2-b67c-cd543ff0d117","year":2023},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"cited_paper":"/paper/2310.06839","citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:9c2ca80faa334a382cf72ed7581cce41b7c71b04727c14d20eadcbed9f003efc","observation_id":"4b46fd28-cff2-4122-8394-df2d42c701fa","resolution":{"observed_at":"2026-07-04T01:49:21.518943Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2304.12102","last_updated":"2023-04-24T13:55:47Z","snapshot_observed_at":"2026-07-06T15:19:21.255953Z","submitted_at":"2023-04-24T13:55:47Z","title":"Unlocking Context Constraints of LLMs: Enhancing Context Efficiency of LLMs with Self-Information-Based Content Filtering","version":1},"cited_work":{"arxiv_id":"2304.12102","doi":null,"metadata_source":"pith","pith_arxiv_id":"2304.12102","snapshot_observed_at":"2026-07-10T01:36:44.080909Z","title":"Unlocking context constraints of llms: Enhancing context efficiency of llms with self-information-based content filtering","venue":"cs.CL","work_id":"1244c657-49d2-41a6-a640-d8c5497a9307","year":2023},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"cited_paper":"/paper/2304.12102","citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:7bd903b8ede67a51f215e018f471fb188a962318e93615e2eb16c5091ec1e5a2","observation_id":"b2bc5880-adbb-4a8e-a0e2-01c057f58252","resolution":{"observed_at":"2026-07-04T01:49:21.527521Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-04T22:10:10.822828Z","title":"Findings of the Association for Computational Linguistics: NAACL 2025 , pages=","venue":null,"work_id":"ecb7276c-0889-4d2a-a085-e3849749167a","year":2025},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:d373e82a47684d6c8f9625aee9639748a89e4d8d5f2a780006baaf6e2b75c2f2","observation_id":"b9620116-9c10-4305-ad9d-e98dfd08899e","resolution":{"observed_at":"2026-07-04T22:10:10.823990Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.07956","last_updated":"2025-03-11T01:34:03Z","snapshot_observed_at":"2026-07-06T20:50:19.098219Z","submitted_at":"2025-03-11T01:34:03Z","title":"EFPC: Towards Efficient and Flexible Prompt Compression","version":1},"cited_work":{"arxiv_id":"2503.07956","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.07956","snapshot_observed_at":"2026-07-04T01:49:21.522990Z","title":"arXiv preprint arXiv:2503.07956 , year=","venue":null,"work_id":"64b39e41-4b34-49ca-9449-5aaf0dc81ebd","year":null},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"cited_paper":"/paper/2503.07956","citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:d4d7a765f7b139905c4ddfc3a474dbfb62c8631ee633171d90e1e37ff81e325e","observation_id":"b264833b-6a4f-4630-a690-9a6edd251325","resolution":{"observed_at":"2026-07-04T01:49:21.524624Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.05736","last_updated":"2023-12-06T17:02:25Z","snapshot_observed_at":"2026-07-06T16:29:51.896529Z","submitted_at":"2023-10-09T14:10:21Z","title":"LLMLingua: Compressing Prompts for Accelerated Inference of Large Language Models","version":2},"cited_work":{"arxiv_id":"2310.05736","doi":null,"metadata_source":"pith","pith_arxiv_id":"2310.05736","snapshot_observed_at":"2026-07-10T01:36:44.322096Z","title":"Llmlingua: Compressing prompts for accelerated inference of large language models","venue":"cs.CL","work_id":"3e2bb4aa-fc83-449c-80b8-000b02d811a4","year":2023},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"cited_paper":"/paper/2310.05736","citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:8c7951b14edf2818ab88f66a6d59a495d7fb4c91cf37be156204a95082f25331","observation_id":"4404e395-a8a2-428c-8e87-7a2eed6babba","resolution":{"observed_at":"2026-07-04T01:49:21.550972Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-04T22:10:10.839200Z","title":"2023 , eprint=","venue":null,"work_id":"30ed9daa-07d2-4ac1-b2a9-af8990896508","year":2023},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:c8fa822302a79cf44fce906a8d08e249a3f4febc6525692181b5a6bf275137da","observation_id":"a1576ae8-dfaa-4365-a4fa-0b7a4cdbb79f","resolution":{"observed_at":"2026-07-04T22:10:10.840202Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-04T22:10:10.823222Z","title":null,"venue":null,"work_id":"ee37a79d-965c-4a5b-a6cf-9127b45c536e","year":2024},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:01d5658c8bb5f3405e4ab071ffd1e8ddc8ead751c1cbc92b3c485fe495a469f0","observation_id":"ac5c0875-8f53-4a4d-adc9-95fbe230cb20","resolution":{"observed_at":"2026-07-04T22:10:10.824465Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.16574","last_updated":"2025-04-23T09:53:01Z","snapshot_observed_at":"2026-07-06T21:13:31.831472Z","submitted_at":"2025-04-23T09:53:01Z","title":"PIS: Linking Importance Sampling and Attention Mechanisms for Efficient Prompt Compression","version":1},"cited_work":{"arxiv_id":"2504.16574","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.16574","snapshot_observed_at":"2026-07-04T01:49:21.541473Z","title":"arXiv preprint arXiv:2504.16574 , year=","venue":null,"work_id":"902e3525-7c56-476a-84c5-7b150baca085","year":null},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"cited_paper":"/paper/2504.16574","citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:90143085a07aecf4474381881b294bf94d40e335a02fbf849ff8b2ee68686155","observation_id":"1f0bc229-be25-48ee-90d6-78abe06851ae","resolution":{"observed_at":"2026-07-04T01:49:21.543022Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-09T09:46:13.294909Z","title":"Proceedings of the AAAI Conference on Artificial Intelligence , volume=","venue":null,"work_id":"50861441-cae2-4b10-9a94-bc168bbc0e11","year":null},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:cea124a2f268afa3c12dc7d9b9169dd1117a06d063e69e70b1dc32042668ec9f","observation_id":"0063d610-c901-4c36-b6b8-f3351fa36613","resolution":{"observed_at":"2026-07-04T22:10:10.818160Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2203.09629","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-04T01:49:21.550795Z","title":"arXiv preprint arXiv:2203.09629 , year=","venue":null,"work_id":"b4c2b58b-f1d2-4d5c-8321-e0d5e7433fcd","year":null},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:f58c8c635de0c17556d59f38ece74b6ac5e70539eba6743193b027f311c81963","observation_id":"e8a1085b-5afb-494e-82c3-803a3ded3493","resolution":{"observed_at":"2026-07-04T01:49:21.552422Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-04T22:10:10.868819Z","title":"Electronics , volume=","venue":null,"work_id":"b8fc60fc-16f5-40d7-a35c-4ea8fc77e14f","year":2024},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:20b774f84be220d619de557aa84ccbe3a5db9de09d0569b37cf295e6cbf506b1","observation_id":"4fef326b-aca4-4095-89c1-d039b07624fd","resolution":{"observed_at":"2026-07-04T22:10:10.870039Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-04T22:10:10.796753Z","title":"Scientific Reports , volume=","venue":null,"work_id":"6a941b73-32ed-4798-a447-7634d39f7773","year":2025},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:b585fc1ddc1dc80f49db73363513eb9116a7176568d688b5fd8685ff2cbdd260","observation_id":"0d9c260f-5eb6-48f0-a7fb-d77fc83426a5","resolution":{"observed_at":"2026-07-04T22:10:10.797931Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-04T22:10:10.809914Z","title":"IEEE Transactions on Pattern Analysis and Machine Intelligence , year=","venue":null,"work_id":"5c6a7a17-4efb-4454-99f0-7589cb31164f","year":null},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:ebdf7148e9ddde3f05f38eb1f0fe78f4af43d747fa7fd85ffe7391497b46be4c","observation_id":"43ddf3fc-2977-4f39-873a-cb65c314bacc","resolution":{"observed_at":"2026-07-04T22:10:10.811080Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-04T22:10:10.815181Z","title":"ACM Transactions on Intelligent Systems and Technology , volume=","venue":null,"work_id":"69030913-bb11-4cd2-aaa1-86d0e7e081ea","year":2024},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:3e0d2bff33107f708c792abbe84e3fd209cb7890d5cef37999141a718387d2de","observation_id":"49a8bcdd-ef0e-4f23-94ed-4c8177d77d33","resolution":{"observed_at":"2026-07-04T22:10:10.817161Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-04T22:10:10.862976Z","title":"Journal of king saud university-computer and information sciences , volume=","venue":null,"work_id":"a1b92d61-fa68-487f-885a-98b68388a2c9","year":2023},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:4e7489c908cf0b18b1a64868c7deb64a945a3856d1baac3f3e2293c7bb9a9bd4","observation_id":"20a7bd74-518f-4f63-a8ad-b46606721af4","resolution":{"observed_at":"2026-07-04T22:10:10.864420Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-04T22:10:10.866792Z","title":"Neurocomputing , volume=","venue":null,"work_id":"3b1467e0-c9b1-4ae1-bda9-ed24470185ab","year":2024},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:11fd49c58dcad76dd0fef97bffb6d8d88bcad2c96099722a3812626063ae1e70","observation_id":"4a718d64-0fde-46ac-8df6-a0d1b1f71bb8","resolution":{"observed_at":"2026-07-04T22:10:10.867887Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-04T22:10:10.858991Z","title":"Applied Sciences , volume=","venue":null,"work_id":"11b7bf80-180b-4a48-b4e8-fc7c8f53ed82","year":2025},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:7b09f63da07482b6a889df168b4d0a724094f1555a7460a12681914235a6162c","observation_id":"4285e1cb-24af-499b-a6c5-eaa39e5d89bb","resolution":{"observed_at":"2026-07-04T22:10:10.860476Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-04T22:10:10.865097Z","title":"Findings of the Association for Computational Linguistics: ACL 2025 , pages=","venue":null,"work_id":"be239ae6-f015-4825-b569-816918fa678a","year":2025},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:47c1a8a9d8ef5bbb48c58a0614ea1c58b762ee3210f3beaca6329d39b37a0f58","observation_id":"7456672e-b353-4037-b3ba-bce1c0b01353","resolution":{"observed_at":"2026-07-04T22:10:10.866203Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-04T22:10:10.870805Z","title":"Proceedings of the AAAI Conference on Artificial Intelligence , volume=","venue":null,"work_id":"3b2385d1-6b96-4d6f-ba4b-5fd277d2a473","year":null},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:cc781b15ebcae8a4a9ed4e9dc2a08f04c9d93dbf1099524c71236d4d8682c154","observation_id":"9a898bca-a375-4c71-a490-8f91c3213ae9","resolution":{"observed_at":"2026-07-04T22:10:10.872102Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2501.13958","doi":"10.48550/arxiv.2501.13958","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"A survey of graph retrieval-augmented generation for customized large language models","venue":null,"work_id":"dad5820a-e704-43fd-99fb-0c3dcd8fcbbb","year":2025},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:4ec2f87059aefb093f87206795b8c73748a921ce18ebc9ee31b7b9a60cfebd85","observation_id":"45d38339-891a-4229-9cd0-dd328d675d31","resolution":{"observed_at":"2026-07-04T01:49:21.521830Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.00489","last_updated":"2024-10-17T15:20:23Z","snapshot_observed_at":"2026-07-06T17:53:31.221833Z","submitted_at":"2024-03-30T23:07:58Z","title":"Prompt-SAW: Leveraging Relation-Aware Graphs for Textual Prompt Compression","version":2},"cited_work":{"arxiv_id":"2404.00489","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.00489","snapshot_observed_at":"2026-07-04T01:49:21.537508Z","title":"arXiv preprint arXiv:2404.00489 , year=","venue":null,"work_id":"73e791d4-8857-4206-bee6-b8b1ba5a9de7","year":null},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"cited_paper":"/paper/2404.00489","citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:165acca150f76e9a0e9a38e7dc9bb1dc8c0544703ef4e49a28e3547a9d3daf6b","observation_id":"8b803126-328c-478b-bcf7-1f8c0cfa75c6","resolution":{"observed_at":"2026-07-04T01:49:21.538989Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-04T22:10:10.854939Z","title":"Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining , pages=","venue":null,"work_id":"e13f37de-b6c4-4bd2-9900-ca3502bfc41e","year":null},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:23f57c206b173a376c3f9d9f507e957a2855c850a238958cb56c7a691dd697b8","observation_id":"182b3fc2-4ff5-4be7-843c-909a74deee3c","resolution":{"observed_at":"2026-07-04T22:10:10.856376Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-09T19:56:29.221994Z","title":null,"venue":null,"work_id":"8d56cd15-b543-4ffe-84e6-e4e3e88c7232","year":2019},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:cd6aae2d880b4d29fb6fa085b465fe4fe79d6bc54b257a9355e6f61ff3d3b8d1","observation_id":"fd7d37a6-efb1-45eb-9749-1bafb0f38645","resolution":{"observed_at":"2026-07-04T22:10:10.854285Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.01282","last_updated":"2021-02-03T09:18:34Z","snapshot_observed_at":"2026-08-03T22:53:08.799163Z","submitted_at":"2020-07-02T17:44:57Z","title":"Leveraging Passage Retrieval with Generative Models for Open Domain Question Answering","version":2},"cited_work":{"arxiv_id":"2007.01282","doi":"10.48550/arxiv.2007.01282","metadata_source":"pith","pith_arxiv_id":"2007.01282","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Leveraging Passage Retrieval with Generative Models for Open Domain Question Answering","venue":"cs.CL","work_id":"0b308f70-d137-45f1-9add-47a9566c1f99","year":2020},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"cited_paper":"/paper/2007.01282","citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:06a45c8b9ce672a2ea2d8118815f1a9fbe92aca9bc3ea318e98dfe92193448eb","observation_id":"a88e5b79-1df2-4eea-a3d9-139267565da7","resolution":{"observed_at":"2026-07-04T01:49:21.549671Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-04T22:10:10.847573Z","title":"International conference on machine learning , pages=","venue":null,"work_id":"009ef44e-4362-452b-af0c-5d9b34d0d35c","year":2020},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:ae145dc4d28e728763dcdb70dd6caa1e420c2c0685f7aeaf91db28f360c7dda6","observation_id":"41ea91fa-fc22-4a89-865f-c8a48838470b","resolution":{"observed_at":"2026-07-04T22:10:10.848961Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.08155","last_updated":"2020-09-18T15:38:12Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2020-02-19T13:09:07Z","title":"CodeBERT: A Pre-Trained Model for Programming and Natural Languages","version":4},"cited_work":{"arxiv_id":"2002.08155","doi":"10.48550/arxiv.2002.08155","metadata_source":"pith","pith_arxiv_id":"2002.08155","snapshot_observed_at":"2026-07-10T21:47:34.671944Z","title":"CodeBERT: A Pre-Trained Model for Programming and Natural Languages","venue":"cs.CL","work_id":"abd850e7-0a69-416d-b504-be33a55a8399","year":2020},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"cited_paper":"/paper/2002.08155","citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:619ff52e2d062fc5fce7526d632dae84f0ca60a985e209b6cbf7c4b5e76db2af","observation_id":"86f921d4-4d6f-43c5-8b6b-bcf3c467a91f","resolution":{"observed_at":"2026-07-04T01:49:21.545477Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-10T22:47:37.635008Z","title":"Science , volume=","venue":null,"work_id":"faa7b37d-0f85-41c5-b6d6-b60a994d201e","year":2022},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:040d8df78eed611e744e5ac628f6cdb5be1e174743a616ffaa2735af28cfdd44","observation_id":"41aca86e-274f-4b66-968b-45ad79e619cc","resolution":{"observed_at":"2026-07-04T22:10:10.800853Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-04T22:10:10.841373Z","title":"Proceedings of the AAAI Conference on Artificial Intelligence , volume=","venue":null,"work_id":"23f622e8-3edb-48b7-9544-875ec209f92a","year":null},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:0a86841e64383e908a6d6c44cab76c9803eb775377f079b5569b5aa00f77b184","observation_id":"b39eb34b-ba54-44e4-857e-fff18d5e8846","resolution":{"observed_at":"2026-07-04T22:10:10.842937Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-04T22:10:10.843501Z","title":"ICASSP 2025-2025 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) , pages=","venue":null,"work_id":"fa44923a-9ddd-4661-a555-9a21209e8992","year":2025},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:940c1b384f34e606679687d91424abd177fc38d804f88570d12c8468e6c06b01","observation_id":"cce88801-ee0a-4320-bfc4-8c9c67accbaa","resolution":{"observed_at":"2026-07-04T22:10:10.844842Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2510.17800","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T11:37:03.262420Z","title":"Glyph: Scaling context windows via visual-text compres- sion","venue":null,"work_id":"fd554aed-9fbc-48cb-bbcd-f2beff67c3d3","year":2025},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:dab4f411c8f66d8e5e12c56e27b14d18736c74d8a9137e228030aed26d5a720c","observation_id":"6f595e1e-95d0-46d9-b422-5e986847a4a6","resolution":{"observed_at":"2026-07-04T01:49:21.516158Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-04T22:10:10.813346Z","title":null,"venue":null,"work_id":"cb6b4909-78b8-45f6-904d-b5eb3b5cff7f","year":null},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:8f491683bb66d32f209ddf99fb8b04428e87ad29cc590b6266e55144e2f92e71","observation_id":"91193035-d5b9-470c-8222-d6b9a2ecb535","resolution":{"observed_at":"2026-07-04T22:10:10.814458Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-04T22:10:10.812506Z","title":null,"venue":null,"work_id":"57ec1638-5488-4715-a9d6-9f3b31ed657a","year":null},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:5033eac52fc05f3780b1bbd22e4476c74b0f012704cafb6f90067bc547510b43","observation_id":"333d4474-f33b-4cdf-935b-c2fb9f457a69","resolution":{"observed_at":"2026-07-04T22:10:10.814244Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-04T22:10:10.832886Z","title":null,"venue":null,"work_id":"475dc60e-0405-4edb-95b5-60d937c80925","year":null},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:50c6a131e76fc86aa323cbe6069ddc1e1d9cc4135a2d0ec15c531e2efcef687f","observation_id":"94daab7b-5301-4923-8293-da953cb9a7f9","resolution":{"observed_at":"2026-07-04T22:10:10.834027Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2503.10720","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-04T01:49:21.526720Z","title":"AttentionRAG: Attention-guided context pruning in retrieval-augmented generation","venue":null,"work_id":"16c8431a-5944-4cbe-9f15-a8d79ad484eb","year":2025},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:6ccbe7a56127f870ca7c0ff88ca6d87d00bf8938e5ba39d523085c3a78d4f9bc","observation_id":"5ead8d0e-d552-4e71-bfd0-826db64ef58c","resolution":{"observed_at":"2026-07-04T01:49:21.528323Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.06730","last_updated":"2025-01-12T06:57:06Z","snapshot_observed_at":"2026-07-06T20:19:50.997046Z","submitted_at":"2025-01-12T06:57:06Z","title":"Better Prompt Compression Without Multi-Layer Perceptrons","version":1},"cited_work":{"arxiv_id":"2501.06730","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.06730","snapshot_observed_at":"2026-07-04T01:49:21.540376Z","title":"arXiv preprint arXiv:2501.06730 , year=","venue":null,"work_id":"29bea276-21b3-4a51-b2a6-2fa2c3e4262d","year":null},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"cited_paper":"/paper/2501.06730","citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:6a0000425c0521635f403063e2d9e566321ac9555d02effed906b5e5fadaa295","observation_id":"7584981d-1b57-4053-a572-9395c8d07aed","resolution":{"observed_at":"2026-07-04T01:49:21.541920Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.01939","last_updated":"2025-11-13T10:08:29Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-06-02T17:54:39Z","title":"Beyond the 80/20 Rule: High-Entropy Minority Tokens Drive Effective Reinforcement Learning for LLM Reasoning","version":2},"cited_work":{"arxiv_id":"2506.01939","doi":"10.48550/arxiv.2506.01939","metadata_source":"pith","pith_arxiv_id":"2506.01939","snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"Beyond the 80/20 Rule: High-Entropy Minority Tokens Drive Effective Reinforcement Learning for LLM Reasoning","venue":"cs.CL","work_id":"e5e936f3-0cff-4732-b394-f607d7a63f5f","year":2025},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"cited_paper":"/paper/2506.01939","citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:b18ed9cea140511d29506cfcad933639044d7f005a2b13abacef9f7621322d2b","observation_id":"6e29a26f-4e8f-40b3-8401-66a294097cb3","resolution":{"observed_at":"2026-07-04T01:49:21.519153Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-23T16:25:08.024018+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-23T16:25:08.024018+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2511.15244","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-04T01:49:21.532732Z","title":"Context cascade compression: Exploring the upper limits of text compression","venue":null,"work_id":"de2cf537-716e-4307-8f75-d45c0d4b7bde","year":2025},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:82e43b736121c16efbaee3aa66788af7f27ee9db5cdb6cb056c4249542ed476c","observation_id":"2cd54378-4d8c-4874-a29d-c5e13ebf95e4","resolution":{"observed_at":"2026-07-04T01:49:21.534297Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-04T22:10:10.842726Z","title":"Findings of the Association for Computational Linguistics: ACL 2025 , pages=","venue":null,"work_id":"73daead7-2838-44fd-9b0c-1ab3c68be385","year":2025},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:c133a66626e81a419a96dcd9a1d3de2fbb5d98b59078a28e1907f58bebf67d90","observation_id":"fe19bb53-b27f-4adf-9e68-edc1e15b9b5e","resolution":{"observed_at":"2026-07-04T22:10:10.843873Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.15260","last_updated":"2025-08-21T05:48:38Z","snapshot_observed_at":"2026-08-02T03:10:09.020351Z","submitted_at":"2025-08-21T05:48:38Z","title":"Deep Think with Confidence","version":1},"cited_work":{"arxiv_id":"2508.15260","doi":"10.48550/arxiv.2508.15260","metadata_source":"pith","pith_arxiv_id":"2508.15260","snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"Deep Think with Confidence","venue":"cs.LG","work_id":"39c40c74-9f55-406d-b67a-37d9b88aa6b3","year":2025},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"cited_paper":"/paper/2508.15260","citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:ae6694e74f69cd1b65092120aee3d72f660eb7f084133f247f82e9ded2495a94","observation_id":"1296dd39-e08f-4e98-9da7-60d2ddafa770","resolution":{"observed_at":"2026-07-04T01:49:21.536262Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-04T22:10:10.808287Z","title":"URL https://arxiv","venue":null,"work_id":"f00c4e07-2be1-4998-9bf9-845889b7a55b","year":2025},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:b00eb36d55fb412efffc7f3d9cbcab7a42b23dce9df9ccd36006833c9c55d32d","observation_id":"1679a879-a627-4ec6-baf9-07602b67c309","resolution":{"observed_at":"2026-07-04T22:10:10.809444Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-04T22:10:10.830793Z","title":"Proceedings of the AAAI Conference on Artificial Intelligence , volume=","venue":null,"work_id":"5ae79565-e742-444b-8daa-b6251c4825cc","year":null},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:4e3d9f569d970fc1af5614a66514d89026bcf6d7dda9abb0b20f4943997c12b4","observation_id":"5aaf7f5e-bf8a-4ef7-b619-dad75121d3ab","resolution":{"observed_at":"2026-07-04T22:10:10.832143Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2505.14582","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-04T01:49:21.523575Z","title":"Can pruning improve reasoning? revisit- ing long-cot compression with capability in mind for bet- ter reasoning","venue":null,"work_id":"eb1f669f-371c-43ec-9ccb-8263db7cc726","year":2025},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:eec6c8f0548727aa23a7d41a0ab689b934d3528d85081f1751a658cb9efd8776","observation_id":"a76778e9-98ad-432b-81d9-5e1283013283","resolution":{"observed_at":"2026-07-04T01:49:21.525476Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.03172","last_updated":"2023-11-20T23:09:34Z","snapshot_observed_at":"2026-07-06T15:51:12.179086Z","submitted_at":"2023-07-06T17:54:11Z","title":"Lost in the Middle: How Language Models Use Long Contexts","version":3},"cited_work":{"arxiv_id":"2307.03172","doi":"10.1162/tacl","metadata_source":"pith","pith_arxiv_id":"2307.03172","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Lost in the Middle: How Language Models Use Long Contexts","venue":"cs.CL","work_id":"37c05e13-4a24-44f8-a1c4-da1bbe7223aa","year":2023},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"cited_paper":"/paper/2307.03172","citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:23fcc6d19a4de6373938e3f1ea1eb3fbd7eae4707fc87ae7ec5eaa74e2151f8e","observation_id":"6a287a1e-79fc-4d81-b1fa-30bfeafded03","resolution":{"observed_at":"2026-07-04T01:49:21.547994Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-04T22:10:10.839213Z","title":"Findings of the Association for Computational Linguistics: NAACL 2025 , pages=","venue":null,"work_id":"e32e0651-a7b4-4bc0-b080-1d569874f9f7","year":2025},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:510479359a436b287fcb61def16664234b6953839360faf5f018e73b95d1d53d","observation_id":"f1f046ab-2c96-4379-8fd7-ee79042629c2","resolution":{"observed_at":"2026-07-04T22:10:10.840575Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-04T22:10:10.845424Z","title":"Proceedings of the 28th ACM SIGKDD conference on knowledge discovery and data mining , pages=","venue":null,"work_id":"a69752d0-66fe-41e0-ba93-fb1d584ded56","year":null},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:aae5a4ad0564dbcad641adf55ed3271c9f678df80295a22ca8a975045bf4fa49","observation_id":"76db75d0-14da-4ae1-8954-0c24f5e227a1","resolution":{"observed_at":"2026-07-04T22:10:10.846924Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-04T22:10:10.851232Z","title":"Proceedings of the 31st ACM International Conference on Information & Knowledge Management , pages=","venue":null,"work_id":"3e5d92d1-8ac9-4fe1-b01c-3a01dd922e2b","year":null},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:338280e2dd3f799f2fdf7827bbb39a9edcc0b726ecfae661b43e07d70163e5d8","observation_id":"ca91f959-5d39-4466-9e0d-9771667b69a8","resolution":{"observed_at":"2026-07-04T22:10:10.852569Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-04T22:10:10.817872Z","title":"Advances in neural information processing systems , volume=","venue":null,"work_id":"e3c62b79-fd46-423e-9692-f79a56b7f770","year":null},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:5715aa403433c6353eda704353ecf5c24f559eecc2d5b3d5103154c12df542f1","observation_id":"eb5490f0-9efb-4030-ab79-4e12fa84ae9c","resolution":{"observed_at":"2026-07-04T22:10:10.819733Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-04T22:10:10.861282Z","title":"Foundations and trends","venue":null,"work_id":"1588bc9e-61a3-41ef-b585-c7627f70dd90","year":2009},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:9b2c954a6352ae0245f946a9fc1b4144081707357ab69439f679760dbaaf2af5","observation_id":"2fec6ce5-99f6-47c4-9c9d-6f4977acd257","resolution":{"observed_at":"2026-07-04T22:10:10.862377Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1908.10084","last_updated":"2019-08-27T08:50:17Z","snapshot_observed_at":"2026-07-06T08:17:05.681370Z","submitted_at":"2019-08-27T08:50:17Z","title":"Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks","version":1},"cited_work":{"arxiv_id":"1908.10084","doi":"10.48550/arxiv.1908.10084","metadata_source":"pith","pith_arxiv_id":"1908.10084","snapshot_observed_at":"2026-07-10T20:57:34.817516Z","title":"Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks","venue":"cs.CL","work_id":"27adfcc9-2a67-43d6-a844-78309012411f","year":2019},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"cited_paper":"/paper/1908.10084","citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:0cdf21b68fc0e7bcca177fa31059cb030da47cd30f4c1d764557c7481ae5f7d4","observation_id":"7998fe76-c3d5-4cd8-9761-863858043141","resolution":{"observed_at":"2026-07-04T01:49:21.544268Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-12T06:19:15.148899+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T06:19:15.148899+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-04T22:10:10.837413Z","title":"2023 , howpublished=","venue":null,"work_id":"0c458346-6265-4dbd-8298-d7dd13159393","year":2023},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:7a8aecc0a60a0a239c839ff06fd82318c44b99c808840d7a3bff4d2f2fdc631e","observation_id":"5b72f866-04aa-45d5-9db3-7572790888dd","resolution":{"observed_at":"2026-07-04T22:10:10.838577Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-04T22:10:10.835229Z","title":"Nature , volume=","venue":null,"work_id":"6c0e5a3f-5b2f-4583-a428-6b0bf32a508d","year":1999},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:1e462cc4bacec1e592d76220957e12e79515901fc4f2525ba81d564a98bb02c1","observation_id":"5b6850aa-83fa-4470-be0d-823989b5d38f","resolution":{"observed_at":"2026-07-04T22:10:10.836639Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-04T22:10:10.835545Z","title":null,"venue":null,"work_id":"d0ee0a94-ddcd-41b2-9e53-f2c6da69b4be","year":2015},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:e7aef08ea8a80eb7e6bf5e3ba789a19f447846b6123cc15c2878b95fe2c0983b","observation_id":"c4d64395-3f98-455f-b22f-651e5c1fda1f","resolution":{"observed_at":"2026-07-04T22:10:10.836691Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-04T22:10:10.840766Z","title":"IEEE Transactions on Pattern Analysis and Machine Intelligence , volume=","venue":null,"work_id":"ffac65c2-9ca0-4a0f-987d-88c027c0c011","year":2023},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:5013767af8bfab56e1192210e25cfd750c7f2ae213cc67d4d93bfadcf31bd8d4","observation_id":"f9257bf6-81de-4d0d-9f9b-086a123a1ffa","resolution":{"observed_at":"2026-07-04T22:10:10.841972Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-07T02:03:11.961143Z","title":"author=","venue":null,"work_id":"640e2dfc-3fe2-4c69-aa0c-774e9cec9b67","year":1999},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:f35c9319adbd68726859e594f7cd47c60be205e6ffdc78addc8af49ee1f899c4","observation_id":"330e37eb-00f7-448d-b2c2-d4f17a8264c4","resolution":{"observed_at":"2026-07-04T22:10:10.830152Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-04T22:10:10.849541Z","title":"Proceedings","venue":null,"work_id":"f53b668b-dfa8-4a71-83f5-df7e117288a7","year":2004},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:5d74d3b97e71c611c66ab321c40db31ea35a0f25d314b8f9453b89c5f6c8cb65","observation_id":"b744491f-e9b4-4dbb-b3e2-aad05d88dbfe","resolution":{"observed_at":"2026-07-04T22:10:10.850632Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-08T11:44:51.985703Z","title":"Transactions of the association for computational linguistics , volume=","venue":null,"work_id":"35c18954-8a0c-4935-b39c-5981194920ba","year":null},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:a57e811992b968a34325302404be54e4e6abfa75fcecaf248161bf77d31ed4c0","observation_id":"e0a604f2-4ae0-44c7-9a7c-d36832d03dae","resolution":{"observed_at":"2026-07-04T22:10:10.858319Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning"},"reference_resolution":{"displayed":57,"state_counts":{"malformed_identifier":0,"metadata_mismatch":13,"parse_uncertain":0,"unresolved":6,"verified_exact":7,"verified_fuzzy":31},"total_outbound_references":57},"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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 57 of 57 outbound references and 0 inbound Pith citation observations for arXiv:2607.01241."}