{"as_of":"2026-08-16T10:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e611d147940e230b6ac3bb4fac32da974e95fd2b07b99ae02bcd8cc3a6467108","coverage":[{"denominator":108,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T11:40:32.889579Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/1908.08881/citation-record","integrity":"/paper/1908.08881/integrity","json":"/paper/1908.08881/citation-record.json","paper":"/paper/1908.08881"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:32.419785Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.419785Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:559e9d31854a137643a9007b023ad1eda72b1c2e31019057dde862a1b8dc9581","observation_id":"5876e57b-2379-4f87-9578-c9d6c9a30f9f","resolution":{"observed_at":"2026-08-14T11:40:32.419785Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:32.425434Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.425434Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:4a4abf81ce21736350afda8343e9c7cb1418773dd8e5f63c59d726e3b22111d1","observation_id":"5952ae0f-348d-4b86-86b8-01c9c2a8da40","resolution":{"observed_at":"2026-08-14T11:40:32.425434Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:32.430782Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.430782Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:2b4a105583f9e8c6c00db215a4c91cb4feba974ffd113cca12282f97d558a09e","observation_id":"1240c6af-4b55-4c4e-aff2-cc5564d3e332","resolution":{"observed_at":"2026-08-14T11:40:32.430782Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:32.435646Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.435646Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:a5e69a9b2b9fa71c3a4267b73965431ca9cd1214bae0076c146889f14bdcc88b","observation_id":"4933c084-576a-4ee9-bf42-7e87bbb61b05","resolution":{"observed_at":"2026-08-14T11:40:32.435646Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:32.440812Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.440812Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:2e442f8eeddf7db713274bfb48f9b20269afbfd175acd0a9f625719e464b1aaf","observation_id":"87277ca5-968b-41f0-a08c-be06916455bd","resolution":{"observed_at":"2026-08-14T11:40:32.440812Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:32.445737Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.445737Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:cf928bd79fccb6c00221b245a29d10c323656b232dcd345f2e6c227d2cf3a3c0","observation_id":"96cafbb6-c6b2-412c-beda-16dd13d750ed","resolution":{"observed_at":"2026-08-14T11:40:32.445737Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:32.451929Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.451929Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:b78d0889c970a3fc5e909f0b40c15aec5bdc0990d320d75baf88665ee9886926","observation_id":"e814ae3e-b8a3-4b35-b3d0-dbaf896cf230","resolution":{"observed_at":"2026-08-14T11:40:32.451929Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:32.456829Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.456829Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:9b43fd00c938ab44f7fc4dc263ebfd57b3affb9e2fc58bf3fc6a708cdc6a0764","observation_id":"4db02430-1098-4278-8e0e-72ad4890d28b","resolution":{"observed_at":"2026-08-14T11:40:32.456829Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:32.461491Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.461491Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:9a672121d8cc985b2027d7094c2b16a139388dce1019b07f5275dbd1e48bfed5","observation_id":"f499618c-e90a-4144-a63e-31efb4e94a6b","resolution":{"observed_at":"2026-08-14T11:40:32.461491Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:32.466057Z","title":"Aaronson, P ?= NP, in Open problems in mathematics, Springer, 2016, pp","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.466057Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:e15f40bce8e96a7a3d55386801f89fffcc5d95ea8af020be432fb23e0ecd3391","observation_id":"a4b74fa6-6d34-4607-8603-637bbf1c7dd5","resolution":{"observed_at":"2026-08-14T11:40:32.466057Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:32.471160Z","title":"Abbott and D","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.471160Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:80b0f066916a696adabe30bb9c86eac26b67a51b8494e84e5168ad54bdd32402","observation_id":"5b95b303-78b2-4cdc-8ce3-20c524444602","resolution":{"observed_at":"2026-08-14T11:40:32.471160Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1902.10765","last_updated":"2021-06-29T14:29:29Z","snapshot_observed_at":"2026-08-14T17:10:04.694209Z","submitted_at":"2019-02-27T20:18:23Z","title":"Reconfiguration of Connected Graph Partitions","version":2},"cited_work":{"arxiv_id":"1902.10765","doi":null,"metadata_source":"pith","pith_arxiv_id":"1902.10765","snapshot_observed_at":"2026-08-14T11:40:33.415265Z","title":"Reconfiguration of Connected Graph Partitions","venue":"cs.DM","work_id":"63910d3e-7548-4946-b0ee-bea36f411565","year":2019},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.475921Z"},"links":{"cited_paper":"/paper/1902.10765","citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:e004d827e9582a02a645a1f408a9bf406ef6d5bc17e05f8fd2e7350f9e45734f","observation_id":"0ac003ab-a607-48bd-bb65-14dc77eab667","resolution":{"observed_at":"2026-08-14T11:40:33.421305Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:32.481007Z","title":"Altman, Is automation the answer: The computational complexity of automated redistricting , Rutgers Computer and Law Technology Journal, 23 (1997)","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.481007Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:45ff45009ee917a6b16cbdbe68396e8dc8842c3035f43553f545338dc9a3d775","observation_id":"c464a907-61d1-4da0-96d9-57a6517b4c56","resolution":{"observed_at":"2026-08-14T11:40:32.481007Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:32.485722Z","title":"Arnborg, J","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.485722Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:ce3f855f6f23feb27ca64436cea0ccd40f86155756af088563212acdf2f3519e","observation_id":"c808a8ef-71ec-4d8e-b4aa-070457488805","resolution":{"observed_at":"2026-08-14T11:40:32.485722Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:32.490544Z","title":"Arora and B","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.490544Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:026a08c92e051c5a19b2511afa53849205fe244d41d5fa7c949f38e2f293e4a2","observation_id":"572b8cd1-79d3-4f13-8303-cde05710282e","resolution":{"observed_at":"2026-08-14T11:40:32.490544Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1704.03360","last_updated":"2017-05-08T14:13:47Z","snapshot_observed_at":"2026-08-14T21:07:36.748998Z","submitted_at":"2017-04-09T13:48:50Z","title":"Redistricting: Drawing the Line","version":2},"cited_work":{"arxiv_id":"1704.03360","doi":null,"metadata_source":"pith","pith_arxiv_id":"1704.03360","snapshot_observed_at":"2026-08-14T11:40:33.393397Z","title":"Redistricting: Drawing the Line","venue":"stat.AP","work_id":"04cbe7c1-d8a9-4cba-b026-e64dea440941","year":2017},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.496003Z"},"links":{"cited_paper":"/paper/1704.03360","citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:c240054d9f54bf5ed5360a32ffe45e0381c484c2f1492c71877f49974259b77d","observation_id":"3583f536-67dc-4256-afaa-5d6bd952149a","resolution":{"observed_at":"2026-08-14T11:40:33.398275Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.03173","last_updated":"2019-05-13T17:43:37Z","snapshot_observed_at":"2026-08-14T16:38:47.573153Z","submitted_at":"2019-05-01T13:37:04Z","title":"The Gerrymandering Jumble: Map Projections Permute Districts' Compactness Scores","version":2},"cited_work":{"arxiv_id":"1905.03173","doi":null,"metadata_source":"pith","pith_arxiv_id":"1905.03173","snapshot_observed_at":"2026-08-14T11:40:33.372040Z","title":"The Gerrymandering Jumble: Map Projections Permute Districts' Compactness Scores","venue":"physics.soc-ph","work_id":"134e81bb-d2de-4f02-bc4d-ecac6f79b972","year":2019},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.501241Z"},"links":{"cited_paper":"/paper/1905.03173","citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:6dcffa3587cd355c2e94a1f090331594bcdeb3d4708e3f12632b951469e4c0ba","observation_id":"83e25f60-00f0-4733-ba6e-1cf5eaecd9fb","resolution":{"observed_at":"2026-08-14T11:40:33.377543Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1803.02857","last_updated":"2020-12-16T20:56:33Z","snapshot_observed_at":"2026-08-14T19:38:25.604749Z","submitted_at":"2018-03-07T19:47:34Z","title":"Gerrymandering and Compactness: Implementation Flexibility and Abuse","version":2},"cited_work":{"arxiv_id":"1803.02857","doi":null,"metadata_source":"pith","pith_arxiv_id":"1803.02857","snapshot_observed_at":"2026-08-14T11:40:33.348845Z","title":"Gerrymandering and Compactness: Implementation Flexibility and Abuse","venue":"cs.CY","work_id":"c7e7ae7f-19b4-4d44-a505-cf9d3fec5858","year":2018},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.506187Z"},"links":{"cited_paper":"/paper/1803.02857","citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:ca06c9b9cee3336401e9ef21babf4ebc26a69a899a6490107515ed325d2caf5a","observation_id":"131eb978-46e8-4a23-a420-d72ad1ef4336","resolution":{"observed_at":"2026-08-14T11:40:33.354930Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:32.511611Z","title":null,"venue":null,"work_id":null,"year":1969},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.511611Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:3a8ca553ad3734b2be3e898ae9870973a7bd1d35ce9038912889b9b021123486","observation_id":"499de6d3-54b9-4b8b-bd80-d972450af541","resolution":{"observed_at":"2026-08-14T11:40:32.511611Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.02353","last_updated":"2019-07-05T08:59:25Z","snapshot_observed_at":"2026-07-06T08:05:05.325783Z","submitted_at":"2019-07-04T12:16:34Z","title":"Fixed-parameter tractability of counting small minimum $(S,T)$-cuts","version":2},"cited_work":{"arxiv_id":"1907.02353","doi":null,"metadata_source":"pith","pith_arxiv_id":"1907.02353","snapshot_observed_at":"2026-08-14T11:40:33.327004Z","title":"Fixed-parameter tractability of counting small minimum $(S,T)$-cuts","venue":"cs.CC","work_id":"24cd7b41-54e2-40df-a62c-973bb65eed5b","year":2019},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.516395Z"},"links":{"cited_paper":"/paper/1907.02353","citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:7f0031c3757c90d71c89dfb743b8f1027c7e9a4cbf3f4e6e958ed8e31726fd98","observation_id":"907d867c-3211-4d70-a7ed-ce85a70b6409","resolution":{"observed_at":"2026-08-14T11:40:33.332431Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:32.521301Z","title":"Bez´akov´a, E","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.521301Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:83b8e914af58cabb6ed121b09b53f6ffd5eb3a97e9955da60f850ea8ab0ef458","observation_id":"1bc5e1ff-56a0-4406-937a-04c2c7972219","resolution":{"observed_at":"2026-08-14T11:40:32.521301Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:32.525871Z","title":null,"venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.525871Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:adc254f17b1fc4599a686ea28cd9eecfad374e59595998e0c369b13757a10a3f","observation_id":"aee96c9f-a88f-4ed0-a126-da9f15f6994f","resolution":{"observed_at":"2026-08-14T11:40:32.525871Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:32.530645Z","title":"Bouchitt´e, F","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.530645Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:d7f76c9fb4c71e86508f6af55582642d1c961e8b81a411aed0947316d6b616f5","observation_id":"15161852-44ec-45cd-8785-e7f60eba1045","resolution":{"observed_at":"2026-08-14T11:40:32.530645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:32.535444Z","title":"Bousquet-M´elou, A","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.535444Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:e18a184fa16c2a132bc6336a685a8c13e57464f193f7b5c95b5bb164dae2593f","observation_id":"9b31aa88-d918-4677-ba26-338c2ca6382b","resolution":{"observed_at":"2026-08-14T11:40:32.535444Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:32.540203Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.540203Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:d5f0db03d2ed07416e9a12851228fb1b0bb9d698b5022f025a1060e413bcc0b8","observation_id":"c077c061-e95c-445f-a5d5-dad47e95a917","resolution":{"observed_at":"2026-08-14T11:40:32.540203Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:32.545018Z","title":"Caldera, D","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.545018Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:32dc141001c24aca92076641f6237d4c94ef05c03d4afcd383ee04dbad935cdc","observation_id":"8d846595-b6d8-47c6-b6d0-1ac9aaac91b0","resolution":{"observed_at":"2026-08-14T11:40:32.545018Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:32.549882Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.549882Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:0f01fb1abd0b05d529fc770703f43aa7f9869da097424a0e117dd8f583dcd247","observation_id":"e01a6c84-830d-4aeb-88c7-af7ef6ce8662","resolution":{"observed_at":"2026-08-14T11:40:32.549882Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:32.554342Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.554342Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:377ed62d16acd551032cd1562de673f1ff91cc5f1f64905deda69eef85eba94f","observation_id":"8f90de4f-c409-4840-bacd-327f200aaa93","resolution":{"observed_at":"2026-08-14T11:40:32.554342Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:32.559028Z","title":"Chen, Expert report of Jowei Chen, ph.d","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.559028Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:0415d3a0ff8d41bf0fa0e6e4ed0f4f11a6e0733f26ac7b0f38f3c3028817d435","observation_id":"d0d7c6f2-9e87-40f6-8685-d9508cfb4df5","resolution":{"observed_at":"2026-08-14T11:40:32.559028Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:32.563616Z","title":"Chen and J","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.563616Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:720905e45e0926a83cff86d860bdb7ba7a6e243e4766f7fd9af347cd68d24cfe","observation_id":"81e37644-fade-42fb-bfec-c8cd1311ad73","resolution":{"observed_at":"2026-08-14T11:40:32.563616Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:32.568206Z","title":"Chikina, A","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.568206Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:cd8473de6e72d581ce8ea682dc11d012533eee4d01899963a748b30c59d337d1","observation_id":"703937e4-7969-49bb-9683-ea8226187a6e","resolution":{"observed_at":"2026-08-14T11:40:32.568206Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:32.572893Z","title":"Cho and Y","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.572893Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:e8456ba816d57fbd73598f7b307d4525a28b089b32a0d0f5dacf7f4c929a4b4e","observation_id":"b70faeee-bad3-43dd-b7aa-7da5fc050951","resolution":{"observed_at":"2026-08-14T11:40:32.572893Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:32.577315Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.577315Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:70a3ebcb0ac1d28b53c3ccce1695593917665701fd5170d3b1c14e96b467d16a","observation_id":"ee873923-e85d-41ed-8ce0-22ee5033857f","resolution":{"observed_at":"2026-08-14T11:40:32.577315Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:34.403950Z","title":"Courcelle and J","venue":null,"work_id":"aac1c673-795e-42a2-9c26-95a867af8a9b","year":2012},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.581617Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:b26e0a28528e97c075b57f91794f154774411de93db37cfdd27591ed1af5c561","observation_id":"b315dfac-5860-41ab-aed5-09192ac4ce2a","resolution":{"observed_at":"2026-08-14T11:40:34.408900Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:34.388923Z","title":"Cygan, F","venue":null,"work_id":"c3cf50f9-08aa-4028-8529-b2f577d2d079","year":2015},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.586568Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:8abdcbeadbac288f22746b6a1a74c1e712cc0424d4af5074537fb163cf588e94","observation_id":"8124584c-3c58-4dbd-9723-f096391b0b39","resolution":{"observed_at":"2026-08-14T11:40:34.393917Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:34.374335Z","title":"DeFord and M","venue":null,"work_id":"25f7ed3a-4148-4abf-9adb-5d208cb0b6d3","year":2019},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.591712Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:fc79f5ea9a55817be7cdf0337db3f7ea46ae785626862c49952624f169c6a11b","observation_id":"d22da24d-198a-44aa-a9c9-706a63404121","resolution":{"observed_at":"2026-08-14T11:40:34.378975Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1809.07943","last_updated":"2019-08-28T06:26:40Z","snapshot_observed_at":"2026-08-14T18:25:32.103764Z","submitted_at":"2018-09-21T04:39:48Z","title":"Total Variation Isoperimetric Profiles","version":2},"cited_work":{"arxiv_id":"1809.07943","doi":null,"metadata_source":"pith","pith_arxiv_id":"1809.07943","snapshot_observed_at":"2026-08-14T11:40:33.304310Z","title":"Total Variation Isoperimetric Profiles","venue":"math.OC","work_id":"07bbcdbe-bb9c-4790-b6da-9695fbe09a28","year":2018},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.596152Z"},"links":{"cited_paper":"/paper/1809.07943","citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:9515f119d2d544804ccfc93abada4b4a1fd76d8c8c01f5d9fe775fb64c524b2b","observation_id":"6763bf15-eecc-46f5-9f16-5715cea80e69","resolution":{"observed_at":"2026-08-14T11:40:33.310644Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:34.359665Z","title":null,"venue":null,"work_id":"51684b1f-55d8-4816-9aa1-ce055515d9aa","year":2008},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.601151Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:4ede91e21381bddb5721ffdd77cc43ebc87fa62c975abc3f3bf13aba092d2f0c","observation_id":"6cb935f4-1203-4bd3-8194-1e13a99ef6aa","resolution":{"observed_at":"2026-08-14T11:40:34.364458Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:34.344755Z","title":null,"venue":null,"work_id":"ef6fac96-ee29-45b0-a5cc-6a3b30f28fc0","year":2004},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.605592Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:f9ab80f3a61ce45c5e50afbc94e0d46d50c5a73401d6ca430fc7671999819298","observation_id":"983b657e-ef05-4981-a626-ba773c18f411","resolution":{"observed_at":"2026-08-14T11:40:34.349386Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:34.330249Z","title":null,"venue":null,"work_id":"456e5317-e54e-41c3-b5b9-800260cdfe4d","year":null},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.610193Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:644ef73faa7bfb730535fbf5d0499ed4d0eca88372e56941cb003587f6536361","observation_id":"33603832-26e9-4038-9bf7-bf8a9dd296ee","resolution":{"observed_at":"2026-08-14T11:40:34.334935Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:34.315632Z","title":"Duchin, D","venue":null,"work_id":"677ed49d-185e-49db-808a-c51a8c4f7904","year":null},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.614741Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:8de66156f91606197310164b90ce2320772ec79c8906ed739dfbc25f32cb767c","observation_id":"f5c96a14-5dd1-4446-afe0-76064a5ad998","resolution":{"observed_at":"2026-08-14T11:40:34.320273Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1808.05860","last_updated":"2023-08-16T15:39:59Z","snapshot_observed_at":"2026-08-14T18:40:38.346414Z","submitted_at":"2018-08-15T22:41:18Z","title":"Discrete geometry for electoral geography","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1808.05860","snapshot_observed_at":"2026-08-14T11:40:32.619173Z","title":"Duchin and B","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.619173Z"},"links":{"cited_paper":"/paper/1808.05860","citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:3dcff265eb2e36c3a8d9596a2c9a1de08f4453bd9d18369cdfcb3fb27c269d96","observation_id":"653928fa-f82b-414a-ab77-9011aaf74384","resolution":{"observed_at":"2026-08-14T11:40:32.619173Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:34.300713Z","title":"Duminil-Copin, G","venue":null,"work_id":"9b51392e-314c-4741-a631-9c3361c2c646","year":2014},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.623936Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:7b06fa8d20ee3e03e9a4260ff6a6313bf222358ad0472411ceb90f06fbfd0139","observation_id":"33df2f28-6f90-4f84-8171-9298c6e2b231","resolution":{"observed_at":"2026-08-14T11:40:34.305337Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:34.285880Z","title":"Duminil-Copin and S","venue":null,"work_id":"b4b269a5-150b-40df-be2a-a0d647d584c5","year":2012},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.628487Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:e7976144fc1371dfa9c0feecb48245491fbd5991a4387524a52235f35ba8f14b","observation_id":"788489f9-5813-4f2f-ab25-e04484e3f77b","resolution":{"observed_at":"2026-08-14T11:40:34.290671Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:32.632828Z","title":"Dyer and A","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.632828Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:9cc80d10ac399eb7ac7c3596375a3a4d7a4243edcb9d01b3fad7a19082b32bc9","observation_id":"519461ab-9744-4eee-a195-7b2d1f991612","resolution":{"observed_at":"2026-08-14T11:40:32.632828Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:34.271119Z","title":"Ebbinghaus, J","venue":null,"work_id":"f7ecc9f0-119c-4782-99f2-9a707a4112b6","year":2013},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.637146Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:c9d4154749ab9ed6084d92f529368e61b1eec4dc08a3047572c11914cd74e8ac","observation_id":"baed2525-59ba-4006-bd5b-ffa22cabf24f","resolution":{"observed_at":"2026-08-14T11:40:34.276088Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:34.255307Z","title":"Erickson, Planar graphs, http://jeffe.cs.illinois.edu/teaching/comptop/chapters/02-planar-graphs.pdf","venue":null,"work_id":"b2f8d6f6-8656-4a61-bc2f-27976535606a","year":null},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.641591Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:66fcef0d9757d8fd6210498f89fdbc0e7e5da3e00e0fb6ba90a33a0ed13c8380","observation_id":"2bb81977-1b7b-474f-8c47-8d6e5cbca8f8","resolution":{"observed_at":"2026-08-14T11:40:34.260277Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:34.239944Z","title":"Frick and M","venue":null,"work_id":"666da3d4-ce23-4b7c-a205-2f26cc0cd285","year":2004},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.645972Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:2d5a8edbf338bf5fec8e474328eaa1de182e2275958d6a0c8f674002e963e746","observation_id":"58f519b4-6d7b-4f40-ae9b-8a2485396045","resolution":{"observed_at":"2026-08-14T11:40:34.244934Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:32.650569Z","title":"Garey, D","venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.650569Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:1fe80acfb1ffab780c8225c2e7a00e7560bfb92a2a56c4a6152f21e3be689b61","observation_id":"4678de2e-616a-4343-8cec-9d7d5d71593b","resolution":{"observed_at":"2026-08-14T11:40:32.650569Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:34.224411Z","title":"Gelman and C","venue":null,"work_id":"e96858d4-7944-4f58-8324-88fe1cf7b863","year":2017},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.655093Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:c8839a89c0c3e9cf9b4b9207846e992f7bd17671b75dc17c6a4ec71020e5f809","observation_id":"f7c94b62-9952-423f-a9fd-c1de11aa83fb","resolution":{"observed_at":"2026-08-14T11:40:34.229221Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"0908.2563","last_updated":"2009-08-18T13:01:52Z","snapshot_observed_at":"2026-08-15T05:41:18.073666Z","submitted_at":"2009-08-18T13:01:52Z","title":"On planar regular graphs degree three without Hamiltonian cycles","version":1},"cited_work":{"arxiv_id":"0908.2563","doi":null,"metadata_source":"pith","pith_arxiv_id":"0908.2563","snapshot_observed_at":"2026-08-14T11:40:33.189099Z","title":"On planar regular graphs degree three without Hamiltonian cycles","venue":"math.CO","work_id":"9b3dc8b8-d0b0-4dec-94e1-9cfbc157e184","year":2009},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.659839Z"},"links":{"cited_paper":"/paper/0908.2563","citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:4abc183a074618e4dd7f002870bb602e125f2d5c56de286c0319e9cdb797ff6b","observation_id":"c6bdcfb1-6893-4719-9e8a-342c2fbe9650","resolution":{"observed_at":"2026-08-14T11:40:33.194341Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:34.209674Z","title":"Große, J","venue":null,"work_id":"9957414f-269a-40d3-84ac-eba92c37989e","year":2001},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.664743Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:a326ff2994ee5573840c868aac4ebe3c733215f44293a97c6a9a0b461cbd077b","observation_id":"bcb7bc95-3715-4f57-b0c6-154492e598d6","resolution":{"observed_at":"2026-08-14T11:40:34.214215Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:34.194418Z","title":"Gy˝ori, On division of graphs to connected subgraphs , North-Holland Publ","venue":null,"work_id":"408a3ea5-d080-4698-a27f-a33dca0f43ae","year":1978},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.669490Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:eb2379dce1758b7dc160e23f42b762ecffc4aa10c141e241d8ee9e81bd68b64a","observation_id":"d8f8fbf7-8fae-42b5-9d86-06b276881167","resolution":{"observed_at":"2026-08-14T11:40:34.199263Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1801.03783","last_updated":"2018-01-10T05:55:41Z","snapshot_observed_at":"2026-08-14T19:56:27.415981Z","submitted_at":"2018-01-10T05:55:41Z","title":"Quantifying Gerrymandering in North Carolina","version":1},"cited_work":{"arxiv_id":"1801.03783","doi":null,"metadata_source":"pith","pith_arxiv_id":"1801.03783","snapshot_observed_at":"2026-08-14T11:40:33.165234Z","title":"Quantifying Gerrymandering in North Carolina","venue":"physics.soc-ph","work_id":"70525ddf-0cce-46a7-95f5-ca92e6887c7a","year":2018},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.674067Z"},"links":{"cited_paper":"/paper/1801.03783","citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:7feb55ace184f6af7365667e9c2e18b82468e5c934e914924a83a73d05228fa9","observation_id":"15c85419-eebc-402e-914a-321fc41de1a4","resolution":{"observed_at":"2026-08-14T11:40:33.170825Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1709.01596","last_updated":"2017-09-05T21:06:25Z","snapshot_observed_at":"2026-08-14T20:35:51.566626Z","submitted_at":"2017-09-05T21:06:25Z","title":"Evaluating Partisan Gerrymandering in Wisconsin","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1709.01596","snapshot_observed_at":"2026-08-14T11:40:32.678882Z","title":"Herschlag, R","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.678882Z"},"links":{"cited_paper":"/paper/1709.01596","citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:52fa6abe2d8d96706f3e55db04bc756b9aafcc32d8e132342da5010c7efe1b30","observation_id":"aef28221-217e-4fa6-917f-f8f74cf0890c","resolution":{"observed_at":"2026-08-14T11:40:32.678882Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:34.179922Z","title":null,"venue":null,"work_id":"0ff0971a-ffc9-415e-b24e-9d45123439b6","year":2008},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.683295Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:b651bbb68a590086ac63941d5e17dca5e2f15cc8e12746d9f63fc3e8323c95f7","observation_id":"5f384ee4-83d9-4815-b043-f9cb2b16bf1e","resolution":{"observed_at":"2026-08-14T11:40:34.184525Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:34.165079Z","title":null,"venue":null,"work_id":"c2aaf6b1-23eb-443a-9f71-b759ae970154","year":2011},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.687877Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:29f3abc079205ab538d64fd6eee0ad9a969ea376604bd3a4ea4a6791b43c99a8","observation_id":"a9f53d21-9580-494f-8571-37b24b207775","resolution":{"observed_at":"2026-08-14T11:40:34.169767Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:34.149888Z","title":"Impagliazzo and A","venue":null,"work_id":"ad6145da-3b90-433d-ae9d-a7084d8200a6","year":1997},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.692595Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:9109e7a9b3442f7d9f7f6f8962ebf5d29acbe5bdeda514e31d5ddbb66b627dad","observation_id":"8c313e0b-8020-4738-a4e8-8c77fc245c66","resolution":{"observed_at":"2026-08-14T11:40:34.154828Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:34.135295Z","title":null,"venue":null,"work_id":"653384ae-5f8d-4771-aae1-0338f1652439","year":1982},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.697464Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:2c16a0ffc956444af6387ae73bb4085f75caaded48c0959c1ad1223250f2b5f0","observation_id":"6fadcd60-a8ef-4a5f-bd73-1cdf371efb77","resolution":{"observed_at":"2026-08-14T11:40:34.140096Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:34.120311Z","title":null,"venue":null,"work_id":"7ce2f9c8-0456-4da9-880c-928abdc449fb","year":2006},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.702038Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:52bbc497904dc4b9da36f5314ebf986ab5af51587a016be7f1b32757f33e9e23","observation_id":"00674d56-dd76-466f-a068-a0ee0ccdaa8c","resolution":{"observed_at":"2026-08-14T11:40:34.125023Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:34.105351Z","title":"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","venue":null,"work_id":"c2847f53-44c4-486c-b1fc-727cfd175784","year":2003},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.706436Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:7f15f7c152bcd1b3152e76b1bff436d5b3ea9d2a512c31fb351a1146fa75d6c3","observation_id":"c4fcd3f0-0b5e-43a6-80ad-1ea1043adaf2","resolution":{"observed_at":"2026-08-14T11:40:34.110115Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:34.090099Z","title":"Jensen, Improved lower bounds on the connective constants for two-dimensional self-avoiding walks , Journal of Physics A: Mathematical and General, 37 (2004), p","venue":null,"work_id":"1549d33d-0ba0-4bb0-a151-1a8e1fc95413","year":2004},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.710901Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:772e820d272d3ccdd7feea4f3f922d49b9bdf52c1649d0dd01eedf04a9b2b95d","observation_id":"ac6e8c3e-4648-4e24-8aea-6038368257ff","resolution":{"observed_at":"2026-08-14T11:40:34.095129Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:32.715477Z","title":null,"venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.715477Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:45704b6957992adf2cb8460ed7602ce5d7af92a3da20e9e0a7e5801db7ae3abc","observation_id":"0fd49372-a8c7-4e57-a042-9dc3070f63bb","resolution":{"observed_at":"2026-08-14T11:40:32.715477Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:34.075214Z","title":"Kennedy, Monte carlo tests of stochastic loewner evolution predictions for the 2d self-avoiding walk , Physical review letters, 88 (2002), p","venue":null,"work_id":"8687011b-7959-44ce-9128-65d3b8453f94","year":2002},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.720343Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:6baddea7b3a1335cabdc5fedd356585349c686a669d4393fd31faab9d5ecdc7a","observation_id":"826cb583-3086-489a-9fde-88c136127eb1","resolution":{"observed_at":"2026-08-14T11:40:34.080213Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:34.059690Z","title":"Kenyon, The asymptotic determinant of the discrete laplacian , Acta Mathematica, 185 (2000), pp","venue":null,"work_id":"d1a02a9b-16cd-47cd-8caf-a52796fb9b4b","year":2000},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.724835Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:819f9679f7daa7937f19c3f4463105261047fe960929ca7a1ce837909a409b06","observation_id":"e21a14ae-5ff8-437d-983b-2e7ab0f2daeb","resolution":{"observed_at":"2026-08-14T11:40:34.064637Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:34.044697Z","title":"Khuller and V","venue":null,"work_id":"178e8146-0a77-4f10-a429-7dd978753dbb","year":1991},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.729695Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:7fbc3f491f4d8563f645349bcc1ebc0585c3af04967ea7f0b3d2d61a27613d0b","observation_id":"898c555f-8e28-42ee-b680-1092ec76f54e","resolution":{"observed_at":"2026-08-14T11:40:34.049673Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:34.029807Z","title":"Kueng, D","venue":null,"work_id":"fef8718d-81ef-4a60-baa2-2914a068e89e","year":2019},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.734489Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:82abc850996523e64ad6b36966eb6e0f8b4452b505ecc9db98c2f571c1155eec","observation_id":"f8c84ba5-94af-4bb2-bc60-671664e9cf55","resolution":{"observed_at":"2026-08-14T11:40:34.034723Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:34.015258Z","title":"Lapoire, Treewidth and duality for planar hypergraphs","venue":null,"work_id":"f8de5242-4823-4f6d-b22e-e8e3fbb45996","year":1996},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.739157Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:001f7aa67ef85c0423c7a09ac570e022f05b55510524440a26fa7ff41d1c074f","observation_id":"fc3cd277-a190-483d-bea1-c2dda4f3361f","resolution":{"observed_at":"2026-08-14T11:40:34.019974Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"math/0204277","last_updated":"2002-04-26T15:47:15Z","snapshot_observed_at":"2026-07-07T05:29:47.395994Z","submitted_at":"2002-04-23T15:51:23Z","title":"On the scaling limit of planar self-avoiding walk","version":2},"cited_work":{"arxiv_id":"math/0204277","doi":null,"metadata_source":"pith","pith_arxiv_id":"math/0204277","snapshot_observed_at":"2026-08-14T11:40:32.996884Z","title":"On the scaling limit of planar self-avoiding walk","venue":"math.PR","work_id":"6d8328cd-0733-4417-9925-8d1065764aae","year":2002},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.743991Z"},"links":{"cited_paper":"/paper/math/0204277","citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:4f3d88aeaf808650321df083d705432c571fbe96c8c6b1ab898c67535473150b","observation_id":"4e0cc3c7-30c2-48b7-9aee-8fd0d428c58e","resolution":{"observed_at":"2026-08-14T11:40:33.004465Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:34.000685Z","title":null,"venue":null,"work_id":"8a774252-942e-467c-b2cb-5e3d96b8eed8","year":2009},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.748981Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:efe310cc54c0da73e5c7d291b35d0f5f75f18145391b8bbce8546c1da9cc7034","observation_id":"360b5405-8cb7-42fb-b3bf-27fa3e077dba","resolution":{"observed_at":"2026-08-14T11:40:34.005224Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:33.986023Z","title":null,"venue":null,"work_id":"cc4e543a-7bd5-42da-91a0-4b6852502135","year":2016},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.753345Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:edb3e21cd930d4a1dfcaa5c704e44344cb5d743320ebe1ec4019370acaa144f7","observation_id":"8821b843-8aee-4c61-8105-5021fc9fbbd1","resolution":{"observed_at":"2026-08-14T11:40:33.990533Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:33.971213Z","title":"Lovasz, A homology theory for spanning tress of a graph , Acta Mathematica Hungarica, 30 (1977), pp","venue":null,"work_id":"bb740a7d-79a0-4376-aa7d-5e9868e04bfa","year":1977},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.757879Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:7a8e47a6c172bd21d38dcbcd3ea99bd669baf449b23bfff19a968bcb9aa6f3ee","observation_id":"4db17f28-c8f7-4310-8a0c-2719eabe60b3","resolution":{"observed_at":"2026-08-14T11:40:33.976065Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:33.956260Z","title":"Madras , Critical behaviour of self-avoiding walks: that cross a square , Journal of Physics A: Mathematical and General, 28 (1995), p","venue":null,"work_id":"5e25aeb4-582b-490a-91c7-251e28d2fd92","year":1995},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.762625Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:ddaf66bb46f321751801e8a69d0cb126e2d20c3fc976b064823df5acc1c3b02d","observation_id":"a7067cbe-3a26-4a01-9541-9118c7ff8c23","resolution":{"observed_at":"2026-08-14T11:40:33.961300Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:33.941689Z","title":"Madras and G","venue":null,"work_id":"16df5f3d-0f2f-4c5e-9bf5-42f3d94f7aa4","year":1996},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.767590Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:55c31bf7ffdf269fddb5d4ac28f967f4335d5537c00348d52663fea20554dae5","observation_id":"55cd085c-6b11-4d86-aed4-5ecc4aeded8b","resolution":{"observed_at":"2026-08-14T11:40:33.946289Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:33.926763Z","title":null,"venue":null,"work_id":"42da1c8c-8b6e-439c-9e22-82b33ce0d3bf","year":2018},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.772434Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:cfdea56fb2e2bec571dfb11284934084a6957c5e3d40150a4832f0392f5f1069","observation_id":"3a78dc69-ab6c-4253-8bb5-995faf1161d9","resolution":{"observed_at":"2026-08-14T11:40:33.931485Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:33.910629Z","title":null,"venue":null,"work_id":"6563cb9e-afcd-4daf-afc6-d9d516054ee4","year":2008},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.777040Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:78f5b141b15bb8ef5e391c049fba1b1edb5718d1153d8f438d59fdf15a097c89","observation_id":"d61f32f9-ec2f-47ea-93c7-e7ff36489f6e","resolution":{"observed_at":"2026-08-14T11:40:33.916167Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:33.895384Z","title":"Mattingly, Declaration of Jonathan Mattingly, Common Cause vs","venue":null,"work_id":"e7110129-78d7-45cb-902f-8d9a174fbaaa","year":2017},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.781562Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:e784923101b48f29bcf7b098e8a8c2a79cde9bd4d79d9af50dffe339c5f69b69","observation_id":"74e618f5-e9fe-4433-a7fa-64107d7a023d","resolution":{"observed_at":"2026-08-14T11:40:33.900231Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:33.880471Z","title":"Montanari and P","venue":null,"work_id":"4db28f2f-4a8a-4aa3-b520-b5b036d5bb2f","year":2015},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.786164Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:023cba1555579bfeb7dd04543dc1af4d349efc3a2476c35d55be90612283d59b","observation_id":"02b0b974-0912-428e-98b9-7f5e21f85b08","resolution":{"observed_at":"2026-08-14T11:40:33.885324Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:33.865148Z","title":null,"venue":null,"work_id":"fafe9be1-5dbe-41fd-b594-09981293f494","year":2018},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.790619Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:6fd89e41177af45d24701482bf4f3f5a2401b54ee8d02e4d3b43d04718b853cb","observation_id":"bc89a977-ae59-4a51-b315-60b15f17498e","resolution":{"observed_at":"2026-08-14T11:40:33.869774Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:33.850382Z","title":"Pegden, Pennsylvania’s congressional districting is an outlier: Expert report , League of Women Voters vs","venue":null,"work_id":"f013ea5c-763a-4fa4-b0e2-8a4a25f86099","year":2017},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.795055Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:34136f7f979662f4ef1a83a4558f0be4a6c986532618a4572c4e57a4d9b3ec03","observation_id":"06f4bd48-2fcb-40ec-bbb3-09c292edfa81","resolution":{"observed_at":"2026-08-14T11:40:33.855152Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:33.836049Z","title":"P¨onitz and P","venue":null,"work_id":"bb9e7cb0-0642-4eee-ad13-a165d881180d","year":2000},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.799448Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:6a5b883f90b40866aa3224597d985e783131132bf951263ceb6bbb91a73947b2","observation_id":"2c7ce055-fdca-408a-9132-9b12945ad81e","resolution":{"observed_at":"2026-08-14T11:40:33.840481Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:33.821842Z","title":"Randall and A","venue":null,"work_id":"8a3039c9-c978-46d8-9219-8c9a2c487ada","year":2000},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.804087Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:2a597efcb100962ec967e07e09267561c83a4655fef9fd08a2801bf651554bda","observation_id":"5423738e-8101-4bc2-b312-d43555a3e535","resolution":{"observed_at":"2026-08-14T11:40:33.826332Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:33.807312Z","title":null,"venue":null,"work_id":"d2106391-ddb1-4534-83f3-4c0a233deb89","year":2011},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.809584Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:526a8c419c55d7c36aa9c9e0543135b29f74edcef2206fa72d265b9081546e55","observation_id":"d6ad73a3-f47b-4ed6-99ff-d132889f358e","resolution":{"observed_at":"2026-08-14T11:40:33.812008Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:33.791336Z","title":"Shoup, A computational introduction to number theory and algebra , Cambridge university press, 2009","venue":null,"work_id":"02e1627e-337b-4041-86b5-ea288b2816a3","year":2009},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.814378Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:c4675c5be87b525ca3909e7866bc61b2da7496d9e198a64a2a318ac94222041c","observation_id":"b9514684-fcae-4ae7-bd1d-a1fa2a84c701","resolution":{"observed_at":"2026-08-14T11:40:33.797456Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:33.777100Z","title":null,"venue":null,"work_id":"d55c771f-2691-4c3e-a08e-443c799a3616","year":1988},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.819132Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:32626f228739a6faac78a0953154cd5fe9037776020cfdd15ee998d63a929959","observation_id":"75cd6d69-87ec-4e3f-a389-420e3e905661","resolution":{"observed_at":"2026-08-14T11:40:33.781663Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:33.761412Z","title":null,"venue":null,"work_id":"5209dc3d-5995-4df0-b343-245295de1ee0","year":1991},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.823965Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:bc0572dff81fd9cd43473919e0e5149103f4ab3a639e9f6e2a07778e54575b76","observation_id":"d9d8511e-3859-46eb-858e-1fc5f3ea5d12","resolution":{"observed_at":"2026-08-14T11:40:33.766994Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"hep-lat/9405016","last_updated":"1994-05-17T16:31:46Z","snapshot_observed_at":"2026-07-07T03:44:32.747325Z","submitted_at":"1994-05-17T16:31:46Z","title":"Monte Carlo Methods for the Self-Avoiding Walk","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"hep-lat/9405016","snapshot_observed_at":"2026-08-14T11:40:32.828710Z","title":null,"venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.828710Z"},"links":{"cited_paper":"/paper/hep-lat/9405016","citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:b4b232ee754a96d5d4fa93043e36fd174c82e7d39b8bcd9022864dc72f85a42f","observation_id":"fd71e716-590d-4e16-a1db-0b3a031b5ea2","resolution":{"observed_at":"2026-08-14T11:40:32.828710Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:33.746260Z","title":null,"venue":null,"work_id":"2a28e51d-3e5b-4991-ad5d-0a792b19a5eb","year":1988},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.833274Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:a1eb55c5d59c8172aa3b24599b3acbd3c95e5ed005434cae5cb0e4b12ede0279","observation_id":"adc76ca6-0e57-44ef-8e59-530335979626","resolution":{"observed_at":"2026-08-14T11:40:33.750868Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:33.730967Z","title":null,"venue":null,"work_id":"63fba943-74f3-4abe-937d-e60a8729254e","year":1989},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.837834Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:6f2c1d7f966537a8beac3e8ece283214923fa2db48779e4727fc99c8eb2806c3","observation_id":"52807ad3-f597-4465-98f5-7d65f1fbe5a3","resolution":{"observed_at":"2026-08-14T11:40:33.735836Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:33.716090Z","title":"Suzuki, N","venue":null,"work_id":"7be0352b-d4bd-451b-bdfc-ce5085b549d7","year":1990},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.842318Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:71fb6e8f0459028b14e089efc4bc6eed6dead0b097013ec9d6a96e1983815cb1","observation_id":"5c5bda15-d098-4d27-9375-e49549a9510d","resolution":{"observed_at":"2026-08-14T11:40:33.720868Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:33.701074Z","title":null,"venue":null,"work_id":"2b29c2fd-e2d6-41a6-8601-da5429cfc7a3","year":null},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.847191Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:6676395428e2f88944fb96999012cb1e0b574eff27b1d3e2d28386be5576ac29","observation_id":"2ba0aad4-a3a0-4804-9ca1-ab7db28477bd","resolution":{"observed_at":"2026-08-14T11:40:33.705710Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:33.686093Z","title":null,"venue":null,"work_id":"a64457ff-916f-4a8b-9bf8-6c6b7fdf33ee","year":1983},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.851686Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:6340ae794af0f1fcbd64f8305fb04925d009055984f859c4477c57f88a6a022b","observation_id":"f12f42b5-f5be-4724-99e6-510963aec4ae","resolution":{"observed_at":"2026-08-14T11:40:33.690955Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:33.670557Z","title":"Wigderson, The Complexity of the Hamiltonian Circuit Problem for Maximal Planar Graphs , 1982, https://www","venue":null,"work_id":"2af5313d-245d-4e30-ab9c-413fe369170a","year":1982},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.856418Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:c25257c869ee19bd20acd37bcb2d2fce8e4769733454f6188b534db8a4dfdca0","observation_id":"151b0af1-9ecf-4adb-b5d9-935de902498e","resolution":{"observed_at":"2026-08-14T11:40:33.676017Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:33.655533Z","title":null,"venue":null,"work_id":"d7c38a85-956b-414a-952f-1468131841c9","year":1996},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.861265Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:b363a758a13315d460e8b466468efef82abe2a6d43eb5777c5a87f4290cc94e8","observation_id":"93171649-be02-4a85-876b-e2112de49cfa","resolution":{"observed_at":"2026-08-14T11:40:33.660392Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:33.639866Z","title":null,"venue":null,"work_id":"252f6de7-9255-4b79-99b3-7d7e323fbb10","year":null},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.865861Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:26d0f8570bb4778b47f0ac6a97c818db0b943b9d5cba19708010ecc5648030a6","observation_id":"c0252a56-2b9e-4442-9507-cb1d9c163cf1","resolution":{"observed_at":"2026-08-14T11:40:33.644871Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:33.624118Z","title":"This can be lifted to a path between x and y in A(G)\\{a,b}","venue":null,"work_id":"4353fac0-e31e-4bd7-8f13-836281a93d1d","year":null},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.870557Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:41d3fb64a222be3fa121f42088309345360b178fb9854821991e62d24f7d37c7","observation_id":"3565d8dc-ce86-4d33-94d8-05437216b468","resolution":{"observed_at":"2026-08-14T11:40:33.629269Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:33.609202Z","title":"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","venue":null,"work_id":"3c21503b-d7c5-4a77-a8c7-df1b354d8fd7","year":null},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.874961Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:3d24b487a92d08277024c16b04e057d5ad8cc1b99bec20ec8a28578109212e7e","observation_id":"a3a3ed8a-f19e-475e-9e59-5a7e03c27b49","resolution":{"observed_at":"2026-08-14T11:40:33.614059Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:33.594009Z","title":null,"venue":null,"work_id":"db900b53-eb5a-4577-9c73-b8ca3e4f4553","year":null},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":98,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.879876Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:638f672555dd98d94ff48c6e51ea5cc9a21524f78ff903e7dac561c627ad37c9","observation_id":"d854be1d-bc5b-4ad8-87fc-b0e41fba866a","resolution":{"observed_at":"2026-08-14T11:40:33.599010Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:33.578128Z","title":null,"venue":null,"work_id":"2cc7b46d-51cd-4ccd-81d1-d3ccbede2770","year":null},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.884779Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:c49c5be3fb9632c5bd2b50e984a4b1a23892ed564a550160290767af28c7fa07","observation_id":"1ea1039a-94d0-47ea-b92a-2439719ef665","resolution":{"observed_at":"2026-08-14T11:40:33.583250Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:40:33.560999Z","title":null,"venue":null,"work_id":"e37d6658-9d8e-4623-9b72-dbcdbe797fb1","year":null},"citing_paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions","version":1},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:32.889579Z"},"links":{"citing_paper":"/paper/1908.08881"},"observation_digest":"sha256:fb3be35b106806b3ec221dc412e3797673064ce247f459e0d2aab5485bb19e46","observation_id":"6ee0c8dc-0238-4aeb-8de3-1aa979f982ca","resolution":{"observed_at":"2026-08-14T11:40:33.567567Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.08881","last_updated":"2019-08-23T15:52:19Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-16T04:44:18.564869Z","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":58,"verified_exact":9,"verified_fuzzy":33},"total_outbound_references":108},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 100 of 108 outbound references and 0 inbound Pith citation observations for arXiv:1908.08881."}