{"as_of":"2026-08-16T23:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:64ffb931b87868c972757bf46765390615627801218f391accb20e52766dc82b","coverage":[{"denominator":15,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T05:51:27.351902Z","state":"measured"},{"denominator":15,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":15,"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/1909.00740/citation-record","integrity":"/paper/1909.00740/integrity","json":"/paper/1909.00740/citation-record.json","paper":"/paper/1909.00740"},"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-14T05:51:27.634186Z","title":"Efficient re alloca- tion under additive and ordinal preferences","venue":null,"work_id":"ff6882c1-2a8e-460f-854c-905c83d2e2fa","year":2019},"citing_paper":{"arxiv_id":"1909.00740","last_updated":"2020-06-28T23:31:54Z","snapshot_observed_at":"2026-08-14T05:35:23.712730Z","submitted_at":"2019-09-02T14:41:15Z","title":"A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:27.277042Z"},"links":{"citing_paper":"/paper/1909.00740"},"observation_digest":"sha256:2add9f43ed147a1cdcfa63701de439ae4555a40c0e05d0d2f3c6b7c9b87ac0a6","observation_id":"8ca36ec0-4e8f-49cd-a131-8ee6a15595ff","resolution":{"observed_at":"2026-08-14T05:51:27.639229Z","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-14T05:51:27.619045Z","title":"Fair allocatio n of combinations of indivisible goods and chores","venue":null,"work_id":"9772432b-a3ac-4331-a096-4357cb39e847","year":2019},"citing_paper":{"arxiv_id":"1909.00740","last_updated":"2020-06-28T23:31:54Z","snapshot_observed_at":"2026-08-14T05:35:23.712730Z","submitted_at":"2019-09-02T14:41:15Z","title":"A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:27.283167Z"},"links":{"citing_paper":"/paper/1909.00740"},"observation_digest":"sha256:1b8d02721094a7307e27e17f84b9fb63e707df469e2b8676cdae282e55356942","observation_id":"bb9d4894-f368-4cd9-84ed-23db96136c91","resolution":{"observed_at":"2026-08-14T05:51:27.623818Z","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-14T05:51:27.604048Z","title":"Weighted maxmin fair share allocation of indivisible chores","venue":null,"work_id":"ab67880e-4c00-4b7b-ac57-b2afb8fba9f8","year":2019},"citing_paper":{"arxiv_id":"1909.00740","last_updated":"2020-06-28T23:31:54Z","snapshot_observed_at":"2026-08-14T05:35:23.712730Z","submitted_at":"2019-09-02T14:41:15Z","title":"A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:27.288400Z"},"links":{"citing_paper":"/paper/1909.00740"},"observation_digest":"sha256:c7925eadec276a2dfac674a0268d7d70cf6c7fcf7f137332b0814fec214cde26","observation_id":"c6e7d38d-c058-485f-82f2-fd4658858ba6","resolution":{"observed_at":"2026-08-14T05:51:27.608978Z","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":"1908.00161","last_updated":"2019-08-01T00:58:13Z","snapshot_observed_at":"2026-08-16T13:07:30.333530Z","submitted_at":"2019-08-01T00:58:13Z","title":"The Constrained Round Robin Algorithm for Fair and Efficient Allocation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.00161","snapshot_observed_at":"2026-08-14T05:51:27.293464Z","title":"The con- strained round robin algorithm for fair and efficient allocation","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"1909.00740","last_updated":"2020-06-28T23:31:54Z","snapshot_observed_at":"2026-08-14T05:35:23.712730Z","submitted_at":"2019-09-02T14:41:15Z","title":"A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:27.293464Z"},"links":{"cited_paper":"/paper/1908.00161","citing_paper":"/paper/1909.00740"},"observation_digest":"sha256:88a16617e3fbe2e19085ae3a0e7569a083b3fbf3d1ff5c8e2ec3bd91abe0f4b0","observation_id":"b16f7df3-9ef8-4020-8081-17b1cf77f84a","resolution":{"observed_at":"2026-08-14T05:51:27.293464Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1703.08150","last_updated":"2018-09-25T09:34:54Z","snapshot_observed_at":"2026-08-14T21:10:20.088838Z","submitted_at":"2017-03-23T17:27:51Z","title":"Competitive Equilibrium with Indivisible Goods and Generic Budgets","version":2},"cited_work":{"arxiv_id":"1703.08150","doi":null,"metadata_source":"pith","pith_arxiv_id":"1703.08150","snapshot_observed_at":"2026-08-14T05:51:27.432057Z","title":"Competitive Equilibrium with Indivisible Goods and Generic Budgets","venue":"cs.GT","work_id":"98d667eb-9698-49aa-a477-0eef5870ac44","year":2017},"citing_paper":{"arxiv_id":"1909.00740","last_updated":"2020-06-28T23:31:54Z","snapshot_observed_at":"2026-08-14T05:35:23.712730Z","submitted_at":"2019-09-02T14:41:15Z","title":"A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:27.299080Z"},"links":{"cited_paper":"/paper/1703.08150","citing_paper":"/paper/1909.00740"},"observation_digest":"sha256:0bc6a68681e3733dd65a5bdb1155b0fc7c04cb877d5bcf6dcf182777e019e757","observation_id":"c9b1fca9-1545-4618-8552-b17863dae747","resolution":{"observed_at":"2026-08-14T05:51:27.438097Z","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-14T05:51:27.589109Z","title":"K., 2019","venue":null,"work_id":"163ff49f-3f4d-4ade-8c67-259703f099da","year":2019},"citing_paper":{"arxiv_id":"1909.00740","last_updated":"2020-06-28T23:31:54Z","snapshot_observed_at":"2026-08-14T05:35:23.712730Z","submitted_at":"2019-09-02T14:41:15Z","title":"A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:27.304951Z"},"links":{"citing_paper":"/paper/1909.00740"},"observation_digest":"sha256:6b734cdfbbaa5ee4d9714859f5ae51d585419ec238f455a9a7cfc8c89aa54c06","observation_id":"7746e887-d631-4e48-af7b-df684e28cad5","resolution":{"observed_at":"2026-08-14T05:51:27.593869Z","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":"1907.01766","last_updated":"2023-07-15T00:06:09Z","snapshot_observed_at":"2026-08-16T12:12:43.526737Z","submitted_at":"2019-07-03T06:55:04Z","title":"Algorithms for Competitive Division of Chores","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.01766","snapshot_observed_at":"2026-08-14T05:51:27.310481Z","title":"Algorithms for competitive d ivision of chores","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"1909.00740","last_updated":"2020-06-28T23:31:54Z","snapshot_observed_at":"2026-08-14T05:35:23.712730Z","submitted_at":"2019-09-02T14:41:15Z","title":"A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:27.310481Z"},"links":{"cited_paper":"/paper/1907.01766","citing_paper":"/paper/1909.00740"},"observation_digest":"sha256:bb8d83538086bb277138ac3dfbaf99e314e1f5d32f814182e79387adb7d13468","observation_id":"bf9c7579-991a-481a-9e2f-8c9a73d27429","resolution":{"observed_at":"2026-08-14T05:51:27.310481Z","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-14T05:51:27.573134Z","title":"D., Shah, N ., Wang, J., 2016","venue":null,"work_id":"dba67551-90c7-4c52-8bba-36cfbaff3f7b","year":2016},"citing_paper":{"arxiv_id":"1909.00740","last_updated":"2020-06-28T23:31:54Z","snapshot_observed_at":"2026-08-14T05:35:23.712730Z","submitted_at":"2019-09-02T14:41:15Z","title":"A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:27.316000Z"},"links":{"citing_paper":"/paper/1909.00740"},"observation_digest":"sha256:4a42b71cf3c65dac12bba32ff02db4b0786d0a45a7f1c85247dc3617fd4f4758","observation_id":"481354fb-2544-4360-b578-d8e9af01680b","resolution":{"observed_at":"2026-08-14T05:51:27.578010Z","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-14T05:51:27.555864Z","title":"Fair public decision makin g","venue":null,"work_id":"ee879799-a1eb-45b3-9b6a-b0cfb022c9a6","year":2017},"citing_paper":{"arxiv_id":"1909.00740","last_updated":"2020-06-28T23:31:54Z","snapshot_observed_at":"2026-08-14T05:35:23.712730Z","submitted_at":"2019-09-02T14:41:15Z","title":"A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:27.320669Z"},"links":{"citing_paper":"/paper/1909.00740"},"observation_digest":"sha256:2cd2621496a4786c379280deccf04176096d09baddb77256dfdaa12fd3f56fbb","observation_id":"031b2a6b-15bf-4e5b-b0c7-b25c8e3f4f15","resolution":{"observed_at":"2026-08-14T05:51:27.561331Z","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-14T05:51:27.537857Z","title":"On the co mplexity of efficiency and envy-freeness in fair division of indivisible goods with additive preferences","venue":null,"work_id":"5b3ca4f0-9bad-480c-a809-c1871ccae885","year":2009},"citing_paper":{"arxiv_id":"1909.00740","last_updated":"2020-06-28T23:31:54Z","snapshot_observed_at":"2026-08-14T05:35:23.712730Z","submitted_at":"2019-09-02T14:41:15Z","title":"A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:27.325535Z"},"links":{"citing_paper":"/paper/1909.00740"},"observation_digest":"sha256:9db9055ea9d4fe5c0347f5b9449f82bd2b955f9e615b3f0c5cea20892a1215c9","observation_id":"89af9067-8c37-4d27-862b-2cd05fc96ec0","resolution":{"observed_at":"2026-08-14T05:51:27.543868Z","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-14T05:51:27.521567Z","title":"M., Seddighin, M., Seddighin, S., Yami, H., 2019","venue":null,"work_id":"c6f81dce-7905-4f12-8ad3-ac8101ff4f85","year":2019},"citing_paper":{"arxiv_id":"1909.00740","last_updated":"2020-06-28T23:31:54Z","snapshot_observed_at":"2026-08-14T05:35:23.712730Z","submitted_at":"2019-09-02T14:41:15Z","title":"A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:27.331183Z"},"links":{"citing_paper":"/paper/1909.00740"},"observation_digest":"sha256:e5b521ff907388b80ba30dcf2dd7fd40b349d25520b838d25dde167049786d5d","observation_id":"909e1153-827a-47e6-b01d-af85fa114724","resolution":{"observed_at":"2026-08-14T05:51:27.526869Z","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-14T05:51:27.504478Z","title":"Recent Advances in Fair Resource Allocation (ACM EC 2019 Tutorial)","venue":null,"work_id":"919e992a-bbc3-4925-bf50-0ccd1716b4e7","year":2019},"citing_paper":{"arxiv_id":"1909.00740","last_updated":"2020-06-28T23:31:54Z","snapshot_observed_at":"2026-08-14T05:35:23.712730Z","submitted_at":"2019-09-02T14:41:15Z","title":"A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:27.336345Z"},"links":{"citing_paper":"/paper/1909.00740"},"observation_digest":"sha256:4d2290f99a104337832e111a8d303745428b7fe85f2619f02f1cb47965dccb9b","observation_id":"4752a73c-ee28-4ef1-93da-b714690d71c8","resolution":{"observed_at":"2026-08-14T05:51:27.509902Z","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-14T05:51:27.487609Z","title":"Fair division in the age of internet","venue":null,"work_id":"4d769631-5631-410b-b293-e129a796502d","year":2019},"citing_paper":{"arxiv_id":"1909.00740","last_updated":"2020-06-28T23:31:54Z","snapshot_observed_at":"2026-08-14T05:35:23.712730Z","submitted_at":"2019-09-02T14:41:15Z","title":"A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:27.341423Z"},"links":{"citing_paper":"/paper/1909.00740"},"observation_digest":"sha256:473bd0bc296b59d12813849f3158acd21f7ecf5fa4b988f8f1a8419f90da04da","observation_id":"2d678181-9eff-44b7-b724-ce24586b931f","resolution":{"observed_at":"2026-08-14T05:51:27.493328Z","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":"1908.01669","last_updated":"2022-04-01T13:52:18Z","snapshot_observed_at":"2026-08-16T10:53:13.671070Z","submitted_at":"2019-08-05T14:57:25Z","title":"Efficient Fair Division with Minimal Sharing","version":3},"cited_work":{"arxiv_id":"1908.01669","doi":null,"metadata_source":"pith","pith_arxiv_id":"1908.01669","snapshot_observed_at":"2026-08-14T05:51:27.389521Z","title":"Efficient Fair Division with Minimal Sharing","venue":"cs.GT","work_id":"f1507619-d511-48b3-afb4-1c73ae0cc307","year":2019},"citing_paper":{"arxiv_id":"1909.00740","last_updated":"2020-06-28T23:31:54Z","snapshot_observed_at":"2026-08-14T05:35:23.712730Z","submitted_at":"2019-09-02T14:41:15Z","title":"A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:27.346968Z"},"links":{"cited_paper":"/paper/1908.01669","citing_paper":"/paper/1909.00740"},"observation_digest":"sha256:69f6f5773fa15fbb92d67a55119bbbea03ab4356b20acc340f338e0bfff725d1","observation_id":"c78c00fd-b6ce-4a58-b0e4-ffbb40b04074","resolution":{"observed_at":"2026-08-14T05:51:27.396823Z","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-14T05:51:27.471274Z","title":"R., 1976","venue":null,"work_id":"d711c0b5-cf36-4389-9777-ce1e057dc9d9","year":1976},"citing_paper":{"arxiv_id":"1909.00740","last_updated":"2020-06-28T23:31:54Z","snapshot_observed_at":"2026-08-14T05:35:23.712730Z","submitted_at":"2019-09-02T14:41:15Z","title":"A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:27.351902Z"},"links":{"citing_paper":"/paper/1909.00740"},"observation_digest":"sha256:fbcca561ee8ebab3b8cd75da7d9918c810cc582deedadc73d806c46cbd827260","observation_id":"655d3bae-1d1f-44d5-a32b-948a200ffbe2","resolution":{"observed_at":"2026-08-14T05:51:27.476393Z","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":"1909.00740","last_updated":"2020-06-28T23:31:54Z","latest_version":2,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-14T05:35:23.712730Z","submitted_at":"2019-09-02T14:41:15Z","title":"A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation"},"reference_resolution":{"displayed":15,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":2,"verified_fuzzy":11},"total_outbound_references":15},"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 15 of 15 outbound references and 0 inbound Pith citation observations for arXiv:1909.00740."}