{"as_of":"2026-08-08T23:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7bebdf1c8700cc84ca0cae75f5b5d2bec21e323fb0e140b9128b20c78e8f4609","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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-07-30T11:05:46.997482Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2502.02503","last_updated":"2025-02-09T20:41:48Z","snapshot_observed_at":"2026-07-06T20:31:03.484385Z","submitted_at":"2025-02-04T17:17:00Z","title":"Near-Feasible Solutions to Complex Stable Matching Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.02503","snapshot_observed_at":"2026-07-30T11:05:46.997482Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.27102","last_updated":"2026-07-29T16:28:03Z","snapshot_observed_at":"2026-08-06T14:26:18.341363Z","submitted_at":"2026-07-29T16:28:03Z","title":"Designing Pairwise-Stable Agent Seating Arrangements","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-30T11:05:46.997482Z"},"links":{"cited_paper":"/paper/2502.02503","citing_paper":"/paper/2607.27102"},"observation_digest":"sha256:3e03b95277045a3f3c943e3255b6f69956e1f9c2501a4c9e35d15c2328035f0e","observation_id":"3eaca1dc-6868-47f5-9677-02c68b0f624e","resolution":{"observed_at":"2026-07-30T11:05:46.997482Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2502.02503/citation-record","integrity":"/paper/2502.02503/integrity","json":"/paper/2502.02503/citation-record.json","paper":"/paper/2502.02503"},"outbound":[],"paper":{"arxiv_id":"2502.02503","last_updated":"2025-02-09T20:41:48Z","latest_version":2,"primary_category":"cs.GT","snapshot_observed_at":"2026-07-06T20:31:03.484385Z","submitted_at":"2025-02-04T17:17:00Z","title":"Near-Feasible Solutions to Complex Stable Matching Problems"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2502.02503."}