{"as_of":"2026-08-10T14:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9e7e94cdce01a730a4fbb9df25a5628feb741b79811912aa43909336eeb2c555","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-10T06:31:04.303077+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-09T23:10:35.566750Z","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:25df4fe5b825cd6791d815ed8cf1091bbf93c2ff663ae89aa10e345a23032def","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-09T23:10:35.566750Z","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:2cdb17c028dd816b30d225cc048b911b9ae019240c1c97e9cf81cac81edcba8e","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-09T23:10:35.566750Z","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:c0d7e72f42de028f039adee8b48fdbd83e89d3d552aa77ce081a85443d13180d","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-09T23:10:35.566750Z","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:1084ad6a4dc8305acecf68600f069aee834e991f089e107cf5205e56003ad274","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-09T23:10:35.566750Z","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:169323abadf93cbdd4eee65c5e4100b2b41ebc616afc2557727b660fce83f592","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-09T23:10:35.566750Z","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:843c956b0676ac0ac65d58ce3847011c212e671315b9268b238e9d7142bbc7e4","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-09T23:10:35.566750Z","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:cef59dbd7dd51af825c4ba7b908fe0d4dfdc10d6eb014cfeff4f4bd782baa014","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-09T23:10:35.566750Z","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:a53a829d97b8d6f3e7bbea1802d2e37ae75dff0ebc69359792c5feb72000292e","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":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"15th Conference on the Theory of Quantum Computation, Communication and Cryptography (","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","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-09T23:10:35.566750Z","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:fcf2445e2785574a18b0ff6af2f5def89bee6d7d1622bde2f4627d822129e494","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:10:35.566750Z","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:3e06316e2c80351ccb86ec45fba2941109e8046bf37b018e4e18142c1e825102","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-09T23:10:35.566750Z","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:74452e4778c403394896a4c40850f9f7a8801184ad268bc03963ec87299a6911","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-09T23:10:35.566750Z","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:a8e79591d9f98c628441c4c774b3c4c1fb2b1eac5dedcee561cd61da85511a06","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:10:35.566750Z","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:4948da607cd4f2426561a06f8d44dd24dccfec7dfaec23b9b541e7de47ec2d50","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-09T23:10:35.566750Z","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:a09f2cf57cd31651b431d41ec93f111e8ef03bb99d9fa8a4959535b95c310499","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-09T23:10:35.566750Z","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:8fa6382b4dabae91b2d84897da44b4069213c34d29b7fb07e317214b04acf3d4","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-09T23:10:35.566750Z","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:5818483d10bf5b6d495ea4daf1278b46ac76289f0f316ef230267d6b7d713d67","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-09T23:10:35.566750Z","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:d6922a9dcaff977a0f3c2f284d4133ee198e28c89fccb32ca355d27faa6438bd","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-09T23:10:35.566750Z","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:5c34552d964383ada4f4ca9816c3b6183e999ff540f0bcacdd1ce0c221264dbe","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-09T23:10:35.566750Z","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:7d38b97844386383b8aedaeef1de14904efb8b62670191efdef9b4e6b2f45f08","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-09T23:10:35.566750Z","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:534a1755b27280b3063f8bfc8f53a37eea9c9167a08df783f19b82ca66e71910","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-09T23:10:35.566750Z","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:be1169c7553ef43e709307eb558b7a7d839744d56e61abf99272e8ec4baa4f8d","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-09T23:10:35.566750Z","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:9712ebee3b399cba1e35fcba8aad211e40a588872fc354f810c404fb9097c1a1","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-09T23:10:35.566750Z","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:4bc1d606f24eaca07953760ca9167c28120f48a0505af47fafdcfb80fea015d2","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-09T23:10:35.566750Z","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:0e003a19af71e0580abbbe71e386aa064e7f044e8b321382a79031a85a333fea","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-09T23:10:35.566750Z","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:f8fe7f48f4c03a97bef785792dcd3e60dd6b8346a93e9f374307cb6d7f7ac937","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-09T23:10:35.566750Z","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:eb7fddf7e3a302365a15f7d5449555a591b42837fbb5713b54d9cd0771f5e72c","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-09T23:10:35.566750Z","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:7d052d5d23d177fdef61e80b0887a21e5da4188d393a26913a4de22a96dddd20","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-09T23:10:35.566750Z","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:d98c3d8b3e65476bbc434a5cfdb49e86797799d16815565bd3fcfbe3b76873a7","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-09T23:10:35.566750Z","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:0014ce0d033f547f8cf6f2aab47010acd05d107ee32c4f0250ec6ae1c00af160","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-09T23:10:35.566750Z","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:db0e22dd3db01e992f9f44c57d9560a24c038d1e0699b09cba67e28619986114","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-09T23:10:35.566750Z","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:105688d24cbf989489eddb2da26e4755a75a7f71754dd93c4bf0b17b33e5386e","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-09T23:10:35.566750Z","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:eb250a92abe6436593d2981625760ed845af9c3696a7ea3ef8581eb8f917fae3","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-09T23:10:35.566750Z","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:d6fd7944302f9e9c86b9f0cdaaf47df64a495e94c47554a20c6c18bbe5df3696","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:10:35.566750Z","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:e6524cd49c120605c0612c070843c497c3a9f78312db927675909f5385515739","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-09T23:10:35.566750Z","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:2d093b7f319b7c503c6c1d0d4a14c870c1c58d383645bd4080f0773e76e21ab0","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-09T23:10:35.566750Z","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:531e841a98ffb1277ac7ca14be4c73c89112a17bd64d9469d3c7df6960224217","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-09T23:10:35.566750Z","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:773c9ba398f5cbde2e62e819b3c9a209da29c91b8d8e906a01fd5920a3bfd05e","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-09T23:10:35.566750Z","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:a01914af1fa9f868dd0f2e56acba67b15fb146c307297c847fd2bf1c220f6d70","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-09T23:10:35.566750Z","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:cde9baa9aca7a533f13d3b4a7eeb554c594aef207a74d2e2ec5235550404511c","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-09T23:10:35.566750Z","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:717a00694c82b3a894739726b90976dfbc58b851eda6c69c3514383f0e5414ea","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-09T23:10:35.566750Z","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:a8d8f610a5d14d46253dd99d54646baaf5faaf82c4740f78b1a8f9146429eb51","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-09T23:10:35.566750Z","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:9159d3d98ae2b675dc2eb73bce33710b1556f4550e20684daf0aaf64b6d14c31","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-09T23:10:35.566750Z","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:b0315517f9b73d53dff4d888d2b8e56041f16f542d69d9838dbd0c5169c4ece4","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-09T23:10:35.566750Z","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:90ec60349264436b62b571fb4b7159d27f8e49de5d9cbf0a0320379fb3e5426e","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-09T23:10:35.566750Z","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:06f020f3d508771717a23ca26d34558481de83f430579b509f02a0204db9254e","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-09T23:10:35.566750Z","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:f3fed51c96188237316abaca6b0de2b6ba15a26cea5a3ece97282dbfa74ef3ae","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:10:35.566750Z","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:5df13d1d3cf44a06f4b565017b057b534e4acc76196df64461a1aa2c6bdb0842","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-09T23:10:35.566750Z","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:cfade0bb2a8dad279b94cbedc797cd69c2fa5e882e43e41ca01a2b94a58bb5a7","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-09T23:10:35.566750Z","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:ecf8a00a00163465a36aa6fed82ab9013b6817bfd1e3cf4b03395958e2d5e3a2","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-09T23:10:35.566750Z","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:1675a094e9c11293b6799efca25ea98a32b919b5be5b23255743290550d9c2d2","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-09T23:10:35.566750Z","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:bf1629b8e3397f165b9ece52c29635f8f092785c7c774db31f431901cb6d0354","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-09T23:10:35.566750Z","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:23599417a5edefdfaf8730d22dd366ee2e2d227e861973f8e0b280194e0c3996","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-09T23:10:35.566750Z","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:912cfc1bf3cb67996b29e27bee1d64d78f83eb57219a11e1582c1951092ab40b","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-09T23:10:35.566750Z","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:8670c51c73c744bfaeccacb400a45d0cbc9548c4043c3068f9276e39cea26338","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:10:35.566750Z","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:d485836cfad9fd6b4f3b81f9431f6bcd64058eb5080f032031daaf2dd988f507","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-09T23:10:35.566750Z","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:99d84c51c57f1d6d48af6c5c525be95e2411bee39b01101c882508b182a85158","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-09T23:10:35.566750Z","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:6288c5e79fe9ff2033f2dbad5536c63d98152fbf2afea45a8a107cb9dfca0209","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-09T23:10:35.566750Z","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:ff2a3a31e93a6318551b172598caa8fac3b76d889035ce71fcc1b396635a05ab","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-09T23:10:35.566750Z","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:c7030ab2ba7d8d59c39734bf98497ee6674d38b4ebc140bdfc4b807446e95a0f","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-08-10T03:11:35.258769Z","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-09T23:10:35.566750Z","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:783ca063941e34b5111776f0c9141f8696ee90cb2e3dbb7a9feb02f5083f89f5","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:10:35.566750Z","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:c4bdddc231fc6fb753848a6367dbe670b3a6ca3f7eb0e5e3940ef91ce46f29f6","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:10:35.566750Z","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:93f722789417b111a3cd65f9abb77f20a631552d635a7b66c8065f472a5af9f4","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-09T23:10:35.566750Z","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:7d6d72c642bb9f82d5a5206ba987723a47e8516325851c1e62d6e213d5f99b90","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-09T23:10:35.566750Z","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:82e6942fb790203630345fdf077a31cb47f076e239dc9807e60ec11c3011ac27","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-09T23:10:35.566750Z","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:3458310da8da641cdb708550e0820334fedb976dc5add72a780933970b60cba2","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-09T23:10:35.566750Z","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:255a7a165cb2f20994eb9e1d9b56b49b4056a96bc8061db5fd4c84f3afae894c","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-09T23:10:35.566750Z","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:c76f8fae82023f3b3ea3392af866389b5983064553956957c5bb7d14dc60c03e","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-09T23:10:35.566750Z","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:4011417711ab9839bb6e8ca9862acc4b05703ffb2b6de8ff4953103eb35b0a38","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-09T23:10:35.566750Z","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:7a705fe875f202d2c14e0ff81dd812433323257fbe221c0b2c72975d7f9ce2ce","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-09T23:10:35.566750Z","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:c6fbddf3f349647057d8a637c85ed5d8a6c83e50f1eca5f95e4430ee6f76195a","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:10:35.566750Z","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:375bad5c34458062c088124df88e31945372eaf4ff22145dd30e8963ed802389","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-09T23:10:35.566750Z","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:a13b38d626325dc385f8bf5443be6672f6a96e564fa7d7c6c3e19b10532f68de","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:10:35.566750Z","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:a1b7edfb2c3051bab9f273b6880c2aa27447d5378beeaad596674ef2f7320b42","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:10:35.566750Z","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:7f4a101ff6c050397a146009be65f2086ec34985673676142fcd2f00e2796ee4","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:10:35.566750Z","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:35c25dfd25f390f2101f9f837ed29cecb44a87d11b47a5e7e59acf7db8369cb7","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:10:35.566750Z","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:f684448c866850ff5bcd81de08e7850de3d02d041ecdf91042876b342a2e6b65","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-09T23:10:35.566750Z","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:1b2e08f73885801592688f5f9b6617a9f97db255ddac9112f076a1207b5f623c","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-09T23:10:35.566750Z","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:a7f5a3de7833bfa7281b6ac029d05aaa6c92ce6c4ea4efefd6a94f20a558774d","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:10:35.566750Z","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:9dfa2db182fe38c20220315d64cd959b17d843c00aa1151c326077a3271d40fe","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-09T23:10:35.566750Z","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:1d1572b8cc2923e8451b9268d27f886b553cf448381348df1503f502b93ac041","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:10:35.566750Z","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:8f08c3afe9444ad25e66d5324278bdd7ec6e2c41a09c45cb5945f28e7da764cd","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-09T23:10:35.566750Z","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:b430c03ffe39babf8be9275b39ebc0737b27082f46c78538f976ef1f0e6f88ec","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-09T23:10:35.566750Z","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:b23bb644463018338f0761b1d3190417c898ed2dbe5776bcdab744ee3b6bded1","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-09T23:10:35.566750Z","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:eaf24cae1d813ef54f9c089efb569f7055a115941a1fbfe56157403064364ae0","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-09T23:10:35.566750Z","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:7324807d4e2e80bf39ec983781538ff0b3c0ca44bcfeafc933c6d658432b0494","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-09T23:10:35.566750Z","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:ed3a1030a440650551239bb496323e3c5cb979784b677d06a06528c41578e6a8","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-09T23:10:35.566750Z","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:f5e24329e111d2e5d7fbab798bde65f782fc46a4bc3a19e681fe9686ae83fadf","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-09T23:10:35.566750Z","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:5e97a9d3c91532804c1869701687c6a8b20a7af93c472a90882ca28ec0ba4eba","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-09T23:10:35.566750Z","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:f94c844167b2c1dd239b13396d55006cdee8b718740aaef518d13a96b8077964","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-09T23:10:35.566750Z","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:fe15ebcf421e17c41c22bb73040eff39149b8c51441aca09d3e358ca164db00b","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-09T23:10:35.566750Z","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:c1e4790e3f13f4752c78929da0f8f2438b99938244a07c61b1217f970a34dd46","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-09T23:10:35.566750Z","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:bf55f631a6599d0fd05e7169646c854a54120013009eb888a6efea5a1c4a3c15","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-09T23:10:35.566750Z","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:9ca68c80e0e554f468cda109c1be94e5a48472f28d707a25359f7f6f8d93f86d","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:10:35.566750Z","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:39d64b04a4150e1a7f323617f4faded486d8c2a181c9c17bfa6df9224f823dc2","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-09T23:10:35.566750Z","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:2796f43078c3195c353076d68ede332bfdcd00608d21d0b21003767128fa0e6a","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-09T23:10:35.566750Z","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:2257dad0cef8e764bdae2be1892a52bbece4ddcc383fa2bdd36a912a3b75daa9","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-09T23:10:35.566750Z","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:a2152a096e96847e1d62b2ce62349dab84e971e726544262bc36daca7e001658","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-09T23:10:35.566750Z","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:4e9106a0a3b17e636c60c6aa5d23dbd9307016899fcf4211b95049f644b41979","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-09T23:10:35.566750Z","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:25e21f077f70464bb94081a28438b47a2c48683ffba78b0d4423a2a8e02108d9","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-09T23:10:35.566750Z","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:dcac8064b109430ffff5f234276e58cb079a6631ca51011a3995badbe42c13cf","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-09T23:10:35.566750Z","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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 100 of 151 outbound references and 0 inbound Pith citation observations for arXiv:2608.05331."}