{"as_of":"2026-08-07T11:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ddc717322fb80e77b707a6e5ed05631a4c3f0aef8ff0a7295641917b414e5d7d","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":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-07T06:34:17.273281+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T06:06:34.438472Z","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-07-09T18:56:27.278092Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.04577","last_updated":"2025-04-06T18:35:25Z","snapshot_observed_at":"2026-08-04T16:50:18.452646Z","submitted_at":"2025-04-06T18:35:25Z","title":"Minimum Cut Representability of Stable Matching Problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.04577","snapshot_observed_at":"2026-08-07T06:06:34.438472Z","title":"Yuri Faenza, Swati Gupta, and Xuan Zhang","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.06217","last_updated":"2025-06-06T16:24:29Z","snapshot_observed_at":"2026-08-07T05:56:07.536575Z","submitted_at":"2025-06-06T16:24:29Z","title":"Longer Lists Yield Better Matchings","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-07T06:06:34.438472Z"},"links":{"cited_paper":"/paper/2504.04577","citing_paper":"/paper/2506.06217"},"observation_digest":"sha256:f081ae0c223dd61d73de24ac2f527042f9fb7f8364454bbd0bb6ea5c83f2206d","observation_id":"b570f43e-5691-4eec-a399-e3573a6345fd","resolution":{"observed_at":"2026-08-07T06:06:34.438472Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.04577","last_updated":"2025-04-06T18:35:25Z","snapshot_observed_at":"2026-08-04T16:50:18.452646Z","submitted_at":"2025-04-06T18:35:25Z","title":"Minimum Cut Representability of Stable Matching Problems","version":1},"cited_work":{"arxiv_id":"2504.04577","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.04577","snapshot_observed_at":"2026-07-09T18:56:27.278092Z","title":"Minimum cut representability of stable matching problems","venue":"math.OC","work_id":"58e58542-539c-4935-b757-4f5f41f696dd","year":2025},"citing_paper":{"arxiv_id":"2604.27823","last_updated":"2026-04-30T13:08:40Z","snapshot_observed_at":"2026-08-02T18:16:56.977131Z","submitted_at":"2026-04-30T13:08:40Z","title":"Maximally Diverse Stable Matchings: Optimizing Arbitrary Institutional Objectives","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-05-07T07:53:06.822595Z"},"links":{"cited_paper":"/paper/2504.04577","citing_paper":"/paper/2604.27823"},"observation_digest":"sha256:5834fec758a4fa3084c5c48799ddf5627eb52aaeeab738aadf67e5a19f410596","observation_id":"bac72652-6d37-4ad1-9ae5-418931387d6a","resolution":{"observed_at":"2026-05-12T10:06:28.788240Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.04577","last_updated":"2025-04-06T18:35:25Z","snapshot_observed_at":"2026-08-04T16:50:18.452646Z","submitted_at":"2025-04-06T18:35:25Z","title":"Minimum Cut Representability of Stable Matching Problems","version":1},"cited_work":{"arxiv_id":"2504.04577","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.04577","snapshot_observed_at":"2026-07-09T18:56:27.278092Z","title":"Minimum cut representability of stable matching problems","venue":"math.OC","work_id":"58e58542-539c-4935-b757-4f5f41f696dd","year":2025},"citing_paper":{"arxiv_id":"2607.07160","last_updated":"2026-07-08T08:52:28Z","snapshot_observed_at":"2026-08-03T17:45:57.518714Z","submitted_at":"2026-07-08T08:52:28Z","title":"Stable Matchings with Minimum Utility Gap","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-09T18:46:52.649414Z"},"links":{"cited_paper":"/paper/2504.04577","citing_paper":"/paper/2607.07160"},"observation_digest":"sha256:ddda6d9007cac3a87638aed30d612cc3750ce65fb83e3773c26d7d09d8884b4e","observation_id":"ad9dbac1-0fff-464d-b85a-73431292cd0e","resolution":{"observed_at":"2026-07-09T18:56:27.279457Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2504.04577/citation-record","integrity":"/paper/2504.04577/integrity","json":"/paper/2504.04577/citation-record.json","paper":"/paper/2504.04577"},"outbound":[],"paper":{"arxiv_id":"2504.04577","last_updated":"2025-04-06T18:35:25Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-04T16:50:18.452646Z","submitted_at":"2025-04-06T18:35:25Z","title":"Minimum Cut Representability of 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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2504.04577."}