{"as_of":"2026-08-08T12:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:312d188b70d0e21b7f04b988edf878f58c0539122af6e1a1364132047b6c6cf9","coverage":[{"denominator":87,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":87,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-31T23:55:45.854240Z","state":"measured"},{"denominator":87,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":87,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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.23310/citation-record","integrity":"/paper/2607.23310/integrity","json":"/paper/2607.23310/citation-record.json","paper":"/paper/2607.23310"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T23:55:45.397102Z","title":"Online fair division: A survey","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.397102Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:c1b66c2ed827988bd1f3ba2a8322d0f8d240aee2860f5ebce7d645296d30cf63","observation_id":"85876983-1cd7-4ffc-b07d-f68059c236fb","resolution":{"observed_at":"2026-07-31T23:55:45.397102Z","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-07-31T23:55:45.403042Z","title":"Online fair division: Analysing a food bank problem","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.403042Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:b17eeb39f403d13440acc11a5bba5d59a35d93ec4a5caaf42e32303a6360b0be","observation_id":"27ca02fd-f821-46b3-844a-02356692a4ff","resolution":{"observed_at":"2026-07-31T23:55:45.403042Z","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-07-31T23:55:45.409174Z","title":"Better collective decisions via uncertainty reduction","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.409174Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:4851c1b6ae267473421652fdae39f4d2a0cdfa492be856ad750bd445fc41bdf0","observation_id":"60e20ff1-92c8-471f-9573-fad3531d720b","resolution":{"observed_at":"2026-07-31T23:55:45.409174Z","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-07-31T23:55:45.414649Z","title":"Online fair division for personalized 2-value instances","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.414649Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:b9ef7b1f31f1669d388ff8ffa4bf67d6b9d7f6cfe2db7c07e8c081bd6cf86649","observation_id":"a31b890f-66fd-4b5c-a658-05381fb97fbf","resolution":{"observed_at":"2026-07-31T23:55:45.414649Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2607.01159","last_updated":"2026-07-01T16:43:02Z","snapshot_observed_at":"2026-08-07T15:04:41.674296Z","submitted_at":"2026-07-01T16:43:02Z","title":"Online Fair Division Meets Reordering Buffers","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2607.01159","snapshot_observed_at":"2026-07-31T23:55:45.419969Z","title":"Online fair division meets reordering buffers.arXiv preprint, arXiv:2607.01159, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.419969Z"},"links":{"cited_paper":"/paper/2607.01159","citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:f5e8b32aa80d2b9f237c416aeb979a11c1fac5484b2c7a2253d786120afdb6ae","observation_id":"b3f0919e-7772-4e7d-9e29-53a9bbb31548","resolution":{"observed_at":"2026-07-31T23:55:45.419969Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.13530","last_updated":"2024-06-22T21:24:15Z","snapshot_observed_at":"2026-08-05T13:10:52.642719Z","submitted_at":"2024-02-21T04:57:32Z","title":"Best of Many in Both Worlds: Online Resource Allocation with Predictions under Unknown Arrival Model","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.13530","snapshot_observed_at":"2026-07-31T23:55:45.425931Z","title":"Best of many in both worlds: Online resource allocation with predictions under unknown arrival model.arXiv preprint arXiv:2402.13530, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.425931Z"},"links":{"cited_paper":"/paper/2402.13530","citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:ad0a8ea6cea29035c989bea3b16dc3af04b5bb0f25eec3eab9bfbe0446f6b194","observation_id":"f15339c7-4d07-490f-998a-3a274d3ca378","resolution":{"observed_at":"2026-07-31T23:55:45.425931Z","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-07-31T23:55:45.432774Z","title":"Strategyproof scheduling with predictions","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.432774Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:2099c860cfef5fce27fe2fe1899f5948e270966a9f236e988cb00bf1ac004870","observation_id":"afa8c57a-946c-447d-a7ed-8cebddbec4b8","resolution":{"observed_at":"2026-07-31T23:55:45.432774Z","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-07-31T23:55:45.438397Z","title":"Online nash social welfare maxi- mization with predictions","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.438397Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:b82507f1316a068d34fc11ab4c8431c17c031185ec04b7c111d0ffb6f169bed9","observation_id":"2276b841-3592-41f8-8a9c-2810f137d69d","resolution":{"observed_at":"2026-07-31T23:55:45.438397Z","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-07-31T23:55:45.443225Z","title":"Universal and tight online algorithms for generalized-mean welfare","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.443225Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:98866d0ebb1cb1370796474ce085d293f7d58289072d96a165c5da108015578e","observation_id":"bdd960a8-befc-4cf8-8afb-92821102116e","resolution":{"observed_at":"2026-07-31T23:55:45.443225Z","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-07-31T23:55:45.448376Z","title":"Guaranteeing envy-freeness under generalized assignment constraints","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.448376Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:20aa7520793a58db0fe31d6886b4484fdf9504c8b25f02016b4cf4d00292fc74","observation_id":"89e7ad42-653b-4d72-b161-c7f5dba3cc47","resolution":{"observed_at":"2026-07-31T23:55:45.448376Z","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-07-31T23:55:45.454264Z","title":"How to make envy vanish over time","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.454264Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:131f743ee6eff795eaf213e5bbf974455cbe6de135083da498ca9f654ea4bd9e","observation_id":"8e8b5fe7-d6bb-4a04-a298-8a617dccf1af","resolution":{"observed_at":"2026-07-31T23:55:45.454264Z","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-07-31T23:55:45.460443Z","title":"Kazachkov, Ariel D","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.460443Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:805d994e422669efa1ba7c2dde87b4cbd6e5dccb40a593595a99e4fb1a00ea79","observation_id":"f5cc8eec-8db3-4ba2-8661-c9b1c3eacefc","resolution":{"observed_at":"2026-07-31T23:55:45.460443Z","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-07-31T23:55:45.465708Z","title":"Dynamic fair division with partial informa- tion.Operations Research, 73(4):1876–1896, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.465708Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:0e916a7fa01d1baa7cc2074fa7412598dfda32c92de541d925b1174cb85d53ba","observation_id":"cde8df71-7087-4a38-b5de-76de13d441a9","resolution":{"observed_at":"2026-07-31T23:55:45.465708Z","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-07-31T23:55:45.470543Z","title":"The combinatorial assignment problem: Approximate competitive equilibrium from equal incomes.Journal of Political Economy, 119(6):1061–1103, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.470543Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:7a11883f0011418866adafc64e8623aa321c4a403a3554db9ac375aa3f6b6993","observation_id":"a600818d-b20d-4bb0-bff3-6bf6f15326a5","resolution":{"observed_at":"2026-07-31T23:55:45.470543Z","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-07-31T23:55:45.476477Z","title":"Repeatedly matching items to agents fairly and efficiently","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.476477Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:714f0213c24e90421db2aacd079a37de5a1720bf27917ef1544eaba256176e0b","observation_id":"3b04f95c-c267-410e-8fd7-443c313ec7b0","resolution":{"observed_at":"2026-07-31T23:55:45.476477Z","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-07-31T23:55:45.481619Z","title":"Envy-freeness up to any item with high nash welfare: The virtue of donating items","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.481619Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:43f94a5a506b7c7d29be1cb1485ba5397372999de218d065092e56539549e505","observation_id":"eb5d7173-2dc0-4848-a250-f33390c44f22","resolution":{"observed_at":"2026-07-31T23:55:45.481619Z","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-07-31T23:55:45.486293Z","title":"The unreasonable fairness of maximum nash welfare.ACM Transactions on Economics and Computation, 7(3):1–32, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.486293Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:3908b30da3806d6cf7a54fe542400ccf1e9acd4368fa6a12c1dc36e1bd26959c","observation_id":"49064e41-c549-48b2-8470-36566d9b6aca","resolution":{"observed_at":"2026-07-31T23:55:45.486293Z","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-07-31T23:55:45.491837Z","title":"A little charity guarantees almost envy-freeness.SIAM Journal on Computing, 50(4):1336–1358, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.491837Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:68498cfed9b321358e300f945986fd0b2ea4fbcbe634ed19d1e7f76af3ccc8aa","observation_id":"ba223bb1-a296-4f45-b430-4877771217a2","resolution":{"observed_at":"2026-07-31T23:55:45.491837Z","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-07-31T23:55:45.496526Z","title":"Approximate proportionality in online fair division","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.496526Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:2efca11d996ff4d0e2e6131c6093ee7cae4e46aab9561484a1a1da9918adc6cd","observation_id":"909d4486-b184-4dbe-b263-b0dd79fe93bc","resolution":{"observed_at":"2026-07-31T23:55:45.496526Z","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-07-31T23:55:45.502103Z","title":"Plant-and-steal: Truthful fair allocations via predictions","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.502103Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:eed15f0119b40b9d00b44995463fb8c9199c3879797631a2623d07b3ed3dadbf","observation_id":"5418759a-4920-4389-a9a2-daa943ac2f1b","resolution":{"observed_at":"2026-07-31T23:55:45.502103Z","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-07-31T23:55:45.507006Z","title":"A general framework for learning-augmented online allo- cation","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.507006Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:af142ca02d44a2f49411e2b99eaa08a35138ea46b44ffae6283937b6dca54676","observation_id":"8f8a11e1-9679-4c68-87bd-f9153e87f9d3","resolution":{"observed_at":"2026-07-31T23:55:45.507006Z","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-07-31T23:55:45.512377Z","title":"Delayed assignments in online non-centroid clustering with stochastic arrivals","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.512377Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:dc072911a8aaba2c4ada27d7fcbcc8e1760cb2327c8ffa8d4ef9cf786f5b3f48","observation_id":"d9ac06c9-ab23-4036-88d2-01d92a1c7323","resolution":{"observed_at":"2026-07-31T23:55:45.512377Z","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-07-31T23:55:45.517440Z","title":"Online coalitional skill formation","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.517440Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:267e8fc4271eb91315fb902d81a0b1dfc9f973ebb5ea612812adabb794322512","observation_id":"de682bfe-9cd2-4616-ba10-d78cfa102908","resolution":{"observed_at":"2026-07-31T23:55:45.517440Z","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-07-31T23:55:45.522817Z","title":"Online learning of partitions in additively separable hedonic games","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.522817Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:1a16c9313ae11e4357dc114c534e449ccc0282cbc764dbdf7c138270cc8c8882","observation_id":"d8a87558-3878-47fa-8f98-02539adc19b4","resolution":{"observed_at":"2026-07-31T23:55:45.522817Z","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-07-31T23:55:45.528515Z","title":"Online friends partitioning under uncertainty","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.528515Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:065c0069f3d1ce6ed5954234f195aea050e7b8f18f9b95e424cb7dd2cf19763f","observation_id":"6c591571-616b-4cd2-8f0d-aedc4559106b","resolution":{"observed_at":"2026-07-31T23:55:45.528515Z","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-07-31T23:55:45.533869Z","title":"Decentralized online learning by selfish agents in coalition formation","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.533869Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:17615aa811bb7e0efe51427a0f8ca3775e9da8adeb691bb5d4f878193588272e","observation_id":"865da4d2-f208-49e3-9c17-4188a7e02156","resolution":{"observed_at":"2026-07-31T23:55:45.533869Z","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-07-31T23:55:45.539672Z","title":"Online learning of fair coalition structures","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.539672Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:df7148d9e1358f7065365a148ffa471d825757402fba127893ee6e8243be5cd9","observation_id":"161ff0cd-622a-41b9-90f5-cba1db79c930","resolution":{"observed_at":"2026-07-31T23:55:45.539672Z","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-07-31T23:55:45.544749Z","title":"Online learning of coalition structures by selfish agents","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.544749Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:8c98625a9eb1b4259824b6ee7ae97cca05714be49472184e6489205c3f29f49a","observation_id":"5eaa429a-ca89-4576-ab52-fd0f52ff0ec9","resolution":{"observed_at":"2026-07-31T23:55:45.544749Z","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-07-31T23:55:45.549662Z","title":"Temporal fair division","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.549662Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:0c9c0b5ef38ec3595b80ea499861289b8288b447b1b2bab2c9fdc45d6ef92487","observation_id":"0fa7cf4c-63b1-4944-9bf7-789685e40bf3","resolution":{"observed_at":"2026-07-31T23:55:45.549662Z","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-07-31T23:55:45.554235Z","title":"Fairness in temporal slot assignment","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.554235Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:076f06948971fad7da3cd28715b8cc5f48bd38bef4a7f856faef2a9ae245118d","observation_id":"85e254b7-89ce-4e23-bdb0-dbe63869ed26","resolution":{"observed_at":"2026-07-31T23:55:45.554235Z","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-07-31T23:55:45.559901Z","title":"Fair division of chores with budget constraints","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.559901Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:ab64829a428b056de03114b2eb837abf032a5179113c728680cbbeb602351c5f","observation_id":"eb5e80f9-b360-4040-9ca6-b57fe383c879","resolution":{"observed_at":"2026-07-31T23:55:45.559901Z","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-07-31T23:55:45.564519Z","title":"Temporal elections: Welfare, strategyproofness, and proportionality","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.564519Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:53e13aa36d311ead5ab623cb40d672589782d38bc40c6b74cb16b2973118e9ee","observation_id":"c4472994-2c6a-42f6-a3e9-39e048fc5e86","resolution":{"observed_at":"2026-07-31T23:55:45.564519Z","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-07-31T23:55:45.570374Z","title":"Temporal fairness in multiwinner voting","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.570374Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:3a415fa94f8f111f62c5205cbd91cd3c047b5c9943a41e8e21b6ac842f341b37","observation_id":"475a41ef-7985-4ba7-bd88-8de54aab66df","resolution":{"observed_at":"2026-07-31T23:55:45.570374Z","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-07-31T23:55:45.575276Z","title":"Temporal fair division of indivisible items","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.575276Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:2daa18abd4104d60b24e8f99c7447fb71100f35a2a26f8080aac4358a719fdb0","observation_id":"8d3eadbc-c6af-4423-9768-9f29c91c3a8c","resolution":{"observed_at":"2026-07-31T23:55:45.575276Z","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-07-31T23:55:45.580096Z","title":"Not in my backyard! temporal voting over public chores","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.580096Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:911ea4224202b9789595c0ebadc8aa3dbb02ea82354a976039c9cb0ac2279515","observation_id":"7221d44a-eca6-454b-a5ec-767e6db94267","resolution":{"observed_at":"2026-07-31T23:55:45.580096Z","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-07-31T23:55:45.584920Z","title":"Verifying proportionality in tem- poral voting","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.584920Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:daedaf2bb8f76cb50313e59f63866a0f5d49c14f57ea2e44b817a10ff6677e8e","observation_id":"4cca06c9-48f0-41ce-9157-5191915001bc","resolution":{"observed_at":"2026-07-31T23:55:45.584920Z","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-07-31T23:55:45.590212Z","title":"Online ad assignment with free disposal","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.590212Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:1eef01d5ee7488d8dcc91e75cafbe7952ac5e91ad9c554f582b526f1592388ee","observation_id":"d300d88d-cc32-4475-b571-35d9db192e58","resolution":{"observed_at":"2026-07-31T23:55:45.590212Z","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-07-31T23:55:45.594802Z","title":"Dynamic fair division with minimal disrup- tions","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.594802Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:05f0442046d88f6cfc2357c383cd5ecfccaf66e0d506a3d34f72a8cec04ad543","observation_id":"cf2cb782-c385-429b-b4f3-13d7deb4d16b","resolution":{"observed_at":"2026-07-31T23:55:45.594802Z","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-07-31T23:55:45.599745Z","title":"Approximation algorithm for computing budget-feasible ef1 alloca- tions","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.599745Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:457177627e3b2861589a7a99352ccc5d3a7302c9d69d6f33f8f47764753a39c8","observation_id":"f18ff1f7-edec-4c79-9856-23376f528aca","resolution":{"observed_at":"2026-07-31T23:55:45.599745Z","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-07-31T23:55:45.604291Z","title":"Minimizing cumulative envy in allocating a sequence of items","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.604291Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:a0ee7bf8e778dbccdaca12bbdafbcc1fb6d90f61d3d25e3ae22b31d20f45c24b","observation_id":"ae45b692-f5b3-4665-9310-a8b2515fe53b","resolution":{"observed_at":"2026-07-31T23:55:45.604291Z","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-07-31T23:55:45.608748Z","title":"Achieving a fairer future by changing the past","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.608748Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:4ab9e796a09487e39bb784bb5f8b55b0bb46fab7f5b089bbdfe4cc067e77258e","observation_id":"318a213a-d0a4-40e4-9baa-ef9d38c32b27","resolution":{"observed_at":"2026-07-31T23:55:45.608748Z","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-07-31T23:55:45.614023Z","title":"How to match when all vertices arrive online","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.614023Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:3b666b6dceebe1f2cd698c1d5ff384b4f201b5b43d92d3727b275ed4dc4f15f3","observation_id":"0c103c51-35e4-4419-8098-be8ae4852da7","resolution":{"observed_at":"2026-07-31T23:55:45.614023Z","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-07-31T23:55:45.619659Z","title":"The long arm of Nashian allocation in onlinep-mean welfare maximization","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.619659Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:720e12adede3bb4a3790e4b2c86896f52e5c343647cb0e19197dc92bb49760e9","observation_id":"b9995394-314a-4fdb-bdb8-795663881b51","resolution":{"observed_at":"2026-07-31T23:55:45.619659Z","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-07-31T23:55:45.624603Z","title":"Speed is as powerful as clairvoyance.Journal of the ACM, 47 (4):617–643, 2000","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.624603Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:7d619b11f42ce51b00d1ac4fe9a83dbfcfcc5d879de0474704b5363e198d207e","observation_id":"14b0e792-b5a1-4209-aacf-0b74b5f82a2f","resolution":{"observed_at":"2026-07-31T23:55:45.624603Z","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-07-31T23:55:45.630088Z","title":"An optimal algorithm for on-line bipartite matching","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.630088Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:3bc7df5e6bc0367b1e0c5d742d0ddcb80f25dde4f9072c1c272815f85e1b13d1","observation_id":"e41d11d9-74a6-457b-8551-64a34362ee28","resolution":{"observed_at":"2026-07-31T23:55:45.630088Z","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-07-31T23:55:45.634735Z","title":"Dynamic fair division problem with general valuations","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.634735Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:24776b7a5424d38a99713941b52562b619b52e2b5893841aa485c2d58509aa35","observation_id":"d36b8f5d-1843-4d51-8c77-d1baf9a339fb","resolution":{"observed_at":"2026-07-31T23:55:45.634735Z","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-07-31T23:55:45.639600Z","title":"Fairness in repeated matching: A maximin perspective","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.639600Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:88652d53284f0fda9d4b7b22bd4865ae3747edd6b8b45d959743d169cdd2a9ec","observation_id":"9f8b229d-deb7-4bf9-a62a-de56fa614131","resolution":{"observed_at":"2026-07-31T23:55:45.639600Z","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-07-31T23:55:45.645418Z","title":"On approximately fair allocations of indivisible goods","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.645418Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:09a63b9ba83b41d202ad14f86a9bb32d49939442671b4fed882a5cd81c870e9f","observation_id":"9a8913fa-214d-403b-9b36-8521bc59c3b4","resolution":{"observed_at":"2026-07-31T23:55:45.645418Z","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-07-31T23:55:45.650086Z","title":"Competitive caching with machine learned advice.Journal of the ACM, 68(4):1–25, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.650086Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:22a34ab5f7a87931054baa9991a786994eb7c9edd0f0e1fd729c061b18ad07fd","observation_id":"297f2126-9806-474f-bd73-1f71434d10ee","resolution":{"observed_at":"2026-07-31T23:55:45.650086Z","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-07-31T23:55:45.655035Z","title":"John Wiley & Sons, Inc., 1990","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.655035Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:337f1d31d8336a8e5ee27f8636e573d94d908017c37d999b571dcd270de2b753","observation_id":"d1a33321-2414-4528-a5e5-7499adba07fa","resolution":{"observed_at":"2026-07-31T23:55:45.655035Z","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-07-31T23:55:45.660137Z","title":"Adwords and generalized online matching.Journal of the ACM, 54(5):22–es, 2007","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.660137Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:2335413e4ff3a975ffd6b359afa91e9a64f2a07c23f1d8cd5df0b0c8f74c53b3","observation_id":"ef05af6b-088d-407e-ae4c-6f62bbdad5d6","resolution":{"observed_at":"2026-07-31T23:55:45.660137Z","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-07-31T23:55:45.666281Z","title":"Cambridge University Press, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.666281Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:f0441f10b5296f0c42cc7b1872ae19793e5e37b8ae377f4fe6416153ba228e3d","observation_id":"13129d59-2423-4016-baf4-03f1b47e8e79","resolution":{"observed_at":"2026-07-31T23:55:45.666281Z","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-07-31T23:55:45.672896Z","title":"Understanding efx allocations: Counting and variants","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.672896Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:16eccc90be77433a77bdb1590b914e7409363462d0dd831e97f50b0cf77ad70d","observation_id":"205a34a3-359f-4f30-b261-2c94957f7315","resolution":{"observed_at":"2026-07-31T23:55:45.672896Z","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-07-31T23:55:45.677995Z","title":"Online fair division with additional information","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.677995Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:667d9acc6ce931f06c5bb1091b25c2002e347c1533a7924aaf85fb0eef30bc8e","observation_id":"60bc9714-b3de-4a40-b5e8-d3c80be5c2df","resolution":{"observed_at":"2026-07-31T23:55:45.677995Z","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-07-31T23:55:45.683640Z","title":"Strengthening proportionality in tem- poral voting","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.683640Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:44b505c71c48dedfb197b8dc910e6e7fe027219faf60170e6d955211b32078a7","observation_id":"98f65aff-5d8f-47a3-94df-c111297a5042","resolution":{"observed_at":"2026-07-31T23:55:45.683640Z","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-07-31T23:55:45.688906Z","title":"Improving online algorithms via ml predictions","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.688906Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:25f135d777a908158693b42a770067d75dbd73ed700cd15a3c2dd3fce0bdb487","observation_id":"2ca6ac69-2ed4-43c1-b948-d529a6f03efd","resolution":{"observed_at":"2026-07-31T23:55:45.688906Z","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-07-31T23:55:45.694249Z","title":"Cambridge University Press, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.694249Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:0fc552a65533abe622a35d2a901af987f8380ce3fae74343a22c2826ad394e02","observation_id":"c6c69768-3961-421e-ade9-e3cccbeac279","resolution":{"observed_at":"2026-07-31T23:55:45.694249Z","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-07-31T23:55:45.699420Z","title":"Online ad allocation with predictions","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.699420Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:fa811fd2f1ee0590cae1331532429348b67152e72da8813a854488e8c4be4244","observation_id":"dd11620b-180f-404b-ae42-f61e86f2f6f6","resolution":{"observed_at":"2026-07-31T23:55:45.699420Z","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-07-31T23:55:45.704122Z","title":"Online al- gorithms for the Santa Claus problem","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.704122Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:3d7e35c2b628cbc0c7c6a75d1dfe41e4c6e2a21fe0f72823ae7b49823aee3189","observation_id":"b0d341e3-f90b-4396-bfd8-bab4e12817e6","resolution":{"observed_at":"2026-07-31T23:55:45.704122Z","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-07-31T23:55:45.709900Z","title":"Constraints in fair division.ACM SIGecom Exchanges, 19(2):46–61, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.709900Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:a6950c84a9639237820b241ffa055dd1bf8c25c0ac2e7a5bc58ded0c5448158c","observation_id":"bc4f0b87-e640-4d59-ba2c-3a839ce2b4d3","resolution":{"observed_at":"2026-07-31T23:55:45.709900Z","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-07-31T23:55:45.715296Z","title":"The price of proportional representation in temporal voting.Proceedings of the 35th International Joint Conference on Artificial Intelligence (IJCAI), 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.715296Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:b4b4cd2ef9e18615516c4c128c1892b980f401428375edeb5f571b7764fc3a60","observation_id":"d131236b-28e8-4a62-8ab7-117e5fc546ee","resolution":{"observed_at":"2026-07-31T23:55:45.715296Z","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-07-31T23:55:45.720345Z","title":"Two-sided online bipartite matching and vertex cover: Beating the greedy algorithm","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.720345Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:f25140a1400fc145c98e62fe621f0e1737b7801bdb2ea4a8c9a109559fff9eac","observation_id":"b1761a61-8b6f-470d-938e-56c8d24b41c9","resolution":{"observed_at":"2026-07-31T23:55:45.720345Z","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-07-31T23:55:45.725416Z","title":"Online fair allocations with binary valuations and beyond","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.725416Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:2815f690ee6461e1aee7d27c9ce24538c5a9daad96d253ad2963fdda943d2fce","observation_id":"72bb9352-d8bf-457c-8e02-c4fbed472fce","resolution":{"observed_at":"2026-07-31T23:55:45.725416Z","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-07-31T23:55:45.730824Z","title":"Budget-feasible maximum nash social welfare is almost envy-free","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.730824Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:fd03329a74fc434f58d2ccc85715bc9f8fbb0cac04319eea856fd516284658df","observation_id":"73e2537a-0f8b-49a1-a1a7-89920d62dbba","resolution":{"observed_at":"2026-07-31T23:55:45.730824Z","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-07-31T23:55:45.735590Z","title":"Multiwinner temporal voting with aversion to change","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.735590Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:32c2c8acee45abbe0c687c4eff6dd0c6cd782dfeaf30bbca54cd6a95ab024f52","observation_id":"01c6b301-6c6d-4cff-955d-2a51570101bb","resolution":{"observed_at":"2026-07-31T23:55:45.735590Z","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-07-31T23:55:45.740339Z","title":"Fairness-efficiency tradeoffs in dynamic fair division","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.740339Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:65b0beec85441355b11b73d9fe5d07149ec58038caf092d27ba8b5d961101fb5","observation_id":"e0d86246-1b48-4bc2-bd40-76b395d66b37","resolution":{"observed_at":"2026-07-31T23:55:45.740339Z","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-07-31T23:55:45.744878Z","title":"Multi-agent online scheduling: Mms allocations for indivisible items","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.744878Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:c2f814f6cf5ebfb98d79164a8be316c38911800c0883664c14682da7d6cd0034","observation_id":"c9514e1d-d347-45d4-bc98-bb83c014b86b","resolution":{"observed_at":"2026-07-31T23:55:45.744878Z","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-07-31T23:55:45.750025Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.750025Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:59c20473fffc9238cea380dd98b98a80bcee1d516655c92034c9d4267fd8389f","observation_id":"2c688bb9-0c12-4d87-883b-87baa9441648","resolution":{"observed_at":"2026-07-31T23:55:45.750025Z","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-07-31T23:55:45.755940Z","title":"Our learning-augmented framework differs fundamentally from these approaches","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.755940Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:7febbcbafe421fd10c988f9d65ecf660825dfe219fc830c2f1378cecd892d6c4","observation_id":"3a6df822-2428-459b-8808-1eb015076f0e","resolution":{"observed_at":"2026-07-31T23:55:45.755940Z","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-07-31T23:55:45.763218Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.763218Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:93d2522d7ea92d7a60743fbf73f079583c4132832527d8022f5cdd80222c8093","observation_id":"01d71fb8-2a5c-470d-8e1f-e77f507c1067","resolution":{"observed_at":"2026-07-31T23:55:45.763218Z","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-07-31T23:55:45.768478Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.768478Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:c312dbdf6c309d6afc537050793e2d7270824c30ec33c42579cd94945889135e","observation_id":"c91ff2dd-d6a4-4b2a-a19c-12a0a40a6b13","resolution":{"observed_at":"2026-07-31T23:55:45.768478Z","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-07-31T23:55:45.773530Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.773530Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:fca148b3272d1c4e83e2e08cb06ae163af7d309d171e4592daf31384e95388b4","observation_id":"c4cfaba1-d3cd-4dc2-b158-2c73e2a350d4","resolution":{"observed_at":"2026-07-31T23:55:45.773530Z","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-07-31T23:55:45.779430Z","title":"The algorithm is told the valid boundγ","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.779430Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:49a92618fd1258675d9ef727dfcfd11a740b845d5f2f36f7ce3b06ebcb23b5b3","observation_id":"7805584b-a7ea-4db8-81c8-6539005db158","resolution":{"observed_at":"2026-07-31T23:55:45.779430Z","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-07-31T23:55:45.785409Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.785409Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:624c9254ae2e530a68ecfaa8aabaf8f9a60b0b8da8510fc1a0ffa8451bea3b56","observation_id":"854ed216-203b-4224-b75f-a419d8ee4dae","resolution":{"observed_at":"2026-07-31T23:55:45.785409Z","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-07-31T23:55:45.791580Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.791580Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:05b0021f185bfbbad941b2ee5718e1cdc54e20fd5f573b8f8ddaf77e0e41bf0c","observation_id":"2bebae3b-48e7-4702-9c46-32ef847e1aec","resolution":{"observed_at":"2026-07-31T23:55:45.791580Z","resolver_source":null,"status":"parse_uncertain"},"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-07-31T23:55:45.797555Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.797555Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:c4b2217d416b8bff7b45ec430e98c68092ef4fbe8d09b7a9ee3e2443adb55052","observation_id":"12a26ab1-1753-47eb-bf6d-fc42423c9bb5","resolution":{"observed_at":"2026-07-31T23:55:45.797555Z","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-07-31T23:55:45.803642Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.803642Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:feed59144ee08f22548a444a8d81d0747f38cdef9b25989987ec30ec78689d96","observation_id":"775ef066-2016-4e30-bad5-5b6838c3f682","resolution":{"observed_at":"2026-07-31T23:55:45.803642Z","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-07-31T23:55:45.808816Z","title":"The statement holds both when the horizon is announced before the first arrival and when it is not announced","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.808816Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:aef0f234dd9ca304583ef3585ab9a41dfb8720f5d7f05737d3a8e348b1b9205e","observation_id":"e6c6234c-f0d4-4141-bcf3-aece618abf8b","resolution":{"observed_at":"2026-07-31T23:55:45.808816Z","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-07-31T23:55:45.814183Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.814183Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:23b8db51227b746f91f9402576354d05efcfbc67b659518f5ded0a950ce8715a","observation_id":"40855f60-ca18-4926-bd75-0d86ba5c98e9","resolution":{"observed_at":"2026-07-31T23:55:45.814183Z","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-07-31T23:55:45.818879Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.818879Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:a8879fad24bff9c114dd88b895870320c12fbd899e98a1b284ed83acdb1bc353","observation_id":"02e3dba4-a7a1-4bcc-a678-7b187555288b","resolution":{"observed_at":"2026-07-31T23:55:45.818879Z","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-07-31T23:55:45.823648Z","title":"ifs i(g)≤ εBi for alli, g, then AUG-GREEDYFIT(ε)is exactly FEF1","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.823648Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:659969cbc1c3a0a02c20f1975bab84dc4643b28ac12f2454422525f699193497","observation_id":"91db6a53-b5bb-4636-aa90-8422706c2102","resolution":{"observed_at":"2026-07-31T23:55:45.823648Z","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-07-31T23:55:45.829478Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.829478Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:df83c81317abb30e2263d902438bd67f9540a09d9bf6256254915ccc50a2cc3c","observation_id":"766757af-647c-4145-a819-09b9c50a04b6","resolution":{"observed_at":"2026-07-31T23:55:45.829478Z","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-07-31T23:55:45.834240Z","title":"The valueρ min is supplied in the original numerical scale of the instance","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.834240Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:76eb3b8132ff86cbe42faec6aebf5abcc849ad153b7ed5f70171b4267b97ba6e","observation_id":"2c1121b6-13c8-4690-9a0a-122528b34bfe","resolution":{"observed_at":"2026-07-31T23:55:45.834240Z","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-07-31T23:55:45.839474Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.839474Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:5281028993cc49f29a6b62be1201d262d49bde8174e16c0cd6ecf64889a5875f","observation_id":"210fb0a6-df34-45d9-842c-20f3dd3ebee4","resolution":{"observed_at":"2026-07-31T23:55:45.839474Z","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-07-31T23:55:45.845131Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.845131Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:d318090a383cbb68a5ed56d0e7f67ee886970f5160f4f3cf1560fd3b0b46fb5b","observation_id":"16bd8077-010d-4260-a3b8-7614dcb3d1da","resolution":{"observed_at":"2026-07-31T23:55:45.845131Z","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-07-31T23:55:45.849686Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.849686Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:d979dd4c63ff070d6320f2e2cdb18d085e0976ce289bf2a365b64b6d698d53c3","observation_id":"31298520-cbc0-4470-aa4b-bd59814c0da2","resolution":{"observed_at":"2026-07-31T23:55:45.849686Z","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-07-31T23:55:45.854240Z","title":"Proof.We reduce the claimed lower bound to the frontier lower bound of Theorem E.4 by scaling every value by the advised minimum density","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.854240Z"},"links":{"citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:44d2bd15db7572e0781b24715630f70a012ab6c02f0904accb98d0d123c0327e","observation_id":"998a1017-46ca-41bf-9fdb-644c8adc0b65","resolution":{"observed_at":"2026-07-31T23:55:45.854240Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","latest_version":1,"primary_category":"cs.GT","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints"},"reference_resolution":{"displayed":87,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":1,"unresolved":86,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":87},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 87 of 87 outbound references and 0 inbound Pith citation observations for arXiv:2607.23310."}