{"as_of":"2026-08-11T01:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:98fba9f83c63912fe60d776a8d55893a09d49980c7b2d68a75e5f02d477c21aa","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T17:46:06.520061Z","state":"measured"},{"denominator":26,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":26,"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:55.546368Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.00841","last_updated":"2025-02-02T16:26:23Z","snapshot_observed_at":"2026-08-09T17:29:23.506776Z","submitted_at":"2025-02-02T16:26:23Z","title":"Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.00841","snapshot_observed_at":"2026-08-02T01:57:55.546368Z","title":"Polynomial time learning-augmented algorithms for np-hard permutation problems","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":8,"source":"arxiv_source","source_observed_at":"2026-08-02T01:57:55.546368Z"},"links":{"cited_paper":"/paper/2502.00841","citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:b17316f449ac3747d1c8e91767814655cb273e7b0efc7bc3b672474e553af4ac","observation_id":"b18f44ed-6c9e-49e6-846a-bd41667c8c3d","resolution":{"observed_at":"2026-08-02T01:57:55.546368Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2502.00841/citation-record","integrity":"/paper/2502.00841/integrity","json":"/paper/2502.00841/citation-record.json","paper":"/paper/2502.00841"},"outbound":[{"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-09T17:46:06.429944Z","title":"Approximation algorithms for combinatorial optimization with predictions, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.00841","last_updated":"2025-02-02T16:26:23Z","snapshot_observed_at":"2026-08-09T17:29:23.506776Z","submitted_at":"2025-02-02T16:26:23Z","title":"Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-09T17:46:06.429944Z"},"links":{"cited_paper":"/paper/2411.16600","citing_paper":"/paper/2502.00841"},"observation_digest":"sha256:09f8a80fa8428965fede052ac510bbd7c0610290134869326d6470f5f917faca","observation_id":"bd5a9d76-e1b1-4487-aa7a-2908c82976e1","resolution":{"observed_at":"2026-08-09T17:46:06.429944Z","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-09T17:46:06.837906Z","title":"Parsimonious learning-augmented approximations for dense instances of NP -hard problems","venue":null,"work_id":"b89c3ffa-4362-478d-8a48-bec91f3e5c82","year":2024},"citing_paper":{"arxiv_id":"2502.00841","last_updated":"2025-02-02T16:26:23Z","snapshot_observed_at":"2026-08-09T17:29:23.506776Z","submitted_at":"2025-02-02T16:26:23Z","title":"Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-09T17:46:06.434270Z"},"links":{"citing_paper":"/paper/2502.00841"},"observation_digest":"sha256:975903a4cfa0635c2346c33a9a5c402663dd72134d790386081bb5e2d374ce2f","observation_id":"b0414d79-0eb7-4506-ba53-2b83f36e1636","resolution":{"observed_at":"2026-08-09T17:46:06.841837Z","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-09T17:46:06.827159Z","title":"Noisy sorting without resampling","venue":null,"work_id":"2d5c7de9-7b43-4e7b-8011-a456d395e67b","year":2008},"citing_paper":{"arxiv_id":"2502.00841","last_updated":"2025-02-02T16:26:23Z","snapshot_observed_at":"2026-08-09T17:29:23.506776Z","submitted_at":"2025-02-02T16:26:23Z","title":"Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-09T17:46:06.437745Z"},"links":{"citing_paper":"/paper/2502.00841"},"observation_digest":"sha256:5e5414961ff2fc0826c9c9eadb77a4381d646dda16c33f7fbfe1d2caad0637be","observation_id":"5c28c5c7-97ca-4fd1-9862-01d9cf742b43","resolution":{"observed_at":"2026-08-09T17:46:06.831321Z","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":{"arxiv_id":"0910.1191","last_updated":"2009-10-07T09:14:54Z","snapshot_observed_at":"2026-08-06T01:39:26.907088Z","submitted_at":"2009-10-07T09:14:54Z","title":"Sorting from Noisy Information","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0910.1191","snapshot_observed_at":"2026-08-09T17:46:06.441228Z","title":"Sorting from noisy information, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2502.00841","last_updated":"2025-02-02T16:26:23Z","snapshot_observed_at":"2026-08-09T17:29:23.506776Z","submitted_at":"2025-02-02T16:26:23Z","title":"Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-09T17:46:06.441228Z"},"links":{"cited_paper":"/paper/0910.1191","citing_paper":"/paper/2502.00841"},"observation_digest":"sha256:a0ffb7f5a9ac69aecdd3252e39eb418ba1d88db20ef240665e3d045ec01a9267","observation_id":"26c8e62e-8e3e-437c-84e6-c10b012814fe","resolution":{"observed_at":"2026-08-09T17:46:06.441228Z","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-09T17:46:06.816567Z","title":"Learning-Augmented Maximum Independent Set","venue":null,"work_id":"a316f12f-7aee-4b4e-bb89-f15714169e2e","year":2024},"citing_paper":{"arxiv_id":"2502.00841","last_updated":"2025-02-02T16:26:23Z","snapshot_observed_at":"2026-08-09T17:29:23.506776Z","submitted_at":"2025-02-02T16:26:23Z","title":"Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-09T17:46:06.445604Z"},"links":{"citing_paper":"/paper/2502.00841"},"observation_digest":"sha256:207bbdc6cac0430edffe869d328b5eb85563ed5e2d79af2c1c0a9ddd7a5aa232","observation_id":"d81b246f-5525-4b66-bfd7-e2ab4d9a535b","resolution":{"observed_at":"2026-08-09T17:46:06.820152Z","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":{"arxiv_id":"2402.18263","last_updated":"2024-02-28T11:51:28Z","snapshot_observed_at":"2026-08-06T00:20:46.758193Z","submitted_at":"2024-02-28T11:51:28Z","title":"Max-Cut with $\\epsilon$-Accurate Predictions","version":1},"cited_work":{"arxiv_id":"2402.18263","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.18263","snapshot_observed_at":"2026-08-09T17:46:06.591491Z","title":"Max-Cut with $\\epsilon$-Accurate Predictions","venue":"cs.DS","work_id":"32337723-cf4c-4f51-9758-f682e16d2c25","year":2024},"citing_paper":{"arxiv_id":"2502.00841","last_updated":"2025-02-02T16:26:23Z","snapshot_observed_at":"2026-08-09T17:29:23.506776Z","submitted_at":"2025-02-02T16:26:23Z","title":"Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-09T17:46:06.449371Z"},"links":{"cited_paper":"/paper/2402.18263","citing_paper":"/paper/2502.00841"},"observation_digest":"sha256:89fa81bdd8449cf183892331c04809e84c8f226ad5e0c061d74b08bab09dd764","observation_id":"07774c55-5669-48ab-a624-02999e396a0a","resolution":{"observed_at":"2026-08-09T17:46:06.595897Z","resolver_source":"local_arxiv","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T17:46:06.805083Z","title":"Faster matchings via learned duals","venue":null,"work_id":"bbe3aaf6-7bd1-4393-bf77-208dde126568","year":2021},"citing_paper":{"arxiv_id":"2502.00841","last_updated":"2025-02-02T16:26:23Z","snapshot_observed_at":"2026-08-09T17:29:23.506776Z","submitted_at":"2025-02-02T16:26:23Z","title":"Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-09T17:46:06.453257Z"},"links":{"citing_paper":"/paper/2502.00841"},"observation_digest":"sha256:2665607dc198d9b55a6ee2c43062640d34bdfa5eb07227ecd3319c847f7dac74","observation_id":"a04ad9b6-5f09-48d9-8e8e-3112430d2e99","resolution":{"observed_at":"2026-08-09T17:46:06.809642Z","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":{"arxiv_id":"2412.09773","last_updated":"2025-01-04T04:45:25Z","snapshot_observed_at":"2026-07-06T20:06:17.706151Z","submitted_at":"2024-12-13T00:44:47Z","title":"Learning-Augmented Streaming Algorithms for Approximating MAX-CUT","version":2},"cited_work":{"arxiv_id":"2412.09773","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.09773","snapshot_observed_at":"2026-08-09T17:46:06.573936Z","title":"Learning-Augmented Streaming Algorithms for Approximating MAX-CUT","venue":"cs.DS","work_id":"8ca7bb74-44af-48f2-912e-ca7a3b297435","year":2024},"citing_paper":{"arxiv_id":"2502.00841","last_updated":"2025-02-02T16:26:23Z","snapshot_observed_at":"2026-08-09T17:29:23.506776Z","submitted_at":"2025-02-02T16:26:23Z","title":"Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-09T17:46:06.456645Z"},"links":{"cited_paper":"/paper/2412.09773","citing_paper":"/paper/2502.00841"},"observation_digest":"sha256:68308315a3f5221e8932cd51b4c514823e933fcd190bd2b22d8b136bbfdb186b","observation_id":"60eac726-8e7e-49fb-a8df-a31cbd104b45","resolution":{"observed_at":"2026-08-09T17:46:06.578696Z","resolver_source":"local_arxiv","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T17:46:06.792553Z","title":"Internet Advertising and the Generalized Second-Price Auction: Selling Billions of Dollars Worth of Keywords","venue":null,"work_id":"c7f386c4-2708-4476-bd36-bdb04a9aceb8","year":2007},"citing_paper":{"arxiv_id":"2502.00841","last_updated":"2025-02-02T16:26:23Z","snapshot_observed_at":"2026-08-09T17:29:23.506776Z","submitted_at":"2025-02-02T16:26:23Z","title":"Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-09T17:46:06.460496Z"},"links":{"citing_paper":"/paper/2502.00841"},"observation_digest":"sha256:d2482b49f6586af0ef2b9814e4c8ce3872b3e86e218baf83f59b09dde1c9d5b3","observation_id":"d251cd28-c7f8-49f1-9e2f-7418596d9973","resolution":{"observed_at":"2026-08-09T17:46:06.796518Z","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-09T17:46:06.781374Z","title":"Ergun, Zhili Feng, Sandeep Silwal, David Woodruff, and Samson Zhou","venue":null,"work_id":"bebc2cdb-d254-452a-9928-277184b6279d","year":2022},"citing_paper":{"arxiv_id":"2502.00841","last_updated":"2025-02-02T16:26:23Z","snapshot_observed_at":"2026-08-09T17:29:23.506776Z","submitted_at":"2025-02-02T16:26:23Z","title":"Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-09T17:46:06.463879Z"},"links":{"citing_paper":"/paper/2502.00841"},"observation_digest":"sha256:2ebca82e75d0d84d148e98f64532d2e1ca3101cb45e3f05e07baac11772ae1fc","observation_id":"7069c198-88ec-47be-bd77-8645629860a9","resolution":{"observed_at":"2026-08-09T17:46:06.785214Z","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-09T17:46:06.770957Z","title":"Externalities among advertisers in sponsored search","venue":null,"work_id":"65ccf85a-509e-4e37-88e5-d01ffe1655bc","year":2011},"citing_paper":{"arxiv_id":"2502.00841","last_updated":"2025-02-02T16:26:23Z","snapshot_observed_at":"2026-08-09T17:29:23.506776Z","submitted_at":"2025-02-02T16:26:23Z","title":"Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-09T17:46:06.467234Z"},"links":{"citing_paper":"/paper/2502.00841"},"observation_digest":"sha256:ca01cd49b02ad600cc698b5b80bfaea6e0a1a7b72117196c5d9abfbeedc6c428","observation_id":"5e7f6b17-28b9-44c8-a8e2-edc5b7ae4973","resolution":{"observed_at":"2026-08-09T17:46:06.774529Z","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-09T17:46:06.760105Z","title":"Approximate cluster recovery from noisy labels","venue":null,"work_id":"5cb39c63-ac8b-40c6-bf8d-ad0db6b28bf2","year":2022},"citing_paper":{"arxiv_id":"2502.00841","last_updated":"2025-02-02T16:26:23Z","snapshot_observed_at":"2026-08-09T17:29:23.506776Z","submitted_at":"2025-02-02T16:26:23Z","title":"Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-09T17:46:06.470442Z"},"links":{"citing_paper":"/paper/2502.00841"},"observation_digest":"sha256:df8f7f63d89fc82f016f2c5f28d74557f05e261340ac673254870bbbd2c29b79","observation_id":"0b78d5e1-945c-4f65-a019-ad29c2c18fbf","resolution":{"observed_at":"2026-08-09T17:46:06.763912Z","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-09T17:46:06.748601Z","title":"Towards better models of externalities in sponsored search auctions","venue":null,"work_id":"355fc4f6-179e-429f-bab7-1e066e8d12f8","year":2018},"citing_paper":{"arxiv_id":"2502.00841","last_updated":"2025-02-02T16:26:23Z","snapshot_observed_at":"2026-08-09T17:29:23.506776Z","submitted_at":"2025-02-02T16:26:23Z","title":"Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-09T17:46:06.474125Z"},"links":{"citing_paper":"/paper/2502.00841"},"observation_digest":"sha256:824782c3cfccbdd9187d4f31178529fe7985b1fc7a16cfc6703fcc6aed155375","observation_id":"c92960cd-2fa4-4c99-a926-84afd9733999","resolution":{"observed_at":"2026-08-09T17:46:06.752489Z","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":{"arxiv_id":"2403.02212","last_updated":"2024-07-29T19:40:36Z","snapshot_observed_at":"2026-08-02T19:28:16.464969Z","submitted_at":"2024-03-04T17:00:31Z","title":"Constraint Satisfaction Problems with Advice","version":2},"cited_work":{"arxiv_id":"2403.02212","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.02212","snapshot_observed_at":"2026-08-09T17:46:06.553218Z","title":"Constraint Satisfaction Problems with Advice","venue":"cs.DS","work_id":"3aa12a5d-6fcb-43f9-b680-a9264cdaaae1","year":2024},"citing_paper":{"arxiv_id":"2502.00841","last_updated":"2025-02-02T16:26:23Z","snapshot_observed_at":"2026-08-09T17:29:23.506776Z","submitted_at":"2025-02-02T16:26:23Z","title":"Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-09T17:46:06.477856Z"},"links":{"cited_paper":"/paper/2403.02212","citing_paper":"/paper/2502.00841"},"observation_digest":"sha256:c11ab8ec7ad19ad230f9c50a4d27e50c22c8f0662163c006654c8fc93241d846","observation_id":"26e2e2d4-7db6-4794-b257-c6c25b0d6a1e","resolution":{"observed_at":"2026-08-09T17:46:06.560080Z","resolver_source":"local_arxiv","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T17:46:06.737419Z","title":"Parsimonious learning-augmented caching","venue":null,"work_id":"40d63d42-05c1-48ad-9c56-b021cdc39e95","year":2022},"citing_paper":{"arxiv_id":"2502.00841","last_updated":"2025-02-02T16:26:23Z","snapshot_observed_at":"2026-08-09T17:29:23.506776Z","submitted_at":"2025-02-02T16:26:23Z","title":"Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-09T17:46:06.482098Z"},"links":{"citing_paper":"/paper/2502.00841"},"observation_digest":"sha256:6ec8988f0a773c0dab12f792ebcb73a27db7f0e2f4335cf07398ec3e159d7b4e","observation_id":"1a380bfe-994e-411e-b412-2a239c7343df","resolution":{"observed_at":"2026-08-09T17:46:06.741894Z","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-09T17:46:06.726833Z","title":"Which problems have strongly exponential complexity? J","venue":null,"work_id":"e8a2a83d-2d0e-4ac0-a2e1-7782fefb64a3","year":2001},"citing_paper":{"arxiv_id":"2502.00841","last_updated":"2025-02-02T16:26:23Z","snapshot_observed_at":"2026-08-09T17:29:23.506776Z","submitted_at":"2025-02-02T16:26:23Z","title":"Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-09T17:46:06.485898Z"},"links":{"citing_paper":"/paper/2502.00841"},"observation_digest":"sha256:ed4a6cf90068b586af2bf614f1a3d60c47adef9a73f8d0e252f441bb78e72616","observation_id":"bb65ae2d-0d8c-4375-bf94-d58803dee7c0","resolution":{"observed_at":"2026-08-09T17:46:06.730500Z","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-09T17:46:06.715743Z","title":null,"venue":null,"work_id":"5c62e212-a2e5-4bab-8efc-71116f1bee9d","year":1972},"citing_paper":{"arxiv_id":"2502.00841","last_updated":"2025-02-02T16:26:23Z","snapshot_observed_at":"2026-08-09T17:29:23.506776Z","submitted_at":"2025-02-02T16:26:23Z","title":"Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-09T17:46:06.489542Z"},"links":{"citing_paper":"/paper/2502.00841"},"observation_digest":"sha256:51db5b86b18a0b1f40557ef55d9ed5858c56227d80ce8e1f79a9244b2ef8afa3","observation_id":"d635e958-d2c1-4492-b981-7a3d4b120e17","resolution":{"observed_at":"2026-08-09T17:46:06.719608Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T17:46:06.705148Z","title":null,"venue":null,"work_id":"c4a149a7-96ca-4ba0-8784-a56f0c5f9c59","year":1978},"citing_paper":{"arxiv_id":"2502.00841","last_updated":"2025-02-02T16:26:23Z","snapshot_observed_at":"2026-08-09T17:29:23.506776Z","submitted_at":"2025-02-02T16:26:23Z","title":"Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-09T17:46:06.493269Z"},"links":{"citing_paper":"/paper/2502.00841"},"observation_digest":"sha256:684d4c20d33cb747935eac02087f1895a730bcf658578b43dfcee0822eb41e93","observation_id":"0a5879a2-c633-4059-b4a8-b5dbef52c220","resolution":{"observed_at":"2026-08-09T17:46:06.708697Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T17:46:06.694491Z","title":null,"venue":null,"work_id":"bccf7683-6414-486d-8e7a-c83f545a017a","year":null},"citing_paper":{"arxiv_id":"2502.00841","last_updated":"2025-02-02T16:26:23Z","snapshot_observed_at":"2026-08-09T17:29:23.506776Z","submitted_at":"2025-02-02T16:26:23Z","title":"Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-09T17:46:06.496988Z"},"links":{"citing_paper":"/paper/2502.00841"},"observation_digest":"sha256:33d2896681bab584242d0fc906ca118d76144c5e57d5085806d6f05804c8612d","observation_id":"36f5b6c8-498e-4a71-8095-a4eb40279385","resolution":{"observed_at":"2026-08-09T17:46:06.698208Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T17:46:06.682359Z","title":"Slightly superexponential parameterized problems","venue":null,"work_id":"7fbbe0a4-4411-4594-875f-96682cff83bd","year":2018},"citing_paper":{"arxiv_id":"2502.00841","last_updated":"2025-02-02T16:26:23Z","snapshot_observed_at":"2026-08-09T17:29:23.506776Z","submitted_at":"2025-02-02T16:26:23Z","title":"Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-09T17:46:06.500784Z"},"links":{"citing_paper":"/paper/2502.00841"},"observation_digest":"sha256:fbb83899b19b57de18a63f4ade607c97849d5671ed789942cdcae8e43c23c855","observation_id":"d5655453-7e16-42ca-b54d-8374aeb76205","resolution":{"observed_at":"2026-08-09T17:46:06.686425Z","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-09T17:46:06.670223Z","title":"Competitive caching with machine learned advice","venue":null,"work_id":"ee73ef3a-36f6-4fce-abff-4aca83edd246","year":2021},"citing_paper":{"arxiv_id":"2502.00841","last_updated":"2025-02-02T16:26:23Z","snapshot_observed_at":"2026-08-09T17:29:23.506776Z","submitted_at":"2025-02-02T16:26:23Z","title":"Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-09T17:46:06.504633Z"},"links":{"citing_paper":"/paper/2502.00841"},"observation_digest":"sha256:7f3c747b46615b9d2e5dc8d209a717835139315f8333dd25a931cb309fe9cde9","observation_id":"ef819049-32ad-43ed-a692-b690b06ff85d","resolution":{"observed_at":"2026-08-09T17:46:06.674265Z","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-09T17:46:06.658614Z","title":"Allocating online advertisement space with unreliable estimates","venue":null,"work_id":"b5b5c56f-31da-44a4-aac1-4f6fc52eabf9","year":2007},"citing_paper":{"arxiv_id":"2502.00841","last_updated":"2025-02-02T16:26:23Z","snapshot_observed_at":"2026-08-09T17:29:23.506776Z","submitted_at":"2025-02-02T16:26:23Z","title":"Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-09T17:46:06.508495Z"},"links":{"citing_paper":"/paper/2502.00841"},"observation_digest":"sha256:dfa7c337991e738243355623549d5d7bb64893ae382332f7baae759d2640261e","observation_id":"acc7069f-9eab-4b32-81a6-129e53e98379","resolution":{"observed_at":"2026-08-09T17:46:06.662746Z","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-09T17:46:06.646260Z","title":"Improved learning-augmented algorithms for k-means and k-medians clustering","venue":null,"work_id":"f8d3dd0d-7eef-48ba-be77-9b88910620e5","year":2023},"citing_paper":{"arxiv_id":"2502.00841","last_updated":"2025-02-02T16:26:23Z","snapshot_observed_at":"2026-08-09T17:29:23.506776Z","submitted_at":"2025-02-02T16:26:23Z","title":"Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-09T17:46:06.512339Z"},"links":{"citing_paper":"/paper/2502.00841"},"observation_digest":"sha256:58e6faafd156a189cdf7a0f978142db717691e2f8412fde44555106c3f2484e3","observation_id":"8454d081-102c-4d68-a8ba-f03900ce1f05","resolution":{"observed_at":"2026-08-09T17:46:06.650554Z","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-09T17:46:06.634265Z","title":"Discrete-convex-analysis-based framework for warm-starting algorithms with predictions","venue":null,"work_id":"51988af2-b2f1-4b8b-aa43-ede6dd7a7816","year":2022},"citing_paper":{"arxiv_id":"2502.00841","last_updated":"2025-02-02T16:26:23Z","snapshot_observed_at":"2026-08-09T17:29:23.506776Z","submitted_at":"2025-02-02T16:26:23Z","title":"Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-09T17:46:06.516359Z"},"links":{"citing_paper":"/paper/2502.00841"},"observation_digest":"sha256:6ad3d8bd458415fff121e7c33d8147b71d84c3460c11d0606e21d7bcfceb9545","observation_id":"04a2e589-7ca6-4463-9aeb-5b0477eb23f4","resolution":{"observed_at":"2026-08-09T17:46:06.638177Z","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-09T17:46:06.623872Z","title":null,"venue":null,"work_id":"08ee3be4-9f40-4123-a2cd-3e43a27932dc","year":2007},"citing_paper":{"arxiv_id":"2502.00841","last_updated":"2025-02-02T16:26:23Z","snapshot_observed_at":"2026-08-09T17:29:23.506776Z","submitted_at":"2025-02-02T16:26:23Z","title":"Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-09T17:46:06.520061Z"},"links":{"citing_paper":"/paper/2502.00841"},"observation_digest":"sha256:c6bba9def0e2a397bd8ea3eba78d6b11d487dea64ee4fa56fba937d6d2af96cc","observation_id":"359454a2-2b0d-47c9-bd68-49b95af16adc","resolution":{"observed_at":"2026-08-09T17:46:06.627384Z","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":"2502.00841","last_updated":"2025-02-02T16:26:23Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-09T17:29:23.506776Z","submitted_at":"2025-02-02T16:26:23Z","title":"Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":3,"verified_fuzzy":16},"total_outbound_references":25},"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 11 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 1 inbound Pith citation observation for arXiv:2502.00841."}