{"as_of":"2026-08-12T17:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dbad8a04611397b03f9f06c72259e03792daff227dddbf95b2ac22fa0dc8c2a2","coverage":[{"denominator":22,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":22,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T21:08:16.751412Z","state":"measured"},{"denominator":23,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":23,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-31T17:52:58.767799Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2507.01192","last_updated":"2025-07-01T21:15:22Z","snapshot_observed_at":"2026-08-07T23:55:35.204549Z","submitted_at":"2025-07-01T21:15:22Z","title":"PCPP-Based Reconfiguration Inapproximability: Query Complexity vs. Soundness Gap Trade-offs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.01192","snapshot_observed_at":"2026-07-31T17:52:58.767799Z","title":"2025 , Volume =","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":146,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.767799Z"},"links":{"cited_paper":"/paper/2507.01192","citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:29c077382f94bfbc46ce4f7c707a86d83e921d296024c7bfd358c5b2a1ead66a","observation_id":"5a7838e3-ffe8-4a58-a87b-614363d58bee","resolution":{"observed_at":"2026-07-31T17:52:58.767799Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2507.01192/citation-record","integrity":"/paper/2507.01192/integrity","json":"/paper/2507.01192/citation-record.json","paper":"/paper/2507.01192"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:08:19.313948Z","title":"Proof verification and the hardness of approximation problems","venue":null,"work_id":"9e1eac43-7d46-4882-b9ab-9e9024f2ed7b","year":1998},"citing_paper":{"arxiv_id":"2507.01192","last_updated":"2025-07-01T21:15:22Z","snapshot_observed_at":"2026-08-07T23:55:35.204549Z","submitted_at":"2025-07-01T21:15:22Z","title":"PCPP-Based Reconfiguration Inapproximability: Query Complexity vs. Soundness Gap Trade-offs","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T21:08:15.143375Z"},"links":{"citing_paper":"/paper/2507.01192"},"observation_digest":"sha256:cf743747a62a4e3ab40238b8b1eaf86427f1f2894b4196d82cfbf68e2662b43e","observation_id":"7652a781-36a9-4e1d-8459-6c17299251d6","resolution":{"observed_at":"2026-08-06T21:08:19.392116Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:08:19.144207Z","title":"Probabilistic checking of proofs: A new characterization of NP","venue":null,"work_id":"452ed46e-e825-4595-8e92-159bfa16a982","year":1998},"citing_paper":{"arxiv_id":"2507.01192","last_updated":"2025-07-01T21:15:22Z","snapshot_observed_at":"2026-08-07T23:55:35.204549Z","submitted_at":"2025-07-01T21:15:22Z","title":"PCPP-Based Reconfiguration Inapproximability: Query Complexity vs. Soundness Gap Trade-offs","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T21:08:15.176603Z"},"links":{"citing_paper":"/paper/2507.01192"},"observation_digest":"sha256:11af9c1f57cb8cc661c223483f4bc2cebf586c65a8b0f4e71d910953d89d2330","observation_id":"6fdfbdff-57be-40a0-968b-8e58934e2c75","resolution":{"observed_at":"2026-08-06T21:08:19.243635Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:08:18.936320Z","title":null,"venue":null,"work_id":"816e6a25-c3f4-449e-b620-bf587c3dc641","year":2006},"citing_paper":{"arxiv_id":"2507.01192","last_updated":"2025-07-01T21:15:22Z","snapshot_observed_at":"2026-08-07T23:55:35.204549Z","submitted_at":"2025-07-01T21:15:22Z","title":"PCPP-Based Reconfiguration Inapproximability: Query Complexity vs. Soundness Gap Trade-offs","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T21:08:15.222606Z"},"links":{"citing_paper":"/paper/2507.01192"},"observation_digest":"sha256:57d5300152557d76b0f0e92c8c61c23f277821236bc8f5b804b710f0a33e6cd7","observation_id":"14a24311-8e82-4dd1-bc06-fccfdaa65a60","resolution":{"observed_at":"2026-08-06T21:08:19.040854Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:08:18.781384Z","title":"The complexity of rerouting shortest paths","venue":null,"work_id":"5d2c8ca5-b809-46c8-9dd5-3fa0dfb79be9","year":2013},"citing_paper":{"arxiv_id":"2507.01192","last_updated":"2025-07-01T21:15:22Z","snapshot_observed_at":"2026-08-07T23:55:35.204549Z","submitted_at":"2025-07-01T21:15:22Z","title":"PCPP-Based Reconfiguration Inapproximability: Query Complexity vs. Soundness Gap Trade-offs","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-06T21:08:15.306292Z"},"links":{"citing_paper":"/paper/2507.01192"},"observation_digest":"sha256:d40584163ba2bbf5b14b6752d298e130035a1220bc54b7147476c73e3df5d0fb","observation_id":"de3f6c92-a5ad-4c62-b118-972b7d82ff0d","resolution":{"observed_at":"2026-08-06T21:08:18.843672Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:08:18.659611Z","title":"Finding paths between 3-colorings","venue":null,"work_id":"c381ec7d-bedf-4018-bbe2-179cd6764b9e","year":2011},"citing_paper":{"arxiv_id":"2507.01192","last_updated":"2025-07-01T21:15:22Z","snapshot_observed_at":"2026-08-07T23:55:35.204549Z","submitted_at":"2025-07-01T21:15:22Z","title":"PCPP-Based Reconfiguration Inapproximability: Query Complexity vs. Soundness Gap Trade-offs","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T21:08:15.353285Z"},"links":{"citing_paper":"/paper/2507.01192"},"observation_digest":"sha256:08807b0dbeb97e8bfbd05051aa55d9c9ee63287ae7a4dad1e2d7f30eb7c42329","observation_id":"b02f7b37-ebe4-4718-a3d1-d4c5450e6cbe","resolution":{"observed_at":"2026-08-06T21:08:18.723922Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:08:18.537463Z","title":"Assignment testers: Towards a combinatorial proof of the PCP theorem","venue":null,"work_id":"f1a7e8d3-c0d7-4167-97d1-c47452ba09de","year":2006},"citing_paper":{"arxiv_id":"2507.01192","last_updated":"2025-07-01T21:15:22Z","snapshot_observed_at":"2026-08-07T23:55:35.204549Z","submitted_at":"2025-07-01T21:15:22Z","title":"PCPP-Based Reconfiguration Inapproximability: Query Complexity vs. Soundness Gap Trade-offs","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T21:08:15.486039Z"},"links":{"citing_paper":"/paper/2507.01192"},"observation_digest":"sha256:67173d50765b90b1a3b2cc06563459829d2cdb4f81fb62bdb15e52ddb64b758a","observation_id":"bcf3f4a6-516d-4e34-ac4a-300d9ac99a03","resolution":{"observed_at":"2026-08-06T21:08:18.586428Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:08:18.421754Z","title":"The connectivity of B oolean satisfiability: computational and structural dichotomies","venue":null,"work_id":"03e9fa3b-3c10-4d0d-ab06-26f5df7f9cf5","year":2009},"citing_paper":{"arxiv_id":"2507.01192","last_updated":"2025-07-01T21:15:22Z","snapshot_observed_at":"2026-08-07T23:55:35.204549Z","submitted_at":"2025-07-01T21:15:22Z","title":"PCPP-Based Reconfiguration Inapproximability: Query Complexity vs. Soundness Gap Trade-offs","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T21:08:15.599171Z"},"links":{"citing_paper":"/paper/2507.01192"},"observation_digest":"sha256:8353794bf2f56f20e5535b4a5ca749c7c9567dd4e038554de10d8c517fcc5ce5","observation_id":"04897675-b1f0-40fb-9a36-972f95f7954f","resolution":{"observed_at":"2026-08-06T21:08:18.460937Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":{"arxiv_id":"2404.08870","last_updated":"2024-06-11T20:13:07Z","snapshot_observed_at":"2026-07-06T17:59:38.202928Z","submitted_at":"2024-04-13T01:45:44Z","title":"Almost Optimal Time Lower Bound for Approximating Parameterized Clique, CSP, and More, under ETH","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.08870","snapshot_observed_at":"2026-08-06T21:08:15.702792Z","title":"Almost optimal time lower bound for approximating parameterized clique, CSP , and more, under ETH","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.01192","last_updated":"2025-07-01T21:15:22Z","snapshot_observed_at":"2026-08-07T23:55:35.204549Z","submitted_at":"2025-07-01T21:15:22Z","title":"PCPP-Based Reconfiguration Inapproximability: Query Complexity vs. Soundness Gap Trade-offs","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-06T21:08:15.702792Z"},"links":{"cited_paper":"/paper/2404.08870","citing_paper":"/paper/2507.01192"},"observation_digest":"sha256:6fdb6c9ceafba8263d1e01c306841b6930b9138347bdf679c24e35b825ea4498","observation_id":"39e6c22f-b1e2-4566-9eea-93d44d8d010e","resolution":{"observed_at":"2026-08-06T21:08:15.702792Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:08:18.289814Z","title":"Parameterized inapproximability hypothesis under exponential time hypothesis","venue":null,"work_id":"e8bcc63b-8894-4fd3-9341-23f954ff6e18","year":2024},"citing_paper":{"arxiv_id":"2507.01192","last_updated":"2025-07-01T21:15:22Z","snapshot_observed_at":"2026-08-07T23:55:35.204549Z","submitted_at":"2025-07-01T21:15:22Z","title":"PCPP-Based Reconfiguration Inapproximability: Query Complexity vs. Soundness Gap Trade-offs","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T21:08:15.839866Z"},"links":{"citing_paper":"/paper/2507.01192"},"observation_digest":"sha256:2c920f7e5093e80a60e0179be2c9e966ed129f1a8d56777bb2586c5c9aa585d6","observation_id":"4d615eaa-7b69-4d10-9058-d52d7b641b4d","resolution":{"observed_at":"2026-08-06T21:08:18.347139Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:08:18.184604Z","title":"Robust PCP s of Proximity and Shorter PCP s","venue":null,"work_id":"5ba1f84d-a89a-4fe4-b1a7-caff876305f2","year":2004},"citing_paper":{"arxiv_id":"2507.01192","last_updated":"2025-07-01T21:15:22Z","snapshot_observed_at":"2026-08-07T23:55:35.204549Z","submitted_at":"2025-07-01T21:15:22Z","title":"PCPP-Based Reconfiguration Inapproximability: Query Complexity vs. Soundness Gap Trade-offs","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-06T21:08:15.967130Z"},"links":{"citing_paper":"/paper/2507.01192"},"observation_digest":"sha256:627379c42ba1b84b890f542c0d15404006625e216c05d96005ff09a13082d255","observation_id":"c3982993-600b-4684-bc08-e7737f41ef3d","resolution":{"observed_at":"2026-08-06T21:08:18.217766Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:08:18.069983Z","title":"Probabilistically checkable reconfiguration proofs and inapproximability of reconfiguration problems","venue":null,"work_id":"2ca18840-166a-449b-ba39-828d3430ad41","year":2024},"citing_paper":{"arxiv_id":"2507.01192","last_updated":"2025-07-01T21:15:22Z","snapshot_observed_at":"2026-08-07T23:55:35.204549Z","submitted_at":"2025-07-01T21:15:22Z","title":"PCPP-Based Reconfiguration Inapproximability: Query Complexity vs. Soundness Gap Trade-offs","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T21:08:16.097698Z"},"links":{"citing_paper":"/paper/2507.01192"},"observation_digest":"sha256:059653a92ef6b58f064291bbcbabe6e266dd27dce266b75f65f4e1f6a7d07ab2","observation_id":"332795a7-4faa-453f-8023-c8cc810a91b1","resolution":{"observed_at":"2026-08-06T21:08:18.116163Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:08:17.977213Z","title":"Approximability of the subset sum reconfiguration problem","venue":null,"work_id":"48cbc9a1-a685-40c8-b9d6-008b901fb9d2","year":2014},"citing_paper":{"arxiv_id":"2507.01192","last_updated":"2025-07-01T21:15:22Z","snapshot_observed_at":"2026-08-07T23:55:35.204549Z","submitted_at":"2025-07-01T21:15:22Z","title":"PCPP-Based Reconfiguration Inapproximability: Query Complexity vs. Soundness Gap Trade-offs","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-06T21:08:16.190485Z"},"links":{"citing_paper":"/paper/2507.01192"},"observation_digest":"sha256:c3b99b726d73873ea152cc72719abc2b8f6d19e5d792b12e08a60e96bfd6919e","observation_id":"1a40efc4-1472-46b9-9087-261c7501ebd6","resolution":{"observed_at":"2026-08-06T21:08:18.031813Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:08:17.902904Z","title":"On the complexity of reconfiguration problems","venue":null,"work_id":"7f9186c3-8fbf-4cb9-9cba-31bb8906fb1d","year":2011},"citing_paper":{"arxiv_id":"2507.01192","last_updated":"2025-07-01T21:15:22Z","snapshot_observed_at":"2026-08-07T23:55:35.204549Z","submitted_at":"2025-07-01T21:15:22Z","title":"PCPP-Based Reconfiguration Inapproximability: Query Complexity vs. Soundness Gap Trade-offs","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-06T21:08:16.225322Z"},"links":{"citing_paper":"/paper/2507.01192"},"observation_digest":"sha256:d8781e3297efaa9bad0604e1760f4551adfe8ec925cb909d4af89bf9732276cd","observation_id":"68f3f993-259e-43ff-bdb1-07835c59d63a","resolution":{"observed_at":"2026-08-06T21:08:17.923402Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:08:17.789097Z","title":null,"venue":null,"work_id":"6d9c4768-79c9-4a30-aad3-1cb48c7ea96c","year":2024},"citing_paper":{"arxiv_id":"2507.01192","last_updated":"2025-07-01T21:15:22Z","snapshot_observed_at":"2026-08-07T23:55:35.204549Z","submitted_at":"2025-07-01T21:15:22Z","title":"PCPP-Based Reconfiguration Inapproximability: Query Complexity vs. Soundness Gap Trade-offs","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-06T21:08:16.251808Z"},"links":{"citing_paper":"/paper/2507.01192"},"observation_digest":"sha256:aec893238375969560341ed31397cfc2dc62cece93905b4498fe2b959d0032ca","observation_id":"0c474d30-a752-4d2b-8254-62f1aabd62fa","resolution":{"observed_at":"2026-08-06T21:08:17.848210Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:08:17.714194Z","title":"Improved hardness of approximating k-clique under ETH","venue":null,"work_id":"8261132c-a680-4889-a2bc-70e29b9a167b","year":2023},"citing_paper":{"arxiv_id":"2507.01192","last_updated":"2025-07-01T21:15:22Z","snapshot_observed_at":"2026-08-07T23:55:35.204549Z","submitted_at":"2025-07-01T21:15:22Z","title":"PCPP-Based Reconfiguration Inapproximability: Query Complexity vs. Soundness Gap Trade-offs","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-06T21:08:16.316000Z"},"links":{"citing_paper":"/paper/2507.01192"},"observation_digest":"sha256:9dd035c7cbee8239c02dd97291ce6f24b93c7b6b59486601b70cc21c115583ee","observation_id":"bbe9a2b1-eba1-458a-b9a1-7015412b840a","resolution":{"observed_at":"2026-08-06T21:08:17.742147Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:08:17.616599Z","title":"Two-query PCP with subconstant error","venue":null,"work_id":"5281aad8-d9dd-4ac1-9c93-03b43c2d9a2f","year":2008},"citing_paper":{"arxiv_id":"2507.01192","last_updated":"2025-07-01T21:15:22Z","snapshot_observed_at":"2026-08-07T23:55:35.204549Z","submitted_at":"2025-07-01T21:15:22Z","title":"PCPP-Based Reconfiguration Inapproximability: Query Complexity vs. Soundness Gap Trade-offs","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-06T21:08:16.388862Z"},"links":{"citing_paper":"/paper/2507.01192"},"observation_digest":"sha256:ac0b978a1198123bdbdda4cea3a9bce615526a48f8595d240898077e746e1e83","observation_id":"8bf2bd21-f8e4-4fd7-aeaa-608faaa88d1d","resolution":{"observed_at":"2026-08-06T21:08:17.656066Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:08:17.539680Z","title":"Introduction to reconfiguration","venue":null,"work_id":"c74bae00-024d-4be7-8de7-de687cb1f192","year":2018},"citing_paper":{"arxiv_id":"2507.01192","last_updated":"2025-07-01T21:15:22Z","snapshot_observed_at":"2026-08-07T23:55:35.204549Z","submitted_at":"2025-07-01T21:15:22Z","title":"PCPP-Based Reconfiguration Inapproximability: Query Complexity vs. Soundness Gap Trade-offs","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-06T21:08:16.435390Z"},"links":{"citing_paper":"/paper/2507.01192"},"observation_digest":"sha256:871575bb75c844a61bb5f5725735b01d57f3d88cf7e559372a3223520b187d07","observation_id":"70c97fca-6a51-495c-8e0c-804298479478","resolution":{"observed_at":"2026-08-06T21:08:17.584560Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:08:17.446219Z","title":"Gap preserving reductions between reconfiguration problems","venue":null,"work_id":"3e694bd2-678a-46a0-a9bd-b3e5c3af8a46","year":2023},"citing_paper":{"arxiv_id":"2507.01192","last_updated":"2025-07-01T21:15:22Z","snapshot_observed_at":"2026-08-07T23:55:35.204549Z","submitted_at":"2025-07-01T21:15:22Z","title":"PCPP-Based Reconfiguration Inapproximability: Query Complexity vs. Soundness Gap Trade-offs","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-06T21:08:16.510762Z"},"links":{"citing_paper":"/paper/2507.01192"},"observation_digest":"sha256:39206bad869d89a31b6c7ee524e81280e5ae871fe64d48d35be867afe7658bcc","observation_id":"7d807023-0ac9-416c-ac0f-c0039b7a5f43","resolution":{"observed_at":"2026-08-06T21:08:17.467863Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:08:17.299412Z","title":"Alphabet reduction for reconfiguration problems","venue":null,"work_id":"75373233-a28e-4baa-804c-5b12bdd94659","year":2024},"citing_paper":{"arxiv_id":"2507.01192","last_updated":"2025-07-01T21:15:22Z","snapshot_observed_at":"2026-08-07T23:55:35.204549Z","submitted_at":"2025-07-01T21:15:22Z","title":"PCPP-Based Reconfiguration Inapproximability: Query Complexity vs. Soundness Gap Trade-offs","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T21:08:16.565714Z"},"links":{"citing_paper":"/paper/2507.01192"},"observation_digest":"sha256:a3a157a3918e5c5b439111f7ee894283f21d962f796171f77804219274aafaa0","observation_id":"2e51013b-f00f-43b6-aa60-2994cfdef7f2","resolution":{"observed_at":"2026-08-06T21:08:17.369426Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:08:17.149739Z","title":"Gap amplification for reconfiguration problems","venue":null,"work_id":"bbac1747-1da3-4d3b-93b8-79b19a9c7a87","year":2024},"citing_paper":{"arxiv_id":"2507.01192","last_updated":"2025-07-01T21:15:22Z","snapshot_observed_at":"2026-08-07T23:55:35.204549Z","submitted_at":"2025-07-01T21:15:22Z","title":"PCPP-Based Reconfiguration Inapproximability: Query Complexity vs. Soundness Gap Trade-offs","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T21:08:16.616792Z"},"links":{"citing_paper":"/paper/2507.01192"},"observation_digest":"sha256:91c775a775dbd0b43bb0d2659fbec1e868879d071fe8213289d68f33ae5537ad","observation_id":"b23e14ed-eb5b-40ba-8da5-d59d26b8dd4f","resolution":{"observed_at":"2026-08-06T21:08:17.227236Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:08:16.995311Z","title":"Reconfiguration problems on submodular functions","venue":null,"work_id":"5e301a0a-ffdd-4a5a-88aa-bc1cad9c5c32","year":2022},"citing_paper":{"arxiv_id":"2507.01192","last_updated":"2025-07-01T21:15:22Z","snapshot_observed_at":"2026-08-07T23:55:35.204549Z","submitted_at":"2025-07-01T21:15:22Z","title":"PCPP-Based Reconfiguration Inapproximability: Query Complexity vs. Soundness Gap Trade-offs","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-06T21:08:16.689203Z"},"links":{"citing_paper":"/paper/2507.01192"},"observation_digest":"sha256:2712a9d040061b2ded57895010c87abf200aed47d1f48d11662f26039c1877f0","observation_id":"b840dabc-d4eb-476c-9ae4-754793d3c74d","resolution":{"observed_at":"2026-08-06T21:08:17.089548Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:08:16.839112Z","title":"The complexity of change","venue":null,"work_id":"de98fab2-2421-45df-ac98-8b8f724299e0","year":2013},"citing_paper":{"arxiv_id":"2507.01192","last_updated":"2025-07-01T21:15:22Z","snapshot_observed_at":"2026-08-07T23:55:35.204549Z","submitted_at":"2025-07-01T21:15:22Z","title":"PCPP-Based Reconfiguration Inapproximability: Query Complexity vs. Soundness Gap Trade-offs","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-06T21:08:16.751412Z"},"links":{"citing_paper":"/paper/2507.01192"},"observation_digest":"sha256:06a7114cc99c446a1f1a824a22808f37557b10630eba54e3772b5183423a97e1","observation_id":"af6dcf2f-bc54-4f3b-b4d7-54f3b850283f","resolution":{"observed_at":"2026-08-06T21:08:16.942029Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}}],"paper":{"arxiv_id":"2507.01192","last_updated":"2025-07-01T21:15:22Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-07T23:55:35.204549Z","submitted_at":"2025-07-01T21:15:22Z","title":"PCPP-Based Reconfiguration Inapproximability: Query Complexity vs. Soundness Gap Trade-offs"},"reference_resolution":{"displayed":22,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":0,"verified_fuzzy":19},"total_outbound_references":22},"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 22 of 22 outbound references and 1 inbound Pith citation observation for arXiv:2507.01192."}