{"as_of":"2026-08-15T23:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e4a26f5d16b8eecbbfc4d30cf1de46a18621088563d4390589ba3b3adcb4e4e8","coverage":[{"denominator":28,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":28,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T10:30:55.659967Z","state":"measured"},{"denominator":28,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":28,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.20258/citation-record","integrity":"/paper/2607.20258/integrity","json":"/paper/2607.20258/citation-record.json","paper":"/paper/2607.20258"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:30:52.212900Z","title":"The Thirteenth International Conference on Learning Representations , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20258","last_updated":"2026-07-22T15:15:28Z","snapshot_observed_at":"2026-08-15T13:56:23.158325Z","submitted_at":"2026-07-22T15:15:28Z","title":"Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-01T10:30:52.212900Z"},"links":{"citing_paper":"/paper/2607.20258"},"observation_digest":"sha256:ffe7e315e13869232566c0d835cda6d2f00c2093659a1eafbdb0b273fb19ac51","observation_id":"a80c2f38-1682-48d4-a9e3-65dd98663569","resolution":{"observed_at":"2026-08-01T10:30:52.212900Z","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-01T10:30:52.329073Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20258","last_updated":"2026-07-22T15:15:28Z","snapshot_observed_at":"2026-08-15T13:56:23.158325Z","submitted_at":"2026-07-22T15:15:28Z","title":"Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-01T10:30:52.329073Z"},"links":{"citing_paper":"/paper/2607.20258"},"observation_digest":"sha256:dfdddff21bf70e78f9bcd8103fddbe73973cf390989e0814b4d00f4887c9a192","observation_id":"0135edc9-878d-4577-9201-d0686a7984a7","resolution":{"observed_at":"2026-08-01T10:30:52.329073Z","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-01T10:30:52.511447Z","title":"2026 , booktitle=","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.20258","last_updated":"2026-07-22T15:15:28Z","snapshot_observed_at":"2026-08-15T13:56:23.158325Z","submitted_at":"2026-07-22T15:15:28Z","title":"Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-01T10:30:52.511447Z"},"links":{"citing_paper":"/paper/2607.20258"},"observation_digest":"sha256:253f3341d651e0188bbc36a355b975731e06f23793dea97411abcf9e0f448fe2","observation_id":"9d64ca9d-8924-4346-8e85-a38b5e685eb1","resolution":{"observed_at":"2026-08-01T10:30:52.511447Z","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-01T10:30:52.707584Z","title":"arXiv preprint arXiv:2602.12903 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20258","last_updated":"2026-07-22T15:15:28Z","snapshot_observed_at":"2026-08-15T13:56:23.158325Z","submitted_at":"2026-07-22T15:15:28Z","title":"Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-01T10:30:52.707584Z"},"links":{"citing_paper":"/paper/2607.20258"},"observation_digest":"sha256:cf5d84a14338124b24961097c7a095e03735a92633f375c5a1b3f5d273bb92fd","observation_id":"ae58ae43-6ede-4e08-b64f-5ee2b5d2f1c7","resolution":{"observed_at":"2026-08-01T10:30:52.707584Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.04349","last_updated":"2026-05-19T12:56:02Z","snapshot_observed_at":"2026-08-14T09:57:06.358224Z","submitted_at":"2025-04-06T03:56:42Z","title":"Tight Regret Bounds for Fixed-Price Bilateral Trade","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.04349","snapshot_observed_at":"2026-08-01T10:30:52.925442Z","title":"arXiv preprint arXiv:2504.04349 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20258","last_updated":"2026-07-22T15:15:28Z","snapshot_observed_at":"2026-08-15T13:56:23.158325Z","submitted_at":"2026-07-22T15:15:28Z","title":"Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-01T10:30:52.925442Z"},"links":{"cited_paper":"/paper/2504.04349","citing_paper":"/paper/2607.20258"},"observation_digest":"sha256:250eb036ed1a3a35ac30b6a82cd4fd55a4d61f05093ad3d0da727d7565ed5eb9","observation_id":"6131ed5e-63d7-4564-a6fc-b03355641f92","resolution":{"observed_at":"2026-08-01T10:30:52.925442Z","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-01T10:30:53.119495Z","title":"Journal of economic theory , volume=","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2607.20258","last_updated":"2026-07-22T15:15:28Z","snapshot_observed_at":"2026-08-15T13:56:23.158325Z","submitted_at":"2026-07-22T15:15:28Z","title":"Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-01T10:30:53.119495Z"},"links":{"citing_paper":"/paper/2607.20258"},"observation_digest":"sha256:e89df733feb91247f41b1a412ba0f61e561b9bd1a26b949eeca11cbc95c7e74f","observation_id":"aa9150ac-7231-4b3a-980d-245c563f18d7","resolution":{"observed_at":"2026-08-01T10:30:53.119495Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.12664","last_updated":"2026-05-12T19:12:57Z","snapshot_observed_at":"2026-08-14T11:15:36.745726Z","submitted_at":"2026-05-12T19:12:57Z","title":"Profit Maximization in Bilateral Trade against a Smooth Adversary","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.12664","snapshot_observed_at":"2026-08-01T10:30:53.345766Z","title":"arXiv preprint arXiv:2605.12664 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20258","last_updated":"2026-07-22T15:15:28Z","snapshot_observed_at":"2026-08-15T13:56:23.158325Z","submitted_at":"2026-07-22T15:15:28Z","title":"Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-01T10:30:53.345766Z"},"links":{"cited_paper":"/paper/2605.12664","citing_paper":"/paper/2607.20258"},"observation_digest":"sha256:617d21448834af7122e6e414901cbbe6b91562d31a9996373a4208d05eed5faa","observation_id":"cb84e391-438b-4688-8b6a-2a6904100d07","resolution":{"observed_at":"2026-08-01T10:30:53.345766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2602.10868","last_updated":"2026-05-11T12:20:14Z","snapshot_observed_at":"2026-08-14T04:43:27.494279Z","submitted_at":"2026-02-11T13:55:37Z","title":"The Sample Complexity of Uniform Approximation for Multi-Dimensional CDFs and Fixed-Price Mechanisms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2602.10868","snapshot_observed_at":"2026-08-01T10:30:53.509389Z","title":"arXiv preprint arXiv:2602.10868 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20258","last_updated":"2026-07-22T15:15:28Z","snapshot_observed_at":"2026-08-15T13:56:23.158325Z","submitted_at":"2026-07-22T15:15:28Z","title":"Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-01T10:30:53.509389Z"},"links":{"cited_paper":"/paper/2602.10868","citing_paper":"/paper/2607.20258"},"observation_digest":"sha256:fff2cddbcd62f37c545b9d69a06c002cba110071ee9ec3aa9ef78aa86fcdbc17","observation_id":"091094dd-8da7-4b03-b272-5b050aff5787","resolution":{"observed_at":"2026-08-01T10:30:53.509389Z","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-01T10:30:53.622724Z","title":"44th Annual IEEE Symposium on Foundations of Computer Science, 2003","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.20258","last_updated":"2026-07-22T15:15:28Z","snapshot_observed_at":"2026-08-15T13:56:23.158325Z","submitted_at":"2026-07-22T15:15:28Z","title":"Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-01T10:30:53.622724Z"},"links":{"citing_paper":"/paper/2607.20258"},"observation_digest":"sha256:2b14658d55f8a69adeb3bc06e1473f5313d588931c508f361bd2f343cdf77e6c","observation_id":"87eb8652-4da0-4381-bfba-d147c13d47c8","resolution":{"observed_at":"2026-08-01T10:30:53.622724Z","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-01T10:30:53.792164Z","title":"Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.20258","last_updated":"2026-07-22T15:15:28Z","snapshot_observed_at":"2026-08-15T13:56:23.158325Z","submitted_at":"2026-07-22T15:15:28Z","title":"Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-01T10:30:53.792164Z"},"links":{"citing_paper":"/paper/2607.20258"},"observation_digest":"sha256:7b247ccf3ddcee95ee3ed5facaa105092277353b849f2266480d802e730620aa","observation_id":"14fb63bd-9f67-4f8c-8357-4ac91b14d9e5","resolution":{"observed_at":"2026-08-01T10:30:53.792164Z","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-01T10:30:53.969903Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20258","last_updated":"2026-07-22T15:15:28Z","snapshot_observed_at":"2026-08-15T13:56:23.158325Z","submitted_at":"2026-07-22T15:15:28Z","title":"Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-01T10:30:53.969903Z"},"links":{"citing_paper":"/paper/2607.20258"},"observation_digest":"sha256:9511a618b4b30002ccf00afd468164287cd5b111701db51e4a3ee33ff9031fcb","observation_id":"a8e4ab46-fb86-465f-99bb-8e6a245d37eb","resolution":{"observed_at":"2026-08-01T10:30:53.969903Z","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-01T10:30:54.057777Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20258","last_updated":"2026-07-22T15:15:28Z","snapshot_observed_at":"2026-08-15T13:56:23.158325Z","submitted_at":"2026-07-22T15:15:28Z","title":"Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-01T10:30:54.057777Z"},"links":{"citing_paper":"/paper/2607.20258"},"observation_digest":"sha256:7b50bdefa0ca83f76bb4668ebb8b26314da6403fc09276839babb86fc35a241f","observation_id":"7345a293-c2a5-4339-b54c-ad91ce9aec83","resolution":{"observed_at":"2026-08-01T10:30:54.057777Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.11419","last_updated":"2025-07-15T15:45:36Z","snapshot_observed_at":"2026-08-12T05:53:39.326873Z","submitted_at":"2025-07-15T15:45:36Z","title":"Better Regret Rates in Bilateral Trade via Sublinear Budget Violation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.11419","snapshot_observed_at":"2026-08-01T10:30:54.150569Z","title":"arXiv preprint arXiv:2507.11419 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20258","last_updated":"2026-07-22T15:15:28Z","snapshot_observed_at":"2026-08-15T13:56:23.158325Z","submitted_at":"2026-07-22T15:15:28Z","title":"Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-01T10:30:54.150569Z"},"links":{"cited_paper":"/paper/2507.11419","citing_paper":"/paper/2607.20258"},"observation_digest":"sha256:4f54a051028b1e6d56f37a87bff528831a263be83c997c86653e6674e46b335d","observation_id":"b41755bc-711a-4383-8277-6f570f8b480c","resolution":{"observed_at":"2026-08-01T10:30:54.150569Z","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-01T10:30:54.159539Z","title":"Statistics & Probability Letters , volume=","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.20258","last_updated":"2026-07-22T15:15:28Z","snapshot_observed_at":"2026-08-15T13:56:23.158325Z","submitted_at":"2026-07-22T15:15:28Z","title":"Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-01T10:30:54.159539Z"},"links":{"citing_paper":"/paper/2607.20258"},"observation_digest":"sha256:85859343d38d00269c158ac15dc414006f496b7046d7b6d06eb15dd3ad651b8b","observation_id":"5ccd1f6a-9f61-4116-b6bc-39ef95db664e","resolution":{"observed_at":"2026-08-01T10:30:54.159539Z","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-01T10:30:54.289724Z","title":"The Annals of Mathematical Statistics , pages=","venue":null,"work_id":null,"year":1956},"citing_paper":{"arxiv_id":"2607.20258","last_updated":"2026-07-22T15:15:28Z","snapshot_observed_at":"2026-08-15T13:56:23.158325Z","submitted_at":"2026-07-22T15:15:28Z","title":"Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-01T10:30:54.289724Z"},"links":{"citing_paper":"/paper/2607.20258"},"observation_digest":"sha256:3b82b2afaf11b9ca181b4ff62594fdfc4eb999ffa0014ce13552faa6091c1167","observation_id":"0f29eacf-0761-4907-93b9-ed0cc973ac6e","resolution":{"observed_at":"2026-08-01T10:30:54.289724Z","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-01T10:30:54.335013Z","title":"The annals of Probability , pages=","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2607.20258","last_updated":"2026-07-22T15:15:28Z","snapshot_observed_at":"2026-08-15T13:56:23.158325Z","submitted_at":"2026-07-22T15:15:28Z","title":"Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-01T10:30:54.335013Z"},"links":{"citing_paper":"/paper/2607.20258"},"observation_digest":"sha256:b70edb98a4833b2e9207e5f1577653953e5bdeb6cd13a7ddfa6eadba8e21bfcf","observation_id":"f6e893e3-781b-4f37-bc5c-1bcc6db5e891","resolution":{"observed_at":"2026-08-01T10:30:54.335013Z","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-01T10:30:54.397100Z","title":"Journal of the ACM (JACM) , volume=","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.20258","last_updated":"2026-07-22T15:15:28Z","snapshot_observed_at":"2026-08-15T13:56:23.158325Z","submitted_at":"2026-07-22T15:15:28Z","title":"Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-01T10:30:54.397100Z"},"links":{"citing_paper":"/paper/2607.20258"},"observation_digest":"sha256:748c6a299c33f4e6794c0b536a9c8d6c1125454ecc6e68d9b5527905e07f8890","observation_id":"b3009aab-4a96-4b88-8fe1-97c1a84e2c87","resolution":{"observed_at":"2026-08-01T10:30:54.397100Z","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-01T10:30:54.506991Z","title":"2019 , publisher=","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.20258","last_updated":"2026-07-22T15:15:28Z","snapshot_observed_at":"2026-08-15T13:56:23.158325Z","submitted_at":"2026-07-22T15:15:28Z","title":"Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-01T10:30:54.506991Z"},"links":{"citing_paper":"/paper/2607.20258"},"observation_digest":"sha256:58ea65e9d2357be505ca42e4c8b2818992675756ef8cc5d1af69331617537bdc","observation_id":"a5d161ac-68ca-4137-9829-e86ccd6817f9","resolution":{"observed_at":"2026-08-01T10:30:54.506991Z","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-01T10:30:54.574934Z","title":"The Thirty Sixth Annual Conference on Learning Theory , pages=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.20258","last_updated":"2026-07-22T15:15:28Z","snapshot_observed_at":"2026-08-15T13:56:23.158325Z","submitted_at":"2026-07-22T15:15:28Z","title":"Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-01T10:30:54.574934Z"},"links":{"citing_paper":"/paper/2607.20258"},"observation_digest":"sha256:e2a4281d85948cb1ef637f7fae875b43cb5d554d0fde89ac62e6d13fd2e1c4a4","observation_id":"e73831be-f8f8-45dc-9fe2-58141e5fd2df","resolution":{"observed_at":"2026-08-01T10:30:54.574934Z","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-01T10:30:54.705698Z","title":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20258","last_updated":"2026-07-22T15:15:28Z","snapshot_observed_at":"2026-08-15T13:56:23.158325Z","submitted_at":"2026-07-22T15:15:28Z","title":"Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-01T10:30:54.705698Z"},"links":{"citing_paper":"/paper/2607.20258"},"observation_digest":"sha256:383e18e6a52ea69ca40dbb0037d28831f04fa58a6a9767e5e3c7242adfddeffb","observation_id":"e38c36fe-8aa4-4e29-ace8-7477e24ebfc1","resolution":{"observed_at":"2026-08-01T10:30:54.705698Z","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-01T10:30:54.764103Z","title":"Artificial Intelligence , volume=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20258","last_updated":"2026-07-22T15:15:28Z","snapshot_observed_at":"2026-08-15T13:56:23.158325Z","submitted_at":"2026-07-22T15:15:28Z","title":"Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-01T10:30:54.764103Z"},"links":{"citing_paper":"/paper/2607.20258"},"observation_digest":"sha256:bbd39c6ca1bdd8e6d8001c78fd76eafe6ef52459f02cef09f0197d95c0aa12b3","observation_id":"f774e7c8-c9e6-4640-b38f-3654394bd3e9","resolution":{"observed_at":"2026-08-01T10:30:54.764103Z","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-01T10:30:54.837765Z","title":"Proceedings of the 22nd ACM Conference on Economics and Computation , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20258","last_updated":"2026-07-22T15:15:28Z","snapshot_observed_at":"2026-08-15T13:56:23.158325Z","submitted_at":"2026-07-22T15:15:28Z","title":"Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-01T10:30:54.837765Z"},"links":{"citing_paper":"/paper/2607.20258"},"observation_digest":"sha256:9e14e675c537806eda13f09b7dd1be6174c49e52494e874b2d0643f8960ebc66","observation_id":"9e584707-48fd-482f-adca-e953314401f4","resolution":{"observed_at":"2026-08-01T10:30:54.837765Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.01529","last_updated":"2025-03-03T13:38:23Z","snapshot_observed_at":"2026-08-14T19:02:34.585535Z","submitted_at":"2025-03-03T13:38:23Z","title":"Online Two-Sided Markets: Many Buyers Enhance Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.01529","snapshot_observed_at":"2026-08-01T10:30:55.052878Z","title":"arXiv preprint arXiv:2503.01529 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20258","last_updated":"2026-07-22T15:15:28Z","snapshot_observed_at":"2026-08-15T13:56:23.158325Z","submitted_at":"2026-07-22T15:15:28Z","title":"Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-01T10:30:55.052878Z"},"links":{"cited_paper":"/paper/2503.01529","citing_paper":"/paper/2607.20258"},"observation_digest":"sha256:fc6e4444ad58778b6caf2353450b2faa6c5154912b30bf4b49807d18eb7368dc","observation_id":"c931acd0-65c8-45cc-9cfa-446b917b5cde","resolution":{"observed_at":"2026-08-01T10:30:55.052878Z","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-01T10:30:55.139181Z","title":"Proceedings of the 25th ACM Conference on Economics and Computation , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20258","last_updated":"2026-07-22T15:15:28Z","snapshot_observed_at":"2026-08-15T13:56:23.158325Z","submitted_at":"2026-07-22T15:15:28Z","title":"Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-01T10:30:55.139181Z"},"links":{"citing_paper":"/paper/2607.20258"},"observation_digest":"sha256:0287031c8eec867c5b97a71b8e4cbced286b974ed16c3e545aa9abfcd336c95f","observation_id":"916525f4-0ee0-449a-9d25-5f1f918fd426","resolution":{"observed_at":"2026-08-01T10:30:55.139181Z","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-01T10:30:55.256846Z","title":"Proceedings of the 25th ACM Conference on Economics and Computation , pages=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20258","last_updated":"2026-07-22T15:15:28Z","snapshot_observed_at":"2026-08-15T13:56:23.158325Z","submitted_at":"2026-07-22T15:15:28Z","title":"Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-01T10:30:55.256846Z"},"links":{"citing_paper":"/paper/2607.20258"},"observation_digest":"sha256:b5acf733d178b66e921e6afd74ebb09d33f65ba701201a5eb361eb963bf5eade","observation_id":"f3af06a1-4844-46a6-9422-c8996a3c4766","resolution":{"observed_at":"2026-08-01T10:30:55.256846Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2509.22563","last_updated":"2025-09-26T16:42:05Z","snapshot_observed_at":"2026-08-15T15:41:41.266140Z","submitted_at":"2025-09-26T16:42:05Z","title":"Nearly Tight Regret Bounds for Profit Maximization in Bilateral Trade","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.22563","snapshot_observed_at":"2026-08-01T10:30:55.393364Z","title":"arXiv preprint arXiv:2509.22563 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20258","last_updated":"2026-07-22T15:15:28Z","snapshot_observed_at":"2026-08-15T13:56:23.158325Z","submitted_at":"2026-07-22T15:15:28Z","title":"Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-01T10:30:55.393364Z"},"links":{"cited_paper":"/paper/2509.22563","citing_paper":"/paper/2607.20258"},"observation_digest":"sha256:cf1958e7086ff9482c5c000f5ba1a4620a925b8d408c4585a01657daf562600a","observation_id":"974f0ea7-289f-4767-bb26-605c7d8c8fe5","resolution":{"observed_at":"2026-08-01T10:30:55.393364Z","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-01T10:30:55.555890Z","title":"Algorithmic Learning Theory , pages=","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.20258","last_updated":"2026-07-22T15:15:28Z","snapshot_observed_at":"2026-08-15T13:56:23.158325Z","submitted_at":"2026-07-22T15:15:28Z","title":"Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-01T10:30:55.555890Z"},"links":{"citing_paper":"/paper/2607.20258"},"observation_digest":"sha256:d9ea62de02734948ba1638649e329cc6a7df35e3054af2fa7ccf0c5b3995d3a8","observation_id":"8cfd250b-997a-4f29-91de-722035229f78","resolution":{"observed_at":"2026-08-01T10:30:55.555890Z","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-01T10:30:55.659967Z","title":"Mathematics of Operations Research , volume=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20258","last_updated":"2026-07-22T15:15:28Z","snapshot_observed_at":"2026-08-15T13:56:23.158325Z","submitted_at":"2026-07-22T15:15:28Z","title":"Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-01T10:30:55.659967Z"},"links":{"citing_paper":"/paper/2607.20258"},"observation_digest":"sha256:390fc86ffff0860fe77b723e898b62069f2fa277c0bc6f372462058ca2c56e0d","observation_id":"8b706117-3ce3-4362-99fd-53caa3f11bb8","resolution":{"observed_at":"2026-08-01T10:30:55.659967Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.20258","last_updated":"2026-07-22T15:15:28Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-15T13:56:23.158325Z","submitted_at":"2026-07-22T15:15:28Z","title":"Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs"},"reference_resolution":{"displayed":28,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":28,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":28},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 28 of 28 outbound references and 0 inbound Pith citation observations for arXiv:2607.20258."}