Pith. sign in

Paper Citation Record · LEDGER

Improved Approximations for Hard Graph Problems using Predictions

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.

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-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: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:5e5fd2d5311c1e65955eb8e2690c4c2fb66e7c41dd6ac64b7ffe6ab4891dfe1a

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:4782e33b544c283a0a009e314304964e8c7e33e3c4c66348bdebc5a3a28d9a99

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-10T06:31:04.303077+00:00.

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

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:85809ddb2cce76fe0e6be5961b9c574ad97780a14da2a398be41d216ef2f1015

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-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-07T12:55:23.981810Z digest=sha256:84975677b2362f630351e2a4fe38c3abaa95f4e2faba45ab9eeb1c12bbc75aa7

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-10T06:31:04.303077+00:00.

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

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:25d5e68f9fd504f970362383edf9dc545600204bd2085e6971af271866c58543

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-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-07T12:55:24.200580Z digest=sha256:39e2c60f9088230772a2d92cc2a8fba893441b5651b06cd483ec1532918114fa

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-10T06:31:04.303077+00:00.

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

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:3db29573e097d4f6cee584336947d8c715e2ecefc8a28b5acf5ecc1f9f9d2875

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-07T12:55:24.457798Z digest=sha256:7cc51459a8320e81c28668e1f8397520d726bd1ff0109fae893a8f796580fefd

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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:df383a5cd512ed30ac8cdbaf09c1478a6f32d4c947164e6ab2dbe44f4e1d77a2

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-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-07T12:55:24.880722Z digest=sha256:18433dde34b74bf217bdb8356fdba01339249087c03bc0f207018c428206d04c

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-07T12:55:25.261660Z digest=sha256:92d8c2bfc1fc8aa00f226d85baab6362751ceb2f1b2e17809ba77f02df7bdc9a

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:9ba78fb7c37a4e7fe275bafc695d2319ef7272d685e2fb06c9ecae0e172ad8f5

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:323d349860be29d5e6cab02d541d8fb128845b2698c61bb8f19739d9c43e715e

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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:b29afde28efe82a5a86c0af00fa448dabd6b1a5995fe4a439fab763579c91ed6

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:74691d8739021ef24935e1d195d680d5258200708db9ff335102fdeb863aef28

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:94bbd25893a32b1fd6d4ea42e1e1c7d023ab23c7330bdd7bc49c2f3b14c0eacc

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-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-07T12:55:25.967594Z digest=sha256:389ed0cb51e3d13fec56be2821ec1ad87a20450dfe1c4a9b684177a96f19e5cf

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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:adbd220e9eb0154a1fd8c18c547d5afc184a63ec4b29d068d9af30d760e1db6a