Paper Citation Record · LEDGER

Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2502.00841 v1

Coverage vector

measured 25 of 25 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-09T17:46:06.520061Z

measured 26 of 26 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-10T06:31:04.303077+00:00

measured 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-02T01:57:55.546368Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

25 of 25 outbound references displayed

verified exact3
verified fuzzy16
unresolved6
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation bd5a9d76-e1b1-4487-aa7a-2908c82976e1 · outbound

This paper cites Approximation Algorithms for Combinatorial Optimization with Predictions.

Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems Approximation Algorithms for Combinatorial Optimization with Predictions

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-09T17:46:06.429944Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b0414d79-0eb7-4506-ba53-2b83f36e1636 · outbound

This paper cites Parsimonious learning-augmented approximations for dense instances of NP -hard problems.

Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems Parsimonious learning-augmented approximations for dense instances of NP -hard problems

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-09T17:46:06.841837Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 5c28c5c7-97ca-4fd1-9862-01d9cf742b43 · outbound

This paper cites Noisy sorting without resampling.

Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems Noisy sorting without resampling

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-09T17:46:06.831321Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 26c8e62e-8e3e-437c-84e6-c10b012814fe · outbound

This paper cites Sorting from Noisy Information.

Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems Sorting from Noisy Information

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-09T17:46:06.441228Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d81b246f-5525-4b66-bfd7-e2ab4d9a535b · outbound

This paper cites Learning-Augmented Maximum Independent Set.

Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems Learning-Augmented Maximum Independent Set

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-09T17:46:06.820152Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 07774c55-5669-48ab-a624-02999e396a0a · outbound

This paper cites Max-Cut with $\epsilon$-Accurate Predictions.

Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems Max-Cut with $\epsilon$-Accurate Predictions

Reference 6

Resolution: verified exact; local_arxiv, observed 2026-08-09T17:46:06.595897Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation a04ad9b6-5f09-48d9-8e8e-3112430d2e99 · outbound

This paper cites Faster matchings via learned duals.

Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems Faster matchings via learned duals

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-09T17:46:06.809642Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 60eac726-8e7e-49fb-a8df-a31cbd104b45 · outbound

This paper cites Learning-Augmented Streaming Algorithms for Approximating MAX-CUT.

Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems Learning-Augmented Streaming Algorithms for Approximating MAX-CUT

Reference 8

Resolution: verified exact; local_arxiv, observed 2026-08-09T17:46:06.578696Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation d251cd28-c7f8-49f1-9e2f-7418596d9973 · outbound

This paper cites Internet Advertising and the Generalized Second-Price Auction: Selling Billions of Dollars Worth of Keywords.

Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems Internet Advertising and the Generalized Second-Price Auction: Selling Billions of Dollars Worth of Keywords

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-09T17:46:06.796518Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 7069c198-88ec-47be-bd77-8645629860a9 · outbound

This paper cites Ergun, Zhili Feng, Sandeep Silwal, David Woodruff, and Samson Zhou.

Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems Ergun, Zhili Feng, Sandeep Silwal, David Woodruff, and Samson Zhou

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-09T17:46:06.785214Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 5e7f6b17-28b9-44c8-a8e2-edc5b7ae4973 · outbound

This paper cites Externalities among advertisers in sponsored search.

Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems Externalities among advertisers in sponsored search

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-09T17:46:06.774529Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 0b78d5e1-945c-4f65-a019-ad29c2c18fbf · outbound

This paper cites Approximate cluster recovery from noisy labels.

Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems Approximate cluster recovery from noisy labels

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-09T17:46:06.763912Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation c92960cd-2fa4-4c99-a926-84afd9733999 · outbound

This paper cites Towards better models of externalities in sponsored search auctions.

Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems Towards better models of externalities in sponsored search auctions

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-09T17:46:06.752489Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 26e2e2d4-7db6-4794-b257-c6c25b0d6a1e · outbound

This paper cites Constraint Satisfaction Problems with Advice.

Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems Constraint Satisfaction Problems with Advice

Reference 14

Resolution: verified exact; local_arxiv, observed 2026-08-09T17:46:06.560080Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 1a380bfe-994e-411e-b412-2a239c7343df · outbound

This paper cites Parsimonious learning-augmented caching.

Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems Parsimonious learning-augmented caching

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-09T17:46:06.741894Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation bb65ae2d-0d8c-4375-bf94-d58803dee7c0 · outbound

This paper cites Which problems have strongly exponential complexity? J.

Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems Which problems have strongly exponential complexity? J

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-09T17:46:06.730500Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation d635e958-d2c1-4492-b981-7a3d4b120e17 · outbound

This paper cites an unresolved cited work.

Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems Unresolved cited work

Reference 17

Resolution: unresolved; raw_fallback, observed 2026-08-09T17:46:06.719608Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 0a5879a2-c633-4059-b4a8-b5dbef52c220 · outbound

This paper cites an unresolved cited work.

Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems Unresolved cited work

Reference 18

Resolution: unresolved; raw_fallback, observed 2026-08-09T17:46:06.708697Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 36f5b6c8-498e-4a71-8095-a4eb40279385 · outbound

This paper cites an unresolved cited work.

Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems Unresolved cited work

Reference 19

Resolution: unresolved; raw_fallback, observed 2026-08-09T17:46:06.698208Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation d5655453-7e16-42ca-b54d-8374aeb76205 · outbound

This paper cites Slightly superexponential parameterized problems.

Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems Slightly superexponential parameterized problems

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-09T17:46:06.686425Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation ef819049-32ad-43ed-a692-b690b06ff85d · outbound

This paper cites Competitive caching with machine learned advice.

Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems Competitive caching with machine learned advice

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-09T17:46:06.674265Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation acc7069f-9eab-4b32-81a6-129e53e98379 · outbound

This paper cites Allocating online advertisement space with unreliable estimates.

Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems Allocating online advertisement space with unreliable estimates

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-09T17:46:06.662746Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 8454d081-102c-4d68-a8ba-f03900ce1f05 · outbound

This paper cites Improved learning-augmented algorithms for k-means and k-medians clustering.

Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems Improved learning-augmented algorithms for k-means and k-medians clustering

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-09T17:46:06.650554Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 04a2e589-7ca6-4463-9aeb-5b0477eb23f4 · outbound

This paper cites Discrete-convex-analysis-based framework for warm-starting algorithms with predictions.

Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems Discrete-convex-analysis-based framework for warm-starting algorithms with predictions

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-09T17:46:06.638177Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 359454a2-2b0d-47c9-bd68-49b95af16adc · outbound

This paper cites an unresolved cited work.

Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems Unresolved cited work

Reference 25

Resolution: unresolved; raw_fallback, observed 2026-08-09T17:46:06.627384Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Pith citing papers

Observation b18f44ed-6c9e-49e6-846a-bd41667c8c3d · inbound

CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees cites this paper.

CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-02T01:57:55.546368Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.