{"as_of":"2026-08-07T06:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:de6f05c5e0c3090e8aa3020b3402c939895aec0b6a564c8fe100d940b3fa9efb","coverage":[{"denominator":12,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T14:21:12.438372Z","state":"measured"},{"denominator":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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.14119/citation-record","integrity":"/paper/2607.14119/integrity","json":"/paper/2607.14119/citation-record.json","paper":"/paper/2607.14119"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T14:21:11.192259Z","title":"2017 , publisher =","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.14119","last_updated":"2026-07-18T06:29:36Z","snapshot_observed_at":"2026-08-06T10:12:30.468698Z","submitted_at":"2026-05-12T01:11:12Z","title":"Semantic Register Compression in Multi-Agent LLM Cascades","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-02T14:21:11.192259Z"},"links":{"citing_paper":"/paper/2607.14119"},"observation_digest":"sha256:8589bda4929ada063432857bc05f46fd10141dc25233cd1985507ea45973cdde","observation_id":"4f57f342-4a89-4367-9acf-f24c86edd428","resolution":{"observed_at":"2026-08-02T14:21:11.192259Z","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-02T14:21:11.333347Z","title":"2019 , publisher =","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.14119","last_updated":"2026-07-18T06:29:36Z","snapshot_observed_at":"2026-08-06T10:12:30.468698Z","submitted_at":"2026-05-12T01:11:12Z","title":"Semantic Register Compression in Multi-Agent LLM Cascades","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-02T14:21:11.333347Z"},"links":{"citing_paper":"/paper/2607.14119"},"observation_digest":"sha256:f9a550903ccf27668a3fe674af0fe76b5276ab499d33b8fe044944eaafdb00dc","observation_id":"2b4aaf11-caf0-433d-85ef-7cd3378d757c","resolution":{"observed_at":"2026-08-02T14:21:11.333347Z","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-02T14:21:11.444091Z","title":"and Ng, Andrew Y","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.14119","last_updated":"2026-07-18T06:29:36Z","snapshot_observed_at":"2026-08-06T10:12:30.468698Z","submitted_at":"2026-05-12T01:11:12Z","title":"Semantic Register Compression in Multi-Agent LLM Cascades","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-02T14:21:11.444091Z"},"links":{"citing_paper":"/paper/2607.14119"},"observation_digest":"sha256:fddebc45348597acc8ef0179f95eca69ad5cfb12ac90f3957e9a86114a42e402","observation_id":"818b9c47-ec25-4f55-9c80-c9e42d449b24","resolution":{"observed_at":"2026-08-02T14:21:11.444091Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.14325","last_updated":"2023-05-23T17:55:11Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-05-23T17:55:11Z","title":"Improving Factuality and Reasoning in Language Models through Multiagent Debate","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.14325","snapshot_observed_at":"2026-08-02T14:21:11.503273Z","title":"and Mordatch, Igor , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.14119","last_updated":"2026-07-18T06:29:36Z","snapshot_observed_at":"2026-08-06T10:12:30.468698Z","submitted_at":"2026-05-12T01:11:12Z","title":"Semantic Register Compression in Multi-Agent LLM Cascades","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-02T14:21:11.503273Z"},"links":{"cited_paper":"/paper/2305.14325","citing_paper":"/paper/2607.14119"},"observation_digest":"sha256:8a160c4d64379ed2c9a73b524825fcc66d2b162b51d0503bc2bbc934c8ac1a6a","observation_id":"fd26bb85-d320-4270-b4a5-dbbb509f06d1","resolution":{"observed_at":"2026-08-02T14:21:11.503273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.13657","last_updated":"2025-10-26T23:25:18Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-03-17T19:04:38Z","title":"Why Do Multi-Agent LLM Systems Fail?","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.13657","snapshot_observed_at":"2026-08-02T14:21:11.579798Z","title":"doi:10.48550/arXiv.2503.13657 , url =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.14119","last_updated":"2026-07-18T06:29:36Z","snapshot_observed_at":"2026-08-06T10:12:30.468698Z","submitted_at":"2026-05-12T01:11:12Z","title":"Semantic Register Compression in Multi-Agent LLM Cascades","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-02T14:21:11.579798Z"},"links":{"cited_paper":"/paper/2503.13657","citing_paper":"/paper/2607.14119"},"observation_digest":"sha256:5307aa570bc7c101a7b328a1199047de5d1e79e77a479e9091a2f9bface79633","observation_id":"f67b07bf-58d7-42ef-8dbd-8dd2076b9c68","resolution":{"observed_at":"2026-08-02T14:21:11.579798Z","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":"10.1109/wi-iat.2012.272","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"and Eskridge, Thomas and Feltovich, Paul J","venue":"2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","work_id":"f07808a9-d3b7-4704-a15a-e8398b050b2b","year":2012},"citing_paper":{"arxiv_id":"2607.14119","last_updated":"2026-07-18T06:29:36Z","snapshot_observed_at":"2026-08-06T10:12:30.468698Z","submitted_at":"2026-05-12T01:11:12Z","title":"Semantic Register Compression in Multi-Agent LLM Cascades","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-02T14:21:11.663073Z"},"links":{"citing_paper":"/paper/2607.14119"},"observation_digest":"sha256:b50d8848d49f8671b7af1b53a2338960dd3506c6854a9a4a4da40fb51175710d","observation_id":"a8f28d9d-fa12-49f0-bc33-e7cb7b39a110","resolution":{"observed_at":"2026-08-02T14:23:26.112854Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T14:21:11.781319Z","title":", year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.14119","last_updated":"2026-07-18T06:29:36Z","snapshot_observed_at":"2026-08-06T10:12:30.468698Z","submitted_at":"2026-05-12T01:11:12Z","title":"Semantic Register Compression in Multi-Agent LLM Cascades","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-02T14:21:11.781319Z"},"links":{"citing_paper":"/paper/2607.14119"},"observation_digest":"sha256:a4cee8e28aaf1214987fa7f460ed1d77833207b90d732ebab3e0686ebe4a3332","observation_id":"7bd2b093-2fbc-44c5-9a84-691bab564d7a","resolution":{"observed_at":"2026-08-02T14:21:11.781319Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2601.03779","last_updated":"2026-04-24T10:47:16Z","snapshot_observed_at":"2026-08-02T12:29:34.614677Z","submitted_at":"2026-01-07T10:16:59Z","title":"Tracing the complexity profiles of different linguistic phenomena through the intrinsic dimension of LLM representations","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2601.03779","snapshot_observed_at":"2026-08-02T14:21:11.924271Z","title":"doi:10.48550/arXiv.2601.03779 , url =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.14119","last_updated":"2026-07-18T06:29:36Z","snapshot_observed_at":"2026-08-06T10:12:30.468698Z","submitted_at":"2026-05-12T01:11:12Z","title":"Semantic Register Compression in Multi-Agent LLM Cascades","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-02T14:21:11.924271Z"},"links":{"cited_paper":"/paper/2601.03779","citing_paper":"/paper/2607.14119"},"observation_digest":"sha256:fb97fcad544e47a515c8714e5b64e4fe524eb70272ca93cda644db0bfceef941","observation_id":"46c31aa7-cf9a-4116-8a8b-cd6db53ac94d","resolution":{"observed_at":"2026-08-02T14:21:11.924271Z","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-02T14:21:12.095671Z","title":"doi:10.48550/arXiv.2603.26993 , url =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.14119","last_updated":"2026-07-18T06:29:36Z","snapshot_observed_at":"2026-08-06T10:12:30.468698Z","submitted_at":"2026-05-12T01:11:12Z","title":"Semantic Register Compression in Multi-Agent LLM Cascades","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-02T14:21:12.095671Z"},"links":{"citing_paper":"/paper/2607.14119"},"observation_digest":"sha256:38e751350dc50fa4163cfbdd92fb91e20a1948a87480762189f3c5f68b32858a","observation_id":"563fa28f-f424-4b22-9281-cfb2eb8addbc","resolution":{"observed_at":"2026-08-02T14:21:12.095671Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2603.04474","last_updated":"2026-05-11T15:41:00Z","snapshot_observed_at":"2026-07-06T22:47:50.848191Z","submitted_at":"2026-03-04T11:45:27Z","title":"From Spark to Fire: Modeling and Mitigating Error Cascades in LLM-Based Multi-Agent Collaboration","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2603.04474","snapshot_observed_at":"2026-08-02T14:21:12.213623Z","title":"doi:10.48550/arXiv.2603.04474 , url =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.14119","last_updated":"2026-07-18T06:29:36Z","snapshot_observed_at":"2026-08-06T10:12:30.468698Z","submitted_at":"2026-05-12T01:11:12Z","title":"Semantic Register Compression in Multi-Agent LLM Cascades","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-02T14:21:12.213623Z"},"links":{"cited_paper":"/paper/2603.04474","citing_paper":"/paper/2607.14119"},"observation_digest":"sha256:e08019b39e2fff942f7bfdd5120f6030f8ff13738b0d771a144a52d9190235f3","observation_id":"699ade45-619b-497f-97c8-81f5b95f3c7d","resolution":{"observed_at":"2026-08-02T14:21:12.213623Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2604.13349","last_updated":"2026-07-01T05:29:42Z","snapshot_observed_at":"2026-08-01T14:32:55.401434Z","submitted_at":"2026-04-14T23:20:17Z","title":"When Less Latent Leads to Better Relay: Information-Preserving Compression for Latent Multi-Agent LLM Collaboration","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2604.13349","snapshot_observed_at":"2026-08-02T14:21:12.357658Z","title":"doi:10.48550/arXiv.2604.13349 , url =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.14119","last_updated":"2026-07-18T06:29:36Z","snapshot_observed_at":"2026-08-06T10:12:30.468698Z","submitted_at":"2026-05-12T01:11:12Z","title":"Semantic Register Compression in Multi-Agent LLM Cascades","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-02T14:21:12.357658Z"},"links":{"cited_paper":"/paper/2604.13349","citing_paper":"/paper/2607.14119"},"observation_digest":"sha256:71f2d01170a4a9931092851481383dde58efd8417a27cb3ab387b9b5a51aae18","observation_id":"a4520350-971e-4c55-b3ec-9919dc7e4c13","resolution":{"observed_at":"2026-08-02T14:21:12.357658Z","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-02T14:21:12.438372Z","title":"doi:10.48550/arXiv.2602.18450 , url =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.14119","last_updated":"2026-07-18T06:29:36Z","snapshot_observed_at":"2026-08-06T10:12:30.468698Z","submitted_at":"2026-05-12T01:11:12Z","title":"Semantic Register Compression in Multi-Agent LLM Cascades","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-02T14:21:12.438372Z"},"links":{"citing_paper":"/paper/2607.14119"},"observation_digest":"sha256:7c1dee099b04442a9db54e4ff0749efb665ae25fbee2e20eb91f0e934f19b4b7","observation_id":"34844740-9ae5-44db-b721-4fbe072da917","resolution":{"observed_at":"2026-08-02T14:21:12.438372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.14119","last_updated":"2026-07-18T06:29:36Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-06T10:12:30.468698Z","submitted_at":"2026-05-12T01:11:12Z","title":"Semantic Register Compression in Multi-Agent LLM Cascades"},"reference_resolution":{"displayed":12,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":12},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 12 of 12 outbound references and 0 inbound Pith citation observations for arXiv:2607.14119."}