{"as_of":"2026-08-20T14:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1e29ac506a2447be83b8b57ff7a2cdf84471775b56c9c85c5ec360f3820d683b","coverage":[{"denominator":59,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":59,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-28T13:29:35.451850Z","state":"measured"},{"denominator":59,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":59,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+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/2606.02469/citation-record","integrity":"/paper/2606.02469/integrity","json":"/paper/2606.02469/citation-record.json","paper":"/paper/2606.02469"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":"INFORMS J","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:c04eda061e890bc4100a24a38973a121ab5876118325d63194f6778750d7ede2","observation_id":"e08cd09f-23ac-4298-8737-0939fe4470f9","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":null,"venue":null,"work_id":null,"year":1962},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:56e74845f7cbaf367d30b8efc583fd8d21314d4a36d926690bd3a45c8fa73755","observation_id":"6940b560-8bf2-4d93-a42e-f106362032b6","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":"Omega 126, 103045 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:e783cff29fcc2dbbe47ecaf98a347ca95330d4ff7585c8d5c5c6473b4fe8ef46","observation_id":"fdf7b81e-9e8c-4d29-b7c2-1365a7359495","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:475cfa26cdcfc09abdfaaecf6d0fd2424b960601f1e186e627e23c039ff64278","observation_id":"8985aba3-428d-4959-aff5-c025483c2110","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":null,"venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:b26a82d371d207bf03f926f1c6a5de5d94eeac7fb4a190d999d1e3f88bf903a3","observation_id":"f2474936-08ec-4f58-bfcd-516366226c0a","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":"Springer, 44 New York (2011)","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:d7ffe3f56d1f35f9e5d4787711afe62060e70f50a03ab100f26bf81fe3002fd7","observation_id":"4c9e6273-f46a-4f5a-a968-32fd54c33bd5","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:e429d7940e4803f85f5dc9d564273c527190ab37fa20fb5453c59f64135d1dd6","observation_id":"aa5278fc-e70d-4cf0-8a8c-2c7a3ac5f323","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":"(eds.) Freight Railroad Service Network Design, pp","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:687ee7900a169855f1096cb3fa059cd524bc5c5dbd32c3f704e373290e36e183","observation_id":"efe52173-896c-424a-b564-ad908cc95041","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":null,"venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:74556e81e7d5464a4d5491c3ff62226d158999ab3ea4dae62c8008eb90f061a2","observation_id":"7efffc72-9fb4-468a-ac92-7e2cb7827180","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:8db9ec6c67c00ec31b70eebb9f8d0ce32d276f0becf270124bfaa2789001db2b","observation_id":"cac72e64-a93f-4501-a249-faaddf470b71","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:08e8f01ee9d0a7d9259e3c2706b9207a18b0f36c8f4cd6dab8104f1f0abee2bc","observation_id":"0b85f712-4ef2-43e0-9bb4-0cb8c3bec9c5","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":"(eds.): Network Design with Applica- tions to Transportation and Logistics","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:a2f8daa84f4212b3b4544b5d3bff88af30ce67cae6375fea8d8ed11b7d65e9bc","observation_id":"d9b70fd0-b235-47c2-ba48-032c0838f36e","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:23c4619d6a6262f5cc522cdd15807ffefab4909b848d98d8a93f38520372668a","observation_id":"10528e80-1450-4007-8947-2cd8a095dd3d","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:b2b1c3d0992b8e82a5a4b6c324479322bb11e8023ee69ee9151477e09f16d71f","observation_id":"69eee90f-2721-49b4-8b70-107f3b795891","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":"(eds.) Logistics Network Design, pp","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:70af86199218db3c3efd5ad5f1230bcfe13e58576b4cc72ebd72b0f5046ebaac","observation_id":"8aa4d4c0-5acf-4c84-926d-fc4f5abba73c","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:ec39742019fe1da34deeeb6d65420f79bfab7122401c5b91bc46ef6797ef3c74","observation_id":"239113fb-b0c3-4194-bc7d-4957f743a1b7","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":null,"venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:86b66d4feabdde16d490ef3b31a80320c97bfe0919fd8e0f87550e260f523ef6","observation_id":"6addf87c-9204-4da0-bc6c-8c7e278f1bc8","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":"Springer, Cham (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:ca47f1fc0902df750f1ef99a4911611eacffbda6d4b3e5fd0354c5a115eb161c","observation_id":"29d951fb-972c-492b-93ae-dcd9594c732d","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":"(e d.) Barycentric Bounds in Stochastic Programming: Theory and Application, pp","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:0ce2c8d2b798467e40840e4b21291740114c1a2e8b2c420b47fa5736f6f43cc6","observation_id":"58305a86-9bf8-4df0-9f9b-0ac24f09c8fb","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":null,"venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:babe65e9305578cd05fe76049fa343f1a9286632b2593d32309b0e86c4036309","observation_id":"3abdfbb6-70dc-4865-911b-0298245f82c0","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":null,"venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:c3a96881e69e4517c41f53f51bb15d9f536282a4efd6831d7c92422375a0f22c","observation_id":"c776c739-79c4-4ebb-ae8d-9a6842381609","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":null,"venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:9a8b29c5d3f3d37daf0e40e1101ad88b9103802fb245a5b9867a3668d3713c82","observation_id":"38b75d0f-eb17-4b32-b964-9f8d73e65095","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:f9328479df1824e2e350067518b09997831890bb31f1cb479654d081297eac84","observation_id":"faa727ea-8eb8-4d8c-b0b8-8f60dd299bf4","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":"(eds.) Stochastic Network Design, pp","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:d5b54be4af340d39e7961dce8af5eb054051d5ae8db6195467c09a78a37b80bc","observation_id":"77b72612-3b3e-4b8a-b3cc-36f5eb3c7195","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:20ec2f66be196bbeae2a2b5fa327dbdfd69c06820786333f0839f046607b914f","observation_id":"3b651790-03a6-42d6-8d2b-999ba54cb9d8","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:44f16f53939e122a041bf91b1ffe00ea9a2bfd44886570baabe038d66ea4e161","observation_id":"1b1c36b3-b172-4596-b664-8ef0b6c34beb","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:c2d0d218ed9999b68f2192d8b2db9da4bfa51eed7fcd9c35de7ea62bfffd9fe4","observation_id":"98e39f41-85ce-415d-b9f0-aedd0c55a04f","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":"INFOR: Inf","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:c51d3c208da7b643d29b209dd420dcd40b04b7a6bfea50c4c64c8e63ab8d61e8","observation_id":"36fe882e-38a8-447b-9552-e65052fa40e0","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":"(eds.) Barycentric approximation shcheme","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:f6323aa721efce6558a28055a2a8db6f7b1e41c63abd18314257e25f236daeb7","observation_id":"d93d9b06-eec2-4112-a7d2-463d42da122a","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":null,"venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:079d5b1700430992561a6735e067e03d6167005042cced43a117b4bb1052edc8","observation_id":"4904001e-415a-46bf-8b89-410608ddba6c","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:511be4e3c9a4897cfa1ee23db0d7d26b358a4a1f167119f0e36302f2558beca3","observation_id":"935c2ae8-a4bf-4755-8c18-9df168c80500","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:5338b52fc589d302518cf6c58f5618c0cd1a5ec4370a4a4081fcbeca940c5100","observation_id":"04d6ff1d-64de-4676-aabe-3621162f0a88","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:6be126fa62cfdef9cfb64909217225726aa323adb244e1c08c6732f4085c8050","observation_id":"03c3c763-d2d6-4898-9b07-26aa6d46e920","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:f608ab80be0372fdaa55c8881070dd874721dc66faa18a31b2456889bd1afaf2","observation_id":"60448624-44d0-4e23-b6cc-1243e1d895d3","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":"In preparation (2026)","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:6f78f2d40dc6f8e14974f6ad898a3660beb1909a9a031e7db10366e6f2c1f300","observation_id":"24f5e9d9-ec7e-477a-8ff3-fc1097d88a09","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":"(eds.) Public Transportation, pp","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:0db374157c294da1f0ea4414db169eca9ee30948ae3a28d0b85bc72ca92748d5","observation_id":"08a293da-a96e-48f1-9bf7-8d94d61c154d","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:ad32dbe5d3643d2f4e4eadf80289c4ad92fd74c10704941b08c3e36b1ed80e07","observation_id":"a7f3ea2a-8d9e-4fab-82ef-1cd926afba48","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:eaa7683b20da769f4b014502e40615c28405ca01ac967d2c7708ca985a33af58","observation_id":"ef0908c8-fa11-4b40-aa11-bc4ea491bfca","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:e4ae5a9134a6cf90bc49e3338a56fcf3a435bbf4539ea89028ae35517293f39d","observation_id":"c74ed794-00cb-44cf-aaba-b83bfaf0c338","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":"I n preparation (2026)","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:1ed433ba6260ffab8dfcc140bdf7a6f2b2c634ccf17c82b94d23696478b8ca09","observation_id":"b0a0b622-aa4d-47f3-a15f-b2d8e9a5a9fe","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:d8693d01febcbae2db3cd20f9ea3812c59cf7eb7df092dead79952dcfec12756","observation_id":"edd7e633-bfcc-4fa5-9eeb-77b2e8fd9d91","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:4ab663badbf968c1a1009c67a891d25858e795f073dbf78438e8a70179203474","observation_id":"832746fd-ed63-4160-8128-3d018a5dfbcb","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:d9b0886640a6a1afd20f5ed185973e235dfd5f19392d49a33f5394cf0fcdaa5b","observation_id":"c90910d1-0f04-47ec-bdc5-d5722363ce96","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":"INFORMS J","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:532574437c73a7c7b9d56a1471ec017d5cbe4eff2806f2a039f2057eb2e14285","observation_id":"00678065-3b8d-4869-b70b-9ffb368cfc1d","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:2b5f10482730ff042131895acfd8765ab144f3e3fa61da631397a681d2593e66","observation_id":"3a8f9741-1fa6-4e43-949c-7c2c8dd1bd11","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:d3bd565d9a8ad441ef1dbcc2e0ac1934538cd720c73bf00a2a3cb02a384a614f","observation_id":"ecdd798e-efa1-49a0-8624-2eac01378fb4","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:d0c4d6a0d98c45e1dca48fc645582a9a2707eaee9866d72c35144f43a7fd5908","observation_id":"6b0c743f-01b5-4a42-b652-794778728da3","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":null,"venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:c9dac17ae8f6caedb42a9f708459e003042f014619a38c842ef3a58e172dc41d","observation_id":"0d7b2009-3e8c-4736-82b2-2ba67f19c4d3","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":null,"venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:7a4456b6d7871300df786ea2581b6bf37d4f546745746b173e1d6a63a399b5be","observation_id":"20ba054a-e553-4962-b027-d792d2590f92","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:d445eb27c2973642427e23a0504edc98e11dfbf76fcca3d615cb5342dbbf1556","observation_id":"3e6b4eaa-df98-4e64-8098-421fbd23c4b0","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":"(ed.) Risk Aversion in Two-Stage S tochastic Integer Programming, pp","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:5d278c8feb2bae8df9fb49e0ca27a5c2dd936fd36a5ffee00775b3cc16d72310","observation_id":"f3c687d2-e41c-4c22-b588-23023de5bc3a","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:28273afbd95901093a3fb185fa75ca4480ec96d6a8e70e258d8b84113154727a","observation_id":"ec03b39c-485d-46ea-88a5-af75fb5cf23b","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":"INFORMS J","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:8ab0f1736640697a6cd809eaf7d599d424cde942fc6e11ed29501c3b43554039","observation_id":"2fbdbef7-bba2-464e-8b37-d3d6de081da2","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:9b82b632e9ee5ecd51c3b212791f852749be1d8bf1628a33d529147fa2e9646d","observation_id":"b3be313e-f791-46e2-89a9-af42257f3269","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:b6dd085adacfab310d60c0665c4790f4697bc877070715a2206ddd66d2c71c13","observation_id":"930ba24e-7434-4b6d-ade9-8e088b6995b7","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:eb7f5e1ed7597622d81e84d12c8634c676cc5636f82fad161c9ef41ce3d7c12b","observation_id":"3eb37eca-1bc6-41e5-81de-866b93918493","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":null,"venue":null,"work_id":null,"year":1969},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:15be562789c0ccc48cd68871ef902d2c85f861512d1fb1a551f1e2106f73e390","observation_id":"6048a426-f7d4-4cb8-9e72-427bb7572910","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:5e0aa28824ff78c2ad2e1c77446cac20f1d6700a01f7c91f6a04006ed5454de3","observation_id":"e772ebfc-07ad-4773-81da-83068df2dfab","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:29:35.451850Z","title":"INFORMS J","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-06-28T13:29:35.451850Z"},"links":{"citing_paper":"/paper/2606.02469"},"observation_digest":"sha256:83371dca315eb1f4cd2c1ed4c0c7522e100805ae8b917c52b75bbc58ad57fc44","observation_id":"7f3874cc-f1b6-4c4f-877b-79a1f0b7947d","resolution":{"observed_at":"2026-06-28T13:29:35.451850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.02469","last_updated":"2026-06-01T16:41:09Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-07T07:59:17.333687Z","submitted_at":"2026-06-01T16:41:09Z","title":"A novel L-shaped refinement chain cuts method for two-stage stochastic programs"},"reference_resolution":{"displayed":59,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":59,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":59},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 59 of 59 outbound references and 0 inbound Pith citation observations for arXiv:2606.02469."}