{"as_of":"2026-08-12T13:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f4c19f472cafb3e6f4f7f2c70de67998de693723ca123b19b972517753d5335c","coverage":[{"denominator":65,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":65,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T09:07:15.309220Z","state":"measured"},{"denominator":66,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":66,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T09:07:06.177824Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2510.24755","snapshot_observed_at":"2026-08-04T09:07:06.177824Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:06.177824Z"},"links":{"cited_paper":"/paper/2510.24755","citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:7282d51e96761f8b47617866e058654ba7e0d1cee5847f132f62b3abd17faaf6","observation_id":"65a13350-7456-487a-b3f8-502771b24362","resolution":{"observed_at":"2026-08-04T09:07:06.177824Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2510.24755/citation-record","integrity":"/paper/2510.24755/integrity","json":"/paper/2510.24755/citation-record.json","paper":"/paper/2510.24755"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:06.397501Z","title":"To do so: First, draw a sampleIofnindices from the uniform dis- tribution","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:06.397501Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:effa55ed8297bd3815c63ce129576ec6b9a22a487cc0c3e6a29c73d6f821026b","observation_id":"cb75ec58-60ca-4083-93ea-3830e2e7ced2","resolution":{"observed_at":"2026-08-04T09:07:06.397501Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:06.574588Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:06.574588Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:caeece1b514fab9564fcc1b9ea7797c06cfcfb76bba890cbd004624924e6e70c","observation_id":"615755ea-5ca8-44a5-890b-6d5cd1a816b1","resolution":{"observed_at":"2026-08-04T09:07:06.574588Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:06.679651Z","title":"We callythe sketch vector and it contains an em- pirical estimation ofgeneralized momentsof the dis- tributionπ","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:06.679651Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:4c00fc17e033bdec7fe598df35b25ca50841ee793d37ff5b03e1a9af1956bbe4","observation_id":"9852f9b4-a139-43ac-9add-51070faddcd2","resolution":{"observed_at":"2026-08-04T09:07:06.679651Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:06.754391Z","title":"The decoding procedure is taken from com- pressive sensinggreedy methods(Matching pur- suit, Orthogonal Matching Pursuit","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:06.754391Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:43dddfa61d7c0b084f4fee0c57a28e7dc9a539428087cab217c71f0174d76dcd","observation_id":"94b73e48-9ee0-4182-8059-2f25b77569c1","resolution":{"observed_at":"2026-08-04T09:07:06.754391Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:06.841402Z","title":"The Monte-Carlo method [17] can be used to approx- imate generalized moments similar to the one from [16]","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:06.841402Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:42e5ba66f6c16cfcc511e1576616ff92a8810ce23e59a8023fe1de0a8d0c4ebe","observation_id":"b2d556eb-1293-4fa5-9112-a7207c43a0cd","resolution":{"observed_at":"2026-08-04T09:07:06.841402Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:07.634844Z","title":"Kadowaki and H","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:07.634844Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:310a0ea8e6f0de73edd095d11b43eaf4c44219769dd62007744dcdc264439b0a","observation_id":"b01e9319-413d-4d72-83cf-96a83860dee5","resolution":{"observed_at":"2026-08-04T09:07:07.634844Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:06.946523Z","title":"Robbins and S","venue":null,"work_id":null,"year":1951},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:06.946523Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:50a125556c131c9adaf0251bad2a635ff4bd9f78156eb3054dac97c104f6a6d8","observation_id":"6489ca23-6080-4712-85fe-79a386f7b871","resolution":{"observed_at":"2026-08-04T09:07:06.946523Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:07.026895Z","title":null,"venue":null,"work_id":null,"year":1965},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:07.026895Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:c6f68f058a12f23545654ab8731d481281d6e323ff00874f0dee617154046b25","observation_id":"1974aa21-b8de-4e44-96bb-536c05b67d71","resolution":{"observed_at":"2026-08-04T09:07:07.026895Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:07.114699Z","title":null,"venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:07.114699Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:bbcb7a2e1c697962abee1915b67e1da52b5508791ee5eadc05396f82f275b5eb","observation_id":"e20593a9-9824-490f-af8c-9506eb2dc0cf","resolution":{"observed_at":"2026-08-04T09:07:07.114699Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:07.243036Z","title":"Lucas, Frontiers in Physics2(2014), 10.3389/fphy.2014.00005, arXiv:1302.5843 [cond-mat]","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:07.243036Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:720956840a960bfbeada93bd9fb80437aaa9835440fa8ea65604f0c6762c682e","observation_id":"c9c7af06-325d-4baf-a99b-726f1a161a4e","resolution":{"observed_at":"2026-08-04T09:07:07.243036Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:07.418134Z","title":"Kirkpatrick, C","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:07.418134Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:29d7561fb320146a36a362d465bb997bcbfeefae666ce472364e5df230f439a2","observation_id":"9e1e842d-ab35-4293-b5ad-25451492285c","resolution":{"observed_at":"2026-08-04T09:07:07.418134Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:08.442122Z","title":"Candes, J","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:08.442122Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:8ce975c1458f980dcd8bd153b399cd703ceed0f426793ecc5b6aed189c8a69d7","observation_id":"dda4b296-1f36-46c8-8fab-ad56e74b091b","resolution":{"observed_at":"2026-08-04T09:07:08.442122Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1006.1696","last_updated":"2010-06-09T03:20:15Z","snapshot_observed_at":"2026-08-05T01:48:17.182220Z","submitted_at":"2010-06-09T03:20:15Z","title":"Quantum annealing: An introduction and new developments","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1006.1696","snapshot_observed_at":"2026-08-04T09:07:07.782325Z","title":"Quantum annealing: An introduction and new developments,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:07.782325Z"},"links":{"cited_paper":"/paper/1006.1696","citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:a193f973fee71c60daa001c85d6ee53d66f9dfce93e0fa116a21978aef22d1f1","observation_id":"65b27cd6-7de1-43bb-ba5c-10084a66e885","resolution":{"observed_at":"2026-08-04T09:07:07.782325Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:07.854744Z","title":"Bellman, Bulletin of the American Mathematical So- ciety60, 503 (1954)","venue":null,"work_id":null,"year":1954},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:07.854744Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:c7487c0460b6809a61fcea8425252259d92928bbbf5c8c07ab043cb974c0dfa6","observation_id":"c5844182-9179-478d-86df-e48d17277107","resolution":{"observed_at":"2026-08-04T09:07:07.854744Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:08.015905Z","title":"Barahona, Journal of Physics A: Mathematical and General15, 3241 (1982)","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:08.015905Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:10dc43956c717592696b854c779fd6773a2d69de27cf6dbcd70945f872a333ac","observation_id":"d5b55a29-2a3d-44ec-a7cc-622589bfb61f","resolution":{"observed_at":"2026-08-04T09:07:08.015905Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2510.24755","snapshot_observed_at":"2026-08-04T09:07:06.177824Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:06.177824Z"},"links":{"cited_paper":"/paper/2510.24755","citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:7282d51e96761f8b47617866e058654ba7e0d1cee5847f132f62b3abd17faaf6","observation_id":"65a13350-7456-487a-b3f8-502771b24362","resolution":{"observed_at":"2026-08-04T09:07:06.177824Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:08.176184Z","title":"Schuch and J","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:08.176184Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:b54cee749d4d12255de10b05abe58721babc5cbae411d926a44d3079114e8433","observation_id":"34c295db-3179-48a8-bcbc-ef712329988a","resolution":{"observed_at":"2026-08-04T09:07:08.176184Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:08.292506Z","title":"Delahaye, S","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:08.292506Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:4c11a6f6be1026e26207815e7a32512acd6db0134c0948e407619622350bfca9","observation_id":"095cef9b-ee0f-41bb-9aa4-1ef0eeb032e1","resolution":{"observed_at":"2026-08-04T09:07:08.292506Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:08.565376Z","title":"Donoho, IEEE Transactions on Information Theory 52, 1289 (2006)","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:08.565376Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:5bfd3d9e8db40010d24280cbd8d455c2904af017ede72c5812e816776745ce46","observation_id":"962f6e91-2863-4faf-b417-2dd750cbee50","resolution":{"observed_at":"2026-08-04T09:07:08.565376Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:08.726027Z","title":"Baraniuk, M","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:08.726027Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:07b9b04b69699e3d910f08008067fe3a870f18a32e833667115b830d3b43fe58","observation_id":"3dbde2b5-065b-47bc-96a5-262b59034af4","resolution":{"observed_at":"2026-08-04T09:07:08.726027Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:08.842069Z","title":"Foucart and H","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:08.842069Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:6b02e7cd9b5eb017fa822125c2d99df906708c17017d1cc268d7016f5e5075b6","observation_id":"e6736e18-4375-4c0c-880a-8642c774ffbe","resolution":{"observed_at":"2026-08-04T09:07:08.842069Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1706.07180","last_updated":"2021-06-22T08:26:13Z","snapshot_observed_at":"2026-08-11T09:04:16.928281Z","submitted_at":"2017-06-22T06:59:19Z","title":"Compressive Statistical Learning with Random Feature Moments","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.07180","snapshot_observed_at":"2026-08-04T09:07:08.972403Z","title":"Compressive Statistical Learning with Random Feature Moments,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:08.972403Z"},"links":{"cited_paper":"/paper/1706.07180","citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:1e91679d9258fd1bd25a1e302df4f499364447bc2458ab50898dcc0a82a5cd00","observation_id":"89fed322-2439-4695-9c85-4ffe98bce073","resolution":{"observed_at":"2026-08-04T09:07:08.972403Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:09.144607Z","title":"Metropolis and S","venue":null,"work_id":null,"year":1949},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:09.144607Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:f956263b81b83d0a6c458ec9fa47914984b7a74b7a5ac62ec8557733b58ddd1c","observation_id":"dae637f1-4415-4f45-93a7-d66e077aab8f","resolution":{"observed_at":"2026-08-04T09:07:09.144607Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:09.286884Z","title":"Metropolis, A","venue":null,"work_id":null,"year":1953},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:09.286884Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:584ce179bbb951e0563a797ba47d044f1368cdb63d35cb7b16998ce5f4949a1d","observation_id":"cd76f9fa-4b43-4d59-aeca-d6cfbf35885f","resolution":{"observed_at":"2026-08-04T09:07:09.286884Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:09.381231Z","title":"Xiang, D","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:09.381231Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:e3b88db9dd1ad129fa3fa0a56a2fbd75011b0c47cdb831a08d014f781281361a","observation_id":"c3a637ad-9810-432e-a7ca-d5ab164a7dc0","resolution":{"observed_at":"2026-08-04T09:07:09.381231Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:09.545612Z","title":"Tsallis, Journal of Statistical Physics52, 479 (1988)","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:09.545612Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:00723751fbe22b5217dd402f14bf3cd9847152b6a8b03e04b7f511471a739659","observation_id":"806f7025-051c-47bb-82fc-6ed624e98d07","resolution":{"observed_at":"2026-08-04T09:07:09.545612Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:09.669552Z","title":"Tsallis and D","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:09.669552Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:72816df7ecf4cfa1be810ef75f4790baee8b2e7d4bbe297fd95ff9881e0f2110","observation_id":"356900e1-0aa5-414a-8fa4-897fa43c294b","resolution":{"observed_at":"2026-08-04T09:07:09.669552Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:09.811316Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:09.811316Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:d750d50fe15899e740f67e9012d33c484973173756106cee12984d6c70c4c364","observation_id":"63864ef7-4e9f-4765-b2ce-d575e34fc00d","resolution":{"observed_at":"2026-08-04T09:07:09.811316Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:09.943984Z","title":"Chevalier, W","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:09.943984Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:ae81035779cb90f884922eff551164d8f2f73cd29f92eff5a3e40f9b3b711dab","observation_id":"d180fb7c-2f85-468a-834f-8bf5ec7e6968","resolution":{"observed_at":"2026-08-04T09:07:09.943984Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:10.112886Z","title":null,"venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:10.112886Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:974032bdce312d92c1e5b389ee3487a8d7e0d9127e9b36f4224d2c1d38bb9bdd","observation_id":"377bf80f-0dac-4a15-b1c5-34b5905072a9","resolution":{"observed_at":"2026-08-04T09:07:10.112886Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:10.242288Z","title":null,"venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:10.242288Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:7728980ae54dd20ebca91273cd16aa5b5975b1ff997ddce1040e142f313d1799","observation_id":"ed76c287-7c87-4c43-b94e-c44ccd2d6fea","resolution":{"observed_at":"2026-08-04T09:07:10.242288Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:10.372425Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:10.372425Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:f3e0ebdb7b220ee1587ed3756269f04445e0b5411e8aea2405b04643064c0422","observation_id":"930cf4f3-f645-498a-a545-32cf37563b5f","resolution":{"observed_at":"2026-08-04T09:07:10.372425Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0502072","last_updated":"2005-02-21T10:19:21Z","snapshot_observed_at":"2026-07-07T07:18:23.115345Z","submitted_at":"2005-02-12T15:14:11Z","title":"NP-complete Problems and Physical Reality","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/0502072","snapshot_observed_at":"2026-08-04T09:07:10.541512Z","title":"NP-complete Problems and Physical Re- ality,","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:10.541512Z"},"links":{"cited_paper":"/paper/quant-ph/0502072","citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:60a059d01acdeea46297028f67cb85051db12a60bfd4aeaea9a938922ddabd2e","observation_id":"96db1fe8-a319-4573-a1cf-6bea80796009","resolution":{"observed_at":"2026-08-04T09:07:10.541512Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0001106","last_updated":"2000-01-28T22:12:03Z","snapshot_observed_at":"2026-07-07T07:02:58.841967Z","submitted_at":"2000-01-28T22:12:03Z","title":"Quantum Computation by Adiabatic Evolution","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/0001106","snapshot_observed_at":"2026-08-04T09:07:10.721070Z","title":"Quantum Computation by Adiabatic Evolution,","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:10.721070Z"},"links":{"cited_paper":"/paper/quant-ph/0001106","citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:c9a71bcc197c8efdcb22d399700f3aaf31dcd1eac3fecd645d979ad9372705ed","observation_id":"ed586deb-d9da-4f4a-9a99-23af49b98047","resolution":{"observed_at":"2026-08-04T09:07:10.721070Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1411.4028","last_updated":"2014-11-14T19:57:57Z","snapshot_observed_at":"2026-07-06T04:00:38.324755Z","submitted_at":"2014-11-14T19:57:57Z","title":"A Quantum Approximate Optimization Algorithm","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1411.4028","snapshot_observed_at":"2026-08-04T09:07:10.864431Z","title":"A Quan- tum Approximate Optimization Algorithm,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:10.864431Z"},"links":{"cited_paper":"/paper/1411.4028","citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:da6c0725967eb5b805edbb00cb5e51420c5b5bf6adf2d611bbf23c14e5e0d3fa","observation_id":"490f8bf3-4ba9-4222-a613-3627d3ac06df","resolution":{"observed_at":"2026-08-04T09:07:10.864431Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:10.997552Z","title":"Zhou, S.-T","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:10.997552Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:95c533ff2ee01d1ed15df120a9f3812db64dcd6cdedc43033f8c32fb8a8b59a0","observation_id":"56220648-fc78-46da-930d-bce14f6bd075","resolution":{"observed_at":"2026-08-04T09:07:10.997552Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:11.121023Z","title":"Park and N","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:11.121023Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:9ad10908f6230f804f5a66051317c674247d3602fb94a51f37d0886b97e65388","observation_id":"d969b213-8248-480f-a7b6-d9361c244726","resolution":{"observed_at":"2026-08-04T09:07:11.121023Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:11.251634Z","title":"McArdle, T","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:11.251634Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:b5a90beb5917292a5dcbf11ebcbf0064b6d59749f440633cc5ca562a2764c525","observation_id":"eec04d3e-ed30-47c6-bd38-0111c6cd0f51","resolution":{"observed_at":"2026-08-04T09:07:11.251634Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.11962","last_updated":"2023-09-21T22:10:31Z","snapshot_observed_at":"2026-08-12T06:50:51.401722Z","submitted_at":"2023-03-21T15:50:06Z","title":"Dissipative ground state preparation and the Dissipative Quantum Eigensolver","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.11962","snapshot_observed_at":"2026-08-04T09:07:11.401314Z","title":"Dissipative ground state preparation and the Dissipative Quantum Eigensolver,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:11.401314Z"},"links":{"cited_paper":"/paper/2303.11962","citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:45f4d0ff4443f3a270899bca1ac7b4ef602dede290fb3cefda0aa58e16807b49","observation_id":"1f93f7a7-7884-44c3-9ee3-5dbe5109e738","resolution":{"observed_at":"2026-08-04T09:07:11.401314Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:11.578036Z","title":"Rapid quantum ground state preparation via dissipative dynamics,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:11.578036Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:01da7d7f00f67df3f44b3495584c7ee85f3f09d4b705e4e90ef5a15c01e80d1e","observation_id":"50c1ad60-55f7-4238-b468-715492465b18","resolution":{"observed_at":"2026-08-04T09:07:11.578036Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:11.793974Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:11.793974Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:95d88beec443980b0e390ff8a570051ccdd4042e6fe9372f86627a6395cd8a99","observation_id":"c7c3caa6-c536-4b05-8bbd-98909f92517a","resolution":{"observed_at":"2026-08-04T09:07:11.793974Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:11.943229Z","title":"The probability in that string to find 001 after 00 is given by 1 L","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:11.943229Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:26c6ae8819fbc06d046190e57c27c71e59ec02ff4860f7626b8f406b6d0b76d0","observation_id":"6098c1f0-4d3e-44e4-b18b-3cd9aa0e4799","resolution":{"observed_at":"2026-08-04T09:07:11.943229Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:12.120278Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:12.120278Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:f1ac94fffeba03c48aa68f342d3383aa82309ceed6c4e060f27555c439355dc0","observation_id":"9d49da65-6095-4b5a-b785-64c855ef5b40","resolution":{"observed_at":"2026-08-04T09:07:12.120278Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:12.234170Z","title":"We want to count all the strings of a given lengthNwhich contains at least one ‘001‘ substring","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:12.234170Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:7745906d406b24f5a9afe6a8d189d47c4c4e41aa854921fe1dd090142acfcfdc","observation_id":"d1bfa091-b061-4633-bd65-34789cf9f4d8","resolution":{"observed_at":"2026-08-04T09:07:12.234170Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:12.384433Z","title":"Because form∈S N , ifmend by ‘00‘ the othersN−2 bits are free and should contains ‘001‘ a single time","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:12.384433Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:80d3d2a9c31dea964ed1ddb1288fadac9bbdd31f4bed43ffdef081c1a1986ac7","observation_id":"88e68c96-0b6b-4c76-9bc1-ef18748db834","resolution":{"observed_at":"2026-08-04T09:07:12.384433Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:12.508613Z","title":"Because the last 3 bits are fixed to ‘001‘ the remainingN−2 bits are free and should not contain any ‘001‘","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:12.508613Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:fc15227283ae682bc082ebcfe48600d53481a14adf06beff70e70918945a50cb","observation_id":"a0789616-65d8-41c5-910b-72dc38157af6","resolution":{"observed_at":"2026-08-04T09:07:12.508613Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:12.637824Z","title":"The goal is to compute the its cardinalityz L = #ZL","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:12.637824Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:09c600647f3d8e9d1fbfb009d3275731a18bf6d8cc555d5e543234d1deaebfe1","observation_id":"f24f874d-6817-41bf-98b1-6fc29e920f81","resolution":{"observed_at":"2026-08-04T09:07:12.637824Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:12.802983Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:12.802983Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:3737e808a380a82ee5bc3d8d80b56f6840aff6855634fc6263740bf43fb7ee55","observation_id":"45449145-0c44-4d3e-8bfe-430333138af4","resolution":{"observed_at":"2026-08-04T09:07:12.802983Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:12.926643Z","title":"Case 2: Assume we have two zeros starting in positionN−1 so we have two 00 substrings in total","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:12.926643Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:9361cfc1a258247178d12ccfc0de3a69574a97b914ca2e881d66d5e2831f1d3f","observation_id":"6b436cb3-8075-4a76-a2e2-911b88dc1d2d","resolution":{"observed_at":"2026-08-04T09:07:12.926643Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:13.103973Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:13.103973Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:2d29f7f5556c5983f027cde974637d3d2fe624240ae7ae67f6a56e40608440e3","observation_id":"4df7395a-961c-45bd-bea7-4c61a0771a73","resolution":{"observed_at":"2026-08-04T09:07:13.103973Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:13.235586Z","title":"Case 1: Assume we haveL−1 zeros in positionsk−Ltok−1 so we have exactlyLsubstrings equals 00","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:13.235586Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:3bd2233f87aafbc6dd845c948fd3e5bb58867e346c5709e2bead06ae0d4bded4","observation_id":"0172a448-fe51-4234-811b-38eb65999715","resolution":{"observed_at":"2026-08-04T09:07:13.235586Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:13.366568Z","title":"0| {z } L−1 001·w 2 where: •w 1 ∈A ∗ k−L •w 2 ∈A N−(k+2) So the number of all such stringssisa ∗ k−LaN−(k+2) =f k−L+1fN−k","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:13.366568Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:7482ae7fa2a8bc894dc66c674b3f499482d139ccd885c5230979b2b9dd16e54d","observation_id":"814eedd4-da5b-47aa-9444-0e8aa3dcb73c","resolution":{"observed_at":"2026-08-04T09:07:13.366568Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:13.509123Z","title":"0| {z } L where: 20 •w 1 ∈A ∗ k−1 •w 2 ∈A ∗ N−L−k−2 So the number of all such stringssisa ∗ k−1a∗ N−L−k−2 =f kfN−L−k−1","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:13.509123Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:aad3a53ad1ae10ec8ee512feef0b460a02b4ee5a16038c3efe5f4a725cda59ce","observation_id":"695d1308-0225-4e74-a7b0-5cd2ec98dd45","resolution":{"observed_at":"2026-08-04T09:07:13.509123Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:13.629809Z","title":"|{z} k−L","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:13.629809Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:a4392107f60d989ce863ba07df410d02caa186a8cb3e6a1ebf7fe99a13f7ff99","observation_id":"c64c5b0e-213e-4dc7-87f0-40b75a6d69df","resolution":{"observed_at":"2026-08-04T09:07:13.629809Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:13.785709Z","title":"|{z} k−L","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:13.785709Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:f300b84c24d05c070ebd0daf7d40ad09bd7cc1fb0941153b6c44f44fbc6a76ac","observation_id":"26442288-d7f6-42b5-a461-e6e6312a0184","resolution":{"observed_at":"2026-08-04T09:07:13.785709Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:13.956506Z","title":"| {z } k−L 00 ↑ k","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:13.956506Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:fc78cd6b0fe354e4e5052568e31e6a8e11841b81bcbe3989014d6296980c6f2e","observation_id":"9f96fafc-1ab3-4064-8155-c63f4315c62f","resolution":{"observed_at":"2026-08-04T09:07:13.956506Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:14.079171Z","title":"| {z } k−1 0 ↑ k","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:14.079171Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:305bfd43e680167aefe1f1d385d8f6d0dbda78670a0530e7394bc71103ad7aa6","observation_id":"7cd9eaa1-2027-49fe-80d5-78d7e9659ea3","resolution":{"observed_at":"2026-08-04T09:07:14.079171Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:14.221058Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:14.221058Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:f1d5c41b468f7070269f813324c1a3922a02742accc3d7ebf5e5bb2ec7788b9e","observation_id":"e4fc54db-43ba-4e03-ba69-6fae71afe8e2","resolution":{"observed_at":"2026-08-04T09:07:14.221058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:14.370013Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:14.370013Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:2b5ad4b9d440721bebf7f13a7bc07b840f2bff276881275fd683b218f8c7b4ca","observation_id":"2d881bcb-b53b-4e91-92b0-77c3005561aa","resolution":{"observed_at":"2026-08-04T09:07:14.370013Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:14.531611Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:14.531611Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:c0178870e7bc2b650c4ddf5d7875f19dc188dbb984fa56f6a204e56d2e684d98","observation_id":"c7c53f1e-f6b4-4737-ac1d-9a027c749683","resolution":{"observed_at":"2026-08-04T09:07:14.531611Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:14.669914Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:14.669914Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:bdc90bacbc122d8fde964bd7461cc7104379ad9f708598fcc3cb71735a6852e4","observation_id":"2ad9bc46-fbb4-4c26-87e4-f1a0b08be809","resolution":{"observed_at":"2026-08-04T09:07:14.669914Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:14.842125Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:14.842125Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:fbf1b2b0f98e95c423df1c923aba789e03fb982c3a3a2b86cac4628171460b8b","observation_id":"45b69e25-82f8-4802-b58c-4182340c411e","resolution":{"observed_at":"2026-08-04T09:07:14.842125Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:15.019951Z","title":"∥FN (a)−F N (b)∥2 2 =FN (a)·F N (a) +F N (b)·F N (b)−2F N (a)·F N (b) Thus, we will analyzeF N (a)·F N (b)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:15.019951Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:793a85c728ba3b69652c779e97929aaf69b76bb6a18b122260a25cdc901c92ea","observation_id":"0a3c6791-b612-42ab-8606-435b8c92ce26","resolution":{"observed_at":"2026-08-04T09:07:15.019951Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:15.139090Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:15.139090Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:c7a793aa7a5ee2b5b0fa76e6501c39410c43dc9999176c2ace79a093782ba7b4","observation_id":"1f14b378-9fc3-4d36-b5e0-e314818cfd70","resolution":{"observed_at":"2026-08-04T09:07:15.139090Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:07:15.309220Z","title":"The 2N+1 length vector indicating the position of (N+ 1)-bit strings which start fromacan be written asa⊗1 2N−k+1 , since there are 2 N+1−k strings like that","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization","version":2},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-04T09:07:15.309220Z"},"links":{"citing_paper":"/paper/2510.24755"},"observation_digest":"sha256:40f2895a35729195707f677fed00ec500ff2f646865430425aaaf374399c4b32","observation_id":"480d2d5b-708c-4a71-b5f8-5545a91e766b","resolution":{"observed_at":"2026-08-04T09:07:15.309220Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2510.24755","last_updated":"2026-07-01T09:30:54Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-12T06:24:33.189819Z","submitted_at":"2025-10-20T10:38:53Z","title":"A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization"},"reference_resolution":{"displayed":65,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":65,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":65},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 65 of 65 outbound references and 1 inbound Pith citation observation for arXiv:2510.24755."}