Pith. sign in

Paper Citation Record · LEDGER

Fair Interval Scheduling of Indivisible Chores

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2402.04353 v2

Coverage vector

measured 41 of 41 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-05-24T03:59:20.481372Z

measured 41 of 41 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-06T06:34:29.942622+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

41 of 41 outbound references displayed

  • verified exact0
  • verified fuzzy41
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation f141d6d9-a383-40b1-8d8a-ae7aa09190da · outbound

This paper cites Fairness in Scheduling.

Fair Interval Scheduling of Indivisible Chores Fairness in Scheduling

Reference 1

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T04:06:00.733772Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T03:59:20.481372Z digest=sha256:450f1aa5c29198200042b45a179bafb6d546136828b3d06655c9548b601a83dc

Observation 721fbfa6-8911-4375-acfd-313751548890 · outbound

This paper cites Fair Division of Indivisible Goods: Recent Progress and Open Questions.

Fair Interval Scheduling of Indivisible Chores Fair Division of Indivisible Goods: Recent Progress and Open Questions

Reference 2

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T04:06:00.727509Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T03:59:20.481372Z digest=sha256:936a27243aaa2eb4bd6960320e2b2cc977aea87a7b32beb11433f544aa0cefb4

Observation 396ae08d-f6ad-490a-90f8-7aa583c8d93e · outbound

This paper cites Fair Allocation of Indivisible Goods and Chores.

Fair Interval Scheduling of Indivisible Chores Fair Allocation of Indivisible Goods and Chores

Reference 3

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T04:06:00.722222Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T03:59:20.481372Z digest=sha256:4fd35c6c7ff3807a2219d4aba2ddf0e8951ad31fc344737c618f74199e006d18

Observation 417f60b0-a72b-4fcb-b5be-d9be307b24f5 · outbound

This paper cites Finding Fair and Efficient Allocations.

Fair Interval Scheduling of Indivisible Chores Finding Fair and Efficient Allocations

Reference 4

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T04:06:00.716303Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T03:59:20.481372Z digest=sha256:56f382d5effeb51ceb0b7a0b660af19fb27d23a61c5ddc1c1c32e307710f90e9

Observation ba51c69f-b423-44fe-9351-e2c535806bf9 · outbound

This paper cites The Price of Quota-Based Diversity in Assignment Problems.

Fair Interval Scheduling of Indivisible Chores The Price of Quota-Based Diversity in Assignment Problems

Reference 5

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T04:06:00.707975Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T03:59:20.481372Z digest=sha256:525fbc1740e26f773d425b0888a05bdfd0d962f2692ea7eb4b3107f242fe8768

Observation 8dde5a47-d120-44f8-af7e-7a3425f09f80 · outbound

This paper cites On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources.

Fair Interval Scheduling of Indivisible Chores On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T04:06:00.703001Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T03:59:20.481372Z digest=sha256:199f048d4c4b716567591e55c7a46754959c4e680f3c33fc8232d97ad1ba85b0

Observation b66c0c9c-3ae5-4bf2-a945-d467877d1d15 · outbound

This paper cites The Price of Envy-Freeness in Machine Scheduling.

Fair Interval Scheduling of Indivisible Chores The Price of Envy-Freeness in Machine Scheduling

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T04:06:00.698441Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T03:59:20.481372Z digest=sha256:735ccb9ddd34aead43635ea07e2183e87b68f04efda4d25d71872ee3bb81d285

Observation f479c5e8-4bb0-47fb-8cce-a1347ce7c416 · outbound

This paper cites Almost Envy-Free Allocations with Connected Bundles.

Fair Interval Scheduling of Indivisible Chores Almost Envy-Free Allocations with Connected Bundles

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T04:06:00.692123Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T03:59:20.481372Z digest=sha256:30694200561ab28b5fda5661b1ad3a13aa22b90a30a908c4da0d032166d4fede

Observation fa9655c4-61e3-49f0-be0c-a588bdfaed9d · outbound

This paper cites Matroid Constrained Fair Allocation Problem.

Fair Interval Scheduling of Indivisible Chores Matroid Constrained Fair Allocation Problem

Reference 9

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T04:06:00.687998Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T03:59:20.481372Z digest=sha256:6c98d6a48e4ba96ba1888a51caf288d24d0df487b3663e9ffc05fc4de661e60f

Observation e1ed9167-1865-4100-9508-cb0d28dbe20b · outbound

This paper cites An Algorithmic Approach to Address Course Enrollment Challenges.

Fair Interval Scheduling of Indivisible Chores An Algorithmic Approach to Address Course Enrollment Challenges

Reference 10

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T04:06:00.683963Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T03:59:20.481372Z digest=sha256:fcf297efcccc1ec8ad84b1f03d1c9ea8a9c64c4d4a1446a1465f67a1334a8eb6

Observation d44a2403-49e2-41d7-a693-4ab1a58f8840 · outbound

This paper cites Fair Division of a Graph.

Fair Interval Scheduling of Indivisible Chores Fair Division of a Graph

Reference 11

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T04:06:00.680007Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T03:59:20.481372Z digest=sha256:3adc78174a1876727d6c069aec31bc51baa3f2c521abf4d49d1600169ce2292b

Observation 3e137424-761e-4179-9010-9d7216ec95a9 · outbound

This paper cites Chore Division on a Graph.

Fair Interval Scheduling of Indivisible Chores Chore Division on a Graph

Reference 12

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T04:06:00.676434Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T03:59:20.481372Z digest=sha256:9ad1ccf51c29d734c906c20109112d2cf65ca2367940477fe922c520316f4f61

Observation d2e73648-ecb3-4604-bbec-32f98df2d071 · outbound

This paper cites Fair Division: From Cake-Cutting to Dispute Resolution.

Fair Interval Scheduling of Indivisible Chores Fair Division: From Cake-Cutting to Dispute Resolution

Reference 13

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T04:06:00.673520Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T03:59:20.481372Z digest=sha256:5a475ad87aa5b1ce546371e4eb3360f1a05bf796b41b79be9c14567b5a7d4f7a

Observation be9075d7-20fa-43e9-b6f5-c007faa04b23 · outbound

This paper cites Handbook of Computational Social Choice.

Fair Interval Scheduling of Indivisible Chores Handbook of Computational Social Choice

Reference 14

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T04:06:00.669766Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T03:59:20.481372Z digest=sha256:507b41eb9d36d5ed277aecd31d722fd0ec4160d9acd3eb8abc52f6b425dbb869

Observation 623fd2bf-0737-4784-b9dc-53fec0efcadc · outbound

This paper cites The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes.

Fair Interval Scheduling of Indivisible Chores The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes

Reference 15

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T04:06:00.665390Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T03:59:20.481372Z digest=sha256:f33dbff710abf8e8b77304e5a51d7ac33d05b4c279146c2bf4b55fb12a7e04db

Observation d697ced6-b0b5-4110-afc0-b99b7e5a23bb · outbound

This paper cites Course Match: A Large-Scale Implementation of Approximate Competitive Equilibrium from Equal Incomes for Combinatorial Allocation.

Fair Interval Scheduling of Indivisible Chores Course Match: A Large-Scale Implementation of Approximate Competitive Equilibrium from Equal Incomes for Combinatorial Allocation

Reference 16

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T04:06:00.660626Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T03:59:20.481372Z digest=sha256:b19b46ed46d96da93a1d63adacbd9c50f4b2b55f62511aa173a5f367953922fc

Observation f1e14479-8bc7-48b6-b53f-27767b7a7224 · outbound

This paper cites The Unreasonable Fairness of Maximum Nash Welfare.

Fair Interval Scheduling of Indivisible Chores The Unreasonable Fairness of Maximum Nash Welfare

Reference 17

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T04:06:00.646668Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T03:59:20.481372Z digest=sha256:8cb292580f5cd6ebbd8566a059e1a2b109f137ac13ac6cf61603094406076315

Observation b6bf4e07-8dbd-467a-b51b-1bf309335160 · outbound

This paper cites EFX Exists for Three Agents.

Fair Interval Scheduling of Indivisible Chores EFX Exists for Three Agents

Reference 18

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T04:06:00.641067Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T03:59:20.481372Z digest=sha256:50a018b2e6be849fb139ef283ed250a52996c40af9bf4014e115a1fb743ba36f

Observation 277e1c54-6845-4182-b015-0f247067f5b9 · outbound

This paper cites Fair Allocation of Indivisible Items with Conflict Graphs.

Fair Interval Scheduling of Indivisible Chores Fair Allocation of Indivisible Items with Conflict Graphs

Reference 19

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T04:06:00.637424Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T03:59:20.481372Z digest=sha256:4d0511c87dda7f38f5859370dfec35b424ba5904c80eaf9d157cf1d9c64ac27f

Observation 1535f5d0-241d-4898-8f8d-fdb5f647e1bd · outbound

This paper cites On Fair Division under Heterogeneous Matroid Constraints.

Fair Interval Scheduling of Indivisible Chores On Fair Division under Heterogeneous Matroid Constraints

Reference 20

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T04:06:00.633339Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T03:59:20.481372Z digest=sha256:5d15b4a278c78bf87f26fb06a5b3d8ed47df39bf084cc10dfc17925b61b0708c

Observation 8e917cb6-8b12-4fed-8f34-92f33112e14c · outbound

This paper cites How to Fairly Allocate Easy and Difficult Chores.

Fair Interval Scheduling of Indivisible Chores How to Fairly Allocate Easy and Difficult Chores

Reference 21

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T04:06:00.627704Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T03:59:20.481372Z digest=sha256:7e881e9546dc5d813c2d122e15d96f8b65a2e66624d3b3ccd797f57bb2d0ec56

Observation c8aae408-e1ce-4429-9045-b7a52f9fa214 · outbound

This paper cites Resource Allocation and the Public Sector.

Fair Interval Scheduling of Indivisible Chores Resource Allocation and the Public Sector

Reference 22

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T04:06:00.619224Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T03:59:20.481372Z digest=sha256:3a0f622426417d532b0afdb129ca5bdadd83d4017d7ba87dc5de2fd85646141e

Observation e9cba3d7-c81b-4c68-9d25-250a0ba6e9b4 · outbound

This paper cites Puzzle-Math.

Fair Interval Scheduling of Indivisible Chores Puzzle-Math

Reference 23

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T04:06:00.614841Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T03:59:20.481372Z digest=sha256:0b1ce31255ba817023769398e6003be7d141e9af100829dd87fd928db8d1527e

Observation c665c164-174b-4394-a352-b59b1cb9938c · outbound

This paper cites aha! Insight.

Fair Interval Scheduling of Indivisible Chores aha! Insight

Reference 24

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T04:06:00.611334Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T03:59:20.481372Z digest=sha256:01205171e2e0447fc68fd05255a24323515b89ad3e342a540278130254114de8

Observation 1801bc5c-3736-40d0-ad5b-d488a4e90698 · outbound

This paper cites Fair and Efficient Allocations of Chores under Bivalued Preferences.

Fair Interval Scheduling of Indivisible Chores Fair and Efficient Allocations of Chores under Bivalued Preferences

Reference 25

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T04:06:00.607728Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T03:59:20.481372Z digest=sha256:7e8b8d1eb1f1694fd6e14cd9f9831fdd1534573079f2567ff4641815a0aa9578

Observation f100c27f-9863-45aa-b90b-62c52a33fd4a · outbound

This paper cites New Algorithms for the Fair and Effcient Allocation of Indivisible Chores.

Fair Interval Scheduling of Indivisible Chores New Algorithms for the Fair and Effcient Allocation of Indivisible Chores

Reference 26

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T04:06:00.604806Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T03:59:20.481372Z digest=sha256:ee937782fb25f3d0deb79e19f28e2938ecfcde759bba99876a6da00804551a59

Observation 89c6bc71-98bd-4535-8ad1-96c696a6e4f0 · outbound

This paper cites Spliddit: Unleashing Fair Division Algorithms.

Fair Interval Scheduling of Indivisible Chores Spliddit: Unleashing Fair Division Algorithms

Reference 27

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T04:06:00.601305Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T03:59:20.481372Z digest=sha256:bb7b5e0d4ba0cd01ad2a3dedd0054cb5a72736c1d193de13cc0453e0a40827d1

Observation 459c091d-4d8a-49d3-bb27-bcc268391000 · outbound

This paper cites Hajnal and E.

Fair Interval Scheduling of Indivisible Chores Hajnal and E

Reference 28

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T04:06:00.598096Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T03:59:20.481372Z digest=sha256:5808a01fdd76d268b87c64a24220a237b43bbe73779786b2432f691b4a2c612f

Observation 1482ebe9-382c-4b7f-8140-93513934dad4 · outbound

This paper cites Fair Allocation of Conflicting Items.

Fair Interval Scheduling of Indivisible Chores Fair Allocation of Conflicting Items

Reference 29

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T04:06:00.594088Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T03:59:20.481372Z digest=sha256:1c56c200173ac29aad9775d92d0ced0ea16eed6bd7b81171a69e192118266f5b

Observation 1166c6d1-4ebe-4f21-9b45-3612a7e3e62e · outbound

This paper cites Kajibuntan: A House Chore Division App.

Fair Interval Scheduling of Indivisible Chores Kajibuntan: A House Chore Division App

Reference 30

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T04:06:00.590468Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T03:59:20.481372Z digest=sha256:c69d13c02ad6609ef07c28b589913d50b614156a9b9e2a22519e5fbede54b3eb

Observation bb031c37-81a0-47d6-a201-cf1b1a822494 · outbound

This paper cites Fair Scheduling via Iterative Quasi-Uniform Sampling.

Fair Interval Scheduling of Indivisible Chores Fair Scheduling via Iterative Quasi-Uniform Sampling

Reference 31

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T04:06:00.586682Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T03:59:20.481372Z digest=sha256:ae8391d4aaaba61b0d6729364386b07b1d16eeb74e8bf5ca9cc972776c52767b

Observation eb474625-1734-4445-ba95-a7942bc4985d · outbound

This paper cites Handbook of Scheduling: Algorithms, Models, and Performance Analysis.

Fair Interval Scheduling of Indivisible Chores Handbook of Scheduling: Algorithms, Models, and Performance Analysis

Reference 32

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T04:06:00.583280Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T03:59:20.481372Z digest=sha256:ba794e1edc0e8a133d1e5ecdf397d978f18635021e7ec24c3037ca1d35a34ac3

Observation e70028d1-83bb-411b-9cf4-48d2866e81d1 · outbound

This paper cites Fair Scheduling for Time-Dependent Resources.

Fair Interval Scheduling of Indivisible Chores Fair Scheduling for Time-Dependent Resources

Reference 33

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T04:06:00.579425Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T03:59:20.481372Z digest=sha256:07fc7c38f69b0fa0227b6a6baa3d40b19d631344129659b33daca03e1a77c809

Observation 2eeedec8-e36b-439d-aa20-b4484ae6a820 · outbound

This paper cites On Approximately Fair Allocations of Indivisible Goods.

Fair Interval Scheduling of Indivisible Chores On Approximately Fair Allocations of Indivisible Goods

Reference 34

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T04:06:00.575662Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T03:59:20.481372Z digest=sha256:47afc083c3924d152b7c7d22aa64f39cbfcfeacbdab75436405b71c8210476a7

Observation da6c47d1-b3b7-4c58-bd78-4a4074fa1655 · outbound

This paper cites Fair Division in the Internet Age.

Fair Interval Scheduling of Indivisible Chores Fair Division in the Internet Age

Reference 35

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T04:06:00.571477Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T03:59:20.481372Z digest=sha256:f6ed3edf282cfbadbe7fb7b2059adee2d8e9d8df6826e4d485ca49d221f7860f

Observation b14bf6be-c531-4f81-938c-fa315ec9967e · outbound

This paper cites Matroid Theory.

Fair Interval Scheduling of Indivisible Chores Matroid Theory

Reference 36

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T04:06:00.567788Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T03:59:20.481372Z digest=sha256:c2df1f886508544feacd64138c690c83f44792b28fe03f5a325eff5d2c451250

Observation 2b7dc811-e391-4b90-984f-39c2463844d2 · outbound

This paper cites Almost Envy-Freeness with General Valuations.

Fair Interval Scheduling of Indivisible Chores Almost Envy-Freeness with General Valuations

Reference 37

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T04:06:00.651814Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T03:59:20.481372Z digest=sha256:8831a2d3e751b2bfdbde6bd84e5008abc9eb7efcf45a5753a10f0daf99d82e5a

Observation 33d97d30-ab25-4169-ba6d-f521122a82f8 · outbound

This paper cites Constraints in Fair Division.

Fair Interval Scheduling of Indivisible Chores Constraints in Fair Division

Reference 38

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T04:06:00.711633Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T03:59:20.481372Z digest=sha256:698619d110cde514cabd922821abbf78293b463ef131f2347ba5bab1effe9753

Observation e144c9fa-48fd-4307-9c06-e099446ecb71 · outbound

This paper cites Fair Chore Division for Climate Change.

Fair Interval Scheduling of Indivisible Chores Fair Chore Division for Climate Change

Reference 39

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T04:06:00.564748Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T03:59:20.481372Z digest=sha256:03390751384667795659ef924488a4f39fd086320e9f1007ca1a9a2c4fed3cb7

Observation 0b6ce9bd-6887-408b-aaea-d262fa703792 · outbound

This paper cites Introduction to Graph Theory , volume 2.

Fair Interval Scheduling of Indivisible Chores Introduction to Graph Theory , volume 2

Reference 40

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T04:06:00.560919Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T03:59:20.481372Z digest=sha256:4b0f8d8bcb13a9806859ec1880a3980a7f1b2d4eb3421e95072092f8ae840c37

Observation cd46f518-f11e-4bb5-a040-a6728c355a1f · outbound

This paper cites Approximately EFX Allocations for Indivisible Chores.

Fair Interval Scheduling of Indivisible Chores Approximately EFX Allocations for Indivisible Chores

Reference 41

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T04:06:00.557549Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T03:59:20.481372Z digest=sha256:4b3e0676617a465f35bbced6b57386f88975338486c40e72e182d396cc704a58

Pith citing papers

No inbound Pith citation observations are available.