Pith. sign in

Paper Citation Record · LEDGER

Improved Approximations for Hard Graph Problems using Predictions

As of 18 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 1 inbound Pith citation observation for arXiv:2505.23967.

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

pith.paper-citation-record.v1
2505.23967 v1

Coverage vector

measured 30 of 30 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-07T12:55:26.124780Z

measured 31 of 31 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-18T06:34:40.430872+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:54.641353Z

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

30 of 30 outbound references displayed

  • verified exact1
  • verified fuzzy12
  • unresolved14
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch3

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation b9f02217-ace2-4d34-9f9f-922a19680369 · outbound

This paper cites write newline.

Improved Approximations for Hard Graph Problems using Predictions write newline

Reference 1

Resolution
unresolved
no resolver link, observed 2026-08-07T12:55:23.716377Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T12:55:23.716377Z digest=sha256:a0cb58b1b72f04b96cd32ac3af697513cc7e27c2f0667585f393aafd97ad6893

Observation 7a204478-25ca-43d8-9b0f-57f581e12717 · outbound

This paper cites Approximation Algorithms for Combinatorial Optimization with Predictions.

Improved Approximations for Hard Graph Problems using Predictions Approximation Algorithms for Combinatorial Optimization with Predictions

Reference 2

Resolution
unresolved
no resolver link, observed 2026-08-07T12:55:23.764531Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T12:55:23.764531Z digest=sha256:dde4e3fb6493d2dd96c533bb24111609788275d660eec113f54f8891fc6b3ccf

Observation 143d1b69-de5b-4e07-b10a-f04e732e87cf · outbound

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

Improved Approximations for Hard Graph Problems using Predictions Parsimonious learning-augmented approximations for dense instances of np-hard problems

Reference 3

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T12:55:28.483164Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-07T12:55:23.828876Z digest=sha256:e21258e90511bd5f92cd268d33946af4601008b9a3d442d64012071fb694c5e4

Observation 6de52d81-032c-4655-82bc-79a98f9757d7 · outbound

This paper cites Learning-augmented maximum independent set.

Improved Approximations for Hard Graph Problems using Predictions Learning-augmented maximum independent set

Reference 4

Resolution
unresolved
no resolver link, observed 2026-08-07T12:55:23.910973Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T12:55:23.910973Z digest=sha256:fd75c3043233c56b08c40085f28bd0902184a7683827ddcb1eeeadcb51989a71

Observation 842dc07b-c0be-419c-aa4a-d1ecba5fcfa1 · outbound

This paper cites Faster fundamental graph algorithms via learned predictions.

Improved Approximations for Hard Graph Problems using Predictions Faster fundamental graph algorithms via learned predictions

Reference 5

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T12:55:28.348321Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-07T12:55:23.981810Z digest=sha256:06da3eb8b0531e11cd2715c9d9a23076bfd1620d4bc37a75c0bdaee5a21681ef

Observation 9b519cf3-a982-4fff-8d06-973a88e70550 · outbound

This paper cites Y., Eden, T., Indyk, P., Lin, H., Narayanan, S., Rubinfeld, R., Silwal, S., Wagner, T., Woodruff, D., and Zhang, M.

Improved Approximations for Hard Graph Problems using Predictions Y., Eden, T., Indyk, P., Lin, H., Narayanan, S., Rubinfeld, R., Silwal, S., Wagner, T., Woodruff, D., and Zhang, M

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T12:55:28.249184Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-07T12:55:24.059110Z digest=sha256:b5cdc68c926a72728e06856e654cf6ff4088167d90e68aa1f5bd4d46280f8123

Observation b558da8b-201e-42ac-b170-346dc4c778b9 · outbound

This paper cites A greedy heuristic for the set-covering problem.

Improved Approximations for Hard Graph Problems using Predictions A greedy heuristic for the set-covering problem

Reference 7

Resolution
unresolved
no resolver link, observed 2026-08-07T12:55:24.124375Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T12:55:24.124375Z digest=sha256:45d6fc51669583525ab1933db7f377f1b17de72e0b3ee2ebcdebcb95434481a4

Observation 32aaeaeb-5607-4afe-933a-fca4240d8190 · outbound

This paper cites Learning-augmented approximation algorithms for maximum cut and related problems.

Improved Approximations for Hard Graph Problems using Predictions Learning-augmented approximation algorithms for maximum cut and related problems

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T12:55:28.113907Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-07T12:55:24.200580Z digest=sha256:90205ca2d633eabb4087a78e04e9a603159f3ae4bb0d30eb2e35a175f1226055

Observation f69ff4ac-1117-413b-a404-6c7efa4f6259 · outbound

This paper cites an unresolved cited work.

Improved Approximations for Hard Graph Problems using Predictions Unresolved cited work

Reference 9

Resolution
unresolved
raw_fallback, observed 2026-08-07T12:55:28.081962Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-07T12:55:24.262554Z digest=sha256:d7ee22941c89b3f8772b84adb032eb8cd9bf45f928cbd8412195069713268a95

Observation 6348b4b6-e1ef-408b-b5ef-191578c1aa26 · outbound

This paper cites and Steurer, D.

Improved Approximations for Hard Graph Problems using Predictions and Steurer, D

Reference 10

Resolution
unresolved
no resolver link, observed 2026-08-07T12:55:24.319724Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T12:55:24.319724Z digest=sha256:93997a85a4104f88d238b4526c0682090e33d49eb9debf2f6dad38ba3c412cd1

Observation 255d1105-9ce9-4cd0-9b60-f4c67237718f · outbound

This paper cites C., Feng, Z., Silwal, S., Woodruff, D., and Zhou, S.

Improved Approximations for Hard Graph Problems using Predictions C., Feng, Z., Silwal, S., Woodruff, D., and Zhou, S

Reference 11

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T12:55:28.044531Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-07T12:55:24.370540Z digest=sha256:0d38eaf6a6ba0daf3e40a199bb8df397d74cb7df7c860ec754f9433b26cbdd6b

Observation 4b161109-7027-4beb-a27d-78045a4bb47a · outbound

This paper cites G., Fullin, K., Gutierrez, G., Omodt, N., Zinnecker, S., Sprint, G., and McCulloch, S.

Improved Approximations for Hard Graph Problems using Predictions G., Fullin, K., Gutierrez, G., Omodt, N., Zinnecker, S., Sprint, G., and McCulloch, S

Reference 12

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T12:55:28.006146Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-07T12:55:24.417925Z digest=sha256:75fa3e4bce8600f264827a4ef6fae52b34dcb91dbcfd9786ab04e4f1007761f8

Observation 672abdee-cd75-42eb-83d9-0f664bb8c3df · outbound

This paper cites Approximate cluster recovery from noisy labels.

Improved Approximations for Hard Graph Problems using Predictions Approximate cluster recovery from noisy labels

Reference 13

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T12:55:27.962405Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-07T12:55:24.457798Z digest=sha256:363160a7078875409a89912bd4c552d2d703a97f1bf03fe6feca90106e1af825

Observation 4d082601-74ab-4b40-aff3-9aa611a8c22a · outbound

This paper cites Constraint satisfaction problems with advice.

Improved Approximations for Hard Graph Problems using Predictions Constraint satisfaction problems with advice

Reference 14

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T12:55:27.901846Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-07T12:55:24.535627Z digest=sha256:b1f4ae3d7ca172d6c1c1f9b6f0623420bb184e3106ec5263e894c9613443098c

Observation a564bdab-5db8-42d5-b5f3-c91c34150c16 · outbound

This paper cites an unresolved cited work.

Improved Approximations for Hard Graph Problems using Predictions Unresolved cited work

Reference 15

Resolution
metadata mismatch
raw_fallback, observed 2026-08-07T12:55:27.009522Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-07T12:55:24.599894Z digest=sha256:1c8b6f9acf74abcd9cb7de2a6bfb4101cf95d804a5afb7ce4aafe31435ab7e8e

Observation 30c99343-ede2-4db3-ae5d-4ac1437d3c31 · outbound

This paper cites an unresolved cited work.

Improved Approximations for Hard Graph Problems using Predictions Unresolved cited work

Reference 16

Resolution
verified exact
doi, observed 2026-08-07T12:55:26.384763Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-07T12:55:24.603039Z digest=sha256:bc78013bec2f026d3397b98f8cc7dcf126fe5ed05b612e3e96089d187eb4ab91

Observation 7292164a-cb38-4a1b-9519-9fbc1459440c · outbound

This paper cites Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs.

Improved Approximations for Hard Graph Problems using Predictions Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs

Reference 17

Resolution
unresolved
no resolver link, observed 2026-08-07T12:55:24.606236Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T12:55:24.606236Z digest=sha256:388b865effa3145126f7e385f192f6d494eb478fce71f72666564d306d484b36

Observation af0b2cd9-b6c3-410f-a697-182d3b561ba8 · outbound

This paper cites Clique is hard to approximate within n\( ^ 1-epsilon \).

Improved Approximations for Hard Graph Problems using Predictions Clique is hard to approximate within n\( ^ 1-epsilon \)

Reference 19

Resolution
metadata mismatch
raw_fallback, observed 2026-08-07T12:55:26.823950Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-07T12:55:24.880722Z digest=sha256:1670c7c2baf5ca8ea498e71e41ce64ee7a9a658ace32c6adeb49502bc2d40d30

Observation 803b12e2-8509-45b2-86af-9fdbebbe1a51 · outbound

This paper cites Learning-based frequency estimation algorithms.

Improved Approximations for Hard Graph Problems using Predictions Learning-based frequency estimation algorithms

Reference 20

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T12:55:27.802577Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-07T12:55:25.040266Z digest=sha256:b2b4f735ea21995e780560c503dd4f49dd39acd86933db4b76fe19be4a6f3804

Observation cc6228ac-c406-4e5c-aacb-8be4cfd965bf · outbound

This paper cites an unresolved cited work.

Improved Approximations for Hard Graph Problems using Predictions Unresolved cited work

Reference 21

Resolution
unresolved
raw_fallback, observed 2026-08-07T12:55:27.711773Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-07T12:55:25.261660Z digest=sha256:5f6a91f4102a96bd789dd20f83d2e41208f509eebe2848f620294c4a07d82593

Observation 4a57f630-6995-4b85-84e9-2d658a6c2982 · outbound

This paper cites an unresolved cited work.

Improved Approximations for Hard Graph Problems using Predictions Unresolved cited work

Reference 22

Resolution
unresolved
no resolver link, observed 2026-08-07T12:55:25.429663Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T12:55:25.429663Z digest=sha256:a801579d6e0da3321531dcece7de1c99de8c943b7a80c3e3c04a704d1040f69c

Observation 88297ea7-052f-4c1d-a75b-43257e373e6e · outbound

This paper cites Metrics and Optimization of Internal Poses for Highly Redundant Truss-Like Serialized Parallel Manipulators.

Improved Approximations for Hard Graph Problems using Predictions Metrics and Optimization of Internal Poses for Highly Redundant Truss-Like Serialized Parallel Manipulators

Reference 23

Resolution
unresolved
no resolver link, observed 2026-08-07T12:55:25.636246Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T12:55:25.636246Z digest=sha256:5b91c49f285c7f85d2618dd9613b9345e9f66d16b394536a5b90543992c04451

Observation a969d685-812d-42fe-a831-5dc2fc3059a2 · outbound

This paper cites and Regev, O.

Improved Approximations for Hard Graph Problems using Predictions and Regev, O

Reference 24

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T12:55:27.642647Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-07T12:55:25.854432Z digest=sha256:b15c25f97274febbf7e7fa707fcee66ab64788bcd97c0b3423272d345b18f369

Observation a021bfd1-92f7-4849-a151-f994959cd9c5 · outbound

This paper cites and Mcauley, J.

Improved Approximations for Hard Graph Problems using Predictions and Mcauley, J

Reference 25

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T12:55:27.497851Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-07T12:55:25.951661Z digest=sha256:70212462bf98469e639d1816fdd4954e5e29868473d7d53e72a8527bfbaa32b8

Observation 3a5cd51f-9ac4-4b90-a609-80837396536d · outbound

This paper cites On the ratio of optimal integral and fractional covers.

Improved Approximations for Hard Graph Problems using Predictions On the ratio of optimal integral and fractional covers

Reference 26

Resolution
unresolved
no resolver link, observed 2026-08-07T12:55:25.955322Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T12:55:25.955322Z digest=sha256:c673c01c895c0f6d8e001fd498e63b56f0990aafc5bac681f7dc0a02191ce862

Observation d0d67dd0-6d50-408d-9bf8-90955351b701 · outbound

This paper cites and Vassilvitskii, S.

Improved Approximations for Hard Graph Problems using Predictions and Vassilvitskii, S

Reference 27

Resolution
unresolved
no resolver link, observed 2026-08-07T12:55:25.958557Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T12:55:25.958557Z digest=sha256:f75541cd435800928f32e1e8abd84b0cb30515dd0cc43eef9b8058f51b536dbb

Observation 01b4db1d-2531-48cc-a8ac-62b2bad13ce2 · outbound

This paper cites and Vassilvitskii, S.

Improved Approximations for Hard Graph Problems using Predictions and Vassilvitskii, S

Reference 28

Resolution
unresolved
no resolver link, observed 2026-08-07T12:55:25.962031Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T12:55:25.962031Z digest=sha256:d9db0db270d7b5eeee9b2122cc81bed611501ea9b4ede94ed0818e34a25d6311

Observation b07f97bf-5396-452c-a3d9-23c74b4d155d · outbound

This paper cites and Sarkar, R.

Improved Approximations for Hard Graph Problems using Predictions and Sarkar, R

Reference 29

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T12:55:27.387360Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-07T12:55:25.967594Z digest=sha256:227c2d5cb5bbc2661526a2d99bde7bd3ea09a867475d36c7efb9e13f4760c758

Observation 415e15f6-7127-4dda-a0de-2a4bb9e26360 · outbound

This paper cites Non-approximability results for optimization problems on bounded degree instances.

Improved Approximations for Hard Graph Problems using Predictions Non-approximability results for optimization problems on bounded degree instances

Reference 30

Resolution
metadata mismatch
raw_fallback, observed 2026-08-07T12:55:26.602397Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-07T12:55:26.007820Z digest=sha256:d8d49cd11b1f84366816f94a483cad9df01c07edcbce699b8850a2f2024962de

Observation 3662aaa8-90bd-48ee-8986-aadd4dd64267 · outbound

This paper cites an unresolved cited work.

Improved Approximations for Hard Graph Problems using Predictions Unresolved cited work

Reference 31

Resolution
unresolved
raw_fallback, observed 2026-08-07T12:55:27.211825Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-07T12:55:26.124780Z digest=sha256:f6356eb6c022ad5a9d8c788324ec38457309b43f5fd84fe4e7b2e14b9cb0ab49

Pith citing papers

Observation 84871680-e607-4ea7-850a-98a5b0d54fcc · 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 Improved Approximations for Hard Graph Problems using Predictions

Reference 1

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T01:57:54.641353Z digest=sha256:330eb6ba2cc01941695e7a9388c8445f362cce1de471198db1d296d2f3146fab