{"as_of":"2026-08-06T17:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c0c14fb39364ffc978ab54ba6f2cf2066a23064463af37d124b835454d71df59","coverage":[{"denominator":41,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":41,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-24T03:59:20.481372Z","state":"measured"},{"denominator":41,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":41,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+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/2402.04353/citation-record","integrity":"/paper/2402.04353/integrity","json":"/paper/2402.04353/citation-record.json","paper":"/paper/2402.04353"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fairness in Scheduling","venue":null,"work_id":"550ba953-b8e7-4e53-a4d4-c60cc5707999","year":1998},"citing_paper":{"arxiv_id":"2402.04353","last_updated":"2026-05-05T05:50:57Z","snapshot_observed_at":"2026-07-06T17:26:27.288834Z","submitted_at":"2024-02-06T19:35:58Z","title":"Fair Interval Scheduling of Indivisible Chores","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-05-24T03:59:20.481372Z"},"links":{"citing_paper":"/paper/2402.04353"},"observation_digest":"sha256:450f1aa5c29198200042b45a179bafb6d546136828b3d06655c9548b601a83dc","observation_id":"f141d6d9-a383-40b1-8d8a-ae7aa09190da","resolution":{"observed_at":"2026-05-24T04:06:00.733772Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Fair Division of Indivisible Goods: Recent Progress and Open Questions","venue":null,"work_id":"27629a16-effd-481d-8432-43884431c1f2","year":2023},"citing_paper":{"arxiv_id":"2402.04353","last_updated":"2026-05-05T05:50:57Z","snapshot_observed_at":"2026-07-06T17:26:27.288834Z","submitted_at":"2024-02-06T19:35:58Z","title":"Fair Interval Scheduling of Indivisible Chores","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-05-24T03:59:20.481372Z"},"links":{"citing_paper":"/paper/2402.04353"},"observation_digest":"sha256:936a27243aaa2eb4bd6960320e2b2cc977aea87a7b32beb11433f544aa0cefb4","observation_id":"721fbfa6-8911-4375-acfd-313751548890","resolution":{"observed_at":"2026-05-24T04:06:00.727509Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Fair Allocation of Indivisible Goods and Chores","venue":null,"work_id":"c815f587-0db0-481b-83e7-5fc18d30237a","year":2019},"citing_paper":{"arxiv_id":"2402.04353","last_updated":"2026-05-05T05:50:57Z","snapshot_observed_at":"2026-07-06T17:26:27.288834Z","submitted_at":"2024-02-06T19:35:58Z","title":"Fair Interval Scheduling of Indivisible Chores","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-05-24T03:59:20.481372Z"},"links":{"citing_paper":"/paper/2402.04353"},"observation_digest":"sha256:4fd35c6c7ff3807a2219d4aba2ddf0e8951ad31fc344737c618f74199e006d18","observation_id":"396ae08d-f6ad-490a-90f8-7aa583c8d93e","resolution":{"observed_at":"2026-05-24T04:06:00.722222Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Finding Fair and Efficient Allocations","venue":null,"work_id":"672b4e20-21a7-426d-8477-cd025edb4e03","year":2018},"citing_paper":{"arxiv_id":"2402.04353","last_updated":"2026-05-05T05:50:57Z","snapshot_observed_at":"2026-07-06T17:26:27.288834Z","submitted_at":"2024-02-06T19:35:58Z","title":"Fair Interval Scheduling of Indivisible Chores","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-05-24T03:59:20.481372Z"},"links":{"citing_paper":"/paper/2402.04353"},"observation_digest":"sha256:56f382d5effeb51ceb0b7a0b660af19fb27d23a61c5ddc1c1c32e307710f90e9","observation_id":"417f60b0-a72b-4fcb-b5be-d9be307b24f5","resolution":{"observed_at":"2026-05-24T04:06:00.716303Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"The Price of Quota-Based Diversity in Assignment Problems","venue":null,"work_id":"583d49f6-2818-4ab8-86db-1e369aadd5e9","year":2020},"citing_paper":{"arxiv_id":"2402.04353","last_updated":"2026-05-05T05:50:57Z","snapshot_observed_at":"2026-07-06T17:26:27.288834Z","submitted_at":"2024-02-06T19:35:58Z","title":"Fair Interval Scheduling of Indivisible Chores","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-05-24T03:59:20.481372Z"},"links":{"citing_paper":"/paper/2402.04353"},"observation_digest":"sha256:525fbc1740e26f773d425b0888a05bdfd0d962f2692ea7eb4b3107f242fe8768","observation_id":"ba51c69f-b423-44fe-9351-e2c535806bf9","resolution":{"observed_at":"2026-05-24T04:06:00.707975Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources","venue":null,"work_id":"395ab5fc-6053-42b4-b9ea-e46e49408fb5","year":2021},"citing_paper":{"arxiv_id":"2402.04353","last_updated":"2026-05-05T05:50:57Z","snapshot_observed_at":"2026-07-06T17:26:27.288834Z","submitted_at":"2024-02-06T19:35:58Z","title":"Fair Interval Scheduling of Indivisible Chores","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-05-24T03:59:20.481372Z"},"links":{"citing_paper":"/paper/2402.04353"},"observation_digest":"sha256:199f048d4c4b716567591e55c7a46754959c4e680f3c33fc8232d97ad1ba85b0","observation_id":"8dde5a47-d120-44f8-af7e-7a3425f09f80","resolution":{"observed_at":"2026-05-24T04:06:00.703001Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"The Price of Envy-Freeness in Machine Scheduling","venue":null,"work_id":"9ee32bf8-37d9-4a30-8408-c45716379e2e","year":2016},"citing_paper":{"arxiv_id":"2402.04353","last_updated":"2026-05-05T05:50:57Z","snapshot_observed_at":"2026-07-06T17:26:27.288834Z","submitted_at":"2024-02-06T19:35:58Z","title":"Fair Interval Scheduling of Indivisible Chores","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-05-24T03:59:20.481372Z"},"links":{"citing_paper":"/paper/2402.04353"},"observation_digest":"sha256:735ccb9ddd34aead43635ea07e2183e87b68f04efda4d25d71872ee3bb81d285","observation_id":"b66c0c9c-3ae5-4bf2-a945-d467877d1d15","resolution":{"observed_at":"2026-05-24T04:06:00.698441Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Almost Envy-Free Allocations with Connected Bundles","venue":null,"work_id":"149a360f-5dc9-4738-a7ad-cc514152fe25","year":2022},"citing_paper":{"arxiv_id":"2402.04353","last_updated":"2026-05-05T05:50:57Z","snapshot_observed_at":"2026-07-06T17:26:27.288834Z","submitted_at":"2024-02-06T19:35:58Z","title":"Fair Interval Scheduling of Indivisible Chores","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-05-24T03:59:20.481372Z"},"links":{"citing_paper":"/paper/2402.04353"},"observation_digest":"sha256:30694200561ab28b5fda5661b1ad3a13aa22b90a30a908c4da0d032166d4fede","observation_id":"f479c5e8-4bb0-47fb-8cce-a1347ce7c416","resolution":{"observed_at":"2026-05-24T04:06:00.692123Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Matroid Constrained Fair Allocation Problem","venue":null,"work_id":"389f518b-7fbc-4629-bb87-3608a4bf078a","year":2019},"citing_paper":{"arxiv_id":"2402.04353","last_updated":"2026-05-05T05:50:57Z","snapshot_observed_at":"2026-07-06T17:26:27.288834Z","submitted_at":"2024-02-06T19:35:58Z","title":"Fair Interval Scheduling of Indivisible Chores","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-05-24T03:59:20.481372Z"},"links":{"citing_paper":"/paper/2402.04353"},"observation_digest":"sha256:6c98d6a48e4ba96ba1888a51caf288d24d0df487b3663e9ffc05fc4de661e60f","observation_id":"fa9655c4-61e3-49f0-be0c-a588bdfaed9d","resolution":{"observed_at":"2026-05-24T04:06:00.687998Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"An Algorithmic Approach to Address Course Enrollment Challenges","venue":null,"work_id":"7b34c048-6a55-4e60-80e4-28f2279e1431","year":2023},"citing_paper":{"arxiv_id":"2402.04353","last_updated":"2026-05-05T05:50:57Z","snapshot_observed_at":"2026-07-06T17:26:27.288834Z","submitted_at":"2024-02-06T19:35:58Z","title":"Fair Interval Scheduling of Indivisible Chores","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-05-24T03:59:20.481372Z"},"links":{"citing_paper":"/paper/2402.04353"},"observation_digest":"sha256:fcf297efcccc1ec8ad84b1f03d1c9ea8a9c64c4d4a1446a1465f67a1334a8eb6","observation_id":"e1ed9167-1865-4100-9508-cb0d28dbe20b","resolution":{"observed_at":"2026-05-24T04:06:00.683963Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Fair Division of a Graph","venue":null,"work_id":"c4540e28-973c-4e20-8c04-d65dbf24255e","year":2017},"citing_paper":{"arxiv_id":"2402.04353","last_updated":"2026-05-05T05:50:57Z","snapshot_observed_at":"2026-07-06T17:26:27.288834Z","submitted_at":"2024-02-06T19:35:58Z","title":"Fair Interval Scheduling of Indivisible Chores","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-05-24T03:59:20.481372Z"},"links":{"citing_paper":"/paper/2402.04353"},"observation_digest":"sha256:3adc78174a1876727d6c069aec31bc51baa3f2c521abf4d49d1600169ce2292b","observation_id":"d44a2403-49e2-41d7-a693-4ab1a58f8840","resolution":{"observed_at":"2026-05-24T04:06:00.680007Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Chore Division on a Graph","venue":null,"work_id":"7ab39976-15cd-42c1-b875-c279a1279ce8","year":2019},"citing_paper":{"arxiv_id":"2402.04353","last_updated":"2026-05-05T05:50:57Z","snapshot_observed_at":"2026-07-06T17:26:27.288834Z","submitted_at":"2024-02-06T19:35:58Z","title":"Fair Interval Scheduling of Indivisible Chores","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-05-24T03:59:20.481372Z"},"links":{"citing_paper":"/paper/2402.04353"},"observation_digest":"sha256:9ad1ccf51c29d734c906c20109112d2cf65ca2367940477fe922c520316f4f61","observation_id":"3e137424-761e-4179-9010-9d7216ec95a9","resolution":{"observed_at":"2026-05-24T04:06:00.676434Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Fair Division: From Cake-Cutting to Dispute Resolution","venue":null,"work_id":"f61f5b82-0685-4a59-883e-d3d474324379","year":1996},"citing_paper":{"arxiv_id":"2402.04353","last_updated":"2026-05-05T05:50:57Z","snapshot_observed_at":"2026-07-06T17:26:27.288834Z","submitted_at":"2024-02-06T19:35:58Z","title":"Fair Interval Scheduling of Indivisible Chores","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-05-24T03:59:20.481372Z"},"links":{"citing_paper":"/paper/2402.04353"},"observation_digest":"sha256:5a475ad87aa5b1ce546371e4eb3360f1a05bf796b41b79be9c14567b5a7d4f7a","observation_id":"d2e73648-ecb3-4604-bbec-32f98df2d071","resolution":{"observed_at":"2026-05-24T04:06:00.673520Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Handbook of Computational Social Choice","venue":null,"work_id":"90984eec-b75f-4a50-9c8b-595d3c3bbdd4","year":2016},"citing_paper":{"arxiv_id":"2402.04353","last_updated":"2026-05-05T05:50:57Z","snapshot_observed_at":"2026-07-06T17:26:27.288834Z","submitted_at":"2024-02-06T19:35:58Z","title":"Fair Interval Scheduling of Indivisible Chores","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-05-24T03:59:20.481372Z"},"links":{"citing_paper":"/paper/2402.04353"},"observation_digest":"sha256:507b41eb9d36d5ed277aecd31d722fd0ec4160d9acd3eb8abc52f6b425dbb869","observation_id":"be9075d7-20fa-43e9-b6f5-c007faa04b23","resolution":{"observed_at":"2026-05-24T04:06:00.669766Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes","venue":null,"work_id":"0bd3a60f-7177-4a18-88c1-e7ae84de132c","year":2011},"citing_paper":{"arxiv_id":"2402.04353","last_updated":"2026-05-05T05:50:57Z","snapshot_observed_at":"2026-07-06T17:26:27.288834Z","submitted_at":"2024-02-06T19:35:58Z","title":"Fair Interval Scheduling of Indivisible Chores","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-05-24T03:59:20.481372Z"},"links":{"citing_paper":"/paper/2402.04353"},"observation_digest":"sha256:f33dbff710abf8e8b77304e5a51d7ac33d05b4c279146c2bf4b55fb12a7e04db","observation_id":"623fd2bf-0737-4784-b9dc-53fec0efcadc","resolution":{"observed_at":"2026-05-24T04:06:00.665390Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Course Match: A Large-Scale Implementation of Approximate Competitive Equilibrium from Equal Incomes for Combinatorial Allocation","venue":null,"work_id":"2b4d2434-e997-4b11-b043-2c14629d8ccf","year":2017},"citing_paper":{"arxiv_id":"2402.04353","last_updated":"2026-05-05T05:50:57Z","snapshot_observed_at":"2026-07-06T17:26:27.288834Z","submitted_at":"2024-02-06T19:35:58Z","title":"Fair Interval Scheduling of Indivisible Chores","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-05-24T03:59:20.481372Z"},"links":{"citing_paper":"/paper/2402.04353"},"observation_digest":"sha256:b19b46ed46d96da93a1d63adacbd9c50f4b2b55f62511aa173a5f367953922fc","observation_id":"d697ced6-b0b5-4110-afc0-b99b7e5a23bb","resolution":{"observed_at":"2026-05-24T04:06:00.660626Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"The Unreasonable Fairness of Maximum Nash Welfare","venue":null,"work_id":"a1063b21-66b7-40aa-b81b-d076d09400d4","year":2019},"citing_paper":{"arxiv_id":"2402.04353","last_updated":"2026-05-05T05:50:57Z","snapshot_observed_at":"2026-07-06T17:26:27.288834Z","submitted_at":"2024-02-06T19:35:58Z","title":"Fair Interval Scheduling of Indivisible Chores","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-05-24T03:59:20.481372Z"},"links":{"citing_paper":"/paper/2402.04353"},"observation_digest":"sha256:8cb292580f5cd6ebbd8566a059e1a2b109f137ac13ac6cf61603094406076315","observation_id":"f1e14479-8bc7-48b6-b53f-27767b7a7224","resolution":{"observed_at":"2026-05-24T04:06:00.646668Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"EFX Exists for Three Agents","venue":null,"work_id":"ea0f3598-67b6-43b8-b6d6-659dc5ea160c","year":2020},"citing_paper":{"arxiv_id":"2402.04353","last_updated":"2026-05-05T05:50:57Z","snapshot_observed_at":"2026-07-06T17:26:27.288834Z","submitted_at":"2024-02-06T19:35:58Z","title":"Fair Interval Scheduling of Indivisible Chores","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-05-24T03:59:20.481372Z"},"links":{"citing_paper":"/paper/2402.04353"},"observation_digest":"sha256:50a018b2e6be849fb139ef283ed250a52996c40af9bf4014e115a1fb743ba36f","observation_id":"b6bf4e07-8dbd-467a-b51b-1bf309335160","resolution":{"observed_at":"2026-05-24T04:06:00.641067Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Fair Allocation of Indivisible Items with Conflict Graphs","venue":null,"work_id":"c34bd58d-1e65-49fc-8877-b1967df1c409","year":2023},"citing_paper":{"arxiv_id":"2402.04353","last_updated":"2026-05-05T05:50:57Z","snapshot_observed_at":"2026-07-06T17:26:27.288834Z","submitted_at":"2024-02-06T19:35:58Z","title":"Fair Interval Scheduling of Indivisible Chores","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-05-24T03:59:20.481372Z"},"links":{"citing_paper":"/paper/2402.04353"},"observation_digest":"sha256:4d0511c87dda7f38f5859370dfec35b424ba5904c80eaf9d157cf1d9c64ac27f","observation_id":"277e1c54-6845-4182-b015-0f247067f5b9","resolution":{"observed_at":"2026-05-24T04:06:00.637424Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"On Fair Division under Heterogeneous Matroid Constraints","venue":null,"work_id":"e88d2442-8a8a-47fe-ad93-598a0c57cf49","year":2023},"citing_paper":{"arxiv_id":"2402.04353","last_updated":"2026-05-05T05:50:57Z","snapshot_observed_at":"2026-07-06T17:26:27.288834Z","submitted_at":"2024-02-06T19:35:58Z","title":"Fair Interval Scheduling of Indivisible Chores","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-05-24T03:59:20.481372Z"},"links":{"citing_paper":"/paper/2402.04353"},"observation_digest":"sha256:5d15b4a278c78bf87f26fb06a5b3d8ed47df39bf084cc10dfc17925b61b0708c","observation_id":"1535f5d0-241d-4898-8f8d-fdb5f647e1bd","resolution":{"observed_at":"2026-05-24T04:06:00.633339Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"How to Fairly Allocate Easy and Difficult Chores","venue":null,"work_id":"bde4708d-0863-4321-b853-f1670a7e849a","year":2022},"citing_paper":{"arxiv_id":"2402.04353","last_updated":"2026-05-05T05:50:57Z","snapshot_observed_at":"2026-07-06T17:26:27.288834Z","submitted_at":"2024-02-06T19:35:58Z","title":"Fair Interval Scheduling of Indivisible Chores","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-05-24T03:59:20.481372Z"},"links":{"citing_paper":"/paper/2402.04353"},"observation_digest":"sha256:7e881e9546dc5d813c2d122e15d96f8b65a2e66624d3b3ccd797f57bb2d0ec56","observation_id":"8e917cb6-8b12-4fed-8f34-92f33112e14c","resolution":{"observed_at":"2026-05-24T04:06:00.627704Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Resource Allocation and the Public Sector","venue":null,"work_id":"c40ee196-3896-4df2-9b0f-c4ce2f312d3a","year":1967},"citing_paper":{"arxiv_id":"2402.04353","last_updated":"2026-05-05T05:50:57Z","snapshot_observed_at":"2026-07-06T17:26:27.288834Z","submitted_at":"2024-02-06T19:35:58Z","title":"Fair Interval Scheduling of Indivisible Chores","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-05-24T03:59:20.481372Z"},"links":{"citing_paper":"/paper/2402.04353"},"observation_digest":"sha256:3a0f622426417d532b0afdb129ca5bdadd83d4017d7ba87dc5de2fd85646141e","observation_id":"c8aae408-e1ce-4429-9045-b7a52f9fa214","resolution":{"observed_at":"2026-05-24T04:06:00.619224Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Puzzle-Math","venue":null,"work_id":"276e07ea-3225-42ef-95ab-9529a5679ba9","year":1958},"citing_paper":{"arxiv_id":"2402.04353","last_updated":"2026-05-05T05:50:57Z","snapshot_observed_at":"2026-07-06T17:26:27.288834Z","submitted_at":"2024-02-06T19:35:58Z","title":"Fair Interval Scheduling of Indivisible Chores","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-05-24T03:59:20.481372Z"},"links":{"citing_paper":"/paper/2402.04353"},"observation_digest":"sha256:0b1ce31255ba817023769398e6003be7d141e9af100829dd87fd928db8d1527e","observation_id":"e9cba3d7-c81b-4c68-9d25-250a0ba6e9b4","resolution":{"observed_at":"2026-05-24T04:06:00.614841Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"aha! Insight","venue":null,"work_id":"1e86ab06-6874-4d38-a8d7-5f52b0eb3c1f","year":1978},"citing_paper":{"arxiv_id":"2402.04353","last_updated":"2026-05-05T05:50:57Z","snapshot_observed_at":"2026-07-06T17:26:27.288834Z","submitted_at":"2024-02-06T19:35:58Z","title":"Fair Interval Scheduling of Indivisible Chores","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-05-24T03:59:20.481372Z"},"links":{"citing_paper":"/paper/2402.04353"},"observation_digest":"sha256:01205171e2e0447fc68fd05255a24323515b89ad3e342a540278130254114de8","observation_id":"c665c164-174b-4394-a352-b59b1cb9938c","resolution":{"observed_at":"2026-05-24T04:06:00.611334Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Fair and Efficient Allocations of Chores under Bivalued Preferences","venue":null,"work_id":"2534083f-874a-4267-91c4-9b8af23c9595","year":2022},"citing_paper":{"arxiv_id":"2402.04353","last_updated":"2026-05-05T05:50:57Z","snapshot_observed_at":"2026-07-06T17:26:27.288834Z","submitted_at":"2024-02-06T19:35:58Z","title":"Fair Interval Scheduling of Indivisible Chores","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-05-24T03:59:20.481372Z"},"links":{"citing_paper":"/paper/2402.04353"},"observation_digest":"sha256:7e8b8d1eb1f1694fd6e14cd9f9831fdd1534573079f2567ff4641815a0aa9578","observation_id":"1801bc5c-3736-40d0-ad5b-d488a4e90698","resolution":{"observed_at":"2026-05-24T04:06:00.607728Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"New Algorithms for the Fair and Effcient Allocation of Indivisible Chores","venue":null,"work_id":"826b9f3f-acee-470a-ad56-9f9a381eb0cf","year":2023},"citing_paper":{"arxiv_id":"2402.04353","last_updated":"2026-05-05T05:50:57Z","snapshot_observed_at":"2026-07-06T17:26:27.288834Z","submitted_at":"2024-02-06T19:35:58Z","title":"Fair Interval Scheduling of Indivisible Chores","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-05-24T03:59:20.481372Z"},"links":{"citing_paper":"/paper/2402.04353"},"observation_digest":"sha256:ee937782fb25f3d0deb79e19f28e2938ecfcde759bba99876a6da00804551a59","observation_id":"f100c27f-9863-45aa-b90b-62c52a33fd4a","resolution":{"observed_at":"2026-05-24T04:06:00.604806Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Spliddit: Unleashing Fair Division Algorithms","venue":null,"work_id":"00995417-90fa-4ad4-be46-86e7ba710220","year":2015},"citing_paper":{"arxiv_id":"2402.04353","last_updated":"2026-05-05T05:50:57Z","snapshot_observed_at":"2026-07-06T17:26:27.288834Z","submitted_at":"2024-02-06T19:35:58Z","title":"Fair Interval Scheduling of Indivisible Chores","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-05-24T03:59:20.481372Z"},"links":{"citing_paper":"/paper/2402.04353"},"observation_digest":"sha256:bb7b5e0d4ba0cd01ad2a3dedd0054cb5a72736c1d193de13cc0453e0a40827d1","observation_id":"89c6bc71-98bd-4535-8ad1-96c696a6e4f0","resolution":{"observed_at":"2026-05-24T04:06:00.601305Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Hajnal and E","venue":null,"work_id":"e0a3b249-139b-40ac-9f33-431e8f220bb7","year":1969},"citing_paper":{"arxiv_id":"2402.04353","last_updated":"2026-05-05T05:50:57Z","snapshot_observed_at":"2026-07-06T17:26:27.288834Z","submitted_at":"2024-02-06T19:35:58Z","title":"Fair Interval Scheduling of Indivisible Chores","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-05-24T03:59:20.481372Z"},"links":{"citing_paper":"/paper/2402.04353"},"observation_digest":"sha256:5808a01fdd76d268b87c64a24220a237b43bbe73779786b2432f691b4a2c612f","observation_id":"459c091d-4d8a-49d3-bb27-bcc268391000","resolution":{"observed_at":"2026-05-24T04:06:00.598096Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Fair Allocation of Conflicting Items","venue":null,"work_id":"084e70ef-41d8-4475-ac52-dff000224a27","year":2022},"citing_paper":{"arxiv_id":"2402.04353","last_updated":"2026-05-05T05:50:57Z","snapshot_observed_at":"2026-07-06T17:26:27.288834Z","submitted_at":"2024-02-06T19:35:58Z","title":"Fair Interval Scheduling of Indivisible Chores","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-05-24T03:59:20.481372Z"},"links":{"citing_paper":"/paper/2402.04353"},"observation_digest":"sha256:1c56c200173ac29aad9775d92d0ced0ea16eed6bd7b81171a69e192118266f5b","observation_id":"1482ebe9-382c-4b7f-8140-93513934dad4","resolution":{"observed_at":"2026-05-24T04:06:00.594088Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Kajibuntan: A House Chore Division App","venue":null,"work_id":"6d57abb0-ee50-46c7-a26b-314e8c5e2f56","year":2023},"citing_paper":{"arxiv_id":"2402.04353","last_updated":"2026-05-05T05:50:57Z","snapshot_observed_at":"2026-07-06T17:26:27.288834Z","submitted_at":"2024-02-06T19:35:58Z","title":"Fair Interval Scheduling of Indivisible Chores","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-05-24T03:59:20.481372Z"},"links":{"citing_paper":"/paper/2402.04353"},"observation_digest":"sha256:c69d13c02ad6609ef07c28b589913d50b614156a9b9e2a22519e5fbede54b3eb","observation_id":"1166c6d1-4ebe-4f21-9b45-3612a7e3e62e","resolution":{"observed_at":"2026-05-24T04:06:00.590468Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Fair Scheduling via Iterative Quasi-Uniform Sampling","venue":null,"work_id":"3ee22415-2b2f-4a26-b688-c04eb0f78fec","year":2020},"citing_paper":{"arxiv_id":"2402.04353","last_updated":"2026-05-05T05:50:57Z","snapshot_observed_at":"2026-07-06T17:26:27.288834Z","submitted_at":"2024-02-06T19:35:58Z","title":"Fair Interval Scheduling of Indivisible Chores","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-05-24T03:59:20.481372Z"},"links":{"citing_paper":"/paper/2402.04353"},"observation_digest":"sha256:ae8391d4aaaba61b0d6729364386b07b1d16eeb74e8bf5ca9cc972776c52767b","observation_id":"bb031c37-81a0-47d6-a201-cf1b1a822494","resolution":{"observed_at":"2026-05-24T04:06:00.586682Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Handbook of Scheduling: Algorithms, Models, and Performance Analysis","venue":null,"work_id":"e50e7410-2204-48dc-bfa8-3a69474785fa","year":2004},"citing_paper":{"arxiv_id":"2402.04353","last_updated":"2026-05-05T05:50:57Z","snapshot_observed_at":"2026-07-06T17:26:27.288834Z","submitted_at":"2024-02-06T19:35:58Z","title":"Fair Interval Scheduling of Indivisible Chores","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-05-24T03:59:20.481372Z"},"links":{"citing_paper":"/paper/2402.04353"},"observation_digest":"sha256:ba794e1edc0e8a133d1e5ecdf397d978f18635021e7ec24c3037ca1d35a34ac3","observation_id":"eb474625-1734-4445-ba95-a7942bc4985d","resolution":{"observed_at":"2026-05-24T04:06:00.583280Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Fair Scheduling for Time-Dependent Resources","venue":null,"work_id":"f8bbe40c-2bc7-4bd8-bad6-fe1fd6b18c22","year":2021},"citing_paper":{"arxiv_id":"2402.04353","last_updated":"2026-05-05T05:50:57Z","snapshot_observed_at":"2026-07-06T17:26:27.288834Z","submitted_at":"2024-02-06T19:35:58Z","title":"Fair Interval Scheduling of Indivisible Chores","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-05-24T03:59:20.481372Z"},"links":{"citing_paper":"/paper/2402.04353"},"observation_digest":"sha256:07fc7c38f69b0fa0227b6a6baa3d40b19d631344129659b33daca03e1a77c809","observation_id":"e70028d1-83bb-411b-9cf4-48d2866e81d1","resolution":{"observed_at":"2026-05-24T04:06:00.579425Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"On Approximately Fair Allocations of Indivisible Goods","venue":null,"work_id":"0dae980f-8bf4-4dc7-a03e-c616d5a95f25","year":2004},"citing_paper":{"arxiv_id":"2402.04353","last_updated":"2026-05-05T05:50:57Z","snapshot_observed_at":"2026-07-06T17:26:27.288834Z","submitted_at":"2024-02-06T19:35:58Z","title":"Fair Interval Scheduling of Indivisible Chores","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-05-24T03:59:20.481372Z"},"links":{"citing_paper":"/paper/2402.04353"},"observation_digest":"sha256:47afc083c3924d152b7c7d22aa64f39cbfcfeacbdab75436405b71c8210476a7","observation_id":"2eeedec8-e36b-439d-aa20-b4484ae6a820","resolution":{"observed_at":"2026-05-24T04:06:00.575662Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Fair Division in the Internet Age","venue":null,"work_id":"f1610b72-2532-4199-8059-787f4f94c2f2","year":2019},"citing_paper":{"arxiv_id":"2402.04353","last_updated":"2026-05-05T05:50:57Z","snapshot_observed_at":"2026-07-06T17:26:27.288834Z","submitted_at":"2024-02-06T19:35:58Z","title":"Fair Interval Scheduling of Indivisible Chores","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-05-24T03:59:20.481372Z"},"links":{"citing_paper":"/paper/2402.04353"},"observation_digest":"sha256:f6ed3edf282cfbadbe7fb7b2059adee2d8e9d8df6826e4d485ca49d221f7860f","observation_id":"da6c47d1-b3b7-4c58-bd78-4a4074fa1655","resolution":{"observed_at":"2026-05-24T04:06:00.571477Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Matroid Theory","venue":null,"work_id":"fc702c66-54be-49e6-8f62-ad2992c56f1d","year":2022},"citing_paper":{"arxiv_id":"2402.04353","last_updated":"2026-05-05T05:50:57Z","snapshot_observed_at":"2026-07-06T17:26:27.288834Z","submitted_at":"2024-02-06T19:35:58Z","title":"Fair Interval Scheduling of Indivisible Chores","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-05-24T03:59:20.481372Z"},"links":{"citing_paper":"/paper/2402.04353"},"observation_digest":"sha256:c2df1f886508544feacd64138c690c83f44792b28fe03f5a325eff5d2c451250","observation_id":"b14bf6be-c531-4f81-938c-fa315ec9967e","resolution":{"observed_at":"2026-05-24T04:06:00.567788Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Almost Envy-Freeness with General Valuations","venue":null,"work_id":"a53495dd-1524-40b9-8df7-8b7720884c94","year":2020},"citing_paper":{"arxiv_id":"2402.04353","last_updated":"2026-05-05T05:50:57Z","snapshot_observed_at":"2026-07-06T17:26:27.288834Z","submitted_at":"2024-02-06T19:35:58Z","title":"Fair Interval Scheduling of Indivisible Chores","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-05-24T03:59:20.481372Z"},"links":{"citing_paper":"/paper/2402.04353"},"observation_digest":"sha256:8831a2d3e751b2bfdbde6bd84e5008abc9eb7efcf45a5753a10f0daf99d82e5a","observation_id":"2b7dc811-e391-4b90-984f-39c2463844d2","resolution":{"observed_at":"2026-05-24T04:06:00.651814Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Constraints in Fair Division","venue":null,"work_id":"c1c2fc2e-27bb-4603-9676-7a2e8c1c8a9f","year":2021},"citing_paper":{"arxiv_id":"2402.04353","last_updated":"2026-05-05T05:50:57Z","snapshot_observed_at":"2026-07-06T17:26:27.288834Z","submitted_at":"2024-02-06T19:35:58Z","title":"Fair Interval Scheduling of Indivisible Chores","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-05-24T03:59:20.481372Z"},"links":{"citing_paper":"/paper/2402.04353"},"observation_digest":"sha256:698619d110cde514cabd922821abbf78293b463ef131f2347ba5bab1effe9753","observation_id":"33d97d30-ab25-4169-ba6d-f521122a82f8","resolution":{"observed_at":"2026-05-24T04:06:00.711633Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Fair Chore Division for Climate Change","venue":null,"work_id":"f348b4c7-cf29-4c66-af11-d180a35a7b08","year":2002},"citing_paper":{"arxiv_id":"2402.04353","last_updated":"2026-05-05T05:50:57Z","snapshot_observed_at":"2026-07-06T17:26:27.288834Z","submitted_at":"2024-02-06T19:35:58Z","title":"Fair Interval Scheduling of Indivisible Chores","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-05-24T03:59:20.481372Z"},"links":{"citing_paper":"/paper/2402.04353"},"observation_digest":"sha256:03390751384667795659ef924488a4f39fd086320e9f1007ca1a9a2c4fed3cb7","observation_id":"e144c9fa-48fd-4307-9c06-e099446ecb71","resolution":{"observed_at":"2026-05-24T04:06:00.564748Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Introduction to Graph Theory , volume 2","venue":null,"work_id":"2d496b2f-a183-420c-8098-18034704f6cb","year":2001},"citing_paper":{"arxiv_id":"2402.04353","last_updated":"2026-05-05T05:50:57Z","snapshot_observed_at":"2026-07-06T17:26:27.288834Z","submitted_at":"2024-02-06T19:35:58Z","title":"Fair Interval Scheduling of Indivisible Chores","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-05-24T03:59:20.481372Z"},"links":{"citing_paper":"/paper/2402.04353"},"observation_digest":"sha256:4b0f8d8bcb13a9806859ec1880a3980a7f1b2d4eb3421e95072092f8ae840c37","observation_id":"0b6ce9bd-6887-408b-aaea-d262fa703792","resolution":{"observed_at":"2026-05-24T04:06:00.560919Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Approximately EFX Allocations for Indivisible Chores","venue":null,"work_id":"becff414-2324-4871-8326-9ca13895f557","year":2022},"citing_paper":{"arxiv_id":"2402.04353","last_updated":"2026-05-05T05:50:57Z","snapshot_observed_at":"2026-07-06T17:26:27.288834Z","submitted_at":"2024-02-06T19:35:58Z","title":"Fair Interval Scheduling of Indivisible Chores","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-05-24T03:59:20.481372Z"},"links":{"citing_paper":"/paper/2402.04353"},"observation_digest":"sha256:4b3e0676617a465f35bbced6b57386f88975338486c40e72e182d396cc704a58","observation_id":"cd46f518-f11e-4bb5-a040-a6728c355a1f","resolution":{"observed_at":"2026-05-24T04:06:00.557549Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2402.04353","last_updated":"2026-05-05T05:50:57Z","latest_version":2,"primary_category":"cs.GT","snapshot_observed_at":"2026-07-06T17:26:27.288834Z","submitted_at":"2024-02-06T19:35:58Z","title":"Fair Interval Scheduling of Indivisible Chores"},"reference_resolution":{"displayed":41,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":41},"total_outbound_references":41},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 41 of 41 outbound references and 0 inbound Pith citation observations for arXiv:2402.04353."}