{"as_of":"2026-08-11T19:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4e446d8443a8555d2e31e189f1fdf2bee1590b8db405008fe9b2dd19ee59056c","coverage":[{"denominator":31,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":31,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T17:10:42.861781Z","state":"measured"},{"denominator":32,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":32,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-25T04:25:26.710488Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-25T04:26:37.916824Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2509.11068","last_updated":"2025-09-14T03:30:06Z","snapshot_observed_at":"2026-08-09T21:37:17.772444Z","submitted_at":"2025-09-14T03:30:06Z","title":"Tractable Asymmetric Verification for Large Language Models via Deterministic Replicability","version":1},"cited_work":{"arxiv_id":"2509.11068","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2509.11068","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2509.11068 , year=","venue":null,"work_id":"b134eaf3-19a7-43f3-8db4-753920760b2e","year":null},"citing_paper":{"arxiv_id":"2605.23414","last_updated":"2026-05-22T09:24:12Z","snapshot_observed_at":"2026-07-06T23:33:39.204744Z","submitted_at":"2026-05-22T09:24:12Z","title":"When Planning Fails Despite Correct Execution: On Epistemic Calibration for LLM-Based Multi-Agent Systems","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-05-25T04:25:26.710488Z"},"links":{"cited_paper":"/paper/2509.11068","citing_paper":"/paper/2605.23414"},"observation_digest":"sha256:0c3d310d5511a857fcd3856b8c2eab34101dc955b3a180e85fb7faf376a23cf5","observation_id":"b16b6de9-3945-4772-8f1c-6b21dd828a06","resolution":{"observed_at":"2026-05-25T04:26:37.920962Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2509.11068/citation-record","integrity":"/paper/2509.11068/integrity","json":"/paper/2509.11068/citation-record.json","paper":"/paper/2509.11068"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.17481","last_updated":"2025-01-07T12:48:22Z","snapshot_observed_at":"2026-08-11T05:24:43.202303Z","submitted_at":"2024-12-23T11:11:51Z","title":"A Survey on LLM-based Multi-Agent System: Recent Advances and New Frontiers in Application","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.17481","snapshot_observed_at":"2026-08-04T17:10:42.727975Z","title":"A survey on LLM-based multi-agent system: Recent advances and new frontiers in application,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.11068","last_updated":"2025-09-14T03:30:06Z","snapshot_observed_at":"2026-08-09T21:37:17.772444Z","submitted_at":"2025-09-14T03:30:06Z","title":"Tractable Asymmetric Verification for Large Language Models via Deterministic Replicability","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T17:10:42.727975Z"},"links":{"cited_paper":"/paper/2412.17481","citing_paper":"/paper/2509.11068"},"observation_digest":"sha256:89f01588b5ca18cdbe21690e5ca00f7f3eea3f28dc5c30f7c08b9ba05e6c032a","observation_id":"47ddb252-8632-4654-85b0-e78f4d88aaa5","resolution":{"observed_at":"2026-08-04T17:10:42.727975Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.21460","last_updated":"2025-03-27T12:50:17Z","snapshot_observed_at":"2026-07-06T20:59:35.694800Z","submitted_at":"2025-03-27T12:50:17Z","title":"Large Language Model Agent: A Survey on Methodology, Applications and Challenges","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.21460","snapshot_observed_at":"2026-08-04T17:10:42.733548Z","title":"Large language model agent: A survey on methodology, applications and challenges,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.11068","last_updated":"2025-09-14T03:30:06Z","snapshot_observed_at":"2026-08-09T21:37:17.772444Z","submitted_at":"2025-09-14T03:30:06Z","title":"Tractable Asymmetric Verification for Large Language Models via Deterministic Replicability","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T17:10:42.733548Z"},"links":{"cited_paper":"/paper/2503.21460","citing_paper":"/paper/2509.11068"},"observation_digest":"sha256:ba96ff81b1b91e2d9516f5f218880e06b244321fa7f51274a65d20914e4e8d85","observation_id":"373b828f-2086-4778-8a7d-8f54c1bb918c","resolution":{"observed_at":"2026-08-04T17:10:42.733548Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.02165","last_updated":"2025-04-02T22:42:45Z","snapshot_observed_at":"2026-08-07T16:13:24.089761Z","submitted_at":"2025-04-02T22:42:45Z","title":"Responsible Innovation: A Strategic Framework for Financial LLM Integration","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.02165","snapshot_observed_at":"2026-08-04T17:10:42.738312Z","title":"Responsible innovation: A strategic framework for financial llm integration,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.11068","last_updated":"2025-09-14T03:30:06Z","snapshot_observed_at":"2026-08-09T21:37:17.772444Z","submitted_at":"2025-09-14T03:30:06Z","title":"Tractable Asymmetric Verification for Large Language Models via Deterministic Replicability","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T17:10:42.738312Z"},"links":{"cited_paper":"/paper/2504.02165","citing_paper":"/paper/2509.11068"},"observation_digest":"sha256:2b26cb799dc10a121c71e69040acfa908a49e2a775ecb885349b8e43016a7149","observation_id":"da30490c-a78f-493d-80e4-32c1e1040c4f","resolution":{"observed_at":"2026-08-04T17:10:42.738312Z","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-04T17:10:42.743751Z","title":"Evaluating large language models for use in healthcare: A framework for translational value assessment,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.11068","last_updated":"2025-09-14T03:30:06Z","snapshot_observed_at":"2026-08-09T21:37:17.772444Z","submitted_at":"2025-09-14T03:30:06Z","title":"Tractable Asymmetric Verification for Large Language Models via Deterministic Replicability","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T17:10:42.743751Z"},"links":{"citing_paper":"/paper/2509.11068"},"observation_digest":"sha256:e9d0e1d39a4fad3f7236537896c9e81defbee3155a13a88fc7577634153cba8f","observation_id":"2a97d331-16e3-4a20-8588-88b0a8270618","resolution":{"observed_at":"2026-08-04T17:10:42.743751Z","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-04T17:10:42.748580Z","title":"Discussion paper on artificial intelligence and machine learning in the financial sector,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.11068","last_updated":"2025-09-14T03:30:06Z","snapshot_observed_at":"2026-08-09T21:37:17.772444Z","submitted_at":"2025-09-14T03:30:06Z","title":"Tractable Asymmetric Verification for Large Language Models via Deterministic Replicability","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T17:10:42.748580Z"},"links":{"citing_paper":"/paper/2509.11068"},"observation_digest":"sha256:06eb1d28e515dcb15daef943a0b312cc96be2072c33911492ec4ac08ebf8e22e","observation_id":"979ffbb4-c680-478c-8a4a-9aa79d8a992e","resolution":{"observed_at":"2026-08-04T17:10:42.748580Z","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-04T17:10:42.753137Z","title":"Bitcoin: A peer-to-peer electronic cash system,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2509.11068","last_updated":"2025-09-14T03:30:06Z","snapshot_observed_at":"2026-08-09T21:37:17.772444Z","submitted_at":"2025-09-14T03:30:06Z","title":"Tractable Asymmetric Verification for Large Language Models via Deterministic Replicability","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T17:10:42.753137Z"},"links":{"citing_paper":"/paper/2509.11068"},"observation_digest":"sha256:b1f7e18e6bb4c40aea9e9374254b8adb6dd2595ac61b8993fa3b30e0e629631b","observation_id":"0773fc1b-8921-44d4-87e5-d90501be981d","resolution":{"observed_at":"2026-08-04T17:10:42.753137Z","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-04T17:10:42.758353Z","title":"Survey of hallucination in natural language generation,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.11068","last_updated":"2025-09-14T03:30:06Z","snapshot_observed_at":"2026-08-09T21:37:17.772444Z","submitted_at":"2025-09-14T03:30:06Z","title":"Tractable Asymmetric Verification for Large Language Models via Deterministic Replicability","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T17:10:42.758353Z"},"links":{"citing_paper":"/paper/2509.11068"},"observation_digest":"sha256:04b7af8a7757b568766cb0c402fae03bc2be9cdf7d8a432ca0ab37c228256b5f","observation_id":"6f355c83-3b94-45c0-9743-e756fc96e7ed","resolution":{"observed_at":"2026-08-04T17:10:42.758353Z","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-04T17:10:42.767106Z","title":"Models and pricing,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.11068","last_updated":"2025-09-14T03:30:06Z","snapshot_observed_at":"2026-08-09T21:37:17.772444Z","submitted_at":"2025-09-14T03:30:06Z","title":"Tractable Asymmetric Verification for Large Language Models via Deterministic Replicability","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T17:10:42.767106Z"},"links":{"citing_paper":"/paper/2509.11068"},"observation_digest":"sha256:ab48712910eaf4c2b9ec6e48eeaccf0cff97f3ce8f8c4f5a4011b412505f1c93","observation_id":"c0ed7cb3-e020-43cc-bc0a-525c693a5279","resolution":{"observed_at":"2026-08-04T17:10:42.767106Z","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-04T17:10:42.771053Z","title":"Models - OpenAI API,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.11068","last_updated":"2025-09-14T03:30:06Z","snapshot_observed_at":"2026-08-09T21:37:17.772444Z","submitted_at":"2025-09-14T03:30:06Z","title":"Tractable Asymmetric Verification for Large Language Models via Deterministic Replicability","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T17:10:42.771053Z"},"links":{"citing_paper":"/paper/2509.11068"},"observation_digest":"sha256:578d0f4a045d3084c05ad2fa28624f956eea20c340cecee75f8aaa9ff45aa8a0","observation_id":"0e851a23-bbfb-40da-b178-191268970175","resolution":{"observed_at":"2026-08-04T17:10:42.771053Z","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-04T17:10:42.775330Z","title":"Trust in multi-agent systems,","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2509.11068","last_updated":"2025-09-14T03:30:06Z","snapshot_observed_at":"2026-08-09T21:37:17.772444Z","submitted_at":"2025-09-14T03:30:06Z","title":"Tractable Asymmetric Verification for Large Language Models via Deterministic Replicability","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T17:10:42.775330Z"},"links":{"citing_paper":"/paper/2509.11068"},"observation_digest":"sha256:392e859911246d8f98734fda2141a1136a6c36af53de8dd903982519612d9c3a","observation_id":"fd6208e8-6f74-4ea9-9f6c-b1a4c16b1eec","resolution":{"observed_at":"2026-08-04T17:10:42.775330Z","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-04T17:10:42.779231Z","title":"Review on computational trust and reputation models,","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2509.11068","last_updated":"2025-09-14T03:30:06Z","snapshot_observed_at":"2026-08-09T21:37:17.772444Z","submitted_at":"2025-09-14T03:30:06Z","title":"Tractable Asymmetric Verification for Large Language Models via Deterministic Replicability","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T17:10:42.779231Z"},"links":{"citing_paper":"/paper/2509.11068"},"observation_digest":"sha256:5edd4d164662c01c295a0b8e002c0da6a20b3a78a46b08abdec5268b55f8502e","observation_id":"0daef927-57d4-4a56-a7ef-b5825ad4792d","resolution":{"observed_at":"2026-08-04T17:10:42.779231Z","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-04T17:10:42.783397Z","title":"Computational trust and reputation models for open multi-agent systems: a review,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2509.11068","last_updated":"2025-09-14T03:30:06Z","snapshot_observed_at":"2026-08-09T21:37:17.772444Z","submitted_at":"2025-09-14T03:30:06Z","title":"Tractable Asymmetric Verification for Large Language Models via Deterministic Replicability","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T17:10:42.783397Z"},"links":{"citing_paper":"/paper/2509.11068"},"observation_digest":"sha256:142761d0a2b4c10dcd3ab01ddabc757bce7154c193c5518e8c06699cc3a37493","observation_id":"ea1a3134-d4a1-4310-9396-07f07ad2f6df","resolution":{"observed_at":"2026-08-04T17:10:42.783397Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.11817","last_updated":"2025-02-13T08:11:25Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-01-22T10:26:14Z","title":"Hallucination is Inevitable: An Innate Limitation of Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.11817","snapshot_observed_at":"2026-08-04T17:10:42.787398Z","title":"Hallucination is inevitable: An innate limitation of large language models,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.11068","last_updated":"2025-09-14T03:30:06Z","snapshot_observed_at":"2026-08-09T21:37:17.772444Z","submitted_at":"2025-09-14T03:30:06Z","title":"Tractable Asymmetric Verification for Large Language Models via Deterministic Replicability","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T17:10:42.787398Z"},"links":{"cited_paper":"/paper/2401.11817","citing_paper":"/paper/2509.11068"},"observation_digest":"sha256:1db484d62869bc4bc7cd52e1ef9534e7cca7efa1f8cbc5679af5992d96f2b2a6","observation_id":"556213cc-40b6-458b-be84-f7ac94e9712c","resolution":{"observed_at":"2026-08-04T17:10:42.787398Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03053","last_updated":"2025-07-10T14:54:28Z","snapshot_observed_at":"2026-08-09T19:05:14.486749Z","submitted_at":"2025-06-03T16:33:47Z","title":"MAEBE: Multi-Agent Emergent Behavior Framework","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.03053","snapshot_observed_at":"2026-08-04T17:10:42.791811Z","title":"Maebe: Multi-agent emergent behavior framework,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.11068","last_updated":"2025-09-14T03:30:06Z","snapshot_observed_at":"2026-08-09T21:37:17.772444Z","submitted_at":"2025-09-14T03:30:06Z","title":"Tractable Asymmetric Verification for Large Language Models via Deterministic Replicability","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T17:10:42.791811Z"},"links":{"cited_paper":"/paper/2506.03053","citing_paper":"/paper/2509.11068"},"observation_digest":"sha256:37816a87e7d4c5176237076ddd703575be47b3a489066ce67d8d965730d9e5f9","observation_id":"93107d8e-6265-4417-aae9-06b63ebdeec2","resolution":{"observed_at":"2026-08-04T17:10:42.791811Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.08948","last_updated":"2025-05-29T09:50:31Z","snapshot_observed_at":"2026-07-06T19:31:53.397265Z","submitted_at":"2024-10-11T16:16:38Z","title":"Emergent social conventions and collective bias in LLM populations","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.08948","snapshot_observed_at":"2026-08-04T17:10:42.796053Z","title":"Emergent social conventions and collective bias in llm populations,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.11068","last_updated":"2025-09-14T03:30:06Z","snapshot_observed_at":"2026-08-09T21:37:17.772444Z","submitted_at":"2025-09-14T03:30:06Z","title":"Tractable Asymmetric Verification for Large Language Models via Deterministic Replicability","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T17:10:42.796053Z"},"links":{"cited_paper":"/paper/2410.08948","citing_paper":"/paper/2509.11068"},"observation_digest":"sha256:ea86a35699e9120b42171f984a1ef935e1ba9f40dc7804c4cb42c7c4e86e01a0","observation_id":"393c2b81-5055-48fa-9aef-c8dabecfe781","resolution":{"observed_at":"2026-08-04T17:10:42.796053Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.06382","last_updated":"2026-07-31T15:48:01Z","snapshot_observed_at":"2026-08-08T12:38:09.647912Z","submitted_at":"2025-06-04T23:28:39Z","title":"On the Fundamental Impossibility of Hallucination Control in Large Language Models","version":8},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.06382","snapshot_observed_at":"2026-08-04T17:10:42.800738Z","title":"On the fundamental impossibility of hallucination control in large language models,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.11068","last_updated":"2025-09-14T03:30:06Z","snapshot_observed_at":"2026-08-09T21:37:17.772444Z","submitted_at":"2025-09-14T03:30:06Z","title":"Tractable Asymmetric Verification for Large Language Models via Deterministic Replicability","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T17:10:42.800738Z"},"links":{"cited_paper":"/paper/2506.06382","citing_paper":"/paper/2509.11068"},"observation_digest":"sha256:42b9deaa4e1ae4a0b4a70d66c1a3a5d952c748cf85ea08353174964092656866","observation_id":"2545028e-b8fa-4604-a621-71d50d982f38","resolution":{"observed_at":"2026-08-04T17:10:42.800738Z","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-04T17:10:42.804906Z","title":"A survey on hallucination in large language models: Principles, taxonomy, challenges, and open questions,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.11068","last_updated":"2025-09-14T03:30:06Z","snapshot_observed_at":"2026-08-09T21:37:17.772444Z","submitted_at":"2025-09-14T03:30:06Z","title":"Tractable Asymmetric Verification for Large Language Models via Deterministic Replicability","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T17:10:42.804906Z"},"links":{"citing_paper":"/paper/2509.11068"},"observation_digest":"sha256:80366b748b0d9c21dc4c884076f46bfa7183fa637742998519bf4e8a284a9af4","observation_id":"79936cd4-4aa5-4586-952c-b9e78f1ea7b4","resolution":{"observed_at":"2026-08-04T17:10:42.804906Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.12964","last_updated":"2025-08-25T16:47:29Z","snapshot_observed_at":"2026-08-09T21:23:48.878229Z","submitted_at":"2025-02-18T15:46:31Z","title":"Trust Me, I'm Wrong: LLMs Hallucinate with Certainty Despite Knowing the Answer","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.12964","snapshot_observed_at":"2026-08-04T17:10:42.808795Z","title":"Trust me, i’m wrong: Llms hallucinate with certainty despite knowing the answer,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.11068","last_updated":"2025-09-14T03:30:06Z","snapshot_observed_at":"2026-08-09T21:37:17.772444Z","submitted_at":"2025-09-14T03:30:06Z","title":"Tractable Asymmetric Verification for Large Language Models via Deterministic Replicability","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T17:10:42.808795Z"},"links":{"cited_paper":"/paper/2502.12964","citing_paper":"/paper/2509.11068"},"observation_digest":"sha256:4ae4be2b7b540927fbb92457f4661afaea9e07bd4950b69c937b961a005e8817","observation_id":"947c7c23-9bee-4ee1-a2fe-9b64140a0c9b","resolution":{"observed_at":"2026-08-04T17:10:42.808795Z","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-04T17:10:42.813147Z","title":"Judging llm-as-a-judge with mt-bench and chatbot arena,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.11068","last_updated":"2025-09-14T03:30:06Z","snapshot_observed_at":"2026-08-09T21:37:17.772444Z","submitted_at":"2025-09-14T03:30:06Z","title":"Tractable Asymmetric Verification for Large Language Models via Deterministic Replicability","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T17:10:42.813147Z"},"links":{"citing_paper":"/paper/2509.11068"},"observation_digest":"sha256:b04268cd5553a54169e2c3e9a656066e043501ea46eb342a9e0b0ad53df25947","observation_id":"44887f67-c559-420e-9c53-9c8383819df5","resolution":{"observed_at":"2026-08-04T17:10:42.813147Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.03092","last_updated":"2025-08-05T05:15:03Z","snapshot_observed_at":"2026-08-10T18:33:16.403687Z","submitted_at":"2025-08-05T05:15:03Z","title":"Toward Verifiable Misinformation Detection: A Multi-Tool LLM Agent Framework","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.03092","snapshot_observed_at":"2026-08-04T17:10:42.822377Z","title":"Toward verifiable misinformation detection: A multi-tool llm agent framework,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.11068","last_updated":"2025-09-14T03:30:06Z","snapshot_observed_at":"2026-08-09T21:37:17.772444Z","submitted_at":"2025-09-14T03:30:06Z","title":"Tractable Asymmetric Verification for Large Language Models via Deterministic Replicability","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T17:10:42.822377Z"},"links":{"cited_paper":"/paper/2508.03092","citing_paper":"/paper/2509.11068"},"observation_digest":"sha256:3b8a40bc1a2b4dd1b043264388ab3271698442e163b38e50b9047ec2a19afdef","observation_id":"dcac37ff-1be9-47bd-ac10-a517305a853f","resolution":{"observed_at":"2026-08-04T17:10:42.822377Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.05685","last_updated":"2023-12-24T02:01:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-06-09T05:55:52Z","title":"Judging LLM-as-a-Judge with MT-Bench and Chatbot Arena","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.05685","snapshot_observed_at":"2026-08-04T17:10:42.817913Z","title":"Available: https://arxiv.org/abs/2306.05685","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.11068","last_updated":"2025-09-14T03:30:06Z","snapshot_observed_at":"2026-08-09T21:37:17.772444Z","submitted_at":"2025-09-14T03:30:06Z","title":"Tractable Asymmetric Verification for Large Language Models via Deterministic Replicability","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T17:10:42.817913Z"},"links":{"cited_paper":"/paper/2306.05685","citing_paper":"/paper/2509.11068"},"observation_digest":"sha256:bdb295524c30581c596d1e909583ff9ee751da0662af293229fa02c434913235","observation_id":"228824bd-89a2-410c-b3e9-c9a035ef7786","resolution":{"observed_at":"2026-08-04T17:10:42.817913Z","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-04T17:10:42.835799Z","title":"Airepr: An analyst- inspector framework for evaluating reproducibility of llms in data science,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.11068","last_updated":"2025-09-14T03:30:06Z","snapshot_observed_at":"2026-08-09T21:37:17.772444Z","submitted_at":"2025-09-14T03:30:06Z","title":"Tractable Asymmetric Verification for Large Language Models via Deterministic Replicability","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T17:10:42.835799Z"},"links":{"citing_paper":"/paper/2509.11068"},"observation_digest":"sha256:70ca39f953e151faea6946251c1c7019ae7e46e0d73152bcb1ceae4276d1cfc5","observation_id":"1061a212-a613-4f29-b47d-b9fe5e3e8608","resolution":{"observed_at":"2026-08-04T17:10:42.835799Z","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-04T17:10:42.826567Z","title":"Codeagents: A token-efficient framework for codified multi-agent reasoning in llms,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.11068","last_updated":"2025-09-14T03:30:06Z","snapshot_observed_at":"2026-08-09T21:37:17.772444Z","submitted_at":"2025-09-14T03:30:06Z","title":"Tractable Asymmetric Verification for Large Language Models via Deterministic Replicability","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-04T17:10:42.826567Z"},"links":{"citing_paper":"/paper/2509.11068"},"observation_digest":"sha256:9e6e0dff17acebeaf17ff0b133cebc7d8d3a673160f306d6195881141152c4f2","observation_id":"d8b94828-3484-4078-9d0d-37b017083b19","resolution":{"observed_at":"2026-08-04T17:10:42.826567Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.16109","last_updated":"2024-04-24T18:04:50Z","snapshot_observed_at":"2026-08-05T17:37:01.684801Z","submitted_at":"2024-04-24T18:04:50Z","title":"zkLLM: Zero Knowledge Proofs for Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.16109","snapshot_observed_at":"2026-08-04T17:10:42.844158Z","title":"zkllm: Zero knowledge proofs for large language models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.11068","last_updated":"2025-09-14T03:30:06Z","snapshot_observed_at":"2026-08-09T21:37:17.772444Z","submitted_at":"2025-09-14T03:30:06Z","title":"Tractable Asymmetric Verification for Large Language Models via Deterministic Replicability","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T17:10:42.844158Z"},"links":{"cited_paper":"/paper/2404.16109","citing_paper":"/paper/2509.11068"},"observation_digest":"sha256:ab9c6d86e1f436e99f898edf02eff0f2a400ae48ddb8ac07845853ee42a1e778","observation_id":"6fff8489-d810-48a6-8c30-42675a77a9a4","resolution":{"observed_at":"2026-08-04T17:10:42.844158Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.09751","last_updated":"2020-02-14T21:56:30Z","snapshot_observed_at":"2026-07-06T07:47:32.745963Z","submitted_at":"2019-04-22T07:17:18Z","title":"The Curious Case of Neural Text Degeneration","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.09751","snapshot_observed_at":"2026-08-04T17:10:42.848443Z","title":"The curious case of neural text degeneration,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.11068","last_updated":"2025-09-14T03:30:06Z","snapshot_observed_at":"2026-08-09T21:37:17.772444Z","submitted_at":"2025-09-14T03:30:06Z","title":"Tractable Asymmetric Verification for Large Language Models via Deterministic Replicability","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-04T17:10:42.848443Z"},"links":{"cited_paper":"/paper/1904.09751","citing_paper":"/paper/2509.11068"},"observation_digest":"sha256:580c6629004027fcc7838aa358353133a59fc010ff2dbd64c9c2869a857d6219","observation_id":"027f4adc-ba43-472b-ab70-f80bcb96e3c7","resolution":{"observed_at":"2026-08-04T17:10:42.848443Z","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-04T17:10:42.840001Z","title":"A survey of verifiable computation,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.11068","last_updated":"2025-09-14T03:30:06Z","snapshot_observed_at":"2026-08-09T21:37:17.772444Z","submitted_at":"2025-09-14T03:30:06Z","title":"Tractable Asymmetric Verification for Large Language Models via Deterministic Replicability","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-04T17:10:42.840001Z"},"links":{"citing_paper":"/paper/2509.11068"},"observation_digest":"sha256:b2c7f0c80deab2fc918c7d6b93b5b14f6a392518a86d035da4980be295df20ff","observation_id":"db91327a-95bb-4341-8d1a-8c51156800aa","resolution":{"observed_at":"2026-08-04T17:10:42.840001Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.10268","last_updated":"2025-06-12T01:23:22Z","snapshot_observed_at":"2026-08-07T04:28:14.236783Z","submitted_at":"2025-06-12T01:23:22Z","title":"Do Language Models Have Bayesian Brains? Distinguishing Stochastic and Deterministic Decision Patterns within Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.10268","snapshot_observed_at":"2026-08-04T17:10:42.857410Z","title":"Do language models have bayesian brains? distinguishing stochastic and deterministic decision patterns within large language models,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.11068","last_updated":"2025-09-14T03:30:06Z","snapshot_observed_at":"2026-08-09T21:37:17.772444Z","submitted_at":"2025-09-14T03:30:06Z","title":"Tractable Asymmetric Verification for Large Language Models via Deterministic Replicability","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-04T17:10:42.857410Z"},"links":{"cited_paper":"/paper/2506.10268","citing_paper":"/paper/2509.11068"},"observation_digest":"sha256:15d88647f4d5d781420850c192c3df967f353e231a2e314d65a79e36acdf0480","observation_id":"ac92f2db-fbca-4dbe-bab7-43026ce893c4","resolution":{"observed_at":"2026-08-04T17:10:42.857410Z","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-04T17:10:42.861781Z","title":"Meta-llama-3-8b-instruct,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.11068","last_updated":"2025-09-14T03:30:06Z","snapshot_observed_at":"2026-08-09T21:37:17.772444Z","submitted_at":"2025-09-14T03:30:06Z","title":"Tractable Asymmetric Verification for Large Language Models via Deterministic Replicability","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-04T17:10:42.861781Z"},"links":{"citing_paper":"/paper/2509.11068"},"observation_digest":"sha256:4236d9ea0fc4b0d55410477580de484d92c9f45106629da0f52cca6d2309ae1c","observation_id":"ebf363cf-d460-4372-a342-40249683de7b","resolution":{"observed_at":"2026-08-04T17:10:42.861781Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03004","last_updated":"2019-09-06T16:40:42Z","snapshot_observed_at":"2026-07-06T08:19:45.897686Z","submitted_at":"2019-09-06T16:40:42Z","title":"Show Your Work: Improved Reporting of Experimental Results","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.03004","snapshot_observed_at":"2026-08-04T17:10:42.853196Z","title":"Show your work: Improved reporting of experimental results,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.11068","last_updated":"2025-09-14T03:30:06Z","snapshot_observed_at":"2026-08-09T21:37:17.772444Z","submitted_at":"2025-09-14T03:30:06Z","title":"Tractable Asymmetric Verification for Large Language Models via Deterministic Replicability","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-04T17:10:42.853196Z"},"links":{"cited_paper":"/paper/1909.03004","citing_paper":"/paper/2509.11068"},"observation_digest":"sha256:1f5dd139c8507d1f68235a4ff92c12b34b137814b2c8e86ce0e5440d8f19fdfc","observation_id":"152be9ee-f342-47bb-bd7b-5fd2015c7daf","resolution":{"observed_at":"2026-08-04T17:10:42.853196Z","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-04T17:10:42.762956Z","title":"Available: http://dx.doi.org/10.1145/3571730","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.11068","last_updated":"2025-09-14T03:30:06Z","snapshot_observed_at":"2026-08-09T21:37:17.772444Z","submitted_at":"2025-09-14T03:30:06Z","title":"Tractable Asymmetric Verification for Large Language Models via Deterministic Replicability","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-04T17:10:42.762956Z"},"links":{"citing_paper":"/paper/2509.11068"},"observation_digest":"sha256:acf1bc4864f06ea08a321ee673b49ee06c43e13858644eb299dd19dd7256073a","observation_id":"42b77a96-dfb5-45db-a256-1f22aa013fb9","resolution":{"observed_at":"2026-08-04T17:10:42.762956Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.03254","last_updated":"2025-07-04T02:20:19Z","snapshot_observed_at":"2026-08-09T12:28:10.149601Z","submitted_at":"2025-07-04T02:20:19Z","title":"CodeAgents: A Token-Efficient Framework for Codified Multi-Agent Reasoning in LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.03254","snapshot_observed_at":"2026-08-04T17:10:42.830886Z","title":"Available: https://arxiv.org/abs/2507.03254","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.11068","last_updated":"2025-09-14T03:30:06Z","snapshot_observed_at":"2026-08-09T21:37:17.772444Z","submitted_at":"2025-09-14T03:30:06Z","title":"Tractable Asymmetric Verification for Large Language Models via Deterministic Replicability","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-04T17:10:42.830886Z"},"links":{"cited_paper":"/paper/2507.03254","citing_paper":"/paper/2509.11068"},"observation_digest":"sha256:46cc0dec9d9de3016140974150e3d577f80a7d6dcfc0f49c7570d02f885432ea","observation_id":"ff148a5c-9452-4b79-baf6-64b459be45ff","resolution":{"observed_at":"2026-08-04T17:10:42.830886Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2509.11068","last_updated":"2025-09-14T03:30:06Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-09T21:37:17.772444Z","submitted_at":"2025-09-14T03:30:06Z","title":"Tractable Asymmetric Verification for Large Language Models via Deterministic Replicability"},"reference_resolution":{"displayed":31,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":31,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":31},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 1 inbound Pith citation observation for arXiv:2509.11068."}