Paper Citation Record · LEDGER

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem

As of 14 August 2026, this Paper Citation Record lists 48 of 48 outbound references and 1 inbound Pith citation observation for arXiv:2412.07685.

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

pith.paper-citation-record.v1
2412.07685 v1

Coverage vector

measured 48 of 48 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-11T18:47:32.309516Z

measured 49 of 49 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 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-10T23:01:35.181204Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-10T23:01:35.450183Z

Reference resolution

48 of 48 outbound references displayed

verified exact12
verified fuzzy5
unresolved24
parse uncertain0
malformed identifier6
metadata mismatch1

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 1a92184e-7c8f-4196-9608-ab7237dd7047 · outbound

This paper cites Abrame and D.

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem Abrame and D

Reference 1

Resolution: verified exact; doi, observed 2026-08-11T18:47:32.792157Z

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.

Observation bf576412-4721-435c-86bf-06f2c3325034 · outbound

This paper cites Achterberg , SCIP: Solving constraint integer programs, Math.

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem Achterberg , SCIP: Solving constraint integer programs, Math

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-11T18:47:32.051140Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8d5e6861-cdc8-4e4c-9c86-4fe4e4228bef · outbound

This paper cites Achterberg, T.

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem Achterberg, T

Reference 3

Resolution: verified exact; doi, observed 2026-08-11T18:47:32.760272Z

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.

Observation 8b3df88a-b814-4b1b-8ece-4055dd398491 · outbound

This paper cites Achterberg, T.

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem Achterberg, T

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-11T18:47:32.062969Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c7d845c5-cfc8-44c4-9454-75dbf3083148 · outbound

This paper cites Akiba and Y.

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem Akiba and Y

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-11T18:47:32.072370Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c1154c95-fa36-4988-ab70-2de36e1b0806 · outbound

This paper cites an unresolved cited work.

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem Unresolved cited work

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-11T18:47:32.077887Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fb8cec76-8515-43da-99b7-132dc81bf5fe · outbound

This paper cites Argelich, C.

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem Argelich, C

Reference 7

Resolution: verified exact; doi, observed 2026-08-11T18:47:32.720868Z

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.

Observation 1d144168-d31d-4456-ad6c-2e97e53efdff · outbound

This paper cites Bezanson, A.

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem Bezanson, A

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T18:47:33.757758Z

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.

Observation 336c87c8-bd7e-47ab-b624-08c5903f7e3a · outbound

This paper cites Bourgeois, B.

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem Bourgeois, B

Reference 9

Resolution: malformed identifier; raw_fallback, observed 2026-08-11T18:47:33.726720Z

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.

Observation c0886879-be0f-4fe8-b32e-128d739b14f2 · outbound

This paper cites Carpaneto and P.

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem Carpaneto and P

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T18:47:33.708151Z

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.

Observation dc8623e7-a4c2-4bab-9a82-91b4674c7984 · outbound

This paper cites Chen and I.

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem Chen and I

Reference 11

Resolution: verified exact; doi, observed 2026-08-11T18:47:32.703242Z

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.

Observation 3e7559de-c2e3-4536-a70f-1891eca2691a · outbound

This paper cites an unresolved cited work.

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem Unresolved cited work

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-11T18:47:32.112487Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d48272aa-5105-4ce1-8e54-117a419cd0f8 · outbound

This paper cites Cygan, F.

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem Cygan, F

Reference 13

Resolution: malformed identifier; raw_fallback, observed 2026-08-11T18:47:33.689401Z

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.

Observation 26efeb4a-1c91-488a-8362-3f39ec21ce94 · outbound

This paper cites Dunning, J.

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem Dunning, J

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-11T18:47:32.123606Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1a3f4533-c526-4489-8a7d-6501dd61f1b9 · outbound

This paper cites Ebadi, A.

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem Ebadi, A

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T18:47:33.665712Z

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.

Observation 86dc1472-d49d-45c3-ae18-4ff26adff41f · outbound

This paper cites Eppstein , The traveling salesman problem for cubic graphs, J.

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem Eppstein , The traveling salesman problem for cubic graphs, J

Reference 16

Resolution: verified exact; doi, observed 2026-08-11T18:47:32.659226Z

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.

Observation 14599d84-a594-4057-80a4-bac22c0ae247 · outbound

This paper cites F airbanks, M.

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem F airbanks, M

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T18:47:33.646311Z

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.

Observation 5e55e8ca-ee22-4ed6-ba52-fadbc5ca8a60 · outbound

This paper cites Fischetti and M.

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem Fischetti and M

Reference 18

Resolution: malformed identifier; raw_fallback, observed 2026-08-11T18:47:33.625269Z

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.

Observation c2d8d61b-b4f2-4b30-a0ad-b13013ba4f13 · outbound

This paper cites an unresolved cited work.

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem Unresolved cited work

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-11T18:47:32.149016Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 96ae9f61-503e-4932-a813-e96e48f5affb · outbound

This paper cites an unresolved cited work.

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem Unresolved cited work

Reference 20

Resolution: verified exact; doi, observed 2026-08-11T18:47:32.642331Z

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.

Observation 71c75b04-a066-4f99-8049-284bee0a6d35 · outbound

This paper cites an unresolved cited work.

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem Unresolved cited work

Reference 21

Resolution: metadata mismatch; raw_fallback, observed 2026-08-11T18:47:33.299381Z

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.

Observation 0e219b49-cedd-4037-9c3c-025e0eebc963 · outbound

This paper cites Gamrath and C.

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem Gamrath and C

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-11T18:47:32.164949Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 23b8ac6c-f65f-4b84-a76d-64d723e4f8bb · outbound

This paper cites an unresolved cited work.

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem Unresolved cited work

Reference 23

Resolution: unresolved; raw_fallback, observed 2026-08-11T18:47:33.601223Z

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.

Observation 25978e3a-dda8-40ae-b1ca-7c809bd4e497 · outbound

This paper cites Hespe, S.

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem Hespe, S

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-11T18:47:32.174578Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6ad17a47-9e3c-4d4a-8ae5-8d26ccfc1dc8 · outbound

This paper cites Huangfu and J.

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem Huangfu and J

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-11T18:47:32.179535Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7a1232f2-f334-4fd0-85fa-091c9c995ab1 · outbound

This paper cites Impagliazzo and R.

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem Impagliazzo and R

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-11T18:47:32.185522Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cece0625-1db9-4b11-ae60-2c75d93c830c · outbound

This paper cites An $O^*(1.0821^n)$-Time Algorithm for Computing Maximum Independent Set in Graphs with Bounded Degree 3.

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem An $O^*(1.0821^n)$-Time Algorithm for Computing Maximum Independent Set in Graphs with Bounded Degree 3

Reference 27

Resolution: verified exact; local_arxiv, observed 2026-08-11T18:47:32.587071Z

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.

Observation cee0f75f-6e3b-4060-9f5b-91ab2ef280c9 · outbound

This paper cites Jian, An O(20.304n) algorithm for solving maximum independent set problem, IEEE Trans.

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem Jian, An O(20.304n) algorithm for solving maximum independent set problem, IEEE Trans

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-11T18:47:32.195865Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation aed0bd64-8e34-4791-b930-aef9718454e6 · outbound

This paper cites Khalil, P.

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem Khalil, P

Reference 29

Resolution: malformed identifier; raw_fallback, observed 2026-08-11T18:47:33.574742Z

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.

Observation 0b66da46-eb08-4a87-94aa-54b7268f7642 · outbound

This paper cites Kneis, A.

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem Kneis, A

Reference 30

Resolution: verified exact; raw_fallback, observed 2026-08-11T18:47:33.022001Z

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.

Observation 328b1b2a-f53d-4703-9420-67e411ddfc2f · outbound

This paper cites an unresolved cited work.

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem Unresolved cited work

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-11T18:47:32.210759Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 493b31ae-ea44-4026-a5c7-7a6a4883af0d · outbound

This paper cites Le Bodic and G.

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem Le Bodic and G

Reference 32

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T18:47:33.551943Z

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.

Observation 07b682a9-4ffa-4cd1-b41b-f159780bf197 · outbound

This paper cites an unresolved cited work.

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem Unresolved cited work

Reference 33

Resolution: malformed identifier; raw_fallback, observed 2026-08-11T18:47:33.533964Z

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.

Observation 365d03be-48dc-480c-985d-273d00dd5855 · outbound

This paper cites an unresolved cited work.

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem Unresolved cited work

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-11T18:47:32.226190Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 29c1eaf1-ab8b-4090-8f69-35a9449179b7 · outbound

This paper cites an unresolved cited work.

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem Unresolved cited work

Reference 35

Resolution: unresolved; raw_fallback, observed 2026-08-11T18:47:33.516074Z

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.

Observation 0bd093c7-8779-444a-af10-30d70aa28083 · outbound

This paper cites Lubin, O.

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem Lubin, O

Reference 36

Resolution: malformed identifier; raw_fallback, observed 2026-08-11T18:47:33.494205Z

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.

Observation ebde626b-a180-4684-8576-1de57d6f4ac6 · outbound

This paper cites an unresolved cited work.

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem Unresolved cited work

Reference 37

Resolution: unresolved; no resolver link, observed 2026-08-11T18:47:32.241315Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 22f8dd87-2359-463e-a525-3fd032d7a7e2 · outbound

This paper cites Moore and S.

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem Moore and S

Reference 38

Resolution: unresolved; no resolver link, observed 2026-08-11T18:47:32.245886Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bb1ee3e4-a685-4015-bd7d-8cd41fb94852 · outbound

This paper cites an unresolved cited work.

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem Unresolved cited work

Reference 39

Resolution: unresolved; no resolver link, observed 2026-08-11T18:47:32.252900Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bc811577-ce15-4e76-ae86-bc987b6d58ce · outbound

This paper cites Nabli, An overview on the simplex algorithm, Appl.

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem Nabli, An overview on the simplex algorithm, Appl

Reference 40

Resolution: verified exact; doi, observed 2026-08-11T18:47:32.515970Z

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.

Observation f916c15c-9ad0-472d-bab4-9e9158a4ec22 · outbound

This paper cites Peres and M.

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem Peres and M

Reference 41

Resolution: unresolved; no resolver link, observed 2026-08-11T18:47:32.263743Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2d57e746-6665-497a-8b49-1ffb2f540b13 · outbound

This paper cites Robson, Algorithms for maximum independent sets, J.

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem Robson, Algorithms for maximum independent sets, J

Reference 42

Resolution: unresolved; no resolver link, observed 2026-08-11T18:47:32.269222Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 53fbfeb1-6ae2-4e2b-8ff9-358b3843ffca · outbound

This paper cites an unresolved cited work.

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem Unresolved cited work

Reference 43

Resolution: unresolved; no resolver link, observed 2026-08-11T18:47:32.274297Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 04419795-d704-44d9-907c-96788f9f0e2f · outbound

This paper cites Urquhart, The complexity of propositional proofs, Bull.

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem Urquhart, The complexity of propositional proofs, Bull

Reference 44

Resolution: verified exact; doi, observed 2026-08-11T18:47:32.458443Z

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.

Observation 1ca23c28-fa04-4a43-802e-b39c70e4b95c · outbound

This paper cites New Branching Rules: Improvements on Independent Set and Vertex Cover in Sparse Graphs.

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem New Branching Rules: Improvements on Independent Set and Vertex Cover in Sparse Graphs

Reference 45

Resolution: verified exact; local_arxiv, observed 2026-08-11T18:47:32.437277Z

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.

Observation 5532ffd4-f44a-4c5e-a9ac-3c8a53084471 · outbound

This paper cites Xiao, A note on vertex cover in graphs with maximum degree 3, in Computing and Com- binatorics, Springer, 2010, pp.

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem Xiao, A note on vertex cover in graphs with maximum degree 3, in Computing and Com- binatorics, Springer, 2010, pp

Reference 46

Resolution: verified exact; doi, observed 2026-08-11T18:47:32.400597Z

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.

Observation edc4d1b8-90ce-42d3-b61a-3c36ff051184 · outbound

This paper cites Xiao and H.

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem Xiao and H

Reference 47

Resolution: unresolved; no resolver link, observed 2026-08-11T18:47:32.302920Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation aa36e7a9-d7e0-40be-8459-7ecf3930910b · outbound

This paper cites Xiao and H.

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem Xiao and H

Reference 48

Resolution: unresolved; no resolver link, observed 2026-08-11T18:47:32.309516Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

Observation 2323bdad-dc0c-4f72-8024-5e2f09e5f049 · inbound

Programming guide for solving constraint satisfaction problems with tensor networks cites this paper.

Programming guide for solving constraint satisfaction problems with tensor networks Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem

Reference 23

Resolution: verified exact; local_arxiv, observed 2026-08-10T23:01:35.457335Z

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.