{"as_of":"2026-08-16T12:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a2967fe98048c9aa71f750db3c94327744a981976ed1284c77907af17d44a67a","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-15T18:04:23.109430Z","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-15T18:04:23.267800Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.01810","last_updated":"2024-11-04T05:28:53Z","snapshot_observed_at":"2026-08-12T22:08:35.696749Z","submitted_at":"2024-11-04T05:28:53Z","title":"A Polynomial-Time Algorithm for Fair and Efficient Allocation with a Fixed Number of Agents","version":1},"cited_work":{"arxiv_id":"2411.01810","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.01810","snapshot_observed_at":"2026-08-15T18:04:23.267800Z","title":"A Polynomial-Time Algorithm for Fair and Efficient Allocation with a Fixed Number of Agents","venue":"cs.GT","work_id":"dfe0299d-fea3-46ae-b343-59510ca4fc9e","year":2024},"citing_paper":{"arxiv_id":"2507.19461","last_updated":"2025-07-25T17:46:04Z","snapshot_observed_at":"2026-08-15T20:56:41.809466Z","submitted_at":"2025-07-25T17:46:04Z","title":"Existence of 2-EFX Allocations of Chores","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T18:04:23.109430Z"},"links":{"cited_paper":"/paper/2411.01810","citing_paper":"/paper/2507.19461"},"observation_digest":"sha256:a63b97c57ae5808e3312f5774749e8aac69a919b3f5d1f300ebc472bb7b6b834","observation_id":"596dece9-9760-43f4-a28d-2f2aba5900bf","resolution":{"observed_at":"2026-08-15T18:04:23.274458Z","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":{"arxiv_id":"2411.01810","last_updated":"2024-11-04T05:28:53Z","snapshot_observed_at":"2026-08-12T22:08:35.696749Z","submitted_at":"2024-11-04T05:28:53Z","title":"A Polynomial-Time Algorithm for Fair and Efficient Allocation with a Fixed Number of Agents","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.01810","snapshot_observed_at":"2026-07-15T14:07:48.791295Z","title":"A polynomial-time algorithm for fair and efficient allocation with a fixed number of agents.arXiv:2411.01810, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2603.05955","last_updated":"2026-06-26T07:00:30Z","snapshot_observed_at":"2026-08-16T02:04:14.292942Z","submitted_at":"2026-03-06T06:40:32Z","title":"Riemannian geometric classification and emergent phenomena of magnetic textures","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-15T14:07:48.791295Z"},"links":{"cited_paper":"/paper/2411.01810","citing_paper":"/paper/2603.05955"},"observation_digest":"sha256:e86a83168ab336408f0e09c516548b90ea6d48b6c987abf7d93ed405371f5167","observation_id":"e4bdcafb-8cfe-497d-9086-6b7a37954b36","resolution":{"observed_at":"2026-07-15T14:07:48.791295Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2411.01810/citation-record","integrity":"/paper/2411.01810/integrity","json":"/paper/2411.01810/citation-record.json","paper":"/paper/2411.01810"},"outbound":[],"paper":{"arxiv_id":"2411.01810","last_updated":"2024-11-04T05:28:53Z","latest_version":1,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-12T22:08:35.696749Z","submitted_at":"2024-11-04T05:28:53Z","title":"A Polynomial-Time Algorithm for Fair and Efficient Allocation with a Fixed Number of Agents"},"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:2411.01810."}