{"as_of":"2026-08-11T15:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4582d3bac8ed7b443eabaf1299527d730c61ef84f5df212813508532abd3b4d2","coverage":[{"denominator":161,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-10T00:51:14.927492Z","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-11T06:34:44.6726+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.06852/citation-record","integrity":"/paper/2607.06852/integrity","json":"/paper/2607.06852/citation-record.json","paper":"/paper/2607.06852"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.536717Z","title":"Kanj and Ge Xia , title =","venue":null,"work_id":"f5365b4c-555c-4a09-a1ba-fa551d8daf57","year":2006},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:1695e9a55da874b8481f95d9524874e05ab16844a7394c22e88ffd81ea191836","observation_id":"921c5888-f51e-42a9-8308-0b55408b2860","resolution":{"observed_at":"2026-07-10T00:56:41.537763Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.544937Z","title":"Approximation, Randomization, and Combinatorial Optimization","venue":null,"work_id":"860f267a-13bd-4038-95d5-50c57815328e","year":2023},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:58e876042c1409395993ca6c36470598fb229d9873d1c868f5ddc42f026e44d8","observation_id":"102eb519-5cb4-4666-83cf-68965f9c602d","resolution":{"observed_at":"2026-07-10T00:56:41.546059Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.548337Z","title":"Approximation Algorithms for NP-Hard Problems , editor =","venue":null,"work_id":"2042b06b-4952-48e1-9653-246d728e761d","year":null},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:b98ad47ba2aaea80550afa717fa4263e07d049fe6568e22351a9d85dfd0a6358","observation_id":"8c524c48-f9a1-411d-97ce-d07228b79ebe","resolution":{"observed_at":"2026-07-10T00:56:41.549457Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.551606Z","title":"2021 , eprint =","venue":null,"work_id":"07410cd8-9cbc-4420-89de-f6bc8427aefd","year":2021},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:3a5b1f09bdf40ea8f086a4c49d2a9ac58c15190a53f14cad8df2e4537fca3f35","observation_id":"dbdabe32-c487-4ce4-8989-a2235b7581fe","resolution":{"observed_at":"2026-07-10T00:56:41.552660Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.569698Z","title":"Parameterized Complexity Theory , series =","venue":null,"work_id":"fada7dd3-3133-431d-9635-c1e336ddbfec","year":2006},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:a494d71904853fa435eb8846369458575b9cb115e86036b7c4045501244aa077","observation_id":"3a27adcc-ca81-4657-b99e-acd2a198a52b","resolution":{"observed_at":"2026-07-10T00:56:41.570822Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/3-540-63307-3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Goldwasser and Rajeev Motwani , editor =","venue":"Lecture notes in computer science","work_id":"c5687f1a-ccf7-4eda-9492-e0569de5c890","year":1997},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:d1c675d5cb59f18498b3becebd514ab2e23a4af1e5247c74e7bcf6bb5adc9797","observation_id":"cd42c2b6-526d-4322-a260-66478905f173","resolution":{"observed_at":"2026-07-10T00:56:40.827695Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.2307/2694916","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Buss and Shlomo Moran and Toniann Pitassi , title =","venue":"Journal of Symbolic Logic","work_id":"ed87405d-9c3a-4294-94d8-11ee677ab70a","year":2001},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:ef02482092f6111c33601cab6bcfdb491b073ae95c882fedb9ae69d9b7c0ce86","observation_id":"3eaabe29-5f25-477d-b296-01b72a68ce2f","resolution":{"observed_at":"2026-07-10T00:56:40.866431Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1999.814619","doi":"10.1109/sffcs.1999.814619","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"40th Annual Symposium on Foundations of Computer Science,","venue":null,"work_id":"d223f571-89c5-4697-b3e2-c68b98e724c4","year":1999},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:295f5d358c656a98cb8289cea76aaeec05dffec17e11b64a594cfee269020870","observation_id":"f962e584-e726-4aba-8f6c-338dff5a6d36","resolution":{"observed_at":"2026-07-10T00:56:40.848896Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.ipl.2003.11.007","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Information Processing Letters","work_id":"47f06bce-6a9e-4d44-8314-44f6d517429d","year":2004},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:3d77fde56341b2d77b7e0454bd8f6170587896bcf55f763e1ec04499be40dc66","observation_id":"f5531e7a-c729-42d3-8931-dacc7996ae36","resolution":{"observed_at":"2026-07-10T00:56:40.874575Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"0332.210337","doi":"10.1145/210332.210337","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Color-coding , Url =","venue":"Journal of the ACM","work_id":"cd97758f-7b01-4d02-9a10-e090d02d34ca","year":1995},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:1db63b9dfc7797d1211dab7708814095c833c88ff78cc845aba16e95c8fb8e3a","observation_id":"917b9c29-e6ac-461f-b90f-afc51f4322c3","resolution":{"observed_at":"2026-07-10T00:56:40.887274Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-07-13T18:50:33.963264+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T18:50:33.963264+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.520600Z","title":"and Koml\\'","venue":null,"work_id":"375a9f75-ac75-4708-8deb-edf2a04f1c35","year":1984},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:5e84343188792538366cc9dbefd201ea4ec77f10d63a4f4fe875de1af26f6d03","observation_id":"ea2f1dbf-554c-4477-9807-f7a1212eaf28","resolution":{"observed_at":"2026-07-10T00:56:41.521676Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jcss.2012.09.001","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Completely inapproximable monotone and antimonotone parameterized problems , journal =","venue":"Journal of Computer and System Sciences","work_id":"f74a56ee-b0f0-4498-b047-3b44cf13f813","year":2013},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:6549aef5df1915e4d2c6aaaa7eef040b477ec71b3eb5c9312068296cde77e0b6","observation_id":"0c5175f5-16a8-4aef-a340-4897d5f46a83","resolution":{"observed_at":"2026-07-10T00:56:40.815246Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-319-03898-8","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fixed-Parameter and Approximation Algorithms:","venue":"Lecture notes in computer science","work_id":"4ff07361-c2ab-499f-8aff-70158f028f6e","year":2013},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:2b004995c2787c1413d3d218f912b547c0bc9266be2b8b6aa8bdb8b1f55f9e45","observation_id":"fcfc91af-5ca9-4c18-b5bd-26070387350a","resolution":{"observed_at":"2026-07-10T00:56:40.856151Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1995.492573","doi":"10.1109/sfcs.1995.492573","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995 , pages =","venue":null,"work_id":"5a871f98-afdb-4fe5-be1a-abc36a295dbe","year":1995},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:c136c3946bb818b6fbc3b8663e70f193c5cbbbf37f726b53f022befb522145ba","observation_id":"26d133cc-f16b-4af1-a7bc-8a33b9b4c479","resolution":{"observed_at":"2026-07-10T00:56:40.803608Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.515619Z","title":"2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) , pages=","venue":null,"work_id":"b330138e-fe8d-4596-9748-031979ec8bab","year":2017},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:2e9087d35239957e23c1eaa375dd143cf1a79d8202764e131ab2abfb20f60b04","observation_id":"c7275733-b0da-4fcc-a52e-fe89dd525968","resolution":{"observed_at":"2026-07-10T00:56:41.516767Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.510559Z","title":null,"venue":null,"work_id":"4cf5a342-89b2-414a-bdd5-768bb18054cc","year":null},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:baf71148f35e70f0dfcf57f5632c20a0df7efa66eeb21e5b37e3e49814f51e4d","observation_id":"ceede501-294b-421b-9f6d-ffaaf398dccb","resolution":{"observed_at":"2026-07-10T00:56:41.511578Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.543350Z","title":"SIAM Journal on Computing , volume=","venue":null,"work_id":"cba8efc6-1f4d-4485-9781-fae25afa957b","year":2007},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:3341d9f11b18d6b63be3a753bff6df60d38b6a57030b01b057f87e0019a34228","observation_id":"f36ac6d5-8cb7-43f2-b766-950886f158b1","resolution":{"observed_at":"2026-07-10T00:56:41.544400Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.546650Z","title":null,"venue":null,"work_id":"1e12584a-abe1-43db-b152-ebdb2b9e2636","year":1960},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:0cd0b1c2384e37cb0867e86df4c2b1daca3217e007281ac7f09db1e50064dc7a","observation_id":"88b96cfc-b0fe-4a46-9084-36418d544426","resolution":{"observed_at":"2026-07-10T00:56:41.547757Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"5305.335315","doi":"10.1145/335305.335315","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"2000 , isbn =","venue":null,"work_id":"9271e11a-a64f-436f-b19e-e11f89131299","year":2000},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:a7f75fb522412867b7b59c4600b9ef507e9c042467d111446b4ff295b31868d2","observation_id":"7a866cbb-72cf-4509-af93-008f4dd1a83b","resolution":{"observed_at":"2026-07-10T00:56:40.858821Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.503542Z","title":"30th Annual Symposium on Foundations of Computer Science , pages=","venue":null,"work_id":"ef57adda-4caa-4feb-9002-085f56fb6faf","year":1989},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:e082d8c1110e5c7282d0a2b1dd7ffe7aa4f2c6ce0be60694e02d30fc21c80596","observation_id":"4a04ca01-d5d4-4dd0-9c86-4e57ee72c737","resolution":{"observed_at":"2026-07-10T00:56:41.504882Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3444942","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem , journal =","venue":"Journal of the ACM","work_id":"0a1178b6-e6b5-4627-91f3-777de99b1ca5","year":2021},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:3c2d03e79eac6ca33a7a3b58277fccb5245fc34c1507d717909ccb272b97d0c7","observation_id":"228dd684-0014-4786-ad1d-2174737901b1","resolution":{"observed_at":"2026-07-10T00:56:40.813420Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.538256Z","title":"Draft available at http://www","venue":null,"work_id":"cacfb878-ce8b-4057-a1cd-d9faebfa586c","year":null},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:7c46d8d232e106793cdbc78e6883b60eda3637511698f0b983379f12d34f6638","observation_id":"7d1a5c50-73c0-44bb-a832-63b476663666","resolution":{"observed_at":"2026-07-10T00:56:41.539375Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.517329Z","title":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing , pages=","venue":null,"work_id":"426252ae-162b-4a4a-97f8-593187e1c3f4","year":null},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:2cdaac90e520ecb08758a6501b250e51a862d3ac6a823bddb5f82848006dd0da","observation_id":"516fc6d9-9bcb-4b92-b86c-3d1b67b4f37a","resolution":{"observed_at":"2026-07-10T00:56:41.518437Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.533411Z","title":null,"venue":null,"work_id":"28e400a8-2bf9-4109-a7f1-d9d9bfcff0e1","year":null},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:33ea02e3325985c3104a8a4f63d621a0fbf4e29235975f2633bb23728b4e5396","observation_id":"3899c484-1f96-419a-b11c-c272d901bd44","resolution":{"observed_at":"2026-07-10T00:56:41.534515Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/s0097539792228228","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Downey and Michael R","venue":"SIAM Journal on Computing","work_id":"6f257813-b444-46ad-aa81-7fa855ad39b9","year":1995},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:904645d6022fb32f6860904ba2c2002dbaab919ab4f94a30bf0daca63720d21d","observation_id":"9b7cd551-fffe-4f42-a17b-7c091f6f562d","resolution":{"observed_at":"2026-07-10T00:56:40.829498Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-016-0189-9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"and Pieterse, Astrid , title =","venue":"Algorithmica","work_id":"13126248-8793-4567-9b02-7ed1f3f6dde6","year":2017},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:bb06459f3d148b4d349c9317267bc99244d257257e1e103e97591ca689ce29ee","observation_id":"62fcdfc6-ec82-4acf-b59b-300109fab953","resolution":{"observed_at":"2026-07-10T00:56:40.862883Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611976496.24","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"2021 , url =","venue":"Society for Industrial and Applied Mathematics eBooks","work_id":"75c757df-5b01-48c3-ad2a-0d49051d923b","year":2021},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:1f9a30c07514a6f4955330909b198e35effcd34305637dbe53ec61550492e8fa","observation_id":"05086ae5-b3aa-4900-98da-6ee1eed3e8f3","resolution":{"observed_at":"2026-07-10T00:56:40.811078Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.491201Z","title":"A Simple Gap-Producing Reduction for the Parameterized Set Cover Problem , booktitle =","venue":null,"work_id":"481cc2a6-b5cf-407c-9cc1-a67f00d65eb7","year":2019},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:692281b0688caa678c35f7184de813c4fe934dbfce3c87a69b2ec6a9289d9a9b","observation_id":"d46a92cd-1ba2-43bd-b300-56b66cdc5356","resolution":{"observed_at":"2026-07-10T00:56:41.492290Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.492837Z","title":"2019 , url =","venue":null,"work_id":"49449d04-0cde-4342-837b-14b2c759e833","year":2019},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:aa27d343acb77329959b008b83efac75d04fe346f66034a903be52487b9a2b8d","observation_id":"6d5a053a-6c30-41d9-b6ac-293fbdb838fd","resolution":{"observed_at":"2026-07-10T00:56:41.494671Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.497265Z","title":"2019 , url =","venue":null,"work_id":"782feac9-0faa-4b28-a3d8-3429bba28719","year":2019},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:f1bb050207534aed8559d76c820715036bedc7bb21ef9bb810dd28aa5f85897f","observation_id":"ba9b8c9b-9ce8-4eec-8d98-6723764de3c9","resolution":{"observed_at":"2026-07-10T00:56:41.498678Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.486195Z","title":"Journal of Computer and System Sciences , volume=","venue":null,"work_id":"902b9094-78dd-47c3-9aa8-e2cd0547e888","year":null},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:7e766d0dbdb126ef5bffb3ccfa664c1370aa36c02cbb485ce9ba6da8fdbd4b19","observation_id":"b975ceb8-7dae-43f7-b991-796330da3335","resolution":{"observed_at":"2026-07-10T00:56:41.487391Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.487930Z","title":"Zarankiewicz , author=","venue":null,"work_id":"5be473f4-a4ff-471e-a60c-9845f0ef4b12","year":null},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:1dbf4d881d15ff139c1348c79b6f70046af177e555abc45109d692464e360d94","observation_id":"574c69f3-4c06-40ff-988a-0b635715d325","resolution":{"observed_at":"2026-07-10T00:56:41.488973Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.586624Z","title":"Journal of Computer and System Sciences , volume=","venue":null,"work_id":"fcca5f90-976e-4452-8cd0-6b20a99ccb76","year":2001},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:407afc332cef20fc0b5ecf2aeb78046638e813299a008c9c85d2e3f64b729d6b","observation_id":"4db68901-6ad2-4762-98ae-d5ab5494807a","resolution":{"observed_at":"2026-07-10T00:56:41.587749Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.474510Z","title":"Tovey , journal=","venue":null,"work_id":"55a2e33e-062b-4ae2-b28e-d0b5676dce17","year":1984},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:ddb01d981744dc940853867ef2f545fedd9c55d1a146e3265e639c79ee8d87ed","observation_id":"b664eea4-e33d-404e-ad1d-16fd4608989c","resolution":{"observed_at":"2026-07-10T00:56:41.475597Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4086/toc.2010.v006a005","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Can You Beat Treewidth? , journal =","venue":"Theory of Computing","work_id":"b3b0485f-6745-4c0b-b410-edef7d8df0b1","year":2010},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:190cb7c9e913add975e7e566497a8f7064b9100ab0d11c28ff44cfa123d06692","observation_id":"e50e67f1-ed6c-4cd5-be69-fb55258d150f","resolution":{"observed_at":"2026-07-10T00:56:40.864628Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-07-17T22:51:02.098496+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T22:51:02.098496+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3483425","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams , journal =","venue":"ACM Transactions on Algorithms","work_id":"6fa4b628-ed28-468b-a37d-9d28fcea1166","year":2022},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:81bfb05569435715aaf078d6080f27ca404d9eb3a832df2984b5fd26bcfc72cb","observation_id":"ef0c9098-d140-4d01-aae1-bda4777c4e56","resolution":{"observed_at":"2026-07-10T00:56:40.852654Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.584958Z","title":"Algorithmica , volume=","venue":null,"work_id":"97c39d36-fd3d-4932-9fc5-3f20bcdda12a","year":2023},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:1d634c61b4ddfa732815e368bc548051a8a1cf4d112eddb4ac7aa4ce9cc689f1","observation_id":"dfe5b4fb-838e-46f4-8202-c89649f65c57","resolution":{"observed_at":"2026-07-10T00:56:41.586091Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.482815Z","title":"Electron","venue":null,"work_id":"6cc8428d-2716-463f-a5a3-c4aa61c6e414","year":null},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:c9b335bb5b8951cf6c3dbe2a1c6d0698957a07a66e17cfbe02220fbe5a81343f","observation_id":"2db0bea0-ae5b-48b8-9380-983cd554c510","resolution":{"observed_at":"2026-07-10T00:56:41.483812Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.icalp.2017.78","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs , booktitle =","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"9f63d258-6c3a-4c25-b24c-40781bd4e007","year":2017},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:17aea33edff3884acb568b67b9e21c0fe1220293202757e1e98a085656640ae7","observation_id":"dbf39e2a-68cc-4cce-ba5f-b15bfa4c18d9","resolution":{"observed_at":"2026-07-10T00:56:40.790284Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-08T15:08:17.091651+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T15:08:17.091651+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"6457.123645","doi":"10.1145/1236457.1236459","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"2007 , issue_date =","venue":null,"work_id":"d0a6e552-9c28-4eb8-a9eb-1026fb4a7b8e","year":2007},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:e16cf9078066cfd5fcbf4aba051c0153ce990a4bec3f741f11005847a78ca80a","observation_id":"c8780024-2eaa-4922-aaaa-6574970de680","resolution":{"observed_at":"2026-07-10T00:56:40.796325Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-05-25T08:25:11.355408+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T08:25:11.355408+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.540069Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-","venue":null,"work_id":"bc5eb177-beea-4483-8df5-a9172807e33b","year":2018},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:c7e1ae3ed1a72a4c2d6455acbc814d4d600fd2883bf438457a0269f0dfe82034","observation_id":"32ae162c-7fa1-4c31-8b88-117dc28b8aa2","resolution":{"observed_at":"2026-07-10T00:56:41.541215Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/focs.2017.74","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"From Gap-","venue":null,"work_id":"93e2533a-0083-4384-a480-ce8fd6aa3d07","year":2017},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:d8c217caf555ef2e57e560e701486c36c82264d040c6553c3e82ac684dfc8f28","observation_id":"b845acfd-bcae-4335-9557-1c1fd7b0bb12","resolution":{"observed_at":"2026-07-10T00:56:40.876323Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.578256Z","title":"SIAM Journal on Computing , volume=","venue":null,"work_id":"2d139bfc-5ee1-47dd-9065-cbc7672d0e19","year":2006},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:3b73a05401abb3f5813ca8a8fd586e27c26bda5126f2cfbb3e5b043134228b91","observation_id":"e6c66478-3ef8-48d8-8cb8-4de65be8b757","resolution":{"observed_at":"2026-07-10T00:56:41.579311Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.599155Z","title":null,"venue":null,"work_id":"d3890084-7ee7-4d81-8b25-7312aab83682","year":null},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:4d54b12a28507b42be31e8f237fc50e3a2a0dd3569398338c1eb2ba0ef5da959","observation_id":"2a11b3c5-ff44-4559-9ff0-35c0b13537fc","resolution":{"observed_at":"2026-07-10T00:56:41.600192Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jcss.2006.04.007","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Kanj and Ge Xia , title =","venue":"Journal of Computer and System Sciences","work_id":"385595a5-a562-4851-9718-465776d8d54f","year":2006},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:6acacec0d96be682cac5744b7b8339c947f5f8b501d55e95af0fc79a11dc55d2","observation_id":"ecf87260-d577-4bd8-b70c-62c74aa9c7e5","resolution":{"observed_at":"2026-07-10T00:56:40.807230Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-07-17T22:51:04.620982+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T22:51:04.620982+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.566223Z","title":null,"venue":null,"work_id":"27f682f1-98ce-4e4b-8d2c-9ebcd1477f85","year":null},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:c8988b17716ab86b8c1d16f29e0e03306637407b3116fa13f0e3e138c443cc20","observation_id":"26be7def-1d2b-431c-981f-4611dc3dd64d","resolution":{"observed_at":"2026-07-10T00:56:41.567391Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.594063Z","title":"International symposium on symbolic and algebraic manipulation , pages=","venue":null,"work_id":"f88b4a84-94cd-489c-b6f5-1f7cbeda3b02","year":1979},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:69dd2d9edc8ff1df0b8010fc3f88e107c192560aa79cb3402d0205a25478f6af","observation_id":"c4d942ec-4dc9-476d-a4d5-0945b5f188ed","resolution":{"observed_at":"2026-07-10T00:56:41.595225Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.637323Z","title":null,"venue":null,"work_id":"34a00084-6f23-4a43-b4f2-434c1c5777d1","year":null},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:c770baedbcf56adab9caef28c206f3ba70bc66a378c847cf5895f2377adf90f5","observation_id":"75c83f68-e408-40ef-bc05-0075f1d60ecd","resolution":{"observed_at":"2026-07-10T00:56:41.638342Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.541745Z","title":"Journal of the ACM (JACM) , volume=","venue":null,"work_id":"306c0e96-fb07-4e43-ac07-e1e737dbf348","year":1980},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:9bfb4a6f4561c64aace24f60c78554301a375878a0b58ea52d9f4f8dc2bb15dc","observation_id":"fd085373-eb6e-4104-8d4d-056b75443b53","resolution":{"observed_at":"2026-07-10T00:56:41.542788Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.508897Z","title":"Decodability of group homomorphisms beyond the","venue":null,"work_id":"508bb5be-13da-4c80-8d58-96eda2aee4b0","year":null},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:981634ddc89eb1f1e7c791b9520337bb04f79a2ac9dc7f987f9c4bbd2a110d7e","observation_id":"52eaae33-d9ed-48d0-948d-bac404a5beb8","resolution":{"observed_at":"2026-07-10T00:56:41.510045Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.512115Z","title":null,"venue":null,"work_id":"3eea3091-1b2c-4901-85e5-12a1b04707a6","year":null},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:f52b85d64d621f1250018baaec7246754d1ddfd0edae0209366086d68df14d60","observation_id":"3ad56e3d-57cd-467c-8fc5-1e3c7be3db06","resolution":{"observed_at":"2026-07-10T00:56:41.513189Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.505460Z","title":"Proceedings of the forty-first annual ACM symposium on Theory of computing , pages=","venue":null,"work_id":"a106b0a4-e67e-4167-9cea-35eec7cbf54c","year":null},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:1eb50e4920445f2e9603f29b9a1c789ee18b6c848295119519deb17b3fd7cfd5","observation_id":"5777332d-dbd3-4417-99da-882943db3bf2","resolution":{"observed_at":"2026-07-10T00:56:41.506564Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.507128Z","title":"Exact Weight Subgraphs and the k-Sum Conjecture","venue":null,"work_id":"f9ebfd50-02e8-4491-8739-71e36a6c94db","year":2013},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:d7a5f77c9822846feacb02d6756563e6d460f7f70fdb36d252d6fbf4388998c6","observation_id":"44ec2449-dd33-404b-b48f-822b2302a833","resolution":{"observed_at":"2026-07-10T00:56:41.508302Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.513732Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-","venue":null,"work_id":"db47774c-fd15-485f-baad-c59e25a5d8d6","year":2018},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:bdcceeba0dcf5efe3b77d404033179e732dab73805cde03ac40987224500aec1","observation_id":"925fe930-4d80-4cd3-b715-75593f6905a1","resolution":{"observed_at":"2026-07-10T00:56:41.515036Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.518965Z","title":"The Complexity of Satisfiability of Small Depth Circuits","venue":null,"work_id":"41ff33d8-9bd7-4a61-af3b-61e2d875594a","year":2009},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:b9a2f92f7bee9c2f0d392dbe5f1103386187fd75bee046e8e5711824f325bffc","observation_id":"5788debb-e41e-4b62-9d82-9688b7b8f796","resolution":{"observed_at":"2026-07-10T00:56:41.520077Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.527599Z","title":"Improved Hardness of Approximating k-Clique under","venue":null,"work_id":"e83cb0a9-d488-4384-83c6-b63b69b1bb77","year":null},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:3ac7ebfddac56c512d5b6e348af1e984e2c8ab513b5a8180f5c00b887e336ada","observation_id":"0d29d11d-9158-42c9-bd56-d01c7209edfa","resolution":{"observed_at":"2026-07-10T00:56:41.528862Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.484480Z","title":"49th International Colloquium on Automata, Languages, and Programming (ICALP 2022) , year=","venue":null,"work_id":"339e69a9-c2f7-43e6-bce1-919e446146d6","year":2022},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:e9560afc80792f216588989cc07b356df8d395e542ca3384e34629c47117a509","observation_id":"f67547c4-79dc-43ac-8dc7-69c8b4f824ee","resolution":{"observed_at":"2026-07-10T00:56:41.485649Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.489492Z","title":"Constant approximating k -clique is W[1]-hard , booktitle =","venue":null,"work_id":"c55683ec-ea70-46b0-8e86-37a38963bb92","year":2021},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:626d38d569c1f7e21f9e0be8e1025e3146b591018c35cad188c9f9b0075edbcf","observation_id":"ddab0f1b-e153-40c0-ad5f-e881be0108d0","resolution":{"observed_at":"2026-07-10T00:56:41.490571Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"3865.273901","doi":"10.1145/273865.273901","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Probabilistic checking of proofs: A new characterization of NP","venue":"Journal of the ACM","work_id":"f7bbbe53-9d64-4adc-8e62-4290888ff4f2","year":1998},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:c42db19c77076dc8433c958d588dfddc9dfb9505c461a257731a0962e9b52bb3","observation_id":"76ec444c-6c5b-4ec6-bb4d-cff99641c387","resolution":{"observed_at":"2026-07-10T00:56:40.883965Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.479574Z","title":null,"venue":null,"work_id":"6c3e7535-1a18-4ccb-8be1-eacd7aefe0f8","year":null},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:069f9aec7e94fd7126c7f7efab3d9394207190aade6a1782fbc9361b3f107675","observation_id":"aaa55a96-3c0b-4642-8731-aeeef9d38d51","resolution":{"observed_at":"2026-07-10T00:56:41.480601Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.495274Z","title":"46th International Colloquium on Automata, Languages, and Programming (ICALP 2019) , year=","venue":null,"work_id":"61e48b9e-674e-43ad-a5c7-1196d5ef990b","year":2019},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:01342ddcc82f3e38cd59317e8544b6a99783d0afd8890fb6f3ee0acd926de44c","observation_id":"b66d9f22-caa9-4e47-afa6-1a7a01cd799a","resolution":{"observed_at":"2026-07-10T00:56:41.496553Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.523713Z","title":"2014 , publisher=","venue":null,"work_id":"612b4d0a-c90e-413d-ab6f-4eebce45d289","year":2014},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:69870e3b72654ac0078b97b8aea1e2751cd1eec6dcf7fdcbbabb7d7c4b052af6","observation_id":"838693e7-845c-4684-b0b3-f7fd762e0e31","resolution":{"observed_at":"2026-07-10T00:56:41.524743Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.522214Z","title":null,"venue":null,"work_id":"9c09a3b9-c60c-4bf8-9d40-1fb9ae568aad","year":null},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:75fc82cc8819db08051e01be635fc8e986268fbb23a136f82dd51f1d87a562e9","observation_id":"45a75600-8c8e-4727-885a-a4a5f5da0ab9","resolution":{"observed_at":"2026-07-10T00:56:41.523200Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.631989Z","title":"Assignment testers: Towards a combinatorial proof of the","venue":null,"work_id":"1f2dc5ed-bbf4-41cc-879d-4f691b102999","year":2006},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:5a61f686b74511111c255cc6e714e180f091470b5b60c65301bff4755c983564","observation_id":"a6c3ac90-b2d7-4ce7-8d0e-7500fa004c6a","resolution":{"observed_at":"2026-07-10T00:56:41.633228Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.630168Z","title":"Graph-Theoretic Concepts in Computer Science: 29th International Workshop, WG 2003","venue":null,"work_id":"6e0c60b7-bc17-4b0a-a84f-ee1757c6f730","year":2003},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:81a4ba19691f1a441069d2d6c7b39f89d62db7d267f985b5464e1918a8d2cd41","observation_id":"68da2591-294a-49f1-9b16-48d9c2bc4b13","resolution":{"observed_at":"2026-07-10T00:56:41.631460Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.624849Z","title":"2004 , publisher=","venue":null,"work_id":"c2271877-5ca0-4f71-9b90-9e2d0198d426","year":2004},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:edf42871b03c630930bbbd330a9136f0a1f0db91930f20a4ef92aa5ed1145f65","observation_id":"be2fef80-0136-4cbb-a425-325ac560cea8","resolution":{"observed_at":"2026-07-10T00:56:41.625967Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.626553Z","title":"Proceedings of the fortieth annual ACM symposium on Theory of computing , pages=","venue":null,"work_id":"2f6545a4-7020-4b7e-a905-849362f56625","year":2008},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:212ca45aac83f53d920dc966eb5e79ef2fb22a3ea0e7fe732f9691486706c733","observation_id":"56291987-ff12-4217-b3e3-a238f3aa9107","resolution":{"observed_at":"2026-07-10T00:56:41.627673Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.628233Z","title":"Clique is hard to approximate within n^","venue":null,"work_id":"1e9c876c-8926-4427-8e9d-f0248ced5b9b","year":1996},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:02ad5b5701b647ee9fa61d6879e9550262ae96e6c27cd6f068519f98154052bc","observation_id":"c15d9e5b-c4be-4b8d-8ed1-e53acc2f537e","resolution":{"observed_at":"2026-07-10T00:56:41.629426Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.635625Z","title":"SIAM Journal on Computing , volume=","venue":null,"work_id":"d795d2b8-10ee-4735-b5ec-8ea00da4cda0","year":1998},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:7c551588387fe3221072b68ae8341076404cb9d9712b84eeeb04dcfb67106377","observation_id":"7e2226e0-d6ac-4693-8b4e-82b5cb4ad1e6","resolution":{"observed_at":"2026-07-10T00:56:41.636787Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.617776Z","title":"Proceedings of the twenty-sixth annual ACM symposium on Theory of computing , pages=","venue":null,"work_id":"b9611f0e-17ef-4e3a-a059-51b083f4a061","year":null},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:8e42dcfc82a3315d99404d4ccd91ad1b98b64ded983a472135f2882f4fdd5301","observation_id":"3ce08cda-4fdd-4f75-bd7b-bff5aac175b9","resolution":{"observed_at":"2026-07-10T00:56:41.618951Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.619460Z","title":"SIAM Journal on Computing , volume=","venue":null,"work_id":"693dc4dc-2ee0-4a24-aec7-62fc42210e98","year":2000},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:20ee47b83f27cde77b44cd0e8826eacd4a5575f130dd6b02f61a04fd495646e5","observation_id":"ef4a4684-64ae-4079-9c7d-d82d953e06ea","resolution":{"observed_at":"2026-07-10T00:56:41.620634Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.621201Z","title":"Proceedings of the thirty-eighth annual ACM symposium on Theory of computing , pages=","venue":null,"work_id":"d0f95db0-5194-4b72-8b0d-3e832d758339","year":null},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:71be95b3576719514e7b0b8488c44f9a792d558eff1cf7c7f1efa134c50610aa","observation_id":"d841c962-6dab-464b-9e3a-81abbc7f6bd2","resolution":{"observed_at":"2026-07-10T00:56:41.622499Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.623047Z","title":"Proceedings of the twenty-fifth annual ACM symposium on Theory of computing , pages=","venue":null,"work_id":"b7aa5ab7-8161-4da3-b012-ddd1c68bdd9e","year":null},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:27ff2829da8f948b0c01ea409955387c08286e4478a9454d67dbc1a5bbe9846f","observation_id":"f012276f-5a7f-4acd-91eb-3302af2596e4","resolution":{"observed_at":"2026-07-10T00:56:41.624233Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.612656Z","title":"Journal of the ACM (JACM) , volume=","venue":null,"work_id":"c1655b25-072b-4724-9d03-c1fc9ca1af66","year":1996},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:22654b8352d5fd9756b3a43c6dcb1ae493033b19d0a045764fe7bc0b6a327568","observation_id":"5b5bd192-9214-41db-9317-be39054c964f","resolution":{"observed_at":"2026-07-10T00:56:41.613734Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.609258Z","title":"Frontiers in Algorithmics - 13th International Workshop,","venue":null,"work_id":"3faa5f71-0388-4731-b12c-d958e8c62890","year":null},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:b22c9d8166ef6535f0f6590b222d5addf4fcf023c9d04d0048b22f005abfd7ec","observation_id":"696ea861-6914-413b-bbf0-23a90fd346a3","resolution":{"observed_at":"2026-07-10T00:56:41.610453Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.610979Z","title":"A talk given by Neeraj Kayal at the Simons Institute for the Theory of Computing, Berkeley, CA [Accessed: 2017/20/7] , pages=","venue":null,"work_id":"46a77d1d-a884-4b3b-838c-88aa25618a21","year":2017},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:a4c694dcbdf0060732b4c4cddae9a0bd04b2245d067420c1f8467052b9c0aa54","observation_id":"005d55e1-f2e7-46dc-92f7-791967a70112","resolution":{"observed_at":"2026-07-10T00:56:41.612117Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.616031Z","title":null,"venue":null,"work_id":"fc51aa1a-593b-4da0-8525-7b12e853c8e2","year":null},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:5ca98781848220b04ed95f587189440a999b24f1a64c81662540311627950a69","observation_id":"19ea787d-eee2-47c1-8765-bc102603a39d","resolution":{"observed_at":"2026-07-10T00:56:41.617193Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.614307Z","title":"Fomin and Danny Hermelin and Magnus Wahlstr","venue":null,"work_id":"f408a306-110e-4f59-8f90-e2bebaa43857","year":null},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:36f020c6bb63bd7a3b30ef012e2c2571d83359c698afef211caf3f51636ed4d7","observation_id":"6fa4c54c-faff-473d-b5dd-74c3b6fc37cd","resolution":{"observed_at":"2026-07-10T00:56:41.615468Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.640429Z","title":"2015 , publisher=","venue":null,"work_id":"ad174398-6c04-47f4-875b-24a8389da43d","year":2015},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:ac6a43a4548f113731cf7f2f29b0b35564317905390dbbfab01b8ca96c21ae7c","observation_id":"a4273386-47ad-44fd-862c-e2e4033ea6b6","resolution":{"observed_at":"2026-07-10T00:56:41.641472Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.607630Z","title":"Theoretical Computer Science , volume=","venue":null,"work_id":"b856ce97-e76b-4d3e-a958-e1a6d8f0a8b5","year":2004},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:fdd541878d35844e92ad080c1fa5cb412506c6677e8b5b1f01582849157dabda","observation_id":"1aebc598-31be-4236-bfe7-482b075adfaf","resolution":{"observed_at":"2026-07-10T00:56:41.608717Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1311.3054","last_updated":"2015-11-25T02:58:29Z","snapshot_observed_at":"2026-08-11T13:18:19.443080Z","submitted_at":"2013-11-13T09:26:57Z","title":"Losing Weight by Gaining Edges","version":2},"cited_work":{"arxiv_id":"1311.3054","doi":null,"metadata_source":"pith","pith_arxiv_id":"1311.3054","snapshot_observed_at":"2026-07-10T00:56:41.092505Z","title":"Losing Weight by Gaining Edges","venue":"cs.CC","work_id":"396d4e9e-c1d2-4072-ad64-544d202a1274","year":2013},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"cited_paper":"/paper/1311.3054","citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:11a48b25d2c490fc432d6a1cc8bc7452ea20fb1c7ae6d9416ba2c9d54381d7f9","observation_id":"7b6f3068-5095-4632-a708-634f36917702","resolution":{"observed_at":"2026-07-10T00:56:41.093712Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.602464Z","title":"European Symposium on Algorithms , pages=","venue":null,"work_id":"e1bb5ac1-35c5-4e78-9742-12237e5bff20","year":2014},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:f53bfac5867f93a7069ae3de22b2c4b4a10eb42384cd264a666d3913f68ed329","observation_id":"01b7ed3f-4a73-497f-9402-84fd94492489","resolution":{"observed_at":"2026-07-10T00:56:41.603512Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.604075Z","title":null,"venue":null,"work_id":"159aebe0-09b1-4d53-b108-a40c449dcb66","year":1972},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:374987c314587b8d0351d622f50bc6616701e6c0950581b63963bbc33687c899","observation_id":"00c34377-4f12-443e-8871-a0d6db2bc24b","resolution":{"observed_at":"2026-07-10T00:56:41.605180Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"8298.278306","doi":"10.1145/278298.278306","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"1998 , issue_date =","venue":"Journal of the ACM","work_id":"3f14bdd6-d661-4401-8d21-2230fa772fa9","year":1998},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:4d0eb0fa87b9ff5bff89934e639e252b59c2f821e51ebe5ded58d56f206a3a7c","observation_id":"7f548661-6fe2-404e-a3b6-46ea33ea885e","resolution":{"observed_at":"2026-07-10T00:56:40.823732Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-05-25T08:25:16.892893+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T08:25:16.892893+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.638847Z","title":null,"venue":null,"work_id":"8d37bd35-fac3-4341-9697-21e02ce3d82e","year":null},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:bef5423c07ef9eb11e73b952aa4a44314dfa917e2bb1145c0709ee21cd26581d","observation_id":"d4360746-93e9-4110-b909-3c7a2653f962","resolution":{"observed_at":"2026-07-10T00:56:41.639886Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.595805Z","title":null,"venue":null,"work_id":"a10b357e-c3e7-4edb-99b0-bb12d42491f0","year":null},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:7eafac5ab534be400b09017c03ad9cf0e0dd7a98fff7d57e77511bb840a1cdcb","observation_id":"be2884bf-7c12-4f17-b2ce-ce371fe8a22e","resolution":{"observed_at":"2026-07-10T00:56:41.596886Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.589962Z","title":null,"venue":null,"work_id":"46b3b6b9-583b-48bf-96ac-7ee601a8c109","year":null},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:fc4e750fd9dc83158f304e4e76af9ed68d33ff3ac561500847fe4ac45f634ab5","observation_id":"18c61959-f8ac-452c-a64c-9f9bb9acd4cd","resolution":{"observed_at":"2026-07-10T00:56:41.591782Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.581479Z","title":"Journal of Computer and System Sciences , volume=","venue":null,"work_id":"06163246-3783-4270-87a9-5cfb82a8d97a","year":1993},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:4e0650af76cb07c36b9077c36024dc05c8448cf49715e4b994076df0c3f2994b","observation_id":"f5ff5de7-676f-49f8-be24-d9ea6cee2944","resolution":{"observed_at":"2026-07-10T00:56:41.582653Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.573020Z","title":"Fixed-parameter tractability and completeness","venue":null,"work_id":"46a91da0-797b-405e-b450-d6c252606505","year":1995},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:651ce9d04048de8ef85c1ea7034b1d0476b42b7d4d3a59772b07d18f7b778b5b","observation_id":"4b318ad8-aa66-470e-a728-4ff6460808d3","resolution":{"observed_at":"2026-07-10T00:56:41.574246Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.571384Z","title":"Raz and S","venue":null,"work_id":"cbcfb73b-6113-45d0-b50f-a5bbdc120000","year":null},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:5d2773d6ac2645cc9b7654b721fb7b748f19493f21046eb7f4058ef19b30be84","observation_id":"3e3a1cf1-e5fb-4b94-a2a5-b8719201fe1b","resolution":{"observed_at":"2026-07-10T00:56:41.572413Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.574874Z","title":"2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) , year=","venue":null,"work_id":"ace352f2-ba23-4852-86eb-d309ebdbdba4","year":2017},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":91,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:4ddd59719b5045ece694c9e311e3acef3f308ea513a98aaa44a0c7d36bc2da23","observation_id":"9ae2940b-52eb-47af-af49-39142857a527","resolution":{"observed_at":"2026-07-10T00:56:41.576018Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/2822891","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Journal of the ACM","work_id":"8722782c-a30a-4868-bfb4-7a55adb1220e","year":2017},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:3825569a2b6c8cf6a553171e030533a814775176d170276a64ccbdddb468b735","observation_id":"61848839-1fd3-4cf4-a3e0-c420f9a217da","resolution":{"observed_at":"2026-07-10T00:56:40.850605Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/s0097539705446810","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"SIAM Journal on Computing","work_id":"fc342526-8d8c-4a86-a37b-31c93f2537ba","year":2006},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":93,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:0cbd33efcff07b41f79a20c1e6e8c4927382003e6efada50cf1839fee3b37035","observation_id":"a2d060dd-17e4-4a65-9db6-e308ae64f809","resolution":{"observed_at":"2026-07-10T00:56:40.868235Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.583223Z","title":null,"venue":null,"work_id":"f338527b-19ec-4801-a35d-16473b6492cc","year":null},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:84458627bee187a114cc6c2f103a330f57dbbde57e3a1c8d43f9aff813b208cc","observation_id":"9cc4e59c-c72b-4894-b6f8-c4dbf7655345","resolution":{"observed_at":"2026-07-10T00:56:41.584210Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.592383Z","title":null,"venue":null,"work_id":"2829f336-7611-444b-999b-3200e3486ed4","year":null},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":95,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:9e7ae577a32c7f464e6a37a2a4210b19e29921b24af30f44538307bf56c57d03","observation_id":"e75de631-ec81-419e-887a-b37fc10655c8","resolution":{"observed_at":"2026-07-10T00:56:41.593471Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.600877Z","title":"Dahstuhl Seminar , number=","venue":null,"work_id":"f6cffad6-9beb-4a77-8174-9cfcf5c71a8f","year":null},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":96,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:1b15ddc0a21cd5f37cda7f05fdd5e91010616030f8fc5a60b56f09a76328ee22","observation_id":"6fcb9719-329f-40b3-9324-3d595820df95","resolution":{"observed_at":"2026-07-10T00:56:41.601931Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1607.02986","last_updated":"2016-07-11T14:54:04Z","snapshot_observed_at":"2026-07-06T05:03:07.915233Z","submitted_at":"2016-07-11T14:54:04Z","title":"A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs","version":1},"cited_work":{"arxiv_id":"1607.02986","doi":null,"metadata_source":"pith","pith_arxiv_id":"1607.02986","snapshot_observed_at":"2026-07-10T00:56:41.094896Z","title":"A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs","venue":"cs.CC","work_id":"3271f997-7e15-4290-bf4e-57c9505f718d","year":2016},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":97,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"cited_paper":"/paper/1607.02986","citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:eaff93945f36d7e302b3bf150603bfbefcbfbecff520f112cffed22a4763f013","observation_id":"c3dd1f81-7b0d-4e59-ba64-4455263111d5","resolution":{"observed_at":"2026-07-10T00:56:41.096259Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.530211Z","title":"Dinur and D","venue":null,"work_id":"628b4340-be65-44ba-9858-89e2d3fef6d9","year":null},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":98,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:7e910f82ba06cd4587bd27bad5c79ae9e96217c148e2b1caab1ac35e1d6179dc","observation_id":"334fcf17-8774-42d1-8201-b386e4b31bf5","resolution":{"observed_at":"2026-07-10T00:56:41.531243Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.531778Z","title":"Lund and M","venue":null,"work_id":"ec425f54-7eb4-450b-a7ff-df943433316d","year":null},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":99,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:6a12913649123aa3d84abe7b88054804bcf39c1ba1b4bf96231537e005dfa697","observation_id":"49e1ccbe-6d1f-4baf-b2bb-7b5ddb94de93","resolution":{"observed_at":"2026-07-10T00:56:41.532821Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:56:41.476176Z","title":"47th International Colloquium on Automata, Languages, and Programming (ICALP 2020) , year=","venue":null,"work_id":"b45a9c8a-293d-4314-a14f-a66a90a7e26a","year":2020},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":100,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:9435d1aed71d9d526dee33156fc856b53796bfc97359a1f7c2c4eb8b7a0f7c32","observation_id":"20879fc2-18a3-49b6-9b0b-a2eacf3e64da","resolution":{"observed_at":"2026-07-10T00:56:41.477375Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-03T23:12:04.892414Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":2,"parse_uncertain":1,"unresolved":15,"verified_exact":23,"verified_fuzzy":59},"total_outbound_references":161},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 100 of 161 outbound references and 0 inbound Pith citation observations for arXiv:2607.06852."}