{"as_of":"2026-08-10T05:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e75f58eb8357478e8702d66df332fc4a21bd043071d9e0108d71d78be138e96f","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-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/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-08-09T19:20:22.796312Z","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:99645d016c5735c33a68242bf0d4c7ade77e72280571ce01768d1578adfc3952","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-08-09T19:20:22.796312Z","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:8757e60bc1edd01bbdaa9e1440529773876037c19c96722a303f8586bc12c768","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-08-09T19:20:22.796312Z","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:95f5425d29f6e1c2a69ae26226504d1357a0bdf45f545e284e97c1c1ce575da2","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-08-09T19:20:22.796312Z","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:01b84a93ab38f55b913519e4e107f0354164388fc745355c695d0f8e7136791e","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-08-09T19:20:22.796312Z","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:efc8503cfb1aaf7786b57714b45ac4cd59fca7fa1334a0cf5fdd9b1cd8fcc042","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-09T19:20:05.964905Z","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-08-09T19:20:22.796312Z","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:7f0a23a73df85e7d49b776c8357365cd5e704a85e1002c1a3a92482a9729a59c","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-08-09T19:20:22.796312Z","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:b276c2166d6d37784718c42c81bfc497febf7e67da12e4d0381a1368b4b2d801","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-08-09T19:20:22.796312Z","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:6d348fa74e13f3614fdf82ec99db7d8acd08c6c98acbb6f2094d0d4dd58c25df","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-08-09T19:20:22.796312Z","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:7c670f4342bd53ed8d605ddd00779eea9df9d060a531378171faf0e3e9bc0335","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-08-09T19:20:22.796312Z","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:c432c5cfe3be4a906abac17fb41b630e3df387f46948fa7b6571da200769d62e","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-08-09T19:20:22.796312Z","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:b74abfc33bfce348dce2cb1ff729e315ba5346e758c036f792fe12fc15b99618","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-08-09T19:20:22.796312Z","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:3e51143bb5019a44e7448ac79eb4dc78fd748a10f4468790fce4aee2c57184fe","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-08-09T19:20:22.796312Z","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:1b63a3b2532443188f93526a91c20070ca5f7afba0154e6575b122a14c075214","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-08-09T19:20:22.796312Z","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:acb25bf17110b770c3f3ce817477f453183e1974af74c24bcf7c87545f6163c0","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-08-09T19:20:22.796312Z","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:ed8fe1f4749464bf1e024fca64bcfe6b65d4f1c143d086822207955b241f50c7","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-08-09T19:20:22.796312Z","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:614582f4717ebb30c7b6b1b58ac1fa8d5db5311093eec6cb36d4d5236109fe81","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-08-09T19:20:22.796312Z","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:c10628b7d4aca766ee79794d151961aacc9d2b902d4f0b2431a42fb217ff03ac","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-08-09T19:20:22.796312Z","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:4525262c61bd3a86c24850aa96a7dd9a93bc0db13d17c6245a6278a6987f1087","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-08-09T19:20:22.796312Z","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:424a64d331c4a019449a846c32c445c1e36cb606ecb47a118a48e8a653671d81","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-08-09T19:20:22.796312Z","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:6a89b6f14a68d27410989a0828ffc590e1c74c02fca03675b531ec599971acc0","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-08-09T19:20:22.796312Z","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:2a2cf2d090c255008ab274efbf457fca661ba19494b7f8e5ced90684dbb3b5f4","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-08-09T19:20:22.796312Z","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:5b8979c1caceeeaff69e97ab2924c8b5a8332de5b789c2d8369fa5627cf9b3b1","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-08-09T19:20:22.796312Z","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:9f89e17ae5464482a5fb432ac94a8071eb35574fbdac5e34cec5ec6768b4c449","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-08-09T19:20:22.796312Z","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:73250b9342b1464dae0218770bd239f3af1f13df6e526df52b5e69973c72e637","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-08-09T19:20:22.796312Z","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:cfd8980b7518ab3a57646ab376cd439c42d2613c1777a7d57808d80ea40daa68","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-08-09T19:20:22.796312Z","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:1d8cb81169150e87badd38fb9d29a5ecc8dec21aae1a347ca4a6bf859f1a12db","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-08-09T19:20:22.796312Z","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:ac25e631ad9e534c63451c4653d4c69fff9c4ece2d874bfae386a9094a5776d1","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-08-09T19:20:22.796312Z","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:ceb905acd796b83225fab9f6669a3ded1cbfe4e708deff8b8f29eee0a3ee638b","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-08-09T19:20:22.796312Z","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:b1bebd63591306aabc409dea796a60e929b05feae74a6206c73d3bdc2513add5","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-08-09T19:20:22.796312Z","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:2eac0d46028c7e4295207a5b90e8f638483539a66e22f69fde9038c85a1e1522","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-08-09T19:20:22.796312Z","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:300f472d2f43201972aa56ea8dd7b77d7e9905d9343db55908ce7f8a1febcfbb","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-08-09T19:20:22.796312Z","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:fabf03c598e0184b8ed4063c4c99c0f258feca35ba3306b513367364b5525ca9","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-08-09T19:20:22.796312Z","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:f41b65daa84cd56801c28da9e85e5d95be4aae65a226994e7d5ac78a1e54dac0","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-08-09T19:20:22.796312Z","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:74598696d35573df5b8822aed787f3fa1420cbcc00c629800fcba8a2898e8ba8","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-08-09T19:20:22.796312Z","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:486a6497f8efb9119ceeaed48db48e3dfd0ae7f8aa571762263f1b3a426769a0","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-08-09T19:20:22.796312Z","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:086543859cf268268c01d9d5a36bc7d656217c8b7165f62d470d91665c51d7cf","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-08-09T19:20:22.796312Z","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:757b06248e50d0c0ab20004cc8a9d7b7735d56f642846fa4872652b3b10eaa58","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-08-09T19:20:22.796312Z","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:0556d48e744b179344d34b841153384fa73923caa0a1506912976ca4fe27e4ef","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-08-09T19:20:22.796312Z","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:60cf3485e0fc21cb24501178d4f9b13f499e25b3ad9e6df7b0a515986abcb969","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-08-09T19:20:22.796312Z","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:f908f4c558c72b3c626f3bda1b8438d76ba204108db98d51473b6076741074d8","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-08-09T19:20:22.796312Z","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:3d91c3ff552a7bd7368aa06dbe4968f3e19c386805353e80f00e9be22a2a4d4c","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-08-09T19:20:22.796312Z","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:38db0df7b5f22c8164bb020aaaaffbef5c040722dd70dd811546287154c6fc43","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-08-09T19:20:22.796312Z","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:0b5f683d76c570b00488c87785ad75a50c534d69a31d09b8d14f7602e17ebd8c","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-08-09T19:20:22.796312Z","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:74bd7e7b64ca282320352cdc364c0658f99ced7880543458c64e7047de8dfc1b","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-08-09T19:20:22.796312Z","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:d992512a1663a6851cf2a19d3582cf49486eed83b82279856e5b807061162af0","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-08-09T19:20:22.796312Z","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:2796e07de544ac1e961bdf42e086b89c9c152138073c5564f9395042444a2d57","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-08-09T19:20:22.796312Z","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:2bcb1682a81b377b224891daf634103417e17a925d597ff78e7b576a435cf47c","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-08-09T19:20:22.796312Z","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:f37369c78ccacf264986468c76d29191d71345483dd2e854913d42d4d91a70f7","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-08-09T19:20:22.796312Z","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:b162362a23e1ccf24abeac91376ddcc56a5ec21ced34b99951d2490a66a03627","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-08-09T19:20:22.796312Z","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:7c8bc59b7a564f9365c2a4d5b286a16414ff5ec58d446d45efd5d36a1758d718","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-08-09T19:20:22.796312Z","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:b4ba0cddf2861142625d75e71f3e1895b8c0cb19033105cd0857efc6654ed81e","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-08-09T19:20:22.796312Z","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:ced73db88d204f7d019c7a103106da08ed4cf847b3ed396ae22c3c69dc5c778d","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-08-09T19:20:22.796312Z","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:ec540979ab6c1d19fff73f3c91bb1d770ec9fd3a17922e79c829bcbb5e456d62","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-08-09T19:20:22.796312Z","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:04104c8295a53cb3e02d5218d0f80cd088195ace78b9f522ea93438a71c830bb","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-08-09T19:20:22.796312Z","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:7434dd78459b5150b6f167de81e678b49c5a890647a33f23f2af591b64f3aa86","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-08-09T19:20:22.796312Z","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:5deb395123ef4fc03ab25d3f69f9e5bab04e1a54d7263f37d21fa9eb9c791805","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-08-09T19:20:22.796312Z","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:0500f22cad0e88ad64cad35e04f02ef73d398bebe3c265444f1279adfa64ecae","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-08-09T19:20:22.796312Z","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:b114c9af88241a5727048dd06c9da36ecabf0bc7449d49c74d7b818d4da86df6","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-08-09T19:20:22.796312Z","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:cb5d9a97119a8e261af58ccb110ef792b16205ec030bd3d1c7ecccec031a680f","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-08-09T19:20:22.796312Z","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:f79870867aa576acb86ea2b2a4b118d348ded330a300a24d9105ffcd9b0581d0","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-08-09T19:20:22.796312Z","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:92947a358752c48c19b00d0584ee04436017783dae406fa4ade45f02f93b2577","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-08-09T19:20:22.796312Z","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:8a97d82175223f973da462cd59ce887dfb5df190e1f4ddfab3140907f626418c","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-08-09T19:20:22.796312Z","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:231bbd984a1d283262bad6a2f79f6eae8061b38c54fc24904c9103743646be93","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-08-09T19:20:22.796312Z","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:4e0a4a8838647412e57e3fe130d6b9e8ccd1eafac62203bcfe16aded1c88c7e0","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-08-09T19:20:22.796312Z","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:7d14fd36e155c2c719bf9a2b6d9c70162acfa67d14e0ee2cfce2a9c8f5528b8e","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-08-09T19:20:22.796312Z","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:50da2322b104b00c7e61d572a189d3e2609da33419af5fd52bdd316c4e0322a5","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-08-09T19:20:22.796312Z","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:a00daaef0bdda7cf1f26c5572bc7d8756e0739be751bf22ec6d364c0ff483afd","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-08-09T19:20:22.796312Z","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:d2416a9a0c3c3f84d2884b7c5b1056b163dcce3b9d1759d5ef9808601cd82135","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-08-09T19:20:22.796312Z","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:ca6072ec06b65d5e162b2e86db9ca8c3a39bfdc9df693fd086d81c08beba1177","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-08-09T19:20:22.796312Z","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:dda05dd4d024e57e2251b4cd7c89e1bd34366bbfb6b344bbb298a2e6cff2c965","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-08-09T19:20:22.796312Z","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:86ad4741719673b850791acdd9f1ebe21da7e0cfc8a7f8071aef80bf58a4303d","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-08-09T19:20:22.796312Z","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:b73e6c396fd0d2f4972347de8480aa346eb9609f8add050f09c2aa85bb875cec","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-08-09T19:20:22.796312Z","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:1d0e54e4357bf5d233a547bdb048316e565e99150db0fcc5906296d15d2f7ba2","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-08-09T19:20:22.796312Z","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:26485ec702785b77afcd470261ce37559930271a11207c984ee616e03b240e05","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-08-09T19:20:22.796312Z","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:6cba76eba60d2717287b92fa6c90086d61d316136fd7b07113a9691f111d8ef9","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-08-09T19:20:22.796312Z","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:c00d808396630347ae0934084cc056e14c909d85b01bced10548930b918c0e35","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-08-09T19:20:22.796312Z","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:ac875f9e4c38034fd3c3e0c459a04e1af0e1b9cf657fcdc2116c40cbfe865f58","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-08-09T19:20:22.796312Z","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:85ae333b9c9b26ed689ee4474140929cb4420567184fa26d27e1dce8907e3e01","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-08-09T19:20:22.796312Z","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:42d7c6759e259dbd6f6d1e30cc3757f8bca3b36baacd4618e658de130dd0fb1f","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-08-09T19:20:22.796312Z","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:da1eed00e5593c2bfd726cb0a4441d2b2d39e2fe1540a6257b1d53a494ba263d","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-08-09T19:20:22.796312Z","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:c4625187152146b9badc9b11e2cb64bb23df9030a33ae574aa24c88434a75176","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-08-09T19:20:22.796312Z","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:ab87927fbb34c501e04a04eedf364a8fdabebd1e800040926fb27ac5d97a359a","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-08-09T19:20:22.796312Z","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:56d47684c4979c5eba5102c313f3e86497de271e88f4f6010b3090f6a1962d4b","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-08-09T19:20:22.796312Z","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:3a87df38e1a9c04a32934ce2ef2b6febdd0fe339ed044d20dd0a64e4fcb8956c","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-08-09T19:20:22.796312Z","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:5ccb535fc53e09f26012d24fe83f2869d8bbf133058435c0bab1a23dc9458a97","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-08-09T19:20:22.796312Z","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:6aec729e3562f1031d1b2efd1004564fcb6b65dd1446086745fc354e213819bc","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-08-09T19:20:22.796312Z","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:320b3cb75123e7b0b60c5781f765ab7a5471f4e72574a85a45a054f8a6be010e","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-08-09T19:20:22.796312Z","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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 87 of 87 outbound references and 0 inbound Pith citation observations for arXiv:2607.23310."}