{"as_of":"2026-08-16T14:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:01c70500fb72d31ee6012e09153682fcd5a27251965e8f37b72dc3bba43c947d","coverage":[{"denominator":47,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":47,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T18:00:27.019346Z","state":"measured"},{"denominator":47,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":47,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2412.08572/citation-record","integrity":"/paper/2412.08572/integrity","json":"/paper/2412.08572/citation-record.json","paper":"/paper/2412.08572"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:00:27.768861Z","title":"Approximation schemes for scheduling on parallel machines","venue":null,"work_id":"25830c94-5016-4cfe-9fbb-7108c5e453c7","year":1998},"citing_paper":{"arxiv_id":"2412.08572","last_updated":"2026-06-19T11:03:38Z","snapshot_observed_at":"2026-08-11T17:41:55.276905Z","submitted_at":"2024-12-11T17:41:02Z","title":"Proportionally Fair Makespan Approximation","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T18:00:26.804657Z"},"links":{"citing_paper":"/paper/2412.08572"},"observation_digest":"sha256:88dc45f2fffc94fb4dd75489cc94a8ec2e17d34586dc9189a88db314f4c02e77","observation_id":"16cb43d2-ff89-4068-855d-0c55f51fee7a","resolution":{"observed_at":"2026-08-11T18:00:27.773298Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:00:26.810039Z","title":"Fair division of indivisib le goods: Recent progress and open questions","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.08572","last_updated":"2026-06-19T11:03:38Z","snapshot_observed_at":"2026-08-11T17:41:55.276905Z","submitted_at":"2024-12-11T17:41:02Z","title":"Proportionally Fair Makespan Approximation","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T18:00:26.810039Z"},"links":{"citing_paper":"/paper/2412.08572"},"observation_digest":"sha256:46a7ec34504b001b12b27aeb74acbc5f853c3707f1cd7f102d2f2c72bd4d5a70","observation_id":"df2ba643-2857-4ba6-9bcd-20ce32fb7e61","resolution":{"observed_at":"2026-08-11T18:00:26.810039Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:00:27.743248Z","title":"A derivation of the money rawlsian s olution","venue":null,"work_id":"37089106-7795-4c7d-b400-47d751b9e7fb","year":1995},"citing_paper":{"arxiv_id":"2412.08572","last_updated":"2026-06-19T11:03:38Z","snapshot_observed_at":"2026-08-11T17:41:55.276905Z","submitted_at":"2024-12-11T17:41:02Z","title":"Proportionally Fair Makespan Approximation","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T18:00:26.814936Z"},"links":{"citing_paper":"/paper/2412.08572"},"observation_digest":"sha256:64ab46d6e55413fecde9575d080d13c6bdb62a64a7d365ba1a73933ae44e33c4","observation_id":"b25dde8b-0356-491c-b467-6ef9a80ecfed","resolution":{"observed_at":"2026-08-11T18:00:27.748251Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:00:27.728395Z","title":"Aslam, April Rasala, Clifford Stein, and Neal E","venue":null,"work_id":"d51ec00e-76cd-4ad8-b961-d51d938c15f5","year":1999},"citing_paper":{"arxiv_id":"2412.08572","last_updated":"2026-06-19T11:03:38Z","snapshot_observed_at":"2026-08-11T17:41:55.276905Z","submitted_at":"2024-12-11T17:41:02Z","title":"Proportionally Fair Makespan Approximation","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T18:00:26.820109Z"},"links":{"citing_paper":"/paper/2412.08572"},"observation_digest":"sha256:540d698a01ec8d1e93da3207e9a158abc47fce175e0ab8ab767089f643359330","observation_id":"9e82cee0-0b33-4f37-994c-3acf7997341a","resolution":{"observed_at":"2026-08-11T18:00:27.733194Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:00:27.712641Z","title":"Optim al bounds on the price of fairness for indivisible goods","venue":null,"work_id":"edd2cad6-4122-4752-acaa-2185c3c2a075","year":2020},"citing_paper":{"arxiv_id":"2412.08572","last_updated":"2026-06-19T11:03:38Z","snapshot_observed_at":"2026-08-11T17:41:55.276905Z","submitted_at":"2024-12-11T17:41:02Z","title":"Proportionally Fair Makespan Approximation","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T18:00:26.825106Z"},"links":{"citing_paper":"/paper/2412.08572"},"observation_digest":"sha256:8be7d17b8585d85b4a58f395739b272d8b17612b24217e101d0a91999b12c78c","observation_id":"e788e187-0997-4a25-8a80-a86c04cc4802","resolution":{"observed_at":"2026-08-11T18:00:27.718199Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:00:27.697526Z","title":"Achieving envy- freeness with limited subsidies under dichotomous valuati ons","venue":null,"work_id":"282d8130-4389-48d3-bdff-84caad7a15bf","year":2022},"citing_paper":{"arxiv_id":"2412.08572","last_updated":"2026-06-19T11:03:38Z","snapshot_observed_at":"2026-08-11T17:41:55.276905Z","submitted_at":"2024-12-11T17:41:02Z","title":"Proportionally Fair Makespan Approximation","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T18:00:26.830060Z"},"links":{"citing_paper":"/paper/2412.08572"},"observation_digest":"sha256:822d0673d0bd0b3da05ef0ed4817e57deec89db003cfc72fa10b0071752a3bd6","observation_id":"da6bf4a9-d16c-4a9d-a8ea-141195156084","resolution":{"observed_at":"2026-08-11T18:00:27.702560Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:00:27.681987Z","title":"The price of fairness for indivis- ible goods","venue":null,"work_id":"998328e9-b68a-4ac4-b8b8-a866aaad6a6e","year":2021},"citing_paper":{"arxiv_id":"2412.08572","last_updated":"2026-06-19T11:03:38Z","snapshot_observed_at":"2026-08-11T17:41:55.276905Z","submitted_at":"2024-12-11T17:41:02Z","title":"Proportionally Fair Makespan Approximation","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T18:00:26.835221Z"},"links":{"citing_paper":"/paper/2412.08572"},"observation_digest":"sha256:c5d2eb91fc84df40fdff35986bb5c09866e57ec47c7130e22966e2da4315e669","observation_id":"da0a61a8-b128-4d17-b056-b17ff35f2934","resolution":{"observed_at":"2026-08-11T18:00:27.687263Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:00:27.666050Z","title":"The price of fairness","venue":null,"work_id":"b9653581-6c6e-4b41-9ce8-09d3998b3320","year":2011},"citing_paper":{"arxiv_id":"2412.08572","last_updated":"2026-06-19T11:03:38Z","snapshot_observed_at":"2026-08-11T17:41:55.276905Z","submitted_at":"2024-12-11T17:41:02Z","title":"Proportionally Fair Makespan Approximation","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T18:00:26.839868Z"},"links":{"citing_paper":"/paper/2412.08572"},"observation_digest":"sha256:59cac7dd5fe96354110fe2c09e5e95e7cf956f85d63234a0a45486a6a8bf2f86","observation_id":"5b78708c-6c17-4a52-a4d4-9d99db460ff4","resolution":{"observed_at":"2026-08-11T18:00:27.671039Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:00:27.649803Z","title":"The price of envy-freeness in machine scheduling","venue":null,"work_id":"070172ee-79c0-4558-beec-a5cc5de639c1","year":2016},"citing_paper":{"arxiv_id":"2412.08572","last_updated":"2026-06-19T11:03:38Z","snapshot_observed_at":"2026-08-11T17:41:55.276905Z","submitted_at":"2024-12-11T17:41:02Z","title":"Proportionally Fair Makespan Approximation","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T18:00:26.844715Z"},"links":{"citing_paper":"/paper/2412.08572"},"observation_digest":"sha256:be5ced6b17dad4385c30f031f1a6bb6c448757a51688712f8b9a07e9b406da41","observation_id":"d9274603-97db-4553-8901-2d55394120a8","resolution":{"observed_at":"2026-08-11T18:00:27.654392Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:00:27.633865Z","title":"Narayan, Mash bat Suzuki, and Adrian Vetta","venue":null,"work_id":"2ddc1915-7111-4d25-9eea-9a254543898d","year":2020},"citing_paper":{"arxiv_id":"2412.08572","last_updated":"2026-06-19T11:03:38Z","snapshot_observed_at":"2026-08-11T17:41:55.276905Z","submitted_at":"2024-12-11T17:41:02Z","title":"Proportionally Fair Makespan Approximation","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T18:00:26.849383Z"},"links":{"citing_paper":"/paper/2412.08572"},"observation_digest":"sha256:9ac1e1435f5bb86af6eda52c6f28195a521f2e39b89c3ac553ba79ebd38d3ff3","observation_id":"6b0171ba-a750-49de-a4a6-60943b2055ee","resolution":{"observed_at":"2026-08-11T18:00:27.639188Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.14296","last_updated":"2025-05-31T17:44:18Z","snapshot_observed_at":"2026-08-13T15:35:00.259023Z","submitted_at":"2022-05-28T01:51:09Z","title":"Approximability Landscape of Welfare Maximization within Fair Allocations","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.14296","snapshot_observed_at":"2026-08-11T18:00:26.853567Z","title":"On the complexity of maximizing social welfare within fair allocations of indivisible good s","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.08572","last_updated":"2026-06-19T11:03:38Z","snapshot_observed_at":"2026-08-11T17:41:55.276905Z","submitted_at":"2024-12-11T17:41:02Z","title":"Proportionally Fair Makespan Approximation","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T18:00:26.853567Z"},"links":{"cited_paper":"/paper/2205.14296","citing_paper":"/paper/2412.08572"},"observation_digest":"sha256:0a40fa68ceae0b32da1baf5686761b1de6ca68591faf0a3464ba25dcbbf6aae3","observation_id":"189dfbe1-a389-4bb0-b7ec-5c4857a77964","resolution":{"observed_at":"2026-08-11T18:00:26.853567Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:00:27.618043Z","title":"The combinatorial assignment problem: Ap proximate competitive equilibrium from equal incomes","venue":null,"work_id":"34988a5e-e094-46a5-a0f1-1084e34a433a","year":2011},"citing_paper":{"arxiv_id":"2412.08572","last_updated":"2026-06-19T11:03:38Z","snapshot_observed_at":"2026-08-11T17:41:55.276905Z","submitted_at":"2024-12-11T17:41:02Z","title":"Proportionally Fair Makespan Approximation","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T18:00:26.858410Z"},"links":{"citing_paper":"/paper/2412.08572"},"observation_digest":"sha256:46b57bcc47d3bde9a0c7e5e548163e9caeb3a3150b9638f09b252f46c2170e68","observation_id":"e03ebd8c-bc73-4791-aea2-7effe3886005","resolution":{"observed_at":"2026-08-11T18:00:27.623335Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:00:27.603734Z","title":"Computin g envy-freeable allocations with limited subsi- dies","venue":null,"work_id":"0f9ef5ff-8017-4a6c-87e7-45d2887caac8","year":2021},"citing_paper":{"arxiv_id":"2412.08572","last_updated":"2026-06-19T11:03:38Z","snapshot_observed_at":"2026-08-11T17:41:55.276905Z","submitted_at":"2024-12-11T17:41:02Z","title":"Proportionally Fair Makespan Approximation","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T18:00:26.863200Z"},"links":{"citing_paper":"/paper/2412.08572"},"observation_digest":"sha256:194053e2069e21dcb06ec06761283e62263819a57d6983352b09ec7f2295afe3","observation_id":"3d74b3af-d632-43b1-9174-adafa1efa256","resolution":{"observed_at":"2026-08-11T18:00:27.608232Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:00:27.588712Z","title":"The efficiency of fair division","venue":null,"work_id":"8ee59f20-a9fe-4b16-8b49-102250332aeb","year":2012},"citing_paper":{"arxiv_id":"2412.08572","last_updated":"2026-06-19T11:03:38Z","snapshot_observed_at":"2026-08-11T17:41:55.276905Z","submitted_at":"2024-12-11T17:41:02Z","title":"Proportionally Fair Makespan Approximation","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T18:00:26.867546Z"},"links":{"citing_paper":"/paper/2412.08572"},"observation_digest":"sha256:509fe2725be14b0e4ce3546e4f6f2e70e5d2561da0e46108073d6ba5c403a34a","observation_id":"26dc3e21-e09f-4a16-9e06-76508dcccefb","resolution":{"observed_at":"2026-08-11T18:00:27.594218Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:00:27.571655Z","title":"Envy- freeness up to any item with high nash welfare: The virtue of donating items","venue":null,"work_id":"c2a6d534-fe5e-40c3-a3c1-7a0c32c3fb74","year":2019},"citing_paper":{"arxiv_id":"2412.08572","last_updated":"2026-06-19T11:03:38Z","snapshot_observed_at":"2026-08-11T17:41:55.276905Z","submitted_at":"2024-12-11T17:41:02Z","title":"Proportionally Fair Makespan Approximation","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T18:00:26.871558Z"},"links":{"citing_paper":"/paper/2412.08572"},"observation_digest":"sha256:d8e4044b5fdfe7ea7ad2ca703d68a6eb3587adb2f603a8162202ae6bcad2e2c8","observation_id":"50906343-75dd-4a59-b3ee-f745a1f8ccf9","resolution":{"observed_at":"2026-08-11T18:00:27.578536Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:00:27.556097Z","title":"The unreasonable fairness of maximum nash welfare","venue":null,"work_id":"b70cc754-55ff-4a04-bf9f-a18f01ee7d62","year":2019},"citing_paper":{"arxiv_id":"2412.08572","last_updated":"2026-06-19T11:03:38Z","snapshot_observed_at":"2026-08-11T17:41:55.276905Z","submitted_at":"2024-12-11T17:41:02Z","title":"Proportionally Fair Makespan Approximation","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T18:00:26.875493Z"},"links":{"citing_paper":"/paper/2412.08572"},"observation_digest":"sha256:c46ddeb90863628a8dbb62d3fa2550f42c45fb0427a2a710efae04ce43539018","observation_id":"98b32bb8-91ce-4aed-b607-daad32e82673","resolution":{"observed_at":"2026-08-11T18:00:27.561367Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:00:27.541001Z","title":"Egalitarian price of fairness for indivisible goods","venue":null,"work_id":"ce5bcc7e-6dfe-43d2-8872-f21478116aca","year":2023},"citing_paper":{"arxiv_id":"2412.08572","last_updated":"2026-06-19T11:03:38Z","snapshot_observed_at":"2026-08-11T17:41:55.276905Z","submitted_at":"2024-12-11T17:41:02Z","title":"Proportionally Fair Makespan Approximation","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T18:00:26.879392Z"},"links":{"citing_paper":"/paper/2412.08572"},"observation_digest":"sha256:90bcbf3543ef681063130480cc86b8e1c84bb07a536a7ad3e470cfe6241df6c1","observation_id":"b6eebdd9-bbb2-4685-8889-ef9368ce155f","resolution":{"observed_at":"2026-08-11T18:00:27.546076Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:00:27.525462Z","title":"E fx exists for three agents","venue":null,"work_id":"7cef52ba-170e-46de-8e9c-174756d87dd3","year":2024},"citing_paper":{"arxiv_id":"2412.08572","last_updated":"2026-06-19T11:03:38Z","snapshot_observed_at":"2026-08-11T17:41:55.276905Z","submitted_at":"2024-12-11T17:41:02Z","title":"Proportionally Fair Makespan Approximation","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T18:00:26.884105Z"},"links":{"citing_paper":"/paper/2412.08572"},"observation_digest":"sha256:6f0941288b2062b2abefb783ea1eb00a3965018f9d5d2cfdf809469177c1c794","observation_id":"0fc1ff90-284f-4db9-8ca8-a7f1f058e23e","resolution":{"observed_at":"2026-08-11T18:00:27.530765Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:00:27.509698Z","title":"A lower bound for scheduling mecha- nisms","venue":null,"work_id":"a1c5b939-c4f1-4163-ae89-225c66dde7f9","year":2007},"citing_paper":{"arxiv_id":"2412.08572","last_updated":"2026-06-19T11:03:38Z","snapshot_observed_at":"2026-08-11T17:41:55.276905Z","submitted_at":"2024-12-11T17:41:02Z","title":"Proportionally Fair Makespan Approximation","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T18:00:26.888886Z"},"links":{"citing_paper":"/paper/2412.08572"},"observation_digest":"sha256:6af19a5a030c5ea0ec67e49c8d2e5e0f9a281b2fb390bcb2b27d3cd762a79c97","observation_id":"ab31dd4c-5870-49ce-b412-c56fc8056825","resolution":{"observed_at":"2026-08-11T18:00:27.514240Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:00:27.493025Z","title":"On the nisan-ronen conjecture","venue":null,"work_id":"212698d9-e5bd-4e23-a29a-4ea2c2b67535","year":2021},"citing_paper":{"arxiv_id":"2412.08572","last_updated":"2026-06-19T11:03:38Z","snapshot_observed_at":"2026-08-11T17:41:55.276905Z","submitted_at":"2024-12-11T17:41:02Z","title":"Proportionally Fair Makespan Approximation","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T18:00:26.893790Z"},"links":{"citing_paper":"/paper/2412.08572"},"observation_digest":"sha256:7ca32f1c9f7ecd5330d014f3b6a3a7d6c6eccaf98f75b547c8fde612db2d6bb9","observation_id":"4ab2b56f-9e81-43f5-8347-4e94234b36e9","resolution":{"observed_at":"2026-08-11T18:00:27.498073Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:00:27.475022Z","title":"A proof of the Nisan-Ronen con- jecture","venue":null,"work_id":"8e72041e-d4d2-4770-b643-c92926a26fb4","year":2023},"citing_paper":{"arxiv_id":"2412.08572","last_updated":"2026-06-19T11:03:38Z","snapshot_observed_at":"2026-08-11T17:41:55.276905Z","submitted_at":"2024-12-11T17:41:02Z","title":"Proportionally Fair Makespan Approximation","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T18:00:26.897896Z"},"links":{"citing_paper":"/paper/2412.08572"},"observation_digest":"sha256:c6af6e903f1b2229eeccd1c731b0405f73fa67b2aeff64e469e9dda011690c86","observation_id":"ca2217d5-bc92-4566-86dd-6f6ba5b2f5bd","resolution":{"observed_at":"2026-08-11T18:00:27.480067Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:00:27.458596Z","title":"An application of bin-packing to multiprocessor scheduling","venue":null,"work_id":"bc29187a-a920-4d39-9560-aaeb53dbb57c","year":1978},"citing_paper":{"arxiv_id":"2412.08572","last_updated":"2026-06-19T11:03:38Z","snapshot_observed_at":"2026-08-11T17:41:55.276905Z","submitted_at":"2024-12-11T17:41:02Z","title":"Proportionally Fair Makespan Approximation","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T18:00:26.902199Z"},"links":{"citing_paper":"/paper/2412.08572"},"observation_digest":"sha256:e0628dfcea5f712b4f239085699eeed77ba463d35ba6ee83ef23a14d07ecc2b5","observation_id":"216d2f08-a50b-4a35-99ef-c8cff8af0e56","resolution":{"observed_at":"2026-08-11T18:00:27.464232Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:00:27.443029Z","title":"Envy-free makespan approximation","venue":null,"work_id":"eb1252ab-40ba-4043-b9e8-db5fd4e328c7","year":2010},"citing_paper":{"arxiv_id":"2412.08572","last_updated":"2026-06-19T11:03:38Z","snapshot_observed_at":"2026-08-11T17:41:55.276905Z","submitted_at":"2024-12-11T17:41:02Z","title":"Proportionally Fair Makespan Approximation","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T18:00:26.906597Z"},"links":{"citing_paper":"/paper/2412.08572"},"observation_digest":"sha256:81c0269caf6a6186f7536298efcd9555816432b2fa9bc883cfab95dc3322ee44","observation_id":"dd8ff53b-1744-4854-9a24-926eb3ff6466","resolution":{"observed_at":"2026-08-11T18:00:27.448193Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:00:27.428093Z","title":"proportional chore-cut ting","venue":null,"work_id":"00270167-2f07-4ac4-9d64-4dc3da864721","year":2024},"citing_paper":{"arxiv_id":"2412.08572","last_updated":"2026-06-19T11:03:38Z","snapshot_observed_at":"2026-08-11T17:41:55.276905Z","submitted_at":"2024-12-11T17:41:02Z","title":"Proportionally Fair Makespan Approximation","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T18:00:26.910780Z"},"links":{"citing_paper":"/paper/2412.08572"},"observation_digest":"sha256:97763754d9a9eafdb9a05fccbc28d6fd302348c469b1acf0d3dea60eb405d8dd","observation_id":"cdf7a915-5d2f-4d2e-9530-f02443762384","resolution":{"observed_at":"2026-08-11T18:00:27.432963Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.04362","last_updated":"2020-11-15T08:35:28Z","snapshot_observed_at":"2026-07-06T09:36:39.909465Z","submitted_at":"2020-07-08T18:41:16Z","title":"Improved Lower Bounds for Truthful Scheduling","version":2},"cited_work":{"arxiv_id":"2007.04362","doi":null,"metadata_source":"pith","pith_arxiv_id":"2007.04362","snapshot_observed_at":"2026-08-11T18:00:27.058538Z","title":"Improved Lower Bounds for Truthful Scheduling","venue":"cs.GT","work_id":"51ce728a-b5ff-42af-9f74-183089ccaf9b","year":2020},"citing_paper":{"arxiv_id":"2412.08572","last_updated":"2026-06-19T11:03:38Z","snapshot_observed_at":"2026-08-11T17:41:55.276905Z","submitted_at":"2024-12-11T17:41:02Z","title":"Proportionally Fair Makespan Approximation","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T18:00:26.915168Z"},"links":{"cited_paper":"/paper/2007.04362","citing_paper":"/paper/2412.08572"},"observation_digest":"sha256:e538a1dad013e306bd3fac5b2a124ad4d876d48215afb187d72eca67856e0f05","observation_id":"bec0b281-0fd6-4455-8f55-d42a671ef068","resolution":{"observed_at":"2026-08-11T18:00:27.065658Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:00:27.413789Z","title":"Approximation schemes for scheduling on uniformly related and identical parallel machines","venue":null,"work_id":"3823c444-27ac-40f1-bfc1-8631e76030da","year":2004},"citing_paper":{"arxiv_id":"2412.08572","last_updated":"2026-06-19T11:03:38Z","snapshot_observed_at":"2026-08-11T17:41:55.276905Z","submitted_at":"2024-12-11T17:41:02Z","title":"Proportionally Fair Makespan Approximation","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T18:00:26.919812Z"},"links":{"citing_paper":"/paper/2412.08572"},"observation_digest":"sha256:6aec1c1fd0b18eae8768d707c5967b1051395e5ab4970d05588d1fdb2bd0aa5f","observation_id":"1f8fe697-b320-42e5-8347-17bd53136ab4","resolution":{"observed_at":"2026-08-11T18:00:27.418019Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:00:27.400194Z","title":"On the c omplexity of chore division","venue":null,"work_id":"be8b3204-4125-491e-ac53-3156e2cf04e4","year":2018},"citing_paper":{"arxiv_id":"2412.08572","last_updated":"2026-06-19T11:03:38Z","snapshot_observed_at":"2026-08-11T17:41:55.276905Z","submitted_at":"2024-12-11T17:41:02Z","title":"Proportionally Fair Makespan Approximation","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T18:00:26.924159Z"},"links":{"citing_paper":"/paper/2412.08572"},"observation_digest":"sha256:adad50fccb35b85276bedbcea02258bed78142080e04bbb37c3144c936fe6448","observation_id":"5f09d894-d2b7-441f-b746-24ab309ae969","resolution":{"observed_at":"2026-08-11T18:00:27.404373Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:00:27.385510Z","title":"On op timal tradeoffs between EFX and nash welfare","venue":null,"work_id":"9b07cc6e-a025-46f3-ac0f-c45a3e942e65","year":2024},"citing_paper":{"arxiv_id":"2412.08572","last_updated":"2026-06-19T11:03:38Z","snapshot_observed_at":"2026-08-11T17:41:55.276905Z","submitted_at":"2024-12-11T17:41:02Z","title":"Proportionally Fair Makespan Approximation","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T18:00:26.929330Z"},"links":{"citing_paper":"/paper/2412.08572"},"observation_digest":"sha256:7a5ec890c36083126f3cad34815f3cddb2c907c76caaadafb91dcca82cb5c092","observation_id":"817376f9-c1c6-4b49-9af0-4a2002713506","resolution":{"observed_at":"2026-08-11T18:00:27.390342Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:00:27.370260Z","title":"Tight lower bounds on envy-f ree makespan approximation","venue":null,"work_id":"add62a0e-fbd8-431c-a631-01546e93c041","year":2012},"citing_paper":{"arxiv_id":"2412.08572","last_updated":"2026-06-19T11:03:38Z","snapshot_observed_at":"2026-08-11T17:41:55.276905Z","submitted_at":"2024-12-11T17:41:02Z","title":"Proportionally Fair Makespan Approximation","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T18:00:26.933832Z"},"links":{"citing_paper":"/paper/2412.08572"},"observation_digest":"sha256:e67f628a0b6fac4c48a57d0d34ab96b12c3e16a89c3c1c490d2d1a04d3770678","observation_id":"d9a314ca-c6d3-446a-b156-05798ebbe753","resolution":{"observed_at":"2026-08-11T18:00:27.375110Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:00:27.354856Z","title":null,"venue":null,"work_id":"821c1549-ce54-4d17-8277-7b09ab351a35","year":1967},"citing_paper":{"arxiv_id":"2412.08572","last_updated":"2026-06-19T11:03:38Z","snapshot_observed_at":"2026-08-11T17:41:55.276905Z","submitted_at":"2024-12-11T17:41:02Z","title":"Proportionally Fair Makespan Approximation","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T18:00:26.939391Z"},"links":{"citing_paper":"/paper/2412.08572"},"observation_digest":"sha256:7f2c4679ef7f520b463399a26238218b3563b0992c060f681a3b35180ac615e7","observation_id":"395b6cde-4476-4169-8065-71f2c6f5c7d1","resolution":{"observed_at":"2026-08-11T18:00:27.359955Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:00:27.339843Z","title":"Bounds for certain multiprocessing an omalies","venue":null,"work_id":"151c8886-4cab-4174-862f-2016ab363467","year":1966},"citing_paper":{"arxiv_id":"2412.08572","last_updated":"2026-06-19T11:03:38Z","snapshot_observed_at":"2026-08-11T17:41:55.276905Z","submitted_at":"2024-12-11T17:41:02Z","title":"Proportionally Fair Makespan Approximation","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T18:00:26.943989Z"},"links":{"citing_paper":"/paper/2412.08572"},"observation_digest":"sha256:dfe78a408fae3f8276e9a9e0b8bfec135b3f882150ca918c86e2f3ecdf1af2cf","observation_id":"db4094e1-3aad-4ad2-836c-576b1ce1ab36","resolution":{"observed_at":"2026-08-11T18:00:27.344722Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:00:27.324647Z","title":"Fair division with subs idy","venue":null,"work_id":"d16393d2-44f0-4284-a312-6c6476ed956e","year":2019},"citing_paper":{"arxiv_id":"2412.08572","last_updated":"2026-06-19T11:03:38Z","snapshot_observed_at":"2026-08-11T17:41:55.276905Z","submitted_at":"2024-12-11T17:41:02Z","title":"Proportionally Fair Makespan Approximation","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-11T18:00:26.948849Z"},"links":{"citing_paper":"/paper/2412.08572"},"observation_digest":"sha256:ce3b6fe8dd661747039ff47fa0146015335f21432fa7aa87d2abbe6f890c5808","observation_id":"278d3e14-89e8-45b7-bc0e-7b1f3c43b25a","resolution":{"observed_at":"2026-08-11T18:00:27.329613Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:00:27.308850Z","title":"Multi-dimensional envy-free scheduling mechanisms","venue":null,"work_id":"75d1976b-1144-4fb9-ad9c-2466b74ec377","year":2008},"citing_paper":{"arxiv_id":"2412.08572","last_updated":"2026-06-19T11:03:38Z","snapshot_observed_at":"2026-08-11T17:41:55.276905Z","submitted_at":"2024-12-11T17:41:02Z","title":"Proportionally Fair Makespan Approximation","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-11T18:00:26.953409Z"},"links":{"citing_paper":"/paper/2412.08572"},"observation_digest":"sha256:ee133fbeea26676614d0f76a7f53f17c3f0b91fdfb0c297baccc731d745c8c5c","observation_id":"5601a750-aec4-4c4e-a50c-18ed33fce4a0","resolution":{"observed_at":"2026-08-11T18:00:27.314251Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:00:27.292267Z","title":"Mertzios, Hend rik Molter, Rolf Niedermeier, and Dvir Shab- tay","venue":null,"work_id":"d6940d9e-7365-4905-8df2-6b008c5adcc7","year":2023},"citing_paper":{"arxiv_id":"2412.08572","last_updated":"2026-06-19T11:03:38Z","snapshot_observed_at":"2026-08-11T17:41:55.276905Z","submitted_at":"2024-12-11T17:41:02Z","title":"Proportionally Fair Makespan Approximation","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-11T18:00:26.958402Z"},"links":{"citing_paper":"/paper/2412.08572"},"observation_digest":"sha256:1f0cba41e451364fc8e117340348ae1a8f11083f40d5310bc8b159ed4c9190e4","observation_id":"f8c1ed55-e14d-49ef-9ae5-4e3d15658c42","resolution":{"observed_at":"2026-08-11T18:00:27.296769Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:00:27.276635Z","title":"Exact and approximate algorithms for scheduling nonidentical proces- sors","venue":null,"work_id":"b6a65a18-3e2b-40bf-a7a6-3c39112153ef","year":1976},"citing_paper":{"arxiv_id":"2412.08572","last_updated":"2026-06-19T11:03:38Z","snapshot_observed_at":"2026-08-11T17:41:55.276905Z","submitted_at":"2024-12-11T17:41:02Z","title":"Proportionally Fair Makespan Approximation","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-11T18:00:26.963007Z"},"links":{"citing_paper":"/paper/2412.08572"},"observation_digest":"sha256:c8c46727e9e7c317253ffeae9abd53d464fb3a7d73ee54f393fafd717d8b0c06","observation_id":"bf368e06-15a9-4f15-bdec-d89d06ea570b","resolution":{"observed_at":"2026-08-11T18:00:27.281724Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:00:27.260982Z","title":"A lower bound of 1+phi for truthful scheduling mechanisms","venue":null,"work_id":"e4b67276-20ef-4a61-9718-6e098fcdefa3","year":2007},"citing_paper":{"arxiv_id":"2412.08572","last_updated":"2026-06-19T11:03:38Z","snapshot_observed_at":"2026-08-11T17:41:55.276905Z","submitted_at":"2024-12-11T17:41:02Z","title":"Proportionally Fair Makespan Approximation","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-11T18:00:26.967906Z"},"links":{"citing_paper":"/paper/2412.08572"},"observation_digest":"sha256:c5e88d743b86d7cee63196820773d45ffd7e665f560d4b222ef0dc27b10d6d65","observation_id":"8193a8a2-414c-4488-8b5b-aee0a060cd4d","resolution":{"observed_at":"2026-08-11T18:00:27.266158Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:00:27.243759Z","title":"Appro ximation algorithms for scheduling unre- lated parallel machines","venue":null,"work_id":"6ccb2b3f-5af4-4bc9-8d48-79df99c2834b","year":1990},"citing_paper":{"arxiv_id":"2412.08572","last_updated":"2026-06-19T11:03:38Z","snapshot_observed_at":"2026-08-11T17:41:55.276905Z","submitted_at":"2024-12-11T17:41:02Z","title":"Proportionally Fair Makespan Approximation","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-11T18:00:26.972544Z"},"links":{"citing_paper":"/paper/2412.08572"},"observation_digest":"sha256:c1e78f019e094a6d69cdf06ce342bd8986f8f3a77e553fcf9898325e1b6c0b5e","observation_id":"ca42f303-f43e-4ae6-b25c-978a0ca6f33a","resolution":{"observed_at":"2026-08-11T18:00:27.250016Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:00:27.227988Z","title":"A complete landscape for the price of envy-freeness","venue":null,"work_id":"97608f90-66e1-444f-94ec-d086f7c16520","year":2024},"citing_paper":{"arxiv_id":"2412.08572","last_updated":"2026-06-19T11:03:38Z","snapshot_observed_at":"2026-08-11T17:41:55.276905Z","submitted_at":"2024-12-11T17:41:02Z","title":"Proportionally Fair Makespan Approximation","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-11T18:00:26.977068Z"},"links":{"citing_paper":"/paper/2412.08572"},"observation_digest":"sha256:bc0f13161ad53e9f3f31d22c3f88a845a6fc9f648a6d00a5f9dd45c0727fcd30","observation_id":"8ba0c69b-525b-4b12-8abd-c6961d79dbed","resolution":{"observed_at":"2026-08-11T18:00:27.233053Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:00:26.981573Z","title":"Mixed fair division: A survey","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.08572","last_updated":"2026-06-19T11:03:38Z","snapshot_observed_at":"2026-08-11T17:41:55.276905Z","submitted_at":"2024-12-11T17:41:02Z","title":"Proportionally Fair Makespan Approximation","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-11T18:00:26.981573Z"},"links":{"citing_paper":"/paper/2412.08572"},"observation_digest":"sha256:37b3908e8bd03435297799b6e5f727640cfce1535b5170a93ad04629bc564e98","observation_id":"8239a25c-6550-4f21-a333-05817246253f","resolution":{"observed_at":"2026-08-11T18:00:26.981573Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:00:27.200688Z","title":"On the fair allocation of indivisible goo ds","venue":null,"work_id":"98e21b96-ea3f-471b-9a23-8bc2d5448c68","year":1987},"citing_paper":{"arxiv_id":"2412.08572","last_updated":"2026-06-19T11:03:38Z","snapshot_observed_at":"2026-08-11T17:41:55.276905Z","submitted_at":"2024-12-11T17:41:02Z","title":"Proportionally Fair Makespan Approximation","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-11T18:00:26.987165Z"},"links":{"citing_paper":"/paper/2412.08572"},"observation_digest":"sha256:226964fa67b559f3572ccfb5b9d4b4adf4499a967038c4cbb9c180c13589f1b1","observation_id":"ddf66cc6-cafb-4ed6-9433-ca0e189a0ed3","resolution":{"observed_at":"2026-08-11T18:00:27.205511Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:00:27.184190Z","title":"Algorithmic mechanism desig n","venue":null,"work_id":"4bcf49e3-8e83-4fde-9ff4-b2771890253f","year":1999},"citing_paper":{"arxiv_id":"2412.08572","last_updated":"2026-06-19T11:03:38Z","snapshot_observed_at":"2026-08-11T17:41:55.276905Z","submitted_at":"2024-12-11T17:41:02Z","title":"Proportionally Fair Makespan Approximation","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-11T18:00:26.991937Z"},"links":{"citing_paper":"/paper/2412.08572"},"observation_digest":"sha256:71c9e2ae5ac6289822f8619ba49708ee1ff5ac8806980ac1871db7fb3a151bc3","observation_id":"3bd79d3d-1e92-4911-8e85-f1930ad23785","resolution":{"observed_at":"2026-08-11T18:00:27.189973Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:00:27.167270Z","title":"Existence theorems, lower bounds and algorithms for scheduling to meet two objectives","venue":null,"work_id":"add9d635-d040-470d-9824-278e7423f3e6","year":2002},"citing_paper":{"arxiv_id":"2412.08572","last_updated":"2026-06-19T11:03:38Z","snapshot_observed_at":"2026-08-11T17:41:55.276905Z","submitted_at":"2024-12-11T17:41:02Z","title":"Proportionally Fair Makespan Approximation","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-11T18:00:26.996204Z"},"links":{"citing_paper":"/paper/2412.08572"},"observation_digest":"sha256:af2ceea75b72acea688bc2b03d351970d8aebc0d7b732cd0a0291cd66077eb61","observation_id":"65469a6d-8116-4964-84dd-d727305924b5","resolution":{"observed_at":"2026-08-11T18:00:27.173500Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:00:27.151708Z","title":"Algorithms for scheduling independent tasks","venue":null,"work_id":"29a2ec25-f73a-4390-a46b-7686beb92cfd","year":1976},"citing_paper":{"arxiv_id":"2412.08572","last_updated":"2026-06-19T11:03:38Z","snapshot_observed_at":"2026-08-11T17:41:55.276905Z","submitted_at":"2024-12-11T17:41:02Z","title":"Proportionally Fair Makespan Approximation","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-11T18:00:27.000608Z"},"links":{"citing_paper":"/paper/2412.08572"},"observation_digest":"sha256:9af19ce92756768d4387007280e03456c60afdfd8325c3461363db4c0e98c2a3","observation_id":"d8c01083-5792-4cc1-bdc6-0b7bbb589261","resolution":{"observed_at":"2026-08-11T18:00:27.155884Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:00:27.136914Z","title":"On the existence of schedul es that are near-optimal for both makespan and total weighted completion time","venue":null,"work_id":"2d16a4df-8142-427d-ba1b-ef533fd359bc","year":1997},"citing_paper":{"arxiv_id":"2412.08572","last_updated":"2026-06-19T11:03:38Z","snapshot_observed_at":"2026-08-11T17:41:55.276905Z","submitted_at":"2024-12-11T17:41:02Z","title":"Proportionally Fair Makespan Approximation","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-11T18:00:27.005096Z"},"links":{"citing_paper":"/paper/2412.08572"},"observation_digest":"sha256:73c44344e50c8b1327cd34c9b2488d04058ebc56e07f02402bc91298ccc82205","observation_id":"39353e89-a42f-4883-bd0a-f296b42df674","resolution":{"observed_at":"2026-08-11T18:00:27.141557Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:00:27.009424Z","title":"The problem of fair division","venue":null,"work_id":null,"year":1948},"citing_paper":{"arxiv_id":"2412.08572","last_updated":"2026-06-19T11:03:38Z","snapshot_observed_at":"2026-08-11T17:41:55.276905Z","submitted_at":"2024-12-11T17:41:02Z","title":"Proportionally Fair Makespan Approximation","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-11T18:00:27.009424Z"},"links":{"citing_paper":"/paper/2412.08572"},"observation_digest":"sha256:c716abc7a1a08870620d5d59b9670cc828c4ea5a7acfcaaf3a302407046230a8","observation_id":"3ca386a8-97ae-4de7-90e2-53ee2e0bf9d1","resolution":{"observed_at":"2026-08-11T18:00:27.009424Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:00:27.110653Z","title":"One quarter e ach (on average) ensures proportionality","venue":null,"work_id":"c99a409d-1037-4917-99d7-f7716faf24a1","year":2023},"citing_paper":{"arxiv_id":"2412.08572","last_updated":"2026-06-19T11:03:38Z","snapshot_observed_at":"2026-08-11T17:41:55.276905Z","submitted_at":"2024-12-11T17:41:02Z","title":"Proportionally Fair Makespan Approximation","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-11T18:00:27.014804Z"},"links":{"citing_paper":"/paper/2412.08572"},"observation_digest":"sha256:c089704e92ec5e70fbf89f7c20dfcf7d3224cb906491c0aee4d49b1cd8b6b5f3","observation_id":"8a915702-5232-49bf-89cd-56fba79a7a51","resolution":{"observed_at":"2026-08-11T18:00:27.115559Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:00:27.094199Z","title":"On the exact upper bound for the multifit proce ssor scheduling algorithm","venue":null,"work_id":"40ab1e0a-ba63-4706-b62b-e9f4b1751b02","year":1990},"citing_paper":{"arxiv_id":"2412.08572","last_updated":"2026-06-19T11:03:38Z","snapshot_observed_at":"2026-08-11T17:41:55.276905Z","submitted_at":"2024-12-11T17:41:02Z","title":"Proportionally Fair Makespan Approximation","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-11T18:00:27.019346Z"},"links":{"citing_paper":"/paper/2412.08572"},"observation_digest":"sha256:4735cef87de5163c23aa10eb5fbec0b340bc74ff8dd4ba3f30b91f4b82e39232","observation_id":"f7a94efe-8b28-4085-812c-74a6d073504c","resolution":{"observed_at":"2026-08-11T18:00:27.099868Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.08572","last_updated":"2026-06-19T11:03:38Z","latest_version":2,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-11T17:41:55.276905Z","submitted_at":"2024-12-11T17:41:02Z","title":"Proportionally Fair Makespan Approximation"},"reference_resolution":{"displayed":47,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":1,"verified_fuzzy":41},"total_outbound_references":47},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 47 of 47 outbound references and 0 inbound Pith citation observations for arXiv:2412.08572."}