{"as_of":"2026-08-09T03:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4571f5a100eefa30f2b553a180725c56d88d14437295d1a697b9b83d6045456b","coverage":[{"denominator":151,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T15:20:15.823697Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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/2608.05331/citation-record","integrity":"/paper/2608.05331/integrity","json":"/paper/2608.05331/citation-record.json","paper":"/paper/2608.05331"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.310401Z","title":"Physical Review A , volume=","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.310401Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:d66eb8c3044294d26be74c5cf48f7453da66523faf199e8af1a1599f4581ef65","observation_id":"59027e14-33aa-4c28-9613-8adc4eb98a2d","resolution":{"observed_at":"2026-08-08T15:20:15.310401Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.316681Z","title":"Proceedings of the Royal Society of London","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.316681Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:2b60dc6eb8f7f982afb3c721801bc0dbdfcd2c4deac7b2bffcd4d6f33aa70320","observation_id":"b8924cca-bc5f-4a79-a675-2ddcaf49dc03","resolution":{"observed_at":"2026-08-08T15:20:15.316681Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.321849Z","title":"2011 ieee 52nd annual symposium on foundations of computer science , pages=","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.321849Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:20c3cc84edf8b8686add00e3bb00294a289e88ce78ff0b959e111ab256d48291","observation_id":"1c0d0e31-9783-4e6d-82a9-08e06ce0150d","resolution":{"observed_at":"2026-08-08T15:20:15.321849Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.332158Z","title":"2002 , PAGES =","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.332158Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:fd96e9b8f53aea75f1ffd18f62de991083cb67c6dc63a6a9b99baf8f1fb343f4","observation_id":"c460f4c4-3a17-40d2-b4fd-d7e729eed53d","resolution":{"observed_at":"2026-08-08T15:20:15.332158Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.337396Z","title":"Hamiltonian Sparsification and Gap-Simulation , booktitle =","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.337396Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:00084a5893ebf437540b84bffc3be2e264cfb38d5aaa5d0a72b5f6e9f67e3555","observation_id":"03119676-a906-4df3-a812-5a7d908f5646","resolution":{"observed_at":"2026-08-08T15:20:15.337396Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.342885Z","title":"doi:10.22331/q-2019-09-30-189 , url =","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.342885Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:0cc0afb7d38eeba97fae9c987114f793d2faf5d1e996849bb9b826cbda5d5f6c","observation_id":"3809e5d1-ac6d-42c8-b56f-9c0396b971e3","resolution":{"observed_at":"2026-08-08T15:20:15.342885Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.347845Z","title":"Annales Henri Poincar","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.347845Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:90b76bda72d240188aa2eef6146e3caf8e2cb5db6c07cda0e201d6dd98f3c596","observation_id":"1fb86a2c-435c-4a30-9246-86035d7cb67c","resolution":{"observed_at":"2026-08-08T15:20:15.347845Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.353609Z","title":"48th International Colloquium on Automata, Languages, and Programming (","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.353609Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:a651e457a99950a39c4e69614823b067e4db52cd80fd8ff953777000d38b10b0","observation_id":"16019b89-4e47-4d40-af03-eff2041e8d96","resolution":{"observed_at":"2026-08-08T15:20:15.353609Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.tqc.2020.7","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:17.986448Z","title":"15th Conference on the Theory of Quantum Computation, Communication and Cryptography (","venue":null,"work_id":"9fa0f556-dd40-4f3b-a45d-f198b0f9fa48","year":2020},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.358793Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:59afd729d0d9b1675e8af37f9d569d379096cec92bfc66cc51c762141c035565","observation_id":"863223cf-6844-4708-96ad-427c6bc5c09e","resolution":{"observed_at":"2026-08-08T15:20:17.992272Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T15:20:15.364496Z","title":"Quantum Inf","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.364496Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:2fbd91955585635f3d54f647f2d8382a6f96b14c2a3cb997463dbb2ef65c0e99","observation_id":"07449d67-f38c-4d85-8fc6-fb9e7e98942a","resolution":{"observed_at":"2026-08-08T15:20:15.364496Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.369514Z","title":"Hastings , title =","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.369514Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:31d245e7bf3f01440541a3a1ac4d2be98b0382fe2002dddc48d225035581a07b","observation_id":"f1fab7b5-2833-4f0c-99e5-b3ebc09084f7","resolution":{"observed_at":"2026-08-08T15:20:15.369514Z","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":"1533.24915","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:23.290645Z","title":"2013 , url =","venue":null,"work_id":"48ece183-1310-427e-8817-d39da77da412","year":2013},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.374267Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:a82262273dc0da270a64b6aa3f8414e1d1dd06365307dd71890975888aa63fea","observation_id":"889f3d41-b5e2-4ad3-922a-6a43bd2df6f3","resolution":{"observed_at":"2026-08-08T15:20:23.298058Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T15:20:15.379259Z","title":"npj Quantum Information , volume=","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.379259Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:4cfb304b3ddb8af248c1f2cd6b7b4cfa52b1e043db1d35773a91769f0f675aca","observation_id":"c080e088-f6d5-49a4-9170-b89851343ffc","resolution":{"observed_at":"2026-08-08T15:20:15.379259Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.383905Z","title":"Quantum , volume=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.383905Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:f3c08bdf09cbd9078a3b9510fc4a09442d53c81391db911bdb28a29b6b496768","observation_id":"9715a668-158e-42f2-bc7f-131a524c176d","resolution":{"observed_at":"2026-08-08T15:20:15.383905Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2102.02991","last_updated":"2021-02-05T04:18:38Z","snapshot_observed_at":"2026-08-06T16:11:01.886810Z","submitted_at":"2021-02-05T04:18:38Z","title":"Strongly Universal Hamiltonian Simulators","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.02991","snapshot_observed_at":"2026-08-08T15:20:15.388907Z","title":"arXiv preprint arXiv:2102.02991 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.388907Z"},"links":{"cited_paper":"/paper/2102.02991","citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:e0696fcdbc7ab76ea44b54ca2091e899545d2f431529062d9064d8fbbd65f7f1","observation_id":"08424c62-f3c7-415d-a147-662ef39059a1","resolution":{"observed_at":"2026-08-08T15:20:15.388907Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.395281Z","title":"Reservoir-sampling algorithms of time complexity o (n (1+ log (","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.395281Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:8d97dc667f0186db89bed795afc4a1002eaf01d5469c091f0f145b7e01e7a31f","observation_id":"dc0ef525-7628-459e-910e-aa92ccb34a99","resolution":{"observed_at":"2026-08-08T15:20:15.395281Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.400905Z","title":"Physical Review A—Atomic, Molecular, and Optical Physics , volume=","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.400905Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:13174ad26db136b9eacfb7487a58b6dcd39988426c810ee0ca7c021f4750465c","observation_id":"55e3fb35-998e-4ded-8eb1-9bebbb2128a5","resolution":{"observed_at":"2026-08-08T15:20:15.400905Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.405615Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.405615Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:c8c2f5b4c1b100274509eb327d228b47540da697a811e250d2c810f4d5eb7519","observation_id":"c87a4151-0d9c-41c6-a3b5-4bf638300eba","resolution":{"observed_at":"2026-08-08T15:20:15.405615Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.410176Z","title":"Uniform Expansion Bounds for Cayley Graphs of SL_2 (F_p ) , urldate =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.410176Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:f0d747d812d2d090ac7afd48eb296cbe40754759e3325558dd95a0b349674c3a","observation_id":"9b2f0d4f-bb5b-4605-97a8-c9bd4dfc1a91","resolution":{"observed_at":"2026-08-08T15:20:15.410176Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.414916Z","title":"Gross , title =","venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.414916Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:d836310279e889e53dab672e9ba26ca82c0c78c9d07a5b0671ac79e50cfcab58","observation_id":"6468233c-ab69-4aa4-8e81-05b5b3affb6c","resolution":{"observed_at":"2026-08-08T15:20:15.414916Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.419901Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.419901Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:79a9c51e11457e635e9fef2b50a688b848062f3f085b8e655e0df40ae569bc0a","observation_id":"18f0a172-6c03-4e2c-9640-e81856f4c008","resolution":{"observed_at":"2026-08-08T15:20:15.419901Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.424786Z","title":"Journal of Combinatorial Theory, Series A , volume =","venue":null,"work_id":null,"year":1974},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.424786Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:bbb9c44857e39e548aba11122ca4248c963064de5044be626cd7029ffc0d2c0a","observation_id":"58e134c1-3a4b-4602-88a4-6cac1ec8a4e8","resolution":{"observed_at":"2026-08-08T15:20:15.424786Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.429736Z","title":"1979 , institution=","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.429736Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:2d5bde29c38f3288625f638013eef5fa2c527dbdff744c20dc9a96117486ca26","observation_id":"3810b8cc-6bef-4090-b181-aa4b3336f1a2","resolution":{"observed_at":"2026-08-08T15:20:15.429736Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.434643Z","title":"1981 , publisher=","venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.434643Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:d444749b157ce02433368ecfe00f8a6d834652de5ac4728dfc4c9764242484fc","observation_id":"fd6e7540-5b97-4cd4-9e74-8343dacf4160","resolution":{"observed_at":"2026-08-08T15:20:15.434643Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.439277Z","title":"2015 , volume =","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.439277Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:444cf9d49110c42148e2d0af4d45e463e0843bb6e600abc6ee3c97205f139c62","observation_id":"258b2620-bc01-4e1e-b29a-9f857171918f","resolution":{"observed_at":"2026-08-08T15:20:15.439277Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.444001Z","title":"1986 , isbn =","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.444001Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:98e5c8ae2abd73729afdc2c108e4a973ad3524564a682c8898f07ccc985b3b37","observation_id":"6c0ffb83-8156-4feb-998b-40200fcc5cfc","resolution":{"observed_at":"2026-08-08T15:20:15.444001Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.448890Z","title":"Approximating s-t minimum cuts in \\","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.448890Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:def0e5df8a39d927ba9fb5f58069b224a501ee452e558e7fcf8f3ac43fee23b0","observation_id":"bd35bee2-4ab4-4d4f-a9d2-f6e2ba5230ed","resolution":{"observed_at":"2026-08-08T15:20:15.448890Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.454179Z","title":"and Teng, Shang-Hua , title =","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.454179Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:19d0ef2867ced2d7c2465129d4e528cca2a544602a0df3eb515ef13458dc1670","observation_id":"ecaccb20-55a3-4810-afd6-e16c24266ad2","resolution":{"observed_at":"2026-08-08T15:20:15.454179Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.459285Z","title":"and Srivastava, Nikhil , title =","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.459285Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:588391af502a68315e8d33bc26aebb08d883c54744b8645d07cb86df7c447824","observation_id":"828e0ad4-0b0e-4878-8fd7-02b507130089","resolution":{"observed_at":"2026-08-08T15:20:15.459285Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.463930Z","title":"and Srivastava, Nikhil , title =","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.463930Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:6f0643ad757cba6fd6ee6a92cbb959e3a9a2b7b19d929e50fd6873f4e5da51ed","observation_id":"75405182-cb9e-495f-8c2d-6071d81f6589","resolution":{"observed_at":"2026-08-08T15:20:15.463930Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.468549Z","title":"Code sparsification and its applications , booktitle =","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.468549Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:89d913a1764e321e92e5090a3acdf9dc3518959bbbfa35089205d7d3c9442d14","observation_id":"646eabe7-8ef2-45a7-ba29-5e8f6eda90ea","resolution":{"observed_at":"2026-08-08T15:20:15.468549Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.474030Z","title":"Annals of Mathematics , volume =","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.474030Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:0877ae9f42f84020691a4d53375d75ba128c68909434540d0947b654360a2c4c","observation_id":"e39429ef-df64-4209-86f7-29a60fcf62c8","resolution":{"observed_at":"2026-08-08T15:20:15.474030Z","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":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:22.795844Z","title":"and Meka, Raghu , title =","venue":null,"work_id":"656d99f4-7c94-4dd9-9dcb-9dd19b7bb77d","year":2013},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.484873Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:990e21f7e84722d558dfed6bc4418a6a8d839f5395c8cbb32754a269642f8e80","observation_id":"47fab184-bea2-4b0a-8f2c-a108779f379b","resolution":{"observed_at":"2026-08-08T15:20:22.800246Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T15:20:15.489678Z","title":"2002 , issue_date =","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.489678Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:32b5a983a054571833b48cdeebda6ebe9513ebbf54f18d2b56655e2d5a468250","observation_id":"60a40cd0-e9a4-4340-b29f-651fdfa17d3f","resolution":{"observed_at":"2026-08-08T15:20:15.489678Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.494488Z","title":"2008 , note=","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.494488Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:29def90301e339f903b86244db3a1cb895ebef1bc03be4ada411e709f02c54bf","observation_id":"34f845b8-94d6-4ea2-9889-0bcf7fc781e9","resolution":{"observed_at":"2026-08-08T15:20:15.494488Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.499324Z","title":"2021 , month =","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.499324Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:b050b8a6958e75e6fb51eda84e9bbd19a1dd5924b771ffe5a0ab212aff0201c8","observation_id":"a2260ca1-c06b-4344-8fd7-d32e3eb86bcd","resolution":{"observed_at":"2026-08-08T15:20:15.499324Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.504129Z","title":"2025 , archivePrefix=","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.504129Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:a33aaca1c6c5ac613762631d4d4ce82dc9f64796e10ecb9797a758b2b36cabb0","observation_id":"3acb85e1-5849-4c9f-9779-706b98dccae8","resolution":{"observed_at":"2026-08-08T15:20:15.504129Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.508816Z","title":"Spielman , title =","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.508816Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:598b37386511947a4eb86261485bf051ff878711d47bdb13a9a64bdb862e51be","observation_id":"63c3c3b7-bf55-46b3-bae0-b72593d858ee","resolution":{"observed_at":"2026-08-08T15:20:15.508816Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.513808Z","title":"Nilli , abstract =","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.513808Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:661b4badd4b99b61b156bbced0a786fe398f09a54cd5acfa0cc7c36368001c04","observation_id":"40db6e01-1b17-40a0-808c-eaa70343c60f","resolution":{"observed_at":"2026-08-08T15:20:15.513808Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.518381Z","title":"and Spielman, Daniel A","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.518381Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:d061a6de8040c9ec5833b21e3f2412d433b892fbb2c946a023e7f5b6eb923b76","observation_id":"5d430356-de12-42ef-911d-114d206798b2","resolution":{"observed_at":"2026-08-08T15:20:15.518381Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.527783Z","title":"An Alon-Boppana Type Bound for Weighted Graphs and Lowerbounds for Spectral Sparsification , booktitle =","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.527783Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:aebe6c5e4c146a59a3ceb314c439277889c02605207afd77a4bac61a20a5507f","observation_id":"dab2904f-2ba4-4815-8782-dad81380a538","resolution":{"observed_at":"2026-08-08T15:20:15.527783Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.532657Z","title":"Electronic Journal of Combinatorics , volume =","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.532657Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:b9175737fd0a73265403b1707d9cfb3f26936bf30a9615dce79e0dd6ca787b55","observation_id":"b648cebd-99d7-4dc1-9f21-e6e703e95663","resolution":{"observed_at":"2026-08-08T15:20:15.532657Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.537273Z","title":"2018 , archivePrefix=","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.537273Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:16cdb92a8c6093af25448b98c741358fd0092ec289d2223d5bf60acaa8b0f983","observation_id":"a2317aea-659e-4f5b-ba35-b1d7029f4855","resolution":{"observed_at":"2026-08-08T15:20:15.537273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.541997Z","title":", booktitle=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.541997Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:7b45aa77732d332ff7bc82b0058221e324267a06d5ee9f33f8e508656f8bf2c9","observation_id":"e4f3057d-da31-4dbf-a248-c0a6de14c2ae","resolution":{"observed_at":"2026-08-08T15:20:15.541997Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.546811Z","title":"Journal für die reine und angewandte Mathematik (Crelles Journal) , doi =","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.546811Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:2fd20e6443aa4ad2fb78e70994493a082c3f956817e0bf0dffe557022c542c93","observation_id":"e6847e0f-5526-458b-a239-4cc35847217e","resolution":{"observed_at":"2026-08-08T15:20:15.546811Z","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":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:22.411107Z","title":"Improved bounds in Weaver's KSr conjecture for high rank positive semidefinite matrices , journal =","venue":null,"work_id":"162f2c2a-8b80-47db-a934-0c11209c1465","year":2023},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.551605Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:b06c374ed662f0dc96b9fe454f51b1390330e6fbd94f9d6d0baee2bb4c00abcc","observation_id":"01ea6e09-6b71-4745-9f75-ed7df5974e13","resolution":{"observed_at":"2026-08-08T15:20:22.415847Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T15:20:15.556452Z","title":", title =","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.556452Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:9b48a0debec69641d76d4e1f3850d0c429aa634e3c19a7afc612bfc52f55ce1d","observation_id":"c182cc7e-4af4-4100-9f84-76fb299ae8b4","resolution":{"observed_at":"2026-08-08T15:20:15.556452Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.561000Z","title":"2012 , URL =","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.561000Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:cd4ebbd73a78ec67e5c7daca5bfd534ca221b819540ebc549cb725c6da1522de","observation_id":"16fc0b3a-9110-4e5e-bc8d-83760f2298dd","resolution":{"observed_at":"2026-08-08T15:20:15.561000Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.565495Z","title":"2024 , archivePrefix=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.565495Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:f53de227568794000687a3031b669fd5deca970021830cb743118a314c18a124","observation_id":"e2c0b411-4765-4084-96ab-161e369bf2f0","resolution":{"observed_at":"2026-08-08T15:20:15.565495Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.570280Z","title":"2024 , url =","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.570280Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:0b267c7da9ef172ce529e8a30b2398efefbf23c6cb465a6466af132b3557b940","observation_id":"f52d6369-c6f3-44ac-89b0-d1e889c0a31e","resolution":{"observed_at":"2026-08-08T15:20:15.570280Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.574626Z","title":"Proceedings of the London Mathematical Society , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.574626Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:f7a4cc5fd92a9c8e5ab9be85a54ac44455f25b00a880da146ad8f2315fc9f5df","observation_id":"552ecbfb-2c9d-4039-ad66-9d718244d243","resolution":{"observed_at":"2026-08-08T15:20:15.574626Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.580046Z","title":"How Abelian is a Finite Group? , booktitle =","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.580046Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:7a988e41d5a9b177c7d47a57b7d84f455ac72cb4d158a0e16e5ee45cf4ef1cc2","observation_id":"c2a6d571-25b8-4d5c-912d-7eaa5e4e67eb","resolution":{"observed_at":"2026-08-08T15:20:15.580046Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.584968Z","title":"Information Theory","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.584968Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:cc9dbb3be3d777e31ec7e31ffaeef14f8fde247cb59b467561f8b9895027cbae","observation_id":"9b440a07-067c-44ad-9e2a-d9b5a84c95f9","resolution":{"observed_at":"2026-08-08T15:20:15.584968Z","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":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:22.127123Z","title":"1994 , issn =","venue":null,"work_id":"2fab2117-0e71-4d08-920f-a667fd15aa31","year":1994},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.590161Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:fe1ac51c3d9d31aefeb8033b6fbb81967a035f6f5f2975afaef13b44157b6c93","observation_id":"9b62f9ef-af28-4e5a-a9cb-1d796892ba90","resolution":{"observed_at":"2026-08-08T15:20:22.131805Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T15:20:15.594573Z","title":null,"venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.594573Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:3cc2f7c3f5f640c853311697b88df4cd133d31cab738787c235d9e2c51964859","observation_id":"a4595d00-dd7e-4833-a3f4-fe6e79e63a27","resolution":{"observed_at":"2026-08-08T15:20:15.594573Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.600399Z","title":"Lubotzky and R","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.600399Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:69cc0176f39b020cd0c10b17be8aacf99d39bc702f789f11738ea3dafd6707e1","observation_id":"ca795d72-6cdb-4f2e-80d1-187228d8b4c4","resolution":{"observed_at":"2026-08-08T15:20:15.600399Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.605043Z","title":"Combinatorics, Probability and Computing , author=","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.605043Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:5947acee94522068ef4af72769ca11ef7a765256eda9d52f1c3fc462c341d178","observation_id":"b4012912-5eb3-4a4c-88d0-883d6aa832fd","resolution":{"observed_at":"2026-08-08T15:20:15.605043Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.614456Z","title":"2025 , isbn =","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.614456Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:3587c303d9de774233e8883b4121e9393e78770549694106ac8b55ac16784e39","observation_id":"3c3efb91-46ef-41ef-a15c-dfaebad4880e","resolution":{"observed_at":"2026-08-08T15:20:15.614456Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.619197Z","title":"Sparsifying Cayley Graphs on Every Group , booktitle =","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.619197Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:6fbf390e809dca603754872a35c5bff6c59c02887c674224bf1daab55e3990ef","observation_id":"209f5cc4-2df2-4409-ae7b-d519265a575b","resolution":{"observed_at":"2026-08-08T15:20:15.619197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2207.10850","last_updated":"2022-07-22T02:55:56Z","snapshot_observed_at":"2026-07-06T13:34:02.153580Z","submitted_at":"2022-07-22T02:55:56Z","title":"A simple and sharper proof of the hypergraph Moore bound","version":1},"cited_work":{"arxiv_id":"2207.10850","doi":null,"metadata_source":"pith","pith_arxiv_id":"2207.10850","snapshot_observed_at":"2026-08-08T15:20:21.899934Z","title":"A simple and sharper proof of the hypergraph Moore bound","venue":"math.CO","work_id":"9eca4229-0d50-4200-b858-6307b4b1a845","year":2022},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.624618Z"},"links":{"cited_paper":"/paper/2207.10850","citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:9fc7a331a15ca7bbf18317bb63b9954c106302bc03063fdabc5af7c7bbc79502","observation_id":"d02bd011-6829-4ee9-9fd0-5c6c4f3412e1","resolution":{"observed_at":"2026-08-08T15:20:21.905415Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:21.879315Z","title":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing , pages=","venue":null,"work_id":"797ee0b1-3767-4649-b220-c57dfd29eaf5","year":2022},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.629922Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:9130b30724b55fe6aea1189ff8287293c2129f9254fd8431e92497ef4a03bcd8","observation_id":"295febaf-e970-49d1-9e18-cf78bdf46af5","resolution":{"observed_at":"2026-08-08T15:20:21.884074Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.00558","last_updated":"2023-11-01T14:55:04Z","snapshot_observed_at":"2026-07-06T16:41:43.009493Z","submitted_at":"2023-11-01T14:55:04Z","title":"An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.00558","snapshot_observed_at":"2026-08-08T15:20:15.634523Z","title":"arXiv preprint arXiv:2311.00558 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.634523Z"},"links":{"cited_paper":"/paper/2311.00558","citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:64342c24feacc4bd86afa476a97110f068780aa0b2f540c30b59b5e4fe861664","observation_id":"cb185413-58bf-451a-ab3e-cd55cce5cf12","resolution":{"observed_at":"2026-08-08T15:20:15.634523Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.644915Z","title":"Liu and Aaron Sidford , editor =","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.644915Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:caad1270efb7b985c232ac014f2f0162d9c92296619b3d6686090a6652406827","observation_id":"f29825a8-9b4c-4950-87b1-1694661dffd6","resolution":{"observed_at":"2026-08-08T15:20:15.644915Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.649412Z","title":"Kothari and Yang P","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.649412Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:cfb6ce0e206131ecbda8094f413422e0b0867a0a8c3d771c194dc2aa71051f34","observation_id":"212cae1e-bd95-48ea-9f7b-954c9b233056","resolution":{"observed_at":"2026-08-08T15:20:15.649412Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.654320Z","title":"Karger , editor =","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.654320Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:040b71232d51dd7f74d8ca1ce76ca4a8f73f31f511bd68227368a26628e931d7","observation_id":"b13919db-3ae6-4af1-b44e-f88d97ad9460","resolution":{"observed_at":"2026-08-08T15:20:15.654320Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.658756Z","title":"A Theory of Spectral","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.658756Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:81f46daa8609b9d5ea39488c7cee319f71ed4d9260f672e43b30da0f4daf8d94","observation_id":"3be4f932-8a02-448d-bb1d-ae1713d234da","resolution":{"observed_at":"2026-08-08T15:20:15.658756Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.663611Z","title":"2017 , url =","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.663611Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:29bbbccc66366607b2dc13433f005e9cc4ebe37a9fcdaa10c2ffa7b0f1f40e60","observation_id":"9fa82dce-eed4-458f-a587-08c50597bcc7","resolution":{"observed_at":"2026-08-08T15:20:15.663611Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.668736Z","title":"On Fully Dynamic Graph Sparsifiers , booktitle =","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.668736Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:d4a5ebde5c7061d57fad3263721829b8e4e8a1fb2635f3191f331ec33bd71142","observation_id":"d8cb13e0-5399-4b1b-8e1e-667f1ee4be5f","resolution":{"observed_at":"2026-08-08T15:20:15.668736Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.673401Z","title":"Benson and Jon M","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.673401Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:959fc2d37495c21b295c9e556248c8068bbb34bc86ae9a93593e0e01e406ec3e","observation_id":"4cd7e89c-1efe-4c0b-9282-1ccaa7042a8a","resolution":{"observed_at":"2026-08-08T15:20:15.673401Z","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":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:21.724380Z","title":"Sketching Cuts in Graphs and Hypergraphs , booktitle =","venue":null,"work_id":"76e44996-8637-450a-a705-1666c940e6d3","year":2015},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.678866Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:4cb423e29b29f92bc5ea1bd86f26ef2697883072bff09c8c65a9da1940e0d9d3","observation_id":"0f824eb6-3135-40cb-8aa0-88c054b491d7","resolution":{"observed_at":"2026-08-08T15:20:21.729166Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T15:20:15.683772Z","title":"Spectral Sparsification of Hypergraphs , booktitle =","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.683772Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:ccd9425d60a2153000b4faf954388482df13cb17f89243d76f14ffa1e66698e1","observation_id":"8ced10ec-d564-4d2d-a377-6fd73ad66436","resolution":{"observed_at":"2026-08-08T15:20:15.683772Z","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":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:21.500567Z","title":null,"venue":null,"work_id":"f2492b30-9df8-4781-92ad-1967658c4295","year":2021},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.688826Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:6820cd87dce077c2eb5b2537231c08ea37543058f228b36fddf677858cdc0e24","observation_id":"9c77dea0-81f7-412a-a93a-7fdb0c8881c0","resolution":{"observed_at":"2026-08-08T15:20:21.505015Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:21.320507Z","title":"Towards tight bounds for spectral sparsification of hypergraphs , booktitle =","venue":null,"work_id":"d161a5e3-a173-4d09-aefd-bb40c6a1e97e","year":2021},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.693640Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:787921c035f9ffb29606f4888bfacf8bec095b429f4040348a616d290d0c056c","observation_id":"c2b45d54-9a47-4c8c-b688-23ae0f016493","resolution":{"observed_at":"2026-08-08T15:20:21.326715Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:21.136794Z","title":null,"venue":null,"work_id":"f34f2393-ac82-4ba8-9ee5-23b52c582c9e","year":2024},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.698551Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:e2efe73204696698efa6cfc0621b5ef4027e6c11ba85f327305beefd5eed2096","observation_id":"73935200-5cec-45c9-abc7-b4ec4e91c691","resolution":{"observed_at":"2026-08-08T15:20:21.141592Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:18.827598Z","title":"Near-linear Size Hypergraph Cut Sparsifiers , booktitle =","venue":null,"work_id":"a5e95ad0-17f6-4745-9a9e-c3659e6d0f24","year":2020},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.703251Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:f28d3d28b16f1dba6aa16e11a158cbed38023811f658e1cdd194027ecdce3bdd","observation_id":"a606a927-2476-4605-af2d-27934c4f4581","resolution":{"observed_at":"2026-08-08T15:20:18.833170Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T15:20:15.708970Z","title":"CoRR , volume =","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.708970Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:87c835c7289f177aa0cbf1f12bf32da5700d69836b9c97be3370a9c4024f939c","observation_id":"9fb269c7-9d40-4f83-bf8d-683db7904d30","resolution":{"observed_at":"2026-08-08T15:20:15.708970Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.713854Z","title":"Analyzing graph structure via linear measurements , booktitle =","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.713854Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:94ff23cb057e710f311e8f892b79053ccefb1c1b211fe20c3df5ce7630f4fe91","observation_id":"a5ae923e-a820-488f-92e5-99c43a5dcabe","resolution":{"observed_at":"2026-08-08T15:20:15.713854Z","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":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:18.561220Z","title":"Graph sketches: sparsification, spanners, and subgraphs , booktitle =","venue":null,"work_id":"16e81619-bebd-4ad0-85bd-11eb85191a04","year":2012},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.718685Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:8b998672d6042df8b7dfd76ff48042573c30f3cd9774ee174fd42b6a8b4a6b4c","observation_id":"ed885f8b-786a-4423-a749-839b295068fb","resolution":{"observed_at":"2026-08-08T15:20:18.566734Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T15:20:15.723497Z","title":"Sparsification of Directed Graphs via Cut Balance , booktitle =","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.723497Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:3fe13b3a5f8b215d193f6338e1de4bc3ff6a02cdd86e0cd47134148d56c29ba3","observation_id":"b9d099df-690f-43f8-8a35-cd3ce55e8d7d","resolution":{"observed_at":"2026-08-08T15:20:15.723497Z","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":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:18.368064Z","title":"and Panigrahi, Debmalya , title =","venue":null,"work_id":"f00ce93f-8281-42a5-953d-fcc4dcb6e213","year":2011},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.728433Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:efef649e430b68411e1a7ae52d811ec40d66d1dd07de4f958fc83e266470ce19","observation_id":"4eb7a75c-343e-42cb-907c-2ba0bfc27c9d","resolution":{"observed_at":"2026-08-08T15:20:18.372843Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T15:20:15.733316Z","title":"Sparsification of","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.733316Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:ed41d2c7c0f50a8a836f08c908ff74495c0b0bf6c1bb5ab3293ac7c431a71b4f","observation_id":"2978a19d-94ef-4a2e-b956-97b39050b5d6","resolution":{"observed_at":"2026-08-08T15:20:15.733316Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.738123Z","title":"On Redundancy in Constraint Satisfaction Problems , booktitle =","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.738123Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:b32feb889cc64ddda603c77b15a451dd55fbed768ad852243b2c40a40d087ff0","observation_id":"8af0c880-ef17-4be5-9182-c5bb46d167b8","resolution":{"observed_at":"2026-08-08T15:20:15.738123Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.742807Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.742807Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:9a9f44947ed818dc54cd98b886c4784d4f8ed13317fe3fb569ade36f87be1405","observation_id":"45d9fb7e-9051-46a4-907a-8c9c70e6b610","resolution":{"observed_at":"2026-08-08T15:20:15.742807Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.747506Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.747506Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:d3200205b191fecbd732d06b9d9f35fb932944ed53a5e38f6469e478304f96d7","observation_id":"194825ad-a744-4775-b514-e2173edf6a68","resolution":{"observed_at":"2026-08-08T15:20:15.747506Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.752253Z","title":"Sparsification of","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.752253Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:485564f91069c3d6a126d15bdcae2273ef5ae13b067c1052a2797ff6c5e18477","observation_id":"ee017316-0edf-4232-8d58-b340cc5244fa","resolution":{"observed_at":"2026-08-08T15:20:15.752253Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.757034Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":91,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.757034Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:8e70d6bad2f40fa1cbc2cbf4bed71cfdf27035296bffc25a2694a69cca181682","observation_id":"a707dddd-053e-4b80-b125-98db912bb17f","resolution":{"observed_at":"2026-08-08T15:20:15.757034Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.761887Z","title":"Constraint Acquisition via Partial Queries , booktitle =","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.761887Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:9c576a7ea3640af417c119c7ed343c47bc73c5a62b70379750aa0897e28c5bdb","observation_id":"7bbc0382-769f-478a-ab85-d6d41808b3ff","resolution":{"observed_at":"2026-08-08T15:20:15.761887Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.766454Z","title":"Optimal Lower Bounds for Sketching Graph Cuts , booktitle =","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":93,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.766454Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:d11ff0b67d47bc1f9513152c30b54c9bba86bf9393cf1723607c3444c8f84a34","observation_id":"957984a6-162b-49c4-8f9c-a063f32f03b8","resolution":{"observed_at":"2026-08-08T15:20:15.766454Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.771140Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.771140Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:74bb5863e3fd9a644b8e52344320e58d364a534e0b391500bfbec6b6e952907f","observation_id":"52e57248-ef7c-4081-9823-b76fd15349b7","resolution":{"observed_at":"2026-08-08T15:20:15.771140Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.776200Z","title":"Satisfiability","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":95,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.776200Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:ecb99dac26e882aabe46c41488b71beeb156d8eab7343532787d7fd027db2b2b","observation_id":"9e461073-fb53-4506-bbe3-f82cb183eea5","resolution":{"observed_at":"2026-08-08T15:20:15.776200Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.781143Z","title":"Proceedings of the AAAI Conference on Artificial Intelligence , volume=","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":96,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.781143Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:63c8132a441d003e5f3cd8a9b4054df10a052869c309300df9ad37939e879184","observation_id":"052ccbd9-0286-4f59-8a42-c31fad6df9fb","resolution":{"observed_at":"2026-08-08T15:20:15.781143Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.785953Z","title":"2026 , archivePrefix=","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":97,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.785953Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:63c5407d2811d106f58197d5d30553dbd691fabbf6d6cae4aa570b7c1693fd40","observation_id":"64e92b53-7e51-4666-bd9e-4feb20f23c23","resolution":{"observed_at":"2026-08-08T15:20:15.785953Z","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":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:18.209570Z","title":null,"venue":null,"work_id":"69bc2d51-62b1-4788-bb17-6e414d11c1f1","year":2000},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":98,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.790792Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:1076a69ab7989775a6fae1f08a109154b7165dac3bcad433588169ce6264bb3b","observation_id":"490a7a86-d194-4bc9-b737-e7c0bfcfdb3e","resolution":{"observed_at":"2026-08-08T15:20:18.215433Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T15:20:15.795452Z","title":"Valued Constraint Satisfaction Problems: Hard and Easy Problems , booktitle =","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":99,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.795452Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:f7e5bd627b6bfb303189863d84a3f2167447010ee7b492f798aebe38d52688ef","observation_id":"971b8693-30a8-4b1c-9773-de87e33f5498","resolution":{"observed_at":"2026-08-08T15:20:15.795452Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.799938Z","title":"1965 , publisher=","venue":null,"work_id":null,"year":1965},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":100,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.799938Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:c68de100a662ffd67432d61d43c2c323538f51486ca8509fb37dca61a29a4bb9","observation_id":"dc50a254-2730-4dc3-a623-6c2ad9046f6f","resolution":{"observed_at":"2026-08-08T15:20:15.799938Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.804478Z","title":"Morampudi and Chris R","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":101,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.804478Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:1550f047d7c4d6c94bb02893fe71e22348881edd1214076cf958ee332e9bf2ab","observation_id":"921a2f9e-9fc7-4304-8c0e-23027380e4aa","resolution":{"observed_at":"2026-08-08T15:20:15.804478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.809114Z","title":"Communications in Mathematical Physics , volume=","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":102,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.809114Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:7eb486310637ad6e450c5f43b3e7d35bfea50c94fe0d2b1e53c6a0862a3b0042","observation_id":"5eea488b-0c3f-4246-a214-dcfad2beff05","resolution":{"observed_at":"2026-08-08T15:20:15.809114Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.814003Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":103,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.814003Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:60e0965ed9aa6cff677ae61a04ef09936da5f5c292c4f46b5512d8bee029e216","observation_id":"7029866a-66df-4bbc-b195-8191ec751c14","resolution":{"observed_at":"2026-08-08T15:20:15.814003Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.818614Z","title":"Cross disciplinary advances in quantum computing , SERIES =","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":104,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.818614Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:b0d4b70fb39b19d7bdbd6404bf41f922900ebe25af2a97030c9b1df0348eb95c","observation_id":"cb3afc88-c39e-4a5b-b0e6-cd244a03a4cf","resolution":{"observed_at":"2026-08-08T15:20:15.818614Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:20:15.823697Z","title":"Niel de Beaudrap and Sevag Gharibian , editor =","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":105,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.823697Z"},"links":{"citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:33430bba24a042d2dddd77127bcd5d66893e42f74d247957296b6e17a8774f3a","observation_id":"1fc3fb19-542a-4cee-a9f6-7413b6bee126","resolution":{"observed_at":"2026-08-08T15:20:15.823697Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-09T02:10:36.712592Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":85,"verified_exact":13,"verified_fuzzy":0},"total_outbound_references":151},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 100 of 151 outbound references and 0 inbound Pith citation observations for arXiv:2608.05331."}