{"as_of":"2026-08-07T19:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0e990692d996ab118dd39a4e604ccfb09a2fcb2b0db641ce4f6610ec64d99f80","coverage":[{"denominator":37,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":37,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T04:26:30.896248Z","state":"measured"},{"denominator":37,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":37,"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/2506.10716/citation-record","integrity":"/paper/2506.10716/integrity","json":"/paper/2506.10716/citation-record.json","paper":"/paper/2506.10716"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:26:27.572743Z","title":"Aytes, Jinheon Baek, and Sung Ju Hwang","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.10716","last_updated":"2025-06-12T14:05:09Z","snapshot_observed_at":"2026-08-07T04:17:21.211925Z","submitted_at":"2025-06-12T14:05:09Z","title":"PREMISE: Scalable and Strategic Prompt Optimization for Efficient Mathematical Reasoning in Large Models","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T04:26:27.572743Z"},"links":{"citing_paper":"/paper/2506.10716"},"observation_digest":"sha256:04fd66ca02b3895e895a568cc8f7c2e6cd2ace7f5c4ad85b219afc770e6dde71","observation_id":"ca0c7fd6-ec41-4ac0-a1e9-9adcea586282","resolution":{"observed_at":"2026-08-07T04:26:27.572743Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.13546","last_updated":"2025-05-19T03:28:33Z","snapshot_observed_at":"2026-08-07T15:43:31.385274Z","submitted_at":"2025-05-19T03:28:33Z","title":"Prompt Stability Matters: Evaluating and Optimizing Auto-Generated Prompt in General-Purpose Systems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.13546","snapshot_observed_at":"2026-08-07T04:26:27.695830Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.10716","last_updated":"2025-06-12T14:05:09Z","snapshot_observed_at":"2026-08-07T04:17:21.211925Z","submitted_at":"2025-06-12T14:05:09Z","title":"PREMISE: Scalable and Strategic Prompt Optimization for Efficient Mathematical Reasoning in Large Models","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T04:26:27.695830Z"},"links":{"cited_paper":"/paper/2505.13546","citing_paper":"/paper/2506.10716"},"observation_digest":"sha256:f1f6c0ab5e425376a6fc968f34558ea46462742b4918669bf4ab037cadac4f37","observation_id":"b4f2e7ee-463c-497a-b3a0-43119574eb64","resolution":{"observed_at":"2026-08-07T04:26:27.695830Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2107.03374","last_updated":"2021-07-14T17:16:02Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2021-07-07T17:41:24Z","title":"Evaluating Large Language Models Trained on Code","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.03374","snapshot_observed_at":"2026-08-07T04:26:27.818159Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.10716","last_updated":"2025-06-12T14:05:09Z","snapshot_observed_at":"2026-08-07T04:17:21.211925Z","submitted_at":"2025-06-12T14:05:09Z","title":"PREMISE: Scalable and Strategic Prompt Optimization for Efficient Mathematical Reasoning in Large Models","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T04:26:27.818159Z"},"links":{"cited_paper":"/paper/2107.03374","citing_paper":"/paper/2506.10716"},"observation_digest":"sha256:aeb740d2a8ca6e702c2c146517142686f41355a617531b150b9b707281109e4d","observation_id":"c4776fbe-2ff3-4169-920e-7143ccbfcde9","resolution":{"observed_at":"2026-08-07T04:26:27.818159Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.21187","last_updated":"2025-02-01T07:57:37Z","snapshot_observed_at":"2026-08-01T16:43:44.704797Z","submitted_at":"2024-12-30T18:55:12Z","title":"Do NOT Think That Much for 2+3=? On the Overthinking of o1-Like LLMs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.21187","snapshot_observed_at":"2026-08-07T04:26:27.939310Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10716","last_updated":"2025-06-12T14:05:09Z","snapshot_observed_at":"2026-08-07T04:17:21.211925Z","submitted_at":"2025-06-12T14:05:09Z","title":"PREMISE: Scalable and Strategic Prompt Optimization for Efficient Mathematical Reasoning in Large Models","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T04:26:27.939310Z"},"links":{"cited_paper":"/paper/2412.21187","citing_paper":"/paper/2506.10716"},"observation_digest":"sha256:7c2c92d68ca7f6b02ad9b0fd326e39d5f2d1a77780cc8c44aa6587af00670db3","observation_id":"226aea30-cdf4-4639-a646-57ac8e4c16c6","resolution":{"observed_at":"2026-08-07T04:26:27.939310Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.13171","last_updated":"2024-12-17T18:50:33Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-17T18:50:33Z","title":"Compressed Chain of Thought: Efficient Reasoning Through Dense Representations","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.13171","snapshot_observed_at":"2026-08-07T04:26:28.055856Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10716","last_updated":"2025-06-12T14:05:09Z","snapshot_observed_at":"2026-08-07T04:17:21.211925Z","submitted_at":"2025-06-12T14:05:09Z","title":"PREMISE: Scalable and Strategic Prompt Optimization for Efficient Mathematical Reasoning in Large Models","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T04:26:28.055856Z"},"links":{"cited_paper":"/paper/2412.13171","citing_paper":"/paper/2506.10716"},"observation_digest":"sha256:40e1610d6cdc712bced0fcd63a1ab286000a39b741ae27239147be8239d5ef4f","observation_id":"4d395cae-8351-4fc6-a854-b6950bb95253","resolution":{"observed_at":"2026-08-07T04:26:28.055856Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14168","last_updated":"2021-11-18T00:23:45Z","snapshot_observed_at":"2026-08-07T01:45:38.840969Z","submitted_at":"2021-10-27T04:49:45Z","title":"Training Verifiers to Solve Math Word Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.14168","snapshot_observed_at":"2026-08-07T04:26:28.275333Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.10716","last_updated":"2025-06-12T14:05:09Z","snapshot_observed_at":"2026-08-07T04:17:21.211925Z","submitted_at":"2025-06-12T14:05:09Z","title":"PREMISE: Scalable and Strategic Prompt Optimization for Efficient Mathematical Reasoning in Large Models","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T04:26:28.275333Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2506.10716"},"observation_digest":"sha256:080e6351a379164c2c6a0df7980422069d2e47bc52d88fdcf3663d5646ae3c63","observation_id":"20e4ec3a-90f0-4ae7-8e27-33f257591c77","resolution":{"observed_at":"2026-08-07T04:26:28.275333Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:26:32.150795Z","title":null,"venue":null,"work_id":"c2659308-30f1-414d-92e7-0b833709b05a","year":2025},"citing_paper":{"arxiv_id":"2506.10716","last_updated":"2025-06-12T14:05:09Z","snapshot_observed_at":"2026-08-07T04:17:21.211925Z","submitted_at":"2025-06-12T14:05:09Z","title":"PREMISE: Scalable and Strategic Prompt Optimization for Efficient Mathematical Reasoning in Large Models","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T04:26:28.346923Z"},"links":{"citing_paper":"/paper/2506.10716"},"observation_digest":"sha256:615263afe2ca93b81699ae238a1b93589bc3c2ce9b26e03604d095060fc24ddd","observation_id":"c9866fe5-25d8-426a-b5b8-7936728df74d","resolution":{"observed_at":"2026-08-07T04:26:32.292025Z","resolver_source":"raw_fallback","status":"unresolved"},"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":{"arxiv_id":"2502.16235","last_updated":"2025-02-27T06:39:06Z","snapshot_observed_at":"2026-08-07T17:56:27.359357Z","submitted_at":"2025-02-22T14:13:37Z","title":"Dynamic Parallel Tree Search for Efficient LLM Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.16235","snapshot_observed_at":"2026-08-07T04:26:28.407702Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.10716","last_updated":"2025-06-12T14:05:09Z","snapshot_observed_at":"2026-08-07T04:17:21.211925Z","submitted_at":"2025-06-12T14:05:09Z","title":"PREMISE: Scalable and Strategic Prompt Optimization for Efficient Mathematical Reasoning in Large Models","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T04:26:28.407702Z"},"links":{"cited_paper":"/paper/2502.16235","citing_paper":"/paper/2506.10716"},"observation_digest":"sha256:6ca6fe7973aad1e99af502bdbfb44c1f130fbf735bb10455ec4c6ce29096f79f","observation_id":"8836c54a-ce19-4ed0-99dd-33f3f64ef00b","resolution":{"observed_at":"2026-08-07T04:26:28.407702Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.20993","last_updated":"2025-05-27T16:41:53Z","snapshot_observed_at":"2026-07-06T20:14:40.579474Z","submitted_at":"2024-12-30T14:57:53Z","title":"Efficiently Scaling LLM Reasoning with Certaindex","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.20993","snapshot_observed_at":"2026-08-07T04:26:28.457364Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10716","last_updated":"2025-06-12T14:05:09Z","snapshot_observed_at":"2026-08-07T04:17:21.211925Z","submitted_at":"2025-06-12T14:05:09Z","title":"PREMISE: Scalable and Strategic Prompt Optimization for Efficient Mathematical Reasoning in Large Models","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T04:26:28.457364Z"},"links":{"cited_paper":"/paper/2412.20993","citing_paper":"/paper/2506.10716"},"observation_digest":"sha256:cefa4d99f5c2e2f32c5ea097903f9521225575e0bf0b2f6366d6157cdea914d2","observation_id":"96088a5a-5855-46d9-a528-57ad1580d18d","resolution":{"observed_at":"2026-08-07T04:26:28.457364Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-07-06T18:55:11.576666Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-07T04:26:28.544789Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10716","last_updated":"2025-06-12T14:05:09Z","snapshot_observed_at":"2026-08-07T04:17:21.211925Z","submitted_at":"2025-06-12T14:05:09Z","title":"PREMISE: Scalable and Strategic Prompt Optimization for Efficient Mathematical Reasoning in Large Models","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T04:26:28.544789Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2506.10716"},"observation_digest":"sha256:9ee67d3a75cdf876ee8ad74102a53714a8e21fe836f4ac68d477d8fad5b6ddb3","observation_id":"96e258f8-6bdf-4cd0-aa85-89613acad44a","resolution":{"observed_at":"2026-08-07T04:26:28.544789Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12948","last_updated":"2026-01-04T03:57:36Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-01-22T15:19:35Z","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12948","snapshot_observed_at":"2026-08-07T04:26:28.570310Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.10716","last_updated":"2025-06-12T14:05:09Z","snapshot_observed_at":"2026-08-07T04:17:21.211925Z","submitted_at":"2025-06-12T14:05:09Z","title":"PREMISE: Scalable and Strategic Prompt Optimization for Efficient Mathematical Reasoning in Large Models","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T04:26:28.570310Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2506.10716"},"observation_digest":"sha256:b7c3c61478ca641e0696ea3df5e790adec591c304e5d1b9a04bb0a8afb2c059e","observation_id":"837ba166-9c70-46b9-b244-9388831f2e14","resolution":{"observed_at":"2026-08-07T04:26:28.570310Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.18547","last_updated":"2025-06-02T00:44:09Z","snapshot_observed_at":"2026-08-07T19:18:10.858896Z","submitted_at":"2024-12-24T16:55:45Z","title":"Token-Budget-Aware LLM Reasoning","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.18547","snapshot_observed_at":"2026-08-07T04:26:28.679257Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10716","last_updated":"2025-06-12T14:05:09Z","snapshot_observed_at":"2026-08-07T04:17:21.211925Z","submitted_at":"2025-06-12T14:05:09Z","title":"PREMISE: Scalable and Strategic Prompt Optimization for Efficient Mathematical Reasoning in Large Models","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T04:26:28.679257Z"},"links":{"cited_paper":"/paper/2412.18547","citing_paper":"/paper/2506.10716"},"observation_digest":"sha256:297a302d4ae404c3ac46fee5cf9fbb90cef66f337702b5a4a71cc90729a26bae","observation_id":"35e40b06-a5d3-4890-b711-a2ac6db06e81","resolution":{"observed_at":"2026-08-07T04:26:28.679257Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.06769","last_updated":"2025-11-03T00:53:34Z","snapshot_observed_at":"2026-08-07T06:05:27.895209Z","submitted_at":"2024-12-09T18:55:56Z","title":"Training Large Language Models to Reason in a Continuous Latent Space","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.06769","snapshot_observed_at":"2026-08-07T04:26:28.752507Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10716","last_updated":"2025-06-12T14:05:09Z","snapshot_observed_at":"2026-08-07T04:17:21.211925Z","submitted_at":"2025-06-12T14:05:09Z","title":"PREMISE: Scalable and Strategic Prompt Optimization for Efficient Mathematical Reasoning in Large Models","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T04:26:28.752507Z"},"links":{"cited_paper":"/paper/2412.06769","citing_paper":"/paper/2506.10716"},"observation_digest":"sha256:24b6b4bf5f7c3545ade7d4e3c275ff0a85f1863fd30af00bbb1bf88cfad93783","observation_id":"ae87aaeb-8f3f-41c9-9cb2-f788a0858e5e","resolution":{"observed_at":"2026-08-07T04:26:28.752507Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:26:31.891316Z","title":null,"venue":null,"work_id":"9a5e0b3c-457e-4451-90d7-cf4ab3ba663b","year":2021},"citing_paper":{"arxiv_id":"2506.10716","last_updated":"2025-06-12T14:05:09Z","snapshot_observed_at":"2026-08-07T04:17:21.211925Z","submitted_at":"2025-06-12T14:05:09Z","title":"PREMISE: Scalable and Strategic Prompt Optimization for Efficient Mathematical Reasoning in Large Models","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T04:26:28.901039Z"},"links":{"citing_paper":"/paper/2506.10716"},"observation_digest":"sha256:fc8c78f4eb434ada911fa398c37365e1469e42527b1837966a70d5cd936c57d8","observation_id":"ebfac549-5e78-4e28-829b-8925b58a3e4b","resolution":{"observed_at":"2026-08-07T04:26:31.972986Z","resolver_source":"raw_fallback","status":"unresolved"},"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":{"arxiv_id":"2412.11664","last_updated":"2024-12-16T11:12:45Z","snapshot_observed_at":"2026-07-06T20:07:41.462631Z","submitted_at":"2024-12-16T11:12:45Z","title":"C3oT: Generating Shorter Chain-of-Thought without Compromising Effectiveness","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.11664","snapshot_observed_at":"2026-08-07T04:26:28.984752Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10716","last_updated":"2025-06-12T14:05:09Z","snapshot_observed_at":"2026-08-07T04:17:21.211925Z","submitted_at":"2025-06-12T14:05:09Z","title":"PREMISE: Scalable and Strategic Prompt Optimization for Efficient Mathematical Reasoning in Large Models","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T04:26:28.984752Z"},"links":{"cited_paper":"/paper/2412.11664","citing_paper":"/paper/2506.10716"},"observation_digest":"sha256:24e3874abf6ac99d45973767e6fc5a5786edfdb5ca439387249030f99fc4710a","observation_id":"fe9e2b7b-cbf7-4136-bdce-8b1ab49fd203","resolution":{"observed_at":"2026-08-07T04:26:28.984752Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.01141","last_updated":"2025-04-01T00:41:36Z","snapshot_observed_at":"2026-08-07T17:34:59.382893Z","submitted_at":"2025-03-03T03:48:20Z","title":"How Well do LLMs Compress Their Own Chain-of-Thought? A Token Complexity Approach","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.01141","snapshot_observed_at":"2026-08-07T04:26:29.051959Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.10716","last_updated":"2025-06-12T14:05:09Z","snapshot_observed_at":"2026-08-07T04:17:21.211925Z","submitted_at":"2025-06-12T14:05:09Z","title":"PREMISE: Scalable and Strategic Prompt Optimization for Efficient Mathematical Reasoning in Large Models","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T04:26:29.051959Z"},"links":{"cited_paper":"/paper/2503.01141","citing_paper":"/paper/2506.10716"},"observation_digest":"sha256:c3438c82a8a2f5154b21f5fa171eb80e9022d01d3ab9d044c5e728d29b695336","observation_id":"c7667202-731f-4a95-8a9c-6945d5bf36b0","resolution":{"observed_at":"2026-08-07T04:26:29.051959Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.19324","last_updated":"2025-06-26T03:14:46Z","snapshot_observed_at":"2026-07-06T20:29:07.258163Z","submitted_at":"2025-01-31T17:19:57Z","title":"Reward-Guided Speculative Decoding for Efficient LLM Reasoning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.19324","snapshot_observed_at":"2026-08-07T04:26:29.108342Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.10716","last_updated":"2025-06-12T14:05:09Z","snapshot_observed_at":"2026-08-07T04:17:21.211925Z","submitted_at":"2025-06-12T14:05:09Z","title":"PREMISE: Scalable and Strategic Prompt Optimization for Efficient Mathematical Reasoning in Large Models","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T04:26:29.108342Z"},"links":{"cited_paper":"/paper/2501.19324","citing_paper":"/paper/2506.10716"},"observation_digest":"sha256:cc4f65049696c44c481092d415d63d4f2049513fc966825d2c968a45370ecdb6","observation_id":"388b0d75-619c-4211-984d-b25b88b294e2","resolution":{"observed_at":"2026-08-07T04:26:29.108342Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:26:31.687420Z","title":null,"venue":null,"work_id":"c7b3e057-422c-485e-baff-dd3da2a364b7","year":2024},"citing_paper":{"arxiv_id":"2506.10716","last_updated":"2025-06-12T14:05:09Z","snapshot_observed_at":"2026-08-07T04:17:21.211925Z","submitted_at":"2025-06-12T14:05:09Z","title":"PREMISE: Scalable and Strategic Prompt Optimization for Efficient Mathematical Reasoning in Large Models","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T04:26:29.172183Z"},"links":{"citing_paper":"/paper/2506.10716"},"observation_digest":"sha256:631a0a90ae8519b579b283011750b9fcfb3a47df33d955c7f1557487d512cee9","observation_id":"e0271799-7d97-4312-80cb-f996da2528e3","resolution":{"observed_at":"2026-08-07T04:26:31.780138Z","resolver_source":"raw_fallback","status":"unresolved"},"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":{"arxiv_id":"2411.01855","last_updated":"2024-11-04T07:10:24Z","snapshot_observed_at":"2026-08-01T16:42:29.985049Z","submitted_at":"2024-11-04T07:10:24Z","title":"Can Language Models Learn to Skip Steps?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.01855","snapshot_observed_at":"2026-08-07T04:26:29.251219Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10716","last_updated":"2025-06-12T14:05:09Z","snapshot_observed_at":"2026-08-07T04:17:21.211925Z","submitted_at":"2025-06-12T14:05:09Z","title":"PREMISE: Scalable and Strategic Prompt Optimization for Efficient Mathematical Reasoning in Large Models","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T04:26:29.251219Z"},"links":{"cited_paper":"/paper/2411.01855","citing_paper":"/paper/2506.10716"},"observation_digest":"sha256:2f8740b29e39f6715a379760c06d6acdc5f2c3c371304e7f9d9e6ec8c06e10dc","observation_id":"84f35551-7b7f-4572-a1a8-9b642c4b643f","resolution":{"observed_at":"2026-08-07T04:26:29.251219Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.20122","last_updated":"2025-06-10T10:54:28Z","snapshot_observed_at":"2026-08-07T17:42:49.612783Z","submitted_at":"2025-02-27T14:14:50Z","title":"Self-Training Elicits Concise Reasoning in Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.20122","snapshot_observed_at":"2026-08-07T04:26:29.326145Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.10716","last_updated":"2025-06-12T14:05:09Z","snapshot_observed_at":"2026-08-07T04:17:21.211925Z","submitted_at":"2025-06-12T14:05:09Z","title":"PREMISE: Scalable and Strategic Prompt Optimization for Efficient Mathematical Reasoning in Large Models","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T04:26:29.326145Z"},"links":{"cited_paper":"/paper/2502.20122","citing_paper":"/paper/2506.10716"},"observation_digest":"sha256:36c2b6721241789a9399f5a28c57a087df801d1c158865970361e760cac98d02","observation_id":"97baf1fe-46c0-46c5-b0e7-d6940a123a4d","resolution":{"observed_at":"2026-08-07T04:26:29.326145Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:26:31.593208Z","title":"Learning to reason with llms","venue":null,"work_id":"345da31f-fbb7-490a-83ca-8d5fcaf0e20b","year":2025},"citing_paper":{"arxiv_id":"2506.10716","last_updated":"2025-06-12T14:05:09Z","snapshot_observed_at":"2026-08-07T04:17:21.211925Z","submitted_at":"2025-06-12T14:05:09Z","title":"PREMISE: Scalable and Strategic Prompt Optimization for Efficient Mathematical Reasoning in Large Models","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T04:26:29.416260Z"},"links":{"citing_paper":"/paper/2506.10716"},"observation_digest":"sha256:74e1ef078f557d32daa6f4d5467238e0644d57ad67016b803f1cf5ac83c381e5","observation_id":"186c83c2-88cd-4f3e-a8da-2a21e8cc8036","resolution":{"observed_at":"2026-08-07T04:26:31.653779Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":{"arxiv_id":"2103.07191","last_updated":"2021-04-15T06:11:12Z","snapshot_observed_at":"2026-08-07T13:11:17.300265Z","submitted_at":"2021-03-12T10:23:47Z","title":"Are NLP Models really able to Solve Simple Math Word Problems?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.07191","snapshot_observed_at":"2026-08-07T04:26:29.499764Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.10716","last_updated":"2025-06-12T14:05:09Z","snapshot_observed_at":"2026-08-07T04:17:21.211925Z","submitted_at":"2025-06-12T14:05:09Z","title":"PREMISE: Scalable and Strategic Prompt Optimization for Efficient Mathematical Reasoning in Large Models","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T04:26:29.499764Z"},"links":{"cited_paper":"/paper/2103.07191","citing_paper":"/paper/2506.10716"},"observation_digest":"sha256:342effb710f3e16ff149621c8ebb9c9b209348a8754b62677079ad51faf81387","observation_id":"4a01aba9-6f64-4f2b-a165-8b23b804d317","resolution":{"observed_at":"2026-08-07T04:26:29.499764Z","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-07T04:26:29.587028Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10716","last_updated":"2025-06-12T14:05:09Z","snapshot_observed_at":"2026-08-07T04:17:21.211925Z","submitted_at":"2025-06-12T14:05:09Z","title":"PREMISE: Scalable and Strategic Prompt Optimization for Efficient Mathematical Reasoning in Large Models","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T04:26:29.587028Z"},"links":{"citing_paper":"/paper/2506.10716"},"observation_digest":"sha256:36aa26efa9bd76517d6968686c0768622bf7c2ea00a863af1175d735a5c440c9","observation_id":"534b5a64-93ca-4ef6-b537-8e85e152e89c","resolution":{"observed_at":"2026-08-07T04:26:29.587028Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.21074","last_updated":"2025-09-23T08:16:08Z","snapshot_observed_at":"2026-08-07T17:46:47.440455Z","submitted_at":"2025-02-28T14:07:48Z","title":"CODI: Compressing Chain-of-Thought into Continuous Space via Self-Distillation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.21074","snapshot_observed_at":"2026-08-07T04:26:29.664052Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.10716","last_updated":"2025-06-12T14:05:09Z","snapshot_observed_at":"2026-08-07T04:17:21.211925Z","submitted_at":"2025-06-12T14:05:09Z","title":"PREMISE: Scalable and Strategic Prompt Optimization for Efficient Mathematical Reasoning in Large Models","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T04:26:29.664052Z"},"links":{"cited_paper":"/paper/2502.21074","citing_paper":"/paper/2506.10716"},"observation_digest":"sha256:257db50309822b30e48c5b637dda4f90300aee1f5c671405195e2ced3614f092","observation_id":"c6f95a1b-3883-4552-a47a-7e42be374d1e","resolution":{"observed_at":"2026-08-07T04:26:29.664052Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.03275","last_updated":"2025-09-01T18:25:38Z","snapshot_observed_at":"2026-08-05T08:32:48.445809Z","submitted_at":"2025-02-05T15:33:00Z","title":"Token Assorted: Mixing Latent and Text Tokens for Improved Language Model Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.03275","snapshot_observed_at":"2026-08-07T04:26:29.762250Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.10716","last_updated":"2025-06-12T14:05:09Z","snapshot_observed_at":"2026-08-07T04:17:21.211925Z","submitted_at":"2025-06-12T14:05:09Z","title":"PREMISE: Scalable and Strategic Prompt Optimization for Efficient Mathematical Reasoning in Large Models","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T04:26:29.762250Z"},"links":{"cited_paper":"/paper/2502.03275","citing_paper":"/paper/2506.10716"},"observation_digest":"sha256:7b2c22202740700cf588d3885b426eb5e3c255919cc8ff52222dfa3f6a26653b","observation_id":"0f847f77-a876-43b6-ae93-0b7bc9c5534f","resolution":{"observed_at":"2026-08-07T04:26:29.762250Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.20290","last_updated":"2024-10-31T18:27:13Z","snapshot_observed_at":"2026-08-03T23:26:49.562857Z","submitted_at":"2024-10-26T23:20:48Z","title":"Fast Best-of-N Decoding via Speculative Rejection","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.20290","snapshot_observed_at":"2026-08-07T04:26:29.877898Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10716","last_updated":"2025-06-12T14:05:09Z","snapshot_observed_at":"2026-08-07T04:17:21.211925Z","submitted_at":"2025-06-12T14:05:09Z","title":"PREMISE: Scalable and Strategic Prompt Optimization for Efficient Mathematical Reasoning in Large Models","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T04:26:29.877898Z"},"links":{"cited_paper":"/paper/2410.20290","citing_paper":"/paper/2506.10716"},"observation_digest":"sha256:40943b7bb33b065c90785a2b89bd2559c8ac35fb2c6eafecbab4ab2eed98f442","observation_id":"5234b3e7-42b4-4f5c-a954-1b31b1d23a88","resolution":{"observed_at":"2026-08-07T04:26:29.877898Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.13971","last_updated":"2023-02-27T17:11:15Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-02-27T17:11:15Z","title":"LLaMA: Open and Efficient Foundation Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.13971","snapshot_observed_at":"2026-08-07T04:26:29.979176Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.10716","last_updated":"2025-06-12T14:05:09Z","snapshot_observed_at":"2026-08-07T04:17:21.211925Z","submitted_at":"2025-06-12T14:05:09Z","title":"PREMISE: Scalable and Strategic Prompt Optimization for Efficient Mathematical Reasoning in Large Models","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T04:26:29.979176Z"},"links":{"cited_paper":"/paper/2302.13971","citing_paper":"/paper/2506.10716"},"observation_digest":"sha256:dc4ec6b7ffd0b2846812984bfc33e09c5514be24b4d35b3b93d1ac3642dde216","observation_id":"e6ed2f4a-3c5c-4a87-b7e0-71320f865a82","resolution":{"observed_at":"2026-08-07T04:26:29.979176Z","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-07T04:26:30.073168Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.10716","last_updated":"2025-06-12T14:05:09Z","snapshot_observed_at":"2026-08-07T04:17:21.211925Z","submitted_at":"2025-06-12T14:05:09Z","title":"PREMISE: Scalable and Strategic Prompt Optimization for Efficient Mathematical Reasoning in Large Models","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T04:26:30.073168Z"},"links":{"citing_paper":"/paper/2506.10716"},"observation_digest":"sha256:ee5a70386a1bcc79e126efb24d3c3a2852b9b453e4d112c73c7642b0d328ab01","observation_id":"aac6e281-3ed1-40be-ac37-d636018db556","resolution":{"observed_at":"2026-08-07T04:26:30.073168Z","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-07T04:26:30.150371Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.10716","last_updated":"2025-06-12T14:05:09Z","snapshot_observed_at":"2026-08-07T04:17:21.211925Z","submitted_at":"2025-06-12T14:05:09Z","title":"PREMISE: Scalable and Strategic Prompt Optimization for Efficient Mathematical Reasoning in Large Models","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T04:26:30.150371Z"},"links":{"citing_paper":"/paper/2506.10716"},"observation_digest":"sha256:a6ffb1c23c1efa0c6fd62479ba1c81b46980a537bd58f94ebe7cb36389a48fd4","observation_id":"2e4a173f-81b9-456e-b54e-87e55d1c43fb","resolution":{"observed_at":"2026-08-07T04:26:30.150371Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.09686","last_updated":"2025-01-23T08:44:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-01-16T17:37:58Z","title":"Towards Large Reasoning Models: A Survey of Reinforced Reasoning with Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.09686","snapshot_observed_at":"2026-08-07T04:26:30.240320Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.10716","last_updated":"2025-06-12T14:05:09Z","snapshot_observed_at":"2026-08-07T04:17:21.211925Z","submitted_at":"2025-06-12T14:05:09Z","title":"PREMISE: Scalable and Strategic Prompt Optimization for Efficient Mathematical Reasoning in Large Models","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T04:26:30.240320Z"},"links":{"cited_paper":"/paper/2501.09686","citing_paper":"/paper/2506.10716"},"observation_digest":"sha256:8f165360b41b4ca6b59fab651f1774adde16f520445025a1e22bd53b11b384d5","observation_id":"ae34fecc-db5c-447e-b99f-829ed19fdc91","resolution":{"observed_at":"2026-08-07T04:26:30.240320Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18600","last_updated":"2025-03-03T17:08:21Z","snapshot_observed_at":"2026-08-07T17:49:06.764625Z","submitted_at":"2025-02-25T19:36:06Z","title":"Chain of Draft: Thinking Faster by Writing Less","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.18600","snapshot_observed_at":"2026-08-07T04:26:30.303721Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.10716","last_updated":"2025-06-12T14:05:09Z","snapshot_observed_at":"2026-08-07T04:17:21.211925Z","submitted_at":"2025-06-12T14:05:09Z","title":"PREMISE: Scalable and Strategic Prompt Optimization for Efficient Mathematical Reasoning in Large Models","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T04:26:30.303721Z"},"links":{"cited_paper":"/paper/2502.18600","citing_paper":"/paper/2506.10716"},"observation_digest":"sha256:dbca0b8b0eb133e0e1c1cd0951e6e8948564faa6f3414cb3dc41ae9eaf0111ef","observation_id":"3ed2221f-823e-4377-8833-94df6a4bbae9","resolution":{"observed_at":"2026-08-07T04:26:30.303721Z","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-07T04:26:30.438882Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.10716","last_updated":"2025-06-12T14:05:09Z","snapshot_observed_at":"2026-08-07T04:17:21.211925Z","submitted_at":"2025-06-12T14:05:09Z","title":"PREMISE: Scalable and Strategic Prompt Optimization for Efficient Mathematical Reasoning in Large Models","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T04:26:30.438882Z"},"links":{"citing_paper":"/paper/2506.10716"},"observation_digest":"sha256:4a6bf0ffbb3449f71b27efdaf7fea823cb094c3871c1801065524779b23726fa","observation_id":"2aed1962-5f5b-42dc-b93d-a89d6c4d6de4","resolution":{"observed_at":"2026-08-07T04:26:30.438882Z","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-07T04:26:30.541521Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.10716","last_updated":"2025-06-12T14:05:09Z","snapshot_observed_at":"2026-08-07T04:17:21.211925Z","submitted_at":"2025-06-12T14:05:09Z","title":"PREMISE: Scalable and Strategic Prompt Optimization for Efficient Mathematical Reasoning in Large Models","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T04:26:30.541521Z"},"links":{"citing_paper":"/paper/2506.10716"},"observation_digest":"sha256:aacdda3ec413419ea779874ef0378bba2db7fef17b6a6f39b9bb6658646f3e34","observation_id":"a2bbe5b9-b69e-40a1-8f74-cdba9e86fae9","resolution":{"observed_at":"2026-08-07T04:26:30.541521Z","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-07T04:26:30.659645Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.10716","last_updated":"2025-06-12T14:05:09Z","snapshot_observed_at":"2026-08-07T04:17:21.211925Z","submitted_at":"2025-06-12T14:05:09Z","title":"PREMISE: Scalable and Strategic Prompt Optimization for Efficient Mathematical Reasoning in Large Models","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T04:26:30.659645Z"},"links":{"citing_paper":"/paper/2506.10716"},"observation_digest":"sha256:742f706447e4f38ff3fd6f72bc300f843f0c011090a1b3a00e55e8d9e78b3645","observation_id":"649d8805-b4b4-46df-8b73-19fd270e7956","resolution":{"observed_at":"2026-08-07T04:26:30.659645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.03092","last_updated":"2025-06-18T04:06:03Z","snapshot_observed_at":"2026-08-05T13:27:52.801293Z","submitted_at":"2024-12-04T07:44:35Z","title":"REVOLVE: Optimizing AI Systems by Tracking Response Evolution in Textual Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.03092","snapshot_observed_at":"2026-08-07T04:26:30.706921Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10716","last_updated":"2025-06-12T14:05:09Z","snapshot_observed_at":"2026-08-07T04:17:21.211925Z","submitted_at":"2025-06-12T14:05:09Z","title":"PREMISE: Scalable and Strategic Prompt Optimization for Efficient Mathematical Reasoning in Large Models","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T04:26:30.706921Z"},"links":{"cited_paper":"/paper/2412.03092","citing_paper":"/paper/2506.10716"},"observation_digest":"sha256:c670873f005197f8e76a11e45063639eb65242e90d61d885b6409ba4bf0894c6","observation_id":"8ceaadcd-ca06-4cbc-88d0-db7db19fd77a","resolution":{"observed_at":"2026-08-07T04:26:30.706921Z","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-07T04:26:30.824765Z","title":"online\" 'onlinestring :=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.10716","last_updated":"2025-06-12T14:05:09Z","snapshot_observed_at":"2026-08-07T04:17:21.211925Z","submitted_at":"2025-06-12T14:05:09Z","title":"PREMISE: Scalable and Strategic Prompt Optimization for Efficient Mathematical Reasoning in Large Models","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T04:26:30.824765Z"},"links":{"citing_paper":"/paper/2506.10716"},"observation_digest":"sha256:87c3605967b0ba9654a3785b8f9b3e1e2b080a39a85963b8474315feed869893","observation_id":"3dd715c8-9b64-432f-a11a-9c5a2f3b0308","resolution":{"observed_at":"2026-08-07T04:26:30.824765Z","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-07T04:26:30.896248Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.10716","last_updated":"2025-06-12T14:05:09Z","snapshot_observed_at":"2026-08-07T04:17:21.211925Z","submitted_at":"2025-06-12T14:05:09Z","title":"PREMISE: Scalable and Strategic Prompt Optimization for Efficient Mathematical Reasoning in Large Models","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T04:26:30.896248Z"},"links":{"citing_paper":"/paper/2506.10716"},"observation_digest":"sha256:241420a30ad3054bdd565915fb4eab2eed72f6164bbe825502377fc75683ed69","observation_id":"f301fbcf-8cae-4baf-8b56-085b85dc7962","resolution":{"observed_at":"2026-08-07T04:26:30.896248Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.10716","last_updated":"2025-06-12T14:05:09Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-07T04:17:21.211925Z","submitted_at":"2025-06-12T14:05:09Z","title":"PREMISE: Scalable and Strategic Prompt Optimization for Efficient Mathematical Reasoning in Large Models"},"reference_resolution":{"displayed":37,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":36,"verified_exact":0,"verified_fuzzy":1},"total_outbound_references":37},"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 37 of 37 outbound references and 0 inbound Pith citation observations for arXiv:2506.10716."}