{"as_of":"2026-08-09T11:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8a71e9fa5c67d321d2e7fc656ca4441e3d8914208745688c2064e2cd49592bb6","coverage":[{"denominator":102,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T14:57:00.293950Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2509.22992/citation-record","integrity":"/paper/2509.22992/integrity","json":"/paper/2509.22992/citation-record.json","paper":"/paper/2509.22992"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:56:59.702121Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-04T14:56:59.702121Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:2216d6e84a0dcbcaa6ae86c3de6794376035dabb7de626c9c09d591de7c7c0ef","observation_id":"fb6343a1-80f6-490c-9329-bda5530792ee","resolution":{"observed_at":"2026-08-04T14:56:59.702121Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:56:59.709947Z","title":"Submodular stochastic probing on matroids","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-04T14:56:59.709947Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:5f55ae4bf2373a8066195ea6013eff0c5e624a299c8646028beb911e3332bb55","observation_id":"23bd1092-9e57-4840-a89c-917985cd4c01","resolution":{"observed_at":"2026-08-04T14:56:59.709947Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:56:59.717881Z","title":"Boggart: Towards \\ General-Purpose \\ acceleration of retrospective video analytics","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-04T14:56:59.717881Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:fd2b86fadbcd142178352112107789c2a35b331ceece5fd625565ffb79293542","observation_id":"2a11a320-c3d3-4d66-9024-cf22ae9c2d4c","resolution":{"observed_at":"2026-08-04T14:56:59.717881Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:56:59.724117Z","title":"Self-improving algorithms","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-04T14:56:59.724117Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:c3ff5c0f58bbddff4fdcac2c6a5e34d062ae1a254e2089123f7184e8cc01c223","observation_id":"ebbe8a99-6502-41d6-8946-1045140b3ea5","resolution":{"observed_at":"2026-08-04T14:56:59.724117Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:56:59.729980Z","title":"Learning to prune: Speeding up repeated computations","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-04T14:56:59.729980Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:67b28f8fc4007877e4c91571eb8d482f4df80daa6a3735953d4ecf58b273c523","observation_id":"7ef7bb3e-cee3-422b-9550-9ba825a539f4","resolution":{"observed_at":"2026-08-04T14:56:59.729980Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:56:59.742751Z","title":"The pandora's box problem with sequential inspections","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-04T14:56:59.742751Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:885a5400c81caab673aa0be73ea2a017ce1893f0101d62247ce8788551b7fc72","observation_id":"52d788a9-f27c-4068-a607-759336df9795","resolution":{"observed_at":"2026-08-04T14:56:59.742751Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:56:59.750883Z","title":"Ordered consumer search","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-04T14:56:59.750883Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:29e5372f9dc500719f5d54aa5d4989be0d5e3a59efba0576f4bcaf9925692fcf","observation_id":"18463dc4-40d8-44d9-9da5-fba86c6aebea","resolution":{"observed_at":"2026-08-04T14:56:59.750883Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:56:59.756413Z","title":"Learning-theoretic foundations of algorithm configuration for combinatorial partitioning problems","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-04T14:56:59.756413Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:b4d1e2691246ec5af4353715930f2d6c742fee6d1bf051f10ec9c04275d97181","observation_id":"97935171-78f4-4ffe-be51-ba252d39d78e","resolution":{"observed_at":"2026-08-04T14:56:59.756413Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:56:59.762899Z","title":"Learning to branch","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-04T14:56:59.762899Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:986c00ec05172ae2660e754f1fdd30815616a2ec0ff95db771d4cbb00bf12531","observation_id":"08f60662-af61-4b2f-b5a7-62a12d24e677","resolution":{"observed_at":"2026-08-04T14:56:59.762899Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:56:59.769555Z","title":"How much data is sufficient to learn high-performing algorithms? Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (STOC) 2021, 2019","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-04T14:56:59.769555Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:8e57835f2c2a64cf86553587ecd0b7bd5e5796f0c12a45d4f0f2369ee77a65b1","observation_id":"32864ce3-504d-408e-b615-2e16f8c6aff9","resolution":{"observed_at":"2026-08-04T14:56:59.769555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:56:59.776664Z","title":"The design and price of information","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-04T14:56:59.776664Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:40493f505424d4b9a29770fb4b4a898232cd538079e5b68b5574607980223db4","observation_id":"1066eefd-8111-4aa0-9ff8-95067945fabc","resolution":{"observed_at":"2026-08-04T14:56:59.776664Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:56:59.782172Z","title":"Pandora’s problem with deadlines","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-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-04T14:56:59.782172Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:57e8d5b71a181a7864722bd231341735a68d55bbf9d9d8539a956f3367d55143","observation_id":"adf729e6-316c-42f8-bd8f-459d7ab8b2e4","resolution":{"observed_at":"2026-08-04T14:56:59.782172Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:56:59.787185Z","title":"Random search for hyper-parameter optimization","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-04T14:56:59.787185Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:5c87b2ccbdb435bb26ee188d2f0eb9b944b630cfca5d6292bd3515a4ece5490f","observation_id":"eeb2b253-390a-4fa3-bb04-d92531e60ce9","resolution":{"observed_at":"2026-08-04T14:56:59.787185Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:56:59.793219Z","title":"Pandora’s problem with nonobligatory inspection: Optimal structure and a ptas","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-04T14:56:59.793219Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:47553812d26c7a23426a5b02f32c138056064460cbf7aab767a14484b73cafaf","observation_id":"6a612459-60e2-4f73-afd4-ba8972d73cc7","resolution":{"observed_at":"2026-08-04T14:56:59.793219Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:56:59.799606Z","title":"Pandora's problem with nonobligatory inspection","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-04T14:56:59.799606Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:6680d6aca1775e5fdd9276adf4fc91c0e295bd8ab93ab8aabb00056ccf2465fa","observation_id":"f7ee7980-a8a1-46ce-8075-081ec243f483","resolution":{"observed_at":"2026-08-04T14:56:59.799606Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:56:59.805922Z","title":"Prophet inequalities with limited information","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-04T14:56:59.805922Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:c0c310fed5235c89e6ce973b2a81cfbef95b8c59d7a59e7b22ac44deceb30d2c","observation_id":"f4bf8be9-2ef7-4b37-a926-9baa0d6fc74c","resolution":{"observed_at":"2026-08-04T14:56:59.805922Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:56:59.810850Z","title":"Pandora's box problem with order constraints","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-04T14:56:59.810850Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:77f58d8660adca376ceaaef046307ae98a576d5faef59b330b8c10f6a32c8d8a","observation_id":"f8ce15f9-193e-42c0-8586-5679d6db95d1","resolution":{"observed_at":"2026-08-04T14:56:59.810850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:56:59.818115Z","title":"Query strategies for priced information","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-04T14:56:59.818115Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:ed8cbccc7ece71817ecec581e4111fd8c28e9860507f25cc1265376c70ee60f1","observation_id":"772f49d3-2b57-4246-96c1-07f1885a4086","resolution":{"observed_at":"2026-08-04T14:56:59.818115Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:56:59.824734Z","title":"Hartline, David L","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-04T14:56:59.824734Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:e1d835e8e085701673a9c31ce68a73ef698e40ba7a260ebede92a9987c1aefe2","observation_id":"db6f309a-26a6-4d7f-97fe-aa5cc3d083fe","resolution":{"observed_at":"2026-08-04T14:56:59.824734Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:56:59.829294Z","title":"Revenue maximization for query pricing","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-04T14:56:59.829294Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:b8721e6b550515547e85e07b183f79935d92ed79e75867961f289019a2608a7b","observation_id":"983a9835-c33a-40d3-8dd5-25f06b6a8886","resolution":{"observed_at":"2026-08-04T14:56:59.829294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:56:59.834425Z","title":"Pandora's box with correlations: Learning and approximation","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-04T14:56:59.834425Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:a0a705786bdd92aaf14bba2291b344500f2031adffd7ec2be73529a9981cc7a0","observation_id":"962d60f9-0c82-4b4b-bd2f-a794a536a532","resolution":{"observed_at":"2026-08-04T14:56:59.834425Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2108.12976","last_updated":"2023-07-21T18:16:37Z","snapshot_observed_at":"2026-08-09T00:23:46.932988Z","submitted_at":"2021-08-30T03:32:16Z","title":"Approximating Pandora's Box with Correlations","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.12976","snapshot_observed_at":"2026-08-04T14:56:59.839907Z","title":"Approximating pandora's box with correlations","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-04T14:56:59.839907Z"},"links":{"cited_paper":"/paper/2108.12976","citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:b75f820f90a6926e5279a0f8dfd75213ad7d160cf8289a630ef6a7677bac334c","observation_id":"9a07cf87-6b27-4a47-9491-ea1ab7df80d7","resolution":{"observed_at":"2026-08-04T14:56:59.839907Z","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-03T07:06:28.969300Z","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-08T16:52:21.023743Z","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:81067d294e8e7b7e37817f6c3a5ee8bc0152ad4045c736009d9d381a474eb24d","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:56:59.851943Z","title":"Sequential information maximization: When is greedy near-optimal? In Conference on Learning Theory, pp.\\ 338--363","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-04T14:56:59.851943Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:15102f6c93e99d934a9c123b48141dc6e869b15ddfcf533ae1b232af59532c79","observation_id":"108dc395-4058-4f87-956d-dee8a4a8dd9d","resolution":{"observed_at":"2026-08-04T14:56:59.851943Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:56:59.857887Z","title":"Submodular surrogates for value of information","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-04T14:56:59.857887Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:ea89dbbf668b395263d94878e00b825accf578dcf6d98e407a83f64793abcf0d","observation_id":"ad56ede8-da04-4de0-a393-10818b5d791b","resolution":{"observed_at":"2026-08-04T14:56:59.857887Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:56:59.863876Z","title":"Self-improving algorithms for convex hulls","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-04T14:56:59.863876Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:111e9a40a9e2e3b637879b18adb8bf8e40d141ad4ad94e2bf59812cf97673673","observation_id":"37c9a80b-2eff-4069-aafa-093b539127c4","resolution":{"observed_at":"2026-08-04T14:56:59.863876Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:56:59.869711Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-04T14:56:59.869711Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:8308b967b9fa239ca182f90d68353339e694327f98c24995d290694c37766dca","observation_id":"137a3122-bed7-48b0-a909-122257b05a2c","resolution":{"observed_at":"2026-08-04T14:56:59.869711Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:56:59.878059Z","title":"Prophet inequalities and posted pricing mechanisms","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-04T14:56:59.878059Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:627d441e01edd5a87e58d354f4659dbc5d304b8c5b2a54e59196eb0d6736b821","observation_id":"20a6e1ed-93a8-4c5d-bdf2-4f62a125d295","resolution":{"observed_at":"2026-08-04T14:56:59.878059Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:56:59.883247Z","title":"Apparate: Rethinking early exits to tame latency-throughput tensions in ml serving","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-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-04T14:56:59.883247Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:fd875454784b06ac181449bdbf1319de0fd0b887c067770e8f811cfb29ec35d5","observation_id":"75e8fa34-4c1b-47d5-800b-aa5926559696","resolution":{"observed_at":"2026-08-04T14:56:59.883247Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.10347","last_updated":"2025-05-22T12:34:14Z","snapshot_observed_at":"2026-07-06T19:32:56.002390Z","submitted_at":"2024-10-14T10:00:49Z","title":"A Unified Approach to Routing and Cascading for LLMs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.10347","snapshot_observed_at":"2026-08-04T14:56:59.888525Z","title":"A unified approach to routing and cascading for llms","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-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-04T14:56:59.888525Z"},"links":{"cited_paper":"/paper/2410.10347","citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:63a9bdf0b54a52d3e00b70065bc1691680ce9a39bf3b2218285a59f0438a8e9c","observation_id":"0495b7d8-94ba-41f0-a6fd-cb33bca179a8","resolution":{"observed_at":"2026-08-04T14:56:59.888525Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:56:59.895082Z","title":"Product ranking on online platforms","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-04T14:56:59.895082Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:e6b9974065a44b002049c7221a6dc5f011665b689944e2aab217f3154e5540a8","observation_id":"e233cc4a-217b-4c02-8f8a-78878412ad14","resolution":{"observed_at":"2026-08-04T14:56:59.895082Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:56:59.905400Z","title":"Bert: Pre-training of deep bidirectional transformers for language understanding","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-04T14:56:59.905400Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:f859d5de40a342524c534fa52de501ccbb3c87897c2b903043c2685cb22742cf","observation_id":"b85e7a07-9567-4ce6-91f4-edd74ce7aa2e","resolution":{"observed_at":"2026-08-04T14:56:59.905400Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:56:59.912994Z","title":"Bert: Pre-training of deep bidirectional transformers for language understanding","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-04T14:56:59.912994Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:ce45c2a21cdfa6230b09e65d04ec7b50f3e5b8edeea328b43c75b1369057cfb0","observation_id":"490a933a-dd96-409c-938f-2f328d7023a5","resolution":{"observed_at":"2026-08-04T14:56:59.912994Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:56:59.920975Z","title":"Competitive information design for pandora's box","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-04T14:56:59.920975Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:1d0b71b589a66eaf472517037d9e1da8f6e8aa8f29123709e31de196fb179ead","observation_id":"567a3e74-b83c-4e4b-9334-beb15626cbc7","resolution":{"observed_at":"2026-08-04T14:56:59.920975Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:56:59.926049Z","title":"Whether or not to open pandora's box","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-04T14:56:59.926049Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:0afc1423f244d39fb220372fd78de99680bda48e8d360400a7476fef00a9c97d","observation_id":"765572d3-1b6b-4f0a-9df5-96ae602a9feb","resolution":{"observed_at":"2026-08-04T14:56:59.926049Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:56:59.932037Z","title":"Prophet inequalities with unknown distributions","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-04T14:56:59.932037Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:a7f56dc1a5e4e6b0d2966170852e1e23960299bf222a9ad60658bf8ed52f508a","observation_id":"f44a675c-ff06-4a0c-b1d2-995b51f74077","resolution":{"observed_at":"2026-08-04T14:56:59.932037Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:56:59.936853Z","title":"Markov processes: characterization and convergence","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-04T14:56:59.936853Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:c0119174db7a8520822f278560b02321cc109bcfd0ad540f01feab560577ab71","observation_id":"6432ca90-cde5-49d0-a5c1-8cf2b7ac0fe8","resolution":{"observed_at":"2026-08-04T14:56:59.936853Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:56:59.942835Z","title":"Online stochastic matching: Beating 1 - 1/e","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-04T14:56:59.942835Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:6ba6fd655fb992779db13a02b386e094c1f16000445382a5f03ba025034b965c","observation_id":"5bb58f77-c239-4fbb-a932-b0fcf04fad24","resolution":{"observed_at":"2026-08-04T14:56:59.942835Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:56:59.948570Z","title":"Pandora box problem with nonobligatory inspection: Hardness and approximation scheme","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-04T14:56:59.948570Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:b4d3388190f0a09985e823f6aa8015dacf5895737979ea958125bd6a73eb61fc","observation_id":"312d0458-7f00-41f9-906a-9efb98916c8e","resolution":{"observed_at":"2026-08-04T14:56:59.948570Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:56:59.955378Z","title":"Bandit algorithms for prophet inequality and pandora's box","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-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-04T14:56:59.955378Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:1e9196a595b5102976c54798845d7ea04a18a8708f9334a74c203c8a18710cde","observation_id":"ea929549-c0d1-45dd-9a14-66023284487f","resolution":{"observed_at":"2026-08-04T14:56:59.955378Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:56:59.962832Z","title":"Online learning for min sum set cover and pandora’s box","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-04T14:56:59.962832Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:8a3890882dc4740bff30d1f5bb20ce4a9dbfb80ecfa53311d4c61e9472aedf93","observation_id":"84862b08-26a4-418d-a3f4-b3d7064e611b","resolution":{"observed_at":"2026-08-04T14:56:59.962832Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.13534","last_updated":"2023-01-31T10:27:19Z","snapshot_observed_at":"2026-08-03T03:59:23.967904Z","submitted_at":"2023-01-31T10:27:19Z","title":"Weitzman's Rule for Pandora's Box with Correlations","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.13534","snapshot_observed_at":"2026-08-04T14:56:59.968168Z","title":"Weitzman's rule for pandora's box with correlations","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-04T14:56:59.968168Z"},"links":{"cited_paper":"/paper/2301.13534","citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:2a26bfaad4f9b437fafb25a4fc0978128a6e00d94fec47522e2e9d64b1fc2531","observation_id":"a208ad98-8918-4a5e-9d8c-e1c4b890bdaf","resolution":{"observed_at":"2026-08-04T14:56:59.968168Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:56:59.975272Z","title":null,"venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-04T14:56:59.975272Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:c02946ad98a422cbdc0f57a81e378e98a41ba10cc8de3005c9243de40baf22a7","observation_id":"d897b7cf-145a-4538-b689-96e859e30805","resolution":{"observed_at":"2026-08-04T14:56:59.975272Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:56:59.980411Z","title":null,"venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-04T14:56:59.980411Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:621fc5ea3b3da5905c99c312c1d773104258ac23c9d43a6b18a14724a851bf25","observation_id":"b943e4d1-e2c8-43f3-bb9a-71f8b7b9d4b2","resolution":{"observed_at":"2026-08-04T14:56:59.980411Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:56:59.987051Z","title":"Asking the right questions: Model-driven optimization using probes","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-04T14:56:59.987051Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:2fdead822d440d73f5e98ebf1fcca6f6f504a52978df9d0f1dc35b75b958782e","observation_id":"10a22846-f4d9-4701-a92e-3f81715e73f2","resolution":{"observed_at":"2026-08-04T14:56:59.987051Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:56:59.993133Z","title":"Deep learning, volume 1","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-04T14:56:59.993133Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:ef5f93ca80016bd599ae352e39dfe87440fbcf1c161d3c2444b139cbbbdea5db","observation_id":"bcfd08cf-3589-4fbd-a741-4d9ef151e3d9","resolution":{"observed_at":"2026-08-04T14:56:59.993133Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:56:59.998336Z","title":"Dynamic recursive neural network","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-04T14:56:59.998336Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:5bc9bd7b868449e1c9efb1866dbe838d410359117957e557b4c274d29afb0a5b","observation_id":"ce81ba87-f7a6-4585-bdb7-6be3dbf7094b","resolution":{"observed_at":"2026-08-04T14:56:59.998336Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:57:00.003951Z","title":"Sorting and selection with structured costs","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.003951Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:7ccd158d48a2db752e99c9c23581435b12632b221b86d2bcb44e5336c5057c5e","observation_id":"1e9ff536-1e47-4f66-8018-419c7ab13ca5","resolution":{"observed_at":"2026-08-04T14:57:00.003951Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:57:00.009947Z","title":"A stochastic probing problem with applications","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.009947Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:e177ca6cf28b8183ff0c00418b93517d5fd8ad2a0f3ddb46e91aa03971deaaa7","observation_id":"cb96bc27-e3f0-4a5d-9a94-f0557045e352","resolution":{"observed_at":"2026-08-04T14:57:00.009947Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:57:00.015552Z","title":"Algorithms and adaptivity gaps for stochastic probing","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.015552Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:02d8389b64d28667ea31792fa93e7ad62010cb5aa5810c6764e74134cb6406eb","observation_id":"186c3334-667b-4c3c-a3b2-978aa83d5b5f","resolution":{"observed_at":"2026-08-04T14:57:00.015552Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:57:00.021345Z","title":"Adaptivity gaps for stochastic probing: Submodular and xos functions","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.021345Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:3fff54e1367bc824d3080450a636338dd623a2512b5d0f073652f140e85a39ac","observation_id":"1c2f8171-3130-419c-a21f-3b1ff441b2a0","resolution":{"observed_at":"2026-08-04T14:57:00.021345Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:57:00.027116Z","title":"The markovian price of information","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.027116Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:11b84d36edf52810edb088a0197270e90d248472722ba2149f81ac3fa9cfb99d","observation_id":"e936e290-20d5-437d-876e-88a37356391b","resolution":{"observed_at":"2026-08-04T14:57:00.027116Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:57:00.035885Z","title":"A pac approach to application-specific algorithm selection","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.035885Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:010765f971769d3b86094239cfcd26304f6f3e6bba4114517e8dfefac2559f9b","observation_id":"2ca2e1c1-7cc6-4f9e-b74f-eafb7df47338","resolution":{"observed_at":"2026-08-04T14:57:00.035885Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:57:00.042132Z","title":"Dynamic neural networks: A survey","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.042132Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:1a996616473ae5ccfeb64e42a406eb1f91e6340485d0dcfeb1bbd088da86a6cc","observation_id":"ab612958-4b20-4675-a682-e3c50aad7b8f","resolution":{"observed_at":"2026-08-04T14:57:00.042132Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:57:00.049327Z","title":"Hyperparameter optimization: a spectral approach","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.049327Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:d34e374b4b44bf18f349681d6b76da177c1d87eb65a3d561a1a7ac0939b790ca","observation_id":"7a38e941-b4da-4f7e-bc2f-c837e6504c37","resolution":{"observed_at":"2026-08-04T14:57:00.049327Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:57:00.056545Z","title":"Deep residual learning for image recognition","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.056545Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:2698dc5210210a61e8d1daa39f8238ee465223317f083ee6a549be568f8126ae","observation_id":"9d5ed59d-f9fb-4298-9bca-eeb662db9f39","resolution":{"observed_at":"2026-08-04T14:57:00.056545Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:57:00.062255Z","title":"Focus: Querying large video datasets with low latency and low cost","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.062255Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:bfdeea2a45a9b2c8424cb5b2d0dd4d58249d7eddacbee8d3d0a528d3268d663f","observation_id":"81b57f27-959b-4309-80f9-849d718e2232","resolution":{"observed_at":"2026-08-04T14:57:00.062255Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:57:00.070418Z","title":"Non-stochastic best arm identification and hyperparameter optimization","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.070418Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:f83dfb0cb5a3b5b6c9dfa99cad56f6f797bb19e1eb9f138edebc9053e25a7bb9","observation_id":"a29343cd-96e9-496f-bf72-72fa18bd0a8a","resolution":{"observed_at":"2026-08-04T14:57:00.070418Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:57:00.077672Z","title":"Shallow-deep networks: Understanding and mitigating network overthinking","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.077672Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:cb4748389e9047ea5043398b85919d885e6f27421b1f1b262f4983b90f2eaff3","observation_id":"a1fcdc04-7326-4095-b190-789594c16f90","resolution":{"observed_at":"2026-08-04T14:57:00.077672Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:57:00.083294Z","title":"Delegated search approximates efficient search","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.083294Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:f9c5fc6e099e644ce23a106b0ab18a7ed59d72897a05eae53e66c51bc8fa59f1","observation_id":"285ea9df-5685-4a71-9f7f-bc9b4923e3b0","resolution":{"observed_at":"2026-08-04T14:57:00.083294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:57:00.089328Z","title":"Krakovski","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.089328Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:030cabedffcb87211190ed34b6b031275036f8660f0ff05617d333f3d4e84943","observation_id":"15b8bec4-eca4-403a-afb2-60c0c9594e07","resolution":{"observed_at":"2026-08-04T14:57:00.089328Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:57:00.095223Z","title":"Descending price optimally coordinates search","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.095223Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:25233b1e7357ba5c76fd202f56c8a70ee37ca052058c2841dd2701a84d64ed58","observation_id":"144b177f-2b6f-4f4b-85ae-2eb50442a4d0","resolution":{"observed_at":"2026-08-04T14:57:00.095223Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:57:00.101612Z","title":"Efficiency through procrastination: Approximately optimal algorithm configuration with runtime guarantees","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.101612Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:c4710af6fcb7182d0b2ed7fcc08f48d43a42f23aab4afb9ec6bbdf5be176c611","observation_id":"ba02536e-941b-4446-bd72-420be9c9b23a","resolution":{"observed_at":"2026-08-04T14:57:00.101612Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:57:00.107074Z","title":"Auto-weka: Automatic model selection and hyperparameter optimization in weka","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.107074Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:467db88d4b71ffae078c60062ad60ed59501491361a9300a969485a26aa4019a","observation_id":"8c2c6993-6367-4dc1-9019-c679f3fac3e2","resolution":{"observed_at":"2026-08-04T14:57:00.107074Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:57:00.113097Z","title":"Semiamarts and finite values","venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.113097Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:0ed87e08cce21eb5219339db0bc063f09e52dab275d04d9f6dab536e43f7457b","observation_id":"f0ffff24-c176-4494-a464-b5f41641587f","resolution":{"observed_at":"2026-08-04T14:57:00.113097Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:57:00.117969Z","title":"On semiamarts, amarts, and processes with finite value","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.117969Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:e5621275786a4cb1fed38fe60a0755ff4ad9e714a996182ae8aadfc7559c1833","observation_id":"8947c491-20e9-4e91-b4e4-97a19a4913cb","resolution":{"observed_at":"2026-08-04T14:57:00.117969Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:57:00.122520Z","title":"Adaptive inference through early-exit networks: Design, challenges and directions","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.122520Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:c48ec91b56b517c88c2d186c6385df1013b0ecb2c1f150fc740f28e6ea5f8935","observation_id":"4f07ec7c-9678-49d3-be4b-8457404bef96","resolution":{"observed_at":"2026-08-04T14:57:00.122520Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:57:00.127482Z","title":"Efficient inference with model cascades","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.127482Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:10f8a39961f29fa0f5647d00e0bdb38a483d5012a638324052e2287733514195","observation_id":"c16180f6-c82f-434e-a86c-2d1688a4cfab","resolution":{"observed_at":"2026-08-04T14:57:00.127482Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:57:00.132713Z","title":"Discriminatory information disclosure","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.132713Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:20d246f3651538f0d47db08cb78c48aebc317cf8547d49e2986546be4f28a8c1","observation_id":"9b552411-9a8e-451e-8e27-76b4081e92ca","resolution":{"observed_at":"2026-08-04T14:57:00.132713Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:57:00.137584Z","title":"Multi-token markov game with switching costs","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.137584Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:6eaf47ac43e487d3d3d6b066bd3b865eb339c3f65b91834880489b63b6a09454","observation_id":"965487a0-5f15-4d72-8ae3-092f9579fb82","resolution":{"observed_at":"2026-08-04T14:57:00.137584Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:57:00.142347Z","title":"Hyperband: A novel bandit-based approach to hyperparameter optimization","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.142347Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:5e7db5957ad303f3ea7fe11978813a43fc211d775dfed9c5349cdc3c1a444280","observation_id":"5efa74ed-2dfa-4f08-b09b-47f570c3b10e","resolution":{"observed_at":"2026-08-04T14:57:00.142347Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:57:00.147324Z","title":"Minimization is harder in the prophet world","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-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.147324Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:4ad3fc9d9c2ebd6ef2e6928e15d422cb4d9d38c1682848824098fbbfb25925d8","observation_id":"a68f1992-6525-46ab-b4bf-ad9ac2a1d807","resolution":{"observed_at":"2026-08-04T14:57:00.147324Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:57:00.152576Z","title":"Split computing and early exiting for deep learning applications: Survey and research challenges","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.152576Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:af117f7115b8990c541a91dcbe3fcc21507c8c65dde815795d6632ab21c48602","observation_id":"cfe82d46-f225-4e5b-96cb-1d0db65712ef","resolution":{"observed_at":"2026-08-04T14:57:00.152576Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:57:00.157736Z","title":"Hidden factors and hidden topics: understanding rating dimensions with review text","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.157736Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:756c190994e8f96a4ddfcd36b4b08d653849ba3ede167e6e5e49dddeedac4320","observation_id":"9856136e-5163-4d5e-8614-c405937a5a47","resolution":{"observed_at":"2026-08-04T14:57:00.157736Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.07451","last_updated":"2026-04-30T14:00:59Z","snapshot_observed_at":"2026-07-06T20:20:23.703146Z","submitted_at":"2025-01-13T16:24:49Z","title":"A Survey on Dynamic Neural Networks: from Computer Vision to Multi-modal Sensor Fusion","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.07451","snapshot_observed_at":"2026-08-04T14:57:00.162611Z","title":"A survey on dynamic neural networks: from computer vision to multi-modal sensor fusion","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.162611Z"},"links":{"cited_paper":"/paper/2501.07451","citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:847db8618cac6bdb5909ec5267c2ace47ebc6680b1fa0b784b60f345ea5ca3d7","observation_id":"2c9738a7-68fb-4cb4-bace-4d0b1c88b5be","resolution":{"observed_at":"2026-08-04T14:57:00.162611Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:57:00.167682Z","title":"Online cascade learning for efficient inference over streams","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-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.167682Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:43b50f489c33665697d54ae585142200911187b3981b5c6fef0639a83ca6bbfe","observation_id":"9282c5fe-ff0c-4f6b-94c0-35483a5bf8d4","resolution":{"observed_at":"2026-08-04T14:57:00.167682Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:57:00.172160Z","title":"A more general pandora rule? Journal of Economic Theory, 160: 0 429--437, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.172160Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:a3b22e20c26fcf7249db79c90e2bb94b7a88a2f14b09fcb2b06a62d7796f8c45","observation_id":"bee6cded-056c-44c4-8a6c-a0da593eaee7","resolution":{"observed_at":"2026-08-04T14:57:00.172160Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.21227/zm1y-b270","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Imdb movie reviews dataset, 2020","venue":"IEEE DataPort","work_id":"70288b04-5d6c-4416-b8ad-28bd8956dbaf","year":2020},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.177025Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:d801adba9e3baeac23438ab23ed017d1a67329e0fc6d8c9a223f5fcf4fcae05a","observation_id":"dee2a638-0758-4c97-9ca1-36906f0d0756","resolution":{"observed_at":"2026-08-04T14:58:51.994527Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T14:57:00.182241Z","title":"Language models are unsupervised multitask learners","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.182241Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:49de7d5862e7387c5b42dbdb96c126657d341db0f69f2f364220a8d72d5aa30f","observation_id":"85b763b5-16a7-47b3-a183-edd79be714c6","resolution":{"observed_at":"2026-08-04T14:57:00.182241Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:57:00.188004Z","title":"Early-exit deep neural network-a comprehensive survey","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-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.188004Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:f462631574f622258f23f738eb6aba7604c89bb1eda47d77088bfa667a72ed8a","observation_id":"bb24eb7c-aeb2-4312-b390-54ee91d7d0a4","resolution":{"observed_at":"2026-08-04T14:57:00.188004Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:57:00.193017Z","title":"Very deep convolutional networks for large-scale image recognition","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.193017Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:3d4582aeeb16a12f61ab2b491a4c04f67cb603716e3e428c56b270c2559e84dd","observation_id":"052838c7-bb12-4e8e-b03f-24a422e521d9","resolution":{"observed_at":"2026-08-04T14:57:00.193017Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1409.1556","last_updated":"2015-04-10T16:25:04Z","snapshot_observed_at":"2026-07-06T03:53:32.549552Z","submitted_at":"2014-09-04T19:48:04Z","title":"Very Deep Convolutional Networks for Large-Scale Image Recognition","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1409.1556","snapshot_observed_at":"2026-08-04T14:57:00.197910Z","title":"Very deep convolutional networks for large-scale image recognition","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.197910Z"},"links":{"cited_paper":"/paper/1409.1556","citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:56cf7ed4e29e6b0cb2981840f0c92501007748508616ae63e3397785d61e48e8","observation_id":"31487435-7fc8-4a51-aae4-05db8007e8cb","resolution":{"observed_at":"2026-08-04T14:57:00.197910Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:57:00.202616Z","title":"The price of information in combinatorial optimization","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.202616Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:ab6526528d818e7568876f745baed91577c7deba2f0b8883dfdac3b6fce96381","observation_id":"ce519254-21b7-4521-a2d3-db3bbf2e332e","resolution":{"observed_at":"2026-08-04T14:57:00.202616Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:57:00.207165Z","title":"Optimizer benchmarking needs to account for hyperparameter tuning","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.207165Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:df5db99b0095b314ff7c530a9d772fddca1f9fecc184aa70c93d6c3c3c2a486d","observation_id":"5d9dc1cf-ef6c-47c0-8757-d6455f33a953","resolution":{"observed_at":"2026-08-04T14:57:00.207165Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:57:00.212330Z","title":"Practical bayesian optimization of machine learning algorithms","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.212330Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:6fb7abd0267034d28a4377a18e7624be0b085c72c48ecfa361aea1695084e89d","observation_id":"4ec1e410-30c3-4884-bf5b-442b006ae805","resolution":{"observed_at":"2026-08-04T14:57:00.212330Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.16419","last_updated":"2025-08-21T19:14:40Z","snapshot_observed_at":"2026-08-07T04:27:23.738927Z","submitted_at":"2025-03-20T17:59:38Z","title":"Stop Overthinking: A Survey on Efficient Reasoning for Large Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.16419","snapshot_observed_at":"2026-08-04T14:57:00.216953Z","title":"Stop overthinking: A survey on efficient reasoning for large language models","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.216953Z"},"links":{"cited_paper":"/paper/2503.16419","citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:1ca6cabc9b0390f6f28fba1851c1d611d5cc983b44b22f3e0304b6a157660b33","observation_id":"e5e110d9-5cdc-4a36-9845-b4758e67b0c0","resolution":{"observed_at":"2026-08-04T14:57:00.216953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:57:00.222081Z","title":"Branchynet: Fast inference via early exiting from deep neural networks","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.222081Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:e2071e02450ceca7dbfc0861ff8650525f0bc4d51a929eb6a6ba2c3dbcfa4d61","observation_id":"b97de473-2a3c-4c91-a2e9-c10da7889dcb","resolution":{"observed_at":"2026-08-04T14:57:00.222081Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.05528","last_updated":"2022-10-11T15:17:52Z","snapshot_observed_at":"2026-08-04T20:05:32.630682Z","submitted_at":"2022-10-11T15:17:52Z","title":"Model Cascading: Towards Jointly Improving Efficiency and Accuracy of NLP Systems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.05528","snapshot_observed_at":"2026-08-04T14:57:00.226625Z","title":"Model cascading: Towards jointly improving efficiency and accuracy of nlp systems","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.226625Z"},"links":{"cited_paper":"/paper/2210.05528","citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:29437f1aec8f3c717831e8bd4a4093cdfe963069ece7bb6ddee20029a0700f7d","observation_id":"5683305e-00df-41a8-86d4-f82b6c13c97d","resolution":{"observed_at":"2026-08-04T14:57:00.226625Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:57:00.234284Z","title":"Skipnet: Learning dynamic routing in convolutional networks","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.234284Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:ab27f88bffc92e7f0f653d8ea22888daacd36f33d3fc7c4c57ed3807f462c174","observation_id":"0b0fd630-dd2e-46aa-a2e1-61866d7b64a1","resolution":{"observed_at":"2026-08-04T14:57:00.234284Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:57:00.241695Z","title":null,"venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":91,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.241695Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:ec442d8d143ae91c9b1834a0a3e6777e63e23dd9fe4f0c710bdd0beb31ebae2c","observation_id":"b6bb6e07-42b1-4c0a-a134-e8926ad70e96","resolution":{"observed_at":"2026-08-04T14:57:00.241695Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:57:00.246477Z","title":"Leapsandbounds: A method for approximately optimal algorithm configuration","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.246477Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:e63a93f54eed5f440a8f149a9bfff617171db4c18e3b730f31a9babe902f51a0","observation_id":"0c838b50-fc84-4168-879f-c2a59ef7f7bb","resolution":{"observed_at":"2026-08-04T14:57:00.246477Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:57:00.252530Z","title":"Optimal search for the best alternative","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":93,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.252530Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:72cfb39f552a2589f522659170ebccdd0fd9e03c5fbc72f9189cfca837c59b58","observation_id":"2aac81e1-e57f-4e14-8ab4-9fe5bea21b6a","resolution":{"observed_at":"2026-08-04T14:57:00.252530Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:57:00.258145Z","title":"Cost-aware bayesian optimization via the pandora's box gittins index","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-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.258145Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:e93fccb47087d4e5d2724413fad7a678fa850520da15fdd9ade246dcb3c4bed5","observation_id":"d50ba42b-3918-4296-abb0-d8d4f3838b99","resolution":{"observed_at":"2026-08-04T14:57:00.258145Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.12453","last_updated":"2026-05-29T03:55:31Z","snapshot_observed_at":"2026-08-06T16:42:54.253559Z","submitted_at":"2025-07-16T17:54:14Z","title":"Cost-aware Stopping for Bayesian Optimization","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.12453","snapshot_observed_at":"2026-08-04T14:57:00.263317Z","title":"Cost-aware stopping for bayesian optimization","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":95,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.263317Z"},"links":{"cited_paper":"/paper/2507.12453","citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:73b38eae82d5431bc2203755ed784e0d69734de91f652fb51779b8e116b5f067","observation_id":"af3c481f-4303-4b94-b6dc-0ec58f142d7a","resolution":{"observed_at":"2026-08-04T14:57:00.263317Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.12993","last_updated":"2020-04-27T17:58:05Z","snapshot_observed_at":"2026-08-06T01:22:26.725556Z","submitted_at":"2020-04-27T17:58:05Z","title":"DeeBERT: Dynamic Early Exiting for Accelerating BERT Inference","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.12993","snapshot_observed_at":"2026-08-04T14:57:00.268518Z","title":"Deebert: Dynamic early exiting for accelerating bert inference","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":96,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.268518Z"},"links":{"cited_paper":"/paper/2004.12993","citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:01171a2143f1a110c3422846912fb2b28cb7eb8cdaaddf14e2a489c895874070","observation_id":"d299826c-9f13-4a08-b427-dffafcbfe339","resolution":{"observed_at":"2026-08-04T14:57:00.268518Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:57:00.273355Z","title":"Berxit: Early exiting for bert with better fine-tuning and extension to regression","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":97,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.273355Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:4e63e7b1d3f94e4a462d01e24c6dfd41deb68ab1e24dc361348799c163f79195","observation_id":"a15e84d3-1cae-46fd-9a4e-08b83f987118","resolution":{"observed_at":"2026-08-04T14:57:00.273355Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.11456","last_updated":"2024-05-01T14:50:56Z","snapshot_observed_at":"2026-08-02T03:59:22.576409Z","submitted_at":"2023-12-18T18:58:42Z","title":"Iterative Preference Learning from Human Feedback: Bridging Theory and Practice for RLHF under KL-Constraint","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.11456","snapshot_observed_at":"2026-08-04T14:57:00.278197Z","title":"Iterative preference learning from human feedback: Bridging theory and practice for rlhf under kl-constraint","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":98,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.278197Z"},"links":{"cited_paper":"/paper/2312.11456","citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:232d2c75f6fe00f5414fc4dddc1183796b7801e2a11c71e4ac9910372490598c","observation_id":"54e2a028-9ce8-437c-82c9-b871889ae3d1","resolution":{"observed_at":"2026-08-04T14:57:00.278197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:57:00.284161Z","title":"Mechanism design via correlation gap","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":99,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.284161Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:4551bd30832780b35e0c53b5b729e00a83cc97999ee2e7124df346cb5cefa4ce","observation_id":"463090ee-486f-4b2c-9a3a-cc3d709e1991","resolution":{"observed_at":"2026-08-04T14:57:00.284161Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:57:00.289625Z","title":"Bert loses patience: Fast and robust inference with early exit","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":100,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.289625Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:a09ea0ea634bfeab0e8f4c6f78cfbd43b29d1675ba3be99b2cf67d2fda18b5af","observation_id":"8f2a7561-f8cb-4f95-9b66-2d6c61c79299","resolution":{"observed_at":"2026-08-04T14:57:00.289625Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:57:00.293950Z","title":"@esa (Ref","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":101,"source":"arxiv_source","source_observed_at":"2026-08-04T14:57:00.293950Z"},"links":{"citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:66f51a94655177ff143538c14d31e79e6219f61a12c850a02798dde7618c5eb5","observation_id":"73b25dcc-bb33-412e-9427-98db1974a614","resolution":{"observed_at":"2026-08-04T14:57:00.293950Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T16:52:21.023743Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":99,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":102},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 100 of 102 outbound references and 0 inbound Pith citation observations for arXiv:2509.22992."}