{"as_of":"2026-08-10T20:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ce0c22713ad95869dcfe79eab5392d9e819891ba5fd60db4d66872693cd3ec0b","coverage":[{"denominator":30,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":30,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T12:55:26.124780Z","state":"measured"},{"denominator":31,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":31,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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-08-02T01:57:54.641353Z","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":"2505.23967","last_updated":"2025-05-29T19:47:09Z","snapshot_observed_at":"2026-08-07T12:35:42.886469Z","submitted_at":"2025-05-29T19:47:09Z","title":"Improved Approximations for Hard Graph Problems using Predictions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.23967","snapshot_observed_at":"2026-08-02T01:57:54.641353Z","title":"Improved approximations for hard graph problems using predictions","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-02T01:57:54.641353Z"},"links":{"cited_paper":"/paper/2505.23967","citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:adbd220e9eb0154a1fd8c18c547d5afc184a63ec4b29d068d9af30d760e1db6a","observation_id":"84871680-e607-4ea7-850a-98a5b0d54fcc","resolution":{"observed_at":"2026-08-02T01:57:54.641353Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2505.23967/citation-record","integrity":"/paper/2505.23967/integrity","json":"/paper/2505.23967/citation-record.json","paper":"/paper/2505.23967"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:55:23.716377Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.23967","last_updated":"2025-05-29T19:47:09Z","snapshot_observed_at":"2026-08-07T12:35:42.886469Z","submitted_at":"2025-05-29T19:47:09Z","title":"Improved Approximations for Hard Graph Problems using Predictions","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T12:55:23.716377Z"},"links":{"citing_paper":"/paper/2505.23967"},"observation_digest":"sha256:5e5fd2d5311c1e65955eb8e2690c4c2fb66e7c41dd6ac64b7ffe6ab4891dfe1a","observation_id":"b9f02217-ace2-4d34-9f9f-922a19680369","resolution":{"observed_at":"2026-08-07T12:55:23.716377Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.16600","last_updated":"2024-11-25T17:31:34Z","snapshot_observed_at":"2026-07-06T19:56:43.637339Z","submitted_at":"2024-11-25T17:31:34Z","title":"Approximation Algorithms for Combinatorial Optimization with Predictions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.16600","snapshot_observed_at":"2026-08-07T12:55:23.764531Z","title":"Approximation algorithms for combinatorial optimization with predictions","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.23967","last_updated":"2025-05-29T19:47:09Z","snapshot_observed_at":"2026-08-07T12:35:42.886469Z","submitted_at":"2025-05-29T19:47:09Z","title":"Improved Approximations for Hard Graph Problems using Predictions","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T12:55:23.764531Z"},"links":{"cited_paper":"/paper/2411.16600","citing_paper":"/paper/2505.23967"},"observation_digest":"sha256:4782e33b544c283a0a009e314304964e8c7e33e3c4c66348bdebc5a3a28d9a99","observation_id":"7a204478-25ca-43d8-9b0f-57f581e12717","resolution":{"observed_at":"2026-08-07T12:55:23.764531Z","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-07T12:55:28.415703Z","title":"Parsimonious learning-augmented approximations for dense instances of np-hard problems","venue":null,"work_id":"730d9e71-f0aa-4397-ba16-5990220ff694","year":2024},"citing_paper":{"arxiv_id":"2505.23967","last_updated":"2025-05-29T19:47:09Z","snapshot_observed_at":"2026-08-07T12:35:42.886469Z","submitted_at":"2025-05-29T19:47:09Z","title":"Improved Approximations for Hard Graph Problems using Predictions","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T12:55:23.828876Z"},"links":{"citing_paper":"/paper/2505.23967"},"observation_digest":"sha256:b1a93b600dcabfe1e56e5451e647843e3e1e082829e94ee91609d47b246d10d8","observation_id":"143d1b69-de5b-4e07-b10a-f04e732e87cf","resolution":{"observed_at":"2026-08-07T12:55:28.483164Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T12:55:23.910973Z","title":"Learning-augmented maximum independent set","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.23967","last_updated":"2025-05-29T19:47:09Z","snapshot_observed_at":"2026-08-07T12:35:42.886469Z","submitted_at":"2025-05-29T19:47:09Z","title":"Improved Approximations for Hard Graph Problems using Predictions","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T12:55:23.910973Z"},"links":{"citing_paper":"/paper/2505.23967"},"observation_digest":"sha256:85809ddb2cce76fe0e6be5961b9c574ad97780a14da2a398be41d216ef2f1015","observation_id":"6de52d81-032c-4655-82bc-79a98f9757d7","resolution":{"observed_at":"2026-08-07T12:55:23.910973Z","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-07T12:55:28.280893Z","title":"Faster fundamental graph algorithms via learned predictions","venue":null,"work_id":"e6da4ca1-f23a-4931-a7dc-977b0d98071c","year":2022},"citing_paper":{"arxiv_id":"2505.23967","last_updated":"2025-05-29T19:47:09Z","snapshot_observed_at":"2026-08-07T12:35:42.886469Z","submitted_at":"2025-05-29T19:47:09Z","title":"Improved Approximations for Hard Graph Problems using Predictions","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T12:55:23.981810Z"},"links":{"citing_paper":"/paper/2505.23967"},"observation_digest":"sha256:84975677b2362f630351e2a4fe38c3abaa95f4e2faba45ab9eeb1c12bbc75aa7","observation_id":"842dc07b-c0be-419c-aa4a-d1ecba5fcfa1","resolution":{"observed_at":"2026-08-07T12:55:28.348321Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T12:55:28.159041Z","title":"Y., Eden, T., Indyk, P., Lin, H., Narayanan, S., Rubinfeld, R., Silwal, S., Wagner, T., Woodruff, D., and Zhang, M","venue":null,"work_id":"68c078fa-0210-4a03-aacf-217bae1b63ae","year":2022},"citing_paper":{"arxiv_id":"2505.23967","last_updated":"2025-05-29T19:47:09Z","snapshot_observed_at":"2026-08-07T12:35:42.886469Z","submitted_at":"2025-05-29T19:47:09Z","title":"Improved Approximations for Hard Graph Problems using Predictions","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T12:55:24.059110Z"},"links":{"citing_paper":"/paper/2505.23967"},"observation_digest":"sha256:7bf80120961398177492cf7c0df2b40457a8f3a4251f841003c09b275c19ddf0","observation_id":"9b519cf3-a982-4fff-8d06-973a88e70550","resolution":{"observed_at":"2026-08-07T12:55:28.249184Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T12:55:24.124375Z","title":"A greedy heuristic for the set-covering problem","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2505.23967","last_updated":"2025-05-29T19:47:09Z","snapshot_observed_at":"2026-08-07T12:35:42.886469Z","submitted_at":"2025-05-29T19:47:09Z","title":"Improved Approximations for Hard Graph Problems using Predictions","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T12:55:24.124375Z"},"links":{"citing_paper":"/paper/2505.23967"},"observation_digest":"sha256:25d5e68f9fd504f970362383edf9dc545600204bd2085e6971af271866c58543","observation_id":"b558da8b-201e-42ac-b170-346dc4c778b9","resolution":{"observed_at":"2026-08-07T12:55:24.124375Z","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-07T12:55:28.102460Z","title":"Learning-augmented approximation algorithms for maximum cut and related problems","venue":null,"work_id":"491f1365-c7d6-4989-8707-b147449e5ee9","year":2024},"citing_paper":{"arxiv_id":"2505.23967","last_updated":"2025-05-29T19:47:09Z","snapshot_observed_at":"2026-08-07T12:35:42.886469Z","submitted_at":"2025-05-29T19:47:09Z","title":"Improved Approximations for Hard Graph Problems using Predictions","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T12:55:24.200580Z"},"links":{"citing_paper":"/paper/2505.23967"},"observation_digest":"sha256:39e2c60f9088230772a2d92cc2a8fba893441b5651b06cd483ec1532918114fa","observation_id":"32aaeaeb-5607-4afe-933a-fca4240d8190","resolution":{"observed_at":"2026-08-07T12:55:28.113907Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T12:55:28.065202Z","title":null,"venue":null,"work_id":"cc85b52a-daf6-43ef-9066-6d0038ed2ebd","year":2025},"citing_paper":{"arxiv_id":"2505.23967","last_updated":"2025-05-29T19:47:09Z","snapshot_observed_at":"2026-08-07T12:35:42.886469Z","submitted_at":"2025-05-29T19:47:09Z","title":"Improved Approximations for Hard Graph Problems using Predictions","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T12:55:24.262554Z"},"links":{"citing_paper":"/paper/2505.23967"},"observation_digest":"sha256:ba04f41dc68271314808d7e58808a7c467efae7bbc26b8e4739dd50ed4e7dd40","observation_id":"f69ff4ac-1117-413b-a404-6c7efa4f6259","resolution":{"observed_at":"2026-08-07T12:55:28.081962Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T12:55:24.319724Z","title":"and Steurer, D","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.23967","last_updated":"2025-05-29T19:47:09Z","snapshot_observed_at":"2026-08-07T12:35:42.886469Z","submitted_at":"2025-05-29T19:47:09Z","title":"Improved Approximations for Hard Graph Problems using Predictions","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T12:55:24.319724Z"},"links":{"citing_paper":"/paper/2505.23967"},"observation_digest":"sha256:3db29573e097d4f6cee584336947d8c715e2ecefc8a28b5acf5ecc1f9f9d2875","observation_id":"6348b4b6-e1ef-408b-b5ef-191578c1aa26","resolution":{"observed_at":"2026-08-07T12:55:24.319724Z","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-07T12:55:28.026136Z","title":"C., Feng, Z., Silwal, S., Woodruff, D., and Zhou, S","venue":null,"work_id":"e74238b3-b8d2-45f5-9241-851f29357c38","year":null},"citing_paper":{"arxiv_id":"2505.23967","last_updated":"2025-05-29T19:47:09Z","snapshot_observed_at":"2026-08-07T12:35:42.886469Z","submitted_at":"2025-05-29T19:47:09Z","title":"Improved Approximations for Hard Graph Problems using Predictions","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T12:55:24.370540Z"},"links":{"citing_paper":"/paper/2505.23967"},"observation_digest":"sha256:f1f4d9739fe1b1044f707d2d0a56f2c4cd30812f597eea8f62ea11077ad4c561","observation_id":"255d1105-9ce9-4cd0-9b60-f4c67237718f","resolution":{"observed_at":"2026-08-07T12:55:28.044531Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T12:55:27.989433Z","title":"G., Fullin, K., Gutierrez, G., Omodt, N., Zinnecker, S., Sprint, G., and McCulloch, S","venue":null,"work_id":"e54a6f15-0096-442b-b97c-79d0a30912bb","year":2023},"citing_paper":{"arxiv_id":"2505.23967","last_updated":"2025-05-29T19:47:09Z","snapshot_observed_at":"2026-08-07T12:35:42.886469Z","submitted_at":"2025-05-29T19:47:09Z","title":"Improved Approximations for Hard Graph Problems using Predictions","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T12:55:24.417925Z"},"links":{"citing_paper":"/paper/2505.23967"},"observation_digest":"sha256:aa8e9f9e9a8bf02aa970641f4086cdda518026a2f36af47aa80a61a5a837c408","observation_id":"4b161109-7027-4beb-a27d-78045a4bb47a","resolution":{"observed_at":"2026-08-07T12:55:28.006146Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T12:55:27.923087Z","title":"Approximate cluster recovery from noisy labels","venue":null,"work_id":"18fc95e1-e165-40d2-96c7-ba972cef6145","year":2022},"citing_paper":{"arxiv_id":"2505.23967","last_updated":"2025-05-29T19:47:09Z","snapshot_observed_at":"2026-08-07T12:35:42.886469Z","submitted_at":"2025-05-29T19:47:09Z","title":"Improved Approximations for Hard Graph Problems using Predictions","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T12:55:24.457798Z"},"links":{"citing_paper":"/paper/2505.23967"},"observation_digest":"sha256:7cc51459a8320e81c28668e1f8397520d726bd1ff0109fae893a8f796580fefd","observation_id":"672abdee-cd75-42eb-83d9-0f664bb8c3df","resolution":{"observed_at":"2026-08-07T12:55:27.962405Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T12:55:27.853227Z","title":"Constraint satisfaction problems with advice","venue":null,"work_id":"85000d02-aff9-418e-a745-fd644697c4e7","year":2025},"citing_paper":{"arxiv_id":"2505.23967","last_updated":"2025-05-29T19:47:09Z","snapshot_observed_at":"2026-08-07T12:35:42.886469Z","submitted_at":"2025-05-29T19:47:09Z","title":"Improved Approximations for Hard Graph Problems using Predictions","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T12:55:24.535627Z"},"links":{"citing_paper":"/paper/2505.23967"},"observation_digest":"sha256:7a8be7c73a8a6b33241e9ceaf533a1f143d2f898e5a7cb7fc1fa1e4ece562121","observation_id":"4d082601-74ab-4b40-aff3-9aa611a8c22a","resolution":{"observed_at":"2026-08-07T12:55:27.901846Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7683.22768","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:55:26.985434Z","title":null,"venue":null,"work_id":"098beeb5-38bc-4c0e-9e70-2823df03f19a","year":1995},"citing_paper":{"arxiv_id":"2505.23967","last_updated":"2025-05-29T19:47:09Z","snapshot_observed_at":"2026-08-07T12:35:42.886469Z","submitted_at":"2025-05-29T19:47:09Z","title":"Improved Approximations for Hard Graph Problems using Predictions","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T12:55:24.599894Z"},"links":{"citing_paper":"/paper/2505.23967"},"observation_digest":"sha256:fdfdbc81a75718e3db3b0f62dbeadc2814f27c40d94f9b0d2bfb2ae1df107bc3","observation_id":"a564bdab-5db8-42d5-b5f3-c91c34150c16","resolution":{"observed_at":"2026-08-07T12:55:27.009522Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bfb0053959","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T00:03:45.533247Z","title":null,"venue":"Lecture notes in computer science","work_id":"851be0aa-6bef-4232-bcbc-6b4e8ad17373","year":1998},"citing_paper":{"arxiv_id":"2505.23967","last_updated":"2025-05-29T19:47:09Z","snapshot_observed_at":"2026-08-07T12:35:42.886469Z","submitted_at":"2025-05-29T19:47:09Z","title":"Improved Approximations for Hard Graph Problems using Predictions","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T12:55:24.603039Z"},"links":{"citing_paper":"/paper/2505.23967"},"observation_digest":"sha256:1103cab1fc64d448203c56c243ab8761d6697aa05ab1cf60238207959b4b07c5","observation_id":"30c99343-ede2-4db3-ae5d-4ac1437d3c31","resolution":{"observed_at":"2026-08-07T12:55:26.384763Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T12:55:24.606236Z","title":"Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2505.23967","last_updated":"2025-05-29T19:47:09Z","snapshot_observed_at":"2026-08-07T12:35:42.886469Z","submitted_at":"2025-05-29T19:47:09Z","title":"Improved Approximations for Hard Graph Problems using Predictions","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T12:55:24.606236Z"},"links":{"citing_paper":"/paper/2505.23967"},"observation_digest":"sha256:df383a5cd512ed30ac8cdbaf09c1478a6f32d4c947164e6ab2dbe44f4e1d77a2","observation_id":"7292164a-cb38-4a1b-9519-9fbc1459440c","resolution":{"observed_at":"2026-08-07T12:55:24.606236Z","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":"1996.54852","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:55:26.782438Z","title":"Clique is hard to approximate within n\\( ^ 1-epsilon \\)","venue":null,"work_id":"bed399ef-c40a-4bbd-8494-ce98e15970c9","year":1996},"citing_paper":{"arxiv_id":"2505.23967","last_updated":"2025-05-29T19:47:09Z","snapshot_observed_at":"2026-08-07T12:35:42.886469Z","submitted_at":"2025-05-29T19:47:09Z","title":"Improved Approximations for Hard Graph Problems using Predictions","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T12:55:24.880722Z"},"links":{"citing_paper":"/paper/2505.23967"},"observation_digest":"sha256:18433dde34b74bf217bdb8356fdba01339249087c03bc0f207018c428206d04c","observation_id":"af0b2cd9-b6c3-410f-a697-182d3b561ba8","resolution":{"observed_at":"2026-08-07T12:55:26.823950Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T12:55:27.764565Z","title":"Learning-based frequency estimation algorithms","venue":null,"work_id":"f3d65ccb-2479-4b5e-963d-722dcf718b4c","year":2019},"citing_paper":{"arxiv_id":"2505.23967","last_updated":"2025-05-29T19:47:09Z","snapshot_observed_at":"2026-08-07T12:35:42.886469Z","submitted_at":"2025-05-29T19:47:09Z","title":"Improved Approximations for Hard Graph Problems using Predictions","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T12:55:25.040266Z"},"links":{"citing_paper":"/paper/2505.23967"},"observation_digest":"sha256:2ed572a89ec591fb8b838ab47b28a69d74358437bf8d253519c27cf089ba87c2","observation_id":"803b12e2-8509-45b2-86af-9fdbebbe1a51","resolution":{"observed_at":"2026-08-07T12:55:27.802577Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T12:55:27.679947Z","title":null,"venue":null,"work_id":"249c8b34-227d-41a5-9556-1ec64690f501","year":2020},"citing_paper":{"arxiv_id":"2505.23967","last_updated":"2025-05-29T19:47:09Z","snapshot_observed_at":"2026-08-07T12:35:42.886469Z","submitted_at":"2025-05-29T19:47:09Z","title":"Improved Approximations for Hard Graph Problems using Predictions","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T12:55:25.261660Z"},"links":{"citing_paper":"/paper/2505.23967"},"observation_digest":"sha256:92d8c2bfc1fc8aa00f226d85baab6362751ceb2f1b2e17809ba77f02df7bdc9a","observation_id":"cc6228ac-c406-4e5c-aacb-8be4cfd965bf","resolution":{"observed_at":"2026-08-07T12:55:27.711773Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T12:55:25.429663Z","title":null,"venue":null,"work_id":null,"year":1974},"citing_paper":{"arxiv_id":"2505.23967","last_updated":"2025-05-29T19:47:09Z","snapshot_observed_at":"2026-08-07T12:35:42.886469Z","submitted_at":"2025-05-29T19:47:09Z","title":"Improved Approximations for Hard Graph Problems using Predictions","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T12:55:25.429663Z"},"links":{"citing_paper":"/paper/2505.23967"},"observation_digest":"sha256:9ba78fb7c37a4e7fe275bafc695d2319ef7272d685e2fb06c9ecae0e172ad8f5","observation_id":"4a57f630-6995-4b85-84e9-2d658a6c2982","resolution":{"observed_at":"2026-08-07T12:55:25.429663Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2003.12144","last_updated":"2020-03-26T20:23:04Z","snapshot_observed_at":"2026-08-09T13:11:30.611702Z","submitted_at":"2020-03-26T20:23:04Z","title":"Metrics and Optimization of Internal Poses for Highly Redundant Truss-Like Serialized Parallel Manipulators","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.12144","snapshot_observed_at":"2026-08-07T12:55:25.636246Z","title":"and Regev, O","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2505.23967","last_updated":"2025-05-29T19:47:09Z","snapshot_observed_at":"2026-08-07T12:35:42.886469Z","submitted_at":"2025-05-29T19:47:09Z","title":"Improved Approximations for Hard Graph Problems using Predictions","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T12:55:25.636246Z"},"links":{"cited_paper":"/paper/2003.12144","citing_paper":"/paper/2505.23967"},"observation_digest":"sha256:323d349860be29d5e6cab02d541d8fb128845b2698c61bb8f19739d9c43e715e","observation_id":"88297ea7-052f-4c1d-a75b-43257e373e6e","resolution":{"observed_at":"2026-08-07T12:55:25.636246Z","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-07T12:55:27.568122Z","title":"and Regev, O","venue":null,"work_id":"30a6f18e-3b27-4347-a96c-032c2324e374","year":2008},"citing_paper":{"arxiv_id":"2505.23967","last_updated":"2025-05-29T19:47:09Z","snapshot_observed_at":"2026-08-07T12:35:42.886469Z","submitted_at":"2025-05-29T19:47:09Z","title":"Improved Approximations for Hard Graph Problems using Predictions","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T12:55:25.854432Z"},"links":{"citing_paper":"/paper/2505.23967"},"observation_digest":"sha256:174e551c192e22ae605128a43dad23f0328151253435afbbb00e68fe1f86636f","observation_id":"a969d685-812d-42fe-a831-5dc2fc3059a2","resolution":{"observed_at":"2026-08-07T12:55:27.642647Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T12:55:27.469983Z","title":"and Mcauley, J","venue":null,"work_id":"506d2e48-a563-4182-a23c-5fca2c35f2c3","year":2012},"citing_paper":{"arxiv_id":"2505.23967","last_updated":"2025-05-29T19:47:09Z","snapshot_observed_at":"2026-08-07T12:35:42.886469Z","submitted_at":"2025-05-29T19:47:09Z","title":"Improved Approximations for Hard Graph Problems using Predictions","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T12:55:25.951661Z"},"links":{"citing_paper":"/paper/2505.23967"},"observation_digest":"sha256:07d01cc88dc466445c2e50e58ec6c64427dde77d3e465f267da5431acb46ce23","observation_id":"a021bfd1-92f7-4849-a151-f994959cd9c5","resolution":{"observed_at":"2026-08-07T12:55:27.497851Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T12:55:25.955322Z","title":"On the ratio of optimal integral and fractional covers","venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2505.23967","last_updated":"2025-05-29T19:47:09Z","snapshot_observed_at":"2026-08-07T12:35:42.886469Z","submitted_at":"2025-05-29T19:47:09Z","title":"Improved Approximations for Hard Graph Problems using Predictions","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T12:55:25.955322Z"},"links":{"citing_paper":"/paper/2505.23967"},"observation_digest":"sha256:b29afde28efe82a5a86c0af00fa448dabd6b1a5995fe4a439fab763579c91ed6","observation_id":"3a5cd51f-9ac4-4b90-a609-80837396536d","resolution":{"observed_at":"2026-08-07T12:55:25.955322Z","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-07T12:55:25.958557Z","title":"and Vassilvitskii, S","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.23967","last_updated":"2025-05-29T19:47:09Z","snapshot_observed_at":"2026-08-07T12:35:42.886469Z","submitted_at":"2025-05-29T19:47:09Z","title":"Improved Approximations for Hard Graph Problems using Predictions","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T12:55:25.958557Z"},"links":{"citing_paper":"/paper/2505.23967"},"observation_digest":"sha256:74691d8739021ef24935e1d195d680d5258200708db9ff335102fdeb863aef28","observation_id":"d0d67dd0-6d50-408d-9bf8-90955351b701","resolution":{"observed_at":"2026-08-07T12:55:25.958557Z","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-07T12:55:25.962031Z","title":"and Vassilvitskii, S","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.23967","last_updated":"2025-05-29T19:47:09Z","snapshot_observed_at":"2026-08-07T12:35:42.886469Z","submitted_at":"2025-05-29T19:47:09Z","title":"Improved Approximations for Hard Graph Problems using Predictions","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T12:55:25.962031Z"},"links":{"citing_paper":"/paper/2505.23967"},"observation_digest":"sha256:94bbd25893a32b1fd6d4ea42e1e1c7d023ab23c7330bdd7bc49c2f3b14c0eacc","observation_id":"01b4db1d-2531-48cc-a8ac-62b2bad13ce2","resolution":{"observed_at":"2026-08-07T12:55:25.962031Z","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-07T12:55:27.302230Z","title":"and Sarkar, R","venue":null,"work_id":"bb873e97-0563-4871-ac0e-f4fc88afd6a3","year":2021},"citing_paper":{"arxiv_id":"2505.23967","last_updated":"2025-05-29T19:47:09Z","snapshot_observed_at":"2026-08-07T12:35:42.886469Z","submitted_at":"2025-05-29T19:47:09Z","title":"Improved Approximations for Hard Graph Problems using Predictions","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T12:55:25.967594Z"},"links":{"citing_paper":"/paper/2505.23967"},"observation_digest":"sha256:389ed0cb51e3d13fec56be2821ec1ad87a20450dfe1c4a9b684177a96f19e5cf","observation_id":"b07f97bf-5396-452c-a3d9-23c74b4d155d","resolution":{"observed_at":"2026-08-07T12:55:27.387360Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"0752.38083","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:55:26.536765Z","title":"Non-approximability results for optimization problems on bounded degree instances","venue":null,"work_id":"794c79dd-432e-43c7-a279-8274d73b5965","year":2001},"citing_paper":{"arxiv_id":"2505.23967","last_updated":"2025-05-29T19:47:09Z","snapshot_observed_at":"2026-08-07T12:35:42.886469Z","submitted_at":"2025-05-29T19:47:09Z","title":"Improved Approximations for Hard Graph Problems using Predictions","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T12:55:26.007820Z"},"links":{"citing_paper":"/paper/2505.23967"},"observation_digest":"sha256:7ca71c4ded637469ae032bfaa6461465b80356cba5f81ca0dba8b362be36d8cd","observation_id":"415e15f6-7127-4dda-a0de-2a4bb9e26360","resolution":{"observed_at":"2026-08-07T12:55:26.602397Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T12:55:27.160912Z","title":null,"venue":null,"work_id":"5d0c0a76-1f89-4e5c-bcba-03afeba68f16","year":2011},"citing_paper":{"arxiv_id":"2505.23967","last_updated":"2025-05-29T19:47:09Z","snapshot_observed_at":"2026-08-07T12:35:42.886469Z","submitted_at":"2025-05-29T19:47:09Z","title":"Improved Approximations for Hard Graph Problems using Predictions","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T12:55:26.124780Z"},"links":{"citing_paper":"/paper/2505.23967"},"observation_digest":"sha256:3b9ac8c94136d45f366a7a6ab53e2eb2abcad8179bc5ee27dec748ffb3097734","observation_id":"3662aaa8-90bd-48ee-8986-aadd4dd64267","resolution":{"observed_at":"2026-08-07T12:55:27.211825Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.23967","last_updated":"2025-05-29T19:47:09Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T12:35:42.886469Z","submitted_at":"2025-05-29T19:47:09Z","title":"Improved Approximations for Hard Graph Problems using Predictions"},"reference_resolution":{"displayed":30,"state_counts":{"malformed_identifier":0,"metadata_mismatch":3,"parse_uncertain":0,"unresolved":14,"verified_exact":1,"verified_fuzzy":12},"total_outbound_references":30},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 1 inbound Pith citation observation for arXiv:2505.23967."}