{"as_of":"2026-08-09T10:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4d8dc16ee265ea5fbd3957d0f9d778bde567d6a28b59a678cee0fe72f26d7624","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-09T06:31:02.800959+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-07T19:27:41.395116Z","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-07T19:27:41.395116Z","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:32483b3bcab250cb36a584e3263c45a6ce0da8f6a81a333f9a956cf7f4bc67eb","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-07T19:27:41.395116Z","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:5445e66a61862a8eac57a9de995b517593b3c4fc92b0b8689769ff13a79d4402","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-07T19:27:41.395116Z","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:172a161e9ce5efc20b3b388f0d26ff3d96897074640511b77ad42cb7bd617d38","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-07T19:27:41.395116Z","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:1a7ad18397b24dc4a197243dd86f3b8c104ec3fa89c44f5bdcd9c51b2e1e7ef7","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-07T19:27:41.395116Z","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:6b3d197de7adc690ca7f7ebf04cbd3d0ef4c223cf3b679eb2543180e63cf5816","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-07T19:27:41.395116Z","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:dd1f6e555c728fbb2ade048421788dd6e3659e93c89c6c960a56f4f93e95f4b6","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-07T19:27:41.395116Z","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:7d7c87f4a56e2279dd3a0bd466e91ec8299cfd0780d83f2a684f0315273f68ea","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-07T19:27:41.395116Z","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:de46165c631040c99157525fb97392b9f2fcbaf292c5e0472be7dcc2bf28c488","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-07T19:27:41.395116Z","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:cdc2458308004660444d20508e2d8edab9eb2c2fd5bce6c8eb873e21a4e9b7c4","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-07T19:27:41.395116Z","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:97d3c9f5ace28ecae468efdd0624bcfd05f8ef6ae38a2f8b5143fce2cf702fa5","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-07T19:27:41.395116Z","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:3856da35e2ba4cb6fbbe255c1c559227f843beceb1eec7ad587458ebe9f2954f","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-07T19:27:41.395116Z","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:ded28e9a64cb74d656a182862c868c3021a84b6958f8c4babf32a749ba398e22","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-07T19:27:41.395116Z","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:8c7daea762988f37dfe30891c640c89a688c253cd1731b7498bf1072437dc533","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-07T19:27:41.395116Z","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:ce7cb7b13f13c453d6e7a3af2d3150657bf84b3d21710649d6d2617c6689b3b4","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-07T19:27:41.395116Z","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:b261b09b6c20542396524d220040389ac02ec0965935b51b8c74d79d0ff4d094","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-07T19:27:41.395116Z","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:9229b0d04a46bf1a211638f1a57d0346061da3b66a90b807208335e3ff6fd42f","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-07T19:27:41.395116Z","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-07T19:27:41.395116Z","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:32483b3bcab250cb36a584e3263c45a6ce0da8f6a81a333f9a956cf7f4bc67eb","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-07T19:27:41.395116Z","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:6297c5fb7b930fe7243f84c9c4aa1440cbab4db11ea8fc05f59fc8caecf94e39","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-07T19:27:41.395116Z","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:b8554b84b88549a6cd59c9bc8e67ce2c965d1c8a8bec6e45fd0be3ddce25a7cd","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-07T19:27:41.395116Z","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:bc7a45d8d20d0375ea9dcbadbac5caaa96043203b7931c6efa18bec5d158bd42","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-07T19:27:41.395116Z","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:768361aba1c8428054895e27cefc0962952da1492cf2b5795c052d407375aeee","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-07T19:27:41.395116Z","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:251a0396923cf5f25abfd9c74ed420eacd672c947238ca5aaeea2617c2ab609a","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-07-06T05:47:56.456385Z","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-07T19:27:41.395116Z","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:746fd7ec6baaa0fe11d140b3d38dccb5f53e524b69e2626e77b305b0eae21c0f","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-07T19:27:41.395116Z","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:719145d1b53c9d3285f547a553f53ccd59866d6d18491bc8446e3e7186e4531f","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-07T19:27:41.395116Z","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:e9c068b8571e5c172e91d96fa5c68bc57e77952c0af863aa84043c7e5b903568","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-07T19:27:41.395116Z","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:81c4dde42026df8845a3487043a9cd0081107820e433a4bd8edc4c48bb35e8b5","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-07T19:27:41.395116Z","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:fb9a7812d987267961d9df834f70bf1343f33ce385850b34d2df2638b33d7794","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-07T19:27:41.395116Z","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:9aedc7464cdbb6dc13ceba2609a3a1a2a3995d6d60082660aaa415eaa7003eb7","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-07T19:27:41.395116Z","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:2bcccb4d51814473ed7b23dc994f4be0458334671b0fbc5b0c61d2dda3db855b","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-07T19:27:41.395116Z","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:21cc5587cf2d06e4be88454340ed80c4bb4b1504fe7e89eb2e958f22305f7e8e","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-07T19:27:41.395116Z","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:fe918d66d697e3b0cbf20c696aa73855862da473619d7cb203d825f524cc0145","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-07T19:27:41.395116Z","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:725605030a6402534a71e60629d22f8f438e9c587372b0107a917a5742fcfe62","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-07T19:27:41.395116Z","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:cd522d206baa58c528142120e795bc36db5aa4bd28e69ff0bceb78b4146728e8","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-07T19:27:41.395116Z","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:697daf832604e120ea8a4ab44e8eb93a3fa328fa3f5939f605a8af280cb3c9f0","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-07T19:27:41.395116Z","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:6e723eef1b1038f01a6c9b2087db46cb19025be6d75e5258dee95893c2cf112b","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-07T19:27:41.395116Z","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:18317ca9a46faa5749cf5812472cddb6366b7efdf9d8c01a62a68d8d1c73d801","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-07T19:27:41.395116Z","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:de7df6ef9d130e91a480e6c93437481fa36ea776e5b2b466695a49e5386f720a","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-07T19:27:41.395116Z","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:161f89a20b3169d88d4a1bd8f2e9e3c4a00a73d415ca922f76b8e2b8f43de135","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-07T19:27:41.395116Z","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:206e7552e90ec693a2069cf20066f21fdedcbb7cf6615186e4da797cbe91faf7","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-06T01:00:10.481127Z","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-07T19:27:41.395116Z","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:b8eb959317657fd5756f13f8d1077a7c39ad24ae92548abb1a3f238645e7a64e","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-07T19:27:41.395116Z","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:a6fa19fd31037804dc0be248fb963e90d5adfcca6cda48732739026a2e1b0b0c","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-07T19:27:41.395116Z","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:c6361c0d1813a26fd8139e3dc02ec225e551588c8c795a8e18af2404a9cfb4ce","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-07T19:27:41.395116Z","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:e4a30ce26714ed69a73929cda73694341abdee218a0556af02ed1d0d228d0d17","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-07T19:27:41.395116Z","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:397970d860aa2b4c1206c9488f488485f118e0e5cc64a2d45cdec73fb4cb29c6","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-07T19:27:41.395116Z","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:faa0b57f3fd02ba032edf67703b2ab238b47244e9b4e53880cf7e4f074d3250f","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-07T19:27:41.395116Z","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:f6c82b37fe6628fc6bcb6c3f81bfae6d973439b7d4f5c792daac5fb353debd5b","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-07T19:27:41.395116Z","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:ccf247c2b7da7d093b668d57645de6d86abbf56d48a7405b4a9e0e26984516b9","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-07T19:27:41.395116Z","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:f93077cb61ecce5f7dd81eb0859f9b0a7b64d498b1cc3e2c94483c39a6ae9246","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-07T19:27:41.395116Z","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:5220b67d4ccee3e0436aa0be16204c5666400010ac7bf38d40f0a8d4c35952c3","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-07T19:27:41.395116Z","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:90d7338edd70ccee062fa54f7eb58908f0f2eeb881cfdb3dd40ab22e3f2427f8","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-07T19:27:41.395116Z","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:d0de97cb0f2f37e2817f59539501371163f4d4674fdd192ec443cc3284fb494f","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-07T19:27:41.395116Z","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:c0f91632cafff6705c3491eed322d9b729f6b37310eea1a73a11fc60703acc34","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-07T19:27:41.395116Z","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:bd8f0cc05032c748766ef0aaf8d53611fe460114f5c23e647af91a5d51221ba5","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-07T19:27:41.395116Z","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:2ab033fc7d381962301362711bb1dd12d63e244876a270f7f95068f557e5fb55","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-07T19:27:41.395116Z","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:57347b3e8a090976f3ceef33bec28f8d86db7774f8a95c4081c7413e00920923","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-07T19:27:41.395116Z","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:f9b6d1bd3583fc513ff7c2b94b6cd0416bcaf5882a475e72a60c01ed913e3d0c","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-07T19:27:41.395116Z","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:a0598e5ded80acd013ef16ea045117471f961b6a4cb65b23587343138bb84200","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-07T19:27:41.395116Z","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:3a8e96667819462e164db062edac2e705a38759b306403a841417e7255222e0c","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-07T19:27:41.395116Z","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:78e445b804243e55002ac7933bcea5b6d55c7a2b10ce8b170c029844cc2a9171","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-07T19:27:41.395116Z","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:da54b811b49f69373d18c14b1ccb43966e91bb0bfe339a2362ba8b5d2624ee8f","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-07T19:27:41.395116Z","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:f83cb26ee1890ce2091184097181d98e619e56ab72d2038e55062f192f946e89","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-07T19:27:41.395116Z","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:795188f19203c7efdb17bb63ccecd2ecdd08732c6fd492da2936c67c4ee6e082","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-07T19:27:41.395116Z","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:5ed9700270cd318755e70034902213c37f0364a3701eb80ea7dfed386329831b","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-07T19:27:41.395116Z","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:8c3ca5c9bc25701dc0ebd8fb52b3d0fe6a2221deec480fed285283e2262e2bde","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-07T19:27:41.395116Z","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:e6800548467cc4ab57855b40786ff6b21fe3c5570c7af8642ada8520ac1dfd3f","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-07T19:27:41.395116Z","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:70396603a008faf35d93b0b56f07a113c855417c38a0551062b80eabaeb33f92","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-07T19:27:41.395116Z","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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 65 of 65 outbound references and 1 inbound Pith citation observation for arXiv:2510.24755."}