{"as_of":"2026-08-18T23:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:30fec023b300920fc0a85fe741c2e2f025b76315ac946245325bf3756b89b2c5","coverage":[{"denominator":35,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":35,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-03T03:58:08.678247Z","state":"measured"},{"denominator":35,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":35,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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/2607.02150/citation-record","integrity":"/paper/2607.02150/integrity","json":"/paper/2607.02150/citation-record.json","paper":"/paper/2607.02150"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-05T14:51:11.381814Z","title":"SIAM Journal on Computing 43(2):930--972","venue":null,"work_id":"7bf0fbfc-e618-418d-ab30-51b1afeba2e2","year":2014},"citing_paper":{"arxiv_id":"2607.02150","last_updated":"2026-07-02T13:26:29Z","snapshot_observed_at":"2026-08-10T18:03:21.387955Z","submitted_at":"2026-07-02T13:26:29Z","title":"Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-07-03T03:58:08.678247Z"},"links":{"citing_paper":"/paper/2607.02150"},"observation_digest":"sha256:8dd2634e7f90532ac24d2eabc08411f68f861a2595666a5feadd170b998e8eee","observation_id":"b8d3a818-8d78-4aef-bd3d-e5262d9bc986","resolution":{"observed_at":"2026-07-05T14:51:11.383427Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07-05T14:51:11.409284Z","title":"Stochastic Systems 9(3):231--260","venue":null,"work_id":"e7c04f13-b34c-44d0-a4d3-32e6aa291010","year":2019},"citing_paper":{"arxiv_id":"2607.02150","last_updated":"2026-07-02T13:26:29Z","snapshot_observed_at":"2026-08-10T18:03:21.387955Z","submitted_at":"2026-07-02T13:26:29Z","title":"Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-07-03T03:58:08.678247Z"},"links":{"citing_paper":"/paper/2607.02150"},"observation_digest":"sha256:354ad209816091e7cbb1242cd71931c278eabdba9f16748b304ba9f52307b244","observation_id":"83739d46-6f31-4bbe-9700-a0ef4824826f","resolution":{"observed_at":"2026-07-05T14:51:11.410986Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07-05T14:51:11.363756Z","title":"Stochastic Systems 10(2):170--191","venue":null,"work_id":"619d3978-ca5f-4833-9647-0f1cd5d5dd77","year":2020},"citing_paper":{"arxiv_id":"2607.02150","last_updated":"2026-07-02T13:26:29Z","snapshot_observed_at":"2026-08-10T18:03:21.387955Z","submitted_at":"2026-07-02T13:26:29Z","title":"Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-07-03T03:58:08.678247Z"},"links":{"citing_paper":"/paper/2607.02150"},"observation_digest":"sha256:0a8b877158988c83e7e329afc237fc3b3036cc53ffb71524bfda7bbaca4fb122","observation_id":"623fb386-7ecd-4e1d-aed5-f631123683b4","resolution":{"observed_at":"2026-07-05T14:51:11.365487Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07-05T14:51:11.361133Z","title":"Management Science 71(6):4877--4894","venue":null,"work_id":"52325ac8-4738-4919-adf6-f69a72204df7","year":2024},"citing_paper":{"arxiv_id":"2607.02150","last_updated":"2026-07-02T13:26:29Z","snapshot_observed_at":"2026-08-10T18:03:21.387955Z","submitted_at":"2026-07-02T13:26:29Z","title":"Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-07-03T03:58:08.678247Z"},"links":{"citing_paper":"/paper/2607.02150"},"observation_digest":"sha256:55d8d2a7bd8a5c6508cdbb31380f1d67905160eb7e6942f1dd5d4d73d804ed83","observation_id":"5fdf51c2-38ce-4410-87db-895af8197e34","resolution":{"observed_at":"2026-07-05T14:51:11.362928Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07-05T14:51:11.427388Z","title":"Operations Research 72(5):2168--2189","venue":null,"work_id":"3e284ccf-fdac-444a-b760-20f8647d7788","year":2024},"citing_paper":{"arxiv_id":"2607.02150","last_updated":"2026-07-02T13:26:29Z","snapshot_observed_at":"2026-08-10T18:03:21.387955Z","submitted_at":"2026-07-02T13:26:29Z","title":"Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-07-03T03:58:08.678247Z"},"links":{"citing_paper":"/paper/2607.02150"},"observation_digest":"sha256:30f40f6c4dfcc623763dc48add4aec1ec7bfc7d0d2843d78f0174eb2b91350cc","observation_id":"6bde9866-c1af-441a-94ad-f30f88455154","resolution":{"observed_at":"2026-07-05T14:51:11.429126Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07-05T14:51:11.430036Z","title":"Operations Research 73(3):1273--1288","venue":null,"work_id":"b352a5cd-dcd2-4133-9a07-efda1fc45878","year":2024},"citing_paper":{"arxiv_id":"2607.02150","last_updated":"2026-07-02T13:26:29Z","snapshot_observed_at":"2026-08-10T18:03:21.387955Z","submitted_at":"2026-07-02T13:26:29Z","title":"Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-07-03T03:58:08.678247Z"},"links":{"citing_paper":"/paper/2607.02150"},"observation_digest":"sha256:15f29b17eb99dfd4fa32ebff0080637c663a14695daba848e70c2e1a42ccac7b","observation_id":"3f333585-f54c-4617-904e-ca28ce84d64b","resolution":{"observed_at":"2026-07-05T14:51:11.431749Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07-05T14:51:11.424370Z","title":"Oxford University Press","venue":null,"work_id":"d671b9c9-e9e0-4ef6-8369-497a25660b96","year":2013},"citing_paper":{"arxiv_id":"2607.02150","last_updated":"2026-07-02T13:26:29Z","snapshot_observed_at":"2026-08-10T18:03:21.387955Z","submitted_at":"2026-07-02T13:26:29Z","title":"Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-07-03T03:58:08.678247Z"},"links":{"citing_paper":"/paper/2607.02150"},"observation_digest":"sha256:e36be2d2dd221c05f5994cc2768f75982062414aee360e92d1fa5e87c2ec71ce","observation_id":"1ed1668c-9469-4f3f-8f9a-6ccc3aee07bc","resolution":{"observed_at":"2026-07-05T14:51:11.426269Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07-05T14:51:11.358704Z","title":"Operations Research 73(4):2188--2203","venue":null,"work_id":"302de0f3-ae09-4831-b2e8-622b9d49ff2e","year":2024},"citing_paper":{"arxiv_id":"2607.02150","last_updated":"2026-07-02T13:26:29Z","snapshot_observed_at":"2026-08-10T18:03:21.387955Z","submitted_at":"2026-07-02T13:26:29Z","title":"Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-07-03T03:58:08.678247Z"},"links":{"citing_paper":"/paper/2607.02150"},"observation_digest":"sha256:523a669ec9bac0e3c2b1e4191d3c992f50870f0e521ef3b5ff043ccca5bb5e5c","observation_id":"710111dc-0e0b-472a-999e-529a358710e6","resolution":{"observed_at":"2026-07-05T14:51:11.360400Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07-05T14:51:11.418030Z","title":"Management Science 66(7):2993--3009","venue":null,"work_id":"feee4a29-698c-4e02-b951-cb1622ca835c","year":2020},"citing_paper":{"arxiv_id":"2607.02150","last_updated":"2026-07-02T13:26:29Z","snapshot_observed_at":"2026-08-10T18:03:21.387955Z","submitted_at":"2026-07-02T13:26:29Z","title":"Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-07-03T03:58:08.678247Z"},"links":{"citing_paper":"/paper/2607.02150"},"observation_digest":"sha256:24251c866f194546a7295c9c84de1e8648ed9a076e17ba963c00703db631341d","observation_id":"536ea0ca-2cb1-49ec-b921-708a04711a93","resolution":{"observed_at":"2026-07-05T14:51:11.420227Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07-05T14:51:11.414918Z","title":"Proceedings of the 42nd ACM Symposium on Theory of Computing, 311--320","venue":null,"work_id":"38ffedb1-b297-4e88-a061-c5516a765e14","year":2010},"citing_paper":{"arxiv_id":"2607.02150","last_updated":"2026-07-02T13:26:29Z","snapshot_observed_at":"2026-08-10T18:03:21.387955Z","submitted_at":"2026-07-02T13:26:29Z","title":"Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-07-03T03:58:08.678247Z"},"links":{"citing_paper":"/paper/2607.02150"},"observation_digest":"sha256:4ab20570bace97f95388bcfa6848b3406018597462a000e71cf7caf20a14f8b0","observation_id":"fba575db-7c7e-4ff2-826f-e9087618d576","resolution":{"observed_at":"2026-07-05T14:51:11.416796Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07-05T14:51:11.366302Z","title":"Operations Research 72(3):1124--1138","venue":null,"work_id":"11bfc162-17ad-4190-aea4-d43f4c4a307e","year":2024},"citing_paper":{"arxiv_id":"2607.02150","last_updated":"2026-07-02T13:26:29Z","snapshot_observed_at":"2026-08-10T18:03:21.387955Z","submitted_at":"2026-07-02T13:26:29Z","title":"Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-07-03T03:58:08.678247Z"},"links":{"citing_paper":"/paper/2607.02150"},"observation_digest":"sha256:6ae119861113f172e5b8db48bf2804672816f08f85883113d967e85a8c99a380","observation_id":"ed1f0538-d867-4e4a-aa00-84a9f2a9d7f7","resolution":{"observed_at":"2026-07-05T14:51:11.367818Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.01716","last_updated":"2025-02-13T00:33:06Z","snapshot_observed_at":"2026-08-17T16:43:25.306664Z","submitted_at":"2025-01-03T09:21:27Z","title":"Beyond Non-Degeneracy: Revisiting Certainty Equivalent Heuristic for Online Linear Programming","version":2},"cited_work":{"arxiv_id":"2501.01716","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.01716","snapshot_observed_at":"2026-07-03T16:58:42.499191Z","title":"Beyond non-degeneracy: Revisiting certainty equivalent heuristic for online linear programming","venue":null,"work_id":"9a636221-7fd6-4698-a859-962f6cedc5a6","year":2025},"citing_paper":{"arxiv_id":"2607.02150","last_updated":"2026-07-02T13:26:29Z","snapshot_observed_at":"2026-08-10T18:03:21.387955Z","submitted_at":"2026-07-02T13:26:29Z","title":"Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-07-03T03:58:08.678247Z"},"links":{"cited_paper":"/paper/2501.01716","citing_paper":"/paper/2607.02150"},"observation_digest":"sha256:70fd7a4b75aeac2906bfd81d574dbe895806d41c6ce3657acef52056cb703f4b","observation_id":"2c2cd026-2760-4633-a74b-f337cdca3518","resolution":{"observed_at":"2026-07-03T04:07:36.535700Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07-05T14:51:11.403896Z","title":"Proceedings of the 2017 ACM Conference on Economics and Computation, 169--186","venue":null,"work_id":"3040ef27-eb79-44c3-83d0-0b0a8ed35701","year":2017},"citing_paper":{"arxiv_id":"2607.02150","last_updated":"2026-07-02T13:26:29Z","snapshot_observed_at":"2026-08-10T18:03:21.387955Z","submitted_at":"2026-07-02T13:26:29Z","title":"Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-07-03T03:58:08.678247Z"},"links":{"citing_paper":"/paper/2607.02150"},"observation_digest":"sha256:bae3e7c93d62e4052791975a40d888516968b80f7c93b29322ccf99c480fd2b3","observation_id":"a0bf3468-6482-4ba4-affd-d0a2386ac4d4","resolution":{"observed_at":"2026-07-05T14:51:11.405312Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07-05T14:51:11.432626Z","title":"ACM SIGecom Exchanges 17(1):61--70","venue":null,"work_id":"155f61c2-28e1-41dd-b0c0-388bb3bb6ebe","year":2019},"citing_paper":{"arxiv_id":"2607.02150","last_updated":"2026-07-02T13:26:29Z","snapshot_observed_at":"2026-08-10T18:03:21.387955Z","submitted_at":"2026-07-02T13:26:29Z","title":"Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-07-03T03:58:08.678247Z"},"links":{"citing_paper":"/paper/2607.02150"},"observation_digest":"sha256:a1318c83cef023892fefd79287784620826e4beac42a6cfc096b196b6926ffdc","observation_id":"fcf9e853-5a65-4b0c-b2c3-21970afa8377","resolution":{"observed_at":"2026-07-05T14:51:11.434477Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07-05T14:51:11.438177Z","title":"II, 2nd ed","venue":null,"work_id":"7adb33c2-fb73-43d5-a86b-9e5e4710629c","year":1971},"citing_paper":{"arxiv_id":"2607.02150","last_updated":"2026-07-02T13:26:29Z","snapshot_observed_at":"2026-08-10T18:03:21.387955Z","submitted_at":"2026-07-02T13:26:29Z","title":"Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-07-03T03:58:08.678247Z"},"links":{"citing_paper":"/paper/2607.02150"},"observation_digest":"sha256:b97ff43692c9ae85983fb0552b67a5c2c532f395b2dc04601c5c7f2ac3c03f9f","observation_id":"51006790-c3d9-4627-bffd-26da951f27c6","resolution":{"observed_at":"2026-07-05T14:51:11.439867Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07-05T14:51:11.421449Z","title":"Mathematics of Operations Research 48(3):1344--1363","venue":null,"work_id":"08015424-b858-451c-a316-ae7687f6e316","year":2022},"citing_paper":{"arxiv_id":"2607.02150","last_updated":"2026-07-02T13:26:29Z","snapshot_observed_at":"2026-08-10T18:03:21.387955Z","submitted_at":"2026-07-02T13:26:29Z","title":"Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-07-03T03:58:08.678247Z"},"links":{"citing_paper":"/paper/2607.02150"},"observation_digest":"sha256:b503a2841d1fca8e08c64a5eac32a73c14e0ec51f9cbe8b1e1d5be22df6229a7","observation_id":"b717a703-4f84-4dc0-ab36-a2f33f394ed6","resolution":{"observed_at":"2026-07-05T14:51:11.423285Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07-05T14:51:11.435339Z","title":"Management Science 40(8):999--1020","venue":null,"work_id":"304b89fd-f264-454b-a555-3860ac90e2cd","year":1994},"citing_paper":{"arxiv_id":"2607.02150","last_updated":"2026-07-02T13:26:29Z","snapshot_observed_at":"2026-08-10T18:03:21.387955Z","submitted_at":"2026-07-02T13:26:29Z","title":"Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-07-03T03:58:08.678247Z"},"links":{"citing_paper":"/paper/2607.02150"},"observation_digest":"sha256:9c6aef979037df1be71e25e5df546c8d2fe7d5241d7397c546cdc004dbca808f","observation_id":"c0eef06b-6f3b-419c-99e8-781d12637439","resolution":{"observed_at":"2026-07-05T14:51:11.437384Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.02761","last_updated":"2025-01-06T04:57:44Z","snapshot_observed_at":"2026-08-16T12:59:37.685125Z","submitted_at":"2025-01-06T04:57:44Z","title":"Beyond $\\mathcal{O}(\\sqrt{T})$ Regret: Decoupling Learning and Decision-making in Online Linear Programming","version":1},"cited_work":{"arxiv_id":"2501.02761","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.02761","snapshot_observed_at":"2026-07-03T16:58:42.505341Z","title":"Beyond O( T) regret","venue":null,"work_id":"0a339676-569f-45b8-ae38-4f92b9fbef2e","year":2025},"citing_paper":{"arxiv_id":"2607.02150","last_updated":"2026-07-02T13:26:29Z","snapshot_observed_at":"2026-08-10T18:03:21.387955Z","submitted_at":"2026-07-02T13:26:29Z","title":"Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-07-03T03:58:08.678247Z"},"links":{"cited_paper":"/paper/2501.02761","citing_paper":"/paper/2607.02150"},"observation_digest":"sha256:cccc3d400fbde50f5e6c8a8e4741ac3d9917c6c703d2979d243b6b7741a2873b","observation_id":"4a6f4820-0c07-42c6-8b35-c16df151343a","resolution":{"observed_at":"2026-07-03T04:07:36.538541Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07-05T14:51:11.398693Z","title":"Operations Research 72(3):1139--1155","venue":null,"work_id":"819d748f-d1f0-49fe-938e-9176cb2e28a5","year":2024},"citing_paper":{"arxiv_id":"2607.02150","last_updated":"2026-07-02T13:26:29Z","snapshot_observed_at":"2026-08-10T18:03:21.387955Z","submitted_at":"2026-07-02T13:26:29Z","title":"Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-07-03T03:58:08.678247Z"},"links":{"citing_paper":"/paper/2607.02150"},"observation_digest":"sha256:48f9dddf9b37f1fc48dc9d1455558c46076e4b46ad4bf895352bd7d6d396b8be","observation_id":"feae2ebe-66ef-4b90-971d-883b7f266582","resolution":{"observed_at":"2026-07-05T14:51:11.400513Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07-05T14:51:11.401358Z","title":"Working paper, SSRN 5133857","venue":null,"work_id":"43d49bd0-2aac-4b9f-b730-bcd857b23917","year":2025},"citing_paper":{"arxiv_id":"2607.02150","last_updated":"2026-07-02T13:26:29Z","snapshot_observed_at":"2026-08-10T18:03:21.387955Z","submitted_at":"2026-07-02T13:26:29Z","title":"Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-07-03T03:58:08.678247Z"},"links":{"citing_paper":"/paper/2607.02150"},"observation_digest":"sha256:dceb2eca93ec59257fe514b94e416697486bd84b0048a73514c32f28bf8cfdec","observation_id":"3408e7e7-f4c7-4a01-9fd8-acc489ad1f02","resolution":{"observed_at":"2026-07-05T14:51:11.402853Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07-05T14:51:11.411822Z","title":"random variables","venue":null,"work_id":"036d938e-51a6-43bc-8f74-15813c0651df","year":1982},"citing_paper":{"arxiv_id":"2607.02150","last_updated":"2026-07-02T13:26:29Z","snapshot_observed_at":"2026-08-10T18:03:21.387955Z","submitted_at":"2026-07-02T13:26:29Z","title":"Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-07-03T03:58:08.678247Z"},"links":{"citing_paper":"/paper/2607.02150"},"observation_digest":"sha256:4aea298afcf89157a747a35e76981c2a6e43629b0f0ed5b4b4ba7bc10ec36b2c","observation_id":"c9e18e0a-45e0-419f-97ff-c34f50f84ed9","resolution":{"observed_at":"2026-07-05T14:51:11.413894Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07-05T14:51:11.393833Z","title":"Mathematics of Operations Research 37(2):313--345","venue":null,"work_id":"224fc0d7-229b-41ae-9d1b-60fc7a51e1e8","year":2012},"citing_paper":{"arxiv_id":"2607.02150","last_updated":"2026-07-02T13:26:29Z","snapshot_observed_at":"2026-08-10T18:03:21.387955Z","submitted_at":"2026-07-02T13:26:29Z","title":"Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-07-03T03:58:08.678247Z"},"links":{"citing_paper":"/paper/2607.02150"},"observation_digest":"sha256:62d28139cee83da5ff6458639aba003c9cea9770cc0e2d42dee48fdcc711f8bc","observation_id":"8d025d59-20ba-4719-aeba-8a8da26c19a5","resolution":{"observed_at":"2026-07-05T14:51:11.395350Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2012.07933","last_updated":"2020-12-18T02:27:23Z","snapshot_observed_at":"2026-08-18T15:46:57.992554Z","submitted_at":"2020-12-14T20:43:31Z","title":"Online Resource Allocation with Stochastic Resource Consumption","version":2},"cited_work":{"arxiv_id":"2012.07933","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2012.07933","snapshot_observed_at":"2026-07-03T16:58:42.507871Z","title":"Online resource allocation with stochastic resource consumption","venue":null,"work_id":"a1d91c3a-e819-4799-8279-24b96044ebc4","year":2012},"citing_paper":{"arxiv_id":"2607.02150","last_updated":"2026-07-02T13:26:29Z","snapshot_observed_at":"2026-08-10T18:03:21.387955Z","submitted_at":"2026-07-02T13:26:29Z","title":"Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-07-03T03:58:08.678247Z"},"links":{"cited_paper":"/paper/2012.07933","citing_paper":"/paper/2607.02150"},"observation_digest":"sha256:a6040821b87a39d9df14365a9b5a8ea0869a5f233320f2ba112cf300440308bc","observation_id":"0e9d5186-3d53-412d-af5d-30fdf550a149","resolution":{"observed_at":"2026-07-03T04:07:36.541382Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07-05T14:51:11.391322Z","title":"Operations Research 73(3):1703--1721","venue":null,"work_id":"b0351649-ba0d-4baf-8f09-4390e8ee28ea","year":2024},"citing_paper":{"arxiv_id":"2607.02150","last_updated":"2026-07-02T13:26:29Z","snapshot_observed_at":"2026-08-10T18:03:21.387955Z","submitted_at":"2026-07-02T13:26:29Z","title":"Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-07-03T03:58:08.678247Z"},"links":{"citing_paper":"/paper/2607.02150"},"observation_digest":"sha256:0c4d8de86dabd7b806c3d9ea24d87ae93f7a1a7b4b700889333ad67604db0c9b","observation_id":"89bbfbc0-7319-46d8-8973-b1db4610c20c","resolution":{"observed_at":"2026-07-05T14:51:11.393077Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07-05T14:51:11.389116Z","title":"Operations Research 73(6):3405--3420","venue":null,"work_id":"f137b0fe-7122-45fc-9c92-33253183df85","year":null},"citing_paper":{"arxiv_id":"2607.02150","last_updated":"2026-07-02T13:26:29Z","snapshot_observed_at":"2026-08-10T18:03:21.387955Z","submitted_at":"2026-07-02T13:26:29Z","title":"Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-07-03T03:58:08.678247Z"},"links":{"citing_paper":"/paper/2607.02150"},"observation_digest":"sha256:599e019859e27cabb3d27e588244ff7175a9026e571f0f1b2d09e36b0878ff36","observation_id":"70904cc6-bea7-4989-8a07-dead9314e46f","resolution":{"observed_at":"2026-07-05T14:51:11.390572Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07-05T14:51:11.396138Z","title":"Mathematics of Operations Research 51(2):956--987","venue":null,"work_id":"c38fb8de-529a-478b-a0a0-93d9837ef692","year":null},"citing_paper":{"arxiv_id":"2607.02150","last_updated":"2026-07-02T13:26:29Z","snapshot_observed_at":"2026-08-10T18:03:21.387955Z","submitted_at":"2026-07-02T13:26:29Z","title":"Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-07-03T03:58:08.678247Z"},"links":{"citing_paper":"/paper/2607.02150"},"observation_digest":"sha256:13e41772e7878cdc8e7208bb980593960915c0016150567e75dcaa2180842c11","observation_id":"0a7d280a-a5db-49df-b512-9a7aba8d9c6c","resolution":{"observed_at":"2026-07-05T14:51:11.397736Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2408.00465","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-03T16:58:42.503287Z","title":"Infrequent resolving algorithm for online linear programming","venue":null,"work_id":"5d6cddd6-fa0a-4022-b568-551cda8e02ec","year":2024},"citing_paper":{"arxiv_id":"2607.02150","last_updated":"2026-07-02T13:26:29Z","snapshot_observed_at":"2026-08-10T18:03:21.387955Z","submitted_at":"2026-07-02T13:26:29Z","title":"Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-07-03T03:58:08.678247Z"},"links":{"citing_paper":"/paper/2607.02150"},"observation_digest":"sha256:64004678ce618b3bd5ebab701d2531108c24805523202d6bee9b0bacf5a3070c","observation_id":"133db64e-ad0e-4fb5-958e-af517789fa68","resolution":{"observed_at":"2026-07-03T04:07:36.542488Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07-05T14:51:11.406348Z","title":"Operations Research 70(5):2948--2966","venue":null,"work_id":"e0a22144-fda6-4487-b5c0-e8892c8c00f9","year":2022},"citing_paper":{"arxiv_id":"2607.02150","last_updated":"2026-07-02T13:26:29Z","snapshot_observed_at":"2026-08-10T18:03:21.387955Z","submitted_at":"2026-07-02T13:26:29Z","title":"Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-07-03T03:58:08.678247Z"},"links":{"citing_paper":"/paper/2607.02150"},"observation_digest":"sha256:6fc3acdfbf6383b13bc8d0670c0606d5e3b94ce76887409ba18b1fe579d80f3f","observation_id":"ca282ec6-e5fd-4664-9fe0-f1de09d71b5e","resolution":{"observed_at":"2026-07-05T14:51:11.408334Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07-05T14:51:11.376110Z","title":"Journal of Algorithms 29(2):277--305","venue":null,"work_id":"9b1e9d65-8787-4ca9-ba4d-0bbc21477381","year":1998},"citing_paper":{"arxiv_id":"2607.02150","last_updated":"2026-07-02T13:26:29Z","snapshot_observed_at":"2026-08-10T18:03:21.387955Z","submitted_at":"2026-07-02T13:26:29Z","title":"Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-07-03T03:58:08.678247Z"},"links":{"citing_paper":"/paper/2607.02150"},"observation_digest":"sha256:29c3d7dd52a6e4f08c03fc3b5330324c6eba3434979b79326fbea6fc87a5027a","observation_id":"3be92a16-f50e-4247-a3e2-3e9ba366909c","resolution":{"observed_at":"2026-07-05T14:51:11.377840Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07-05T14:51:11.379068Z","title":"The Annals of Probability 12(4):1213--1216","venue":null,"work_id":"01b50cf5-2df7-45e0-b7b7-83bb5a6d8f49","year":1984},"citing_paper":{"arxiv_id":"2607.02150","last_updated":"2026-07-02T13:26:29Z","snapshot_observed_at":"2026-08-10T18:03:21.387955Z","submitted_at":"2026-07-02T13:26:29Z","title":"Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-07-03T03:58:08.678247Z"},"links":{"citing_paper":"/paper/2607.02150"},"observation_digest":"sha256:890df0872eea96b53782098b2a0d499efc7608c46dd4ab5c8ef63e5087ad4c18","observation_id":"743fefd7-c721-471f-a457-815e9ae6c10f","resolution":{"observed_at":"2026-07-05T14:51:11.380934Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07-05T14:51:11.384158Z","title":"Management Science 44(11):1577--1593","venue":null,"work_id":"2e230dce-5ed6-4213-acd8-a9126a763179","year":1998},"citing_paper":{"arxiv_id":"2607.02150","last_updated":"2026-07-02T13:26:29Z","snapshot_observed_at":"2026-08-10T18:03:21.387955Z","submitted_at":"2026-07-02T13:26:29Z","title":"Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-07-03T03:58:08.678247Z"},"links":{"citing_paper":"/paper/2607.02150"},"observation_digest":"sha256:d5ae429863baf0d35fb85532c8d29cbacef9834cb62905b545ac4696901636c6","observation_id":"a45e448b-607f-4e05-a902-6258fa0f7ad0","resolution":{"observed_at":"2026-07-05T14:51:11.385482Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07-05T14:51:11.386584Z","title":"Management Science 67(3):1368--1391","venue":null,"work_id":"ace07f39-ba7b-41b6-8d2d-9c589622c851","year":2021},"citing_paper":{"arxiv_id":"2607.02150","last_updated":"2026-07-02T13:26:29Z","snapshot_observed_at":"2026-08-10T18:03:21.387955Z","submitted_at":"2026-07-02T13:26:29Z","title":"Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-07-03T03:58:08.678247Z"},"links":{"citing_paper":"/paper/2607.02150"},"observation_digest":"sha256:1bfb27ec065b0543fb5a985dabb61abb91faf5801211bb9f73a4752f11b59e03","observation_id":"b5b2b5c7-53ed-49fa-b2ea-b749961a3cae","resolution":{"observed_at":"2026-07-05T14:51:11.388155Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07-05T14:51:11.368587Z","title":"Operations Research 69(3):821--840","venue":null,"work_id":"4de73ab6-747f-452e-9a63-b5243126a502","year":2021},"citing_paper":{"arxiv_id":"2607.02150","last_updated":"2026-07-02T13:26:29Z","snapshot_observed_at":"2026-08-10T18:03:21.387955Z","submitted_at":"2026-07-02T13:26:29Z","title":"Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-07-03T03:58:08.678247Z"},"links":{"citing_paper":"/paper/2607.02150"},"observation_digest":"sha256:73f07d9f4707e3139f072a3faac79a07072f0c115e00846f35d1a9b112e75a40","observation_id":"1a7cce97-19d7-4514-ac01-e231d46a32f9","resolution":{"observed_at":"2026-07-05T14:51:11.370272Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07-05T14:51:11.371346Z","title":"Working paper, SSRN 4357216","venue":null,"work_id":"1b4fe53a-0fa9-445b-955c-b573a5efa9d4","year":2023},"citing_paper":{"arxiv_id":"2607.02150","last_updated":"2026-07-02T13:26:29Z","snapshot_observed_at":"2026-08-10T18:03:21.387955Z","submitted_at":"2026-07-02T13:26:29Z","title":"Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-07-03T03:58:08.678247Z"},"links":{"citing_paper":"/paper/2607.02150"},"observation_digest":"sha256:abce2650eae597b5d20189daa985c324cd89e69a975a5a46c2af962f2d62b4eb","observation_id":"27681686-727b-4d59-befb-b651edba39aa","resolution":{"observed_at":"2026-07-05T14:51:11.373056Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07-05T14:51:11.373716Z","title":"Management Science, forthcoming","venue":null,"work_id":"d8a8d9b8-78ed-4fba-8f3f-2b3a07a90095","year":2025},"citing_paper":{"arxiv_id":"2607.02150","last_updated":"2026-07-02T13:26:29Z","snapshot_observed_at":"2026-08-10T18:03:21.387955Z","submitted_at":"2026-07-02T13:26:29Z","title":"Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-07-03T03:58:08.678247Z"},"links":{"citing_paper":"/paper/2607.02150"},"observation_digest":"sha256:24b7bddaa348140ea68b9c5096942375be0803fa1962cd6cad659e187e9a401d","observation_id":"2c34fe72-9068-40ba-8f5a-d48fdcee40ec","resolution":{"observed_at":"2026-07-05T14:51:11.375285Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2607.02150","last_updated":"2026-07-02T13:26:29Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-10T18:03:21.387955Z","submitted_at":"2026-07-02T13:26:29Z","title":"Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates"},"reference_resolution":{"displayed":35,"state_counts":{"malformed_identifier":0,"metadata_mismatch":4,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":31},"total_outbound_references":35},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 35 of 35 outbound references and 0 inbound Pith citation observations for arXiv:2607.02150."}