{"as_of":"2026-08-12T18:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:017787f8839307edd3541f35d0f940183c6702e9cf34c4b8adf1a22ca9fc6233","coverage":[{"denominator":297,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-31T17:52:58.606417Z","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-12T06:34:41.77262+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/2607.28099/citation-record","integrity":"/paper/2607.28099/integrity","json":"/paper/2607.28099/citation-record.json","paper":"/paper/2607.28099"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T17:52:58.249691Z","title":"Exponential Bounds for","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.249691Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:bc4ff33c06efc3725607ba28efbe573151c6f7533986e356b699da189de3a0e2","observation_id":"e176b7d8-60d0-4741-b50e-c9aca5a0a371","resolution":{"observed_at":"2026-07-31T17:52:58.249691Z","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-07-31T17:52:58.254484Z","title":"Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS) , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.254484Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:d901e2e9c6f7b573546b7dd325e6f7ff3384c82331abf25e4d40132111897750","observation_id":"80faf9c7-8e3a-4786-9408-e5ee01b4fa35","resolution":{"observed_at":"2026-07-31T17:52:58.254484Z","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-07-31T17:52:58.258277Z","title":"Random Structures & Algorithms , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.258277Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:4c615be1b5288663a2e4a836cb3ff11840bdd8c63b106cac891d2a86900fba38","observation_id":"ef3c4dcb-0cf9-4d63-a481-d658e8bcc287","resolution":{"observed_at":"2026-07-31T17:52:58.258277Z","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-07-31T17:52:58.262279Z","title":"On Approximation Algorithms for Hierarchical","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.262279Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:172456447ecc4d3fb7680d21637f6da9c948c47e3e260fb499a49319081a540c","observation_id":"7b921135-691e-4b42-bde0-c4f529bba7ec","resolution":{"observed_at":"2026-07-31T17:52:58.262279Z","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-07-31T17:52:58.266654Z","title":"Algorithmica , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.266654Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:b55798231b41f823d113ee6c58785123a5909f15fb35a5c531773f57c74f6466","observation_id":"00909a90-dfb8-4d8a-8c56-3626299e4f5f","resolution":{"observed_at":"2026-07-31T17:52:58.266654Z","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-07-31T17:52:58.270471Z","title":"Proceedings of the European Symposium on Algorithms (ESA) , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.270471Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:0f045fb09629130ea1ea922ed2011d7fa2b920b36017fd05789d44e4d2f02da8","observation_id":"9ab7f423-f191-4dd6-abe2-e37e17849f40","resolution":{"observed_at":"2026-07-31T17:52:58.270471Z","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-07-31T17:52:58.273919Z","title":"Deterministic Simulation in","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.273919Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:a338bd674ce3e4754ef5aa010e80c63197b482314ce0c1abde1638b90e330ac9","observation_id":"2e2a7cc9-fd4a-4700-b9f3-f24a5a8cf488","resolution":{"observed_at":"2026-07-31T17:52:58.273919Z","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-07-31T17:52:58.277989Z","title":"Combinatorica , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.277989Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:94c9975f177691a560579a1ecc991463cf4c61b4168316a0c4996c9492be00e3","observation_id":"ffc02ddb-1cb4-4144-a236-64f5e8397285","resolution":{"observed_at":"2026-07-31T17:52:58.277989Z","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-07-31T17:52:58.281696Z","title":"Discrete Mathematics , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.281696Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:ca3752954a26a7d95194cfb9ae8a6a1085a8b5c680c43ba5e5393e5a7e7a6f1d","observation_id":"36b6f671-679b-40ba-9e78-1d637ae12072","resolution":{"observed_at":"2026-07-31T17:52:58.281696Z","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-07-31T17:52:58.284938Z","title":"Computational Complexity , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.284938Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:c312b31ee3eeb0fc4a9141a7b1785eb00b75ab83ce75099034a99f2aa20f176d","observation_id":"57e6d9c6-7d6d-4457-8712-5477c32df69b","resolution":{"observed_at":"2026-07-31T17:52:58.284938Z","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-07-31T17:52:58.288870Z","title":"2016 , Series =","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.288870Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:4ede95bde0dd7bc95945b02f3579a814a2588c5a44ea23be4d752cc3c6d9429b","observation_id":"96d40b71-521a-4545-9d96-bbd58dddfd40","resolution":{"observed_at":"2026-07-31T17:52:58.288870Z","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-07-31T17:52:58.292154Z","title":"Proceedings of the Conference on Computational Complexity (CCC) , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.292154Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:1fda6d0e98253673a9d9033aaf1c1f6328894e0ec69dcddf679a9feef868b30f","observation_id":"c0cc9d62-f20a-4590-81d9-91548202f67c","resolution":{"observed_at":"2026-07-31T17:52:58.292154Z","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-07-31T17:52:58.296166Z","title":"Journal of Computer and System Sciences , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.296166Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:8b1e64dfb72266133581e21bbad466b41c66a8e0b7825408a4e615d3351e044c","observation_id":"d8b01c50-551a-45db-aee8-a75484bc8496","resolution":{"observed_at":"2026-07-31T17:52:58.296166Z","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-07-31T17:52:58.300387Z","title":"2009 , Doi =","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.300387Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:bb1216b3839ae4b41cbec14db477ed90eb8c8bf70235b7ec93c2a7500da15a65","observation_id":"41f64c9c-8c3a-4b7d-bc76-af6aa328239d","resolution":{"observed_at":"2026-07-31T17:52:58.300387Z","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-07-31T17:52:58.303884Z","title":"Journal of the ACM , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.303884Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:266c4b113e4d4dc791c992ce755b46d4eb3924a0058fabb4dc6cf5e9eb8019ae","observation_id":"f816eb76-13bb-4546-8256-8d441325e677","resolution":{"observed_at":"2026-07-31T17:52:58.303884Z","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-07-31T17:52:58.307342Z","title":"Probabilistic Checking of Proofs: A New Characterization of","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.307342Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:11a905532f96a41a54f4621836a0c93e09cccce3e6ad1f722ca6a53469e62139","observation_id":"6941afb9-afa7-45e4-8546-27644f210756","resolution":{"observed_at":"2026-07-31T17:52:58.307342Z","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-07-31T17:52:58.310888Z","title":"Combinatorica , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.310888Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:e638bc9374e41dbb1faa72b8c7d362d8673c188116298b2a458c60234b996b55","observation_id":"811abcf9-2281-49bf-80f6-73e2f4403286","resolution":{"observed_at":"2026-07-31T17:52:58.310888Z","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-07-31T17:52:58.314467Z","title":"Balanced","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.314467Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:b9a2f08f3f514c6878eea2597039bafee3ee11df5870a96e70fc62966275d1fe","observation_id":"3cc9c47d-acdf-4e00-9788-d11c9236527a","resolution":{"observed_at":"2026-07-31T17:52:58.314467Z","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-07-31T17:52:58.318569Z","title":"Theory of Computing , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.318569Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:e21a42525e87dba0215c8dbeaea8820f5d37bde6879e558c356a45e2f91fc69c","observation_id":"c5b05a91-88b1-4a4a-9151-33146d9b9c0d","resolution":{"observed_at":"2026-07-31T17:52:58.318569Z","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-07-31T17:52:58.322042Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.322042Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:49c03416b4301bd287ef524f9b9377801f31d4ac88c5c82792b1f1e08abe6f90","observation_id":"b29fc888-efae-45d5-9910-366d27f1be92","resolution":{"observed_at":"2026-07-31T17:52:58.322042Z","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-07-31T17:52:58.325681Z","title":"Computational Complexity , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.325681Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:ce50250dd7c9155462cc016fec5f5b83610f5970a00c93ee2da303dd0d938a02","observation_id":"4d1964fd-f6c5-48ea-894f-572a7523cfeb","resolution":{"observed_at":"2026-07-31T17:52:58.325681Z","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-07-31T17:52:58.328714Z","title":"Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS) , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.328714Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:311dd5cb5ba829b2319f358f70aa20bb613aa3b34d15ea92978024cc73e94965","observation_id":"37618838-8fa6-4c46-b416-9174302d5bb5","resolution":{"observed_at":"2026-07-31T17:52:58.328714Z","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-07-31T17:52:58.331824Z","title":"Proceedings of the ACM Symposium on Theory of Computing (STOC) , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.331824Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:d496727ccb58c6268a8cfbff2f12555ce0709f3b928a309286836d63673704bb","observation_id":"788a87d0-d422-41ab-8ef9-e475616b9ea6","resolution":{"observed_at":"2026-07-31T17:52:58.331824Z","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-07-31T17:52:58.335523Z","title":"Quasi-Linear Size","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.335523Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:650b7870eb9430852a5656961d8d70a97e810088dfcc2a39516e276629e81087","observation_id":"3abc2896-ae2d-4940-8ba8-fc5674feaac8","resolution":{"observed_at":"2026-07-31T17:52:58.335523Z","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-07-31T17:52:58.338607Z","title":"Journal of Computer and System Sciences , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.338607Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:20a5c17d661e3b3f8d35db5d539f4154e567e46ea073e485c7a595ae3f4712f0","observation_id":"db4164b1-8999-496f-8859-a008f62dcf02","resolution":{"observed_at":"2026-07-31T17:52:58.338607Z","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-07-31T17:52:58.342906Z","title":"IEEE Transactions on Information Theory , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.342906Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:9d62953918790e862986f7f69429fcbbe974f220900ef685f50c344558eab05d","observation_id":"eb5f8a65-b555-447d-b0b7-9081981d01a2","resolution":{"observed_at":"2026-07-31T17:52:58.342906Z","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-07-31T17:52:58.346280Z","title":"Free Bits,","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.346280Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:0e9130e0c53d5c3fc90293b3bcc5eb5a4f5b974fc1f6fbd85fe5f6f8874cd16a","observation_id":"675a49b2-038d-4cd9-922f-0b3f0d28d25f","resolution":{"observed_at":"2026-07-31T17:52:58.346280Z","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-07-31T17:52:58.350318Z","title":"Proceedings of the ACM Symposium on Theory of Computing (STOC) , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.350318Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:a7c17cdf96295540d7517c5de82a024703c3184cd6d2c16e3c12a8295e54673f","observation_id":"24b4d41e-033a-4524-8ac0-52b1740dc25c","resolution":{"observed_at":"2026-07-31T17:52:58.350318Z","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-07-31T17:52:58.353749Z","title":"Theory of Computing Systems , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.353749Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:cc2b728f2242e56fa18d1cbe3321ac85d56bc48e2b5478eaa945bb39495293dd","observation_id":"12008f91-1c9a-40e4-9467-f005520f92ee","resolution":{"observed_at":"2026-07-31T17:52:58.353749Z","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-07-31T17:52:58.357168Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.357168Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:bea20cf5ba84507a95b24a01b6f7bdad0c16ce809184dee9935738dd7feb6c23","observation_id":"fd728b11-9471-4e54-97c1-be7acbf5d516","resolution":{"observed_at":"2026-07-31T17:52:58.357168Z","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-07-31T17:52:58.361127Z","title":"Randomness-efficient low degree tests and short","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.361127Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:6a3df9fe0305176348d930703a3a6f55707140a8344fcbaf7cbf44c35177dc5f","observation_id":"def538d9-f362-4744-ae8c-b671f9e9e8b7","resolution":{"observed_at":"2026-07-31T17:52:58.361127Z","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-07-31T17:52:58.365290Z","title":"SIAM Journal on Computing , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.365290Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:25d0aabaede1dcc1a54b5ebe70d2fb007ea1e35dd1eae3a4cdbd33ca18cfe04d","observation_id":"8288236d-ffe3-4b1d-a493-9248d3fb5a2d","resolution":{"observed_at":"2026-07-31T17:52:58.365290Z","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-07-31T17:52:58.368640Z","title":"Stochastic Processes and their Applications , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.368640Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:39a1269fb926e37300a7eb4a10619fb56b9b10b6b248a5aedee59c0bc11e3bae","observation_id":"252e7b99-4790-4993-bae4-50991d066587","resolution":{"observed_at":"2026-07-31T17:52:58.368640Z","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-07-31T17:52:58.371965Z","title":"Discrete Applied Mathematics , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.371965Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:fe2c5f381965c8685b003cfc51b87ad250f2a129f8086c2ba9a1ba094301b62f","observation_id":"7a619b45-c1b8-4b7b-bd53-a5c2758d5227","resolution":{"observed_at":"2026-07-31T17:52:58.371965Z","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-07-31T17:52:58.376119Z","title":"Rigid Matrices From Rectangular","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.376119Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:a1dc7e315b736f267b5d2314fd8d684b7aaf61cb2165f0bfd8b84bb117023070","observation_id":"040637ea-6d79-496f-89b9-70e704c9a70c","resolution":{"observed_at":"2026-07-31T17:52:58.376119Z","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-07-31T17:52:58.380294Z","title":"2022 , Number =","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.380294Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:b435008c16ac1d9f869a931250614d4929be024b4d4a31ca522b1748a71a810d","observation_id":"261e9fb6-f8f0-4c70-af21-da30fe97b297","resolution":{"observed_at":"2026-07-31T17:52:58.380294Z","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-07-31T17:52:58.383908Z","title":"Proceedings of the International Workshop on Combinatorial Algorithms (IWOCA) , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.383908Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:5264522b54078a7432eef779c1e850e8e5c7d61f1118b79a00fea11637106ab9","observation_id":"40248f81-8c20-4052-853e-66527f2ec2b7","resolution":{"observed_at":"2026-07-31T17:52:58.383908Z","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-07-31T17:52:58.387800Z","title":"Journal of Computer and System Sciences , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.387800Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:dc62c9fa7e51eb2625df2d958f1f3d6bcb0b29c35e71c2350b33681d8224763f","observation_id":"9911bc60-a45e-4686-bb00-6cae85477fa5","resolution":{"observed_at":"2026-07-31T17:52:58.387800Z","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-07-31T17:52:58.390762Z","title":"and Groenland, Carla and Nederlof, Jesper and Swennenhuis, C\\'","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.390762Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:a159cead650af0d93664824c1e8e41e84c0f4aa2b96de47fa6f3b24889ca0ab2","observation_id":"d4d04d13-6289-4f6e-bd56-b496f2a02807","resolution":{"observed_at":"2026-07-31T17:52:58.390762Z","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":"10.1007/s00453-026-01381-9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Algorithmica , Year =","venue":"Algorithmica","work_id":"be093cf0-2ecd-4225-b68e-1a9045370223","year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.394090Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:ef465c0e63cc4ff3dac77c93479825b1c762c6c6d714b48fc51ec4e6e09e449a","observation_id":"0edfe36b-70db-4286-91e0-636e6199bf96","resolution":{"observed_at":"2026-07-31T17:55:58.367886Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07-31T17:52:58.397223Z","title":"Electronic Colloquium on Computational Complexity , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.397223Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:e5a349d407d1c26d1ee6b14495c9c45d13d80d203c704507d20e20b13b48700e","observation_id":"123a9e4d-5190-4044-9113-904594e7f1ba","resolution":{"observed_at":"2026-07-31T17:52:58.397223Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1406.1433","last_updated":"2014-06-05T16:21:51Z","snapshot_observed_at":"2026-07-06T03:45:35.499800Z","submitted_at":"2014-06-05T16:21:51Z","title":"Reconfiguring Independent Sets in Cographs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1406.1433","snapshot_observed_at":"2026-07-31T17:52:58.400459Z","title":"Computing Research Repository , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.400459Z"},"links":{"cited_paper":"/paper/1406.1433","citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:f2da979745cde6f9a63fe75dec29c018ab83b0cde6861520a33795d7cc965ced","observation_id":"31d24878-1a0e-4b9e-a74c-088f77366fb4","resolution":{"observed_at":"2026-07-31T17:52:58.400459Z","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-07-31T17:52:58.404794Z","title":"Electronic Notes in Discrete Mathematics , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.404794Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:1ea79ad69dcbaf8fbb5b2405c8df704aa3dcef4041d9212a6e921653eb454128","observation_id":"8933f8a2-f187-4a73-9046-7291a8a724b9","resolution":{"observed_at":"2026-07-31T17:52:58.404794Z","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-07-31T17:52:58.408557Z","title":"Shortest Reconfiguration of Colorings Under","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.408557Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:ac5a5da90c1d6a66d479148ebcdec950729e846154a7415e3e361d77ed87a6ff","observation_id":"33cb7359-9095-41e9-926b-ef2baf1bba23","resolution":{"observed_at":"2026-07-31T17:52:58.408557Z","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-07-31T17:52:58.411831Z","title":"Journal of Combinatorial Optimization , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.411831Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:eb3d4f1c88f856b335f70b590204204b26e72d42d7fb5e1e60f03768bdcf772a","observation_id":"2d62cafd-2244-4de6-9367-8cf1d93f9689","resolution":{"observed_at":"2026-07-31T17:52:58.411831Z","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-07-31T17:52:58.414947Z","title":"Electronic Notes in Discrete Mathematics , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.414947Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:b7d4daf45a831bff3019ece50a005cfdfcea5af5696a5b00e9b6501444524a9f","observation_id":"ac43a5b3-e450-40c1-9a5e-fd4fee91b634","resolution":{"observed_at":"2026-07-31T17:52:58.414947Z","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-07-31T17:52:58.418734Z","title":"Algorithmica , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.418734Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:506e453d3448a19bd6d7d47b0d421c096fc49379882a5a22683645fcfc03e2af","observation_id":"5c79a613-8e7a-476d-b4ea-b4687556da7e","resolution":{"observed_at":"2026-07-31T17:52:58.418734Z","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-07-31T17:52:58.422468Z","title":"Journal of Graph Theory , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.422468Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:0c541543d41400cf91c26bc5f42668b305af7c1d73c1152975c639ba5b32bf96","observation_id":"385d7f3f-a731-4e3e-a1cf-cddbcc8b578a","resolution":{"observed_at":"2026-07-31T17:52:58.422468Z","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-07-31T17:52:58.425645Z","title":"Theoretical Computer Science , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.425645Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:d9b52ab4c2a3aa75726e14efee9663e1ee122a33da5b29ed9311034ed62aaaf7","observation_id":"b3933319-c96d-483b-ab51-0c46e32fbfb4","resolution":{"observed_at":"2026-07-31T17:52:58.425645Z","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-07-31T17:52:58.429169Z","title":"Finding paths between graph colourings:","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.429169Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:664bbdcc8f0baffcc582d8a7b9ec649362d6db18b3209afe396de3d8a4beb301","observation_id":"36fc4b3f-f4ee-4823-8698-c36936f3a742","resolution":{"observed_at":"2026-07-31T17:52:58.429169Z","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-07-31T17:52:58.432325Z","title":"Proceedings of the Scandinavian Symposium and Workshops on Algorithm Theory (SWAT) , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.432325Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:19dfcb119ae6ddd041ec42806dfea818e101357ac1ccb0c8d84df4c96029235e","observation_id":"0497a72d-589a-4b60-bc9d-00f66c0f6d0b","resolution":{"observed_at":"2026-07-31T17:52:58.432325Z","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-07-31T17:52:58.435926Z","title":"and Nishimura, Naomi and Raman, Venkatesh , Booktitle =","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.435926Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:dceaa17101af774e23d8272193dc21cf931ed683a225860cddda183382c0075d","observation_id":"2faa3315-9f6d-4696-84b9-cf0d535d5156","resolution":{"observed_at":"2026-07-31T17:52:58.435926Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.03011","last_updated":"2024-01-05T15:59:06Z","snapshot_observed_at":"2026-08-07T10:45:49.754336Z","submitted_at":"2024-01-05T15:59:06Z","title":"A Note on the Complexity of Graph Recoloring","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.03011","snapshot_observed_at":"2026-07-31T17:52:58.439061Z","title":"Computing Research Repository , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.439061Z"},"links":{"cited_paper":"/paper/2401.03011","citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:5b18b6298f960fc9622184c4782b6a6962ee28a718a73387660d7e01e34ae2b1","observation_id":"01d91434-f716-4544-8b0e-7149820a5ba9","resolution":{"observed_at":"2026-07-31T17:52:58.439061Z","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-07-31T17:52:58.442845Z","title":"Proceedings of the European Symposium on Algorithms (ESA) , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.442845Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:a6ba8855ee3fa75df6a63d094f069f1e6cba8724bc6228b3afa29d0b6e7c7f5d","observation_id":"cf9f5863-dc1f-4ce7-ba80-a6a4fb913235","resolution":{"observed_at":"2026-07-31T17:52:58.442845Z","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-07-31T17:52:58.446151Z","title":"The Electronic Journal of Combinatorics , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.446151Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:a4bb6ad63ccd55b7dfaa5c893bb8c2fdc61f91eb44614f7da42fd012074784a0","observation_id":"b7e252e6-46a0-49fb-a4e9-e241fc2c31ec","resolution":{"observed_at":"2026-07-31T17:52:58.446151Z","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-07-31T17:52:58.450378Z","title":"Proceedings of the International Workshop on Graph-Theoretic Concepts in Computer Science (WG) , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.450378Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:975885887f79dbbe6d383b2de624b567afd3a10fd9e1e65a41378008650ca9fe","observation_id":"e4928830-8818-4bb1-9131-038cbf07dd51","resolution":{"observed_at":"2026-07-31T17:52:58.450378Z","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-07-31T17:52:58.453740Z","title":"Algorithmica , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.453740Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:aebec8896ccdf5ac342a48e64cc3e2239edaa253031a1e94c4e52510ce69db7b","observation_id":"9ed4545e-5b14-405b-a415-de85a6bf8b42","resolution":{"observed_at":"2026-07-31T17:52:58.453740Z","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-07-31T17:52:58.457759Z","title":"Proceedings of the European Symposium on Algorithms (ESA) , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.457759Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:8a6d5b76d4eb4a27a4bc810576acce3bca8db244f7dc595a03be01875f468bbf","observation_id":"60acf484-a0df-43db-afef-164521b2c688","resolution":{"observed_at":"2026-07-31T17:52:58.457759Z","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-07-31T17:52:58.461432Z","title":"Proceedings of the International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM) , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.461432Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:6e3a12ae467014fbc5a2f07fd5b463af6c36c01aef94803a20065c7e419cf460","observation_id":"c7adaf0f-0943-42e9-8b52-1ae0175f23a6","resolution":{"observed_at":"2026-07-31T17:52:58.461432Z","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-07-31T17:52:58.464842Z","title":"Proceedings of the International Workshop on Approximation and Online Algorithms (WAOA) , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.464842Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:c3fd2078e100918dc0194c799b1d1676a41803d709df35365fb39a3d19815182","observation_id":"e06ecad0-c711-45d4-abd7-f14d643ce9f5","resolution":{"observed_at":"2026-07-31T17:52:58.464842Z","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-07-31T17:52:58.468326Z","title":"Computer Science Review , Year =","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.468326Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:44d653c942b9a193faf16498fc3a11dec6cd255696b0fa3bd20f33cdcf9921bb","observation_id":"0608aeb4-fe52-404b-bd5c-c5f42e37e888","resolution":{"observed_at":"2026-07-31T17:52:58.468326Z","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-07-31T17:52:58.471433Z","title":"Tight approximability of","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.471433Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:5246dc7b2d46c7abb8d44a933a56de9c73ef4f5da3ca68a666041931f95411c2","observation_id":"0bf05c94-d9b7-43e0-858f-2e6b4811d12e","resolution":{"observed_at":"2026-07-31T17:52:58.471433Z","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-07-31T17:52:58.475508Z","title":"Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA) , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.475508Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:ff7b3b719125e8accc53f011d3c7084345b59f2e8c9556ca5e60b3d79ce549e1","observation_id":"cae1682e-9bee-490e-8a81-f47f962a2905","resolution":{"observed_at":"2026-07-31T17:52:58.475508Z","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-07-31T17:52:58.479294Z","title":"Proceedings of the International Symposium on Mathematical Foundations of Computer Science (MFCS) , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.479294Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:eb34675033aa6537601aca49407ee555ff432e96bd1933e720924f16c106b363","observation_id":"0900c6aa-115d-4ba8-a974-9789ada7cb21","resolution":{"observed_at":"2026-07-31T17:52:58.479294Z","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-07-31T17:52:58.482338Z","title":"Theoretical Computer Science , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.482338Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:b1b2331fec6f8daefe282cd21441996fa02c868b2f2ed6fbd846341b08b318d5","observation_id":"afb258b2-4071-45fc-9c07-bece27509093","resolution":{"observed_at":"2026-07-31T17:52:58.482338Z","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-07-31T17:52:58.485589Z","title":"Proceedings of the Innovations in Theoretical Computer Science Conference (ITCS) , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.485589Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:2b2bd3a23163a12f3451006abdff0af94e453f8f554c944977e4b9255c2d5018","observation_id":"45f21bae-05b1-4e68-a105-48bf53ffcf99","resolution":{"observed_at":"2026-07-31T17:52:58.485589Z","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-07-31T17:52:58.489537Z","title":"2007 , Url =","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.489537Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:e805958e498e0efed88ccebc1f51207852ffdf63ecdf2e5516e4f56dc0037e63","observation_id":"920cfad5-bda1-45c0-8b67-2d5d0c2b92f5","resolution":{"observed_at":"2026-07-31T17:52:58.489537Z","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-07-31T17:52:58.493509Z","title":"Journal of Graph Theory , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.493509Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:6bca088ed8f93cd2d73d1e7d2148d11277ffdf13960243b06440c98103dfb82d","observation_id":"328ede52-0f12-45c0-9f2b-729522fc6893","resolution":{"observed_at":"2026-07-31T17:52:58.493509Z","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-07-31T17:52:58.497341Z","title":"European Journal of Combinatorics , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.497341Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:be95e4cc3f175a81e4b210866ad14cfff7fc4db2e2fed214ecdb672f90bce34e","observation_id":"f474a523-adf8-4213-ae2c-cc1433744415","resolution":{"observed_at":"2026-07-31T17:52:58.497341Z","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-07-31T17:52:58.501835Z","title":"Discrete Mathematics , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.501835Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:9bb074e56e9079261fdd9bd8e286f87adb9067c243246c01b6af0ff64506eaa7","observation_id":"bc66591d-1e4f-4d63-b32c-baa8659a72b3","resolution":{"observed_at":"2026-07-31T17:52:58.501835Z","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-07-31T17:52:58.504903Z","title":"Hardness of Approximation in","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.504903Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:6444fe24c5e7f92c4908af738e61b926ce2f68a66be6fb81e8c63ce7c64fe97d","observation_id":"d67ac458-d85c-4750-9de0-1d913984038f","resolution":{"observed_at":"2026-07-31T17:52:58.504903Z","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-07-31T17:52:58.508302Z","title":"Journal of the ACM , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.508302Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:6d5d25e959fed8d4de805a56ab08fa65f5d47324e9f5044fc407e28639a8396f","observation_id":"d96537b2-51df-4036-92d0-03265fdf378c","resolution":{"observed_at":"2026-07-31T17:52:58.508302Z","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-07-31T17:52:58.511717Z","title":"Algorithmica , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.511717Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:272e533b1885a28e0f04b3ba4405918fbca6da1fd8e82a0753234f680535025b","observation_id":"a7035bbe-fff3-4051-84b4-44881648b0d7","resolution":{"observed_at":"2026-07-31T17:52:58.511717Z","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-07-31T17:52:58.514925Z","title":"SIAM Journal on Discrete Mathematics , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.514925Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:972cc804215b4603f2ce0a6b904624908a4fdf7727f021320996f4236c17393c","observation_id":"09253aa8-3e7a-4aa7-8ed6-b5d79301c60d","resolution":{"observed_at":"2026-07-31T17:52:58.514925Z","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-07-31T17:52:58.518319Z","title":"From Algorithms to Connectivity and Back: Finding a Giant Component in Random","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.518319Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:16d7ef83a55057ed0cf38e56c934f75850e63d8ae1356e7ab24650405d01c24c","observation_id":"5eaee8a1-46e1-460a-b1cd-545f32a8052a","resolution":{"observed_at":"2026-07-31T17:52:58.518319Z","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-07-31T17:52:58.521487Z","title":"The Annals of Mathematical Statistics , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.521487Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:9b585c7b485dc13ae2c368949a243c691dbe7c7ae4c97600d421f5751fb28aaf","observation_id":"ae91389d-1cc3-4f9a-92c7-2faad6b498d1","resolution":{"observed_at":"2026-07-31T17:52:58.521487Z","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-07-31T17:52:58.524524Z","title":"On Parallel Repetition of","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.524524Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:b525d65cfc385c0d019daa13941202145a7f3ec008fcd1ea4fe60ca0b08bd04f","observation_id":"c0e4e5b1-5538-4e9b-8f4d-9683b379e934","resolution":{"observed_at":"2026-07-31T17:52:58.524524Z","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-07-31T17:52:58.527680Z","title":"Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA) , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.527680Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:f960e3e6fc464c4cf3a72c987758a53f2c411f1b510c36a6ac049a18129896dd","observation_id":"df521cc0-033e-4e1f-931d-e30d5d8a40a8","resolution":{"observed_at":"2026-07-31T17:52:58.527680Z","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-07-31T17:52:58.531034Z","title":"Mathematics of Operations Research , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.531034Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:526193dbb87200ba7156a5f2ac153e2f7c6fb91f9c53f7f19360e459e1d6dc03","observation_id":"4af7bef9-ebe4-42d1-bed8-2c494e16b6e6","resolution":{"observed_at":"2026-07-31T17:52:58.531034Z","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-07-31T17:52:58.534494Z","title":", Booktitle =","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.534494Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:c35a4543f4d7331e74317aef7977c8046f42bd917b1c7962024db5c4e2639060","observation_id":"ce322e96-a383-417d-94de-32830ea02147","resolution":{"observed_at":"2026-07-31T17:52:58.534494Z","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-07-31T17:52:58.537964Z","title":"Advances in Mathematics , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.537964Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:1d1dc2b3f7dd8486f87e6cb50ff92d57235667fffb1a0e3d4cde910efb79d77f","observation_id":"bcae0094-d453-4962-808a-4007c0f7a170","resolution":{"observed_at":"2026-07-31T17:52:58.537964Z","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-07-31T17:52:58.541187Z","title":"Approximate Solutions to Problems in","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.541187Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:0650db3e5ea31f7d1fc3e0c4694a3e2ec5418cd8090207e5e9643e275af92270","observation_id":"d9391470-6b88-4b2d-9ecf-bfe3123b5343","resolution":{"observed_at":"2026-07-31T17:52:58.541187Z","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-07-31T17:52:58.544664Z","title":"SIAM Journal on Computing , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.544664Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:d174c07e6f251130b50219c3f4c414cbb6eae65841dadc2fd5eaa50eef3d26c0","observation_id":"013ae2ff-20b0-479c-b0a6-ba5a810c1c14","resolution":{"observed_at":"2026-07-31T17:52:58.544664Z","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-07-31T17:52:58.547892Z","title":", Journal =","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.547892Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:384fcb4ccedfc4de594e7f81440bf69e5b08649b0e4271e591a5468af0821009","observation_id":"5c407c31-8040-441b-b51e-6d82248d2ceb","resolution":{"observed_at":"2026-07-31T17:52:58.547892Z","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-07-31T17:52:58.551960Z","title":"Proceedings of the IEEE Conference on Computational Complexity (CCC) , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.551960Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:751c94b6be9ea72baea730bc527506f85c59b51318471907da88112693c606bc","observation_id":"ba0034e5-c8ff-41f6-a003-2a30f093a9bb","resolution":{"observed_at":"2026-07-31T17:52:58.551960Z","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-07-31T17:52:58.555995Z","title":"Theory of Computing Systems , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.555995Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:7c76cb631ff0d82b6854d1e5dd4def71896483ede6dadd6aeec8564701f1295a","observation_id":"66a88f6f-891e-42de-a34b-8c3ca921e8bc","resolution":{"observed_at":"2026-07-31T17:52:58.555995Z","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-07-31T17:52:58.559898Z","title":"2015 , Doi =","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.559898Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:d45128bacc09b2c7e93bd0b452b61761b954753eb0940fa816bf061fcb79a85b","observation_id":"1bb7969c-0003-463d-baa1-a52f97872b94","resolution":{"observed_at":"2026-07-31T17:52:58.559898Z","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-07-31T17:52:58.563746Z","title":"SIAM Journal on Computing , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.563746Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:5a7ae4853ef565d74be74d3a05767095e7720bcafbcaf48cb6d113cd1dd52f09","observation_id":"508d182d-e7d6-40d2-a0be-b50c4022e097","resolution":{"observed_at":"2026-07-31T17:52:58.563746Z","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-07-31T17:52:58.567409Z","title":"Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA) , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.567409Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:70a19286ac6f246d16d87636ab1011bcc42e40240174f49c6b03dd74eeab3bfd","observation_id":"94e0db3e-f2ab-4dc7-ade6-e957758e3f4b","resolution":{"observed_at":"2026-07-31T17:52:58.567409Z","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-07-31T17:52:58.570748Z","title":"Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS) , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.570748Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:ec2ea7fc8a1c8afa8fe3a01060c7215b3e713d2f2f779e82612ee0fa8337e226","observation_id":"59499720-2a22-4e91-a2df-3f6b36dbf02a","resolution":{"observed_at":"2026-07-31T17:52:58.570748Z","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-07-31T17:52:58.574204Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":91,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.574204Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:bd5a50e67377b4c22a9b800dcbca012aa33b3f896b7b8155f1c4177c7e7fe716","observation_id":"4c56dbe1-4f34-45a2-8ef1-46d3a919b5ef","resolution":{"observed_at":"2026-07-31T17:52:58.574204Z","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-07-31T17:52:58.577501Z","title":"Theoretical Computer Science , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.577501Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:6b75f16164c373546844c70d9cc3a3e9d713ceeae44b56b8bd7c7e9265531126","observation_id":"06dce67f-a2d4-4d49-b9fd-8ecef8d60a35","resolution":{"observed_at":"2026-07-31T17:52:58.577501Z","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-07-31T17:52:58.580595Z","title":"Proceedings of the International Symposium on Algorithms and Data Structures (WADS) , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":93,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.580595Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:f8e85ad3dd8676d8daa34d58fbed672f090d72fe8f0058fa6869081e6c677ed8","observation_id":"165e9abc-1525-44b5-9d0e-b6f9541c0a1e","resolution":{"observed_at":"2026-07-31T17:52:58.580595Z","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-07-31T17:52:58.584207Z","title":"Proceedings of the ACM Symposium on Theory of Computing (STOC) , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.584207Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:e0d7936a885a5b1ee98eedb24a1a9b73452dabada52da9c62532550b2d71a6cd","observation_id":"2da74e5c-5c4e-47b4-98fb-0e356208765b","resolution":{"observed_at":"2026-07-31T17:52:58.584207Z","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-07-31T17:52:58.588500Z","title":"Proceedings of the ACM Symposium on Theory of Computing (STOC) , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":95,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.588500Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:d123c49f3cb36c868fc763740e03ad01adabbefe043380c9ecb9652e33768e0f","observation_id":"151c78ae-0f21-4910-8e97-2169ea9a01ba","resolution":{"observed_at":"2026-07-31T17:52:58.588500Z","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-07-31T17:52:58.592536Z","title":"Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS) , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":96,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.592536Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:c6c6d0db6ae4c8b4fa6632cfb295ddb42e8e17338981e0a9c77916af87509e16","observation_id":"69c997bc-655b-4226-be54-29870ec0a9da","resolution":{"observed_at":"2026-07-31T17:52:58.592536Z","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-07-31T17:52:58.595778Z","title":"Low Acceptance Agreement Tests via Bounded-Degree Symplectic","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":97,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.595778Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:d3f47696bb236c22f2b000e4aa998f2c489b5998fa7a651664b997dd2376087a","observation_id":"20b8d4b0-f660-437c-8b74-4f62423974d8","resolution":{"observed_at":"2026-07-31T17:52:58.595778Z","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-07-31T17:52:58.599110Z","title":"Annals of Mathematics , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":98,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.599110Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:c3ec36bdb7768a03abb87e8858e74e537f0a04bd92b97812c45bcb3653b734c3","observation_id":"5e5cdc43-1c03-427c-b2fa-773b552b1012","resolution":{"observed_at":"2026-07-31T17:52:58.599110Z","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-07-31T17:52:58.602804Z","title":null,"venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":99,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.602804Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:d1d3684b9da794a1c8af19f4dbece4d065f03c1d6f663c76d4af5e5abc918b5f","observation_id":"034ab954-d6c5-46ed-a850-f3c4ce42af07","resolution":{"observed_at":"2026-07-31T17:52:58.602804Z","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-07-31T17:52:58.606417Z","title":"Proceedings of the Annual IEEE Symposium on Foundations of Computer Science , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":100,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.606417Z"},"links":{"citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:f9df709d37e7b3091821d4f0a95137d14bb772de0969dcda1b03568e78da7384","observation_id":"2dd62fac-dd4b-43a1-b975-8bda338bdb5b","resolution":{"observed_at":"2026-07-31T17:52:58.606417Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":99,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":297},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 100 of 297 outbound references and 0 inbound Pith citation observations for arXiv:2607.28099."}