{"as_of":"2026-08-15T15:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:823dac5510412b31bddc9216eb7a31d45d5de21fbc72c948bd23ad7a7d9ed09a","coverage":[{"denominator":23,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":23,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T05:19:56.858978Z","state":"measured"},{"denominator":27,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":27,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+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-14T04:18:58.732314Z","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-07-02T04:36:35.953588Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.00717","last_updated":"2024-12-01T07:43:39Z","snapshot_observed_at":"2026-08-15T10:42:56.315266Z","submitted_at":"2024-12-01T07:43:39Z","title":"Data-Driven Solution Portfolios","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.00717","snapshot_observed_at":"2026-08-07T20:50:31.106801Z","title":"Cyrus Cousins, Kavosh Asadi, Elita Lobo, and Michael Littman","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.09724","last_updated":"2025-07-16T17:43:06Z","snapshot_observed_at":"2026-08-13T12:12:48.140765Z","submitted_at":"2025-02-13T19:13:55Z","title":"Navigating the Social Welfare Frontier: Portfolios for Multi-objective Reinforcement Learning","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-07T20:50:31.106801Z"},"links":{"cited_paper":"/paper/2412.00717","citing_paper":"/paper/2502.09724"},"observation_digest":"sha256:89414664f061911c8e5520d8ead794b5a1cbd124d0f5cc436a3810aae8313433","observation_id":"7d22f75e-f066-4580-838a-0cdad95a1bb5","resolution":{"observed_at":"2026-08-07T20:50:31.106801Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00717","last_updated":"2024-12-01T07:43:39Z","snapshot_observed_at":"2026-08-15T10:42:56.315266Z","submitted_at":"2024-12-01T07:43:39Z","title":"Data-Driven Solution Portfolios","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.00717","snapshot_observed_at":"2026-08-07T12:01:45.765204Z","title":"arXiv preprint arXiv:2412.00717 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.01323","last_updated":"2025-06-10T15:23:08Z","snapshot_observed_at":"2026-08-15T10:05:41.541378Z","submitted_at":"2025-06-02T05:10:16Z","title":"Computing Diverse and Nice Triangulations","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T12:01:45.765204Z"},"links":{"cited_paper":"/paper/2412.00717","citing_paper":"/paper/2506.01323"},"observation_digest":"sha256:ac06043b2258bc4ce68e0a404591a8f20e70998f0b28cab63cfb088751006231","observation_id":"87c8d7eb-ff27-45e8-bf39-45367677fa56","resolution":{"observed_at":"2026-08-07T12:01:45.765204Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00717","last_updated":"2024-12-01T07:43:39Z","snapshot_observed_at":"2026-08-15T10:42:56.315266Z","submitted_at":"2024-12-01T07:43:39Z","title":"Data-Driven Solution Portfolios","version":1},"cited_work":{"arxiv_id":"2412.00717","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.00717","snapshot_observed_at":"2026-07-02T04:36:35.953588Z","title":"arXiv preprint arXiv:2412.00717 , year=","venue":null,"work_id":"c8b5822d-0869-4ac0-a38f-208c391e3752","year":null},"citing_paper":{"arxiv_id":"2607.00843","last_updated":"2026-07-01T12:09:41Z","snapshot_observed_at":"2026-08-09T14:20:47.096589Z","submitted_at":"2026-07-01T12:09:41Z","title":"Submodular Maximization over Many Matroids via Ordered Local Search","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-07-02T04:31:33.375845Z"},"links":{"cited_paper":"/paper/2412.00717","citing_paper":"/paper/2607.00843"},"observation_digest":"sha256:dc38fa1d7337ad020333bc20ab717743d1e6e9590e4ffa436f01194789558c19","observation_id":"4d18e1fc-294e-40b9-920b-5d4a1dce7820","resolution":{"observed_at":"2026-07-02T04:36:35.955395Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00717","last_updated":"2024-12-01T07:43:39Z","snapshot_observed_at":"2026-08-15T10:42:56.315266Z","submitted_at":"2024-12-01T07:43:39Z","title":"Data-Driven Solution Portfolios","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.00717","snapshot_observed_at":"2026-08-14T04:18:58.732314Z","title":"Marina Drygala, Silvio Lattanzi, Andreas Maggiori, Miltiadis Stouras, Ola Svensson, Sergei Vassilvitskii.https://arxiv.org/abs/2412.00717","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09538","last_updated":"2026-08-13T16:11:12Z","snapshot_observed_at":"2026-08-15T13:15:21.683356Z","submitted_at":"2026-08-10T12:36:16Z","title":"TCS-BENCH: Benchmarking State-of-the-Art Generative AI Theoretical Computer Science Research Ability","version":2},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-14T04:18:58.732314Z"},"links":{"cited_paper":"/paper/2412.00717","citing_paper":"/paper/2608.09538"},"observation_digest":"sha256:585fb6fa7e9a3543eed114e26430878d480bb183b0d1e9eb950c93f42ac56f35","observation_id":"5fbba55e-04db-4550-8f6c-d45174428c7b","resolution":{"observed_at":"2026-08-14T04:18:58.732314Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2412.00717/citation-record","integrity":"/paper/2412.00717/integrity","json":"/paper/2412.00717/citation-record.json","paper":"/paper/2412.00717"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:19:57.135960Z","title":"Data-driven algorithm design, 2020","venue":null,"work_id":"9c658bc5-5cd5-49df-991e-30267cb6fff9","year":2020},"citing_paper":{"arxiv_id":"2412.00717","last_updated":"2024-12-01T07:43:39Z","snapshot_observed_at":"2026-08-15T10:42:56.315266Z","submitted_at":"2024-12-01T07:43:39Z","title":"Data-Driven Solution Portfolios","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-12T05:19:56.767534Z"},"links":{"citing_paper":"/paper/2412.00717"},"observation_digest":"sha256:53374475b655818d907ec4d901b28a823d0813006f24a3bc51d46408b24c9e57","observation_id":"6265a206-ecfa-4a89-9e19-484bfbb19b26","resolution":{"observed_at":"2026-08-12T05:19:57.140223Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:19:57.124628Z","title":"Learning sparse combinatorial representations via two-stage submodular maximization","venue":null,"work_id":"e7cc7f13-4b2d-48c8-8eb7-ec62db426d50","year":2016},"citing_paper":{"arxiv_id":"2412.00717","last_updated":"2024-12-01T07:43:39Z","snapshot_observed_at":"2026-08-15T10:42:56.315266Z","submitted_at":"2024-12-01T07:43:39Z","title":"Data-Driven Solution Portfolios","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-12T05:19:56.772003Z"},"links":{"citing_paper":"/paper/2412.00717"},"observation_digest":"sha256:4130f2362d024d42eabebf9183a224a4c4dbf5221f7b22004000e5ab2647dfac","observation_id":"bf6b942e-84a2-4b80-919d-631b6a2a1f25","resolution":{"observed_at":"2026-08-12T05:19:57.129152Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:19:57.113551Z","title":"Comments on bases in dependence structures","venue":null,"work_id":"56d81d8a-09c7-4aee-bbd6-b54c8d94e51e","year":1969},"citing_paper":{"arxiv_id":"2412.00717","last_updated":"2024-12-01T07:43:39Z","snapshot_observed_at":"2026-08-15T10:42:56.315266Z","submitted_at":"2024-12-01T07:43:39Z","title":"Data-Driven Solution Portfolios","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-12T05:19:56.776703Z"},"links":{"citing_paper":"/paper/2412.00717"},"observation_digest":"sha256:ad03ef4ce1be178f16b68d811c6e4286f124af49611c00455236b1f6c0df1e4c","observation_id":"cf56dc48-0fbb-453c-bfaf-9e7a8c97e140","resolution":{"observed_at":"2026-08-12T05:19:57.117050Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:19:57.102826Z","title":"Faster fundamental graph algorithms via learned predictions","venue":null,"work_id":"28215844-3513-4ff9-99c3-0405998c7c93","year":2022},"citing_paper":{"arxiv_id":"2412.00717","last_updated":"2024-12-01T07:43:39Z","snapshot_observed_at":"2026-08-15T10:42:56.315266Z","submitted_at":"2024-12-01T07:43:39Z","title":"Data-Driven Solution Portfolios","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-12T05:19:56.780627Z"},"links":{"citing_paper":"/paper/2412.00717"},"observation_digest":"sha256:9aa7331aa8821fafbf4776bcc644714f954255c25bff06e344897c08901839b2","observation_id":"2b0db4a6-fc2a-4197-9d38-a86465604ddf","resolution":{"observed_at":"2026-08-12T05:19:57.106822Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:19:57.091630Z","title":"Submodular function maximization via the multilinear relaxation and contention resolution schemes","venue":null,"work_id":"65515d83-1634-422a-bd69-6c51ddae1e8e","year":2011},"citing_paper":{"arxiv_id":"2412.00717","last_updated":"2024-12-01T07:43:39Z","snapshot_observed_at":"2026-08-15T10:42:56.315266Z","submitted_at":"2024-12-01T07:43:39Z","title":"Data-Driven Solution Portfolios","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-12T05:19:56.786097Z"},"links":{"citing_paper":"/paper/2412.00717"},"observation_digest":"sha256:3659c7216c8b7b9b21a947da61f50a79639f1ccc9491e6b83ebfad26511af076","observation_id":"ba0a7e51-cec5-4aa2-bcf5-6f8f2887233e","resolution":{"observed_at":"2026-08-12T05:19:57.095787Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:19:57.081263Z","title":"The madness of multiple entries in march madness, 2024","venue":null,"work_id":"45a47477-17de-4070-b76c-8f37b3cca98f","year":2024},"citing_paper":{"arxiv_id":"2412.00717","last_updated":"2024-12-01T07:43:39Z","snapshot_observed_at":"2026-08-15T10:42:56.315266Z","submitted_at":"2024-12-01T07:43:39Z","title":"Data-Driven Solution Portfolios","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-12T05:19:56.789761Z"},"links":{"citing_paper":"/paper/2412.00717"},"observation_digest":"sha256:535c79c3ae1bb264bc00ece0d4dd5f5ec4b72eedfd9770d36924c289a05dd9ca","observation_id":"fc1d362e-2e20-4015-8979-933e03548a84","resolution":{"observed_at":"2026-08-12T05:19:57.085038Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:19:57.070058Z","title":"Faster matchings via learned duals","venue":null,"work_id":"f48e62b2-bd18-4887-a31d-678fa8fee9c9","year":2021},"citing_paper":{"arxiv_id":"2412.00717","last_updated":"2024-12-01T07:43:39Z","snapshot_observed_at":"2026-08-15T10:42:56.315266Z","submitted_at":"2024-12-01T07:43:39Z","title":"Data-Driven Solution Portfolios","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-12T05:19:56.793745Z"},"links":{"citing_paper":"/paper/2412.00717"},"observation_digest":"sha256:5c39e6285aed263e08e570e765231c7c5a78f7f3aba21a1aa09d3f92ba90d7f6","observation_id":"879c96df-7358-4efa-9019-37a1f31b9bad","resolution":{"observed_at":"2026-08-12T05:19:57.073695Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:19:57.059470Z","title":"Predictive flows for faster ford-fulkerson","venue":null,"work_id":"c34df441-46ae-4df8-8f6b-97abfa0c19a6","year":2023},"citing_paper":{"arxiv_id":"2412.00717","last_updated":"2024-12-01T07:43:39Z","snapshot_observed_at":"2026-08-15T10:42:56.315266Z","submitted_at":"2024-12-01T07:43:39Z","title":"Data-Driven Solution Portfolios","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-12T05:19:56.797396Z"},"links":{"citing_paper":"/paper/2412.00717"},"observation_digest":"sha256:4ce3172075bafcb2f564f5adbfcee32e9867ef4a07fc29c85d849e092921a973","observation_id":"79280c60-9912-4b3d-9086-2d0efd94230e","resolution":{"observed_at":"2026-08-12T05:19:57.063242Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:19:57.047776Z","title":"The outer limits of contention resolution on matroids and connections to the secretary problem","venue":null,"work_id":"21341f36-8362-40b3-a1a5-8f07229b3b3d","year":2020},"citing_paper":{"arxiv_id":"2412.00717","last_updated":"2024-12-01T07:43:39Z","snapshot_observed_at":"2026-08-15T10:42:56.315266Z","submitted_at":"2024-12-01T07:43:39Z","title":"Data-Driven Solution Portfolios","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-12T05:19:56.802003Z"},"links":{"citing_paper":"/paper/2412.00717"},"observation_digest":"sha256:ac86fd517602bb6fa836aca3b9babf50683be3c432b3a993b5ed6b36fbf0238f","observation_id":"455ac1b9-c557-432a-8a40-ed81a04c6a4d","resolution":{"observed_at":"2026-08-12T05:19:57.051840Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:19:57.036040Z","title":"Matroid secretary is equivalent to contention resolution","venue":null,"work_id":"3442966b-a021-488e-90aa-0c61fd9ab01b","year":2022},"citing_paper":{"arxiv_id":"2412.00717","last_updated":"2024-12-01T07:43:39Z","snapshot_observed_at":"2026-08-15T10:42:56.315266Z","submitted_at":"2024-12-01T07:43:39Z","title":"Data-Driven Solution Portfolios","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-12T05:19:56.805842Z"},"links":{"citing_paper":"/paper/2412.00717"},"observation_digest":"sha256:f8d3d535c5bed5731d390031d5d60d7e0b0a6d9ce47e062ca3b29184d4d19701","observation_id":"b2e58801-a4fd-4e5f-bab7-66ef3289e7e0","resolution":{"observed_at":"2026-08-12T05:19:57.039976Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.18568","last_updated":"2024-05-28T20:26:05Z","snapshot_observed_at":"2026-08-12T23:55:44.998806Z","submitted_at":"2024-05-28T20:26:05Z","title":"Warm-starting Push-Relabel","version":1},"cited_work":{"arxiv_id":"2405.18568","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.18568","snapshot_observed_at":"2026-08-12T05:19:56.898859Z","title":"Warm-starting Push-Relabel","venue":"cs.DS","work_id":"764edc40-e87a-4d45-bee6-9a153cfacc8d","year":2024},"citing_paper":{"arxiv_id":"2412.00717","last_updated":"2024-12-01T07:43:39Z","snapshot_observed_at":"2026-08-15T10:42:56.315266Z","submitted_at":"2024-12-01T07:43:39Z","title":"Data-Driven Solution Portfolios","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-12T05:19:56.809472Z"},"links":{"cited_paper":"/paper/2405.18568","citing_paper":"/paper/2412.00717"},"observation_digest":"sha256:53b2d6a1c44428c8a7d1226bc843d5d0be8b7cdf1f7a0dd96a4980f8fb4c6884","observation_id":"e7999646-2162-41d6-977e-6510f890f2ad","resolution":{"observed_at":"2026-08-12T05:19:56.904494Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:19:57.022460Z","title":"A threshold of ln n for approximating set cover","venue":null,"work_id":"56d99936-ff40-4580-b529-ed301932cfff","year":1998},"citing_paper":{"arxiv_id":"2412.00717","last_updated":"2024-12-01T07:43:39Z","snapshot_observed_at":"2026-08-15T10:42:56.315266Z","submitted_at":"2024-12-01T07:43:39Z","title":"Data-Driven Solution Portfolios","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-12T05:19:56.814151Z"},"links":{"citing_paper":"/paper/2412.00717"},"observation_digest":"sha256:3c6b4da2d960857a90bf59563331f9db2dad45d0c1c4ed0af856cad354e314cb","observation_id":"41cfb111-2f90-4e75-ae3b-8154bdc3af87","resolution":{"observed_at":"2026-08-12T05:19:57.027307Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.03230","last_updated":"2024-09-23T17:35:51Z","snapshot_observed_at":"2026-08-13T05:32:01.740041Z","submitted_at":"2023-11-06T16:15:38Z","title":"Balancing Notions of Equity: Trade-offs Between Fair Portfolio Sizes and Achievable Guarantees","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.03230","snapshot_observed_at":"2026-08-12T05:19:56.818185Z","title":"Balancing notions of equity: Approximation algorithms for fair portfolio of solutions in combinatorial optimization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.00717","last_updated":"2024-12-01T07:43:39Z","snapshot_observed_at":"2026-08-15T10:42:56.315266Z","submitted_at":"2024-12-01T07:43:39Z","title":"Data-Driven Solution Portfolios","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-12T05:19:56.818185Z"},"links":{"cited_paper":"/paper/2311.03230","citing_paper":"/paper/2412.00717"},"observation_digest":"sha256:4bd378b133a79ef939ae922e7a77624ab09f4d72590dab92c0b36641fb9591fc","observation_id":"4eeda8c8-4983-473c-badb-8beb5d4a8f1d","resolution":{"observed_at":"2026-08-12T05:19:56.818185Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:19:57.009908Z","title":"Segmentation problems","venue":null,"work_id":"d4e8f3e9-56f6-41b8-a0f3-8a2000149c9e","year":2004},"citing_paper":{"arxiv_id":"2412.00717","last_updated":"2024-12-01T07:43:39Z","snapshot_observed_at":"2026-08-15T10:42:56.315266Z","submitted_at":"2024-12-01T07:43:39Z","title":"Data-Driven Solution Portfolios","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-12T05:19:56.822502Z"},"links":{"citing_paper":"/paper/2412.00717"},"observation_digest":"sha256:975a7e535272dfa2da84335d6fcd2ad08c3a2dd8beca8247128b04998cd333aa","observation_id":"7cba3350-ac43-4006-a0bf-ed537913c3e3","resolution":{"observed_at":"2026-08-12T05:19:57.014166Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:19:56.998003Z","title":"Team performance with test scores","venue":null,"work_id":"3a1d0271-fa3c-41cb-bffe-6b278344139f","year":2018},"citing_paper":{"arxiv_id":"2412.00717","last_updated":"2024-12-01T07:43:39Z","snapshot_observed_at":"2026-08-15T10:42:56.315266Z","submitted_at":"2024-12-01T07:43:39Z","title":"Data-Driven Solution Portfolios","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-12T05:19:56.826515Z"},"links":{"citing_paper":"/paper/2412.00717"},"observation_digest":"sha256:1da52eada30861125b06a3ce6c6f408ddf691cb3ed5fa24012ca24aa78056cd5","observation_id":"0ce07583-aee3-4c34-9027-0f0728772e04","resolution":{"observed_at":"2026-08-12T05:19:57.002378Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:19:56.984525Z","title":"Speeding up bellman ford via minimum violation permutations","venue":null,"work_id":"504da797-a4b6-4f92-a58f-d66d0fa56b71","year":2023},"citing_paper":{"arxiv_id":"2412.00717","last_updated":"2024-12-01T07:43:39Z","snapshot_observed_at":"2026-08-15T10:42:56.315266Z","submitted_at":"2024-12-01T07:43:39Z","title":"Data-Driven Solution Portfolios","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-12T05:19:56.830037Z"},"links":{"citing_paper":"/paper/2412.00717"},"observation_digest":"sha256:e4aa2d0c4aae09d40d182898bcc8c247414bf3fbbc7f8742fda6388c4d90e0b3","observation_id":"dadba061-5e2f-4364-a3f4-e3a38b64674c","resolution":{"observed_at":"2026-08-12T05:19:56.989433Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:19:56.834459Z","title":"Algorithms with predictions","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.00717","last_updated":"2024-12-01T07:43:39Z","snapshot_observed_at":"2026-08-15T10:42:56.315266Z","submitted_at":"2024-12-01T07:43:39Z","title":"Data-Driven Solution Portfolios","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-12T05:19:56.834459Z"},"links":{"citing_paper":"/paper/2412.00717"},"observation_digest":"sha256:cde682d7f66e3448ba2490e6eafa05e961b748f7295e045e7f79686490d86c50","observation_id":"7c182b8f-8613-44a5-ad26-abe2d6b7be3d","resolution":{"observed_at":"2026-08-12T05:19:56.834459Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:19:56.838780Z","title":"An analysis of approximations for maximizing submodular set functions—i","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2412.00717","last_updated":"2024-12-01T07:43:39Z","snapshot_observed_at":"2026-08-15T10:42:56.315266Z","submitted_at":"2024-12-01T07:43:39Z","title":"Data-Driven Solution Portfolios","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-12T05:19:56.838780Z"},"links":{"citing_paper":"/paper/2412.00717"},"observation_digest":"sha256:88538a008b478b36437e5a460f9f1fcd6747805f7b6c8c6a65f2e0a1fe0e2a2b","observation_id":"ef5b3b86-7668-4418-8ac7-dc83d019e5e2","resolution":{"observed_at":"2026-08-12T05:19:56.838780Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:19:56.958365Z","title":"Submodular dominance and applications","venue":null,"work_id":"f41f1e7d-d93c-479d-a9a0-f5abc367ea92","year":2022},"citing_paper":{"arxiv_id":"2412.00717","last_updated":"2024-12-01T07:43:39Z","snapshot_observed_at":"2026-08-15T10:42:56.315266Z","submitted_at":"2024-12-01T07:43:39Z","title":"Data-Driven Solution Portfolios","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-12T05:19:56.842986Z"},"links":{"citing_paper":"/paper/2412.00717"},"observation_digest":"sha256:752bc97ead8765f7b1ad9aa438200115d8ddd07b4b96d0a4ebe43a43dd941328","observation_id":"404ac086-a619-4265-b239-0ed5eba88aa5","resolution":{"observed_at":"2026-08-12T05:19:56.962266Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:19:56.946525Z","title":"Combinatorial optimization under uncertainty: Probing and stopping-time algorithms","venue":null,"work_id":"8a821381-2c41-4111-8dc8-eae962233738","year":2018},"citing_paper":{"arxiv_id":"2412.00717","last_updated":"2024-12-01T07:43:39Z","snapshot_observed_at":"2026-08-15T10:42:56.315266Z","submitted_at":"2024-12-01T07:43:39Z","title":"Data-Driven Solution Portfolios","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-12T05:19:56.846985Z"},"links":{"citing_paper":"/paper/2412.00717"},"observation_digest":"sha256:aa70d31217ab1f72bdec854bde14761d51f6b0adc8cf3a658130e74b748c641b","observation_id":"cdb42fd2-a6a2-4340-b75b-671b947b9fc3","resolution":{"observed_at":"2026-08-12T05:19:56.950932Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:19:56.934973Z","title":"Probabilistic submodular maximization in sub-linear time","venue":null,"work_id":"de7fdbb7-a227-4f50-bf6a-1ddd68f27e19","year":2017},"citing_paper":{"arxiv_id":"2412.00717","last_updated":"2024-12-01T07:43:39Z","snapshot_observed_at":"2026-08-15T10:42:56.315266Z","submitted_at":"2024-12-01T07:43:39Z","title":"Data-Driven Solution Portfolios","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-12T05:19:56.851578Z"},"links":{"citing_paper":"/paper/2412.00717"},"observation_digest":"sha256:6437e8654ddc5315df6e07b7077cd706fdbb33ee7753b86c19a075e72615cd07","observation_id":"5b96f3cb-0e5d-4e3d-928d-dfe5adb7c4b6","resolution":{"observed_at":"2026-08-12T05:19:56.938834Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:19:56.855484Z","title":"Submodular function maximization via the multilinear relaxation and contention resolution schemes","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2412.00717","last_updated":"2024-12-01T07:43:39Z","snapshot_observed_at":"2026-08-15T10:42:56.315266Z","submitted_at":"2024-12-01T07:43:39Z","title":"Data-Driven Solution Portfolios","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-12T05:19:56.855484Z"},"links":{"citing_paper":"/paper/2412.00717"},"observation_digest":"sha256:763f038e654444a8a0e14cbdeef6a63fa9e85d2201b28ab80c2b71a6abdcc0b8","observation_id":"8e88f627-e480-44e3-94fa-1bf7aa8eaddb","resolution":{"observed_at":"2026-08-12T05:19:56.855484Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:19:56.914333Z","title":"A note on concentration of submodular functions, 2010","venue":null,"work_id":"17a4a1d2-f720-4bb9-b8c0-270a4deb5479","year":2010},"citing_paper":{"arxiv_id":"2412.00717","last_updated":"2024-12-01T07:43:39Z","snapshot_observed_at":"2026-08-15T10:42:56.315266Z","submitted_at":"2024-12-01T07:43:39Z","title":"Data-Driven Solution Portfolios","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-12T05:19:56.858978Z"},"links":{"citing_paper":"/paper/2412.00717"},"observation_digest":"sha256:8fe486f98f9bb4a8e1e7ef83e2028357b12ea8f1e04e05798ab5301af148fefb","observation_id":"38fd7592-0b21-4382-a49b-9b35eda42720","resolution":{"observed_at":"2026-08-12T05:19:56.919584Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.00717","last_updated":"2024-12-01T07:43:39Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-15T10:42:56.315266Z","submitted_at":"2024-12-01T07:43:39Z","title":"Data-Driven Solution Portfolios"},"reference_resolution":{"displayed":23,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":1,"verified_fuzzy":18},"total_outbound_references":23},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 23 of 23 outbound references and 4 inbound Pith citation observations for arXiv:2412.00717."}