{"as_of":"2026-08-11T16:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bb6f989cf31022dc445fea6643e29c3e879a84f2ae444462d3dcf7b28238857f","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T16:47:23.539002Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T11:17:37.905974Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2507.12984","last_updated":"2025-07-17T10:39:27Z","snapshot_observed_at":"2026-08-06T16:31:02.473514Z","submitted_at":"2025-07-17T10:39:27Z","title":"Lower Bound for Online MMS Assignment of Indivisible Chores","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.12984","snapshot_observed_at":"2026-08-04T11:17:37.905974Z","title":"Lower bound for online MMS assignment of indivisible chores","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.06581","last_updated":"2026-07-07T22:41:23Z","snapshot_observed_at":"2026-08-04T11:17:35.801078Z","submitted_at":"2025-10-08T02:24:32Z","title":"Constant Weighted Maximin Share Approximations for Chores","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-04T11:17:37.905974Z"},"links":{"cited_paper":"/paper/2507.12984","citing_paper":"/paper/2510.06581"},"observation_digest":"sha256:1a30f9829e9298971a2607b1023086fbbf6d83241c2c4f8132409bc6b8fe8e8d","observation_id":"5c72174e-cbbb-4769-b0dd-891938f88083","resolution":{"observed_at":"2026-08-04T11:17:37.905974Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2507.12984/citation-record","integrity":"/paper/2507.12984/integrity","json":"/paper/2507.12984/citation-record.json","paper":"/paper/2507.12984"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:26.994979Z","title":"Simplification and im- provement of mms approximation","venue":null,"work_id":"348d680f-675a-442f-9d9d-5a9c363d647f","year":2023},"citing_paper":{"arxiv_id":"2507.12984","last_updated":"2025-07-17T10:39:27Z","snapshot_observed_at":"2026-08-06T16:31:02.473514Z","submitted_at":"2025-07-17T10:39:27Z","title":"Lower Bound for Online MMS Assignment of Indivisible Chores","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T16:47:21.485620Z"},"links":{"citing_paper":"/paper/2507.12984"},"observation_digest":"sha256:46b106ce2e38c0e616a90428c22f629c50a2c9e5ebf33a2f5b66c809f02141f3","observation_id":"ec906d5e-5517-4953-af32-0f4402604917","resolution":{"observed_at":"2026-08-06T16:47:27.052379Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:26.842729Z","title":"Random- ized and deterministic maximin-share approximations for fractionally subadditive valuations","venue":null,"work_id":"4a084b9e-3470-48af-a63c-4f388e7f736d","year":2024},"citing_paper":{"arxiv_id":"2507.12984","last_updated":"2025-07-17T10:39:27Z","snapshot_observed_at":"2026-08-06T16:31:02.473514Z","submitted_at":"2025-07-17T10:39:27Z","title":"Lower Bound for Online MMS Assignment of Indivisible Chores","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T16:47:21.624147Z"},"links":{"citing_paper":"/paper/2507.12984"},"observation_digest":"sha256:078f92433d83c95f227d6c2e955423456c8cc43c417404b6d3f472c5f46270ce","observation_id":"1b4f240c-8766-45a3-b7a6-20ddde4da6de","resolution":{"observed_at":"2026-08-06T16:47:26.945747Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:26.626207Z","title":"Approximation al- gorithms for computing maximin share allocations.ACM Transactions on Algorithms (TALG), 13(4):52, 2017","venue":null,"work_id":"96cc4d65-10e2-4d53-9c99-1db7e5b0d518","year":2017},"citing_paper":{"arxiv_id":"2507.12984","last_updated":"2025-07-17T10:39:27Z","snapshot_observed_at":"2026-08-06T16:31:02.473514Z","submitted_at":"2025-07-17T10:39:27Z","title":"Lower Bound for Online MMS Assignment of Indivisible Chores","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T16:47:21.724494Z"},"links":{"citing_paper":"/paper/2507.12984"},"observation_digest":"sha256:ba6c9de15c1b8ea693dc7c3adf09922c0df387451432c9e94061d02b35ea7e7e","observation_id":"294a07ea-e14a-4d0c-92a9-bef4fc8d7343","resolution":{"observed_at":"2026-08-06T16:47:26.736911Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:26.455913Z","title":"Cambridge University Press, 1996","venue":null,"work_id":"4f210359-a950-41b8-8d14-8c5ee0b9cfee","year":1996},"citing_paper":{"arxiv_id":"2507.12984","last_updated":"2025-07-17T10:39:27Z","snapshot_observed_at":"2026-08-06T16:31:02.473514Z","submitted_at":"2025-07-17T10:39:27Z","title":"Lower Bound for Online MMS Assignment of Indivisible Chores","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T16:47:21.892569Z"},"links":{"citing_paper":"/paper/2507.12984"},"observation_digest":"sha256:f63575b15496ddd773103a0e1ca61cf44a3a8b8f0365fed69e7b44f9a66e9d7e","observation_id":"2ad2dd85-aabc-4dde-8215-6826cb88058c","resolution":{"observed_at":"2026-08-06T16:47:26.540813Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:22.054607Z","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":"2507.12984","last_updated":"2025-07-17T10:39:27Z","snapshot_observed_at":"2026-08-06T16:31:02.473514Z","submitted_at":"2025-07-17T10:39:27Z","title":"Lower Bound for Online MMS Assignment of Indivisible Chores","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T16:47:22.054607Z"},"links":{"citing_paper":"/paper/2507.12984"},"observation_digest":"sha256:0c24ad2fb555f45d451390d4b5f1522645936d1f6f1d17436a520dc8782ddc79","observation_id":"6f8d9e05-5579-4bf4-aff0-dd39609661de","resolution":{"observed_at":"2026-08-06T16:47:22.054607Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:26.281810Z","title":"The unreasonable fairness of maximum nash welfare","venue":null,"work_id":"56dcd94a-aaf5-4959-896b-a3d1db03b254","year":2016},"citing_paper":{"arxiv_id":"2507.12984","last_updated":"2025-07-17T10:39:27Z","snapshot_observed_at":"2026-08-06T16:31:02.473514Z","submitted_at":"2025-07-17T10:39:27Z","title":"Lower Bound for Online MMS Assignment of Indivisible Chores","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T16:47:22.134885Z"},"links":{"citing_paper":"/paper/2507.12984"},"observation_digest":"sha256:53e8bb2f9690a7b584f584e0670c54594a679aceb44ee23b9a604964e67ad34b","observation_id":"b29af706-3703-4768-9306-e4c78172304f","resolution":{"observed_at":"2026-08-06T16:47:26.372368Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:26.018998Z","title":"How to cut a cake fairly","venue":null,"work_id":"716cda13-4e92-4db7-a7cb-c1a2f988bbd8","year":1961},"citing_paper":{"arxiv_id":"2507.12984","last_updated":"2025-07-17T10:39:27Z","snapshot_observed_at":"2026-08-06T16:31:02.473514Z","submitted_at":"2025-07-17T10:39:27Z","title":"Lower Bound for Online MMS Assignment of Indivisible Chores","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T16:47:22.209215Z"},"links":{"citing_paper":"/paper/2507.12984"},"observation_digest":"sha256:6da7206128f54ac05d684f66652b2b9bc26e3d90d84aab48108f7390a158a44b","observation_id":"5585197d-d64a-4a57-9fc7-0a37f70df00c","resolution":{"observed_at":"2026-08-06T16:47:26.177309Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:25.842581Z","title":"A note on cake cutting.Discrete Applied Mathematics, 7(3):285– 296, 1984","venue":null,"work_id":"fa99a68d-a345-4944-8296-4f01802b1b4c","year":1984},"citing_paper":{"arxiv_id":"2507.12984","last_updated":"2025-07-17T10:39:27Z","snapshot_observed_at":"2026-08-06T16:31:02.473514Z","submitted_at":"2025-07-17T10:39:27Z","title":"Lower Bound for Online MMS Assignment of Indivisible Chores","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T16:47:22.283465Z"},"links":{"citing_paper":"/paper/2507.12984"},"observation_digest":"sha256:a4092da4c64c5f93445e8372c8970e0ea2b7a6c7a2d1c9ce6d26fd79a826fb7a","observation_id":"5dca635b-37d8-4067-befe-e25cbb239639","resolution":{"observed_at":"2026-08-06T16:47:25.931259Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:25.641547Z","title":"Fair allocation of indivisible goods to asymmetric agents","venue":null,"work_id":"2f7cde74-32c4-48bc-93d7-230ed2fb2fd9","year":2017},"citing_paper":{"arxiv_id":"2507.12984","last_updated":"2025-07-17T10:39:27Z","snapshot_observed_at":"2026-08-06T16:31:02.473514Z","submitted_at":"2025-07-17T10:39:27Z","title":"Lower Bound for Online MMS Assignment of Indivisible Chores","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T16:47:22.351401Z"},"links":{"citing_paper":"/paper/2507.12984"},"observation_digest":"sha256:1defdc4baeaca494a566ba09866c44e1a27164854b618d41e9b5fa62e1eaa153","observation_id":"39705b13-a1ac-4a90-8d66-1843bcb61dad","resolution":{"observed_at":"2026-08-06T16:47:25.725951Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:25.506565Z","title":"Fair allocation of indivisible goods: Improvements and generalizations","venue":null,"work_id":"7ed4a976-ed23-4645-8c0b-8e4d1b2b97bb","year":2018},"citing_paper":{"arxiv_id":"2507.12984","last_updated":"2025-07-17T10:39:27Z","snapshot_observed_at":"2026-08-06T16:31:02.473514Z","submitted_at":"2025-07-17T10:39:27Z","title":"Lower Bound for Online MMS Assignment of Indivisible Chores","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T16:47:22.449233Z"},"links":{"citing_paper":"/paper/2507.12984"},"observation_digest":"sha256:745238415b2d6cdcc195de4c2a27d8f2b240a0c0c79a49e3c835ae10c5acb625","observation_id":"e8211515-2cab-4b2c-bd76-7f83a1e48210","resolution":{"observed_at":"2026-08-06T16:47:25.568402Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.04581","last_updated":"2024-09-02T13:16:47Z","snapshot_observed_at":"2026-08-05T21:41:09.539240Z","submitted_at":"2023-02-09T11:42:41Z","title":"A Reduction from Chores Allocation to Job Scheduling","version":4},"cited_work":{"arxiv_id":"2302.04581","doi":null,"metadata_source":"pith","pith_arxiv_id":"2302.04581","snapshot_observed_at":"2026-08-06T16:47:23.666129Z","title":"A Reduction from Chores Allocation to Job Scheduling","venue":"cs.GT","work_id":"09d47098-eacf-4505-8c8e-426530584696","year":2023},"citing_paper":{"arxiv_id":"2507.12984","last_updated":"2025-07-17T10:39:27Z","snapshot_observed_at":"2026-08-06T16:31:02.473514Z","submitted_at":"2025-07-17T10:39:27Z","title":"Lower Bound for Online MMS Assignment of Indivisible Chores","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T16:47:22.549807Z"},"links":{"cited_paper":"/paper/2302.04581","citing_paper":"/paper/2507.12984"},"observation_digest":"sha256:14b156ca884683fd72c442e16770455b49620f1747c7dc3134ff85030c1d1216","observation_id":"fc192369-f960-4f14-a32b-b7996793b478","resolution":{"observed_at":"2026-08-06T16:47:23.735417Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:25.304493Z","title":"When can the maximin share guar- antee be guaranteed? InAAAI, volume 16, pages 523–529, 2016","venue":null,"work_id":"9f0a026d-d6ca-4194-9531-ab924843c25f","year":2016},"citing_paper":{"arxiv_id":"2507.12984","last_updated":"2025-07-17T10:39:27Z","snapshot_observed_at":"2026-08-06T16:31:02.473514Z","submitted_at":"2025-07-17T10:39:27Z","title":"Lower Bound for Online MMS Assignment of Indivisible Chores","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T16:47:22.646966Z"},"links":{"citing_paper":"/paper/2507.12984"},"observation_digest":"sha256:e98b9a84cf48aaaaa845667d33556f5ae2d2d50d2bf1f52d189eb88f2158b1a3","observation_id":"d65b9369-a8aa-4dc3-a281-666880a1e99a","resolution":{"observed_at":"2026-08-06T16:47:25.418820Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:25.090819Z","title":"Fair enough: Guaranteeing approxi- mate maximin shares.Journal of the ACM (JACM), 65(2):8, 2018","venue":null,"work_id":"81fa4ef4-e93e-400a-8974-9e5971dea194","year":2018},"citing_paper":{"arxiv_id":"2507.12984","last_updated":"2025-07-17T10:39:27Z","snapshot_observed_at":"2026-08-06T16:31:02.473514Z","submitted_at":"2025-07-17T10:39:27Z","title":"Lower Bound for Online MMS Assignment of Indivisible Chores","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T16:47:22.811683Z"},"links":{"citing_paper":"/paper/2507.12984"},"observation_digest":"sha256:cdbcbf91a1ad2bdd00015a3dc1d4302f115e422e676810a2482ce0896a13fc17","observation_id":"f6f5f702-96b3-44a5-80f8-a45dd74ca00c","resolution":{"observed_at":"2026-08-06T16:47:25.181584Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:24.910528Z","title":"On approximately fair allocations of indivisible goods","venue":null,"work_id":"9d5b16e8-c7cf-4ccd-a3c6-ce737947ce05","year":2004},"citing_paper":{"arxiv_id":"2507.12984","last_updated":"2025-07-17T10:39:27Z","snapshot_observed_at":"2026-08-06T16:31:02.473514Z","submitted_at":"2025-07-17T10:39:27Z","title":"Lower Bound for Online MMS Assignment of Indivisible Chores","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T16:47:22.909484Z"},"links":{"citing_paper":"/paper/2507.12984"},"observation_digest":"sha256:24c612193540d47bf60441541191ceadf8298f480a98a41777af7753fd0d85cd","observation_id":"4ad74058-0432-43c4-950d-7ede33e8c985","resolution":{"observed_at":"2026-08-06T16:47:24.995761Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:24.754295Z","title":"Cake-cutting algorithms: Be fair if you can","venue":null,"work_id":"353de6e2-53c0-46e1-b6e1-5d065a36f011","year":1998},"citing_paper":{"arxiv_id":"2507.12984","last_updated":"2025-07-17T10:39:27Z","snapshot_observed_at":"2026-08-06T16:31:02.473514Z","submitted_at":"2025-07-17T10:39:27Z","title":"Lower Bound for Online MMS Assignment of Indivisible Chores","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T16:47:23.007921Z"},"links":{"citing_paper":"/paper/2507.12984"},"observation_digest":"sha256:6a61a48cbc87375f7dfac306a46a684063b0bc4c17c041b8405cbac2fb748188","observation_id":"12cdeb57-13bc-4243-83c9-20acbe0760cf","resolution":{"observed_at":"2026-08-06T16:47:24.829655Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:24.613844Z","title":"Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem.Artificial Intelligence, 327:104049, 2024","venue":null,"work_id":"e14b2091-f1bb-4305-a503-a6e1ac93efbb","year":2024},"citing_paper":{"arxiv_id":"2507.12984","last_updated":"2025-07-17T10:39:27Z","snapshot_observed_at":"2026-08-06T16:31:02.473514Z","submitted_at":"2025-07-17T10:39:27Z","title":"Lower Bound for Online MMS Assignment of Indivisible Chores","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T16:47:23.107238Z"},"links":{"citing_paper":"/paper/2507.12984"},"observation_digest":"sha256:0ba419c863f61686805b85c32805f969d7392234a3079eba9d8d5ef97ca9f624","observation_id":"824ba572-5cb8-4a99-92d7-e243f3799af0","resolution":{"observed_at":"2026-08-06T16:47:24.684213Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:24.458359Z","title":"Beating the logarithmic barrier for the subadditive maximin share problem","venue":null,"work_id":"7044acbc-fc0d-426d-a5c7-6a86a38e4514","year":2025},"citing_paper":{"arxiv_id":"2507.12984","last_updated":"2025-07-17T10:39:27Z","snapshot_observed_at":"2026-08-06T16:31:02.473514Z","submitted_at":"2025-07-17T10:39:27Z","title":"Lower Bound for Online MMS Assignment of Indivisible Chores","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T16:47:23.240140Z"},"links":{"citing_paper":"/paper/2507.12984"},"observation_digest":"sha256:49af97586f0672f8e90c325fc1d24a59eef653f026574e840631c9451c161c52","observation_id":"baafd660-97a9-4e43-aaac-c2343644ade0","resolution":{"observed_at":"2026-08-06T16:47:24.528720Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:24.277748Z","title":"The problem of fair division.Econometrica, 16(1), 1948","venue":null,"work_id":"6909fde0-6a70-424b-a53c-5172133c8b22","year":1948},"citing_paper":{"arxiv_id":"2507.12984","last_updated":"2025-07-17T10:39:27Z","snapshot_observed_at":"2026-08-06T16:31:02.473514Z","submitted_at":"2025-07-17T10:39:27Z","title":"Lower Bound for Online MMS Assignment of Indivisible Chores","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T16:47:23.347076Z"},"links":{"citing_paper":"/paper/2507.12984"},"observation_digest":"sha256:c31c9928faf71525441de0ff9e4e250e32865c854ed117c1944ef8224a2e3be2","observation_id":"7fe6b571-b046-40da-be51-df62b86d77af","resolution":{"observed_at":"2026-08-06T16:47:24.367109Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:24.039309Z","title":"How to cut a cake fairly.The American Mathematical Monthly, 87(8):640– 644, 1980","venue":null,"work_id":"9e139dad-d388-4a46-928f-0032f0c4dbf5","year":1980},"citing_paper":{"arxiv_id":"2507.12984","last_updated":"2025-07-17T10:39:27Z","snapshot_observed_at":"2026-08-06T16:31:02.473514Z","submitted_at":"2025-07-17T10:39:27Z","title":"Lower Bound for Online MMS Assignment of Indivisible Chores","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T16:47:23.444154Z"},"links":{"citing_paper":"/paper/2507.12984"},"observation_digest":"sha256:3a56f9b61c04d7e49d03930f3cc9d17f24b6717e11835e7256f17f61d20c17f3","observation_id":"a0f42ffa-8ce7-46c3-9d4e-de3c85e3259b","resolution":{"observed_at":"2026-08-06T16:47:24.152693Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:47:23.838587Z","title":"Multi-agent online scheduling: Mms allocations for indivisible items","venue":null,"work_id":"bd0b10be-4436-4234-9a5f-277e6af71134","year":2023},"citing_paper":{"arxiv_id":"2507.12984","last_updated":"2025-07-17T10:39:27Z","snapshot_observed_at":"2026-08-06T16:31:02.473514Z","submitted_at":"2025-07-17T10:39:27Z","title":"Lower Bound for Online MMS Assignment of Indivisible Chores","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T16:47:23.539002Z"},"links":{"citing_paper":"/paper/2507.12984"},"observation_digest":"sha256:5d8f4c5594d243fedffd0795ae1ba3a6aa61b7f56a1c2b65f08ff093c193731c","observation_id":"1118ec4a-50d1-4db9-944b-125f7e21b39f","resolution":{"observed_at":"2026-08-06T16:47:23.934355Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.12984","last_updated":"2025-07-17T10:39:27Z","latest_version":1,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-06T16:31:02.473514Z","submitted_at":"2025-07-17T10:39:27Z","title":"Lower Bound for Online MMS Assignment of Indivisible Chores"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":1,"verified_fuzzy":18},"total_outbound_references":20},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 1 inbound Pith citation observation for arXiv:2507.12984."}