{"as_of":"2026-08-07T17:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2d7c2263006a860144e64867587daf9bd7e7015add3ff6f53427c68e6f454b5f","coverage":[{"denominator":97,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":97,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T10:47:06.228762Z","state":"measured"},{"denominator":97,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":97,"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/2601.09097/citation-record","integrity":"/paper/2601.09097/integrity","json":"/paper/2601.09097/citation-record.json","paper":"/paper/2601.09097"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:46:57.607172Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T10:46:57.607172Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:05ae3c8f32d5c70b0ac743bb5be146bb5ac2ee681debb63d7a1f34f4a44f441e","observation_id":"f3433a4c-624c-42c8-9e32-17b4d34d9714","resolution":{"observed_at":"2026-08-03T10:46:57.607172Z","resolver_source":null,"status":"parse_uncertain"},"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-03T10:46:57.770715Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T10:46:57.770715Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:afac99108d4321581cfb6f38bb9f612444cd95f97b81f632a5e70a5b92b09fd1","observation_id":"2e96aae5-f05d-4ff5-8d13-9ed80699a78d","resolution":{"observed_at":"2026-08-03T10:46:57.770715Z","resolver_source":null,"status":"parse_uncertain"},"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-03T10:46:57.878861Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T10:46:57.878861Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:d757725c849316dba1b4f09abf8deb0be29b46369d1d1d63cc4aaeea16061ad1","observation_id":"41fb5e2d-f283-44b5-973a-303896e022ac","resolution":{"observed_at":"2026-08-03T10:46:57.878861Z","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-03T10:46:58.050795Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T10:46:58.050795Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:8b47b07c81a728a9252b0e071aa1e7755928a090791e150b03825c2a211b5d22","observation_id":"7a78a067-7266-45e4-933e-3ac0ad5b8f90","resolution":{"observed_at":"2026-08-03T10:46:58.050795Z","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-03T10:46:58.148745Z","title":"multiple vehicles are booked if capacity is exceeded","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T10:46:58.148745Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:fd95710dc07786275f73bb4aaad4002c6a6c7e39df587310f66a5ac405510efe","observation_id":"f9e73486-fbdb-4fc7-b830-9f744d930537","resolution":{"observed_at":"2026-08-03T10:46:58.148745Z","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-03T10:46:58.817001Z","title":"If the number of travelers ex- ceeds vehicle capacity, multiple vehicles of the same type are assumed to be booked","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T10:46:58.817001Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:19aa9032a1c7f260ab00f290004883cbd24b8278d93c5f1b8667cbe63f811a1a","observation_id":"3f19f54c-929d-4e2c-a3fc-fe5c79210a22","resolution":{"observed_at":"2026-08-03T10:46:58.817001Z","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-03T10:46:58.876934Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T10:46:58.876934Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:cddfd9c11eb585bc4fdd538db23dc2785261c0d860972ee0ad4cfb6a1af2003c","observation_id":"0a80ea6f-d66f-43ff-b678-63134505a0a6","resolution":{"observed_at":"2026-08-03T10:46:58.876934Z","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-03T10:46:58.271092Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T10:46:58.271092Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:755bc830358234c9c448c9431254a23260cf91be31b07d67542722b02cbd4a94","observation_id":"1bf3e2ba-c4d8-41c0-a4d5-1745c99e6099","resolution":{"observed_at":"2026-08-03T10:46:58.271092Z","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-03T10:46:58.376882Z","title":"The same accommodation must be used for two consecutive days within the city","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T10:46:58.376882Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:c757a8b075d3bb6d5faa8ea8e61ef6c415077400e5bbf5abfa1e36124a839f51","observation_id":"40ca49e4-a3b1-43b9-92bc-565810df678f","resolution":{"observed_at":"2026-08-03T10:46:58.376882Z","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-03T10:46:58.485024Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T10:46:58.485024Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:e166f687089e4eb7d508d7352541ffcd618006e78f4983b255ba53d882c68de2","observation_id":"ca7281d4-5014-406d-a34c-9885b2c70a95","resolution":{"observed_at":"2026-08-03T10:46:58.485024Z","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-03T10:46:58.544949Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T10:46:58.544949Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:a835d344544d348c5ec4a9b447f6fdfed2a006b32f1ec63c1627a5b4e03d7d9d","observation_id":"dc57bc7c-21c4-43b0-9e07-9e5093d21d46","resolution":{"observed_at":"2026-08-03T10:46:58.544949Z","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-03T10:46:58.653045Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T10:46:58.653045Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:87458e65b234cb321884c5b151c6dad54062bb124325d3eefc7c0331c8bc58e3","observation_id":"8b345374-20cd-45a9-94fd-1228ca52a5e4","resolution":{"observed_at":"2026-08-03T10:46:58.653045Z","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-03T10:46:58.971174Z","title":"B.3 Implementation Details of Baselines This section provides a high-level overview of the experimental setup used in evaluating SCOPE and baseline methods","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T10:46:58.971174Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:7ea1f7a68ccf4197fc140c1e127a08f9997b8ba93cbe7fbb9b31052ac1499028","observation_id":"f2cfd828-8d21-4926-a0d2-80c59c698500","resolution":{"observed_at":"2026-08-03T10:46:58.971174Z","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-03T10:46:59.048551Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T10:46:59.048551Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:597c8659e8e88ec65b98f2de22face6976d5db40179b5ab1f15c37ea0cd2d3cc","observation_id":"0a594d70-ad6d-4717-81c2-2edd9498a964","resolution":{"observed_at":"2026-08-03T10:46:59.048551Z","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-03T10:46:59.310922Z","title":"Nob Hill to Financial District: 9","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T10:46:59.310922Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:474f9ce157c164ed55e81468744cb26f535a4e8e6ca890dcc77078da38bc6908","observation_id":"8d458dd0-6b89-4944-8875-cf6ac850b0a7","resolution":{"observed_at":"2026-08-03T10:46:59.310922Z","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-03T10:46:59.497582Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T10:46:59.497582Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:172ceb4b598080a56d40cbe64cb866b1c72fe52689c5db5b4a016da8c96fcd18","observation_id":"cb0b83c1-2dbd-4f39-a21f-9132232a330f","resolution":{"observed_at":"2026-08-03T10:46:59.497582Z","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-03T10:46:59.168388Z","title":"The Castro to Chinatown: 20","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T10:46:59.168388Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:d4eb1d67bb2756ac0dcd775cfd0b352752565e844ccc4cce78fd0d00cc1afc8b","observation_id":"de11fb79-e04e-479e-9c58-fbe030033034","resolution":{"observed_at":"2026-08-03T10:46:59.168388Z","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-03T10:46:59.846142Z","title":"Financial District to Nob Hill: 8","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T10:46:59.846142Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:d89ec0fca02bf4a4bc00216f1878adbddb857f89579891aedf5fefd478854fbd","observation_id":"230a6f46-cb55-470f-92e4-650c50934c40","resolution":{"observed_at":"2026-08-03T10:46:59.846142Z","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-03T10:46:59.701816Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T10:46:59.701816Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:865d0b495f4bda4bf589f1b4632a9e0319757ed396484e0d2dd72d9aa4a5c67d","observation_id":"e518c785-a7d5-47ad-9f93-a71976ea4ba6","resolution":{"observed_at":"2026-08-03T10:46:59.701816Z","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-03T10:47:00.019050Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:00.019050Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:8533ca959c8817332d0eebd4bd7f87b9e7632d3680713ff7aa68d55917d394ec","observation_id":"ebd4f6b1-bba6-415e-85c6-edd8f9e7d5a4","resolution":{"observed_at":"2026-08-03T10:47:00.019050Z","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-03T10:47:00.229035Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:00.229035Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:f212baac3455b489a9751b94285e538492219bfe821977b0bdd040a3b6b187a8","observation_id":"a3922875-6a67-49b0-8cbe-53f8e801f0d3","resolution":{"observed_at":"2026-08-03T10:47:00.229035Z","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-03T10:47:00.395492Z","title":"combinations","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:00.395492Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:19705c8fa74c4f61a71663ea0287d4c5dd8552509203261350effc07ca20f5f5","observation_id":"7a7b6a0f-4b7a-43b8-b73c-45980e8a101d","resolution":{"observed_at":"2026-08-03T10:47:00.395492Z","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-03T10:47:00.527714Z","title":"combinations","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:00.527714Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:75db0b200965da07094eb29df8d9c878ee56051abcb672be4a3f52d9ac28ba52","observation_id":"593368c5-e484-43c2-8ff9-cf3f00bec062","resolution":{"observed_at":"2026-08-03T10:47:00.527714Z","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-03T10:47:00.614476Z","title":"combinations","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:00.614476Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:aa3b2668ddab6886c1e00755ab7e62479dc2518e2c1f87e87fba586cbeec2e95","observation_id":"7b291a45-8499-4d23-99c2-6cccd8882bf3","resolution":{"observed_at":"2026-08-03T10:47:00.614476Z","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-03T10:47:00.772781Z","title":"constraints","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:00.772781Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:61eed314be463abafed6400d3b403d1f5345878b20b501d160cd047f3ff54d9b","observation_id":"84a2cb61-c146-43c3-b367-92f5cff49f8f","resolution":{"observed_at":"2026-08-03T10:47:00.772781Z","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-03T10:47:01.020372Z","title":"combinations","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:01.020372Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:d68ee6b6428c0fd6b754be710b5b083375ebca4e6d31dcbc113682559d74e19b","observation_id":"60574850-f8e2-4f33-a700-a0e6146ede82","resolution":{"observed_at":"2026-08-03T10:47:01.020372Z","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-03T10:47:01.095276Z","title":"constraints","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:01.095276Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:467a1d011ac5db02412873980441af33c766105c53bcf9ed42a53e5e2e363c5c","observation_id":"b393d781-c8e7-48aa-ad82-97a3aa8a9ddd","resolution":{"observed_at":"2026-08-03T10:47:01.095276Z","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-03T10:47:01.179038Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:01.179038Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:62533333f87d32ba6abea2854528f3f1e6d803955c9e2f4bbcbc311b94fb0b33","observation_id":"06dba9e8-a6ef-4a4d-accf-ac701ea7a639","resolution":{"observed_at":"2026-08-03T10:47:01.179038Z","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-03T10:47:01.297489Z","title":"combinations","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:01.297489Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:0ad944a8c4035b3d535a8f8256f50dec8026a2c2d3c0c9244a1ad6ced859aced","observation_id":"2d920484-dab5-4d82-8a3f-58d12a27c9b2","resolution":{"observed_at":"2026-08-03T10:47:01.297489Z","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-03T10:47:01.375518Z","title":"We define the parameter with no discriminative power the constraint will either cause all plans to pass or fail","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:01.375518Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:b839339b34d711119f0bd348d308d792b9c1b9f7a95f2be8b58b060f0dbca922","observation_id":"458c248a-4a58-4c44-8558-698784aa7c12","resolution":{"observed_at":"2026-08-03T10:47:01.375518Z","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-03T10:47:01.457534Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:01.457534Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:d80af6733308dfeebf665c32bb9dfc6fbc204228075a22009c4b076a100832be","observation_id":"a5d91412-a7ef-494b-8649-9f4878d514be","resolution":{"observed_at":"2026-08-03T10:47:01.457534Z","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-03T10:47:01.542900Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:01.542900Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:9de893cb17f20eb03aefeb3384918846307a95b9e35e5ad26e73c9b34b291731","observation_id":"eef1b687-7d96-4ca7-9718-5f8e650db0e1","resolution":{"observed_at":"2026-08-03T10:47:01.542900Z","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-03T10:47:01.623019Z","title":"combinations","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:01.623019Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:eb776f4df9234f0e3a3c239b832b57f8130a370b9d9c74f20623ca2065dde3ef","observation_id":"f91977b6-8b5a-425c-a201-42ce5bdf5d67","resolution":{"observed_at":"2026-08-03T10:47:01.623019Z","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-03T10:47:01.706903Z","title":"<Mention if the parameter has/does not have discriminative power>","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:01.706903Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:0dc45262e8d801554d4df7da2927cfec321ef9f3c840b3f13c21e07ecb049868","observation_id":"5ec9c0c9-7441-43d9-8d29-9c8cc10aae4e","resolution":{"observed_at":"2026-08-03T10:47:01.706903Z","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-03T10:47:01.781855Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:01.781855Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:4627f75d54232e2f16e1d69b909b4661535c86b59dedb6b0f3f6b6b3abae44ce","observation_id":"6734f5e3-b095-42c2-898d-4af342054f83","resolution":{"observed_at":"2026-08-03T10:47:01.781855Z","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-03T10:47:01.837973Z","title":"Combination Function Generator Agent","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:01.837973Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:d04449425c563da33bdf6734eb8bcc5939f9a25e9ede1e184c86e8ebaa8b0699","observation_id":"d471404a-66f2-45af-aee1-e30cebc24260","resolution":{"observed_at":"2026-08-03T10:47:01.837973Z","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-03T10:47:01.892195Z","title":"constraints","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:01.892195Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:c417f7985b5c5adb105d890e1dd0af53d4c8c99df5f49d8d056bffd187277462","observation_id":"eaacaedb-002b-46bd-b7bf-b12651bae5f8","resolution":{"observed_at":"2026-08-03T10:47:01.892195Z","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-03T10:47:01.956267Z","title":"You must properly check if the same type of constraints exists for every item in the combination space","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:01.956267Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:0d53c7a864574cf4591ebc2b9df028e3b0734a511aac2164de75418a04db25cd","observation_id":"4d761a15-df2e-4a92-a10b-419a18ad5191","resolution":{"observed_at":"2026-08-03T10:47:01.956267Z","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-03T10:47:02.023914Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:02.023914Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:5f1c8db0f764ad7d2f252554510c5f9af6fa8970a4a2d985546be4d14cb73db7","observation_id":"5f9f5e30-7d0e-4e1e-aa04-1f0ed0f2bbad","resolution":{"observed_at":"2026-08-03T10:47:02.023914Z","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-03T10:47:02.077852Z","title":"combinations","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:02.077852Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:50045b56613162bad5491c58a0451a93ef980647724957062fec67b1d66213d7","observation_id":"263cc8f4-02d8-430d-b6f2-ed34c97bd3f6","resolution":{"observed_at":"2026-08-03T10:47:02.077852Z","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-03T10:47:02.136622Z","title":"combinations","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:02.136622Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:52e0630b4018385ae64c478c35530de0a4445f4489ebf3e7c7656379987e17f8","observation_id":"fb8ff1a6-ad03-41de-9176-642333095216","resolution":{"observed_at":"2026-08-03T10:47:02.136622Z","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-03T10:47:02.201850Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:02.201850Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:d5bfba65fcf0cdd2df1db9f9b19e9f8eb321417ff5b675a25146db8a45ce2134","observation_id":"f30113e7-1014-41d0-8183-8ebaa90a6aca","resolution":{"observed_at":"2026-08-03T10:47:02.201850Z","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-03T10:47:02.265891Z","title":"Combination Function Generator Agent","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:02.265891Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:efbc0e5a4ac383328a7e13cb438af00a8a9571b131ee13c715541cb961efa8c7","observation_id":"cd52cab0-acbc-4048-8ffc-62ef3f22bade","resolution":{"observed_at":"2026-08-03T10:47:02.265891Z","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-03T10:47:02.350086Z","title":"combinations","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:02.350086Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:2904c7ed911c611b49a14184d88e3ab2590e0f547dda67c5a9c1ff4eb8fec12a","observation_id":"904b09cc-e8e3-453d-a22a-0e137644a7e0","resolution":{"observed_at":"2026-08-03T10:47:02.350086Z","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-03T10:47:02.391004Z","title":"Hence, such parameter can be expanded","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:02.391004Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:af7ffb93d41d24407ace2feccde8fba36f974d91b268514364791a3c580d33c4","observation_id":"8c809a7b-a7d4-4202-b27b-f1b9dc6c26a3","resolution":{"observed_at":"2026-08-03T10:47:02.391004Z","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-03T10:47:02.443094Z","title":"combinations","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:02.443094Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:8d7d7872efb3685704e8e728aa0166f6561ffec2b1d3946adad2e496a59a2361","observation_id":"3e36260d-9039-4403-9395-ad826d095004","resolution":{"observed_at":"2026-08-03T10:47:02.443094Z","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-03T10:47:02.523612Z","title":"solutions","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:02.523612Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:6e4622be9a8abdb04f7d06f8e7549592d3e3ac7e698574e1ba936b0a3deb71bf","observation_id":"c8931cf4-3331-491e-8335-b2196ab5e893","resolution":{"observed_at":"2026-08-03T10:47:02.523612Z","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-03T10:47:02.580422Z","title":"You mention the difference in pattern in your CoT","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:02.580422Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:ae2d1b118c2fdb21e45b76e303a1542b524acce38cf03563357f8116a0ad5f43","observation_id":"8ff02919-cf08-4d12-a034-002cc41f1307","resolution":{"observed_at":"2026-08-03T10:47:02.580422Z","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-03T10:47:02.632875Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:02.632875Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:310a09217fbb562b7a8ecc1d70f87a8bf91763d50b8aab30743db97c914ebc4e","observation_id":"fd76736e-15b0-4500-b1f1-09f23821de96","resolution":{"observed_at":"2026-08-03T10:47:02.632875Z","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-03T10:47:02.800537Z","title":"plan_func()","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:02.800537Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:0e7e07a359046bf387748cab5068044aef46f2150f79d5cde5e259b3df0b96b0","observation_id":"324501f3-d7e5-4fcd-b2e5-e226acb9fb59","resolution":{"observed_at":"2026-08-03T10:47:02.800537Z","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-03T10:47:02.884440Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:02.884440Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:66428c51f216fff4670a00c6be32d02e777ca6af9fb1364e842c5c2521fc1568","observation_id":"ef2e17e8-e4c1-4d89-adb1-656f4954e020","resolution":{"observed_at":"2026-08-03T10:47:02.884440Z","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-03T10:47:02.965663Z","title":"Check whether is there possibility that each constraint can be handled differently that some plans can meet such constraints","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:02.965663Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:ef582e7775c242f8f6223e3954089f28f9e7ac1e0f637ef3a9db6a723e7ac90b","observation_id":"c32a2def-2569-4061-8f85-794af93bf838","resolution":{"observed_at":"2026-08-03T10:47:02.965663Z","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-03T10:47:03.022771Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:03.022771Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:c3f3a922935cbf2e4dfa379dec8242b947babe2c4af445ee7e79fdbc1bd6b2f9","observation_id":"6e60f263-984e-45e2-858b-a3240ab50652","resolution":{"observed_at":"2026-08-03T10:47:03.022771Z","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-03T10:47:03.076314Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:03.076314Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:4a428dc379df878f8dbb51a8a10eba4057b9b6a6db86f39aeb9ac81b8be544ae","observation_id":"a6d546f2-a9ea-48bb-a647-47793787148d","resolution":{"observed_at":"2026-08-03T10:47:03.076314Z","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-03T10:47:03.227717Z","title":"deliver_func()","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:03.227717Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:a7ceba348fc29f112546b22856c42f72dc491076a9515e8bbcdd6f5809c1a44d","observation_id":"e4a88c40-71ca-459d-a647-d45d604327b3","resolution":{"observed_at":"2026-08-03T10:47:03.227717Z","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-03T10:47:03.285284Z","title":"Does it contain any heading? What does the pattern of output look like?","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:03.285284Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:6c8013048f1691ea2e5161cac9fa0888a97fddcaeb47057a8ec205ee4ac0d086","observation_id":"3e79edb6-899f-4202-9865-141b27b37059","resolution":{"observed_at":"2026-08-03T10:47:03.285284Z","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-03T10:47:03.359100Z","title":"deliver_func()","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:03.359100Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:ef60eef9ddca211863c3f7f9b9ab9652dc8f7713eda5ba1ee3aa743887b1de65","observation_id":"68fa0517-22e7-4451-ad3d-af688940a986","resolution":{"observed_at":"2026-08-03T10:47:03.359100Z","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-03T10:47:03.393956Z","title":"You mention the difference in pattern in your CoT","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:03.393956Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:d6dbaa77d3274fcd335c7bc6f6e27a4f1fb37fd62d90a03e65bf8f8c7e150a23","observation_id":"d26795d8-a5a1-42db-ab87-487c70498dc6","resolution":{"observed_at":"2026-08-03T10:47:03.393956Z","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-03T10:47:03.439788Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:03.439788Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:abcd228def093855d61d065ca3a2816aa25eec25f2d49d742138ad07168f7123","observation_id":"dfac9bbe-0611-47bf-b3aa-ad2738d36457","resolution":{"observed_at":"2026-08-03T10:47:03.439788Z","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-03T10:47:03.482155Z","title":"Then, you made the corresponding correction on the agent's code","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:03.482155Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:71ba5cdc2ed3d9c692c064b1552c949b2cbf472e2aa85ac9c1ef83dabd4f335f","observation_id":"df47019b-779c-4810-ac45-11f3429d9748","resolution":{"observed_at":"2026-08-03T10:47:03.482155Z","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-03T10:47:03.529153Z","title":"next_step","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:03.529153Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:13973443ade506da4b0e880207436ff7bd74d684eaf200bdc3644300d0736033","observation_id":"d8c8d9e3-a6a1-4831-9788-dbb7e72cbf82","resolution":{"observed_at":"2026-08-03T10:47:03.529153Z","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-03T10:47:03.622454Z","title":"combinations","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:03.622454Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:ac7e8273eca59ddac1530d3419abf945ac4b3967b7efb41273012647d932e84b","observation_id":"204c0fd2-97b9-40e6-9405-181b2862a36f","resolution":{"observed_at":"2026-08-03T10:47:03.622454Z","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-03T10:47:03.756791Z","title":"The parameter has discriminative power","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:03.756791Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:8fb9b56f1c9a219820f60af95e847dfcd6db0c1e0f738fe27bd29ed4a1129d07","observation_id":"85514487-814f-49df-a1ae-3f28fa8a5902","resolution":{"observed_at":"2026-08-03T10:47:03.756791Z","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-03T10:47:03.907527Z","title":"The parameter does not have discriminative power","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:03.907527Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:a124648f3b85de8a7bd47a2147dec8fde5db76abcdbae5f9141c966f6a1ee26b","observation_id":"752a595d-7721-436c-a500-09e2471b39a8","resolution":{"observed_at":"2026-08-03T10:47:03.907527Z","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-03T10:47:04.015490Z","title":"The parameter has discriminative power","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:04.015490Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:8e9893ab4c0bb16d81dd26aa52c884c32e9bceef23bf74f1ff80c8ced59245eb","observation_id":"c9aad8fe-7b5d-429d-86b9-f5cb4ef23b36","resolution":{"observed_at":"2026-08-03T10:47:04.015490Z","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-03T10:47:04.115625Z","title":"The parameter has discriminative power","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:04.115625Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:af9adf07d1aef7d208705fc2aa03c9f6b190966fb5518bbb87d61d98f5dddc10","observation_id":"10d060c1-4598-461d-89bb-060992259851","resolution":{"observed_at":"2026-08-03T10:47:04.115625Z","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-03T10:47:04.267704Z","title":"combinations","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:04.267704Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:6a9f1bd3c7b6dfabb73e23e2896d539ced5dc46c0c68b8c5d96167172e0cc864","observation_id":"3e470ed0-de26-4e20-95b7-6f0b9725179b","resolution":{"observed_at":"2026-08-03T10:47:04.267704Z","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-03T10:47:04.381833Z","title":"This constraint exists for every city in the combination space","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:04.381833Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:2cd1502521fa9a7e1e4210e926ec335df4a243d02b30934709668988eb17bdaf","observation_id":"6e4ac397-1967-4a12-a62b-b8530c155c93","resolution":{"observed_at":"2026-08-03T10:47:04.381833Z","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-03T10:47:04.549519Z","title":"combinations","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:04.549519Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:99f9e93e6f638e9fbcb9305b7fb5d15b05c705de0a9c1e2f60f9f779df6565c9","observation_id":"7120e998-9b4f-40ae-b1ce-46bf17f3586a","resolution":{"observed_at":"2026-08-03T10:47:04.549519Z","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-03T10:47:05.188107Z","title":"combinations","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:05.188107Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:d8cdf26d3de520f95ac93827ebca77e60eb0be8225fdc9dcd5fadfeed735250d","observation_id":"9b804f39-7d7c-412a-a627-ae2068774cf8","resolution":{"observed_at":"2026-08-03T10:47:05.188107Z","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-03T10:47:05.300555Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:05.300555Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:1ae52cadb30b36c985252903e5adb424077cd6160e3e9577581a2964ac7dbae1","observation_id":"5c647c71-2f08-4115-b12b-eedfc72f2539","resolution":{"observed_at":"2026-08-03T10:47:05.300555Z","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-03T10:47:05.462010Z","title":"This will help us in determining valid paths","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:05.462010Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:f427e7de3a7fd4a844cf52174ac2a1ec5602b75648c0609fa622b9e1bd4e3129","observation_id":"8937ff08-6682-4a99-a29a-3807e609ee78","resolution":{"observed_at":"2026-08-03T10:47:05.462010Z","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-03T10:47:05.629824Z","title":"However, we need to ensure that each sequence is valid in terms of direct flights and total days","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:05.629824Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:b1a6469c90ca57491fe85bba0ec89e12190c4329f1f5d13358ea81eca1ddb3af","observation_id":"ec6529bb-b40a-4340-927a-1901b864073d","resolution":{"observed_at":"2026-08-03T10:47:05.629824Z","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-03T10:47:05.795322Z","title":"- We will also calculate the total days required for each sequence by summing up the days required for each city stay","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:05.795322Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:6b0b9ca1902f6cb76d45259f5a16d6d7c05cc82820bdcbaf8058dd9f54ff15bd","observation_id":"9bd3c070-428c-406c-b707-31ac5c7dae3e","resolution":{"observed_at":"2026-08-03T10:47:05.795322Z","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-03T10:47:05.900172Z","title":"The days will be represented as a list of integers","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:05.900172Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:c28f3908f2978e45cbd89e92d3fb48cd49891bd52da16e764568911e0e89faaa","observation_id":"120cce8f-ee6f-44a6-96f4-8cbce26ff07e","resolution":{"observed_at":"2026-08-03T10:47:05.900172Z","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-03T10:47:06.023915Z","title":"city\": city,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:06.023915Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:ccfffbc617050b0de1183b3e15b66ff57827c9e5ed290ec37e58e2537ee8a161","observation_id":"065d1fa3-0a51-4309-810e-ae3ee050d01f","resolution":{"observed_at":"2026-08-03T10:47:06.023915Z","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-03T10:47:06.139030Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:06.139030Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:0ffd17678d8237fc528d99087fbe097c74e4a1ca587b46100aa64053eceaf560","observation_id":"477ab87b-60a2-4916-816c-a2d8adcb744e","resolution":{"observed_at":"2026-08-03T10:47:06.139030Z","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-03T10:47:06.182889Z","title":"This will help in determining valid paths","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:06.182889Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:681e12746107fd01c076f8ea5afc2936d2311373e97d5902efb08a6bc77307ac","observation_id":"36f048a1-b44f-4391-ac0b-d8e2b4b7f57b","resolution":{"observed_at":"2026-08-03T10:47:06.182889Z","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-03T10:47:06.185888Z","title":"Ensure that each sequence is valid in terms of direct flights and total days","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:06.185888Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:35e9cb55b81bf89211bfce1571fcfe13b5b9bf5ba0114016eb3540d105961326","observation_id":"f591c38e-0fbe-4f22-9517-fa55da9345b9","resolution":{"observed_at":"2026-08-03T10:47:06.185888Z","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-03T10:47:06.188874Z","title":"- Calculate the total days required for each sequence by summing up the days required for each city stay, allowing for overlap between consecutive cities","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:06.188874Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:8e667809ca73573c633f5610dc1be73e01eb28c7c8615959db5b0e5f4b87d968","observation_id":"25f76fea-19ad-4383-a053-3b4b69d1ad74","resolution":{"observed_at":"2026-08-03T10:47:06.188874Z","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-03T10:47:06.191266Z","title":"The days will be represented as a list of integers, with overlap between consecutive cities","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:06.191266Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:c5ed572b4644cb09dc305878cf04024e0884f4cacae6464f6750b9d07690e367","observation_id":"70786c20-5239-47c9-a9d8-5977a256ddda","resolution":{"observed_at":"2026-08-03T10:47:06.191266Z","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-03T10:47:06.194165Z","title":"city\": city,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:06.194165Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:6f12582cf05d55afc67a95c29ecb1b155281fd32b00ede0eac199311b7ef6ea3","observation_id":"b1a25359-6fe6-4c63-a441-3e0f149f536e","resolution":{"observed_at":"2026-08-03T10:47:06.194165Z","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-03T10:47:06.197040Z","title":"Hence, it is non-expandable","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:06.197040Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:cbf498ea50f61667dcacabfb81e8e651785b23f4ec464e92df3b8b94737a046f","observation_id":"2bc61c8c-31ad-4531-bc8d-1e679dee8995","resolution":{"observed_at":"2026-08-03T10:47:06.197040Z","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-03T10:47:06.199636Z","title":"Hence, it is expandable","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:06.199636Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:3b90004fbdd061d837b833fb0d607d39e85f27c8b0971727237ce34eb2588bad","observation_id":"6c91a14c-4bc1-4688-bdb8-4c8899ec635e","resolution":{"observed_at":"2026-08-03T10:47:06.199636Z","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-03T10:47:06.202253Z","title":"Hence, it is non-expandable","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:06.202253Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:2bdd0ab812f88a1fdcf7d4088746474674a1b61bb56a37eb6ab10010e9d313ac","observation_id":"1ebeb66c-3264-4015-b1df-6048f62ad14c","resolution":{"observed_at":"2026-08-03T10:47:06.202253Z","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-03T10:47:06.204809Z","title":"combinations","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:06.204809Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:e02684b4f135023993bb503bda02769ee18c34f4968f9d1584d25dc2c0420c10","observation_id":"0adc7c44-2e31-4ee9-8f98-4f8a0e350203","resolution":{"observed_at":"2026-08-03T10:47:06.204809Z","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-03T10:47:06.207476Z","title":"- Constraints are given in a dictionary format, where 'specific_days'specifies the exact days certain cities must be visited","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:06.207476Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:2c013457080093b84d6811ebf2a2242b5a28edde3bfc6821aba2a7029e887828","observation_id":"d57c15c2-313f-42bf-9b6f-71ceb40047f8","resolution":{"observed_at":"2026-08-03T10:47:06.207476Z","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-03T10:47:06.210067Z","title":"- For each plan, check if it satisfies all the constraints specified in'specific_days'","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":98,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:06.210067Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:09f1736f0ed051b021cdee0c1b10f01f9a6efb258e15102586c65f2484097f02","observation_id":"560e8cd0-bd49-4f8a-8cb2-9b5f3c1d64c2","resolution":{"observed_at":"2026-08-03T10:47:06.210067Z","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-03T10:47:06.212895Z","title":"- For each plan, loop through each city in the'specific_days' constraints","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:06.212895Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:655c10097a431a7dff07bf09551ad031e340824cb66384c34129c5c1dae66ff2","observation_id":"3f395e53-fdbf-4f02-95d9-cf4965d7ab26","resolution":{"observed_at":"2026-08-03T10:47:06.212895Z","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-03T10:47:06.215822Z","title":"By following these steps, we can ensure that the function correctly filters and returns a plan that meets all the specified constraints","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:06.215822Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:551def20b982f877edf26a290a335cd0d18b5f2a5beaa92a57529d69a2e01341","observation_id":"8b5c301b-914d-4051-a1ed-a703b28fb3d2","resolution":{"observed_at":"2026-08-03T10:47:06.215822Z","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-03T10:47:06.218562Z","title":"Here is the trip plan for visiting the X European cities for Y days:","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":101,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:06.218562Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:29881c6bb553112667ae34fa0a60a03dd01fc06b1d953e01e72821e83e3f6495","observation_id":"99b8dd3d-cf90-4b49-a859-2493031c76e2","resolution":{"observed_at":"2026-08-03T10:47:06.218562Z","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-03T10:47:06.221260Z","title":"**Day X-Y:** Visit [City] for Z days","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":102,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:06.221260Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:430b6583e9d0738ce217dd81112a955e2631ca9cdf86f4217200a1e0ff4b58ef","observation_id":"8ee4fa61-ab93-4259-a5bb-e0aeef7a9ccb","resolution":{"observed_at":"2026-08-03T10:47:06.221260Z","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-03T10:47:06.223725Z","title":"**Day X:** Fly from [City1] to [City2]","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":103,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:06.223725Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:50875fbc42c50c88552e6c66252fdd396d67a663f3d6b535d0b3b30a6ac764df","observation_id":"9b96815f-0276-4fdd-869b-14b56a9c15bc","resolution":{"observed_at":"2026-08-03T10:47:06.223725Z","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-03T10:47:06.226303Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":104,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:06.226303Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:a4a204660a50f32247b442bb80b6bfd5f1553a74ed045c7dd7a3c8c77cad1b58","observation_id":"5aa4ec83-7a81-4572-920a-37c2575cbb7f","resolution":{"observed_at":"2026-08-03T10:47:06.226303Z","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-03T10:47:06.228762Z","title":"Here is the trip plan for visiting the {num_cities} European cities for {total_days} days:\\n\\n","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":105,"source":"pdf_text","source_observed_at":"2026-08-03T10:47:06.228762Z"},"links":{"citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:3189c4e7ac5273ac6a5ed154867dfbad490d62b734be1176055ef590577d3302","observation_id":"98a57966-c4fd-44bc-b189-9cfe97a77330","resolution":{"observed_at":"2026-08-03T10:47:06.228762Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.10938","last_updated":"2025-02-16T00:27:05Z","snapshot_observed_at":"2026-08-01T08:36:32.175059Z","submitted_at":"2025-02-16T00:27:05Z","title":"PEA: Enhancing LLM Performance on Computational-Reasoning Tasks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.10938","snapshot_observed_at":"2026-08-03T10:46:57.386476Z","title":"InProceedings of the 37th International Conference on Neural Information Pro- cessing Systems (NeurIPS)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-03T10:46:57.386476Z"},"links":{"cited_paper":"/paper/2502.10938","citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:47741b7c6301a7325ad2beebb83deec13ec23c3768769ed1f639262072023e0a","observation_id":"6634404a-6774-468e-b145-ab4d880e9488","resolution":{"observed_at":"2026-08-03T10:46:57.386476Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.04520","last_updated":"2024-06-06T21:27:35Z","snapshot_observed_at":"2026-08-03T17:10:42.738119Z","submitted_at":"2024-06-06T21:27:35Z","title":"NATURAL PLAN: Benchmarking LLMs on Natural Language Planning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.04520","snapshot_observed_at":"2026-08-03T10:46:57.500704Z","title":"InProceedings of the 2025 Con- ference on Empirical Methods in Natural Language Processing (EMNLP)","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning","version":4},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-03T10:46:57.500704Z"},"links":{"cited_paper":"/paper/2406.04520","citing_paper":"/paper/2601.09097"},"observation_digest":"sha256:fa6b575471a877f4b28dcf04525053f75138d755480bd3bb414da4a6ef6b3112","observation_id":"9ca36b71-9b13-4e92-b597-9cac6c589198","resolution":{"observed_at":"2026-08-03T10:46:57.500704Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2601.09097","last_updated":"2026-07-10T08:14:37Z","latest_version":4,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-06T12:19:36.404612Z","submitted_at":"2026-01-14T02:58:07Z","title":"Programming over Thinking: Efficient and Robust Multi-Constraint Planning"},"reference_resolution":{"displayed":97,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":2,"unresolved":95,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":97},"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 97 of 97 outbound references and 0 inbound Pith citation observations for arXiv:2601.09097."}