{"as_of":"2026-08-18T00:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d4f147293eae7c0e41f725e90b0d35c7c6613c36ae8fb9c838ff3648bdd25696","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T04:18:57.047937Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-06-30T07:34:21.520601Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2108.00597","last_updated":"2023-09-17T13:29:55Z","snapshot_observed_at":"2026-08-16T18:05:58.537772Z","submitted_at":"2021-08-02T02:13:21Z","title":"Exact Pareto Optimal Search for Multi-Task Learning and Multi-Criteria Decision-Making","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.00597","snapshot_observed_at":"2026-08-10T18:53:50.343300Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.10945","last_updated":"2025-08-06T06:47:04Z","snapshot_observed_at":"2026-08-15T00:46:03.529876Z","submitted_at":"2025-01-19T04:56:55Z","title":"Gradient-Based Multi-Objective Deep Learning: Algorithms, Theories, Applications, and Beyond","version":3},"reference_index":124,"source":"pdf_text","source_observed_at":"2026-08-10T18:53:50.343300Z"},"links":{"cited_paper":"/paper/2108.00597","citing_paper":"/paper/2501.10945"},"observation_digest":"sha256:ccfb4871710c3eb7d0f38ae71a8a7adde22b89fac751f173012eba10460a20a6","observation_id":"340ec0fb-c3cc-4564-961d-7b356a69993d","resolution":{"observed_at":"2026-08-10T18:53:50.343300Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2108.00597","last_updated":"2023-09-17T13:29:55Z","snapshot_observed_at":"2026-08-16T18:05:58.537772Z","submitted_at":"2021-08-02T02:13:21Z","title":"Exact Pareto Optimal Search for Multi-Task Learning and Multi-Criteria Decision-Making","version":2},"cited_work":{"arxiv_id":"2108.00597","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2108.00597","snapshot_observed_at":"2026-06-30T07:34:21.520601Z","title":"Debabrata Mahapatra and Vaibhav Rajan","venue":null,"work_id":"168916f2-c50b-4a20-82cc-8a956728d379","year":null},"citing_paper":{"arxiv_id":"2604.04497","last_updated":"2026-04-06T07:48:32Z","snapshot_observed_at":"2026-08-02T22:16:22.336359Z","submitted_at":"2026-04-06T07:48:32Z","title":"One Model for All: Multi-Objective Controllable Language Models","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-10T20:33:46.647842Z"},"links":{"cited_paper":"/paper/2108.00597","citing_paper":"/paper/2604.04497"},"observation_digest":"sha256:1515783710ff987c2757efff662d24b673e87826b5d7e1e2a05c4d1adb4785d4","observation_id":"9e5382a9-403e-4baa-9fa4-7eaa902a30a3","resolution":{"observed_at":"2026-05-10T21:55:49.083252Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2108.00597","last_updated":"2023-09-17T13:29:55Z","snapshot_observed_at":"2026-08-16T18:05:58.537772Z","submitted_at":"2021-08-02T02:13:21Z","title":"Exact Pareto Optimal Search for Multi-Task Learning and Multi-Criteria Decision-Making","version":2},"cited_work":{"arxiv_id":"2108.00597","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2108.00597","snapshot_observed_at":"2026-06-30T07:34:21.520601Z","title":"Debabrata Mahapatra and Vaibhav Rajan","venue":null,"work_id":"168916f2-c50b-4a20-82cc-8a956728d379","year":null},"citing_paper":{"arxiv_id":"2606.29521","last_updated":"2026-06-28T17:31:47Z","snapshot_observed_at":"2026-07-07T00:03:27.045821Z","submitted_at":"2026-06-28T17:31:47Z","title":"Not All Objectives Are Born Equal: Priority-Constrained Descent for Hierarchical Multi-Objective Optimization","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-06-30T07:30:24.505373Z"},"links":{"cited_paper":"/paper/2108.00597","citing_paper":"/paper/2606.29521"},"observation_digest":"sha256:b9359284868b3c1eea633e4aaf097e8d5d4e341b9d6e0dc7cf0323c91e6c8776","observation_id":"09a5cbdb-407e-40a2-b369-01a2c3313c6f","resolution":{"observed_at":"2026-06-30T07:34:21.522570Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2108.00597","last_updated":"2023-09-17T13:29:55Z","snapshot_observed_at":"2026-08-16T18:05:58.537772Z","submitted_at":"2021-08-02T02:13:21Z","title":"Exact Pareto Optimal Search for Multi-Task Learning and Multi-Criteria Decision-Making","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.00597","snapshot_observed_at":"2026-08-16T04:18:57.047937Z","title":"Exact pareto optimal search for multi-task learning and multi- criteria decision-making.arXiv preprint arXiv:2108.00597,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12704","last_updated":"2026-08-13T01:37:49Z","snapshot_observed_at":"2026-08-17T00:46:44.408109Z","submitted_at":"2026-08-13T01:37:49Z","title":"Efficient Hessian-Free Methods for Multi-Objective Bilevel Optimization with Nonconvex Lower Level","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T04:18:57.047937Z"},"links":{"cited_paper":"/paper/2108.00597","citing_paper":"/paper/2608.12704"},"observation_digest":"sha256:0d3568502436882e6e5da1e1f8ee5b85f48b66cace806f1e02f07d654d64c035","observation_id":"ee50e2be-7956-41dd-9404-7decb088294d","resolution":{"observed_at":"2026-08-16T04:18:57.047937Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2108.00597/citation-record","integrity":"/paper/2108.00597/integrity","json":"/paper/2108.00597/citation-record.json","paper":"/paper/2108.00597"},"outbound":[],"paper":{"arxiv_id":"2108.00597","last_updated":"2023-09-17T13:29:55Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T18:05:58.537772Z","submitted_at":"2021-08-02T02:13:21Z","title":"Exact Pareto Optimal Search for Multi-Task Learning and Multi-Criteria Decision-Making"},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2108.00597."}