Pith. sign in

Paper Citation Record · LEDGER

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem

As of 15 August 2026, this Paper Citation Record lists 68 of 68 outbound references and 2 inbound Pith citation observations for arXiv:2412.14198.

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

pith.paper-citation-record.v1
2412.14198 v2

Coverage vector

measured 68 of 68 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-11T15:34:47.524986Z

measured 70 of 70 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-14T06:32:32.682623+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-01T12:29:25.076193Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-05-11T03:25:57.481438Z

Reference resolution

68 of 68 outbound references displayed

  • verified exact18
  • verified fuzzy29
  • unresolved20
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch1

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 40f8e14f-f989-4f9b-a91f-c8d9c63057cb · outbound

This paper cites URL: https://github.com/KarlsruheMIS/KaMIS.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem URL: https://github.com/KarlsruheMIS/KaMIS

Reference 1

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T15:34:49.168533Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T15:34:47.224932Z digest=sha256:d41ae87963462ccfe638d4d7d77b58afac3a9874112526032f95d599ffc5030a

Observation 62b2e6f6-9fe7-464e-904a-69004f129b9f · outbound

This paper cites URL: https://www.openstreetmap.org.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem URL: https://www.openstreetmap.org

Reference 2

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T15:34:49.155996Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T15:34:47.229482Z digest=sha256:d2acd3ba25143c4e53b68129a8ec56cccb59de8e3ef181a5fda0281fcdbe1d8a

Observation 02db15ab-24c8-46af-9486-c89bb099d9e2 · outbound

This paper cites URL: https://sparse.tamu.edu.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem URL: https://sparse.tamu.edu

Reference 3

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T15:34:49.142418Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T15:34:47.233509Z digest=sha256:7c4568bcb93a112fea07b3ae0fe2140b5bdb358cf3a0e606818ef89c1d1d0d7f

Observation f20dc30e-a370-4778-a83a-2695885b8fa7 · outbound

This paper cites Abu-Khzam, Sebastian Lamm, Matthias Mnich, Alexander Noe, Christian Schulz, and Darren Strash.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem Abu-Khzam, Sebastian Lamm, Matthias Mnich, Alexander Noe, Christian Schulz, and Darren Strash

Reference 4

Resolution
unresolved
no resolver link, observed 2026-08-11T15:34:47.238520Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T15:34:47.238520Z digest=sha256:1215103f1ff5ce221970ee665ded4736d2c54e87d853357b9fec298f6d8aea7a

Observation c333db5d-7de7-4627-91fa-aa7c522e9ccb · outbound

This paper cites Akiba and Y.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem Akiba and Y

Reference 5

Resolution
unresolved
no resolver link, observed 2026-08-11T15:34:47.243028Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T15:34:47.243028Z digest=sha256:cb2cc1a781240c0af5847905d02dec971d65ef2b2199228292211d9acfcc1a7d

Observation abd9ddb3-b2b3-41d8-912b-423b3cfea4c3 · outbound

This paper cites Struction revisited.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem Struction revisited

Reference 6

Resolution
unresolved
no resolver link, observed 2026-08-11T15:34:47.247179Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T15:34:47.247179Z digest=sha256:4952bd07f1b4a0081f541be97726ef4b1b8808162a87eae24e91753885ffb195

Observation 93f42088-e82a-4886-8510-8f4629f83fd8 · outbound

This paper cites Andrade, Mauricio G.C.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem Andrade, Mauricio G.C

Reference 7

Resolution
verified exact
doi, observed 2026-08-11T15:34:47.822030Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T15:34:47.251251Z digest=sha256:5e50d8d12d2261bb928eeac87bb142df07638cf8490d546d3813211cad7c16e1

Observation 1bbc5a0a-5645-4b79-9767-3936db6d61dd · outbound

This paper cites A fast algorithm for the maximum weight clique problem.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem A fast algorithm for the maximum weight clique problem

Reference 8

Resolution
verified exact
doi, observed 2026-08-11T15:34:47.809926Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T15:34:47.255194Z digest=sha256:e216a09d419f20d5f6886beddb71e21647e554359dc897933862574df2e3635f

Observation 192e67c8-78c6-4dab-9f4d-efaa74cb056f · outbound

This paper cites Finding a maximum clique in an arbitrary graph.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem Finding a maximum clique in an arbitrary graph

Reference 9

Resolution
verified exact
doi, observed 2026-08-11T15:34:47.797983Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T15:34:47.259456Z digest=sha256:84a2258ee7105104df0116f731e7573e37d9c9e1f4eb5ef6ce0c4b60b9c35059

Observation aeacdade-415a-448f-8f3f-63668fd7bda1 · outbound

This paper cites Pace solver description: The pace 2023 parameterized algorithms and computational experiments challenge: Twinwidth.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem Pace solver description: The pace 2023 parameterized algorithms and computational experiments challenge: Twinwidth

Reference 10

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T15:34:49.127921Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T15:34:47.264211Z digest=sha256:d27cd9b4feae410ed02457c50fd5fcbdb9d8250f94e269ab9df58980627d6145

Observation 691f936a-9c65-491f-8126-696ca33e8fc0 · outbound

This paper cites Temporal map labeling: A new unified framework with experiments.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem Temporal map labeling: A new unified framework with experiments

Reference 11

Resolution
metadata mismatch
raw_fallback, observed 2026-08-11T15:34:48.745338Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T15:34:47.268302Z digest=sha256:f8dc9254bc638549853b8c6eba753605e6203bbfcee1c63a2ff4ae480bd3d8fc

Observation ecc1a47b-50e7-4f75-85ad-f94e2de46632 · outbound

This paper cites Maximum independent set and related problems, with applications.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem Maximum independent set and related problems, with applications

Reference 12

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T15:34:49.112992Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T15:34:47.272628Z digest=sha256:7480c1458b034723f4ffae2863cc5351f84ee22ba2bc75b0b0df5782c483e97b

Observation d4c0a03e-ac0e-4d97-b0ed-efcab212f5e1 · outbound

This paper cites Using critical sets to solve the maximum independent set problem.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem Using critical sets to solve the maximum independent set problem

Reference 13

Resolution
verified exact
doi, observed 2026-08-11T15:34:47.785054Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T15:34:47.277550Z digest=sha256:6698d6f629b653a6aa4c369f67b9225889cec85b98a4a3e144db9ba2b6af52a9

Observation a606eb00-482c-439c-90cc-1faed027ac8b · outbound

This paper cites Improving local search for minimum weight vertex cover by dynamic strategies.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem Improving local search for minimum weight vertex cover by dynamic strategies

Reference 14

Resolution
verified exact
doi, observed 2026-08-11T15:34:47.773049Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T15:34:47.281870Z digest=sha256:34a65a35862c7f9da1259f7de7b8bd00bf4cf2135278d4be9545761f22c72572

Observation b126fde8-2cab-454d-b433-6f31b5ea9f35 · outbound

This paper cites Local search with edge weighting and configuration checking heuristics for minimum vertex cover.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem Local search with edge weighting and configuration checking heuristics for minimum vertex cover

Reference 15

Resolution
verified exact
doi, observed 2026-08-11T15:34:47.760911Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T15:34:47.286318Z digest=sha256:3974a000b7622be4ef439c468412b6570593970f013924f07965f5fa3645923f

Observation 893a0383-bbbd-47db-b4a5-bf98aab3d3ca · outbound

This paper cites The university of florida sparse matrix collection.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem The university of florida sparse matrix collection

Reference 16

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T15:34:49.097866Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T15:34:47.290493Z digest=sha256:5a24960a337c74732020f9507b829be83d7dd68ef8f02e9b12f571a40dd5c083

Observation 316c2d5c-f922-41ba-9295-894f6782b6b3 · outbound

This paper cites Benchmarking optimization software with performance profiles.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem Benchmarking optimization software with performance profiles

Reference 17

Resolution
unresolved
no resolver link, observed 2026-08-11T15:34:47.296338Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T15:34:47.296338Z digest=sha256:128b74dad42e886a04c5ca294b5442daadc4f4d2f5da976f13605c09b7af2b75

Observation 574c7a13-4f2d-4b05-9e59-9546a656a077 · outbound

This paper cites A Metaheuristic Algorithm for Large Maximum Weight Independent Set Problems.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem A Metaheuristic Algorithm for Large Maximum Weight Independent Set Problems

Reference 18

Resolution
unresolved
no resolver link, observed 2026-08-11T15:34:47.301517Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T15:34:47.301517Z digest=sha256:9466a34a6dd3ea7dac0a25084eddaffffd849a604bb1766bf7fad2435c2e858f

Observation 8742694d-07c8-4852-ac0a-a3d9c5ec5f30 · outbound

This paper cites New instances for maximum weight independent set from a vehicle routing application.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem New instances for maximum weight independent set from a vehicle routing application

Reference 19

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T15:34:49.083120Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T15:34:47.307570Z digest=sha256:44ed5f581dc64351bbd601655a2112b33e5245ffa7d2e6dfab725caea916b815

Observation 82726fda-4b57-4210-af7a-b86e51157be2 · outbound

This paper cites Pseudo-boolean functions and stability of graphs.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem Pseudo-boolean functions and stability of graphs

Reference 20

Resolution
unresolved
no resolver link, observed 2026-08-11T15:34:47.312178Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T15:34:47.312178Z digest=sha256:2c285854568f1f328e2225ec1b5b5290d16677b3f24538b265d9e7ece46b8061

Observation f32c0832-f105-4f62-912c-2dab58a6cb38 · outbound

This paper cites An exact algorithm based on maxsat reasoning for the maximum weight clique problem.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem An exact algorithm based on maxsat reasoning for the maximum weight clique problem

Reference 21

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T15:34:49.070944Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T15:34:47.316624Z digest=sha256:09436beadba4634529d17419ed47f208fbbda221fc9320a0130fb2d4772c53e2

Observation 96ff0645-db9e-45a7-8b7e-3112078b6351 · outbound

This paper cites an unresolved cited work.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem Unresolved cited work

Reference 22

Resolution
unresolved
no resolver link, observed 2026-08-11T15:34:47.320686Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T15:34:47.320686Z digest=sha256:b8e43a602e20bc7765e5d8ee0a7a327ce956ef02e7e3594596767e2a5513df4d

Observation a1913d33-0dd2-4386-a63f-beac8709ec07 · outbound

This paper cites There and back again: On applying data reduction rules by undoing others.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem There and back again: On applying data reduction rules by undoing others

Reference 23

Resolution
verified exact
doi, observed 2026-08-11T15:34:47.717263Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T15:34:47.325031Z digest=sha256:96fe15ae52d69cd1167d064592ca60a2a8ebe03a2fc110cb90ab38e54562c6d3

Observation 5585a848-00a0-4169-81d7-12332f7a6349 · outbound

This paper cites Boosting data reduction for the maximum weight independent set problem using increasing transformations.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem Boosting data reduction for the maximum weight independent set problem using increasing transformations

Reference 24

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T15:34:49.051072Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T15:34:47.329515Z digest=sha256:52a61cfb27f6a3a170edc9002f77a797a7e49dc6462372c6696c2d84d11096ff

Observation 78cd7bc4-3d7c-4b1a-86a7-4281d56ab752 · outbound

This paper cites Anatomy of high-performance matrix multiplication.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem Anatomy of high-performance matrix multiplication

Reference 25

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T15:34:49.038421Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T15:34:47.333841Z digest=sha256:7a11f919e8c3dd7f00fd2e92f99b896568fa440f6426beb1bcf3ff67ffa53bdf

Observation 35021f89-bf6c-4ea1-acc5-80e232451d78 · outbound

This paper cites The PACE 2022 parameterized algorithms and computational experiments challenge: directed feedback vertex set.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem The PACE 2022 parameterized algorithms and computational experiments challenge: directed feedback vertex set

Reference 26

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T15:34:49.025103Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T15:34:47.339043Z digest=sha256:c95fcbc3f24ccecf9e157c0277e491bd023d5883a20897e6aa5f042260a8a583

Observation 85e7c58f-174a-41b7-98f3-59016f63c748 · outbound

This paper cites Finding near-optimal weight independent sets at scale.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem Finding near-optimal weight independent sets at scale

Reference 27

Resolution
unresolved
no resolver link, observed 2026-08-11T15:34:47.343323Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T15:34:47.343323Z digest=sha256:13365727759e872881c904fad83017e702997fc49deda9a8ffcbd34ee0a81256

Observation 5db77f89-a874-483c-912b-7742acf949c8 · outbound

This paper cites A comprehensive survey of data reduction rules for the maximum weighted independent set problem, 2024.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem A comprehensive survey of data reduction rules for the maximum weighted independent set problem, 2024

Reference 28

Resolution
verified exact
raw_fallback, observed 2026-08-11T15:34:48.588667Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T15:34:47.348132Z digest=sha256:a2d986f8ce11d79c485088fcd908fe78bb6fb46347284c7ab3d1ff38f666762e

Observation 793f545d-30c2-4918-b60d-4aef724a39ca · outbound

This paper cites Towards computing a near-maximum weighted independent set on massive graphs.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem Towards computing a near-maximum weighted independent set on massive graphs

Reference 29

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T15:34:49.012202Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T15:34:47.352819Z digest=sha256:218c1892882bc753bc3e8a83e0f91c397a1d2787f652562a359c8f921f58e74b

Observation 44aef050-d304-4414-88fe-4e650b04e3f9 · outbound

This paper cites A Bregman-Sinkhorn Algorithm for the Maximum Weight Independent Set Problem.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem A Bregman-Sinkhorn Algorithm for the Maximum Weight Independent Set Problem

Reference 30

Resolution
unresolved
no resolver link, observed 2026-08-11T15:34:47.357032Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T15:34:47.357032Z digest=sha256:9ccb8e25037ba0456b4f3f6ef7955550a8206d5208fb2f1d82d712b50a62db98

Observation 35e0fbe5-b753-4d8c-8c3d-3f2e7fd1eabc · outbound

This paper cites Personal communication, 2024.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem Personal communication, 2024

Reference 31

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T15:34:48.999943Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T15:34:47.361980Z digest=sha256:71ae2f5a53343841ec577c9a14fb855c6eecfb90f851800dff17f3837912812f

Observation 6c62f465-3fc8-44cc-9826-86aa89df56cb · outbound

This paper cites Inductive representation learning on large graphs.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem Inductive representation learning on large graphs

Reference 32

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T15:34:48.987419Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T15:34:47.366428Z digest=sha256:41acaaf3684bdc5eec8bfc3b83593f3066fdd3c021e8e700b2042b240c622e0e

Observation 4650dcff-b9ea-4e4d-a184-0a20b9f50817 · outbound

This paper cites Maximum-weight stable sets and safe lower bounds for graph coloring.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem Maximum-weight stable sets and safe lower bounds for graph coloring

Reference 33

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T15:34:48.975040Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T15:34:47.371424Z digest=sha256:b72546189bd1c9e63183915555f79a7b7808feb15145d9d90fe26ab750946802

Observation 37809c86-5c66-4e8b-b6bd-7946ada1d917 · outbound

This paper cites Targeted Branching for the Maximum Independent Set Problem.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem Targeted Branching for the Maximum Independent Set Problem

Reference 34

Resolution
unresolved
no resolver link, observed 2026-08-11T15:34:47.377120Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T15:34:47.377120Z digest=sha256:b5ae435597d44f1a6bb9efcdc9614e8536281002260bf6bc6ed259467ab68280

Observation b25256a0-07aa-4d6e-aef2-5d5f644c0aa2 · outbound

This paper cites WeGotYouCovered : The winning solver from the PACE 2019 challenge, vertex cover track.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem WeGotYouCovered : The winning solver from the PACE 2019 challenge, vertex cover track

Reference 35

Resolution
unresolved
no resolver link, observed 2026-08-11T15:34:47.381577Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T15:34:47.381577Z digest=sha256:92b7b10befbbbb14acbfe33e1a32d36b47ab4f167aabcb11cb2b786bcb5130ae

Observation a9dc6ea4-a562-4a8d-8ea5-7cd717918963 · outbound

This paper cites An exact algorithm for the maximum weight clique problem in large graphs.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem An exact algorithm for the maximum weight clique problem in large graphs

Reference 36

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T15:34:48.962770Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T15:34:47.386338Z digest=sha256:fa97fbde69fef99c3349a01331c21d571d35ac23b65124247ea9821603d704f8

Observation bd0d75b2-eaef-4d87-82b9-6548ecc3f503 · outbound

This paper cites Reducibility among combinatorial problems.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem Reducibility among combinatorial problems

Reference 37

Resolution
unresolved
no resolver link, observed 2026-08-11T15:34:47.390377Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T15:34:47.390377Z digest=sha256:fba04aa265df96284d0b77f2f10abc1913f8911e67bea4a005d471021e38100f

Observation 2f629890-36d7-4fa6-9416-e5790746a2d0 · outbound

This paper cites The PACE 2021 parameterized algorithms and computational experiments challenge: Cluster editing.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem The PACE 2021 parameterized algorithms and computational experiments challenge: Cluster editing

Reference 38

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T15:34:48.941289Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T15:34:47.394995Z digest=sha256:d961eaf995f6d91b02167f4cc5abf49819bea620330826ee1b8ecb1dc05ac103

Observation 7b3d70a7-56aa-47d2-8ff6-fdd7289ff05b · outbound

This paper cites Adam: A Method for Stochastic Optimization.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem Adam: A Method for Stochastic Optimization

Reference 39

Resolution
unresolved
no resolver link, observed 2026-08-11T15:34:47.399315Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T15:34:47.399315Z digest=sha256:2df37ae4a04f6d31a3dc07ccc1c1304801724e0288dc113ce3bfe6ea4fb5cacb

Observation 8da2511b-1a2e-4124-83c9-7bb63828176f · outbound

This paper cites Semi-Supervised Classification with Graph Convolutional Networks.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem Semi-Supervised Classification with Graph Convolutional Networks

Reference 40

Resolution
unresolved
no resolver link, observed 2026-08-11T15:34:47.403062Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T15:34:47.403062Z digest=sha256:6e38c4b37d82912c0b1076d09cf6b14522cbda276518c5713342628ae0fe8089

Observation 40a1f611-ec80-4bb1-8dbe-49ef534c88f2 · outbound

This paper cites Scalable graph mining and learning (dagstuhl seminar 23491).

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem Scalable graph mining and learning (dagstuhl seminar 23491)

Reference 41

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T15:34:48.928489Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T15:34:47.406415Z digest=sha256:b9f56c2f1f24587aca5665e12930c5ad3568493421ad40ee6aee1798a6af587b

Observation faa22383-7da1-4a14-9069-8084f833e234 · outbound

This paper cites Graph partitioning for independent sets.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem Graph partitioning for independent sets

Reference 42

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T15:34:48.914880Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T15:34:47.409796Z digest=sha256:84008233f40e11bdb07b0bef0c6861c0bd5310bae584c41534c4cda7c74fb435

Observation c02d639c-b86d-433b-855b-fa78675792ad · outbound

This paper cites an unresolved cited work.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem Unresolved cited work

Reference 43

Resolution
unresolved
no resolver link, observed 2026-08-11T15:34:47.413760Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T15:34:47.413760Z digest=sha256:de37545e2bf1af16b622afc9cfb00ed6dd71568fe6f925a0c60b8a5274bc5d28

Observation 186ef127-4916-4e8b-a6da-86392534d87f · outbound

This paper cites Exactly solving the maximum weight independent set problem on large real-world graphs.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem Exactly solving the maximum weight independent set problem on large real-world graphs

Reference 44

Resolution
unresolved
no resolver link, observed 2026-08-11T15:34:47.419515Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T15:34:47.419515Z digest=sha256:39809c38e6388e80150cec520d8ca05280cb91965f6176ecf7f54afc6698d2c9

Observation 4a79bcc0-8ee1-4ee5-b42a-3e3ce11a32b6 · outbound

This paper cites Targeted branching for the maximum independent set problem using graph neural networks.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem Targeted branching for the maximum independent set problem using graph neural networks

Reference 45

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T15:34:48.903091Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T15:34:47.423921Z digest=sha256:a133a9b294a53b66b24b3678bd9e74a3dcbf739e5b35876e4a7e70dc5c4bc4e2

Observation 1c9560e8-75bb-42bb-b3ce-cba7fe65be69 · outbound

This paper cites Efficient minimum weight vertex cover heuristics using graph neural networks.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem Efficient minimum weight vertex cover heuristics using graph neural networks

Reference 46

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T15:34:48.891178Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T15:34:47.428264Z digest=sha256:a9f82f5f6690f7d0c7cb3c4552f2c32ec0527d49e7ec032bef6b9eee85c40e4d

Observation 9357abc7-311b-47d0-9eb5-684149dad534 · outbound

This paper cites Learning fine-grained search space pruning and heuristics for combinatorial optimization.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem Learning fine-grained search space pruning and heuristics for combinatorial optimization

Reference 47

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T15:34:48.878829Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T15:34:47.432963Z digest=sha256:77502eaeb2993620b948c0f1d341fee94baaf365460cf71c70a5ca36426c36d0

Observation d52c3f6d-44e7-4cd5-9bd2-c1a2d4d0ab89 · outbound

This paper cites SNAP Datasets : Stanford large network dataset collection.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem SNAP Datasets : Stanford large network dataset collection

Reference 48

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T15:34:48.866256Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T15:34:47.437480Z digest=sha256:94b2fbb2a7e046b404289381b63c43535af1247680a5c7e1615f16acafc3d9bc

Observation 97e0071b-81b9-4eaa-96da-235e08403cda · outbound

This paper cites On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem

Reference 49

Resolution
verified exact
doi, observed 2026-08-11T15:34:47.678605Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T15:34:47.441935Z digest=sha256:90ef8214d6fa9e284e0f23c18730849a8e5e91403261a9ed6bb14cecec9cb0f7

Observation ce2836ec-87f2-45fb-983f-ecde0a8fec27 · outbound

This paper cites Numwvc: A novel local search for minimum weighted vertex cover problem.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem Numwvc: A novel local search for minimum weighted vertex cover problem

Reference 50

Resolution
unresolved
no resolver link, observed 2026-08-11T15:34:47.446165Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T15:34:47.446165Z digest=sha256:fc9831a554ec227a717a8acf18e8745789eb0105b85e38df8af6370acf83b5cf

Observation e992bfd7-2dae-4a45-a241-d50eb6c9b7ac · outbound

This paper cites An efficient local search algorithm for minimum weighted vertex cover on massive graphs.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem An efficient local search algorithm for minimum weighted vertex cover on massive graphs

Reference 51

Resolution
verified exact
doi, observed 2026-08-11T15:34:48.852353Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T15:34:47.450508Z digest=sha256:c9c0018f050990fdf51408fc1775db8cc16c8a7f6f51f9781231131fa7b30f64

Observation 0d95cea6-d600-4b83-8bee-eec9d56f8ad8 · outbound

This paper cites an unresolved cited work.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem Unresolved cited work

Reference 52

Resolution
verified exact
doi, observed 2026-08-11T15:34:47.664354Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T15:34:47.455504Z digest=sha256:0f9d1dd1b578cedcdd011906d908f82649999df13705a4d82e08cb434f087b33

Observation 9344a0c6-0e2d-4f53-9dcb-a0f9d027294c · outbound

This paper cites A fast algorithm for the maximum clique problem.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem A fast algorithm for the maximum clique problem

Reference 53

Resolution
verified exact
doi, observed 2026-08-11T15:34:47.650203Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T15:34:47.460083Z digest=sha256:e585737e4a4f3e9e44e4d1199c86c0f246ecd6dfa4b9e4a0bba469af007de95b

Observation 089d6677-b77c-4af3-a65f-153a35ecf4cf · outbound

This paper cites Sat-and-reduce for vertex cover: Accelerating branch-and-reduce by sat solving.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem Sat-and-reduce for vertex cover: Accelerating branch-and-reduce by sat solving

Reference 54

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T15:34:48.838556Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T15:34:47.464139Z digest=sha256:f3d1212642aba07aae1c5b3cc41b921633c325ea4726fe02b5d01f7cd5747d2a

Observation ef3e16ed-24a9-475a-845a-0763067fe6e1 · outbound

This paper cites A branch and cut solver for the maximum stable set problem.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem A branch and cut solver for the maximum stable set problem

Reference 55

Resolution
verified exact
doi, observed 2026-08-11T15:34:47.635507Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T15:34:47.468323Z digest=sha256:e720702dcfecb05187d79ef93512a076d3e62fa0eebdf98341a0cdf520c58640

Observation 2ee3ab96-df61-42fa-85c8-0ad4652c2582 · outbound

This paper cites Efficient traversal of mesh edges using adjacency primitives.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem Efficient traversal of mesh edges using adjacency primitives

Reference 56

Resolution
unresolved
no resolver link, observed 2026-08-11T15:34:47.472493Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T15:34:47.472493Z digest=sha256:c6e14b9b0c3e97f216156783e14dcecf761f22b7072d99a283f1b5080d3dd466

Observation 0a271e4b-58f8-45c7-9a25-1df8b9fa9c0a · outbound

This paper cites Combining algorithms for vertex cover and clique search.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem Combining algorithms for vertex cover and clique search

Reference 57

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T15:34:48.824487Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T15:34:47.476463Z digest=sha256:67752129e459de1625ba49d80f6dd4482d58b9dec4529e57a0d5753a54cd440b

Observation c9491574-b8ac-4e8b-a348-3ccd27da12b2 · outbound

This paper cites Graph partitioning archive.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem Graph partitioning archive

Reference 58

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T15:34:48.808440Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T15:34:47.480824Z digest=sha256:e6caf4aa3d815ed7ff2e4a52c396848fa90900f965322fdc6cd0da9b49fa7b86

Observation 69d6c757-1a14-4df2-a652-d13dbc13c053 · outbound

This paper cites An Exact Algorithm for Minimum Weight Vertex Cover Problem in Large Graphs.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem An Exact Algorithm for Minimum Weight Vertex Cover Problem in Large Graphs

Reference 59

Resolution
verified exact
local_arxiv, observed 2026-08-11T15:34:47.621958Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T15:34:47.484769Z digest=sha256:668c92f97ebcf62c96bbc6dc4bc691630d31d6efe56ea446982d6e9f07a3921d

Observation 258211b3-7667-4014-a0fc-ce52f6209eb8 · outbound

This paper cites Combinatorial branch-and-bound for the maximum weight independent set problem.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem Combinatorial branch-and-bound for the maximum weight independent set problem

Reference 60

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T15:34:48.795433Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T15:34:47.491196Z digest=sha256:672cb6e8291f44402fe35c95c68c6b8e6d16b8a1ff1de3b4debaab269e335416

Observation d9e7cbf0-4ae6-4bc4-965c-8c8fe88dc731 · outbound

This paper cites A branch, price, and cut approach to solving the maximum weighted independent set problem.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem A branch, price, and cut approach to solving the maximum weighted independent set problem

Reference 61

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T15:34:48.782246Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T15:34:47.495540Z digest=sha256:f01aaf25cb47ecd18d96809d472564fd110b8c87adfe9166a72d7e68a70106bf

Observation 5aafef18-2c38-4c3a-bb78-cc1ace01bd0d · outbound

This paper cites A branch-and-price approach for the maximum weight independent set problem.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem A branch-and-price approach for the maximum weight independent set problem

Reference 62

Resolution
verified exact
doi, observed 2026-08-11T15:34:47.605087Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T15:34:47.499554Z digest=sha256:ec96185b7284847ed9d27f52e6989e5795399796c8a47ea42e327a71699bb958

Observation 447b2444-965e-4100-952b-1573cce0c0d5 · outbound

This paper cites A comprehensive survey on graph neural networks.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem A comprehensive survey on graph neural networks

Reference 63

Resolution
unresolved
no resolver link, observed 2026-08-11T15:34:47.504120Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T15:34:47.504120Z digest=sha256:a038a70048c92f8ce2fac97e7186a4c5b4b8418995c94cd15ba485bb9f13525a

Observation 993f5735-b133-40af-a976-a4699ef996b4 · outbound

This paper cites Maximum weighted independent set: Effective reductions and fast algorithms on sparse graphs.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem Maximum weighted independent set: Effective reductions and fast algorithms on sparse graphs

Reference 64

Resolution
verified exact
doi, observed 2026-08-11T15:34:47.592096Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T15:34:47.508338Z digest=sha256:9997ea9c5ac70a2e67da03122aaa1b73b80a4528c084b1adc7aba3d86009f3a1

Observation 5c5de51f-1e68-470f-8a5c-53a7ee73baa7 · outbound

This paper cites Efficient reductions and a fast algorithm of maximum weighted independent set.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem Efficient reductions and a fast algorithm of maximum weighted independent set

Reference 65

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T15:34:48.760777Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T15:34:47.513113Z digest=sha256:147c7a5354cdd3b893106274a76016cb28fc2a73dbdfa863609ce7083d3c8b4f

Observation 08227c3e-9d71-4863-8587-bc5cdce293df · outbound

This paper cites Confining sets and avoiding bottleneck cases: A simple maximum independent set algorithm in degree-3 graphs.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem Confining sets and avoiding bottleneck cases: A simple maximum independent set algorithm in degree-3 graphs

Reference 66

Resolution
verified exact
doi, observed 2026-08-11T15:34:47.579220Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T15:34:47.517086Z digest=sha256:89a51e509b8d3e4d65c9845a9f4766fd989d0ea7b93f03001ddce5861e341195

Observation 3e9359f2-0d6d-4ec4-9213-29f6a3184dd4 · outbound

This paper cites A new solver for the minimum weighted vertex cover problem.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem A new solver for the minimum weighted vertex cover problem

Reference 67

Resolution
verified exact
doi, observed 2026-08-11T15:34:47.564736Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T15:34:47.521278Z digest=sha256:95cb267ddea2da74930f0491d0c7c80c9a9d335a72cfead4bfd276b5d4425569

Observation 7362f994-046f-4988-9fef-3cd92dbd0aac · outbound

This paper cites Efficient weighted independent set computation over large graphs.

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem Efficient weighted independent set computation over large graphs

Reference 68

Resolution
unresolved
no resolver link, observed 2026-08-11T15:34:47.524986Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T15:34:47.524986Z digest=sha256:df65acb5e8b61e1b8b10d8bc0c22f774b21310833577fb693ba17d18ccb30e63

Pith citing papers

Observation 8dfc8f5d-d237-40ad-8988-1736bf3c5318 · inbound

Reducibility of native weighted graphs on Rydberg Arrays cites this paper.

Reducibility of native weighted graphs on Rydberg Arrays Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem

Reference 80

Resolution
verified exact
arxiv_id, observed 2026-05-11T03:25:57.484203Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-05-11T03:22:17.699114Z digest=sha256:e9d8ee8e0108ec793075d7765e322011a446b97ac2aea0117b52a7efe14cdeee

Observation 45217967-679b-4c83-b6a4-2312d718f7b0 · inbound

New lower bounds for binary constant-weight codes: $A(23,6,10)\geq 2979$ and $A(24,6,10)\geq 4214$ cites this paper.

New lower bounds for binary constant-weight codes: $A(23,6,10)\geq 2979$ and $A(24,6,10)\geq 4214$ Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem

Reference 3

Resolution
unresolved
no resolver link, observed 2026-08-01T12:29:25.076193Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-01T12:29:25.076193Z digest=sha256:d5b533ac5f5147356bc132829267d0f1e878e9e72b2c1b4111a20fe69f005f03