{"as_of":"2026-08-08T13:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dc0219bd168acfb89633a90db45f44decbf2dbd07ffe8528edf9da4d116b788d","coverage":[{"denominator":46,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":46,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-19T08:30:41.230299Z","state":"measured"},{"denominator":48,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":48,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T22:38:12.260551Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-06T15:52:57.074849Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.20317","snapshot_observed_at":"2026-08-06T22:38:12.260551Z","title":"Exact and ap- proximate maximin share allocations in multi-graphs","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.21493","last_updated":"2025-06-26T17:21:51Z","snapshot_observed_at":"2026-08-06T22:21:21.673824Z","submitted_at":"2025-06-26T17:21:51Z","title":"From multi-allocations to allocations, with subadditive valuations","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T22:38:12.260551Z"},"links":{"cited_paper":"/paper/2506.20317","citing_paper":"/paper/2506.21493"},"observation_digest":"sha256:33f02e4f1234bca50d1aff0d4ef9465eb8d1c3d6f40cd4d67b5aabd37511e630","observation_id":"5a1b1669-c3cb-4d3d-81a4-7c9ad73fd6c8","resolution":{"observed_at":"2026-08-06T22:38:12.260551Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs","version":2},"cited_work":{"arxiv_id":"2506.20317","doi":null,"metadata_source":"pith","pith_arxiv_id":"2506.20317","snapshot_observed_at":"2026-08-06T15:52:57.074849Z","title":"Exact and approximate maximin share allocations in multi-graphs","venue":"cs.GT","work_id":"985e309e-867b-4ea0-9412-f0aca0555291","year":2025},"citing_paper":{"arxiv_id":"2507.14957","last_updated":"2025-07-30T16:51:28Z","snapshot_observed_at":"2026-08-06T15:41:38.019870Z","submitted_at":"2025-07-20T13:32:12Z","title":"Probing EFX via PMMS: (Non-)Existence Results in Discrete Fair Division","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T15:52:55.478844Z"},"links":{"cited_paper":"/paper/2506.20317","citing_paper":"/paper/2507.14957"},"observation_digest":"sha256:02c7223e85147324a9424a48893a3d9889388cd06a5f260c9918eb89fa16be2d","observation_id":"33be7446-939c-41e7-adcf-fd0a013259a2","resolution":{"observed_at":"2026-08-06T15:52:57.079145Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.20317/citation-record","integrity":"/paper/2506.20317/integrity","json":"/paper/2506.20317/citation-record.json","paper":"/paper/2506.20317"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2410.17002","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"EFX allocations and orientations on bipartite multi-graphs: A complete picture","venue":null,"work_id":"c5feaf77-78ae-49ce-9742-9111d14e380f","year":2024},"citing_paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-19T08:30:41.230299Z"},"links":{"citing_paper":"/paper/2506.20317"},"observation_digest":"sha256:ed818d87592bf8619a8addfbd4f8aa06a96abba26a296773ea617ecc2435dc0e","observation_id":"4e736a56-68e5-4eb9-838a-14cdf4b4fb82","resolution":{"observed_at":"2026-05-19T08:32:11.621276Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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":"Envy-free matchings in bipartite graphs and their applications to fair division","venue":null,"work_id":"15ee0d18-6bfb-4847-b5c0-3ecd08e67c66","year":2022},"citing_paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-19T08:30:41.230299Z"},"links":{"citing_paper":"/paper/2506.20317"},"observation_digest":"sha256:b53b86ff8ea5433fd90901fb71c6b5446cb90bdcc781a5b53b54c992fd76aa76","observation_id":"1ee28b6a-9177-420f-b035-2b9507c73746","resolution":{"observed_at":"2026-05-19T08:32:13.172326Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.07304","last_updated":"2023-07-24T16:22:36Z","snapshot_observed_at":"2026-07-06T15:54:01.430352Z","submitted_at":"2023-07-14T12:29:31Z","title":"Breaking the $3/4$ Barrier for Approximate Maximin Share","version":2},"cited_work":{"arxiv_id":"2307.07304","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2307.07304","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Breaking the 3/4 barrier for approximate maximin share","venue":null,"work_id":"c272eaa7-673e-43ca-8050-f219d5652488","year":2023},"citing_paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-19T08:30:41.230299Z"},"links":{"cited_paper":"/paper/2307.07304","citing_paper":"/paper/2506.20317"},"observation_digest":"sha256:9e3fccbe86e5bf3cf98db2859fdeae5a4d5ee6ccce1b5b68d75f3f1676d4a76e","observation_id":"7f6c8b50-5e72-4ebe-9ed8-f8edd9378c2e","resolution":{"observed_at":"2026-05-19T08:32:11.639529Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.16788","last_updated":"2023-07-21T18:24:04Z","snapshot_observed_at":"2026-07-31T14:38:50.948748Z","submitted_at":"2023-03-29T15:23:32Z","title":"Simplification and Improvement of MMS Approximation","version":2},"cited_work":{"arxiv_id":"2303.16788","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2303.16788","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Simplification and improvement of MMS approximation","venue":null,"work_id":"01a3bc71-0d89-4cb5-9077-589722e5811b","year":2023},"citing_paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-19T08:30:41.230299Z"},"links":{"cited_paper":"/paper/2303.16788","citing_paper":"/paper/2506.20317"},"observation_digest":"sha256:a21b3dfc7ab2098b250082c8966ac1de1ce85c3aab58f189318149aa97c19f38","observation_id":"6ec614b2-9b48-4b4e-a363-94db2303b288","resolution":{"observed_at":"2026-05-19T08:32:11.614500Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.12916","last_updated":"2024-02-16T14:28:18Z","snapshot_observed_at":"2026-08-03T14:44:06.237120Z","submitted_at":"2023-07-24T16:17:45Z","title":"Improving Approximation Guarantees for Maximin Share","version":2},"cited_work":{"arxiv_id":"2307.12916","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2307.12916","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Improving approximation guarantees for maximin share.CoRR, abs/2307.12916","venue":null,"work_id":"30b84b48-5681-4027-9e2f-7eaa57522077","year":2023},"citing_paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-19T08:30:41.230299Z"},"links":{"cited_paper":"/paper/2307.12916","citing_paper":"/paper/2506.20317"},"observation_digest":"sha256:f2799ccdbdf050a6dda50e9a0a106c30453c1f46e9849fdd7346abc663338b47","observation_id":"4475be37-e602-4ea0-9d26-09fb73c8a7be","resolution":{"observed_at":"2026-05-19T08:32:11.682487Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.14545","last_updated":"2023-10-22T17:50:27Z","snapshot_observed_at":"2026-08-05T08:31:02.425045Z","submitted_at":"2023-08-28T12:58:33Z","title":"Randomized and Deterministic Maximin-share Approximations for Fractionally Subadditive Valuations","version":2},"cited_work":{"arxiv_id":"2308.14545","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2308.14545","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Randomized and determin- istic maximin-share approximations for fractionally subadditive valuations","venue":null,"work_id":"50104abd-4d96-4372-a58d-7a35182dae0f","year":2023},"citing_paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-19T08:30:41.230299Z"},"links":{"cited_paper":"/paper/2308.14545","citing_paper":"/paper/2506.20317"},"observation_digest":"sha256:df5aa43e368dbb4f7d85d8ca00eadb56b9eb69e63416314ddf8832bcaa7cebe3","observation_id":"25066e5a-8181-4f72-8783-ecfacd416e26","resolution":{"observed_at":"2026-05-19T08:32:11.688619Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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":"V oudouris, and Xiaowei Wu","venue":null,"work_id":"1018e645-fb5a-4240-be4f-432aa0647241","year":2023},"citing_paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-19T08:30:41.230299Z"},"links":{"citing_paper":"/paper/2506.20317"},"observation_digest":"sha256:92e64e673e246dba890967f601278fe8d648c8fe7c71bfc6902c2a41774894e6","observation_id":"1c1f3283-0fd3-4e83-967b-306b1faae527","resolution":{"observed_at":"2026-05-19T08:32:13.152171Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1806.03114","last_updated":"2018-06-08T12:25:37Z","snapshot_observed_at":"2026-07-06T06:43:44.603548Z","submitted_at":"2018-06-08T12:25:37Z","title":"Comparing Approximate Relaxations of Envy-Freeness","version":1},"cited_work":{"arxiv_id":"1806.03114","doi":null,"metadata_source":"pith","pith_arxiv_id":"1806.03114","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Comparing Approximate Relaxations of Envy-Freeness","venue":"cs.GT","work_id":"67b88c43-a957-43b8-83f0-248a02278f71","year":2018},"citing_paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-19T08:30:41.230299Z"},"links":{"cited_paper":"/paper/1806.03114","citing_paper":"/paper/2506.20317"},"observation_digest":"sha256:8621687b6ca9a1fe2ba38d0ccbea6fbf2941bf8fa41e1c1017844c0c31ae9a8c","observation_id":"e14b39fd-1c69-45ed-88d5-5e0d5b7600a0","resolution":{"observed_at":"2026-05-19T08:32:11.669848Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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":"Approximation algorithms for computing maximin share allocations","venue":null,"work_id":"ae58e2ea-36ee-4b56-8e4b-da4222f403bd","year":2017},"citing_paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-19T08:30:41.230299Z"},"links":{"citing_paper":"/paper/2506.20317"},"observation_digest":"sha256:88a4e35c81220280d8a9ff7a9532b00a9c7a64656af1b5519c35969c587f2616","observation_id":"4c3cb202-2d83-43e2-8890-64b9f50566af","resolution":{"observed_at":"2026-05-19T08:32:13.146110Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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":"Competitive equilibrium with indivisible goods and generic budgets","venue":null,"work_id":"870f1062-ba47-4222-bbf9-5ae624004cd5","year":2021},"citing_paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-19T08:30:41.230299Z"},"links":{"citing_paper":"/paper/2506.20317"},"observation_digest":"sha256:2aaa4946a2f44fd7bead436873013ee48e399359cafb61cfe9ba7b573c62db6d","observation_id":"fec6ef69-f39c-4a61-b378-ab1b1b937966","resolution":{"observed_at":"2026-05-19T08:32:13.205991Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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":"Approximation algorithms for maximin fair division.ACM Trans","venue":null,"work_id":"fdc08b99-28b3-4278-b0de-673e5f459bca","year":2020},"citing_paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-19T08:30:41.230299Z"},"links":{"citing_paper":"/paper/2506.20317"},"observation_digest":"sha256:7cd5653b444a509864f22b6b92362dcb79675c6526844dc786af08291abd76c0","observation_id":"ee3fefcb-4581-42c7-9b12-f8989d1ec88e","resolution":{"observed_at":"2026-05-19T08:32:13.141547Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2012.12710","last_updated":"2021-02-04T16:40:20Z","snapshot_observed_at":"2026-08-01T15:07:42.058495Z","submitted_at":"2020-12-23T14:36:56Z","title":"Existence and Computation of Maximin Fair Allocations Under Matroid-Rank Valuations","version":2},"cited_work":{"arxiv_id":"2012.12710","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2012.12710","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Existence and computation of maximin fair allocations under matroid- rank valuations","venue":null,"work_id":"6d0b5dd3-d2f9-42a7-8324-6bb5e4a660e8","year":2012},"citing_paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-19T08:30:41.230299Z"},"links":{"cited_paper":"/paper/2012.12710","citing_paper":"/paper/2506.20317"},"observation_digest":"sha256:d91974b60c203972089b78b4c7213e4dacf76e50a2fa501bf0c65fcb191cec6e","observation_id":"2b2c871b-9fdf-4b40-847d-2ae3a418bb2c","resolution":{"observed_at":"2026-05-19T08:32:11.713283Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.12444","last_updated":"2023-03-22T10:28:01Z","snapshot_observed_at":"2026-08-07T16:07:10.355949Z","submitted_at":"2023-03-22T10:28:01Z","title":"On Fair Allocation of Indivisible Goods to Submodular Agents","version":1},"cited_work":{"arxiv_id":"2303.12444","doi":"10.48550/arxiv.2303.12444","metadata_source":"arxiv_reference","pith_arxiv_id":"2303.12444","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On fair allocation of indivisible goods to submodular agents","venue":"arXiv (Cornell University)","work_id":"c9105178-ff22-459c-a899-648b8553b9fa","year":2023},"citing_paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-19T08:30:41.230299Z"},"links":{"cited_paper":"/paper/2303.12444","citing_paper":"/paper/2506.20317"},"observation_digest":"sha256:f5487b64a3402099a80ce35d9999858c20d11e7215cc892e4811d56b6c9b6022","observation_id":"dafe3ad7-7abb-42b3-83b6-ea55c4ec15db","resolution":{"observed_at":"2026-05-19T08:32:11.633925Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.06513","last_updated":"2024-12-09T14:14:44Z","snapshot_observed_at":"2026-08-05T04:08:06.650101Z","submitted_at":"2024-12-09T14:14:44Z","title":"EFX Allocations on Some Multi-graph Classes","version":1},"cited_work":{"arxiv_id":"2412.06513","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.06513","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"EFX allocations on some multi-graph classes","venue":null,"work_id":"40c6eaa5-a4c2-4d75-99f1-5848ca2b22b1","year":2024},"citing_paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-19T08:30:41.230299Z"},"links":{"cited_paper":"/paper/2412.06513","citing_paper":"/paper/2506.20317"},"observation_digest":"sha256:5cc9af649c6bfb16881cfbc4658c447a8091fa779da1977ba8627e8713707e38","observation_id":"e2ac26ad-e1dd-475e-abea-6e4937488396","resolution":{"observed_at":"2026-05-19T08:32:11.664178Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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":"e520bfd1-40c3-4939-b102-439bc5373b4a","year":2011},"citing_paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-19T08:30:41.230299Z"},"links":{"citing_paper":"/paper/2506.20317"},"observation_digest":"sha256:4bddf430c6ef182ee32639584b769a3e9f3522708783e74f25658bb24ea1c429","observation_id":"1b4ee3e1-9b31-4deb-be00-1c36b0a935d0","resolution":{"observed_at":"2026-05-19T08:32:13.136098Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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":"Procaccia, Nisarg Shah, and Junxing Wang","venue":null,"work_id":"c68b953a-7005-437a-bd5d-a93739f743be","year":2019},"citing_paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-19T08:30:41.230299Z"},"links":{"citing_paper":"/paper/2506.20317"},"observation_digest":"sha256:882581cbfc585ff9367204e713512a7643a9c35531beca60a842487312f4a2ff","observation_id":"b04b2ed6-d1c8-42b6-853c-cf2b207917a4","resolution":{"observed_at":"2026-05-19T08:32:13.132607Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.08504","last_updated":"2023-12-13T20:31:55Z","snapshot_observed_at":"2026-08-03T08:11:04.049873Z","submitted_at":"2023-12-13T20:31:55Z","title":"1/2 Approximate MMS Allocation for Separable Piecewise Linear Concave Valuations","version":1},"cited_work":{"arxiv_id":"2312.08504","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2312.08504","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"1/2 approximate MMS allocation for separable piecewise linear concave valuations","venue":null,"work_id":"60c9eae8-891d-4c71-b6bb-c202fb4c9ddc","year":2023},"citing_paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-19T08:30:41.230299Z"},"links":{"cited_paper":"/paper/2312.08504","citing_paper":"/paper/2506.20317"},"observation_digest":"sha256:a6ed10b93153f9141c8f1d86e6faebefc2075dfc1a8049d4aad3d51619ba7747","observation_id":"777cbc20-143f-492b-9b17-b852fdb5f0d1","resolution":{"observed_at":"2026-05-19T08:32:11.676737Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.05891","last_updated":"2025-02-14T18:04:28Z","snapshot_observed_at":"2026-08-04T17:16:43.282430Z","submitted_at":"2024-07-08T12:54:36Z","title":"Fair and Truthful Allocations Under Leveled Valuations","version":2},"cited_work":{"arxiv_id":"2407.05891","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.05891","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fair and truthful allocations under leveled valuations","venue":null,"work_id":"cec87451-7c21-4a8a-8f35-317160ec2edb","year":2024},"citing_paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-19T08:30:41.230299Z"},"links":{"cited_paper":"/paper/2407.05891","citing_paper":"/paper/2506.20317"},"observation_digest":"sha256:920af567fc76984d225ea32ce3d672e33d42f758c1eda1c3ceadb85ec1433f7f","observation_id":"ed77de9d-05d7-4e20-955a-baf33f2291b2","resolution":{"observed_at":"2026-05-19T08:32:11.694871Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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":"Maximin share guarantees for few agents with subadditive valuations","venue":null,"work_id":"e62e728b-b809-4435-8522-f9e4483aa78e","year":2025},"citing_paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-19T08:30:41.230299Z"},"links":{"citing_paper":"/paper/2506.20317"},"observation_digest":"sha256:6f12844ae636e2ed9f2d1b12b86f85cbc34d17495b114c495edeca6316a2430f","observation_id":"455905b8-42fc-4326-ac31-dc6a0d4067c2","resolution":{"observed_at":"2026-05-19T08:32:13.128603Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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 in graphs","venue":null,"work_id":"09956598-3ebf-4a59-81e0-590e26cb8896","year":2023},"citing_paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-19T08:30:41.230299Z"},"links":{"citing_paper":"/paper/2506.20317"},"observation_digest":"sha256:379a42753cef4c95861f3487458ae34b06611144ff8a8432532d745ee9ec4531","observation_id":"6af0fa08-a946-4072-8573-886649f1d8ce","resolution":{"observed_at":"2026-05-19T08:32:13.104788Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.03724","last_updated":"2021-06-07T15:39:18Z","snapshot_observed_at":"2026-08-04T19:56:52.346413Z","submitted_at":"2021-06-07T15:39:18Z","title":"Truthful allocation in graphs and hypergraphs","version":1},"cited_work":{"arxiv_id":"2106.03724","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2106.03724","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Truthful allocation in graphs and hyper- graphs","venue":null,"work_id":"71325075-172e-4743-85b2-9aaa62f5f6a7","year":2021},"citing_paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-19T08:30:41.230299Z"},"links":{"cited_paper":"/paper/2106.03724","citing_paper":"/paper/2506.20317"},"observation_digest":"sha256:5f5a7a5eebc3f22b3a2bd9de83cb9343ca2e2d2979be44058c382bdd7a31035e","observation_id":"15fe5bba-69e1-4a17-8c52-e27a620a4093","resolution":{"observed_at":"2026-05-19T08:32:11.707375Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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 existence and efficiency of PMMS allocations","venue":null,"work_id":"2ec2055a-43a7-4e92-810a-c157fd42ac20","year":2024},"citing_paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-19T08:30:41.230299Z"},"links":{"citing_paper":"/paper/2506.20317"},"observation_digest":"sha256:15959c54e63645ec1bd3204d8bb9b007be39c3690d750e2d4cd96618a04214e9","observation_id":"bd81c6d7-e7c5-40c1-8ff2-4df3863d65eb","resolution":{"observed_at":"2026-05-19T08:32:13.124121Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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":"Ef1 and efx orientations","venue":null,"work_id":"8e3a994a-1590-40ee-a568-9623a4660cd7","year":2024},"citing_paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-19T08:30:41.230299Z"},"links":{"citing_paper":"/paper/2506.20317"},"observation_digest":"sha256:99baded4c1ab05f07719434f8202d45d9d7c9b7f57e503e065fb1337ab4be5cf","observation_id":"b674fef0-94f0-4df2-a3b5-d54661fdd059","resolution":{"observed_at":"2026-05-19T08:32:13.119354Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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":"Graph balancing: A special case of scheduling unrelated parallel machines","venue":null,"work_id":"733a51e7-9e26-4e05-b660-485dcc2b1a7a","year":2014},"citing_paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-19T08:30:41.230299Z"},"links":{"citing_paper":"/paper/2506.20317"},"observation_digest":"sha256:cb0ba160d5e53cb563b6f36fb6d8dcfb1aef25c8514ea9a7caa6aafe11ae831b","observation_id":"aa7d568d-d0f3-4057-8f3b-6c47866a9da3","resolution":{"observed_at":"2026-05-19T08:32:13.085826Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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 allocations with subadditive and xos valuations","venue":null,"work_id":"0d8b37e3-12fa-4c78-8526-63802795ca97","year":2025},"citing_paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-19T08:30:41.230299Z"},"links":{"citing_paper":"/paper/2506.20317"},"observation_digest":"sha256:cfbd26cce9192e5e77fdc9e0e57b218ffebc62f6c745dd6c7d7d3a099a443caf","observation_id":"18a5c3bf-faf4-47a1-80a6-fae814a6d020","resolution":{"observed_at":"2026-05-19T08:32:13.100814Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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":"Concentration and maximin fair allocations for subadditive valuations","venue":null,"work_id":"ce6084df-1712-4244-909d-3637913c075f","year":2025},"citing_paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-19T08:30:41.230299Z"},"links":{"citing_paper":"/paper/2506.20317"},"observation_digest":"sha256:7aa73a7cec4af7a588e67b8a17140df36e7b37754070f68958de32a7ff7bb9dd","observation_id":"e80514e4-073c-4984-aeb9-c8ed7c94e04a","resolution":{"observed_at":"2026-05-19T08:32:13.115092Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.04977","last_updated":"2021-10-19T16:50:18Z","snapshot_observed_at":"2026-07-06T10:58:24.359846Z","submitted_at":"2021-04-11T10:01:16Z","title":"A tight negative example for MMS fair allocations","version":2},"cited_work":{"arxiv_id":"2104.04977","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2104.04977","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A tight negative example for MMS fair allocations","venue":null,"work_id":"035458f0-453d-4892-9b9b-225a4340ca45","year":2021},"citing_paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-19T08:30:41.230299Z"},"links":{"cited_paper":"/paper/2104.04977","citing_paper":"/paper/2506.20317"},"observation_digest":"sha256:b9f3385654a7c4f23c394667ebcce42f461d02e724aaa6f7e1c16c272e54ac33","observation_id":"4c373f73-a711-4356-bd6e-2877152f6c4b","resolution":{"observed_at":"2026-05-19T08:32:11.701339Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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 improved approximation algorithm for maximin shares","venue":null,"work_id":"d4d422d2-a2f0-4ed8-8cdb-8490edd57bd6","year":2021},"citing_paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-19T08:30:41.230299Z"},"links":{"citing_paper":"/paper/2506.20317"},"observation_digest":"sha256:3c661cf7f5c672b7adae5e498fffe33a6320ffbc5c1befc099215720c175b076","observation_id":"59bda718-d126-48ef-86d4-fbc6fe15e965","resolution":{"observed_at":"2026-05-19T08:32:13.109419Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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: Improvement","venue":null,"work_id":"51d8102a-aa62-48da-90c1-08a2589c7246","year":2021},"citing_paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-19T08:30:41.230299Z"},"links":{"citing_paper":"/paper/2506.20317"},"observation_digest":"sha256:1c187f6b5e364b1c0a570e73e7b5b16f9cfd9a5e4013daaee8c20e0e5f013928","observation_id":"ef430a6f-36b2-47dd-92ed-fc21b1940023","resolution":{"observed_at":"2026-05-19T08:32:13.157110Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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: Beyond additive valuations","venue":null,"work_id":"a5399656-7cb1-4a3c-8806-088fdc4baad3","year":2022},"citing_paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-19T08:30:41.230299Z"},"links":{"citing_paper":"/paper/2506.20317"},"observation_digest":"sha256:90764ff8a504804c47d3e4793c71f05498a91b8bf4b32bb53dd72a722e7d22ec","observation_id":"386502b1-92c8-4f9d-bcd2-b5eba9228a59","resolution":{"observed_at":"2026-05-19T08:32:13.097074Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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":"Haxell and Tibor Szab ´o","venue":null,"work_id":"59d8d86d-0baa-42cb-8cec-1b608009846f","year":2006},"citing_paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-19T08:30:41.230299Z"},"links":{"citing_paper":"/paper/2506.20317"},"observation_digest":"sha256:8d2aa3a651d49627e112d428594ca8a0b5cf7782095cf16ca377353161e23bff","observation_id":"95b0cd9d-85ac-41f0-bb70-fdf4d6e01f3f","resolution":{"observed_at":"2026-05-19T08:32:13.093710Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2105.09383","last_updated":"2021-05-19T20:17:42Z","snapshot_observed_at":"2026-08-02T20:10:37.811546Z","submitted_at":"2021-05-19T20:17:42Z","title":"Guaranteeing Maximin Shares: Some Agents Left Behind","version":1},"cited_work":{"arxiv_id":"2105.09383","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2105.09383","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Guaranteeing maximin shares: Some agents left behind","venue":null,"work_id":"f057e27e-3eed-4db4-aa1f-720545a62ead","year":2021},"citing_paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-19T08:30:41.230299Z"},"links":{"cited_paper":"/paper/2105.09383","citing_paper":"/paper/2506.20317"},"observation_digest":"sha256:58ce60619a4d028d30e4e686e9ccb789cca769418433ca3c035995aead277a0a","observation_id":"287e7d9b-0a2b-40e9-b08f-3f3c3e2942ff","resolution":{"observed_at":"2026-05-19T08:32:11.719116Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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":"Ordinal maximin share approximation for goods","venue":null,"work_id":"db20d5b1-8403-42f0-8b4e-dc05b68e27e9","year":2022},"citing_paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-19T08:30:41.230299Z"},"links":{"citing_paper":"/paper/2506.20317"},"observation_digest":"sha256:337da6b478bf92222867a40ecf93e7aff591f7750d57e40760dda401f58a4f22","observation_id":"64d3021f-2af7-454a-91e5-83ab491b6f98","resolution":{"observed_at":"2026-05-19T08:32:13.089724Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2410.12039","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-04T14:59:55.414380Z","title":"EFX orientations of multigraphs","venue":null,"work_id":"c43d8694-20d7-45c2-a1c1-450f8c28e37f","year":2024},"citing_paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-19T08:30:41.230299Z"},"links":{"citing_paper":"/paper/2506.20317"},"observation_digest":"sha256:496f8493bff83ff0fd16a889a0d5eca803c3d77c984c8ccfa3812537ca07e5f5","observation_id":"b3d765d7-f0a5-4d34-8307-cb7cbc03e8a0","resolution":{"observed_at":"2026-05-19T08:32:11.607631Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.11582","last_updated":"2024-04-17T17:28:30Z","snapshot_observed_at":"2026-08-04T09:24:50.739605Z","submitted_at":"2024-04-17T17:28:30Z","title":"Maximin Shares in Hereditary Set Systems","version":1},"cited_work":{"arxiv_id":"2404.11582","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.11582","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Maximin shares in hereditary set systems","venue":null,"work_id":"87d88e41-ef8f-4bdf-b177-1b06bb85e77e","year":2024},"citing_paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-19T08:30:41.230299Z"},"links":{"cited_paper":"/paper/2404.11582","citing_paper":"/paper/2506.20317"},"observation_digest":"sha256:0ab2236f30e7f393644dacb3836cedb2d26a1ece711adbc41fd192c9f2b690c5","observation_id":"9b996553-3ca3-4d90-a1ba-115f74434ed2","resolution":{"observed_at":"2026-05-19T08:32:11.645392Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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":"Maximin share allocations for assignment valuations","venue":null,"work_id":"78fd2a1f-2761-4c2f-9fc9-01777397a39a","year":2023},"citing_paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-19T08:30:41.230299Z"},"links":{"citing_paper":"/paper/2506.20317"},"observation_digest":"sha256:7f30b7c97205d2e1cb277de28c6bc9cdfd6498fad18bc9354922ba6b46aa10f1","observation_id":"5fcacbff-3d64-4152-94ca-fe61b2c93623","resolution":{"observed_at":"2026-05-19T08:32:13.210545Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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 Game theoretic Settings","venue":null,"work_id":"b2bce253-83a0-467b-9b32-b6d8343e1247","year":2017},"citing_paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-19T08:30:41.230299Z"},"links":{"citing_paper":"/paper/2506.20317"},"observation_digest":"sha256:d2f0de16d8393110611489d05d4631d203576c75ed268dec456ca4db01e7c3b5","observation_id":"0477fb0d-8c28-4ef6-b90a-52aecbcedd7d","resolution":{"observed_at":"2026-05-19T08:32:13.200692Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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":"Procaccia, and Junxing Wang","venue":null,"work_id":"a1501d16-090b-4c3a-90ae-d2898ee8a6d5","year":2018},"citing_paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-19T08:30:41.230299Z"},"links":{"citing_paper":"/paper/2506.20317"},"observation_digest":"sha256:9ae0f3f86ec21212a4d05ce48398064e17e8c90123ae7311fb43fdd2e87beb1d","observation_id":"cb0c954a-9198-4f0b-bb41-5ec0ba28fa2f","resolution":{"observed_at":"2026-05-19T08:32:13.195585Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.14272","last_updated":"2024-10-18T08:26:07Z","snapshot_observed_at":"2026-07-06T19:35:48.603411Z","submitted_at":"2024-10-18T08:26:07Z","title":"Envy-Free and Efficient Allocations for Graphical Valuations","version":1},"cited_work":{"arxiv_id":"2410.14272","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.14272","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Envy-free and efficient allocations for graphical valuations","venue":null,"work_id":"2130b415-6842-438e-ab58-0ceabce99a54","year":2024},"citing_paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-19T08:30:41.230299Z"},"links":{"cited_paper":"/paper/2410.14272","citing_paper":"/paper/2506.20317"},"observation_digest":"sha256:949ab1dd2d4a34efef3a3cbbee009ad09f827500aadd7749abd1288b040b04f1","observation_id":"4cc9b3dd-1e7b-4ec5-912c-f736961ba51a","resolution":{"observed_at":"2026-05-19T08:32:11.651538Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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":"Improved maximin guarantees for subadditive and fractionally subad- ditive fair allocation problem","venue":null,"work_id":"3ee5fdf7-488f-46ba-8413-f3667ee21286","year":2024},"citing_paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-19T08:30:41.230299Z"},"links":{"citing_paper":"/paper/2506.20317"},"observation_digest":"sha256:28cc4e6efca571d0a17c097ef1a5b26ed505e1ca926aadd5e69da84684fdec0e","observation_id":"87d66e28-58f3-45d9-86e4-29f670128e86","resolution":{"observed_at":"2026-05-19T08:32:13.181379Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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 the existence of efx allocations in multigraphs","venue":null,"work_id":"a69be0c3-edcd-41bc-a7c9-7f6b4751f7d1","year":2025},"citing_paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-19T08:30:41.230299Z"},"links":{"citing_paper":"/paper/2506.20317"},"observation_digest":"sha256:4face9b718f93f3cb86dd54febfd9743987819f258aea814887a4db131004a1a","observation_id":"e952a19f-9ef0-482c-aa46-89d0decbdce2","resolution":{"observed_at":"2026-05-19T08:32:13.177013Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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":"Extremal problems for transversals in graphs with bounded degree","venue":null,"work_id":"c49864ae-991f-4a7a-8f87-22b480fc1786","year":2006},"citing_paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-19T08:30:41.230299Z"},"links":{"citing_paper":"/paper/2506.20317"},"observation_digest":"sha256:f2183fd0c237d8ab67b5287bb2a296ff96e5cb6ae109162ea22fe9f1e34becf9","observation_id":"7950d89f-6d15-42a1-a1dd-435cecd3bcb9","resolution":{"observed_at":"2026-05-19T08:32:13.191038Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1011.4957","last_updated":"2010-11-22T21:30:29Z","snapshot_observed_at":"2026-07-06T02:19:34.814356Z","submitted_at":"2010-11-22T21:30:29Z","title":"On the Configuration-LP for Scheduling on Unrelated Machines","version":1},"cited_work":{"arxiv_id":"1011.4957","doi":null,"metadata_source":"pith","pith_arxiv_id":"1011.4957","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On the Configuration-LP for Scheduling on Unrelated Machines","venue":"cs.DM","work_id":"074e1e9a-fe0a-43ba-a639-2d4cfaa86738","year":2010},"citing_paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-19T08:30:41.230299Z"},"links":{"cited_paper":"/paper/1011.4957","citing_paper":"/paper/2506.20317"},"observation_digest":"sha256:e1672443e76834f296601ce0aeff811b36a6a6e16f919f230ac1a366fe6896bd","observation_id":"ffcc44b0-e9bf-4223-bdff-62fff7d86274","resolution":{"observed_at":"2026-05-19T08:32:11.627983Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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":"Wanless and David R","venue":null,"work_id":"75ac6eb9-f996-49be-9a0a-2c52bf5d4d82","year":2022},"citing_paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-19T08:30:41.230299Z"},"links":{"citing_paper":"/paper/2506.20317"},"observation_digest":"sha256:fba9387bdaccd57b3a55ed79f5acb7aa30d5ffd3597f19caed81b0aa633c9e0d","observation_id":"5bc5da66-543b-48b6-adce-598e22af5d6b","resolution":{"observed_at":"2026-05-19T08:32:13.167641Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.13527","last_updated":"2024-07-23T20:00:34Z","snapshot_observed_at":"2026-07-06T18:03:10.860369Z","submitted_at":"2024-04-21T04:44:34Z","title":"On the structure of EFX orientations on graphs","version":2},"cited_work":{"arxiv_id":"2404.13527","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.13527","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On the structure of envy-free orientations on graphs","venue":null,"work_id":"60b361dd-5a11-4e99-9a69-f20bebc41ecb","year":2024},"citing_paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-05-19T08:30:41.230299Z"},"links":{"cited_paper":"/paper/2404.13527","citing_paper":"/paper/2506.20317"},"observation_digest":"sha256:3d55e24ff43a63c5241eabe3b5b200a71018a46d4b4404c65af46546e17cd7a4","observation_id":"e55d4e85-06c7-4423-adc6-b5b568452e17","resolution":{"observed_at":"2026-05-19T08:32:11.657698Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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":"A complete landscape of EFX allocations on graphs: Goods, chores and mixed manna","venue":null,"work_id":"92d53da4-b017-4026-983f-aba903dd5116","year":2024},"citing_paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-05-19T08:30:41.230299Z"},"links":{"citing_paper":"/paper/2506.20317"},"observation_digest":"sha256:532dbf9fbc52fee8a38a7f377d8cb85f61453ab541a2d7747b56a4eb93780fcb","observation_id":"5f1668a5-0321-4038-a787-4c64131d4ff8","resolution":{"observed_at":"2026-05-19T08:32:13.162194Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","latest_version":2,"primary_category":"cs.GT","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs"},"reference_resolution":{"displayed":46,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":19,"verified_fuzzy":27},"total_outbound_references":46},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 46 of 46 outbound references and 2 inbound Pith citation observations for arXiv:2506.20317."}