Pith. sign in

Paper Citation Record · LEDGER

Pure Nash Equilibria in Graphical Games of Bounded Width Revisited

As of 13 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 0 inbound Pith citation observations for arXiv:2607.07627.

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

pith.paper-citation-record.v1
2607.07627 v1

Coverage vector

measured 37 of 37 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-07-09T04:41:50.210247Z

measured 37 of 37 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-13T06:32:02.005865+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

37 of 37 outbound references displayed

  • verified exact28
  • verified fuzzy4
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch5

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 9af3ca02-b4a0-4816-ab3b-6978043dbdf0 · outbound

This paper cites Pure Nash Equilibria in Graphical Games and Treewidth.

Pure Nash Equilibria in Graphical Games of Bounded Width Revisited Pure Nash Equilibria in Graphical Games and Treewidth

Reference 1

Resolution
verified fuzzy
raw_fallback, observed 2026-07-09T04:45:58.703610Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-07-09T04:41:50.210247Z digest=sha256:f5ed331014bfcac565ec96e4389b0d27a90bcb4b42bc3e820a6931621aa5d3f4

Observation e78786e9-184d-4504-9d92-9f30eb01ec8b · outbound

This paper cites Computing Square Colorings on Bounded-Treewidth and Planar Graphs.

Pure Nash Equilibria in Graphical Games of Bounded Width Revisited Computing Square Colorings on Bounded-Treewidth and Planar Graphs

Reference 2

Resolution
verified exact
doi, observed 2026-07-09T04:45:58.553761Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-07-09T04:41:50.210247Z digest=sha256:c9ecdf08c3bf44ab1709ae3c42da2abfd304df9cd20948bc415b16c2ef9ea69d

Observation aa132b6d-f960-4429-897a-878c68827199 · outbound

This paper cites Grundy distinguishes treewidth from pathwidth.

Pure Nash Equilibria in Graphical Games of Bounded Width Revisited Grundy distinguishes treewidth from pathwidth

Reference 3

Resolution
verified exact
doi, observed 2026-07-09T04:45:58.545437Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-07-09T04:41:50.210247Z digest=sha256:fd05acf1e1fd6bd31d88a8007eccb3d9e2c967f3b36f9b7feb5ccf747307726f

Observation e7d7bef3-87d3-4841-9c8e-a7e1b14e3f10 · outbound

This paper cites The complexity of computational problems about nash equilibria in symmetric win-lose games.

Pure Nash Equilibria in Graphical Games of Bounded Width Revisited The complexity of computational problems about nash equilibria in symmetric win-lose games

Reference 4

Resolution
verified exact
doi, observed 2026-07-09T04:45:58.541060Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-07-09T04:41:50.210247Z digest=sha256:52082450cfa83d080e34473581d68b5e5f9a785379aab45e0e808a2bee1c3829

Observation 375e11da-5063-4a07-9fae-3928294c07d4 · outbound

This paper cites A new approach on locally checkable problems.

Pure Nash Equilibria in Graphical Games of Bounded Width Revisited A new approach on locally checkable problems

Reference 5

Resolution
verified exact
doi, observed 2026-07-09T04:45:58.534266Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-07-09T04:41:50.210247Z digest=sha256:d64aa5b3f38a2ae1acd6cf15d9f24a3c4624017c1c61a5e5ee8a80598c11c3c1

Observation c1abbca5-0b97-4def-93f1-e139b4ccabd6 · outbound

This paper cites New complexity results about Nash equilibria.

Pure Nash Equilibria in Graphical Games of Bounded Width Revisited New complexity results about Nash equilibria

Reference 6

Resolution
verified exact
doi, observed 2026-07-09T04:45:58.540206Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-07-09T04:41:50.210247Z digest=sha256:0318398f532157222347588d869c437f7aec8ea88bf0f6577ffe4100026cc43e

Observation 0bc32c59-dc9c-4ea0-be28-042316ddabeb · outbound

This paper cites 6 Josep Díaz, Olli Pottonen, Maria J.

Pure Nash Equilibria in Graphical Games of Bounded Width Revisited 6 Josep Díaz, Olli Pottonen, Maria J

Reference 7

Resolution
metadata mismatch
doi, observed 2026-07-09T04:45:58.555987Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-07-09T04:41:50.210247Z digest=sha256:c167ac793e086fed3273b30509a974c05eaeb1f42279c37127f97a0aa48ff9c6

Observation 2bac8bbe-6a35-4b55-a42f-bb17f2d2b71d · outbound

This paper cites Fast hamiltonicity checking via bases of perfect matchings.

Pure Nash Equilibria in Graphical Games of Bounded Width Revisited Fast hamiltonicity checking via bases of perfect matchings

Reference 8

Resolution
verified exact
doi, observed 2026-07-09T04:45:58.559777Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-07-09T04:41:50.210247Z digest=sha256:631d80cf9452653774f922ccc975250dcb1b889bcc5f3a9843f53f24cbadf23d

Observation a26f0747-b72a-44cc-a968-729e2091653c · outbound

This paper cites Goldberg.

Pure Nash Equilibria in Graphical Games of Bounded Width Revisited Goldberg

Reference 9

Resolution
metadata mismatch
arxiv_id, observed 2026-07-09T04:45:58.549999Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-07-09T04:41:50.210247Z digest=sha256:46f57cf7ac3cddce7186c03c942d6dbec777b3533738a806ab89c314eadb06b6

Observation 7061c257-4bba-4756-9067-a8a07e6b9a8e · outbound

This paper cites Goldberg.

Pure Nash Equilibria in Graphical Games of Bounded Width Revisited Goldberg

Reference 10

Resolution
metadata mismatch
arxiv_id, observed 2026-07-09T04:45:58.543105Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-07-09T04:41:50.210247Z digest=sha256:8308cc0d241bde317cdc725008faaa8d26bc06d7524b1ac46ed0418cd83407be

Observation bedfc06e-8adb-4557-a89d-4d9b0ebaa945 · outbound

This paper cites Goldberg.

Pure Nash Equilibria in Graphical Games of Bounded Width Revisited Goldberg

Reference 11

Resolution
verified exact
arxiv_id, observed 2026-07-09T04:45:58.562628Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-07-09T04:41:50.210247Z digest=sha256:43d7fbace1a94e3dac2bbd9bdadf51fe1650f78cced56bf7dc6bea979c59ec74

Observation 2e86158d-5239-453a-938b-7188f167eabe · outbound

This paper cites Generalized graph packing problems parameterized by treewidth.

Pure Nash Equilibria in Graphical Games of Bounded Width Revisited Generalized graph packing problems parameterized by treewidth

Reference 12

Resolution
verified exact
doi, observed 2026-07-09T04:45:58.492576Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-07-09T04:41:50.210247Z digest=sha256:52b0c16e39cd2273316323d8656f69801c1c8b006b49dadb44cd622d44127e81

Observation 2227c40a-444d-4f57-9db6-44c3f764d50d · outbound

This paper cites Pure nash equilibria: Hard and easy games.

Pure Nash Equilibria in Graphical Games of Bounded Width Revisited Pure nash equilibria: Hard and easy games

Reference 13

Resolution
verified exact
doi, observed 2026-07-09T04:45:58.565222Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-07-09T04:41:50.210247Z digest=sha256:fd3b889acb685c99a9a9a1182d9265ce4cae50bbff98b874e18f27b141f714b5

Observation fe54af3b-a048-4780-97a9-d50517e4e5fe · outbound

This paper cites Fixed-parameter complexity in AI and nonmonotonic reasoning.

Pure Nash Equilibria in Graphical Games of Bounded Width Revisited Fixed-parameter complexity in AI and nonmonotonic reasoning

Reference 14

Resolution
verified exact
doi, observed 2026-07-09T04:45:58.538388Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-07-09T04:41:50.210247Z digest=sha256:2e36dac980693a3b3254ce4fde6f14f0743162491bc25a9729e6171e2414793b

Observation 75d7c426-9bd5-4d15-8e5d-27fd0f906abd · outbound

This paper cites On the complexity of constrained Nash equilibria in graphical games.

Pure Nash Equilibria in Graphical Games of Bounded Width Revisited On the complexity of constrained Nash equilibria in graphical games

Reference 15

Resolution
verified exact
doi, observed 2026-07-09T04:45:58.576344Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-07-09T04:41:50.210247Z digest=sha256:6f909b72f4ce5f76fb4d774af99993eb4d92462e02dd57d8d0fdb0e321a488bd

Observation 5271ae47-1312-4efe-abf4-a823e98aef57 · outbound

This paper cites Thepriceofbeingpartial: Complexityofpartialgeneralized dominating set on bounded-treewidth graphs.CoRR, abs/2506.01645.

Pure Nash Equilibria in Graphical Games of Bounded Width Revisited Thepriceofbeingpartial: Complexityofpartialgeneralized dominating set on bounded-treewidth graphs.CoRR, abs/2506.01645

Reference 16

Resolution
verified exact
arxiv_id, observed 2026-07-09T04:45:58.568265Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-07-09T04:41:50.210247Z digest=sha256:de485b61cd759b097a03b5afa0b65b257e65f31ad894dbd36cc9d47c6730e287

Observation 38a561e3-2ebf-40cd-8bc0-3bf3025236ca · outbound

This paper cites 24 Peter E.

Pure Nash Equilibria in Graphical Games of Bounded Width Revisited 24 Peter E

Reference 17

Resolution
metadata mismatch
doi, observed 2026-07-09T04:45:58.583017Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-07-09T04:41:50.210247Z digest=sha256:69a3440d0c0624b1cebbd5b047db34580ac4d5bc96de7ff9581e2ce728007b05

Observation 84b7021f-1aff-4379-884d-4e014589ddec · outbound

This paper cites Computing L (p, 1)- Labeling with Combined Parameters.

Pure Nash Equilibria in Graphical Games of Bounded Width Revisited Computing L (p, 1)- Labeling with Combined Parameters

Reference 18

Resolution
verified exact
doi, observed 2026-07-09T04:45:58.574466Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-07-09T04:41:50.210247Z digest=sha256:f9a52aa0dea4cdc856d0d4ec700fc24db7fd946aa247ac00aadb93d7adb9f881

Observation 9155893a-bebf-48a2-b199-d8f6c26c3578 · outbound

This paper cites Hedonic games and treewidth revisited.

Pure Nash Equilibria in Graphical Games of Bounded Width Revisited Hedonic games and treewidth revisited

Reference 19

Resolution
verified exact
doi, observed 2026-07-09T04:45:58.509503Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-07-09T04:41:50.210247Z digest=sha256:c89632b8df60e8e788f459e71b2efa4fedc4d2936a8ec84555cda8e7ad001f28

Observation 4778badc-b939-494c-a50a-ea709ff976a6 · outbound

This paper cites Hartmann and D \' a niel Marx.

Pure Nash Equilibria in Graphical Games of Bounded Width Revisited Hartmann and D \' a niel Marx

Reference 20

Resolution
verified exact
doi, observed 2026-07-09T04:45:58.557722Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-07-09T04:41:50.210247Z digest=sha256:9fd5871d4be1bf8548acf3ce7b50344e51600783dde9af270e610dc14da2c71a

Observation 9b5f78f4-f691-4016-9879-066eab9fe809 · outbound

This paper cites Pure nash equilibria: complete characterization of hard and easy graphical games.

Pure Nash Equilibria in Graphical Games of Bounded Width Revisited Pure nash equilibria: complete characterization of hard and easy graphical games

Reference 21

Resolution
verified fuzzy
raw_fallback, observed 2026-07-09T04:45:58.701287Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-07-09T04:41:50.210247Z digest=sha256:db2d11b686acadb10e1d71793f18ca9370ae1d4cf3d655191d83dd9a1dbe4d78

Observation 4d47c0c7-a37f-497c-bc4c-c759eb487b19 · outbound

This paper cites Improved ( In -) Approximability Bounds for d- Scattered Set.

Pure Nash Equilibria in Graphical Games of Bounded Width Revisited Improved ( In -) Approximability Bounds for d- Scattered Set

Reference 22

Resolution
verified exact
doi, observed 2026-07-09T04:45:58.532096Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-07-09T04:41:50.210247Z digest=sha256:3c5b5117ecdd09740ca4b82919f422ab6a7d2a5b52f8cfabad1deaa9658e85a2

Observation 3579169e-9011-40af-bb24-a4f67f49a570 · outbound

This paper cites Kearns, Michael L.

Pure Nash Equilibria in Graphical Games of Bounded Width Revisited Kearns, Michael L

Reference 23

Resolution
verified fuzzy
raw_fallback, observed 2026-07-09T04:45:58.705479Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-07-09T04:41:50.210247Z digest=sha256:033c34d932e05884a8c3f7b4213dd2b9fc90bd60d04cdf281134d66c93ac9b86

Observation 8e832e02-89d5-4cd7-8ebb-21fb3bf48db1 · outbound

This paper cites Multi-agent influence diagrams for representing and solving games.

Pure Nash Equilibria in Graphical Games of Bounded Width Revisited Multi-agent influence diagrams for representing and solving games

Reference 24

Resolution
verified exact
doi, observed 2026-07-09T04:45:58.560562Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-07-09T04:41:50.210247Z digest=sha256:9c0d17b8cbf381418a8418c164db01f887d4669cbe5529bb205950874740e168

Observation e23d822e-266f-4efc-91dc-c1813973151c · outbound

This paper cites Krumke, Madhav V.

Pure Nash Equilibria in Graphical Games of Bounded Width Revisited Krumke, Madhav V

Reference 25

Resolution
verified exact
doi, observed 2026-07-09T04:45:58.569428Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-07-09T04:41:50.210247Z digest=sha256:0a22a1997ee57765d23a02c55a986ad22a74fad1d5dde944d78005a3e7049c7c

Observation ffc24642-5b3a-4153-a0da-123eca41edfb · outbound

This paper cites Minimum stable cut and treewidth.

Pure Nash Equilibria in Graphical Games of Bounded Width Revisited Minimum stable cut and treewidth

Reference 26

Resolution
verified exact
doi, observed 2026-07-09T04:45:58.558740Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-07-09T04:41:50.210247Z digest=sha256:d6c0d6539db43d014f99425d1685117a2a0653c69b3956d187fca8451a96b63e

Observation 59da06f9-979a-45c0-ad71-3918ff38e9c9 · outbound

This paper cites First order logic on pathwidth revisited again.

Pure Nash Equilibria in Graphical Games of Bounded Width Revisited First order logic on pathwidth revisited again

Reference 27

Resolution
verified exact
doi, observed 2026-07-09T04:45:58.497978Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-07-09T04:41:50.210247Z digest=sha256:265dde494875be29fa0c9dd06b3bff1f0db7d153ad9c634577c5930d91ab1c0b

Observation b2c68038-3867-4e06-8c92-c5bebed33619 · outbound

This paper cites The Primal Pathwidth SETH.

Pure Nash Equilibria in Graphical Games of Bounded Width Revisited The Primal Pathwidth SETH

Reference 28

Resolution
verified exact
doi, observed 2026-07-09T04:45:58.547253Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-07-09T04:41:50.210247Z digest=sha256:1ff1149bc20f900890168ab5a03e631ef75e984b05b89a7ebef68dfda09143de

Observation 55cdcc10-c7f0-48c9-8ce1-41afd8d1df34 · outbound

This paper cites Circuits and backdoors: Five shades of the SETH.

Pure Nash Equilibria in Graphical Games of Bounded Width Revisited Circuits and backdoors: Five shades of the SETH

Reference 29

Resolution
verified exact
doi, observed 2026-07-09T04:45:58.503024Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-07-09T04:41:50.210247Z digest=sha256:9e0c1e46677586f4a03cf14fabaf1f382a547ce54db3c3b07e305764f37979c7

Observation fda5d6e1-b345-42ad-924b-38a485649911 · outbound

This paper cites Structural parameterizations for induced and acyclic matching.

Pure Nash Equilibria in Graphical Games of Bounded Width Revisited Structural parameterizations for induced and acyclic matching

Reference 30

Resolution
verified exact
doi, observed 2026-07-09T04:45:58.573557Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-07-09T04:41:50.210247Z digest=sha256:444de04d7065136a94f98460c4cf473bebf950f3f72c13d0f8620f3f1fc82d07

Observation d3b5c995-c2fa-49e7-bce6-ded8f20cb13a · outbound

This paper cites Papadimitriou and Binghui Peng.

Pure Nash Equilibria in Graphical Games of Bounded Width Revisited Papadimitriou and Binghui Peng

Reference 31

Resolution
verified exact
doi, observed 2026-07-09T04:45:58.554629Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-07-09T04:41:50.210247Z digest=sha256:9be908e8fac62bf72bb35ea10706002f826ac77eff5560a97540aab9c5c00a9b

Observation aeb37c3f-08f3-4fdb-a04c-b9393fd48451 · outbound

This paper cites Graphical hedonic games of bounded treewidth.

Pure Nash Equilibria in Graphical Games of Bounded Width Revisited Graphical hedonic games of bounded treewidth

Reference 32

Resolution
verified exact
doi, observed 2026-07-09T04:45:58.567666Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-07-09T04:41:50.210247Z digest=sha256:39c5a6ab6e2515ee5f22c6b8692f55260465b56c50725508a276a3750c1f623e

Observation 30820ce7-5016-46bd-962a-2c0df7a5b5b5 · outbound

This paper cites Faster, higher, easier: Toward a systematic study of parameterized vertex and edge selection problems.

Pure Nash Equilibria in Graphical Games of Bounded Width Revisited Faster, higher, easier: Toward a systematic study of parameterized vertex and edge selection problems

Reference 33

Resolution
verified exact
doi, observed 2026-07-09T04:45:58.538587Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-07-09T04:41:50.210247Z digest=sha256:9fc69c08fbdd561658cf534d053ab008ef77598ee838a76cd88731cb3006df61

Observation 5eac8473-3504-4998-8524-42e05a3bc2ab · outbound

This paper cites an unresolved cited work.

Pure Nash Equilibria in Graphical Games of Bounded Width Revisited Unresolved cited work

Reference 34

Resolution
verified exact
arxiv_id, observed 2026-07-09T04:45:58.519751Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-07-09T04:41:50.210247Z digest=sha256:23dfa2eaaa3f598f440776ffb46e5a67abe8b1d0786edd0a7979919863eb513e

Observation 57870a8a-e4c2-4c3e-875b-881a6b29f429 · outbound

This paper cites Modular Properties of Conditional Term R ewriting Systems.

Pure Nash Equilibria in Graphical Games of Bounded Width Revisited Modular Properties of Conditional Term R ewriting Systems

Reference 35

Resolution
metadata mismatch
arxiv_id, observed 2026-07-09T04:45:58.572325Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-07-09T04:41:50.210247Z digest=sha256:1af8b78d73c24f6fdb4dcb30a57bcfa0255dded357ed484f7e70e8efcdccdd65

Observation 8836864b-2bf6-479d-ad20-4db553f2564d · outbound

This paper cites Pure Nash Equilibria in Graphical Games and Treewidth.

Pure Nash Equilibria in Graphical Games of Bounded Width Revisited Pure Nash Equilibria in Graphical Games and Treewidth

Reference 36

Resolution
verified exact
doi, observed 2026-07-09T04:45:58.513497Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-07-09T04:41:50.210247Z digest=sha256:e3d49b8b36860d6a00a2362d84657f3e87f331bb0d4125773669dddb12f7b8ba

Observation ea6c57e7-a091-4bd0-baf4-2ba8d8245385 · outbound

This paper cites Deciding morality of graphs is NP -complete.

Pure Nash Equilibria in Graphical Games of Bounded Width Revisited Deciding morality of graphs is NP -complete

Reference 37

Resolution
verified fuzzy
raw_fallback, observed 2026-07-09T04:45:58.707286Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-07-09T04:41:50.210247Z digest=sha256:26076eece8bc48ed30987c855cd62671824a7e5d2bd06452a20da1c624f0d782

Pith citing papers

No inbound Pith citation observations are available.