{"as_of":"2026-08-16T15:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ed4bc0b92912238821eb749b0e7832ca7c070a87184f4608f077dc57bf60ea38","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T05:51:27.310481Z","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-12T00:47:09.126435Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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":{"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":"1907.01766","doi":null,"metadata_source":"pith","pith_arxiv_id":"1907.01766","snapshot_observed_at":"2026-08-12T00:47:09.126435Z","title":"Algorithms for Competitive Division of Chores","venue":"cs.GT","work_id":"5460f94c-29f2-46ab-b0f0-537ab0174bf7","year":2019},"citing_paper":{"arxiv_id":"2608.10397","last_updated":"2026-08-11T02:45:35Z","snapshot_observed_at":"2026-08-16T13:23:48.491427Z","submitted_at":"2026-08-11T02:45:35Z","title":"To EFX OR to MMS, That is the Question","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-12T00:47:08.452993Z"},"links":{"cited_paper":"/paper/1907.01766","citing_paper":"/paper/2608.10397"},"observation_digest":"sha256:312fc7334a575f20aa5d52d40a206eeccef32d596edd4c1edb93fd4f2bd1f28f","observation_id":"19d20c6b-7479-4f98-84e6-59cd2f874790","resolution":{"observed_at":"2026-08-12T00:47:09.131009Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/1907.01766/citation-record","integrity":"/paper/1907.01766/integrity","json":"/paper/1907.01766/citation-record.json","paper":"/paper/1907.01766"},"outbound":[],"paper":{"arxiv_id":"1907.01766","last_updated":"2023-07-15T00:06:09Z","latest_version":2,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-16T12:12:43.526737Z","submitted_at":"2019-07-03T06:55:04Z","title":"Algorithms for Competitive Division of Chores"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1907.01766."}