{"as_of":"2026-08-12T08:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ebc520e444d5b67c85241c13911b76ba68ea3c98c69dfa2c9c5ccc43b82f6320","coverage":[{"denominator":46,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":46,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T18:44:03.528919Z","state":"measured"},{"denominator":46,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":46,"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/2507.08693/citation-record","integrity":"/paper/2507.08693/integrity","json":"/paper/2507.08693/citation-record.json","paper":"/paper/2507.08693"},"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-06T18:44:09.122227Z","title":"The dichotomy for conservative constraint satisfaction problems revisited","venue":null,"work_id":"23163031-246e-4b62-a2a6-7151ca2de864","year":2011},"citing_paper":{"arxiv_id":"2507.08693","last_updated":"2025-07-11T15:46:31Z","snapshot_observed_at":"2026-08-09T08:16:43.562080Z","submitted_at":"2025-07-11T15:46:31Z","title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:01.321451Z"},"links":{"citing_paper":"/paper/2507.08693"},"observation_digest":"sha256:a70ebe71473304aa93fa2f7cc6af0a16df99f0046dbf089072465e4da6e7b1ca","observation_id":"23ef67f9-d3c7-4e9e-bc88-18779c9fa53f","resolution":{"observed_at":"2026-08-06T18:44:09.153519Z","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-06T18:44:09.043388Z","title":"The collapse of the bounded width hierarchy","venue":null,"work_id":"ab7160ff-557b-459c-bec4-0fcfd9dd075f","year":2014},"citing_paper":{"arxiv_id":"2507.08693","last_updated":"2025-07-11T15:46:31Z","snapshot_observed_at":"2026-08-09T08:16:43.562080Z","submitted_at":"2025-07-11T15:46:31Z","title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:01.358018Z"},"links":{"citing_paper":"/paper/2507.08693"},"observation_digest":"sha256:2dfb2ea39eed6edcf8decefd9472487af69223bd44b6cc108de1b6ed6a88c7c5","observation_id":"cda46611-b3e5-4826-8cd1-59baa9ebcfb9","resolution":{"observed_at":"2026-08-06T18:44:09.091914Z","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-06T18:44:08.876370Z","title":"On the mysteries of max nae-sat","venue":null,"work_id":"16191d5b-2b61-4256-bba8-24778087655e","year":2021},"citing_paper":{"arxiv_id":"2507.08693","last_updated":"2025-07-11T15:46:31Z","snapshot_observed_at":"2026-08-09T08:16:43.562080Z","submitted_at":"2025-07-11T15:46:31Z","title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:01.400921Z"},"links":{"citing_paper":"/paper/2507.08693"},"observation_digest":"sha256:37c2325f72a202159fc49971e1c20170a7045f9d3f7eae2c0ce42e88a2ffe2ed","observation_id":"fe21ec8a-7041-4c09-9899-abe548a8ba30","resolution":{"observed_at":"2026-08-06T18:44:08.948131Z","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-06T18:44:08.758862Z","title":"Separating max 2-and, max di-cut and max cut","venue":null,"work_id":"505a368a-f7b6-429f-baae-01eb3c9347d3","year":2023},"citing_paper":{"arxiv_id":"2507.08693","last_updated":"2025-07-11T15:46:31Z","snapshot_observed_at":"2026-08-09T08:16:43.562080Z","submitted_at":"2025-07-11T15:46:31Z","title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:01.454162Z"},"links":{"citing_paper":"/paper/2507.08693"},"observation_digest":"sha256:688a2145c39a60d32464bcf114689717869f3fb404b043e6bbf51450eb7a0ccc","observation_id":"9d6ef87c-2923-4e97-9b2d-c5b5642e7846","resolution":{"observed_at":"2026-08-06T18:44:08.801915Z","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-06T18:44:08.660694Z","title":"Inapproximability of hypergraph vertex cover and applications to scheduling problems","venue":null,"work_id":"09112222-577a-446a-a2db-e69a59582e42","year":2010},"citing_paper":{"arxiv_id":"2507.08693","last_updated":"2025-07-11T15:46:31Z","snapshot_observed_at":"2026-08-09T08:16:43.562080Z","submitted_at":"2025-07-11T15:46:31Z","title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:01.500339Z"},"links":{"citing_paper":"/paper/2507.08693"},"observation_digest":"sha256:6bdac5d3602bfa46b0bb285fab3a270c00ebbfe6c90bbf0dfd24b5743ccb7399","observation_id":"b43bb0f8-208e-4a4c-aec4-abaeeb5ac9de","resolution":{"observed_at":"2026-08-06T18:44:08.696362Z","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-06T18:44:08.579604Z","title":"Constraint satisfaction problems solvable by local consistency methods","venue":null,"work_id":"4ff2468d-fee0-4981-86cf-2fd6a1afbd15","year":2014},"citing_paper":{"arxiv_id":"2507.08693","last_updated":"2025-07-11T15:46:31Z","snapshot_observed_at":"2026-08-09T08:16:43.562080Z","submitted_at":"2025-07-11T15:46:31Z","title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:01.539851Z"},"links":{"citing_paper":"/paper/2507.08693"},"observation_digest":"sha256:a9582d63617d61fba521144c6c6745f29349cd77024422f677fb1c5f63fe3b1a","observation_id":"a655dd4c-75e4-4410-95d8-ff1271915529","resolution":{"observed_at":"2026-08-06T18:44:08.617480Z","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-06T18:44:08.474731Z","title":"Galois theory for post algebras","venue":null,"work_id":"74ab77e1-8088-4be8-826c-7369ca4c4e76","year":1969},"citing_paper":{"arxiv_id":"2507.08693","last_updated":"2025-07-11T15:46:31Z","snapshot_observed_at":"2026-08-09T08:16:43.562080Z","submitted_at":"2025-07-11T15:46:31Z","title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:01.586249Z"},"links":{"citing_paper":"/paper/2507.08693"},"observation_digest":"sha256:d319b4c424921ee42e95efb22a1885ef7a2145edf47fb40dac09a9f76919da7d","observation_id":"53a3d9e4-0af3-4326-acfa-0a1994e9ba73","resolution":{"observed_at":"2026-08-06T18:44:08.534524Z","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-06T18:44:08.382809Z","title":"Polymorphisms, and How to Use Them","venue":null,"work_id":"3ff436f2-0b59-47ae-8d48-c4e298d7f405","year":2017},"citing_paper":{"arxiv_id":"2507.08693","last_updated":"2025-07-11T15:46:31Z","snapshot_observed_at":"2026-08-09T08:16:43.562080Z","submitted_at":"2025-07-11T15:46:31Z","title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:01.617256Z"},"links":{"citing_paper":"/paper/2507.08693"},"observation_digest":"sha256:0be790baab14beebe4eb6eb2f1ef65d1f103a5faec08dd72b5ca8baf8d931543","observation_id":"7e38f77b-2a24-4f4d-bd3e-1b9fe5a9f895","resolution":{"observed_at":"2026-08-06T18:44:08.429601Z","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-06T18:44:08.304089Z","title":"Polynomial interpolation and the chinese remainder theorem for algebraic systems","venue":null,"work_id":"d7d3b527-13d6-4262-9e42-9758c1fe4ac7","year":1975},"citing_paper":{"arxiv_id":"2507.08693","last_updated":"2025-07-11T15:46:31Z","snapshot_observed_at":"2026-08-09T08:16:43.562080Z","submitted_at":"2025-07-11T15:46:31Z","title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:01.653340Z"},"links":{"citing_paper":"/paper/2507.08693"},"observation_digest":"sha256:0f18dc7983d8e451c51c4181184fa2fa8c1d640effcff0925aad70ba9f6f5606","observation_id":"cab4c6d0-d82c-429c-97fe-06c3e8d57291","resolution":{"observed_at":"2026-08-06T18:44:08.334093Z","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-06T18:44:08.224287Z","title":null,"venue":null,"work_id":"c3164359-20ea-4942-9b4d-90ea079fcb35","year":2003},"citing_paper":{"arxiv_id":"2507.08693","last_updated":"2025-07-11T15:46:31Z","snapshot_observed_at":"2026-08-09T08:16:43.562080Z","submitted_at":"2025-07-11T15:46:31Z","title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:01.704422Z"},"links":{"citing_paper":"/paper/2507.08693"},"observation_digest":"sha256:0cd6ca9151565bad50cb5458d60a0cd402dec95f79b8984e99cf486903ab4ff1","observation_id":"12dcb4ed-6e89-48bb-b647-dee958cf1bce","resolution":{"observed_at":"2026-08-06T18:44:08.262583Z","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-06T18:44:08.129554Z","title":null,"venue":null,"work_id":"6939693b-7bcb-458f-9810-055d27d06d91","year":2016},"citing_paper":{"arxiv_id":"2507.08693","last_updated":"2025-07-11T15:46:31Z","snapshot_observed_at":"2026-08-09T08:16:43.562080Z","submitted_at":"2025-07-11T15:46:31Z","title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:01.740678Z"},"links":{"citing_paper":"/paper/2507.08693"},"observation_digest":"sha256:948565bb8f4f268058d880d01e1b737ef03d337db0df37ad7d293421006cff2e","observation_id":"5e79a66c-556a-4be9-8ea0-7c2a5f1e345c","resolution":{"observed_at":"2026-08-06T18:44:08.163167Z","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-06T18:44:07.990891Z","title":"A dichotomy theorem for nonuniform csps","venue":null,"work_id":"7abf5575-075e-424e-8d35-f50823a2638e","year":2017},"citing_paper":{"arxiv_id":"2507.08693","last_updated":"2025-07-11T15:46:31Z","snapshot_observed_at":"2026-08-09T08:16:43.562080Z","submitted_at":"2025-07-11T15:46:31Z","title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:01.790727Z"},"links":{"citing_paper":"/paper/2507.08693"},"observation_digest":"sha256:f03bb64b57137f1982ec0e0c91ccbe4ab60aaccd2ecbe47ed34ab7589e43e62e","observation_id":"004413d4-c7b2-494c-9a8d-e22ff3e8fb59","resolution":{"observed_at":"2026-08-06T18:44:08.034433Z","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-06T18:44:07.892529Z","title":"Cooper, David A","venue":null,"work_id":"5ca9d259-e332-4d0f-9ed2-080d6070896f","year":1994},"citing_paper":{"arxiv_id":"2507.08693","last_updated":"2025-07-11T15:46:31Z","snapshot_observed_at":"2026-08-09T08:16:43.562080Z","submitted_at":"2025-07-11T15:46:31Z","title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:01.844261Z"},"links":{"citing_paper":"/paper/2507.08693"},"observation_digest":"sha256:3bd6996cebd00584ce7fce5e2d17f6d7cc619d824ba11275a842133de53f3acc","observation_id":"40987dbb-7adf-4807-8bb7-e2abb5e403fb","resolution":{"observed_at":"2026-08-06T18:44:07.932971Z","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-06T18:44:07.777463Z","title":"A deterministic reduction for the gap minimum distance problem","venue":null,"work_id":"4854a26f-1da4-433b-9d5e-cfcc7f80beb0","year":2012},"citing_paper":{"arxiv_id":"2507.08693","last_updated":"2025-07-11T15:46:31Z","snapshot_observed_at":"2026-08-09T08:16:43.562080Z","submitted_at":"2025-07-11T15:46:31Z","title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:01.891637Z"},"links":{"citing_paper":"/paper/2507.08693"},"observation_digest":"sha256:3ca920a2801d8acf36dd5e472cfe3812d16816d5d0d2c0a42ef0467955e9544f","observation_id":"d32180c6-a0ea-4533-8210-869408def6f9","resolution":{"observed_at":"2026-08-06T18:44:07.817347Z","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-06T18:44:07.633556Z","title":"A new tractable class of constraint satisfaction problems","venue":null,"work_id":"e84e9c66-f36b-48ab-89f5-fc22316aacad","year":2005},"citing_paper":{"arxiv_id":"2507.08693","last_updated":"2025-07-11T15:46:31Z","snapshot_observed_at":"2026-08-09T08:16:43.562080Z","submitted_at":"2025-07-11T15:46:31Z","title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:01.926963Z"},"links":{"citing_paper":"/paper/2507.08693"},"observation_digest":"sha256:1887d7116b184280eae89b5965acf679232ec1c8087057706457d311d7f2ef45","observation_id":"a5793516-53e0-44ff-b221-5073193509cd","resolution":{"observed_at":"2026-08-06T18:44:07.705655Z","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-06T18:44:07.467077Z","title":"A new multilayered pcp and the hardness of hypergraph vertex cover","venue":null,"work_id":"c6810bda-d59e-4281-bb38-81dadcc6981d","year":2005},"citing_paper":{"arxiv_id":"2507.08693","last_updated":"2025-07-11T15:46:31Z","snapshot_observed_at":"2026-08-09T08:16:43.562080Z","submitted_at":"2025-07-11T15:46:31Z","title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:01.979774Z"},"links":{"citing_paper":"/paper/2507.08693"},"observation_digest":"sha256:fa3394bc49d398ebb938744864c20bc544e19aae71ac5c129e09c9caf0a2b3d3","observation_id":"45a83b0c-3f65-466d-b244-45ccb23f21b8","resolution":{"observed_at":"2026-08-06T18:44:07.533664Z","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-06T18:44:07.298057Z","title":"Robust satisfiability for csps: Hardness and algorithmic results","venue":null,"work_id":"04a381fd-982a-435c-93e0-eab31b90c92e","year":2013},"citing_paper":{"arxiv_id":"2507.08693","last_updated":"2025-07-11T15:46:31Z","snapshot_observed_at":"2026-08-09T08:16:43.562080Z","submitted_at":"2025-07-11T15:46:31Z","title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:02.019876Z"},"links":{"citing_paper":"/paper/2507.08693"},"observation_digest":"sha256:20cc1b99d1161f2c493d566c0bb57d78db041228c60f723333448b9bfd5f88ce","observation_id":"de01139b-8526-4fbe-b93e-72c48696c4f1","resolution":{"observed_at":"2026-08-06T18:44:07.368867Z","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-06T18:44:07.148450Z","title":"Robust algorithms with polynomial loss for near-unanimity csps","venue":null,"work_id":"4c8e75b0-f85b-4d39-875c-004e2ca934e1","year":2019},"citing_paper":{"arxiv_id":"2507.08693","last_updated":"2025-07-11T15:46:31Z","snapshot_observed_at":"2026-08-09T08:16:43.562080Z","submitted_at":"2025-07-11T15:46:31Z","title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:02.056692Z"},"links":{"citing_paper":"/paper/2507.08693"},"observation_digest":"sha256:db4f898ed3eeb29ec5668a40c6d3862bb60dfbc422591520cbdf05bc24639c15","observation_id":"d9b0b876-4df5-4b2f-ace2-2a6d0c8c24e2","resolution":{"observed_at":"2026-08-06T18:44:07.215370Z","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-06T18:44:06.977944Z","title":"Towards a characterization of constant-factor approximable finite-valued csps","venue":null,"work_id":"1f0a6f01-c8de-4b67-8cc1-b0ab8b6e8b40","year":2018},"citing_paper":{"arxiv_id":"2507.08693","last_updated":"2025-07-11T15:46:31Z","snapshot_observed_at":"2026-08-09T08:16:43.562080Z","submitted_at":"2025-07-11T15:46:31Z","title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:02.108603Z"},"links":{"citing_paper":"/paper/2507.08693"},"observation_digest":"sha256:c0ffeb0a22663f6906394792554df05ff8bed303e3e2593a7caa22955d88fcfb","observation_id":"d4bdec6d-1458-481c-942f-fed0e2fc980b","resolution":{"observed_at":"2026-08-06T18:44:07.077091Z","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-06T18:44:06.814681Z","title":"Micciancio, and M","venue":null,"work_id":"cf695722-cedc-4316-86b3-76025d13444a","year":2003},"citing_paper":{"arxiv_id":"2507.08693","last_updated":"2025-07-11T15:46:31Z","snapshot_observed_at":"2026-08-09T08:16:43.562080Z","submitted_at":"2025-07-11T15:46:31Z","title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:02.160859Z"},"links":{"citing_paper":"/paper/2507.08693"},"observation_digest":"sha256:67bca7de75541c22dbd717913b0cf67504cc60bcad694ab27f16556effcf56a4","observation_id":"771618d8-aeac-4ee4-b5d2-ca9da34daea4","resolution":{"observed_at":"2026-08-06T18:44:06.900807Z","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":"1503.03905","last_updated":"2015-03-12T22:27:37Z","snapshot_observed_at":"2026-07-06T04:11:52.717659Z","submitted_at":"2015-03-12T22:27:37Z","title":"Local Distribution and the Symmetry Gap: Approximability of Multiway Partitioning Problems","version":1},"cited_work":{"arxiv_id":"1503.03905","doi":null,"metadata_source":"pith","pith_arxiv_id":"1503.03905","snapshot_observed_at":"2026-08-06T18:44:03.604988Z","title":"Local Distribution and the Symmetry Gap: Approximability of Multiway Partitioning Problems","venue":"cs.DS","work_id":"0fc718d9-afb3-4d65-a6ac-58eb8d5dc42d","year":2015},"citing_paper":{"arxiv_id":"2507.08693","last_updated":"2025-07-11T15:46:31Z","snapshot_observed_at":"2026-08-09T08:16:43.562080Z","submitted_at":"2025-07-11T15:46:31Z","title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:02.210405Z"},"links":{"cited_paper":"/paper/1503.03905","citing_paper":"/paper/2507.08693"},"observation_digest":"sha256:a6eb583daf410b383dddf7ee07cd043483ffc7d52ab1f5666a79a94965c08249","observation_id":"d7ad9a62-4ef3-4be0-88f5-20a93f9ea9bd","resolution":{"observed_at":"2026-08-06T18:44:03.642992Z","resolver_source":"local_arxiv","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:44:06.653372Z","title":"The computational structure of monotone monadic snp and constraint satisfaction: A study through datalog and group theory","venue":null,"work_id":"3726ad28-dd38-4907-8ccb-c81e6feae53d","year":1998},"citing_paper":{"arxiv_id":"2507.08693","last_updated":"2025-07-11T15:46:31Z","snapshot_observed_at":"2026-08-09T08:16:43.562080Z","submitted_at":"2025-07-11T15:46:31Z","title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:02.259128Z"},"links":{"citing_paper":"/paper/2507.08693"},"observation_digest":"sha256:4465460837b0a35df5b63158065ea650585d9546bd8bd761c254076d858ffa97","observation_id":"cb7a0de1-fdab-409d-8144-222889726337","resolution":{"observed_at":"2026-08-06T18:44:06.728397Z","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-06T18:44:06.488611Z","title":"Closed systems of functions and predicates","venue":null,"work_id":"1066fd87-3daf-4e38-a7aa-7d41347bc2b7","year":1968},"citing_paper":{"arxiv_id":"2507.08693","last_updated":"2025-07-11T15:46:31Z","snapshot_observed_at":"2026-08-09T08:16:43.562080Z","submitted_at":"2025-07-11T15:46:31Z","title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:02.301331Z"},"links":{"citing_paper":"/paper/2507.08693"},"observation_digest":"sha256:b11d6cd7bf2219d2c410d0d6f7b7d49e64541bdded0f908051a772f383f45a5e","observation_id":"06e6bcc5-2d8c-4fe2-933c-49e6dfb3c9d4","resolution":{"observed_at":"2026-08-06T18:44:06.561969Z","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-06T18:44:06.291618Z","title":"A dichotomy for minimum cost graph homomorphisms","venue":null,"work_id":"03f1f8cb-d485-4e43-889a-7ccea97078ff","year":2008},"citing_paper":{"arxiv_id":"2507.08693","last_updated":"2025-07-11T15:46:31Z","snapshot_observed_at":"2026-08-09T08:16:43.562080Z","submitted_at":"2025-07-11T15:46:31Z","title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:02.351264Z"},"links":{"citing_paper":"/paper/2507.08693"},"observation_digest":"sha256:7f2226e4f87bfe2578818122605c046e8a0d3788eedae194e73369fa0c3d4472","observation_id":"9fd22d7b-bfa4-4179-91c6-401c80340da4","resolution":{"observed_at":"2026-08-06T18:44:06.375114Z","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-06T18:44:06.106341Z","title":"A bounded approximation for the minimum cost 2-sat problem","venue":null,"work_id":"7fe9c1ac-5412-4fe9-b986-5952c722ddc5","year":1992},"citing_paper":{"arxiv_id":"2507.08693","last_updated":"2025-07-11T15:46:31Z","snapshot_observed_at":"2026-08-09T08:16:43.562080Z","submitted_at":"2025-07-11T15:46:31Z","title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:02.411727Z"},"links":{"citing_paper":"/paper/2507.08693"},"observation_digest":"sha256:9791c07cf5bb9b628b5971547d48f035d448360cba6d26abf85ef78cf32bf070","observation_id":"b802b0ad-8c97-4d4f-a466-32403097dd0e","resolution":{"observed_at":"2026-08-06T18:44:06.177912Z","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-06T18:44:05.940507Z","title":"Approximation of minimum cost homomorphisms","venue":null,"work_id":"a2d7a68e-4ba1-45db-817f-b0d703d0735f","year":2012},"citing_paper":{"arxiv_id":"2507.08693","last_updated":"2025-07-11T15:46:31Z","snapshot_observed_at":"2026-08-09T08:16:43.562080Z","submitted_at":"2025-07-11T15:46:31Z","title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:02.464467Z"},"links":{"citing_paper":"/paper/2507.08693"},"observation_digest":"sha256:094ebd8a5807286feb42f22114f1280fd962bb67fdcd312a4660c97a49b1dfd0","observation_id":"4dd1e180-2db5-4ac8-9724-f5d3aa6db842","resolution":{"observed_at":"2026-08-06T18:44:06.011783Z","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-06T18:44:05.762820Z","title":"The dichotomy of minimum cost homomorphism problems for digraphs","venue":null,"work_id":"8effd6f2-076d-4f3b-8ab2-97edfc65086f","year":2012},"citing_paper":{"arxiv_id":"2507.08693","last_updated":"2025-07-11T15:46:31Z","snapshot_observed_at":"2026-08-09T08:16:43.562080Z","submitted_at":"2025-07-11T15:46:31Z","title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:02.517673Z"},"links":{"citing_paper":"/paper/2507.08693"},"observation_digest":"sha256:183b9deeb0230ba06c6d6a24be62cd0184885c4a1427f66e57c963bf0e0ef3da","observation_id":"5d59b429-da0e-45e0-9ae6-d7444455f92b","resolution":{"observed_at":"2026-08-06T18:44:05.869330Z","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-06T18:44:05.614287Z","title":"Constraints, consistency and closure","venue":null,"work_id":"08248dcd-7bd2-4db6-9bd7-32802a188bef","year":1998},"citing_paper":{"arxiv_id":"2507.08693","last_updated":"2025-07-11T15:46:31Z","snapshot_observed_at":"2026-08-09T08:16:43.562080Z","submitted_at":"2025-07-11T15:46:31Z","title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:02.566953Z"},"links":{"citing_paper":"/paper/2507.08693"},"observation_digest":"sha256:67e825ad57cf31b60d838b27572df96892933e9e37e28f7a4897ae62db77e600","observation_id":"a99b3423-dd48-44d2-84f6-492c667d95d1","resolution":{"observed_at":"2026-08-06T18:44:05.670846Z","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-06T18:44:05.509130Z","title":"Introduction to the maximum solution problem","venue":null,"work_id":"96719405-9e24-4565-8219-7f2dc39e1d07","year":2008},"citing_paper":{"arxiv_id":"2507.08693","last_updated":"2025-07-11T15:46:31Z","snapshot_observed_at":"2026-08-09T08:16:43.562080Z","submitted_at":"2025-07-11T15:46:31Z","title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:02.616454Z"},"links":{"citing_paper":"/paper/2507.08693"},"observation_digest":"sha256:bd775aa4f5ee9a57bd02307675540beb7d4d5a2ace70b611576436e675bf2e73","observation_id":"5b40fb32-de67-4cd2-a356-10d00e84405c","resolution":{"observed_at":"2026-08-06T18:44:05.547448Z","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-06T18:44:05.322390Z","title":"On the power of unique 2-prover 1-round games","venue":null,"work_id":"32abcc66-53e1-4afe-a1e8-cf6f8924f78c","year":2002},"citing_paper":{"arxiv_id":"2507.08693","last_updated":"2025-07-11T15:46:31Z","snapshot_observed_at":"2026-08-09T08:16:43.562080Z","submitted_at":"2025-07-11T15:46:31Z","title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:02.679928Z"},"links":{"citing_paper":"/paper/2507.08693"},"observation_digest":"sha256:202d7ad0692bfd17bcf71e1ce16ffc86141b8c86c821b7f859cc3446d4ccfd83","observation_id":"efbb1dc9-37dc-4534-8fff-4d5810d70c8e","resolution":{"observed_at":"2026-08-06T18:44:05.398490Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:44:02.738309Z","title":"Optimal inapproximability results for max-cut and other 2-variable csps? SIAM Journal on Computing , 37(1):319--357, 2007","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2507.08693","last_updated":"2025-07-11T15:46:31Z","snapshot_observed_at":"2026-08-09T08:16:43.562080Z","submitted_at":"2025-07-11T15:46:31Z","title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:02.738309Z"},"links":{"citing_paper":"/paper/2507.08693"},"observation_digest":"sha256:92925e2e9e77c7a027c42182acc7e90dc04295fdfb884773d5800e572712f615","observation_id":"a93a8a80-d64a-4892-86b5-56adff8865a5","resolution":{"observed_at":"2026-08-06T18:44:02.738309Z","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-06T18:44:05.132308Z","title":"On lp-based approximability for strict csps","venue":null,"work_id":"fa708829-35db-415f-a365-a0be17e0c008","year":2011},"citing_paper":{"arxiv_id":"2507.08693","last_updated":"2025-07-11T15:46:31Z","snapshot_observed_at":"2026-08-09T08:16:43.562080Z","submitted_at":"2025-07-11T15:46:31Z","title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:02.808519Z"},"links":{"citing_paper":"/paper/2507.08693"},"observation_digest":"sha256:d8aae351c70935633b5092301175f6c339697d2726d27bd716894193a58f1311","observation_id":"b120313d-7288-4c6f-8a5a-baaa828db9b3","resolution":{"observed_at":"2026-08-06T18:44:05.158090Z","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-06T18:44:04.988583Z","title":"Vertex cover might be hard to approximate to within 2-","venue":null,"work_id":"e9b301f6-eff6-420d-baef-55c7584a44fd","year":2008},"citing_paper":{"arxiv_id":"2507.08693","last_updated":"2025-07-11T15:46:31Z","snapshot_observed_at":"2026-08-09T08:16:43.562080Z","submitted_at":"2025-07-11T15:46:31Z","title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:02.862588Z"},"links":{"citing_paper":"/paper/2507.08693"},"observation_digest":"sha256:9442ad7a6f6df2c5df8c846cc4840f8cf0a5ae5e60fb563405958d8b85e357e5","observation_id":"17d90472-414d-4d11-888d-d69f4637f3b5","resolution":{"observed_at":"2026-08-06T18:44:05.046289Z","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-06T18:44:04.881665Z","title":"The approximability of constraint satisfaction problems","venue":null,"work_id":"98f435f3-3f5c-40f5-b800-5f88e484e93b","year":1920},"citing_paper":{"arxiv_id":"2507.08693","last_updated":"2025-07-11T15:46:31Z","snapshot_observed_at":"2026-08-09T08:16:43.562080Z","submitted_at":"2025-07-11T15:46:31Z","title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:02.921332Z"},"links":{"citing_paper":"/paper/2507.08693"},"observation_digest":"sha256:6e65f435325b42ae2303111d4d2b26bacb61616df19e746c3263e3739f5b04b6","observation_id":"6e7ba7b6-9477-49a4-94ac-8585d80ded6d","resolution":{"observed_at":"2026-08-06T18:44:04.921802Z","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-06T18:44:04.777079Z","title":"The Complexity of Valued CSPs","venue":null,"work_id":"a5a77225-8495-4eaa-ac32-6d6abc18f6a7","year":2017},"citing_paper":{"arxiv_id":"2507.08693","last_updated":"2025-07-11T15:46:31Z","snapshot_observed_at":"2026-08-09T08:16:43.562080Z","submitted_at":"2025-07-11T15:46:31Z","title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:02.993266Z"},"links":{"citing_paper":"/paper/2507.08693"},"observation_digest":"sha256:b0424298c47aa381a4979190b6095b8d8d9e9bd9edf31291df51100a0b02108e","observation_id":"aa9aef60-5833-4488-a4d0-1b6cb7b3d646","resolution":{"observed_at":"2026-08-06T18:44:04.828700Z","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-06T18:44:04.695601Z","title":"Marczewski","venue":null,"work_id":"3691e2de-6da6-4e2a-ad68-279a24ddd98d","year":1964},"citing_paper":{"arxiv_id":"2507.08693","last_updated":"2025-07-11T15:46:31Z","snapshot_observed_at":"2026-08-09T08:16:43.562080Z","submitted_at":"2025-07-11T15:46:31Z","title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:03.031113Z"},"links":{"citing_paper":"/paper/2507.08693"},"observation_digest":"sha256:ee2e6c7b162b60ce811d35d5182b5baa1df30f97782d6153cace8ff333a13938","observation_id":"46f270cf-b4f3-4cec-9397-cfa4513b10ba","resolution":{"observed_at":"2026-08-06T18:44:04.726902Z","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-06T18:44:04.577940Z","title":"Marchenkov","venue":null,"work_id":"aa1e5c2d-349e-4e47-938e-69964c4760e1","year":1982},"citing_paper":{"arxiv_id":"2507.08693","last_updated":"2025-07-11T15:46:31Z","snapshot_observed_at":"2026-08-09T08:16:43.562080Z","submitted_at":"2025-07-11T15:46:31Z","title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:03.086755Z"},"links":{"citing_paper":"/paper/2507.08693"},"observation_digest":"sha256:ce2aba5a97868015d27fb241ebf3ff5c1867fb69b2a6033019685e5b67cf199c","observation_id":"0f237734-93bb-4d81-b3d9-44a284975b20","resolution":{"observed_at":"2026-08-06T18:44:04.632879Z","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-06T18:44:04.501409Z","title":null,"venue":null,"work_id":"8599cf34-2cab-4219-a669-7c690d161343","year":1941},"citing_paper":{"arxiv_id":"2507.08693","last_updated":"2025-07-11T15:46:31Z","snapshot_observed_at":"2026-08-09T08:16:43.562080Z","submitted_at":"2025-07-11T15:46:31Z","title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:03.133717Z"},"links":{"citing_paper":"/paper/2507.08693"},"observation_digest":"sha256:4a544b76a381c905f42b56acd5076f89e25cbafe606124f19016293f38cf0240","observation_id":"e60c6294-0754-4876-b3ca-0d629acaf856","resolution":{"observed_at":"2026-08-06T18:44:04.525402Z","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-06T18:44:04.415104Z","title":"Optimal algorithms and inapproximability results for every csp? In Proceedings of the fortieth annual ACM symposium on Theory of computing , pages 245--254, 2008","venue":null,"work_id":"37217e32-dd11-4532-a1cd-271779da07a1","year":2008},"citing_paper":{"arxiv_id":"2507.08693","last_updated":"2025-07-11T15:46:31Z","snapshot_observed_at":"2026-08-09T08:16:43.562080Z","submitted_at":"2025-07-11T15:46:31Z","title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:03.176552Z"},"links":{"citing_paper":"/paper/2507.08693"},"observation_digest":"sha256:d102873389443632f4392264ab02ed3fd4d837de3c9190fe229dca03acf3b048","observation_id":"eb0fc7cc-e6d1-4903-8c71-6dcbc618a946","resolution":{"observed_at":"2026-08-06T18:44:04.454177Z","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-06T18:44:04.323487Z","title":"Toward a dichotomy for approximation of h-coloring","venue":null,"work_id":"b27fd4ec-3506-4fc7-ad3f-af7dc20ff381","year":2019},"citing_paper":{"arxiv_id":"2507.08693","last_updated":"2025-07-11T15:46:31Z","snapshot_observed_at":"2026-08-09T08:16:43.562080Z","submitted_at":"2025-07-11T15:46:31Z","title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:03.232372Z"},"links":{"citing_paper":"/paper/2507.08693"},"observation_digest":"sha256:3ba4689c1f3f67236004d0b0d76d5721d53eb6f1532ef1d97eb051f13d580448","observation_id":"14fbc906-8c69-409d-9df8-2dd4ce169d16","resolution":{"observed_at":"2026-08-06T18:44:04.365443Z","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-06T18:44:04.220362Z","title":"A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems","venue":null,"work_id":"77537067-6368-427e-9dd5-54b53ea5e37d","year":1990},"citing_paper":{"arxiv_id":"2507.08693","last_updated":"2025-07-11T15:46:31Z","snapshot_observed_at":"2026-08-09T08:16:43.562080Z","submitted_at":"2025-07-11T15:46:31Z","title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:03.287887Z"},"links":{"citing_paper":"/paper/2507.08693"},"observation_digest":"sha256:aaccbc00d485e1cbd934c4cb3eecf0f6f22fff77287edd4f98ed79a25cc59fb9","observation_id":"1955b0f2-7e05-4254-9e06-085ac323a1eb","resolution":{"observed_at":"2026-08-06T18:44:04.276156Z","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-06T18:44:04.131451Z","title":"The complexity of satisfiability problems","venue":null,"work_id":"2ad20ee9-05e3-40c1-9fb1-6e34ba842720","year":1978},"citing_paper":{"arxiv_id":"2507.08693","last_updated":"2025-07-11T15:46:31Z","snapshot_observed_at":"2026-08-09T08:16:43.562080Z","submitted_at":"2025-07-11T15:46:31Z","title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:03.347958Z"},"links":{"citing_paper":"/paper/2507.08693"},"observation_digest":"sha256:0fb1fd6e7f2bbeb9b0324c3c5ef456654c89d6f69211cb3e9591edc366bda76c","observation_id":"b0f85dda-63e4-4175-bb07-17cbd336a9f5","resolution":{"observed_at":"2026-08-06T18:44:04.172316Z","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-06T18:44:04.046714Z","title":"Clones in universal algebra","venue":null,"work_id":"df56b669-58b8-4105-9a68-0324c58af255","year":1986},"citing_paper":{"arxiv_id":"2507.08693","last_updated":"2025-07-11T15:46:31Z","snapshot_observed_at":"2026-08-09T08:16:43.562080Z","submitted_at":"2025-07-11T15:46:31Z","title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:03.387113Z"},"links":{"citing_paper":"/paper/2507.08693"},"observation_digest":"sha256:5b238b5cdcc186e2d24bfd8e41e547b564bad48a2240f44fe17df943bb98e870","observation_id":"ba7a4def-6409-4ffd-933f-f24a4ad44ad0","resolution":{"observed_at":"2026-08-06T18:44:04.085686Z","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-06T18:44:03.942962Z","title":"A dichotomy theorem for the general minimum cost homomorphism problem","venue":null,"work_id":"8d01eab4-57f9-4be2-a612-c6f19afca671","year":2010},"citing_paper":{"arxiv_id":"2507.08693","last_updated":"2025-07-11T15:46:31Z","snapshot_observed_at":"2026-08-09T08:16:43.562080Z","submitted_at":"2025-07-11T15:46:31Z","title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:03.437606Z"},"links":{"citing_paper":"/paper/2507.08693"},"observation_digest":"sha256:673752d5bb638d95cb51f61676e76bb3a053905e0ea92868e36511ac6a376765","observation_id":"df3d2c3f-e599-44ee-9474-7e8979a746df","resolution":{"observed_at":"2026-08-06T18:44:03.995903Z","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-06T18:44:03.823230Z","title":"The complexity of finite-valued csps","venue":null,"work_id":"eda9b8aa-f58e-45d1-ab23-b45f91dacd1c","year":2016},"citing_paper":{"arxiv_id":"2507.08693","last_updated":"2025-07-11T15:46:31Z","snapshot_observed_at":"2026-08-09T08:16:43.562080Z","submitted_at":"2025-07-11T15:46:31Z","title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:03.474268Z"},"links":{"citing_paper":"/paper/2507.08693"},"observation_digest":"sha256:87ee896c55550573f64213dc89ef3015640684193fccc08a1b125d39c9c388a4","observation_id":"6a288b23-6ee7-4f68-a951-c97daaf44e4c","resolution":{"observed_at":"2026-08-06T18:44:03.862125Z","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-06T18:44:03.716910Z","title":"A proof of the csp dichotomy conjecture","venue":null,"work_id":"1e3c417b-5115-4390-b3c9-22fdb71e8c8e","year":2020},"citing_paper":{"arxiv_id":"2507.08693","last_updated":"2025-07-11T15:46:31Z","snapshot_observed_at":"2026-08-09T08:16:43.562080Z","submitted_at":"2025-07-11T15:46:31Z","title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:03.528919Z"},"links":{"citing_paper":"/paper/2507.08693"},"observation_digest":"sha256:8913b3901c72cee13c22be6847ec17761eb1ff9d0e146dab5da89d31539e3329","observation_id":"6db23223-7fa4-4a37-b76c-531031f1beea","resolution":{"observed_at":"2026-08-06T18:44:03.768941Z","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.08693","last_updated":"2025-07-11T15:46:31Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-09T08:16:43.562080Z","submitted_at":"2025-07-11T15:46:31Z","title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems"},"reference_resolution":{"displayed":46,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":1,"verified_fuzzy":41},"total_outbound_references":46},"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 46 of 46 outbound references and 0 inbound Pith citation observations for arXiv:2507.08693."}