Complexity and Geometry of Sampling Connected Graph Partitions | Paper Citation Record

Observation 5876e57b-2379-4f87-9578-c9d6c9a30f9f · outbound

This paper cites an unresolved cited work.

Complexity and Geometry of Sampling Connected Graph Partitions Unresolved cited work

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-14T11:40:32.419785Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5952ae0f-348d-4b86-86b8-01c9c2a8da40 · outbound

This paper cites an unresolved cited work.

Complexity and Geometry of Sampling Connected Graph Partitions Unresolved cited work

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-14T11:40:32.425434Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1240c6af-4b55-4c4e-aff2-cc5564d3e332 · outbound

This paper cites an unresolved cited work.

Complexity and Geometry of Sampling Connected Graph Partitions Unresolved cited work

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-14T11:40:32.430782Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4933c084-576a-4ee9-bf42-7e87bbb61b05 · outbound

This paper cites an unresolved cited work.

Complexity and Geometry of Sampling Connected Graph Partitions Unresolved cited work

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-14T11:40:32.435646Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 87277ca5-968b-41f0-a08c-be06916455bd · outbound

This paper cites an unresolved cited work.

Complexity and Geometry of Sampling Connected Graph Partitions Unresolved cited work

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-14T11:40:32.440812Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 96cafbb6-c6b2-412c-beda-16dd13d750ed · outbound

This paper cites an unresolved cited work.

Complexity and Geometry of Sampling Connected Graph Partitions Unresolved cited work

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-14T11:40:32.445737Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e814ae3e-b8a3-4b35-b3d0-dbaf896cf230 · outbound

This paper cites an unresolved cited work.

Complexity and Geometry of Sampling Connected Graph Partitions Unresolved cited work

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-14T11:40:32.451929Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4db02430-1098-4278-8e0e-72ad4890d28b · outbound

This paper cites an unresolved cited work.

Complexity and Geometry of Sampling Connected Graph Partitions Unresolved cited work

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-14T11:40:32.456829Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f499618c-e90a-4144-a63e-31efb4e94a6b · outbound

This paper cites an unresolved cited work.

Complexity and Geometry of Sampling Connected Graph Partitions Unresolved cited work

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-14T11:40:32.461491Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a4b74fa6-6d34-4607-8603-637bbf1c7dd5 · outbound

This paper cites Aaronson, P ?= NP, in Open problems in mathematics, Springer, 2016, pp.

Complexity and Geometry of Sampling Connected Graph Partitions Aaronson, P ?= NP, in Open problems in mathematics, Springer, 2016, pp

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-14T11:40:32.466057Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5b95b303-78b2-4cdc-8ce3-20c524444602 · outbound

This paper cites Abbott and D.

Complexity and Geometry of Sampling Connected Graph Partitions Abbott and D

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-14T11:40:32.471160Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0ac003ab-a607-48bd-bb65-14dc77eab667 · outbound

This paper cites Reconfiguration of Connected Graph Partitions.

Complexity and Geometry of Sampling Connected Graph Partitions Reconfiguration of Connected Graph Partitions

Reference 12

Resolution: verified exact; local_arxiv, observed 2026-08-14T11:40:33.421305Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation c464a907-61d1-4da0-96d9-57a6517b4c56 · outbound

This paper cites Altman, Is automation the answer: The computational complexity of automated redistricting , Rutgers Computer and Law Technology Journal, 23 (1997).

Complexity and Geometry of Sampling Connected Graph Partitions Altman, Is automation the answer: The computational complexity of automated redistricting , Rutgers Computer and Law Technology Journal, 23 (1997)

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-14T11:40:32.481007Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c808a8ef-71ec-4d8e-b4aa-070457488805 · outbound

This paper cites Arnborg, J.

Complexity and Geometry of Sampling Connected Graph Partitions Arnborg, J

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-14T11:40:32.485722Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 572b8cd1-79d3-4f13-8303-cde05710282e · outbound

This paper cites Arora and B.

Complexity and Geometry of Sampling Connected Graph Partitions Arora and B

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-14T11:40:32.490544Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3583f536-67dc-4256-afaa-5d6bd952149a · outbound

This paper cites Redistricting: Drawing the Line.

Complexity and Geometry of Sampling Connected Graph Partitions Redistricting: Drawing the Line

Reference 16

Resolution: verified exact; local_arxiv, observed 2026-08-14T11:40:33.398275Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 83e25f60-00f0-4733-ba6e-1cf5eaecd9fb · outbound

This paper cites The Gerrymandering Jumble: Map Projections Permute Districts' Compactness Scores.

Complexity and Geometry of Sampling Connected Graph Partitions The Gerrymandering Jumble: Map Projections Permute Districts' Compactness Scores

Reference 17

Resolution: verified exact; local_arxiv, observed 2026-08-14T11:40:33.377543Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 131eb978-46e8-4a23-a420-d72ad1ef4336 · outbound

This paper cites Gerrymandering and Compactness: Implementation Flexibility and Abuse.

Complexity and Geometry of Sampling Connected Graph Partitions Gerrymandering and Compactness: Implementation Flexibility and Abuse

Reference 18

Resolution: verified exact; local_arxiv, observed 2026-08-14T11:40:33.354930Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 499de6d3-54b9-4b8b-bd80-d972450af541 · outbound

This paper cites an unresolved cited work.

Complexity and Geometry of Sampling Connected Graph Partitions Unresolved cited work

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-14T11:40:32.511611Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 907d867c-3211-4d70-a7ed-ce85a70b6409 · outbound

This paper cites Fixed-parameter tractability of counting small minimum $(S,T)$-cuts.

Complexity and Geometry of Sampling Connected Graph Partitions Fixed-parameter tractability of counting small minimum $(S,T)$-cuts

Reference 20

Resolution: verified exact; local_arxiv, observed 2026-08-14T11:40:33.332431Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 1bc5e1ff-56a0-4406-937a-04c2c7972219 · outbound

This paper cites Bez´akov´a, E.

Complexity and Geometry of Sampling Connected Graph Partitions Bez´akov´a, E

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-14T11:40:32.521301Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation aee96c9f-a88f-4ed0-a126-da9f15f6994f · outbound

This paper cites an unresolved cited work.

Complexity and Geometry of Sampling Connected Graph Partitions Unresolved cited work

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-14T11:40:32.525871Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 15161852-44ec-45cd-8785-e7f60eba1045 · outbound

This paper cites Bouchitt´e, F.

Complexity and Geometry of Sampling Connected Graph Partitions Bouchitt´e, F

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-14T11:40:32.530645Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9b31aa88-d918-4677-ba26-338c2ca6382b · outbound

This paper cites Bousquet-M´elou, A.

Complexity and Geometry of Sampling Connected Graph Partitions Bousquet-M´elou, A

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-14T11:40:32.535444Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c077c061-e95c-445f-a5d5-dad47e95a917 · outbound

This paper cites an unresolved cited work.

Complexity and Geometry of Sampling Connected Graph Partitions Unresolved cited work

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-14T11:40:32.540203Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8d846595-b6d8-47c6-b6d0-1ac9aaac91b0 · outbound

This paper cites Caldera, D.

Complexity and Geometry of Sampling Connected Graph Partitions Caldera, D

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-14T11:40:32.545018Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e01a6c84-830d-4aeb-88c7-af7ef6ce8662 · outbound

This paper cites an unresolved cited work.

Complexity and Geometry of Sampling Connected Graph Partitions Unresolved cited work

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-14T11:40:32.549882Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8f90de4f-c409-4840-bacd-327f200aaa93 · outbound

This paper cites an unresolved cited work.

Complexity and Geometry of Sampling Connected Graph Partitions Unresolved cited work

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-14T11:40:32.554342Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d0d7c6f2-9e87-40f6-8685-d9508cfb4df5 · outbound

This paper cites Chen, Expert report of Jowei Chen, ph.d.

Complexity and Geometry of Sampling Connected Graph Partitions Chen, Expert report of Jowei Chen, ph.d

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-14T11:40:32.559028Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 81e37644-fade-42fb-bfec-c8cd1311ad73 · outbound

This paper cites Chen and J.

Complexity and Geometry of Sampling Connected Graph Partitions Chen and J

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-14T11:40:32.563616Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 703937e4-7969-49bb-9683-ea8226187a6e · outbound

This paper cites Chikina, A.

Complexity and Geometry of Sampling Connected Graph Partitions Chikina, A

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-14T11:40:32.568206Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b70faeee-bad3-43dd-b7aa-7da5fc050951 · outbound

This paper cites Cho and Y.

Complexity and Geometry of Sampling Connected Graph Partitions Cho and Y

Reference 32

Resolution: unresolved; no resolver link, observed 2026-08-14T11:40:32.572893Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ee873923-e85d-41ed-8ce0-22ee5033857f · outbound

This paper cites an unresolved cited work.

Complexity and Geometry of Sampling Connected Graph Partitions Unresolved cited work

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-14T11:40:32.577315Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b315dfac-5860-41ab-aed5-09192ac4ce2a · outbound

This paper cites Courcelle and J.

Complexity and Geometry of Sampling Connected Graph Partitions Courcelle and J

Reference 34

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:40:34.408900Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 8124584c-3c58-4dbd-9723-f096391b0b39 · outbound

This paper cites Cygan, F.

Complexity and Geometry of Sampling Connected Graph Partitions Cygan, F

Reference 35

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:40:34.393917Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation d22da24d-198a-44aa-a9c9-706a63404121 · outbound

This paper cites DeFord and M.

Complexity and Geometry of Sampling Connected Graph Partitions DeFord and M

Reference 36

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:40:34.378975Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 6763bf15-eecc-46f5-9f16-5715cea80e69 · outbound

This paper cites Total Variation Isoperimetric Profiles.

Complexity and Geometry of Sampling Connected Graph Partitions Total Variation Isoperimetric Profiles

Reference 37

Resolution: verified exact; local_arxiv, observed 2026-08-14T11:40:33.310644Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 6cb935f4-1203-4bd3-8194-1e13a99ef6aa · outbound

This paper cites an unresolved cited work.

Complexity and Geometry of Sampling Connected Graph Partitions Unresolved cited work

Reference 38

Resolution: unresolved; raw_fallback, observed 2026-08-14T11:40:34.364458Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 983b657e-ef05-4981-a626-ba773c18f411 · outbound

This paper cites an unresolved cited work.

Complexity and Geometry of Sampling Connected Graph Partitions Unresolved cited work

Reference 39

Resolution: unresolved; raw_fallback, observed 2026-08-14T11:40:34.349386Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 33603832-26e9-4038-9bf7-bf8a9dd296ee · outbound

This paper cites an unresolved cited work.

Complexity and Geometry of Sampling Connected Graph Partitions Unresolved cited work

Reference 40

Resolution: unresolved; raw_fallback, observed 2026-08-14T11:40:34.334935Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation f5c96a14-5dd1-4446-afe0-76064a5ad998 · outbound

This paper cites Duchin, D.

Complexity and Geometry of Sampling Connected Graph Partitions Duchin, D

Reference 41

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:40:34.320273Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 653928fa-f82b-414a-ab77-9011aaf74384 · outbound

This paper cites Discrete geometry for electoral geography.

Complexity and Geometry of Sampling Connected Graph Partitions Discrete geometry for electoral geography

Reference 42

Resolution: unresolved; no resolver link, observed 2026-08-14T11:40:32.619173Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 33df2f28-6f90-4f84-8171-9298c6e2b231 · outbound

This paper cites Duminil-Copin, G.

Complexity and Geometry of Sampling Connected Graph Partitions Duminil-Copin, G

Reference 43

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:40:34.305337Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 788489f9-5813-4f2f-ab25-e04484e3f77b · outbound

This paper cites Duminil-Copin and S.

Complexity and Geometry of Sampling Connected Graph Partitions Duminil-Copin and S

Reference 44

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:40:34.290671Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 519461ab-9744-4eee-a195-7b2d1f991612 · outbound

This paper cites Dyer and A.

Complexity and Geometry of Sampling Connected Graph Partitions Dyer and A

Reference 45

Resolution: unresolved; no resolver link, observed 2026-08-14T11:40:32.632828Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation baed2525-59ba-4006-bd5b-ffa22cabf24f · outbound

This paper cites Ebbinghaus, J.

Complexity and Geometry of Sampling Connected Graph Partitions Ebbinghaus, J

Reference 46

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:40:34.276088Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 2bb81977-1b7b-474f-8c47-8d6e5cbca8f8 · outbound

This paper cites Erickson, Planar graphs, http://jeﬀe.cs.illinois.edu/teaching/comptop/chapters/02-planar-graphs.pdf.

Complexity and Geometry of Sampling Connected Graph Partitions Erickson, Planar graphs, http://jeﬀe.cs.illinois.edu/teaching/comptop/chapters/02-planar-graphs.pdf

Reference 47

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:40:34.260277Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 58f519b4-6d7b-4f40-ae9b-8a2485396045 · outbound

This paper cites Frick and M.

Complexity and Geometry of Sampling Connected Graph Partitions Frick and M

Reference 48

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:40:34.244934Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 4678de2e-616a-4343-8cec-9d7d5d71593b · outbound

This paper cites Garey, D.

Complexity and Geometry of Sampling Connected Graph Partitions Garey, D

Reference 49

Resolution: unresolved; no resolver link, observed 2026-08-14T11:40:32.650569Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f7c94b62-9952-423f-a9fd-c1de11aa83fb · outbound

This paper cites Gelman and C.

Complexity and Geometry of Sampling Connected Graph Partitions Gelman and C

Reference 50

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:40:34.229221Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation c6bdcfb1-6893-4719-9e8a-342c2fbe9650 · outbound

This paper cites On planar regular graphs degree three without Hamiltonian cycles.

Complexity and Geometry of Sampling Connected Graph Partitions On planar regular graphs degree three without Hamiltonian cycles

Reference 51

Resolution: verified exact; local_arxiv, observed 2026-08-14T11:40:33.194341Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation bcb7bc95-3715-4f57-b0c6-154492e598d6 · outbound

This paper cites Große, J.

Complexity and Geometry of Sampling Connected Graph Partitions Große, J

Reference 52

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:40:34.214215Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation d8f8fbf7-8fae-42b5-9d86-06b276881167 · outbound

This paper cites Gy˝ori, On division of graphs to connected subgraphs , North-Holland Publ.

Complexity and Geometry of Sampling Connected Graph Partitions Gy˝ori, On division of graphs to connected subgraphs , North-Holland Publ

Reference 53

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:40:34.199263Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 15c85419-eebc-402e-914a-321fc41de1a4 · outbound

This paper cites Quantifying Gerrymandering in North Carolina.

Complexity and Geometry of Sampling Connected Graph Partitions Quantifying Gerrymandering in North Carolina

Reference 54

Resolution: verified exact; local_arxiv, observed 2026-08-14T11:40:33.170825Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation aef28221-217e-4fa6-917f-f8f74cf0890c · outbound

This paper cites Evaluating Partisan Gerrymandering in Wisconsin.

Complexity and Geometry of Sampling Connected Graph Partitions Evaluating Partisan Gerrymandering in Wisconsin

Reference 55

Resolution: unresolved; no resolver link, observed 2026-08-14T11:40:32.678882Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5f384ee4-83d9-4815-b043-f9cb2b16bf1e · outbound

This paper cites an unresolved cited work.

Complexity and Geometry of Sampling Connected Graph Partitions Unresolved cited work

Reference 56

Resolution: unresolved; raw_fallback, observed 2026-08-14T11:40:34.184525Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation a9f53d21-9580-494f-8571-37b24b207775 · outbound

This paper cites an unresolved cited work.

Complexity and Geometry of Sampling Connected Graph Partitions Unresolved cited work

Reference 57

Resolution: unresolved; raw_fallback, observed 2026-08-14T11:40:34.169767Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 8c313e0b-8020-4738-a4e8-8c77fc245c66 · outbound

This paper cites Impagliazzo and A.

Complexity and Geometry of Sampling Connected Graph Partitions Impagliazzo and A

Reference 58

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:40:34.154828Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 6fadcd60-a8ef-4a5f-bd73-1cdf371efb77 · outbound

This paper cites an unresolved cited work.

Complexity and Geometry of Sampling Connected Graph Partitions Unresolved cited work

Reference 59

Resolution: unresolved; raw_fallback, observed 2026-08-14T11:40:34.140096Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 00674d56-dd76-466f-a068-a0ee0ccdaa8c · outbound

This paper cites an unresolved cited work.

Complexity and Geometry of Sampling Connected Graph Partitions Unresolved cited work

Reference 60

Resolution: unresolved; raw_fallback, observed 2026-08-14T11:40:34.125023Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation c4fcd3f0-0b5e-43a6-80ad-1ea1043adaf2 · outbound

This paper cites Jensen, A parallel algorithm for the enumeration of self-avoiding polygons on the square lattice , Journal of Physics A: Mathematical and General, 36 (2003), p.

Complexity and Geometry of Sampling Connected Graph Partitions Jensen, A parallel algorithm for the enumeration of self-avoiding polygons on the square lattice , Journal of Physics A: Mathematical and General, 36 (2003), p

Reference 61

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:40:34.110115Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation ac6e8c3e-4648-4e24-8aea-6038368257ff · outbound

This paper cites Jensen, Improved lower bounds on the connective constants for two-dimensional self-avoiding walks , Journal of Physics A: Mathematical and General, 37 (2004), p.

Complexity and Geometry of Sampling Connected Graph Partitions Jensen, Improved lower bounds on the connective constants for two-dimensional self-avoiding walks , Journal of Physics A: Mathematical and General, 37 (2004), p

Reference 62

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:40:34.095129Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 0fd49372-a8c7-4e57-a042-9dc3070f63bb · outbound

This paper cites an unresolved cited work.

Complexity and Geometry of Sampling Connected Graph Partitions Unresolved cited work

Reference 63

Resolution: unresolved; no resolver link, observed 2026-08-14T11:40:32.715477Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 826cb583-3086-489a-9fde-88c136127eb1 · outbound

This paper cites Kennedy, Monte carlo tests of stochastic loewner evolution predictions for the 2d self-avoiding walk , Physical review letters, 88 (2002), p.

Complexity and Geometry of Sampling Connected Graph Partitions Kennedy, Monte carlo tests of stochastic loewner evolution predictions for the 2d self-avoiding walk , Physical review letters, 88 (2002), p

Reference 64

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:40:34.080213Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation e21a14ae-5ff8-437d-983b-2e7ab0f2daeb · outbound

This paper cites Kenyon, The asymptotic determinant of the discrete laplacian , Acta Mathematica, 185 (2000), pp.

Complexity and Geometry of Sampling Connected Graph Partitions Kenyon, The asymptotic determinant of the discrete laplacian , Acta Mathematica, 185 (2000), pp

Reference 65

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:40:34.064637Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 898c555f-8e28-42ee-b680-1092ec76f54e · outbound

This paper cites Khuller and V.

Complexity and Geometry of Sampling Connected Graph Partitions Khuller and V

Reference 66

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:40:34.049673Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation f8c84ba5-94af-4bb2-bc60-671664e9cf55 · outbound

This paper cites Kueng, D.

Complexity and Geometry of Sampling Connected Graph Partitions Kueng, D

Reference 67

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:40:34.034723Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation fc3cd277-a190-483d-bea1-c2dda4f3361f · outbound

This paper cites Lapoire, Treewidth and duality for planar hypergraphs.

Complexity and Geometry of Sampling Connected Graph Partitions Lapoire, Treewidth and duality for planar hypergraphs

Reference 68

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:40:34.019974Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 4e0cc3c7-30c2-48b7-9aee-8fd0d428c58e · outbound

This paper cites On the scaling limit of planar self-avoiding walk.

Complexity and Geometry of Sampling Connected Graph Partitions On the scaling limit of planar self-avoiding walk

Reference 69

Resolution: verified exact; local_arxiv, observed 2026-08-14T11:40:33.004465Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 360b5405-8cb7-42fb-b3bf-27fa3e077dba · outbound

This paper cites an unresolved cited work.

Complexity and Geometry of Sampling Connected Graph Partitions Unresolved cited work

Reference 70

Resolution: unresolved; raw_fallback, observed 2026-08-14T11:40:34.005224Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 8821b843-8aee-4c61-8105-5021fc9fbbd1 · outbound

This paper cites an unresolved cited work.

Complexity and Geometry of Sampling Connected Graph Partitions Unresolved cited work

Reference 71

Resolution: unresolved; raw_fallback, observed 2026-08-14T11:40:33.990533Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 4db17f28-c8f7-4310-8a0c-2719eabe60b3 · outbound

This paper cites Lovasz, A homology theory for spanning tress of a graph , Acta Mathematica Hungarica, 30 (1977), pp.

Complexity and Geometry of Sampling Connected Graph Partitions Lovasz, A homology theory for spanning tress of a graph , Acta Mathematica Hungarica, 30 (1977), pp

Reference 72

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:40:33.976065Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation a7067cbe-3a26-4a01-9541-9118c7ff8c23 · outbound

This paper cites Madras , Critical behaviour of self-avoiding walks: that cross a square , Journal of Physics A: Mathematical and General, 28 (1995), p.

Complexity and Geometry of Sampling Connected Graph Partitions Madras , Critical behaviour of self-avoiding walks: that cross a square , Journal of Physics A: Mathematical and General, 28 (1995), p

Reference 73

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:40:33.961300Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 55cd085c-6b11-4d86-aed4-5ecc4aeded8b · outbound

This paper cites Madras and G.

Complexity and Geometry of Sampling Connected Graph Partitions Madras and G

Reference 74

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:40:33.946289Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 3a78dc69-ab6c-4253-8bb5-995faf1161d9 · outbound

This paper cites an unresolved cited work.

Complexity and Geometry of Sampling Connected Graph Partitions Unresolved cited work

Reference 75

Resolution: unresolved; raw_fallback, observed 2026-08-14T11:40:33.931485Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation d61f32f9-ec2f-47ea-93c7-e7ff36489f6e · outbound

This paper cites an unresolved cited work.

Complexity and Geometry of Sampling Connected Graph Partitions Unresolved cited work

Reference 76

Resolution: unresolved; raw_fallback, observed 2026-08-14T11:40:33.916167Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 74e618f5-e9fe-4433-a7fa-64107d7a023d · outbound

This paper cites Mattingly, Declaration of Jonathan Mattingly, Common Cause vs.

Complexity and Geometry of Sampling Connected Graph Partitions Mattingly, Declaration of Jonathan Mattingly, Common Cause vs

Reference 77

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:40:33.900231Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 02b0b974-0912-428e-98b9-7f5e21f85b08 · outbound

This paper cites Montanari and P.

Complexity and Geometry of Sampling Connected Graph Partitions Montanari and P

Reference 78

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:40:33.885324Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation bc89a977-ae59-4a51-b315-60b15f17498e · outbound

This paper cites an unresolved cited work.

Complexity and Geometry of Sampling Connected Graph Partitions Unresolved cited work

Reference 79

Resolution: unresolved; raw_fallback, observed 2026-08-14T11:40:33.869774Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 06f4bd48-2fcb-40ec-bbb3-09c292edfa81 · outbound

This paper cites Pegden, Pennsylvania’s congressional districting is an outlier: Expert report , League of Women Voters vs.

Complexity and Geometry of Sampling Connected Graph Partitions Pegden, Pennsylvania’s congressional districting is an outlier: Expert report , League of Women Voters vs

Reference 80

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:40:33.855152Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 2c7ce055-fdca-408a-9132-9b12945ad81e · outbound

This paper cites P¨onitz and P.

Complexity and Geometry of Sampling Connected Graph Partitions P¨onitz and P

Reference 81

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:40:33.840481Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 5423738e-8101-4bc2-b312-d43555a3e535 · outbound

This paper cites Randall and A.

Complexity and Geometry of Sampling Connected Graph Partitions Randall and A

Reference 82

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:40:33.826332Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation d6ad73a3-f47b-4ed6-99ff-d132889f358e · outbound

This paper cites an unresolved cited work.

Complexity and Geometry of Sampling Connected Graph Partitions Unresolved cited work

Reference 83

Resolution: unresolved; raw_fallback, observed 2026-08-14T11:40:33.812008Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation b9514684-fcae-4ae7-bd1d-a1fa2a84c701 · outbound

This paper cites Shoup, A computational introduction to number theory and algebra , Cambridge university press, 2009.

Complexity and Geometry of Sampling Connected Graph Partitions Shoup, A computational introduction to number theory and algebra , Cambridge university press, 2009

Reference 84

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:40:33.797456Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 75cd6d69-87ec-4e3f-a389-420e3e905661 · outbound

This paper cites an unresolved cited work.

Complexity and Geometry of Sampling Connected Graph Partitions Unresolved cited work

Reference 85

Resolution: unresolved; raw_fallback, observed 2026-08-14T11:40:33.781663Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation d9d8511e-3859-46eb-858e-1fc5f3ea5d12 · outbound

This paper cites an unresolved cited work.

Complexity and Geometry of Sampling Connected Graph Partitions Unresolved cited work

Reference 86

Resolution: unresolved; raw_fallback, observed 2026-08-14T11:40:33.766994Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation fd71e716-590d-4e16-a1db-0b3a031b5ea2 · outbound

This paper cites Monte Carlo Methods for the Self-Avoiding Walk.

Complexity and Geometry of Sampling Connected Graph Partitions Monte Carlo Methods for the Self-Avoiding Walk

Reference 87

Resolution: unresolved; no resolver link, observed 2026-08-14T11:40:32.828710Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation adc76ca6-0e57-44ef-8e59-530335979626 · outbound

This paper cites an unresolved cited work.

Complexity and Geometry of Sampling Connected Graph Partitions Unresolved cited work

Reference 88

Resolution: unresolved; raw_fallback, observed 2026-08-14T11:40:33.750868Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 52807ad3-f597-4465-98f5-7d65f1fbe5a3 · outbound

This paper cites an unresolved cited work.

Complexity and Geometry of Sampling Connected Graph Partitions Unresolved cited work

Reference 89

Resolution: unresolved; raw_fallback, observed 2026-08-14T11:40:33.735836Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 5c5bda15-d098-4d27-9375-e49549a9510d · outbound

This paper cites Suzuki, N.

Complexity and Geometry of Sampling Connected Graph Partitions Suzuki, N

Reference 90

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:40:33.720868Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 2ba0aad4-a3a0-4804-9ca1-ab7db28477bd · outbound

This paper cites an unresolved cited work.

Complexity and Geometry of Sampling Connected Graph Partitions Unresolved cited work

Reference 91

Resolution: unresolved; raw_fallback, observed 2026-08-14T11:40:33.705710Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation f12f42b5-f5be-4724-99e6-510963aec4ae · outbound

This paper cites an unresolved cited work.

Complexity and Geometry of Sampling Connected Graph Partitions Unresolved cited work

Reference 92

Resolution: unresolved; raw_fallback, observed 2026-08-14T11:40:33.690955Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 151b0af1-9ecf-4adb-b5d9-935de902498e · outbound

This paper cites Wigderson, The Complexity of the Hamiltonian Circuit Problem for Maximal Planar Graphs , 1982, https://www.

Complexity and Geometry of Sampling Connected Graph Partitions Wigderson, The Complexity of the Hamiltonian Circuit Problem for Maximal Planar Graphs , 1982, https://www

Reference 93

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:40:33.676017Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 93171649-be02-4a85-876b-e2112de49cfa · outbound

This paper cites an unresolved cited work.

Complexity and Geometry of Sampling Connected Graph Partitions Unresolved cited work

Reference 94

Resolution: unresolved; raw_fallback, observed 2026-08-14T11:40:33.660392Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation c0252a56-2b9e-4442-9507-cb1d9c163cf1 · outbound

This paper cites an unresolved cited work.

Complexity and Geometry of Sampling Connected Graph Partitions Unresolved cited work

Reference 95

Resolution: unresolved; raw_fallback, observed 2026-08-14T11:40:33.644871Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 3565d8dc-ce86-4d33-94d8-05437216b468 · outbound

This paper cites This can be lifted to a path between x and y in A(G)\{a,b}.

Complexity and Geometry of Sampling Connected Graph Partitions This can be lifted to a path between x and y in A(G)\{a,b}

Reference 96

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:40:33.629269Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation a3a3ed8a-f19e-475e-9e59-5a7e03c27b49 · outbound

This paper cites There are three cases: (a) If |L∩{a,b}| = 0: As A′ is 3-connected, there is a path in A′\ (B∩{a,b}) from x to w.

Complexity and Geometry of Sampling Connected Graph Partitions There are three cases: (a) If |L∩{a,b}| = 0: As A′ is 3-connected, there is a path in A′\ (B∩{a,b}) from x to w

Reference 97

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:40:33.614059Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation d854be1d-bc5b-4ad8-87fc-b0e41fba866a · outbound

This paper cites an unresolved cited work.

Complexity and Geometry of Sampling Connected Graph Partitions Unresolved cited work

Reference 98

Resolution: unresolved; raw_fallback, observed 2026-08-14T11:40:33.599010Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 1ea1039a-94d0-47ea-b92a-2439719ef665 · outbound

This paper cites an unresolved cited work.

Complexity and Geometry of Sampling Connected Graph Partitions Unresolved cited work

Reference 99

Resolution: unresolved; raw_fallback, observed 2026-08-14T11:40:33.583250Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 6ee0c8dc-0238-4aeb-8de3-1aa979f982ca · outbound

This paper cites an unresolved cited work.

Complexity and Geometry of Sampling Connected Graph Partitions Unresolved cited work

Reference 100

Resolution: unresolved; raw_fallback, observed 2026-08-14T11:40:33.567567Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Coverage vector

Reference resolution

Outbound references

Pith citing papers