{"as_of":"2026-08-21T12:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:06e6fe086c1480d630ed17906fdb4374a851fc38f09069d852c492a77979c41a","coverage":[{"denominator":29,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":29,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-26T07:19:13.967789Z","state":"measured"},{"denominator":30,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":30,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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-08-04T15:12:55.515166Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2606.22783","last_updated":"2026-06-22T02:45:01Z","snapshot_observed_at":"2026-08-12T15:22:38.339039Z","submitted_at":"2026-06-22T02:45:01Z","title":"Breaking the Evaluation Paradox: Evaluating High-Entropy Search with Computationally Irreducible Constraints","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2606.22783","snapshot_observed_at":"2026-08-04T15:12:55.515166Z","title":"2026 , archivePrefix =","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.02097","last_updated":"2026-08-03T11:58:21Z","snapshot_observed_at":"2026-08-15T22:59:26.336051Z","submitted_at":"2026-08-03T11:58:21Z","title":"Fetch-then-Explore: Decoupling Selection from Extraction over a Persistent Workspace for Search Agents","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-04T15:12:55.515166Z"},"links":{"cited_paper":"/paper/2606.22783","citing_paper":"/paper/2608.02097"},"observation_digest":"sha256:6f6e6b826fda6476e51a18b5976582bf42721b9c4c4dba03b3306f27b29e4073","observation_id":"4946ee55-6725-4475-ad09-daf9ba3619e3","resolution":{"observed_at":"2026-08-04T15:12:55.515166Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2606.22783/citation-record","integrity":"/paper/2606.22783/integrity","json":"/paper/2606.22783/citation-record.json","paper":"/paper/2606.22783"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2307.13854","last_updated":"2024-04-16T15:13:18Z","snapshot_observed_at":"2026-08-14T11:14:55.351653Z","submitted_at":"2023-07-25T22:59:32Z","title":"WebArena: A Realistic Web Environment for Building Autonomous Agents","version":4},"cited_work":{"arxiv_id":"2307.13854","doi":"10.48550/arxiv.2307.13854","metadata_source":"pith","pith_arxiv_id":"2307.13854","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"WebArena: A Realistic Web Environment for Building Autonomous Agents","venue":"cs.AI","work_id":"7058ffd2-a339-4102-89eb-248eeb074652","year":2023},"citing_paper":{"arxiv_id":"2606.22783","last_updated":"2026-06-22T02:45:01Z","snapshot_observed_at":"2026-08-12T15:22:38.339039Z","submitted_at":"2026-06-22T02:45:01Z","title":"Breaking the Evaluation Paradox: Evaluating High-Entropy Search with Computationally Irreducible Constraints","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-26T07:19:13.967789Z"},"links":{"cited_paper":"/paper/2307.13854","citing_paper":"/paper/2606.22783"},"observation_digest":"sha256:5f25b23f83ba38df4ae360118bb86385c3021624c2c05fc606a7a6ebd0eac9d3","observation_id":"e7e8be5a-c875-4922-9a68-041691bec209","resolution":{"observed_at":"2026-07-04T11:59:51.611749Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-15T07:08:14.424698+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-15T07:08:14.424698+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-21T06:32:16.066871+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-06-26T07:19:13.967789Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.22783","last_updated":"2026-06-22T02:45:01Z","snapshot_observed_at":"2026-08-12T15:22:38.339039Z","submitted_at":"2026-06-22T02:45:01Z","title":"Breaking the Evaluation Paradox: Evaluating High-Entropy Search with Computationally Irreducible Constraints","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-26T07:19:13.967789Z"},"links":{"citing_paper":"/paper/2606.22783"},"observation_digest":"sha256:e39479f8737ef8cd353a2db2cc9c1bbde6b3351bcd479d2255b5020f026eb15f","observation_id":"891ab4b4-d0c3-4979-bec8-1b5a4656eab3","resolution":{"observed_at":"2026-06-26T07:19:13.967789Z","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-06-26T07:19:13.967789Z","title":"List All","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.22783","last_updated":"2026-06-22T02:45:01Z","snapshot_observed_at":"2026-08-12T15:22:38.339039Z","submitted_at":"2026-06-22T02:45:01Z","title":"Breaking the Evaluation Paradox: Evaluating High-Entropy Search with Computationally Irreducible Constraints","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-26T07:19:13.967789Z"},"links":{"citing_paper":"/paper/2606.22783"},"observation_digest":"sha256:7eedb097c4af82ddb47b41d6364686a637775bf2c066cc437d86c7919ebe5983","observation_id":"79d1d10b-4c88-48a8-ae67-2c5d6bfe094f","resolution":{"observed_at":"2026-06-26T07:19:13.967789Z","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-06-26T07:19:13.967789Z","title":"2.Face the Ambiguity: Ambiguity = List All","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.22783","last_updated":"2026-06-22T02:45:01Z","snapshot_observed_at":"2026-08-12T15:22:38.339039Z","submitted_at":"2026-06-22T02:45:01Z","title":"Breaking the Evaluation Paradox: Evaluating High-Entropy Search with Computationally Irreducible Constraints","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-26T07:19:13.967789Z"},"links":{"citing_paper":"/paper/2606.22783"},"observation_digest":"sha256:f2d1eb553f835b8341951ddf2879fc2c5ce1f75029b30d259761f4e233b7881e","observation_id":"61d63c36-a37c-40f9-acec-9d4a32b2d31f","resolution":{"observed_at":"2026-06-26T07:19:13.967789Z","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-06-26T07:19:13.967789Z","title":"draining the ocean","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.22783","last_updated":"2026-06-22T02:45:01Z","snapshot_observed_at":"2026-08-12T15:22:38.339039Z","submitted_at":"2026-06-22T02:45:01Z","title":"Breaking the Evaluation Paradox: Evaluating High-Entropy Search with Computationally Irreducible Constraints","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-26T07:19:13.967789Z"},"links":{"citing_paper":"/paper/2606.22783"},"observation_digest":"sha256:f8febfd9e98604500dac27dba2d3ce7cee03ff735c5fa80e133668f7449aa6dc","observation_id":"a43b0d42-1fe4-461a-9056-49530e466d6e","resolution":{"observed_at":"2026-06-26T07:19:13.967789Z","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-06-26T07:19:13.967789Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.22783","last_updated":"2026-06-22T02:45:01Z","snapshot_observed_at":"2026-08-12T15:22:38.339039Z","submitted_at":"2026-06-22T02:45:01Z","title":"Breaking the Evaluation Paradox: Evaluating High-Entropy Search with Computationally Irreducible Constraints","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-26T07:19:13.967789Z"},"links":{"citing_paper":"/paper/2606.22783"},"observation_digest":"sha256:fe9de6a3a760ab318f0041602c97a6ca199434b38b34f8bfa063218b78fcc897","observation_id":"33b53e8e-dda8-4755-9720-6d999d19f189","resolution":{"observed_at":"2026-06-26T07:19:13.967789Z","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-06-26T07:19:13.967789Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.22783","last_updated":"2026-06-22T02:45:01Z","snapshot_observed_at":"2026-08-12T15:22:38.339039Z","submitted_at":"2026-06-22T02:45:01Z","title":"Breaking the Evaluation Paradox: Evaluating High-Entropy Search with Computationally Irreducible Constraints","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-26T07:19:13.967789Z"},"links":{"citing_paper":"/paper/2606.22783"},"observation_digest":"sha256:e1b95ad1d6935b0030b0c7854bfced3ad4ac912ffa3280837dff08ca1ec5ca81","observation_id":"1f053422-0cb5-45dc-896d-33eebca0c631","resolution":{"observed_at":"2026-06-26T07:19:13.967789Z","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-06-26T07:19:13.967789Z","title":"KAF”. One song’s first lyric line has MD5 hash: 50acc167e1b2296034ef447b86027f77. Output as “SongName→FirstLine","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.22783","last_updated":"2026-06-22T02:45:01Z","snapshot_observed_at":"2026-08-12T15:22:38.339039Z","submitted_at":"2026-06-22T02:45:01Z","title":"Breaking the Evaluation Paradox: Evaluating High-Entropy Search with Computationally Irreducible Constraints","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-26T07:19:13.967789Z"},"links":{"citing_paper":"/paper/2606.22783"},"observation_digest":"sha256:3f7f3bd4ceceb695e4f3eadd0571b1bd34d56af2202e718814a8ae3e9c084256","observation_id":"11afcd57-a75d-4485-9657-5bd6ff9c7aba","resolution":{"observed_at":"2026-06-26T07:19:13.967789Z","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-06-26T07:19:13.967789Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.22783","last_updated":"2026-06-22T02:45:01Z","snapshot_observed_at":"2026-08-12T15:22:38.339039Z","submitted_at":"2026-06-22T02:45:01Z","title":"Breaking the Evaluation Paradox: Evaluating High-Entropy Search with Computationally Irreducible Constraints","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-26T07:19:13.967789Z"},"links":{"citing_paper":"/paper/2606.22783"},"observation_digest":"sha256:8c55ba019eb6e4d1c7f2055fcb4620e6d0ed7df2a48914bed1f543ea326bb0d4","observation_id":"1f41e39b-5ab3-41af-b3eb-947c48fdb86a","resolution":{"observed_at":"2026-06-26T07:19:13.967789Z","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-06-26T07:19:13.967789Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.22783","last_updated":"2026-06-22T02:45:01Z","snapshot_observed_at":"2026-08-12T15:22:38.339039Z","submitted_at":"2026-06-22T02:45:01Z","title":"Breaking the Evaluation Paradox: Evaluating High-Entropy Search with Computationally Irreducible Constraints","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-26T07:19:13.967789Z"},"links":{"citing_paper":"/paper/2606.22783"},"observation_digest":"sha256:fec5e7c27fb63b00f98fe47ce30cb553126f0d8a1a39a7c053df7644a07d5ac5","observation_id":"8acfc803-b835-41be-b52b-afdba60247be","resolution":{"observed_at":"2026-06-26T07:19:13.967789Z","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-06-26T07:19:13.967789Z","title":"anti-shortcut","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.22783","last_updated":"2026-06-22T02:45:01Z","snapshot_observed_at":"2026-08-12T15:22:38.339039Z","submitted_at":"2026-06-22T02:45:01Z","title":"Breaking the Evaluation Paradox: Evaluating High-Entropy Search with Computationally Irreducible Constraints","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-26T07:19:13.967789Z"},"links":{"citing_paper":"/paper/2606.22783"},"observation_digest":"sha256:3c0b86ddc54351060278f16789f98e597404017e5f82fcbe04ce58126810809a","observation_id":"76e875c2-c581-4c77-b247-bfcf3ebe053c","resolution":{"observed_at":"2026-06-26T07:19:13.967789Z","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-06-26T07:19:13.967789Z","title":"The standard deviation of success rates was below 3% across all conditions, confirming measurement stability","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.22783","last_updated":"2026-06-22T02:45:01Z","snapshot_observed_at":"2026-08-12T15:22:38.339039Z","submitted_at":"2026-06-22T02:45:01Z","title":"Breaking the Evaluation Paradox: Evaluating High-Entropy Search with Computationally Irreducible Constraints","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-26T07:19:13.967789Z"},"links":{"citing_paper":"/paper/2606.22783"},"observation_digest":"sha256:d6c5be2838c04429b687f618a27a0884e93acb4ebf1aac352a6fbd6eaea98182","observation_id":"b46212d3-542e-4560-a486-c10a59cf4b3b","resolution":{"observed_at":"2026-06-26T07:19:13.967789Z","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-06-26T07:19:13.967789Z","title":"The convergence pattern re- mained consistent across all domain variants","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.22783","last_updated":"2026-06-22T02:45:01Z","snapshot_observed_at":"2026-08-12T15:22:38.339039Z","submitted_at":"2026-06-22T02:45:01Z","title":"Breaking the Evaluation Paradox: Evaluating High-Entropy Search with Computationally Irreducible Constraints","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-26T07:19:13.967789Z"},"links":{"citing_paper":"/paper/2606.22783"},"observation_digest":"sha256:f35d7a59ba4ecd3f8acb52515c15d7b88c44cf48a09f92c5f43b3c28ba40cabc","observation_id":"44f1e70b-353c-45c8-ade8-c106401ae718","resolution":{"observed_at":"2026-06-26T07:19:13.967789Z","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-06-26T07:19:13.967789Z","title":"While absolute success rates varied by ±5%, the convergence patternto a common baseline was preserved","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.22783","last_updated":"2026-06-22T02:45:01Z","snapshot_observed_at":"2026-08-12T15:22:38.339039Z","submitted_at":"2026-06-22T02:45:01Z","title":"Breaking the Evaluation Paradox: Evaluating High-Entropy Search with Computationally Irreducible Constraints","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-26T07:19:13.967789Z"},"links":{"citing_paper":"/paper/2606.22783"},"observation_digest":"sha256:21197c05657cd00c2a20ab121df38b5aa28cfb65ceaa02bb034ddad2d0e8144e","observation_id":"e43ee16b-afeb-4e37-8459-c8567e79ad27","resolution":{"observed_at":"2026-06-26T07:19:13.967789Z","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-06-26T07:19:13.967789Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.22783","last_updated":"2026-06-22T02:45:01Z","snapshot_observed_at":"2026-08-12T15:22:38.339039Z","submitted_at":"2026-06-22T02:45:01Z","title":"Breaking the Evaluation Paradox: Evaluating High-Entropy Search with Computationally Irreducible Constraints","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-26T07:19:13.967789Z"},"links":{"citing_paper":"/paper/2606.22783"},"observation_digest":"sha256:90482c59aa66c21463b9bcab19f401267790ffa1cbfc86a7fcd2a63ca0e73445","observation_id":"d6f812ad-e20c-4333-8632-b4c8fc7d7d39","resolution":{"observed_at":"2026-06-26T07:19:13.967789Z","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-06-26T07:19:13.967789Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.22783","last_updated":"2026-06-22T02:45:01Z","snapshot_observed_at":"2026-08-12T15:22:38.339039Z","submitted_at":"2026-06-22T02:45:01Z","title":"Breaking the Evaluation Paradox: Evaluating High-Entropy Search with Computationally Irreducible Constraints","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-26T07:19:13.967789Z"},"links":{"citing_paper":"/paper/2606.22783"},"observation_digest":"sha256:b4d2ba35f95b3c01a807b4f886ab34e13d6edd469803bbb7b83a52650449414e","observation_id":"cac6dfec-2f72-4d4e-81b3-25b8cf8c78d5","resolution":{"observed_at":"2026-06-26T07:19:13.967789Z","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-06-26T07:19:13.967789Z","title":"draining the ocean","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.22783","last_updated":"2026-06-22T02:45:01Z","snapshot_observed_at":"2026-08-12T15:22:38.339039Z","submitted_at":"2026-06-22T02:45:01Z","title":"Breaking the Evaluation Paradox: Evaluating High-Entropy Search with Computationally Irreducible Constraints","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-26T07:19:13.967789Z"},"links":{"citing_paper":"/paper/2606.22783"},"observation_digest":"sha256:bc83c399c622f2cab2518221a3f98e887ac19368f63b90be3442762fe8b51b18","observation_id":"593b2055-846a-4a62-b201-a18fbf0fa822","resolution":{"observed_at":"2026-06-26T07:19:13.967789Z","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-06-26T07:19:13.967789Z","title":"It must gather all necessary data, perform the search, and verify the hash within a single, self-contained code block","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.22783","last_updated":"2026-06-22T02:45:01Z","snapshot_observed_at":"2026-08-12T15:22:38.339039Z","submitted_at":"2026-06-22T02:45:01Z","title":"Breaking the Evaluation Paradox: Evaluating High-Entropy Search with Computationally Irreducible Constraints","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-26T07:19:13.967789Z"},"links":{"citing_paper":"/paper/2606.22783"},"observation_digest":"sha256:dbecb3614b3513da3bba2753d249dd7f22d63c673a3ac09cf8b6abafd5d3431e","observation_id":"f34e9469-bf87-486e-a958-09cf762ec71b","resolution":{"observed_at":"2026-06-26T07:19:13.967789Z","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-06-26T07:19:13.967789Z","title":"Tool execution limit reached. You must now provide your final answer based on the data you have already collected","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.22783","last_updated":"2026-06-22T02:45:01Z","snapshot_observed_at":"2026-08-12T15:22:38.339039Z","submitted_at":"2026-06-22T02:45:01Z","title":"Breaking the Evaluation Paradox: Evaluating High-Entropy Search with Computationally Irreducible Constraints","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-26T07:19:13.967789Z"},"links":{"citing_paper":"/paper/2606.22783"},"observation_digest":"sha256:51d47dc4d077cecfc0b89a6e5d089500dc6e377cf63bd0485a5910d83500a2c3","observation_id":"17134a53-d89b-4641-8477-42449086548f","resolution":{"observed_at":"2026-06-26T07:19:13.967789Z","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-06-26T07:19:13.967789Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.22783","last_updated":"2026-06-22T02:45:01Z","snapshot_observed_at":"2026-08-12T15:22:38.339039Z","submitted_at":"2026-06-22T02:45:01Z","title":"Breaking the Evaluation Paradox: Evaluating High-Entropy Search with Computationally Irreducible Constraints","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-26T07:19:13.967789Z"},"links":{"citing_paper":"/paper/2606.22783"},"observation_digest":"sha256:133f9004dea8c071d03e08e1206b3e85c0d6ed3155c9da4f5340288d6d74e238","observation_id":"32dd1b4b-a509-4935-82ee-0fe7cf51b76f","resolution":{"observed_at":"2026-06-26T07:19:13.967789Z","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-06-26T07:19:13.967789Z","title":"boosting","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.22783","last_updated":"2026-06-22T02:45:01Z","snapshot_observed_at":"2026-08-12T15:22:38.339039Z","submitted_at":"2026-06-22T02:45:01Z","title":"Breaking the Evaluation Paradox: Evaluating High-Entropy Search with Computationally Irreducible Constraints","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-26T07:19:13.967789Z"},"links":{"citing_paper":"/paper/2606.22783"},"observation_digest":"sha256:f973f91ce3fcd164d7d736a11928308e28d4e499eed068ce87278a1c36c7e848","observation_id":"3aa0249c-178d-44c6-a1a8-52e9960d81d7","resolution":{"observed_at":"2026-06-26T07:19:13.967789Z","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-06-26T07:19:13.967789Z","title":"title\":","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.22783","last_updated":"2026-06-22T02:45:01Z","snapshot_observed_at":"2026-08-12T15:22:38.339039Z","submitted_at":"2026-06-22T02:45:01Z","title":"Breaking the Evaluation Paradox: Evaluating High-Entropy Search with Computationally Irreducible Constraints","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-26T07:19:13.967789Z"},"links":{"citing_paper":"/paper/2606.22783"},"observation_digest":"sha256:9347b2a7722c5c5d0bfcae1e89cb6f18601809140f3d69c40b4f421f03d63178","observation_id":"c59491dd-7c04-45bd-9714-384f30ae19db","resolution":{"observed_at":"2026-06-26T07:19:13.967789Z","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-06-26T07:19:13.967789Z","title":"title\":","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.22783","last_updated":"2026-06-22T02:45:01Z","snapshot_observed_at":"2026-08-12T15:22:38.339039Z","submitted_at":"2026-06-22T02:45:01Z","title":"Breaking the Evaluation Paradox: Evaluating High-Entropy Search with Computationally Irreducible Constraints","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-26T07:19:13.967789Z"},"links":{"citing_paper":"/paper/2606.22783"},"observation_digest":"sha256:e1b085ba64b1d8d089121c3501e1e9ea9c145a7576c562f8f851193380f83407","observation_id":"4e8e2e6b-99de-4415-8155-21e902725834","resolution":{"observed_at":"2026-06-26T07:19:13.967789Z","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-06-26T07:19:13.967789Z","title":"title\":","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.22783","last_updated":"2026-06-22T02:45:01Z","snapshot_observed_at":"2026-08-12T15:22:38.339039Z","submitted_at":"2026-06-22T02:45:01Z","title":"Breaking the Evaluation Paradox: Evaluating High-Entropy Search with Computationally Irreducible Constraints","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-26T07:19:13.967789Z"},"links":{"citing_paper":"/paper/2606.22783"},"observation_digest":"sha256:75027188c51502734c2dcf323603934a1ca9d77ffe7b304346253ce8038d6de8","observation_id":"d3cdc663-573d-4cf7-9102-a50bffead4ff","resolution":{"observed_at":"2026-06-26T07:19:13.967789Z","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-06-26T07:19:13.967789Z","title":"title\":","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.22783","last_updated":"2026-06-22T02:45:01Z","snapshot_observed_at":"2026-08-12T15:22:38.339039Z","submitted_at":"2026-06-22T02:45:01Z","title":"Breaking the Evaluation Paradox: Evaluating High-Entropy Search with Computationally Irreducible Constraints","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-26T07:19:13.967789Z"},"links":{"citing_paper":"/paper/2606.22783"},"observation_digest":"sha256:aab4eae3cdac51f0f66fd942df0b7d25026f0ca02c14262ff9ec0653e27cf63e","observation_id":"1e9652fb-4c27-42c5-b22e-1d0f240c27f3","resolution":{"observed_at":"2026-06-26T07:19:13.967789Z","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-06-26T07:19:13.967789Z","title":"title\":","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.22783","last_updated":"2026-06-22T02:45:01Z","snapshot_observed_at":"2026-08-12T15:22:38.339039Z","submitted_at":"2026-06-22T02:45:01Z","title":"Breaking the Evaluation Paradox: Evaluating High-Entropy Search with Computationally Irreducible Constraints","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-26T07:19:13.967789Z"},"links":{"citing_paper":"/paper/2606.22783"},"observation_digest":"sha256:c5f0fa0c4f087725b2238866fe8ca7de0c1bf3f4261840038c27f00489d1c844","observation_id":"406beba1-f8b9-4951-bad8-f62b7c604536","resolution":{"observed_at":"2026-06-26T07:19:13.967789Z","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-06-26T07:19:13.967789Z","title":"title\":","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.22783","last_updated":"2026-06-22T02:45:01Z","snapshot_observed_at":"2026-08-12T15:22:38.339039Z","submitted_at":"2026-06-22T02:45:01Z","title":"Breaking the Evaluation Paradox: Evaluating High-Entropy Search with Computationally Irreducible Constraints","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-26T07:19:13.967789Z"},"links":{"citing_paper":"/paper/2606.22783"},"observation_digest":"sha256:fddb10f31e2b435576e5892fd196bf77834f5e8cb6e79aff079df8947b39d5d4","observation_id":"d1989e95-d21e-4fb0-b81a-977bd83ceb8c","resolution":{"observed_at":"2026-06-26T07:19:13.967789Z","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-06-26T07:19:13.967789Z","title":"title\":","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.22783","last_updated":"2026-06-22T02:45:01Z","snapshot_observed_at":"2026-08-12T15:22:38.339039Z","submitted_at":"2026-06-22T02:45:01Z","title":"Breaking the Evaluation Paradox: Evaluating High-Entropy Search with Computationally Irreducible Constraints","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-26T07:19:13.967789Z"},"links":{"citing_paper":"/paper/2606.22783"},"observation_digest":"sha256:4f74d585cf3d6c930cac770b411766f968ffa2aec8069086c920ddb2b6553c90","observation_id":"2030be6b-5e30-4fdd-8e02-7170f7d43bd4","resolution":{"observed_at":"2026-06-26T07:19:13.967789Z","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":"exec/2025122","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-04T11:59:51.613070Z","title":"goal\":\"Retrieve the most popular repositories among Google users and their star counts","venue":null,"work_id":"48ead4cc-7d5e-42ee-99e6-e834021e0482","year":null},"citing_paper":{"arxiv_id":"2606.22783","last_updated":"2026-06-22T02:45:01Z","snapshot_observed_at":"2026-08-12T15:22:38.339039Z","submitted_at":"2026-06-22T02:45:01Z","title":"Breaking the Evaluation Paradox: Evaluating High-Entropy Search with Computationally Irreducible Constraints","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-26T07:19:13.967789Z"},"links":{"citing_paper":"/paper/2606.22783"},"observation_digest":"sha256:8d498905fe38b20eb21ac93e7424e47d75714866bb30d89643ef1914d87be413","observation_id":"fcbd7651-292f-45f7-bbd4-aed9ca73f3bf","resolution":{"observed_at":"2026-07-04T11:59:51.615587Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2606.22783","last_updated":"2026-06-22T02:45:01Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-12T15:22:38.339039Z","submitted_at":"2026-06-22T02:45:01Z","title":"Breaking the Evaluation Paradox: Evaluating High-Entropy Search with Computationally Irreducible Constraints"},"reference_resolution":{"displayed":29,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":27,"verified_exact":2,"verified_fuzzy":0},"total_outbound_references":29},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 1 inbound Pith citation observation for arXiv:2606.22783."}