{"as_of":"2026-08-14T01:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:93e8c5f0023520e7b08a120076b56c99e66f523b2a83fd8130d193ce616b1043","coverage":[{"denominator":37,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":37,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T22:13:07.306246Z","state":"measured"},{"denominator":40,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":40,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T19:50:34.156938Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-09T19:50:34.404053Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.03860","last_updated":"2025-07-24T16:02:16Z","snapshot_observed_at":"2026-08-11T21:57:42.238763Z","submitted_at":"2024-12-05T04:12:20Z","title":"Combinatorial Selection with Costly Information","version":2},"cited_work":{"arxiv_id":"2412.03860","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.03860","snapshot_observed_at":"2026-08-09T19:50:34.404053Z","title":"Combinatorial Selection with Costly Information","venue":"cs.DS","work_id":"336c2ca8-ca3d-48c7-bf65-b6731ac0d653","year":2024},"citing_paper":{"arxiv_id":"2502.00228","last_updated":"2025-01-31T23:56:42Z","snapshot_observed_at":"2026-08-10T21:26:56.867506Z","submitted_at":"2025-01-31T23:56:42Z","title":"Markovian Pandora's box","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-09T19:50:34.156938Z"},"links":{"cited_paper":"/paper/2412.03860","citing_paper":"/paper/2502.00228"},"observation_digest":"sha256:0e2f07d80bc96a77421279880ae6587d44c6ee7aa6f338c949c4a24722d65079","observation_id":"ae47ac90-96f8-4727-8a58-40f99008c4c6","resolution":{"observed_at":"2026-08-09T19:50:34.411829Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.03860","last_updated":"2025-07-24T16:02:16Z","snapshot_observed_at":"2026-08-11T21:57:42.238763Z","submitted_at":"2024-12-05T04:12:20Z","title":"Combinatorial Selection with Costly Information","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.03860","snapshot_observed_at":"2026-08-07T04:20:26.909406Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10872","last_updated":"2025-08-01T22:10:35Z","snapshot_observed_at":"2026-08-10T21:24:33.891894Z","submitted_at":"2025-06-12T16:38:51Z","title":"The Gittins Index: A Design Principle for Decision-Making Under Uncertainty","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T04:20:26.909406Z"},"links":{"cited_paper":"/paper/2412.03860","citing_paper":"/paper/2506.10872"},"observation_digest":"sha256:5753c687b0e9d9e737ea4ae44d7f895fa9bdfa53f982294f9def8af36b8487f0","observation_id":"a10e1aaa-6647-4e1e-8e34-ee92643ae322","resolution":{"observed_at":"2026-08-07T04:20:26.909406Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.03860","last_updated":"2025-07-24T16:02:16Z","snapshot_observed_at":"2026-08-11T21:57:42.238763Z","submitted_at":"2024-12-05T04:12:20Z","title":"Combinatorial Selection with Costly Information","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.03860","snapshot_observed_at":"2026-08-04T14:56:59.845877Z","title":"Combinatorial selection with costly information","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-10T00:59:10.624197Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-04T14:56:59.845877Z"},"links":{"cited_paper":"/paper/2412.03860","citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:4349e7ceef48b24559cbc876cbf4bfd7cc04f73b66985a72f204d300e1cca6b5","observation_id":"f2715cd3-318b-4df7-85da-8750894a6c30","resolution":{"observed_at":"2026-08-04T14:56:59.845877Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2412.03860/citation-record","integrity":"/paper/2412.03860/integrity","json":"/paper/2412.03860/citation-record.json","paper":"/paper/2412.03860"},"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-11T22:13:08.041433Z","title":"The pandora's box problem with sequential inspections","venue":null,"work_id":"fa97ea99-5088-41ef-a0c2-0e2a4c74fdb6","year":2020},"citing_paper":{"arxiv_id":"2412.03860","last_updated":"2025-07-24T16:02:16Z","snapshot_observed_at":"2026-08-11T21:57:42.238763Z","submitted_at":"2024-12-05T04:12:20Z","title":"Combinatorial Selection with Costly Information","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-11T22:13:07.146025Z"},"links":{"citing_paper":"/paper/2412.03860"},"observation_digest":"sha256:0f2c3567cf9ba86a3a3733ac21f49f7b788a7f7b39d5a4b98b5e08ff8e5735df","observation_id":"705ee1af-6059-45bc-bed0-a1cc61b87572","resolution":{"observed_at":"2026-08-11T22:13:08.046220Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T22:13:08.027282Z","title":"Maximizing stochastic monotone submodular functions","venue":null,"work_id":"fe4a2a36-5754-4e86-b135-3bdcb0faae8a","year":2016},"citing_paper":{"arxiv_id":"2412.03860","last_updated":"2025-07-24T16:02:16Z","snapshot_observed_at":"2026-08-11T21:57:42.238763Z","submitted_at":"2024-12-05T04:12:20Z","title":"Combinatorial Selection with Costly Information","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-11T22:13:07.151726Z"},"links":{"citing_paper":"/paper/2412.03860"},"observation_digest":"sha256:fbf2bf7c2c0430a4e46f5289eac126bbe61866537bb13edf80e21f4917be9eb1","observation_id":"4cf416b4-216f-4c83-ad60-7849f67d958f","resolution":{"observed_at":"2026-08-11T22:13:08.031945Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T22:13:08.013206Z","title":"Pandora's problem with combinatorial cost","venue":null,"work_id":"ddfaa4e7-3ada-44da-ba8d-695fe470726d","year":2023},"citing_paper":{"arxiv_id":"2412.03860","last_updated":"2025-07-24T16:02:16Z","snapshot_observed_at":"2026-08-11T21:57:42.238763Z","submitted_at":"2024-12-05T04:12:20Z","title":"Combinatorial Selection with Costly Information","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-11T22:13:07.156275Z"},"links":{"citing_paper":"/paper/2412.03860"},"observation_digest":"sha256:75614162b8e0679140087d0cd4d001689ac17a82b26ba90a9413b367e4cec41b","observation_id":"153c2c94-c5f9-494a-8210-efb16574e576","resolution":{"observed_at":"2026-08-11T22:13:08.017807Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T22:13:07.998653Z","title":"Approximately-optimal mechanisms in auction design, search theory, and matching markets","venue":null,"work_id":"24503c13-9934-4c51-88a7-3694b8926c88","year":2019},"citing_paper":{"arxiv_id":"2412.03860","last_updated":"2025-07-24T16:02:16Z","snapshot_observed_at":"2026-08-11T21:57:42.238763Z","submitted_at":"2024-12-05T04:12:20Z","title":"Combinatorial Selection with Costly Information","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-11T22:13:07.161161Z"},"links":{"citing_paper":"/paper/2412.03860"},"observation_digest":"sha256:df4e85b8fe8e01cab5a4cf9a70fb8f1784fe8af0ef4f3a480eb3700951e61e74","observation_id":"4c679664-44bc-42af-ab17-38659a3c695e","resolution":{"observed_at":"2026-08-11T22:13:08.003421Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T22:13:07.983472Z","title":"Pandora’s problem with nonobligatory inspection: Optimal structure and a PTAS","venue":null,"work_id":"2c576ef3-1001-4475-a93d-80e5ed159da0","year":2022},"citing_paper":{"arxiv_id":"2412.03860","last_updated":"2025-07-24T16:02:16Z","snapshot_observed_at":"2026-08-11T21:57:42.238763Z","submitted_at":"2024-12-05T04:12:20Z","title":"Combinatorial Selection with Costly Information","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-11T22:13:07.165529Z"},"links":{"citing_paper":"/paper/2412.03860"},"observation_digest":"sha256:bd8060d524a6f01ac46203c3952789cc1115fb34da64b015cb32d82e7e19689a","observation_id":"72aba046-118e-4ca6-825d-a8d9bdecfc77","resolution":{"observed_at":"2026-08-11T22:13:07.988290Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T22:13:07.968526Z","title":"Recent developments in pandora's box problem: Variants and applications","venue":null,"work_id":"27c11381-2b62-465c-a72f-76f450a7e25b","year":2024},"citing_paper":{"arxiv_id":"2412.03860","last_updated":"2025-07-24T16:02:16Z","snapshot_observed_at":"2026-08-11T21:57:42.238763Z","submitted_at":"2024-12-05T04:12:20Z","title":"Combinatorial Selection with Costly Information","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-11T22:13:07.169856Z"},"links":{"citing_paper":"/paper/2412.03860"},"observation_digest":"sha256:978c0dbec9fa49cabe86d7cffc28a876177d1c7e82c2ea2935a0f76aeac7fcb6","observation_id":"8533f26f-6bd0-4d57-9abb-aa375746e4aa","resolution":{"observed_at":"2026-08-11T22:13:07.973579Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T22:13:07.952626Z","title":"Kleinberg","venue":null,"work_id":"31c21685-106b-4161-9068-4a20cd4f781a","year":2019},"citing_paper":{"arxiv_id":"2412.03860","last_updated":"2025-07-24T16:02:16Z","snapshot_observed_at":"2026-08-11T21:57:42.238763Z","submitted_at":"2024-12-05T04:12:20Z","title":"Combinatorial Selection with Costly Information","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-11T22:13:07.174689Z"},"links":{"citing_paper":"/paper/2412.03860"},"observation_digest":"sha256:cde06b7eb287f79b97a0a367a6d79144174dfa80684e74850a4a363d64b7e73f","observation_id":"92d63b79-9a9e-409f-ac34-dc6f46b0a355","resolution":{"observed_at":"2026-08-11T22:13:07.957979Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T22:13:07.937497Z","title":"Pandora's box problem with order constraints","venue":null,"work_id":"79be26d0-37e0-4812-88d5-1394924cab17","year":2020},"citing_paper":{"arxiv_id":"2412.03860","last_updated":"2025-07-24T16:02:16Z","snapshot_observed_at":"2026-08-11T21:57:42.238763Z","submitted_at":"2024-12-05T04:12:20Z","title":"Combinatorial Selection with Costly Information","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-11T22:13:07.178729Z"},"links":{"citing_paper":"/paper/2412.03860"},"observation_digest":"sha256:52adadecd5ae1cc2d969daff66afd292c7beaf6f791b85a4d0bb703cfe187303","observation_id":"d3fb455c-b0aa-4d77-8c93-0fb5ed8c1e38","resolution":{"observed_at":"2026-08-11T22:13:07.942124Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.08711","last_updated":"2024-11-06T19:22:50Z","snapshot_observed_at":"2026-08-12T23:44:03.952482Z","submitted_at":"2024-06-13T00:25:36Z","title":"Matching with Nested and Bundled Pandora Boxes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.08711","snapshot_observed_at":"2026-08-11T22:13:07.183809Z","title":"Matching with nested and bundled pandora boxes","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.03860","last_updated":"2025-07-24T16:02:16Z","snapshot_observed_at":"2026-08-11T21:57:42.238763Z","submitted_at":"2024-12-05T04:12:20Z","title":"Combinatorial Selection with Costly Information","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-11T22:13:07.183809Z"},"links":{"cited_paper":"/paper/2406.08711","citing_paper":"/paper/2412.03860"},"observation_digest":"sha256:ebdc75b812ae46eff81dbe42b96cf5996ff74bbfa090da6124039e6072eb304d","observation_id":"84920b89-44b6-41e9-abc0-a6dab802505c","resolution":{"observed_at":"2026-08-11T22:13:07.183809Z","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-11T22:13:07.921923Z","title":"High-welfare matching markets via descending price","venue":null,"work_id":"b0628d3c-7288-48d0-820a-bc31d145a8e9","year":2023},"citing_paper":{"arxiv_id":"2412.03860","last_updated":"2025-07-24T16:02:16Z","snapshot_observed_at":"2026-08-11T21:57:42.238763Z","submitted_at":"2024-12-05T04:12:20Z","title":"Combinatorial Selection with Costly Information","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-11T22:13:07.188852Z"},"links":{"citing_paper":"/paper/2412.03860"},"observation_digest":"sha256:803e2613bd258d6082e21cfa4af342c46ace2f2490ef1916fa4694f9ea11815c","observation_id":"e587b322-20c1-430f-b1e6-b28701108557","resolution":{"observed_at":"2026-08-11T22:13:07.927294Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2502.08976","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:13:07.539476Z","title":"Prophet inequalities for bandits, cabinets, and dags","venue":null,"work_id":"c122b730-7d13-47c3-a70e-f0578c6bc0b2","year":2025},"citing_paper":{"arxiv_id":"2412.03860","last_updated":"2025-07-24T16:02:16Z","snapshot_observed_at":"2026-08-11T21:57:42.238763Z","submitted_at":"2024-12-05T04:12:20Z","title":"Combinatorial Selection with Costly Information","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-11T22:13:07.193218Z"},"links":{"citing_paper":"/paper/2412.03860"},"observation_digest":"sha256:1db1764dbe956c4d2c2fd0a5cf6fa856cab89a8537ddfcb0c9e9bfbba4c9b536","observation_id":"59e64326-e378-45d4-a69a-dfebd0e03d0f","resolution":{"observed_at":"2026-08-11T22:13:07.549728Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T22:13:07.906959Z","title":"Optimal sequential exploration: Bandits, clairvoyants, and wildcats","venue":null,"work_id":"5a864cb3-9757-42fc-bb5b-b19b2b3157f9","year":2013},"citing_paper":{"arxiv_id":"2412.03860","last_updated":"2025-07-24T16:02:16Z","snapshot_observed_at":"2026-08-11T21:57:42.238763Z","submitted_at":"2024-12-05T04:12:20Z","title":"Combinatorial Selection with Costly Information","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-11T22:13:07.197492Z"},"links":{"citing_paper":"/paper/2412.03860"},"observation_digest":"sha256:5c0a902c914246c0264b672ae757d01ed6018bf7dd693c3ca1a3bade1034602f","observation_id":"c87c21e4-a8c4-4416-a9ae-e791a97c2e78","resolution":{"observed_at":"2026-08-11T22:13:07.911866Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T22:13:07.889993Z","title":"Pandora's box with correlations: Learning and approximation","venue":null,"work_id":"7d5262b8-a90f-4990-a423-75aa897b569f","year":2020},"citing_paper":{"arxiv_id":"2412.03860","last_updated":"2025-07-24T16:02:16Z","snapshot_observed_at":"2026-08-11T21:57:42.238763Z","submitted_at":"2024-12-05T04:12:20Z","title":"Combinatorial Selection with Costly Information","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-11T22:13:07.201585Z"},"links":{"citing_paper":"/paper/2412.03860"},"observation_digest":"sha256:89fbcefbf6ad5e60a925045721363247b916c99e0498f8434d99ba80bb4d310a","observation_id":"cc86b726-e38f-4b52-b05d-ec3d96476864","resolution":{"observed_at":"2026-08-11T22:13:07.895960Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T22:13:07.874029Z","title":"Approximating pandora's box with correlations","venue":null,"work_id":"d7eeeea9-f6bb-4969-b5f9-c04ae49012a9","year":2021},"citing_paper":{"arxiv_id":"2412.03860","last_updated":"2025-07-24T16:02:16Z","snapshot_observed_at":"2026-08-11T21:57:42.238763Z","submitted_at":"2024-12-05T04:12:20Z","title":"Combinatorial Selection with Costly Information","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-11T22:13:07.205672Z"},"links":{"citing_paper":"/paper/2412.03860"},"observation_digest":"sha256:5fd99ce965530a644c383583641015a722edc664ac5f2980de14d62ccc9eb8c3","observation_id":"fdab0af9-7b54-403c-8e96-862989d5de42","resolution":{"observed_at":"2026-08-11T22:13:07.878786Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T22:13:07.209862Z","title":"Whether or not to open pandora's box","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.03860","last_updated":"2025-07-24T16:02:16Z","snapshot_observed_at":"2026-08-11T21:57:42.238763Z","submitted_at":"2024-12-05T04:12:20Z","title":"Combinatorial Selection with Costly Information","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-11T22:13:07.209862Z"},"links":{"citing_paper":"/paper/2412.03860"},"observation_digest":"sha256:a7d7c86e38a15ef83d7be01d7fb28c25d3d1b52f7e4b19bc17c9c28ce433338b","observation_id":"5dc3a72c-67c1-4a49-9913-eb32e384f9f2","resolution":{"observed_at":"2026-08-11T22:13:07.209862Z","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-11T22:13:07.849128Z","title":"On playing golf with two balls","venue":null,"work_id":"2cb46652-1d49-42c3-be5b-97957196fd83","year":2003},"citing_paper":{"arxiv_id":"2412.03860","last_updated":"2025-07-24T16:02:16Z","snapshot_observed_at":"2026-08-11T21:57:42.238763Z","submitted_at":"2024-12-05T04:12:20Z","title":"Combinatorial Selection with Costly Information","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-11T22:13:07.214864Z"},"links":{"citing_paper":"/paper/2412.03860"},"observation_digest":"sha256:904020fc6cf510c1354ec4dbbb0999643023bc582c5cf1132e50e063a91ceb05","observation_id":"951b9d5d-2a32-4fe9-b0dc-82656f7ed9de","resolution":{"observed_at":"2026-08-11T22:13:07.854087Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T22:13:07.834172Z","title":"Online pandora's boxes and bandits","venue":null,"work_id":"5907ce6c-a80b-4f33-b490-0402776d17e5","year":2019},"citing_paper":{"arxiv_id":"2412.03860","last_updated":"2025-07-24T16:02:16Z","snapshot_observed_at":"2026-08-11T21:57:42.238763Z","submitted_at":"2024-12-05T04:12:20Z","title":"Combinatorial Selection with Costly Information","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-11T22:13:07.219125Z"},"links":{"citing_paper":"/paper/2412.03860"},"observation_digest":"sha256:6fc3c6e0b2360a81e2bf5b96fcfaabdf471065054e055a2b3d4cdcf96321fa74","observation_id":"9f65f994-83a8-44fd-8d33-ac5870df380c","resolution":{"observed_at":"2026-08-11T22:13:07.838810Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T22:13:07.818914Z","title":"Pandora box problem with nonobligatory inspection: Hardness and approximation scheme","venue":null,"work_id":"a23f0436-e798-455c-9b24-1443db6fc231","year":2022},"citing_paper":{"arxiv_id":"2412.03860","last_updated":"2025-07-24T16:02:16Z","snapshot_observed_at":"2026-08-11T21:57:42.238763Z","submitted_at":"2024-12-05T04:12:20Z","title":"Combinatorial Selection with Costly Information","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-11T22:13:07.223525Z"},"links":{"citing_paper":"/paper/2412.03860"},"observation_digest":"sha256:1600ecad60bdbd6aa1d46aaaa0710a43cc8b62d420a1c024bf3ed7f8ad3cc157","observation_id":"e16e7607-66bd-4ca9-a99b-1f6a18cd0e3f","resolution":{"observed_at":"2026-08-11T22:13:07.824172Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T22:13:07.803328Z","title":"Stochastic Finance - An Introduction in Discrete Time","venue":null,"work_id":"ee70ff23-3bec-4d6f-b555-c2f02b5bf9fc","year":2016},"citing_paper":{"arxiv_id":"2412.03860","last_updated":"2025-07-24T16:02:16Z","snapshot_observed_at":"2026-08-11T21:57:42.238763Z","submitted_at":"2024-12-05T04:12:20Z","title":"Combinatorial Selection with Costly Information","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-11T22:13:07.228347Z"},"links":{"citing_paper":"/paper/2412.03860"},"observation_digest":"sha256:10280f20225431c7a712e37064a85702351eee073591e8ed3c23209c4644d75c","observation_id":"1eaaf0fa-6fb7-4af5-bf94-680d65248453","resolution":{"observed_at":"2026-08-11T22:13:07.808313Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T22:13:07.788081Z","title":"Weitzman's rule for pandora's box with correlations","venue":null,"work_id":"3adb70d9-9b5d-4060-91c2-a22ba4c420e5","year":2024},"citing_paper":{"arxiv_id":"2412.03860","last_updated":"2025-07-24T16:02:16Z","snapshot_observed_at":"2026-08-11T21:57:42.238763Z","submitted_at":"2024-12-05T04:12:20Z","title":"Combinatorial Selection with Costly Information","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-11T22:13:07.232824Z"},"links":{"citing_paper":"/paper/2412.03860"},"observation_digest":"sha256:901d7940ab78729e7bb727370ce705c42e3cc6cee1534f326e2d4430edc5fdc1","observation_id":"77cb49d9-f360-4c6d-88fe-bc673f2ad7c9","resolution":{"observed_at":"2026-08-11T22:13:07.793089Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T22:13:07.773015Z","title":"Bandit processes and dynamic allocation indices","venue":null,"work_id":"b9f0b360-aa6f-4f35-930b-26c44f5276df","year":1979},"citing_paper":{"arxiv_id":"2412.03860","last_updated":"2025-07-24T16:02:16Z","snapshot_observed_at":"2026-08-11T21:57:42.238763Z","submitted_at":"2024-12-05T04:12:20Z","title":"Combinatorial Selection with Costly Information","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-11T22:13:07.236865Z"},"links":{"citing_paper":"/paper/2412.03860"},"observation_digest":"sha256:ee24ce736f6cd498c70e5fd39f3e96907e8a0134b59bc68629d7b349aefbbf03","observation_id":"8c8318ef-135d-4620-bf9e-0e4858581a7f","resolution":{"observed_at":"2026-08-11T22:13:07.778091Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T22:13:07.758705Z","title":"Glazebrook","venue":null,"work_id":"b57f98a4-c8e7-48b6-8ed3-a7d35f2f4653","year":1982},"citing_paper":{"arxiv_id":"2412.03860","last_updated":"2025-07-24T16:02:16Z","snapshot_observed_at":"2026-08-11T21:57:42.238763Z","submitted_at":"2024-12-05T04:12:20Z","title":"Combinatorial Selection with Costly Information","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-11T22:13:07.241113Z"},"links":{"citing_paper":"/paper/2412.03860"},"observation_digest":"sha256:950ea114d52d3002172f2cbb889e84ee8c7e94e937cd870a55af20c4becd1e0c","observation_id":"816ef19e-6beb-4d4d-bd86-3ab5e10dfeb4","resolution":{"observed_at":"2026-08-11T22:13:07.763615Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"0804.1724","last_updated":"2008-04-10T14:53:30Z","snapshot_observed_at":"2026-07-06T01:36:35.722839Z","submitted_at":"2008-04-10T14:53:30Z","title":"Information Acquisition and Exploitation in Multichannel Wireless Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0804.1724","snapshot_observed_at":"2026-08-11T22:13:07.245359Z","title":"Information acquisition and exploitation in multichannel wireless networks","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2412.03860","last_updated":"2025-07-24T16:02:16Z","snapshot_observed_at":"2026-08-11T21:57:42.238763Z","submitted_at":"2024-12-05T04:12:20Z","title":"Combinatorial Selection with Costly Information","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-11T22:13:07.245359Z"},"links":{"cited_paper":"/paper/0804.1724","citing_paper":"/paper/2412.03860"},"observation_digest":"sha256:f76451fd4cd1a58fa5a32b7a0f86abca6008f212d68b2aee3d0ac8b5b6131ee6","observation_id":"dc3e3649-c242-47c5-9978-9762f7a4d543","resolution":{"observed_at":"2026-08-11T22:13:07.245359Z","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-11T22:13:07.744649Z","title":"The Markovian Price of Information","venue":null,"work_id":"336418c0-0630-4669-993b-e928f2f18a50","year":2019},"citing_paper":{"arxiv_id":"2412.03860","last_updated":"2025-07-24T16:02:16Z","snapshot_observed_at":"2026-08-11T21:57:42.238763Z","submitted_at":"2024-12-05T04:12:20Z","title":"Combinatorial Selection with Costly Information","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-11T22:13:07.250012Z"},"links":{"citing_paper":"/paper/2412.03860"},"observation_digest":"sha256:a66629f2017eb57476c80c3ce8d2a451fe70d4a384b1aa8cf6e029daa5d16fe2","observation_id":"6c215309-5f96-4cf0-9579-8c553ef5efd5","resolution":{"observed_at":"2026-08-11T22:13:07.749158Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T22:13:07.730185Z","title":null,"venue":null,"work_id":"5b28a6e1-6eb4-41a9-afcd-d4183c916658","year":2015},"citing_paper":{"arxiv_id":"2412.03860","last_updated":"2025-07-24T16:02:16Z","snapshot_observed_at":"2026-08-11T21:57:42.238763Z","submitted_at":"2024-12-05T04:12:20Z","title":"Combinatorial Selection with Costly Information","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-11T22:13:07.254028Z"},"links":{"citing_paper":"/paper/2412.03860"},"observation_digest":"sha256:52e7939c3dda4920303c18ab9c6a20d7f74bd5dbef0dac148dc74ec8ce6489b3","observation_id":"3e1821cc-6813-4af6-913d-96eb5d7f72f8","resolution":{"observed_at":"2026-08-11T22:13:07.734896Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T22:13:07.715218Z","title":"Threshold Testing and Semi-Online Prophet Inequalities","venue":null,"work_id":"67d34112-69f7-4297-8671-74d002bcd00e","year":2023},"citing_paper":{"arxiv_id":"2412.03860","last_updated":"2025-07-24T16:02:16Z","snapshot_observed_at":"2026-08-11T21:57:42.238763Z","submitted_at":"2024-12-05T04:12:20Z","title":"Combinatorial Selection with Costly Information","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-11T22:13:07.258577Z"},"links":{"citing_paper":"/paper/2412.03860"},"observation_digest":"sha256:9dae9a1d6df2ab6198086958d5025eedb2653a9170d368b4e413916726f78089","observation_id":"c18a8276-f5af-4c79-9eaa-be031eccf545","resolution":{"observed_at":"2026-08-11T22:13:07.719897Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T22:13:07.700787Z","title":"Stochastic probing with increasing precision","venue":null,"work_id":"d9699ae7-9de2-4322-8f20-1654b690660b","year":2024},"citing_paper":{"arxiv_id":"2412.03860","last_updated":"2025-07-24T16:02:16Z","snapshot_observed_at":"2026-08-11T21:57:42.238763Z","submitted_at":"2024-12-05T04:12:20Z","title":"Combinatorial Selection with Costly Information","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-11T22:13:07.262720Z"},"links":{"citing_paper":"/paper/2412.03860"},"observation_digest":"sha256:df184336c77ea459d17f238b1a549a76f83d8201edca248f6ebb448bcb41e705","observation_id":"59cb3c83-2016-4a88-8bc5-48c0b2820f42","resolution":{"observed_at":"2026-08-11T22:13:07.705779Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T22:13:07.685644Z","title":"Ke and J","venue":null,"work_id":"272c688e-df5f-4787-9d51-f0074dae6d95","year":2019},"citing_paper":{"arxiv_id":"2412.03860","last_updated":"2025-07-24T16:02:16Z","snapshot_observed_at":"2026-08-11T21:57:42.238763Z","submitted_at":"2024-12-05T04:12:20Z","title":"Combinatorial Selection with Costly Information","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-11T22:13:07.267557Z"},"links":{"citing_paper":"/paper/2412.03860"},"observation_digest":"sha256:559a680e83f54089442b98a0915348e1c3c2415449abdb95d0c02e6e1e64645f","observation_id":"683532da-90bd-45cb-b2bb-021ba5cf7360","resolution":{"observed_at":"2026-08-11T22:13:07.690214Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T22:13:07.669059Z","title":"Glen Weyl","venue":null,"work_id":"990944e9-c040-4fe1-8d81-8ffd29244440","year":2016},"citing_paper":{"arxiv_id":"2412.03860","last_updated":"2025-07-24T16:02:16Z","snapshot_observed_at":"2026-08-11T21:57:42.238763Z","submitted_at":"2024-12-05T04:12:20Z","title":"Combinatorial Selection with Costly Information","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-11T22:13:07.271707Z"},"links":{"citing_paper":"/paper/2412.03860"},"observation_digest":"sha256:81a7a253e3e33a93d7b4790d5d653d2931962dafd88280d7ff5b751b75c88c37","observation_id":"9aaff1a3-393c-4419-abff-629a95988c1d","resolution":{"observed_at":"2026-08-11T22:13:07.674703Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T22:13:07.653326Z","title":null,"venue":null,"work_id":"f791814b-5ef0-4a39-b814-367be2a05153","year":1973},"citing_paper":{"arxiv_id":"2412.03860","last_updated":"2025-07-24T16:02:16Z","snapshot_observed_at":"2026-08-11T21:57:42.238763Z","submitted_at":"2024-12-05T04:12:20Z","title":"Combinatorial Selection with Costly Information","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-11T22:13:07.275917Z"},"links":{"citing_paper":"/paper/2412.03860"},"observation_digest":"sha256:de9ae886ff264b07419a479a0ba893028468519c2db7d4fc9b2fddc3b98e6828","observation_id":"7fb54b49-ded3-44fa-9970-15a4a306ff78","resolution":{"observed_at":"2026-08-11T22:13:07.657747Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T22:13:07.639238Z","title":null,"venue":null,"work_id":"b7049e13-476e-43a7-b7cc-30440fa71b13","year":2015},"citing_paper":{"arxiv_id":"2412.03860","last_updated":"2025-07-24T16:02:16Z","snapshot_observed_at":"2026-08-11T21:57:42.238763Z","submitted_at":"2024-12-05T04:12:20Z","title":"Combinatorial Selection with Costly Information","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-11T22:13:07.279909Z"},"links":{"citing_paper":"/paper/2412.03860"},"observation_digest":"sha256:f7dab99d3c3a658b6c5d50665615b1906d18af02cdb6041098ebc1b5673c1fa1","observation_id":"31802202-8392-4904-84ba-df7349ae9292","resolution":{"observed_at":"2026-08-11T22:13:07.643497Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.19011","last_updated":"2025-01-16T06:11:58Z","snapshot_observed_at":"2026-08-12T22:17:24.142520Z","submitted_at":"2024-10-22T17:10:06Z","title":"Local hedging approximately solves Pandora's box problems with nonobligatory inspection","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.19011","snapshot_observed_at":"2026-08-11T22:13:07.283988Z","title":"Local hedging approximately solves pandora’s box problems with optional inspection","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.03860","last_updated":"2025-07-24T16:02:16Z","snapshot_observed_at":"2026-08-11T21:57:42.238763Z","submitted_at":"2024-12-05T04:12:20Z","title":"Combinatorial Selection with Costly Information","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-11T22:13:07.283988Z"},"links":{"cited_paper":"/paper/2410.19011","citing_paper":"/paper/2412.03860"},"observation_digest":"sha256:357cc943c81df98f1ec7e4f6707efd3afead70550e1653393885dd0d333a9c8f","observation_id":"53007a3e-064f-4d87-a160-0057def23c17","resolution":{"observed_at":"2026-08-11T22:13:07.283988Z","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-11T22:13:07.624728Z","title":"The price of information in combinatorial optimization","venue":null,"work_id":"eeb2238e-db91-4cf7-b348-56f295393d65","year":2017},"citing_paper":{"arxiv_id":"2412.03860","last_updated":"2025-07-24T16:02:16Z","snapshot_observed_at":"2026-08-11T21:57:42.238763Z","submitted_at":"2024-12-05T04:12:20Z","title":"Combinatorial Selection with Costly Information","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-11T22:13:07.288636Z"},"links":{"citing_paper":"/paper/2412.03860"},"observation_digest":"sha256:057b339c5dad9eb22c53a360700ddb9b8fca4ac3721ecd80c34290c290258736","observation_id":"edb4a88c-f473-4e18-a849-0911f2a28d56","resolution":{"observed_at":"2026-08-11T22:13:07.629175Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T22:13:07.609813Z","title":"Strassen","venue":null,"work_id":"9cdff390-05c2-4245-9c77-34cfc6604a58","year":1965},"citing_paper":{"arxiv_id":"2412.03860","last_updated":"2025-07-24T16:02:16Z","snapshot_observed_at":"2026-08-11T21:57:42.238763Z","submitted_at":"2024-12-05T04:12:20Z","title":"Combinatorial Selection with Costly Information","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-11T22:13:07.292849Z"},"links":{"citing_paper":"/paper/2412.03860"},"observation_digest":"sha256:3dd462b21a7a8b587c57ddc5d44f277d5c4f7ae30dc79aa117ee9cf2275df577","observation_id":"4d271d79-0e24-4372-a7b9-86d470b19a6e","resolution":{"observed_at":"2026-08-11T22:13:07.614738Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T22:13:07.596103Z","title":"On the Gittins Index for Multiarmed Bandits","venue":null,"work_id":"9f60b0e0-140b-41a5-b010-ce1a444191b0","year":1992},"citing_paper":{"arxiv_id":"2412.03860","last_updated":"2025-07-24T16:02:16Z","snapshot_observed_at":"2026-08-11T21:57:42.238763Z","submitted_at":"2024-12-05T04:12:20Z","title":"Combinatorial Selection with Costly Information","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-11T22:13:07.297162Z"},"links":{"citing_paper":"/paper/2412.03860"},"observation_digest":"sha256:1e6281b0ca1aa41f3bbef04d208df8c09676d15b376120354d45fe11d37d81ea","observation_id":"e5c5dd6d-36df-4230-a687-c75e84674d0f","resolution":{"observed_at":"2026-08-11T22:13:07.600614Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T22:13:07.301993Z","title":"Optimal search for the best alternative","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2412.03860","last_updated":"2025-07-24T16:02:16Z","snapshot_observed_at":"2026-08-11T21:57:42.238763Z","submitted_at":"2024-12-05T04:12:20Z","title":"Combinatorial Selection with Costly Information","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-11T22:13:07.301993Z"},"links":{"citing_paper":"/paper/2412.03860"},"observation_digest":"sha256:6783d4219e97aff0420b131c0855c7bc1ca976939b789554b48d3a5b8d289bdb","observation_id":"723bffb8-c0f6-48d3-862d-627d01aacb2f","resolution":{"observed_at":"2026-08-11T22:13:07.301993Z","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-11T22:13:07.573788Z","title":"Multi-Armed Bandits and the Gittins Index","venue":null,"work_id":"bd368dda-107c-4b00-83a4-fda72f8d9960","year":1980},"citing_paper":{"arxiv_id":"2412.03860","last_updated":"2025-07-24T16:02:16Z","snapshot_observed_at":"2026-08-11T21:57:42.238763Z","submitted_at":"2024-12-05T04:12:20Z","title":"Combinatorial Selection with Costly Information","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-11T22:13:07.306246Z"},"links":{"citing_paper":"/paper/2412.03860"},"observation_digest":"sha256:42d596093a667372d4645959680e60c05e042b8068b05986d02d8f88927e2526","observation_id":"f514b4ec-7ad9-490c-ae13-c9a36d1c1607","resolution":{"observed_at":"2026-08-11T22:13:07.578015Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.03860","last_updated":"2025-07-24T16:02:16Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-11T21:57:42.238763Z","submitted_at":"2024-12-05T04:12:20Z","title":"Combinatorial Selection with Costly Information"},"reference_resolution":{"displayed":37,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":1,"verified_fuzzy":28},"total_outbound_references":37},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 3 inbound Pith citation observations for arXiv:2412.03860."}