{"as_of":"2026-08-17T00:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7e2ac0d41f19a3ccfcc57ee20df4cb611fa3b80ef8fc92a22e41c529d6f84a3e","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-16T06:30:59.297886+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-15T16:21:04.205867Z","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:e4e0ea878c6d8d592051aeab112aefd67ee8a1cbb0082811a2705952e4aed39f","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-16T23:06:48.475561Z","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-15T16:21:04.205867Z","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:98390b86274bba27aa20b9bca8f02fc19a941acf837ec16f48a501d7c12cb02f","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-08-08T11:58:24.516369Z","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-15T16:21:04.205867Z","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:64c9a1f9fbad9fca1203631e52658602f3e2fbdcafd2e134c2ecce2207441a91","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-15T16:21:04.205867Z","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:6e9ad4b7b4741bcb842d90ee4ecb6b48fbd3a754a50cfce669806685f6e9ea8b","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-08-13T23:47:35.674752Z","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-15T16:21:04.205867Z","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:33b9dcf046cf89a34a39f005e5fc5f42c13ae9aa7eeefc921c26fa854b8d5abe","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-14T02:43:01.480086Z","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-15T16:21:04.205867Z","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:6b2d69d068111f5da432beeca9901d95a1c72a8d89711e4de4ab6903d8833725","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-15T16:21:04.205867Z","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:9cc97a55e57aacf07a09153a874b4290a57fb30d30237fbcd4d30a547ce73f17","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T12:56:06.523688Z","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-15T16:21:04.205867Z","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:d928c23dcf8d476793ef8d79356d816ad2a05964fba5064f88ad9bb2fff8ca36","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-08-12T17:14:32.746931Z","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-15T16:21:04.205867Z","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:6c7f7b391e3b04d6ec1dad282aa5eecb9fec43757e157343d257956376ed05e9","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-08-13T17:20:44.002518Z","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-15T16:21:04.205867Z","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:788870fa435d6f22311171649458c5ef1d191cf59a83caefcb8c75bbe9745357","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-08-15T12:33:55.451951Z","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-15T16:21:04.205867Z","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:8049ac320c4f29b8246a2b07b67597606ddfc4190b26df76bfbbb0e2da085bea","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-16T12:59:58.216334Z","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-15T16:21:04.205867Z","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:af681c838e39632447bdb00fa101eee29e3b6236ee02061f876a590c0a8a57ba","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-15T20:23:25.637230Z","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-15T16:21:04.205867Z","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:2017a5f5ff37ae2e372268af41970e4fe6d6fb3e671564e9afcd57008f5c8b4a","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-15T16:21:04.205867Z","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:0872b96b2458a571137089bede7ff0b5a94a44e120eb7f42c7ae5abcb7cbee74","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-13T21:39:06.494517Z","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-15T16:21:04.205867Z","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:0bf2118a9bff1c21c167c0b9db4f94b65bc2a8ddc79ad2076ef1cabf1aa37518","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-16T12:53:45.512783Z","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-15T16:21:04.205867Z","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:0254ff3c92d75f2b9f71a79551582f72861d245869d6f88e3d3c6bfb24bca9b3","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-08-15T22:53:02.775053Z","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-15T16:21:04.205867Z","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:259eafea9bddcf0bc69dcee3366ed5703b8a3a257c1c26cb9a2df3f3f84f3ae0","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-15T16:21:04.205867Z","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:a8a70e5ddb4c06637389346dfcbac3e08defd91a9660501fd9b06d012c15697a","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T13:03:17.765860Z","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-15T16:21:04.205867Z","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:eb970fcd369765ab6d827f22b32267c38af38f965ed520f3809e51c69e597dd5","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-16T12:54:38.383893Z","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-15T16:21:04.205867Z","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:fad06a9999fa6cc64816037ce449bcb1cb835971942519572fff48737e2b4f28","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-15T16:21:04.205867Z","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:bfb31d7dc0a9975c3fc334fd9b307ca4bf267436dcb56aeb913b6d0058153d31","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:21:04.205867Z","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:1890161bcafd829e55d528546b17e7c0965ebaf10e6ae3d66b91cd5f8ab033eb","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-15T16:21:04.205867Z","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:b91ec9d3c03c90240a3d9df83c26075257a9d17df3f7eaf2629ab068462e017f","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-15T16:21:04.205867Z","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:c169d5d35cd11d2e54fe56f8e80ed0f75143846dc2eb9a6a12a573139fc310a3","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-13T02:33:47.410604Z","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-15T16:21:04.205867Z","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:3402e5f27de6a0b6f02a24695080b429d5393eb33345ed9ba45e96f8da4a6acf","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-16T13:05:42.559964Z","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-15T16:21:04.205867Z","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:d2f424b70a20dce53b776d0debba9a381bf32fa87629ea7850ec88bb60f4aa61","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-15T16:21:04.205867Z","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:931f0ec002746afd9b3156dbaab87bc3dfee0219fe1fa0c40ba09bee578ca1c5","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-15T16:21:04.205867Z","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:b90725ebc4e7cf70d5a687c90879ba622e467d309cc5eb8c5eb0a1ccb08085b2","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-15T16:21:04.205867Z","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:3b2096b9c134cc63981f8e7f29017a6f69487bc88b3f4dc293aea4fddffed873","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-15T16:21:04.205867Z","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:67a66a4dc79bb9f39e418cbe4dcd2cfedc5aa634bdfc8789c8d5559e7640f13d","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-16T12:55:14.600973Z","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-15T16:21:04.205867Z","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:64c16fedd7ff71b919086689e0eed4d65c3d42b5bafe67abfbde5f131374ec2b","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-15T16:21:04.205867Z","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:26ea36f6bac70d452bcb7a4277bfa1515b38abdefb10fe488bdf7f84e8dcd9bb","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-15T16:21:04.205867Z","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:1e140ce87a73324804f8ea01e02b823695efa160dfcce8b48193e04066f94187","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-15T16:21:04.205867Z","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:278527cd0bb87bd6e3036114fa45f79aaa1049726aed89de9f467ee72b929929","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-17T00:13:06.766958Z","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-15T16:21:04.205867Z","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:5ca0e4a863169bf7ded02d4c5f491aebc740fe44d3ca4bb07a4335429b86540c","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-15T16:21:04.205867Z","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:1a58186fba4fd585ca5a334313a36ef2aa40afd7cd55acfe8dde4066c3ed1b38","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-15T16:21:04.205867Z","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:caf71c26a79f79106258b80dcb084078b6e949cbe962fdf3e6c0a8ae8082a4e5","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-15T16:21:04.205867Z","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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 0 inbound Pith citation observations for arXiv:2506.10716."}