{"as_of":"2026-08-16T13:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c066e53807844aad2bc2aeef1d0b6933ac8e91e76bddcfe4b4c3d80d312bcb96","coverage":[{"denominator":2,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T15:16:26.623956Z","state":"measured"},{"denominator":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T05:51:27.346968Z","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-14T05:51:27.389521Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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"}}],"links":{"evidence":"/evidence","html":"/paper/1908.01669/citation-record","integrity":"/paper/1908.01669/integrity","json":"/paper/1908.01669/citation-record.json","paper":"/paper/1908.01669"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2004.11469","last_updated":"2020-05-12T19:18:02Z","snapshot_observed_at":"2026-07-06T09:14:49.812776Z","submitted_at":"2020-04-23T21:39:12Z","title":"Jealousy-freeness and other common properties in Fair Division of Mixed Manna","version":3},"cited_work":{"arxiv_id":"2004.11469","doi":null,"metadata_source":"pith","pith_arxiv_id":"2004.11469","snapshot_observed_at":"2026-08-14T15:16:26.670308Z","title":"Jealousy-freeness and other common properties in Fair Division of Mixed Manna","venue":"cs.GT","work_id":"7530e154-2559-4a87-8695-bc22124ee003","year":2020},"citing_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},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T15:16:26.619236Z"},"links":{"cited_paper":"/paper/2004.11469","citing_paper":"/paper/1908.01669"},"observation_digest":"sha256:f8abe025e581df5a1442611cf1c6c1036adcf9a167162f45433d49bd656bd006","observation_id":"309832d5-ce38-43a0-ad30-719d4b9fc02e","resolution":{"observed_at":"2026-08-14T15:16:26.674408Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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":"1704.00222","last_updated":"2017-07-23T14:44:40Z","snapshot_observed_at":"2026-08-14T21:08:46.386763Z","submitted_at":"2017-04-01T20:00:35Z","title":"Fair Allocation of Indivisible Goods: Improvement and Generalization","version":3},"cited_work":{"arxiv_id":"1704.00222","doi":null,"metadata_source":"pith","pith_arxiv_id":"1704.00222","snapshot_observed_at":"2026-08-14T15:16:26.653377Z","title":"Fair Allocation of Indivisible Goods: Improvement and Generalization","venue":"cs.GT","work_id":"97a38a80-8d59-4773-acd1-99d35f58ef80","year":2017},"citing_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},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-14T15:16:26.623956Z"},"links":{"cited_paper":"/paper/1704.00222","citing_paper":"/paper/1908.01669"},"observation_digest":"sha256:a8975ed4be219e89924f67368cc05a7ec1ef46de7c04fe7a66885c06a8e40a91","observation_id":"1612ac15-69f8-4b36-bdbe-69c317e83f3a","resolution":{"observed_at":"2026-08-14T15:16:26.659428Z","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"}}],"paper":{"arxiv_id":"1908.01669","last_updated":"2022-04-01T13:52:18Z","latest_version":3,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-16T10:53:13.671070Z","submitted_at":"2019-08-05T14:57:25Z","title":"Efficient Fair Division with Minimal Sharing"},"reference_resolution":{"displayed":2,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":0,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":2},"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 2 of 2 outbound references and 1 inbound Pith citation observation for arXiv:1908.01669."}