{"as_of":"2026-08-07T06:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cd93bcbe385a9d2a6b8fde705e04bb24b3017d2811186bdfe499043c53cde3db","coverage":[{"denominator":43,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":43,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T00:40:35.849317Z","state":"measured"},{"denominator":43,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":43,"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/2608.00991/citation-record","integrity":"/paper/2608.00991/integrity","json":"/paper/2608.00991/citation-record.json","paper":"/paper/2608.00991"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:40:39.581167Z","title":"and Thompson, G","venue":null,"work_id":"003f0f0f-ca78-4a21-b971-1b7e60068e29","year":null},"citing_paper":{"arxiv_id":"2608.00991","last_updated":"2026-08-02T04:41:20Z","snapshot_observed_at":"2026-08-06T23:25:16.991822Z","submitted_at":"2026-08-02T04:41:20Z","title":"SCHEDBench: A Benchmark for Evaluating LLM Constraint Faithfulness in Natural-Language Combinatorial Scheduling","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T00:40:32.688986Z"},"links":{"citing_paper":"/paper/2608.00991"},"observation_digest":"sha256:aeea9dfd9b1c6416baf1b68d330114ac9e54fc23306c11f634517c8350f1a642","observation_id":"51318fd1-da75-46dc-b511-7b85ee5d3c16","resolution":{"observed_at":"2026-08-06T00:40:39.633311Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:40:39.539855Z","title":", title =","venue":null,"work_id":"8f5829c6-5021-46c4-b920-a1423c76058f","year":null},"citing_paper":{"arxiv_id":"2608.00991","last_updated":"2026-08-02T04:41:20Z","snapshot_observed_at":"2026-08-06T23:25:16.991822Z","submitted_at":"2026-08-02T04:41:20Z","title":"SCHEDBench: A Benchmark for Evaluating LLM Constraint Faithfulness in Natural-Language Combinatorial Scheduling","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T00:40:32.776531Z"},"links":{"citing_paper":"/paper/2608.00991"},"observation_digest":"sha256:1b62352979b8d6085fdc30eef01bdcebef2624abca6bfb9f8095672fd6d85b8a","observation_id":"d9c74b4a-9b6b-48f7-b210-b8b07208791e","resolution":{"observed_at":"2026-08-06T00:40:39.566643Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:40:39.365196Z","title":"Management Science , volume =","venue":null,"work_id":"7846ada0-9363-485c-bdfa-689b7d23deaa","year":1988},"citing_paper":{"arxiv_id":"2608.00991","last_updated":"2026-08-02T04:41:20Z","snapshot_observed_at":"2026-08-06T23:25:16.991822Z","submitted_at":"2026-08-02T04:41:20Z","title":"SCHEDBench: A Benchmark for Evaluating LLM Constraint Faithfulness in Natural-Language Combinatorial Scheduling","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T00:40:32.856847Z"},"links":{"citing_paper":"/paper/2608.00991"},"observation_digest":"sha256:3cd14a709dd0fbd290b8316cf61ad87e6a769a7f263f30b1ddc3e0f273f33f62","observation_id":"45746cb2-fe9c-4a0b-ad23-1a5b63b80103","resolution":{"observed_at":"2026-08-06T00:40:39.472901Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:40:39.226835Z","title":"ORSA Journal on Computing , volume =","venue":null,"work_id":"e7b82ad8-5705-4241-b799-15d27e3e4bd3","year":null},"citing_paper":{"arxiv_id":"2608.00991","last_updated":"2026-08-02T04:41:20Z","snapshot_observed_at":"2026-08-06T23:25:16.991822Z","submitted_at":"2026-08-02T04:41:20Z","title":"SCHEDBench: A Benchmark for Evaluating LLM Constraint Faithfulness in Natural-Language Combinatorial Scheduling","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-06T00:40:32.947403Z"},"links":{"citing_paper":"/paper/2608.00991"},"observation_digest":"sha256:90b1f0edce82d195a01d7b803227043c81f38ad95293cabe777b79ebf2c0df17","observation_id":"13efb54d-630f-43b6-acde-f95a1d3b7d2f","resolution":{"observed_at":"2026-08-06T00:40:39.315198Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:40:39.093356Z","title":"and Wu, S","venue":null,"work_id":"d64dd386-b05f-4f27-87f9-084b3f5ee370","year":1992},"citing_paper":{"arxiv_id":"2608.00991","last_updated":"2026-08-02T04:41:20Z","snapshot_observed_at":"2026-08-06T23:25:16.991822Z","submitted_at":"2026-08-02T04:41:20Z","title":"SCHEDBench: A Benchmark for Evaluating LLM Constraint Faithfulness in Natural-Language Combinatorial Scheduling","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T00:40:33.021199Z"},"links":{"citing_paper":"/paper/2608.00991"},"observation_digest":"sha256:8f0081e9989475ac0bff8bb4b9fb98ae2ba3b63d9393ed6bc8363557a356ef62","observation_id":"78a87f3d-61d1-4b9f-8be0-6b3cc92d0601","resolution":{"observed_at":"2026-08-06T00:40:39.169742Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:40:38.997417Z","title":"Parallel Problem Solving from Nature 2 , pages =","venue":null,"work_id":"c28b9aa9-d085-4e4e-b1a4-f31f4b6a1b15","year":null},"citing_paper":{"arxiv_id":"2608.00991","last_updated":"2026-08-02T04:41:20Z","snapshot_observed_at":"2026-08-06T23:25:16.991822Z","submitted_at":"2026-08-02T04:41:20Z","title":"SCHEDBench: A Benchmark for Evaluating LLM Constraint Faithfulness in Natural-Language Combinatorial Scheduling","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T00:40:33.094756Z"},"links":{"citing_paper":"/paper/2608.00991"},"observation_digest":"sha256:1c897750833e606aa22ad27b4b05994c40ecd04ff2f02305c2c5079d3c5eddc0","observation_id":"1ea35889-07ee-47a5-a3ae-e9dfc13c29c4","resolution":{"observed_at":"2026-08-06T00:40:39.040366Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:40:38.874826Z","title":"Benchmarks for Basic Scheduling Problems , journal =","venue":null,"work_id":"f22ffbf0-ab06-4de1-b0e1-f385cba07bc5","year":1993},"citing_paper":{"arxiv_id":"2608.00991","last_updated":"2026-08-02T04:41:20Z","snapshot_observed_at":"2026-08-06T23:25:16.991822Z","submitted_at":"2026-08-02T04:41:20Z","title":"SCHEDBench: A Benchmark for Evaluating LLM Constraint Faithfulness in Natural-Language Combinatorial Scheduling","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T00:40:33.171478Z"},"links":{"citing_paper":"/paper/2608.00991"},"observation_digest":"sha256:c94f2090b16885e7869288fe41dd40bcbcb041b16cd7cc777a9ca8bacacb40d1","observation_id":"8a835736-d1ef-4a7f-b8fc-f8fb198f6ef0","resolution":{"observed_at":"2026-08-06T00:40:38.933860Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:40:38.737634Z","title":"European Journal of Operational Research , volume =","venue":null,"work_id":"d087b250-c486-4883-b9b2-47c7ce1763be","year":1998},"citing_paper":{"arxiv_id":"2608.00991","last_updated":"2026-08-02T04:41:20Z","snapshot_observed_at":"2026-08-06T23:25:16.991822Z","submitted_at":"2026-08-02T04:41:20Z","title":"SCHEDBench: A Benchmark for Evaluating LLM Constraint Faithfulness in Natural-Language Combinatorial Scheduling","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-06T00:40:33.255584Z"},"links":{"citing_paper":"/paper/2608.00991"},"observation_digest":"sha256:d47ce24111194ed4b96bd49800d947bc84d9419e1c248408d6d76f28e5085d9e","observation_id":"7370095d-32ad-4855-b4ec-056a235f9618","resolution":{"observed_at":"2026-08-06T00:40:38.814059Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:40:38.612375Z","title":", title =","venue":null,"work_id":"90761ad0-e2c7-49be-8fc4-fdd08f5f3826","year":2022},"citing_paper":{"arxiv_id":"2608.00991","last_updated":"2026-08-02T04:41:20Z","snapshot_observed_at":"2026-08-06T23:25:16.991822Z","submitted_at":"2026-08-02T04:41:20Z","title":"SCHEDBench: A Benchmark for Evaluating LLM Constraint Faithfulness in Natural-Language Combinatorial Scheduling","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T00:40:33.330111Z"},"links":{"citing_paper":"/paper/2608.00991"},"observation_digest":"sha256:a5e1d3a93935011298acf33f59ef13d0790c1834533532f9a286da3a10e3d4ce","observation_id":"087f7cdd-7184-418c-bf70-fe8ddc57d58d","resolution":{"observed_at":"2026-08-06T00:40:38.653576Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:40:33.406502Z","title":"Tetreault , title =","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2608.00991","last_updated":"2026-08-02T04:41:20Z","snapshot_observed_at":"2026-08-06T23:25:16.991822Z","submitted_at":"2026-08-02T04:41:20Z","title":"SCHEDBench: A Benchmark for Evaluating LLM Constraint Faithfulness in Natural-Language Combinatorial Scheduling","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-06T00:40:33.406502Z"},"links":{"citing_paper":"/paper/2608.00991"},"observation_digest":"sha256:5b047ab96858b6b8d04fdd04a1463cc3ce20960a43fe0e94fd08f9a2964a3d76","observation_id":"eba6dbba-a5f5-465e-8ef9-369f20930922","resolution":{"observed_at":"2026-08-06T00:40:33.406502Z","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-06T00:40:33.535399Z","title":"A Framework for Learning Predictive Structures from Multiple Tasks and Unlabeled Data , Volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00991","last_updated":"2026-08-02T04:41:20Z","snapshot_observed_at":"2026-08-06T23:25:16.991822Z","submitted_at":"2026-08-02T04:41:20Z","title":"SCHEDBench: A Benchmark for Evaluating LLM Constraint Faithfulness in Natural-Language Combinatorial Scheduling","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T00:40:33.535399Z"},"links":{"citing_paper":"/paper/2608.00991"},"observation_digest":"sha256:f15a86296c307823c37f190f2c647991239f89a1026a783b372bccde4ce4af02","observation_id":"c149b08e-1f65-4e14-9006-03158eacf276","resolution":{"observed_at":"2026-08-06T00:40:33.535399Z","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":"10.18653/v1/2025.emnlp-main.1734","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:40:36.784946Z","title":"Proceedings of the 2025","venue":null,"work_id":"27870c31-c88b-4e2c-8a4b-0903b79d6bc7","year":2025},"citing_paper":{"arxiv_id":"2608.00991","last_updated":"2026-08-02T04:41:20Z","snapshot_observed_at":"2026-08-06T23:25:16.991822Z","submitted_at":"2026-08-02T04:41:20Z","title":"SCHEDBench: A Benchmark for Evaluating LLM Constraint Faithfulness in Natural-Language Combinatorial Scheduling","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-06T00:40:33.629329Z"},"links":{"citing_paper":"/paper/2608.00991"},"observation_digest":"sha256:cd6c11cc0cd4cb2c1231820cfc896ee8de51d00c0dbcfd1334d8581daa3d957e","observation_id":"539905fe-cd94-4e00-98e0-8620a466b234","resolution":{"observed_at":"2026-08-06T00:40:36.889518Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-06T21:38:20.324369+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-06T21:38:20.324369+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:40:33.690850Z","title":"TCP : a Benchmark for Temporal Constraint-Based Planning","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.00991","last_updated":"2026-08-02T04:41:20Z","snapshot_observed_at":"2026-08-06T23:25:16.991822Z","submitted_at":"2026-08-02T04:41:20Z","title":"SCHEDBench: A Benchmark for Evaluating LLM Constraint Faithfulness in Natural-Language Combinatorial Scheduling","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-06T00:40:33.690850Z"},"links":{"citing_paper":"/paper/2608.00991"},"observation_digest":"sha256:bcec55d6b3572bab71915ad8f25edcdc95ab55c84cd93f3dada24334c3a13df9","observation_id":"f36992ed-7efb-4490-9358-6fe14ee8382f","resolution":{"observed_at":"2026-08-06T00:40:33.690850Z","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-06T00:40:33.785037Z","title":"Proceedings of the 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.00991","last_updated":"2026-08-02T04:41:20Z","snapshot_observed_at":"2026-08-06T23:25:16.991822Z","submitted_at":"2026-08-02T04:41:20Z","title":"SCHEDBench: A Benchmark for Evaluating LLM Constraint Faithfulness in Natural-Language Combinatorial Scheduling","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-06T00:40:33.785037Z"},"links":{"citing_paper":"/paper/2608.00991"},"observation_digest":"sha256:5f9bc5adba2b7c140218290a42151f51a75ab1e7b4bdac6ee08894520c199542","observation_id":"2c082159-d835-48e9-8f55-831d8fa43357","resolution":{"observed_at":"2026-08-06T00:40:33.785037Z","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-06T00:40:33.901616Z","title":"and Angeli, Gabor and Potts, Christopher and Manning, Christopher D","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2608.00991","last_updated":"2026-08-02T04:41:20Z","snapshot_observed_at":"2026-08-06T23:25:16.991822Z","submitted_at":"2026-08-02T04:41:20Z","title":"SCHEDBench: A Benchmark for Evaluating LLM Constraint Faithfulness in Natural-Language Combinatorial Scheduling","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-06T00:40:33.901616Z"},"links":{"citing_paper":"/paper/2608.00991"},"observation_digest":"sha256:c7b75ca921d42ae787b7f0642582a3e3e82ba9fe7d1d5beb45c0a62ebe9b5a9c","observation_id":"e3abcb76-82cf-44b2-8794-39d41b609c3f","resolution":{"observed_at":"2026-08-06T00:40:33.901616Z","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-06T00:40:33.975114Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.00991","last_updated":"2026-08-02T04:41:20Z","snapshot_observed_at":"2026-08-06T23:25:16.991822Z","submitted_at":"2026-08-02T04:41:20Z","title":"SCHEDBench: A Benchmark for Evaluating LLM Constraint Faithfulness in Natural-Language Combinatorial Scheduling","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-06T00:40:33.975114Z"},"links":{"citing_paper":"/paper/2608.00991"},"observation_digest":"sha256:605dde32fe92ffb2b8b306177ce21cef1358ead82b5885a72317755ef87a58f6","observation_id":"a7824166-4b50-491c-a992-02b283b58c2b","resolution":{"observed_at":"2026-08-06T00:40:33.975114Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2107.03374","last_updated":"2021-07-14T17:16:02Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2021-07-07T17:41:24Z","title":"Evaluating Large Language Models Trained on Code","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.03374","snapshot_observed_at":"2026-08-06T00:40:34.019495Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00991","last_updated":"2026-08-02T04:41:20Z","snapshot_observed_at":"2026-08-06T23:25:16.991822Z","submitted_at":"2026-08-02T04:41:20Z","title":"SCHEDBench: A Benchmark for Evaluating LLM Constraint Faithfulness in Natural-Language Combinatorial Scheduling","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-06T00:40:34.019495Z"},"links":{"cited_paper":"/paper/2107.03374","citing_paper":"/paper/2608.00991"},"observation_digest":"sha256:7dadadd1b859959089778725c52e4ae733ef369a4924fd1d593edf8bff0003a4","observation_id":"bffafa90-b5e3-45da-9e80-1bc532b14d73","resolution":{"observed_at":"2026-08-06T00:40:34.019495Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14168","last_updated":"2021-11-18T00:23:45Z","snapshot_observed_at":"2026-08-07T01:45:38.840969Z","submitted_at":"2021-10-27T04:49:45Z","title":"Training Verifiers to Solve Math Word Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.14168","snapshot_observed_at":"2026-08-06T00:40:34.125612Z","title":"Training","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00991","last_updated":"2026-08-02T04:41:20Z","snapshot_observed_at":"2026-08-06T23:25:16.991822Z","submitted_at":"2026-08-02T04:41:20Z","title":"SCHEDBench: A Benchmark for Evaluating LLM Constraint Faithfulness in Natural-Language Combinatorial Scheduling","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-06T00:40:34.125612Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2608.00991"},"observation_digest":"sha256:1a44700278196aeafcc2ee442a53a4a847af1eb835ea418bf3f4d78fd751ad17","observation_id":"6c6381a0-838a-4a42-8f49-9b4b0cad8c0e","resolution":{"observed_at":"2026-08-06T00:40:34.125612Z","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-06T00:40:34.194294Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.00991","last_updated":"2026-08-02T04:41:20Z","snapshot_observed_at":"2026-08-06T23:25:16.991822Z","submitted_at":"2026-08-02T04:41:20Z","title":"SCHEDBench: A Benchmark for Evaluating LLM Constraint Faithfulness in Natural-Language Combinatorial Scheduling","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T00:40:34.194294Z"},"links":{"citing_paper":"/paper/2608.00991"},"observation_digest":"sha256:e9dcec3691da2750a8d9932dde1f4584800b15b4b434f2e9ad6c0e2235c8dcf5","observation_id":"d2e959d5-963e-4cca-8890-61a8bc76f12c","resolution":{"observed_at":"2026-08-06T00:40:34.194294Z","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":"10.18653/v1/2021.acl-long.569","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:40:36.640418Z","title":"Proceedings of the 59th","venue":null,"work_id":"a8711526-2c46-447a-8ff3-bd7687dccaed","year":2021},"citing_paper":{"arxiv_id":"2608.00991","last_updated":"2026-08-02T04:41:20Z","snapshot_observed_at":"2026-08-06T23:25:16.991822Z","submitted_at":"2026-08-02T04:41:20Z","title":"SCHEDBench: A Benchmark for Evaluating LLM Constraint Faithfulness in Natural-Language Combinatorial Scheduling","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T00:40:34.271220Z"},"links":{"citing_paper":"/paper/2608.00991"},"observation_digest":"sha256:b0a9851e2755a09e801e32e8189677f783403c8aa24f7ddaa14b4985d72c1e5f","observation_id":"2ab3df5d-c07a-4d13-b4b4-806d12d0a9e6","resolution":{"observed_at":"2026-08-06T00:40:36.682409Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-06T21:38:20.806107+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-06T21:38:20.806107+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:40:34.329125Z","title":"Thomas and Pavlick, Ellie and Linzen, Tal , editor =","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.00991","last_updated":"2026-08-02T04:41:20Z","snapshot_observed_at":"2026-08-06T23:25:16.991822Z","submitted_at":"2026-08-02T04:41:20Z","title":"SCHEDBench: A Benchmark for Evaluating LLM Constraint Faithfulness in Natural-Language Combinatorial Scheduling","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-06T00:40:34.329125Z"},"links":{"citing_paper":"/paper/2608.00991"},"observation_digest":"sha256:638282631245d7d53fffa79640e7be3113df3d4149af1efb75b8b3af5c89d639","observation_id":"bc3dd8ea-9ba0-49df-8c36-3db0d545db1f","resolution":{"observed_at":"2026-08-06T00:40:34.329125Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:40:38.455292Z","title":"Quantifying","venue":null,"work_id":"2213fa48-2b71-4491-a203-154b21a932be","year":null},"citing_paper":{"arxiv_id":"2608.00991","last_updated":"2026-08-02T04:41:20Z","snapshot_observed_at":"2026-08-06T23:25:16.991822Z","submitted_at":"2026-08-02T04:41:20Z","title":"SCHEDBench: A Benchmark for Evaluating LLM Constraint Faithfulness in Natural-Language Combinatorial Scheduling","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-06T00:40:34.393200Z"},"links":{"citing_paper":"/paper/2608.00991"},"observation_digest":"sha256:70bdaf034edaf3346f51d2d54c7b2912a88e21232013a51cb5075d368ea5004b","observation_id":"72d6753b-d774-4027-a638-649d580fb31b","resolution":{"observed_at":"2026-08-06T00:40:38.533194Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:40:38.336907Z","title":"2023 , url =","venue":null,"work_id":"451de0ec-b5b7-471d-bb43-350b92577c88","year":2023},"citing_paper":{"arxiv_id":"2608.00991","last_updated":"2026-08-02T04:41:20Z","snapshot_observed_at":"2026-08-06T23:25:16.991822Z","submitted_at":"2026-08-02T04:41:20Z","title":"SCHEDBench: A Benchmark for Evaluating LLM Constraint Faithfulness in Natural-Language Combinatorial Scheduling","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-06T00:40:34.470936Z"},"links":{"citing_paper":"/paper/2608.00991"},"observation_digest":"sha256:5baa49f66e39ec7b713d2a2da46dc48ca6b74ce56e10ac3855a0fda6fcd78f2d","observation_id":"fe0a2532-c6ad-40d5-9e68-9c109eef8eec","resolution":{"observed_at":"2026-08-06T00:40:38.412610Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"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-06T00:40:34.550973Z","title":"and Chi, Ed H","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00991","last_updated":"2026-08-02T04:41:20Z","snapshot_observed_at":"2026-08-06T23:25:16.991822Z","submitted_at":"2026-08-02T04:41:20Z","title":"SCHEDBench: A Benchmark for Evaluating LLM Constraint Faithfulness in Natural-Language Combinatorial Scheduling","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-06T00:40:34.550973Z"},"links":{"cited_paper":"/paper/2406.04520","citing_paper":"/paper/2608.00991"},"observation_digest":"sha256:f54b748dd6e06a8d0f43ded6131ae28cd46ffc34f77a6bae5019387a555d0708","observation_id":"eb204b0b-ca29-4062-938a-b8a90a35ada4","resolution":{"observed_at":"2026-08-06T00:40:34.550973Z","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-06T00:40:34.631461Z","title":"Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) , publisher =","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.00991","last_updated":"2026-08-02T04:41:20Z","snapshot_observed_at":"2026-08-06T23:25:16.991822Z","submitted_at":"2026-08-02T04:41:20Z","title":"SCHEDBench: A Benchmark for Evaluating LLM Constraint Faithfulness in Natural-Language Combinatorial Scheduling","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-06T00:40:34.631461Z"},"links":{"citing_paper":"/paper/2608.00991"},"observation_digest":"sha256:0a3bfad4b0151f6db72e5c45a28b08a79bc844bb4a08c69c75416a817c6e98ad","observation_id":"d12aa6af-1768-4ff9-a72b-8931eb5c34ac","resolution":{"observed_at":"2026-08-06T00:40:34.631461Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:40:38.190499Z","title":null,"venue":null,"work_id":"b7674d6c-41b8-422b-bc0a-7b22ebf6e694","year":2025},"citing_paper":{"arxiv_id":"2608.00991","last_updated":"2026-08-02T04:41:20Z","snapshot_observed_at":"2026-08-06T23:25:16.991822Z","submitted_at":"2026-08-02T04:41:20Z","title":"SCHEDBench: A Benchmark for Evaluating LLM Constraint Faithfulness in Natural-Language Combinatorial Scheduling","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-06T00:40:34.697507Z"},"links":{"citing_paper":"/paper/2608.00991"},"observation_digest":"sha256:e0816964fc76f2a6856362bd2cb5cd3ba2ccb8c06556d9963f39fdb9d6733262","observation_id":"8b233dd0-380c-4f6e-bc4d-17eb9b019934","resolution":{"observed_at":"2026-08-06T00:40:38.269206Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.18653/v1/2025.emnlp-main.809","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:40:36.475297Z","title":"Proceedings of the 2025","venue":null,"work_id":"f22abd4d-c60e-4e11-ab03-5bbb10697486","year":2025},"citing_paper":{"arxiv_id":"2608.00991","last_updated":"2026-08-02T04:41:20Z","snapshot_observed_at":"2026-08-06T23:25:16.991822Z","submitted_at":"2026-08-02T04:41:20Z","title":"SCHEDBench: A Benchmark for Evaluating LLM Constraint Faithfulness in Natural-Language Combinatorial Scheduling","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-06T00:40:34.783190Z"},"links":{"citing_paper":"/paper/2608.00991"},"observation_digest":"sha256:022a7b7e607e059d0aba30375b66c71e4756d48e4c205daa3f247d64e4c009c6","observation_id":"50b10c32-fda9-4ba2-98c4-cde5f71f090d","resolution":{"observed_at":"2026-08-06T00:40:36.560485Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-06T21:38:21.16809+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-06T21:38:21.16809+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.48550/arxiv.2602.22465","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:40:36.352371Z","title":"doi:10.48550/arXiv.2602.22465 , abstract =","venue":null,"work_id":"04c5af2c-dbb4-49f0-a831-fd4f73a168cb","year":null},"citing_paper":{"arxiv_id":"2608.00991","last_updated":"2026-08-02T04:41:20Z","snapshot_observed_at":"2026-08-06T23:25:16.991822Z","submitted_at":"2026-08-02T04:41:20Z","title":"SCHEDBench: A Benchmark for Evaluating LLM Constraint Faithfulness in Natural-Language Combinatorial Scheduling","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-06T00:40:34.842569Z"},"links":{"citing_paper":"/paper/2608.00991"},"observation_digest":"sha256:d26e9fcb6677ce93f6aec92259470cacb9d784b73cc79d4931bbaefec5b04c76","observation_id":"4a91c81c-631d-4aed-9940-b82b6bb296e1","resolution":{"observed_at":"2026-08-06T00:40:36.425707Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-06T21:38:21.384602+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-06T21:38:21.384602+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.01877","last_updated":"2025-03-27T10:38:45Z","snapshot_observed_at":"2026-07-06T20:45:55.263034Z","submitted_at":"2025-02-26T15:20:01Z","title":"Starjob: Dataset for LLM-Driven Job Shop Scheduling","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.01877","snapshot_observed_at":"2026-08-06T00:40:34.948730Z","title":"Starjob:","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.00991","last_updated":"2026-08-02T04:41:20Z","snapshot_observed_at":"2026-08-06T23:25:16.991822Z","submitted_at":"2026-08-02T04:41:20Z","title":"SCHEDBench: A Benchmark for Evaluating LLM Constraint Faithfulness in Natural-Language Combinatorial Scheduling","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-06T00:40:34.948730Z"},"links":{"cited_paper":"/paper/2503.01877","citing_paper":"/paper/2608.00991"},"observation_digest":"sha256:a35294f0654551de865467103b92865d14b23da738805ddef96915892d5f3ec6","observation_id":"19f8fdb2-4ab7-430a-9c5f-f21270f64cfb","resolution":{"observed_at":"2026-08-06T00:40:34.948730Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.15204","last_updated":"2025-08-21T03:35:58Z","snapshot_observed_at":"2026-08-05T18:02:59.076928Z","submitted_at":"2025-08-21T03:35:58Z","title":"R-ConstraintBench: Evaluating LLMs on NP-Complete Scheduling","version":1},"cited_work":{"arxiv_id":"2508.15204","doi":"10.48550/arxiv.2508.15204","metadata_source":"pith","pith_arxiv_id":"2508.15204","snapshot_observed_at":"2026-08-06T06:16:15.181768Z","title":"R-ConstraintBench: Evaluating LLMs on NP-Complete Scheduling","venue":"cs.AI","work_id":"6bb10e82-4998-4ef1-9049-e7fd4c42aab2","year":2025},"citing_paper":{"arxiv_id":"2608.00991","last_updated":"2026-08-02T04:41:20Z","snapshot_observed_at":"2026-08-06T23:25:16.991822Z","submitted_at":"2026-08-02T04:41:20Z","title":"SCHEDBench: A Benchmark for Evaluating LLM Constraint Faithfulness in Natural-Language Combinatorial Scheduling","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-06T00:40:34.981984Z"},"links":{"cited_paper":"/paper/2508.15204","citing_paper":"/paper/2608.00991"},"observation_digest":"sha256:120bb13548e4d6a0c267a9cf4dc6f92ff355ca85e1641abb56830cf01f842855","observation_id":"1b0bb880-379a-4084-8c5b-4b2f93f8bb5d","resolution":{"observed_at":"2026-08-06T00:40:36.173742Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-06T21:38:21.642777+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-06T21:38:21.642777+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:40:38.088214Z","title":"2022 , volume =","venue":null,"work_id":"b6be029b-3d00-4c8b-ab7e-6da0f9f0e0ae","year":2022},"citing_paper":{"arxiv_id":"2608.00991","last_updated":"2026-08-02T04:41:20Z","snapshot_observed_at":"2026-08-06T23:25:16.991822Z","submitted_at":"2026-08-02T04:41:20Z","title":"SCHEDBench: A Benchmark for Evaluating LLM Constraint Faithfulness in Natural-Language Combinatorial Scheduling","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-06T00:40:35.055884Z"},"links":{"citing_paper":"/paper/2608.00991"},"observation_digest":"sha256:5d5a9383a22c93127b88b0bb56ded0d6b2dc57be58b6ad14b8f53225005eabf5","observation_id":"f8d5fa3e-9511-4a11-8a4d-6d95699b335e","resolution":{"observed_at":"2026-08-06T00:40:38.127706Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:40:37.962972Z","title":"2025 , publisher =","venue":null,"work_id":"bfc5353d-6e35-4d76-ab38-b77c2d5c77ff","year":2025},"citing_paper":{"arxiv_id":"2608.00991","last_updated":"2026-08-02T04:41:20Z","snapshot_observed_at":"2026-08-06T23:25:16.991822Z","submitted_at":"2026-08-02T04:41:20Z","title":"SCHEDBench: A Benchmark for Evaluating LLM Constraint Faithfulness in Natural-Language Combinatorial Scheduling","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-06T00:40:35.129608Z"},"links":{"citing_paper":"/paper/2608.00991"},"observation_digest":"sha256:aa1d640c399a70fdb4ef97be712d9341c941ffa7be272bfd0c2aa4aa72b205be","observation_id":"6a6ab7d8-cd5c-4b3b-a268-c0dd0e9293b5","resolution":{"observed_at":"2026-08-06T00:40:37.997250Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:40:37.826308Z","title":"2025 , url =","venue":null,"work_id":"3e69a0cd-4314-43cc-8cf2-4c6570d2e5f9","year":2025},"citing_paper":{"arxiv_id":"2608.00991","last_updated":"2026-08-02T04:41:20Z","snapshot_observed_at":"2026-08-06T23:25:16.991822Z","submitted_at":"2026-08-02T04:41:20Z","title":"SCHEDBench: A Benchmark for Evaluating LLM Constraint Faithfulness in Natural-Language Combinatorial Scheduling","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-06T00:40:35.216319Z"},"links":{"citing_paper":"/paper/2608.00991"},"observation_digest":"sha256:c574db7f6968499784fe8af74cc52fb1ad9fb92af9af3448b0d514804a791110","observation_id":"8f198eb4-8f0f-43c5-8c4c-717b70cec565","resolution":{"observed_at":"2026-08-06T00:40:37.906469Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:40:37.702982Z","title":"Proceedings of the 42nd International Conference on Machine Learning , volume =","venue":null,"work_id":"6aa864c4-db59-4ed5-bd43-00dc07a382be","year":2025},"citing_paper":{"arxiv_id":"2608.00991","last_updated":"2026-08-02T04:41:20Z","snapshot_observed_at":"2026-08-06T23:25:16.991822Z","submitted_at":"2026-08-02T04:41:20Z","title":"SCHEDBench: A Benchmark for Evaluating LLM Constraint Faithfulness in Natural-Language Combinatorial Scheduling","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-06T00:40:35.283377Z"},"links":{"citing_paper":"/paper/2608.00991"},"observation_digest":"sha256:71494a026dd07e43b1e561eef58cd3e224de953d0cc1d47cfa572780f8df3409","observation_id":"83c40cd1-c152-4494-b76c-3ffaeed225ab","resolution":{"observed_at":"2026-08-06T00:40:37.777022Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2602.02188","last_updated":"2026-04-09T18:30:49Z","snapshot_observed_at":"2026-07-06T22:44:09.804048Z","submitted_at":"2026-02-02T14:55:48Z","title":"Reasoning in a Combinatorial and Constrained World: Benchmarking LLMs on Natural-Language Combinatorial Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2602.02188","snapshot_observed_at":"2026-08-06T00:40:35.324628Z","title":"Reasoning in a","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00991","last_updated":"2026-08-02T04:41:20Z","snapshot_observed_at":"2026-08-06T23:25:16.991822Z","submitted_at":"2026-08-02T04:41:20Z","title":"SCHEDBench: A Benchmark for Evaluating LLM Constraint Faithfulness in Natural-Language Combinatorial Scheduling","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-06T00:40:35.324628Z"},"links":{"cited_paper":"/paper/2602.02188","citing_paper":"/paper/2608.00991"},"observation_digest":"sha256:c52a8068ebb8498359a59c9b080ad3b84c389f7274fb231324fc412013b1b4b0","observation_id":"d3c88ac1-771d-4e88-bc70-2a50c9cccd18","resolution":{"observed_at":"2026-08-06T00:40:35.324628Z","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-06T00:40:35.369204Z","title":"1997 , pages =","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2608.00991","last_updated":"2026-08-02T04:41:20Z","snapshot_observed_at":"2026-08-06T23:25:16.991822Z","submitted_at":"2026-08-02T04:41:20Z","title":"SCHEDBench: A Benchmark for Evaluating LLM Constraint Faithfulness in Natural-Language Combinatorial Scheduling","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-06T00:40:35.369204Z"},"links":{"citing_paper":"/paper/2608.00991"},"observation_digest":"sha256:8cd47dbf46d417bd8458db5a989b64770512cf4d2bfd15ec24b107caf74aa83a","observation_id":"3c7f213a-6eae-4f88-9e45-60c1b87629fa","resolution":{"observed_at":"2026-08-06T00:40:35.369204Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:40:37.568003Z","title":null,"venue":null,"work_id":"50880f8a-b9c7-4f37-a5b6-80ecd83c9ef2","year":2007},"citing_paper":{"arxiv_id":"2608.00991","last_updated":"2026-08-02T04:41:20Z","snapshot_observed_at":"2026-08-06T23:25:16.991822Z","submitted_at":"2026-08-02T04:41:20Z","title":"SCHEDBench: A Benchmark for Evaluating LLM Constraint Faithfulness in Natural-Language Combinatorial Scheduling","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-06T00:40:35.481802Z"},"links":{"citing_paper":"/paper/2608.00991"},"observation_digest":"sha256:9e278853a8093ca6e9484b104e2e518c02cef94d7e1cb53bd55024298796f61a","observation_id":"575798d5-a736-4d70-9bf3-609cf697742c","resolution":{"observed_at":"2026-08-06T00:40:37.651930Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:40:37.442859Z","title":"Annals of Operations Research , volume =","venue":null,"work_id":"9f41f39b-dc98-4cc4-98a3-f4fad42d14a3","year":2012},"citing_paper":{"arxiv_id":"2608.00991","last_updated":"2026-08-02T04:41:20Z","snapshot_observed_at":"2026-08-06T23:25:16.991822Z","submitted_at":"2026-08-02T04:41:20Z","title":"SCHEDBench: A Benchmark for Evaluating LLM Constraint Faithfulness in Natural-Language Combinatorial Scheduling","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-06T00:40:35.546159Z"},"links":{"citing_paper":"/paper/2608.00991"},"observation_digest":"sha256:4f58fb638f24156d842ed79527a74bc7f9fac6d45c60c8227b1a317c96243448","observation_id":"24eae6d8-a1a9-433b-a5fb-6cc9f60ac5d0","resolution":{"observed_at":"2026-08-06T00:40:37.501679Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:40:37.348600Z","title":"2007 , url =","venue":null,"work_id":"32b57b54-f3bd-449b-a92f-a5e43ce81986","year":2007},"citing_paper":{"arxiv_id":"2608.00991","last_updated":"2026-08-02T04:41:20Z","snapshot_observed_at":"2026-08-06T23:25:16.991822Z","submitted_at":"2026-08-02T04:41:20Z","title":"SCHEDBench: A Benchmark for Evaluating LLM Constraint Faithfulness in Natural-Language Combinatorial Scheduling","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-06T00:40:35.610797Z"},"links":{"citing_paper":"/paper/2608.00991"},"observation_digest":"sha256:6f2817dc4b73a83d1c8a787c217f83229611f518680a16b5ac7f0371b2896bd2","observation_id":"c35d5ca9-18bb-42ad-8a84-4a80fab56282","resolution":{"observed_at":"2026-08-06T00:40:37.374355Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:40:37.204439Z","title":"European Journal of Operational Research , volume =","venue":null,"work_id":"c7931fa2-5b84-4db3-9a82-fea8765bbb10","year":2009},"citing_paper":{"arxiv_id":"2608.00991","last_updated":"2026-08-02T04:41:20Z","snapshot_observed_at":"2026-08-06T23:25:16.991822Z","submitted_at":"2026-08-02T04:41:20Z","title":"SCHEDBench: A Benchmark for Evaluating LLM Constraint Faithfulness in Natural-Language Combinatorial Scheduling","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-06T00:40:35.670776Z"},"links":{"citing_paper":"/paper/2608.00991"},"observation_digest":"sha256:868772120a07726cef98cd3f35dded14c76913c914545ce316e8a0a3cac17e58","observation_id":"ea9de590-4fed-4c72-b005-ce8005fc8a78","resolution":{"observed_at":"2026-08-06T00:40:37.278215Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:40:37.068286Z","title":null,"venue":null,"work_id":"0fda749b-1e7e-4b71-92b3-dea7a335f86b","year":2014},"citing_paper":{"arxiv_id":"2608.00991","last_updated":"2026-08-02T04:41:20Z","snapshot_observed_at":"2026-08-06T23:25:16.991822Z","submitted_at":"2026-08-02T04:41:20Z","title":"SCHEDBench: A Benchmark for Evaluating LLM Constraint Faithfulness in Natural-Language Combinatorial Scheduling","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-06T00:40:35.751473Z"},"links":{"citing_paper":"/paper/2608.00991"},"observation_digest":"sha256:0c58df58f5314bb335678abfe9f7d6663e7d4fe50546d79d21324ca4e78e38ef","observation_id":"ad3f63ba-0d0d-4deb-b350-b1524cb7c41b","resolution":{"observed_at":"2026-08-06T00:40:37.133398Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:40:36.941184Z","title":"Solver-Informed","venue":null,"work_id":"74a6962d-b6d7-4237-9cb7-e6fecafb3a57","year":null},"citing_paper":{"arxiv_id":"2608.00991","last_updated":"2026-08-02T04:41:20Z","snapshot_observed_at":"2026-08-06T23:25:16.991822Z","submitted_at":"2026-08-02T04:41:20Z","title":"SCHEDBench: A Benchmark for Evaluating LLM Constraint Faithfulness in Natural-Language Combinatorial Scheduling","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-06T00:40:35.796111Z"},"links":{"citing_paper":"/paper/2608.00991"},"observation_digest":"sha256:0e25a4d82f35a74db50245444bab8fee3b4334d93694fd317b71fc139dc0b352","observation_id":"b6d80281-5b36-4093-bde3-ed54b55ee534","resolution":{"observed_at":"2026-08-06T00:40:37.021491Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.ejor.2011.02.019","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:40:35.960416Z","title":"Lower bounds for the","venue":null,"work_id":"e25da363-2934-47fc-a439-4cc39c2d08a4","year":2011},"citing_paper":{"arxiv_id":"2608.00991","last_updated":"2026-08-02T04:41:20Z","snapshot_observed_at":"2026-08-06T23:25:16.991822Z","submitted_at":"2026-08-02T04:41:20Z","title":"SCHEDBench: A Benchmark for Evaluating LLM Constraint Faithfulness in Natural-Language Combinatorial Scheduling","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-06T00:40:35.849317Z"},"links":{"citing_paper":"/paper/2608.00991"},"observation_digest":"sha256:b2efb1de9b8711b7eb5d36003dccea23806c7d281aadbb481797b78812dabdba","observation_id":"cd868e1f-b019-4cc5-b567-d95a51be3ab5","resolution":{"observed_at":"2026-08-06T00:40:36.019600Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-06T21:38:22.166384+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-06T21:38:22.166384+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.00991","last_updated":"2026-08-02T04:41:20Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-06T23:25:16.991822Z","submitted_at":"2026-08-02T04:41:20Z","title":"SCHEDBench: A Benchmark for Evaluating LLM Constraint Faithfulness in Natural-Language Combinatorial Scheduling"},"reference_resolution":{"displayed":43,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":1,"unresolved":18,"verified_exact":6,"verified_fuzzy":18},"total_outbound_references":43},"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 43 of 43 outbound references and 0 inbound Pith citation observations for arXiv:2608.00991."}