Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-06T19:38:14.402715Z
Paper Citation Record · LEDGER
On the Complexity of Problems on Graphs Defined on Groups
As of 18 August 2026, this Paper Citation Record lists 33 of 33 outbound references and 0 inbound Pith citation observations for arXiv:2507.05860.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-18T06:34:40.430872+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
Reference resolution
33 of 33 outbound references displayed
- verified exact2
- verified fuzzy27
- unresolved4
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation 146f4477-8b26-4196-ae9d-6e9fb28e7c95 · outbound
This paper cites On the Structure of the Power Graph and the Enhanced Power Graph of a Group.
On the Complexity of Problems on Graphs Defined on Groups On the Structure of the Power Graph and the Enhanced Power Graph of a Group
Reference 1
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T19:38:19.394314Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation b59672f9-52c1-4f7e-ab2e-6625b1701ac7 · outbound
This paper cites an unresolved cited work.
On the Complexity of Problems on Graphs Defined on Groups Unresolved cited work
Reference 2
- Resolution
- unresolved
- raw_fallback, observed 2026-08-06T19:38:19.385035Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation 1ec0a0d4-83a9-4be5-b8ab-241f60904c6a · outbound
This paper cites Aspects of the commuting graph.
On the Complexity of Problems on Graphs Defined on Groups Aspects of the commuting graph
Reference 3
- Resolution
- verified exact
- local_arxiv, observed 2026-08-06T19:38:14.656461Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation be5ee6d0-bce0-49d0-8ad0-b93cb8ce62a5 · outbound
This paper cites Solvable group isomorphism is (almost) in NP /spl cap/ CoNP.
On the Complexity of Problems on Graphs Defined on Groups Solvable group isomorphism is (almost) in NP /spl cap/ CoNP
Reference 4
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T19:38:19.375376Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation 6a95d224-3e20-4385-8b5a-38b31be1bf45 · outbound
This paper cites Graph isomorphism in quasipolynomial time.
On the Complexity of Problems on Graphs Defined on Groups Graph isomorphism in quasipolynomial time
Reference 5
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T19:38:19.365525Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation fb6c1221-0ab5-4509-9ddb-8e84c8dc4ba6 · outbound
This paper cites The graph motif problem parameterized by the structure of the input graph.
On the Complexity of Problems on Graphs Defined on Groups The graph motif problem parameterized by the structure of the input graph
Reference 6
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T19:38:19.354806Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation 638e6a87-492a-4128-ab5e-6bc56e1df484 · outbound
This paper cites Superpolynomial circuits, almost sparse oracles and the exponential hierarchy.
On the Complexity of Problems on Graphs Defined on Groups Superpolynomial circuits, almost sparse oracles and the exponential hierarchy
Reference 7
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T19:38:19.346282Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation bfe0b4d1-c75b-4dea-be2a-175a6498cf1e · outbound
This paper cites Graphs defined on groups.
On the Complexity of Problems on Graphs Defined on Groups Graphs defined on groups
Reference 8
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T19:38:19.337526Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation 596b9be9-9965-4b1f-9fd9-00252040febe · outbound
This paper cites Undirected power graphs of semigroups.
On the Complexity of Problems on Graphs Defined on Groups Undirected power graphs of semigroups
Reference 9
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T19:38:19.327886Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation 9491c461-ca8c-4583-90de-ed9a0d283ec5 · outbound
This paper cites The Isomorphism Problem of Power Graphs and a Question of Cameron.
On the Complexity of Problems on Graphs Defined on Groups The Isomorphism Problem of Power Graphs and a Question of Cameron
Reference 10
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T19:38:19.317981Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation 9fb79876-8d41-4d5d-88b9-f9a434c05ad7 · outbound
This paper cites The minimal faithful permutation degree of groups without abelian normal subgroups.
On the Complexity of Problems on Graphs Defined on Groups The minimal faithful permutation degree of groups without abelian normal subgroups
Reference 11
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T19:38:19.306772Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation 2e735c67-2616-4145-88a6-c75099dd1d44 · outbound
This paper cites Succinct representation of finite abelian groups.
On the Complexity of Problems on Graphs Defined on Groups Succinct representation of finite abelian groups
Reference 12
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T19:38:19.295019Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation 44dd6b80-233c-4849-895d-9e8947ae6b29 · outbound
This paper cites Sharp tractability borderlines for finding connected motifs in vertex-colored graphs.
On the Complexity of Problems on Graphs Defined on Groups Sharp tractability borderlines for finding connected motifs in vertex-colored graphs
Reference 13
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T19:38:19.115121Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation e52e22d2-bde1-411e-9174-613b96fd5957 · outbound
This paper cites The full automorphism group of the power (di)graph of a finite group.
On the Complexity of Problems on Graphs Defined on Groups The full automorphism group of the power (di)graph of a finite group
Reference 14
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T19:38:18.737785Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation 0db144f4-7948-4fae-bc0d-8f1860cda3cf · outbound
This paper cites an unresolved cited work.
On the Complexity of Problems on Graphs Defined on Groups Unresolved cited work
Reference 15
- Resolution
- unresolved
- raw_fallback, observed 2026-08-06T19:38:18.536962Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation a4e7e426-a73a-4d7a-b8fd-fd241f9e59bc · outbound
This paper cites The polycyclic length of linear and finite polycyclic groups.
On the Complexity of Problems on Graphs Defined on Groups The polycyclic length of linear and finite polycyclic groups
Reference 16
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T19:38:18.275049Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation 38c9025f-33ea-4a46-aaa1-c000735792dd · outbound
This paper cites Using Neighborhood Diversity to Solve Hard Problems.
On the Complexity of Problems on Graphs Defined on Groups Using Neighborhood Diversity to Solve Hard Problems
Reference 17
- Resolution
- unresolved
- no resolver link, observed 2026-08-06T19:38:13.427979Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation b5867991-3a0d-4b14-bfb5-146815230d4a · outbound
This paper cites NP-hard sets are not sparse unless P=NP: An exposition of a simple proof of Mahaney's Theorem, with applications.
On the Complexity of Problems on Graphs Defined on Groups NP-hard sets are not sparse unless P=NP: An exposition of a simple proof of Mahaney's Theorem, with applications
Reference 18
- Resolution
- verified exact
- local_arxiv, observed 2026-08-06T19:38:14.550230Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation 4ade8f62-18fc-4cf5-a007-7959cb1fde1b · outbound
This paper cites Geometric algorithms and combinatorial optimization.
On the Complexity of Problems on Graphs Defined on Groups Geometric algorithms and combinatorial optimization
Reference 19
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T19:38:18.005280Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation 8cc55103-f903-4b15-949a-403020d3cfa4 · outbound
This paper cites Finding and counting vertex-colored subtrees.
On the Complexity of Problems on Graphs Defined on Groups Finding and counting vertex-colored subtrees
Reference 20
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T19:38:17.722336Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation 547df502-613c-4c81-844a-edde3f5ba2a1 · outbound
This paper cites Enumerating p-groups. I: Inequalities.
On the Complexity of Problems on Graphs Defined on Groups Enumerating p-groups. I: Inequalities
Reference 21
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T19:38:17.383416Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation 8b3b8844-cf1a-4f39-a011-30a101b2ff41 · outbound
This paper cites Which problems have strongly exponential complexity?.
On the Complexity of Problems on Graphs Defined on Groups Which problems have strongly exponential complexity?
Reference 22
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T19:38:17.080114Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation 37cdbfc3-f754-44f5-8f90-7b15735437e7 · outbound
This paper cites A combinatorial property and power graphs of groups.
On the Complexity of Problems on Graphs Defined on Groups A combinatorial property and power graphs of groups
Reference 23
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T19:38:16.853455Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation 579f50a0-1885-4544-9ace-b1ac0a53d0fd · outbound
This paper cites Motif search in graphs: application to metabolic networks.
On the Complexity of Problems on Graphs Defined on Groups Motif search in graphs: application to metabolic networks
Reference 24
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T19:38:16.591244Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation 89ab29b3-bdc3-4232-9a07-a78207fa9cca · outbound
This paper cites Algorithmic meta-theorems for restrictions of treewidth.
On the Complexity of Problems on Graphs Defined on Groups Algorithmic meta-theorems for restrictions of treewidth
Reference 25
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T19:38:16.367377Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation 00246a72-d943-4af8-8bfa-8dfffe74c4f9 · outbound
This paper cites Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis.
On the Complexity of Problems on Graphs Defined on Groups Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis
Reference 26
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T19:38:16.079438Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation 8d32a725-8012-41e1-8c5d-84cd8b2f2e35 · outbound
This paper cites Enumerating finite groups.
On the Complexity of Problems on Graphs Defined on Groups Enumerating finite groups
Reference 27
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T19:38:15.810823Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation aadf4c64-5e83-42af-9287-b7654a0cc1bb · outbound
This paper cites On the nlog n isomorphism technique (a preliminary report).
On the Complexity of Problems on Graphs Defined on Groups On the nlog n isomorphism technique (a preliminary report)
Reference 28
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T19:38:15.607250Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation 70e69679-6bd5-42cd-b813-de69232f06e1 · outbound
This paper cites Deterministic parameterized algorithms for the graph motif problem.
On the Complexity of Problems on Graphs Defined on Groups Deterministic parameterized algorithms for the graph motif problem
Reference 29
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T19:38:15.476015Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation b4eca8f8-9b28-4670-ad2f-e7c30a1907a7 · outbound
This paper cites The undirected power graph of a finite group.
On the Complexity of Problems on Graphs Defined on Groups The undirected power graph of a finite group
Reference 30
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T19:38:15.263546Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation ee15f152-3873-4cb4-a2f1-8a818410b94e · outbound
This paper cites Ribenboim.
On the Complexity of Problems on Graphs Defined on Groups Ribenboim
Reference 31
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T19:38:15.066496Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation b27c5ee0-8e21-438b-bd2d-473ef12f9aca · outbound
This paper cites Approximate formulas for some functions of prime numbers.
On the Complexity of Problems on Graphs Defined on Groups Approximate formulas for some functions of prime numbers
Reference 32
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T19:38:14.917406Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation 60dbdbe1-7429-46c0-90a0-1c1d4cc6d2de · outbound
This paper cites an unresolved cited work.
On the Complexity of Problems on Graphs Defined on Groups Unresolved cited work
Reference 33
- Resolution
- unresolved
- raw_fallback, observed 2026-08-06T19:38:14.782655Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Pith citing papers
No inbound Pith citation observations are available.