{"as_of":"2026-08-21T16:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ed72a56a231a8ab76f2e2eab7f758a55d5f85bd5775edbf83e31afe669edb4a6","coverage":[{"denominator":53,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":53,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-08T07:41:35.559453Z","state":"measured"},{"denominator":53,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":53,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.06393/citation-record","integrity":"/paper/2607.06393/integrity","json":"/paper/2607.06393/citation-record.json","paper":"/paper/2607.06393"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611976014.5","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Quantum event learning and gentle random measurements","venue":"Society for Industrial and Applied Mathematics eBooks","work_id":"42b3d43a-7464-480b-8442-7c74509bc710","year":2020},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:3ff275a9e87316db9baa911f19b0e7f9ea2017c5af2922f7d18aaafd54ee7cc9","observation_id":"f4a7fbfd-041a-4f37-8b89-044c10b04821","resolution":{"observed_at":"2026-07-08T07:44:42.554684Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-07-10T21:18:53.505812+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-10T21:18:53.505812+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T07:44:42.842588Z","title":"Finding and counting given length cycles.Algo- rithmica, 17(3):209–223, 1997","venue":null,"work_id":"7a5a240c-0479-4d5d-bb15-2350622812ca","year":1997},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:96d8e98a63305185ca94252c4b7b3907b0ff876d6ae77b37d63de4f719493981","observation_id":"a3de1864-ba84-4c70-80f2-c09cddebf938","resolution":{"observed_at":"2026-07-08T07:44:42.845827Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T07:44:42.847135Z","title":"Quantum algorithm for tree size estimation, with applications to backtracking and 2-player games","venue":null,"work_id":"33b69996-01a0-4a3f-bed3-46ed47e0bd88","year":2017},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:6ea13fab9c5cada1bd1bf30c18e25a4eb4f30ac2445cd26eb35c8181e5e9750e","observation_id":"d1df16ed-c908-4c72-9aa0-4713f60a9a45","resolution":{"observed_at":"2026-07-08T07:44:42.849260Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T07:44:42.824331Z","title":"Completeness, approximability and exponential time results for counting prob- lems with easy decision version.Theoretical Computer Science, 915:55–73, 2022","venue":null,"work_id":"93f15068-86ec-469e-b8f0-82a3fc4d21e0","year":2022},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:797fd84987abb80e30419006544078ddb9253753340524a7a1de368ff7af0333","observation_id":"1ca128b9-c17a-4bdd-82a1-dd7724dcded8","resolution":{"observed_at":"2026-07-08T07:44:42.826433Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1611.01706","last_updated":"2016-11-05T22:55:45Z","snapshot_observed_at":"2026-08-14T21:31:48.704123Z","submitted_at":"2016-11-05T22:55:45Z","title":"Self-reducible with easy decision version counting problems admit additive error approximation. Connections to counting complexity, exponential time complexity, and circuit lower bounds","version":1},"cited_work":{"arxiv_id":"1611.01706","doi":null,"metadata_source":"pith","pith_arxiv_id":"1611.01706","snapshot_observed_at":"2026-07-08T07:44:42.588850Z","title":"Self-reducible with easy decision version counting problems admit additive error approximation. Connections to counting complexity, exponential time complexity, and circuit lower bounds","venue":"cs.CC","work_id":"090272da-8423-443a-9539-5686973264fe","year":2016},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"cited_paper":"/paper/1611.01706","citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:a768e456416eec156e4a200ea7b86a468b8e7caf4ed5eeb83f6522f12b4f9ce4","observation_id":"c9cb9e97-f157-48e4-87b8-f7b4887f5d89","resolution":{"observed_at":"2026-07-08T07:44:42.591867Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T07:44:42.850516Z","title":"Com- pleteness results for counting problems with easy decision","venue":null,"work_id":"dd778b05-47b1-41e8-b897-fb7a9ab6b4d9","year":2017},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:b67a715a7a0f3a3a587a8918d3dd025d71459ba71f2c57e0732cb2dd04655931","observation_id":"646fc64e-0c31-4df7-869e-a2e2bc368631","resolution":{"observed_at":"2026-07-08T07:44:42.852422Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T07:44:42.767730Z","title":"On the power of counting the total number of computation paths of NPTMs","venue":null,"work_id":"32ab3758-287a-410b-9f72-08f238506870","year":2024},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:f3b307ca159af4e79e70558bf1709e8a36cb29e70fdbbbd9bbae75e793890c54","observation_id":"64098247-a559-43d0-9b1a-7d62e7976853","resolution":{"observed_at":"2026-07-08T07:44:42.769481Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T07:44:42.818619Z","title":"Generating all the minimal separators of a graph.International Journal of Foundations of Computer Science, 11(03):397–403, 2000","venue":null,"work_id":"4168fe0a-aa89-4f8f-92ae-2cbcf1e69356","year":2000},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:86e219a2f372322add13e3d23d50b6c8b411d05ab753ec25a3a6e926ce34c368","observation_id":"5756535b-c79c-4a1b-bb1a-dae8e2e07784","resolution":{"observed_at":"2026-07-08T07:44:42.820642Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0005055","last_updated":"2000-05-15T18:19:59Z","snapshot_observed_at":"2026-07-07T07:03:25.387553Z","submitted_at":"2000-05-15T18:19:59Z","title":"Quantum Amplitude Amplification and Estimation","version":1},"cited_work":{"arxiv_id":"quant-ph/0005055","doi":null,"metadata_source":"pith","pith_arxiv_id":"quant-ph/0005055","snapshot_observed_at":"2026-07-09T02:35:53.621660Z","title":"Quantum Amplitude Amplification and Estimation","venue":"quant-ph","work_id":"c8922d48-1de0-498c-8b54-887d90f4834c","year":2000},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"cited_paper":"/paper/quant-ph/0005055","citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:6f312479c63b4c31eb5c5c0b03d7fa2ebbb7f986aaadd5c7a13bd715a3fe53a3","observation_id":"4d1abf9f-6737-4941-a4f7-0440e4e1e397","resolution":{"observed_at":"2026-07-08T07:44:42.585664Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T07:44:42.853301Z","title":"Finding all cliques of an undirected graph (algorithm 457).Commun","venue":null,"work_id":"1b1a0b16-6d96-4af7-a104-cb1e3b7f3912","year":1973},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:1d9cf1d18d96bb63e4ba02c20e8425e031aa756a27df09aa54814639faa7f536","observation_id":"c4bbeb0f-3e81-4a6b-9f89-41584d9580c5","resolution":{"observed_at":"2026-07-08T07:44:42.855279Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T07:44:42.831716Z","title":"The expressibility of functions on the boolean domain, with applications to counting CSPs","venue":null,"work_id":"0c098b60-8358-42e2-9df9-18c110864cdb","year":2013},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:f33fca48f03684b02c44af7a2c5a717154282dd91a1e72db7265e9db937be206","observation_id":"d3a75eb1-8c59-4ede-a78d-4ec248ebde8a","resolution":{"observed_at":"2026-07-08T07:44:42.833998Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T07:44:42.809163Z","title":"Solving and sampling with many solutions: Satisfiability and other hard problems","venue":null,"work_id":"f17de0bd-6640-46b6-a4d3-c3c30130af93","year":2018},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:6a80f18eaecd2a83ac4fb3c62fba7d9d051ab32bab70b96d2035c22e6c3f979b","observation_id":"4632a287-4b3f-44de-a8a9-04894f246208","resolution":{"observed_at":"2026-07-08T07:44:42.810952Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T07:44:42.787572Z","title":"Output-sensitive approx- imate counting via a measure-bounded hyperedge oracle, or: How asymmetry helps estimate- clique counts faster","venue":null,"work_id":"0ca05d99-6f5f-4138-a8f3-8639d33c405f","year":1985},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:2f0fbae7282e47ff4216410ccbfdeb0ddee5cd875cc2b7bf19d5995717960b1d","observation_id":"7e50019d-7c48-4182-b738-948ab2f66be3","resolution":{"observed_at":"2026-07-08T07:44:42.789546Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T07:44:42.775188Z","title":"Counting models for 2SAT and 3SAT formulae.Theoretical Computer Science, 332(1-3):265–291, 2005","venue":null,"work_id":"026fec3a-678e-43a4-9a4b-69c47163bb53","year":2005},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:de637fbdc822c4fe672b628ba495b3694b32c4bc0032736fab4240c650de6dfd","observation_id":"8f2712d5-70b9-4929-be74-23b47307aefc","resolution":{"observed_at":"2026-07-08T07:44:42.776876Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T07:44:42.784728Z","title":"Fine-grained reductions from approximate counting to deci- sion.ACM Transactions on Computation Theory (TOCT), 13(2):1–24, 2021","venue":null,"work_id":"187485b7-a8f4-483e-aa9c-95e2c0956101","year":2021},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:7b5650ce82f796bb2a44c44daa4ca2c5602e50c132643ae9e8d807411c0c3d04","observation_id":"aa954921-32f4-4600-961f-6449be5c1ebe","resolution":{"observed_at":"2026-07-08T07:44:42.786836Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T07:44:42.790297Z","title":"A random polynomial-time algorithm for ap- proximating the volume of convex bodies.Journal of the ACM (JACM), 38(1):1–17, 1991","venue":null,"work_id":"bcb36cc8-bce3-4670-83b6-2925c3232227","year":1991},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:068fdfa3abfbc36d437e4d63d7d26118e054f05ff8d03db59d3bf176dad6a6c3","observation_id":"ad9302b2-9a37-42e9-a698-b6cc22d7eff7","resolution":{"observed_at":"2026-07-08T07:44:42.792492Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T07:44:42.723264Z","title":"The relative complexity of approximate counting problems.Algorithmica, 38:471–500, 2004","venue":null,"work_id":"69a3e907-3858-4e28-8903-8731c2754e3d","year":2004},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:1e88c6459ca75add88deb9df48b405b77f6c912d2a424f3c791b610be0d9b7cb","observation_id":"f459a252-e226-407f-aa59-676bb11da5c1","resolution":{"observed_at":"2026-07-08T07:44:42.725155Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T07:44:42.803480Z","title":"Counting perfect matchings in graphs of degree 3","venue":null,"work_id":"42013661-08b9-401b-83f7-57c36aadfa2c","year":2012},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:2e73e078ee6101a1aff6dfe6c6a322bc210350068f55fe17e1c4df3da7da4035","observation_id":"478ad4c9-a4f2-48f5-972b-ba37d1a34832","resolution":{"observed_at":"2026-07-08T07:44:42.805674Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T07:44:42.764719Z","title":"Approximately countingH-colorings is #BIS-hard.SIAM Journal on Computing, 45(3):680–711, 2016","venue":null,"work_id":"7d0223d5-1b40-4186-819d-aca79fdeae9f","year":2016},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:2ff7413a68eccefcb15c2161ded621275196f97a2a52c9f8ca42e136b95b69e2","observation_id":"835729d0-933f-4d6d-8014-33bf4aea3222","resolution":{"observed_at":"2026-07-08T07:44:42.766934Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-022-01034-7","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T07:44:42.567469Z","title":null,"venue":null,"work_id":"edf96481-ceba-441f-ac8c-8365cd52e214","year":2023},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:0287a358627ae7d28be854ac86532d8634bba1cd7ee4da220e407e37e2f3ed19","observation_id":"d7c8a8c4-6fd1-4807-ae9d-3723963973a8","resolution":{"observed_at":"2026-07-08T07:44:42.570647Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-07-10T21:18:53.805583+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-10T21:18:53.805583+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1503.01203","last_updated":"2015-04-02T08:31:44Z","snapshot_observed_at":"2026-08-14T22:57:45.374875Z","submitted_at":"2015-03-04T03:05:21Z","title":"On the Number of Minimal Separators in Graphs","version":2},"cited_work":{"arxiv_id":"1503.01203","doi":null,"metadata_source":"pith","pith_arxiv_id":"1503.01203","snapshot_observed_at":"2026-07-08T07:44:42.605445Z","title":"On the Number of Minimal Separators in Graphs","venue":"cs.DS","work_id":"a19ac979-da6f-4972-8d2d-ee1da08cbed7","year":2015},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"cited_paper":"/paper/1503.01203","citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:b7aa0018d22447654f813501e158e10e6fdc23b6389947b7396cead0c78e18bd","observation_id":"f3791467-299f-4739-b638-530c884f4584","resolution":{"observed_at":"2026-07-08T07:44:42.608014Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T07:44:42.713073Z","title":"A new probabilistic algorithm for approximate model counting","venue":null,"work_id":"c36a0803-6628-456a-b1a2-5c5199ad9c2b","year":2018},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:67cdb0ae36452d66f9aec3e9756a74caba55c8505483b9abd707f3a9616111aa","observation_id":"637f39a0-4a1f-4357-a610-91513fd7375d","resolution":{"observed_at":"2026-07-08T07:44:42.714896Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T07:44:42.814696Z","title":"Approximating the partition function of the ferro- magnetic Potts model.Journal of the ACM (JACM), 59(5):1–31, 2012","venue":null,"work_id":"922172ab-8ba3-433c-a4c4-7575b003f0f4","year":2012},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:aef66fec79332f6732c4a69cfa323bee81dc4a5366e5dcd2fc932ebd2d7a9d2e","observation_id":"c1952d86-097a-48df-9b6e-5854976302ed","resolution":{"observed_at":"2026-07-08T07:44:42.817655Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T07:44:42.720584Z","title":"Approximately counting locally-optimal structures.Journal of Computer and System Sciences, 82(6):1144–1160, 2016","venue":null,"work_id":"1eb4d3f6-aaee-4641-ae3c-a6d5e8e76cd3","year":2016},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:92a8d4d1a8250fe21a4fe5568a269c693f296b876408670b9ff04139c0da5d16","observation_id":"7f32f392-7d61-4895-8d88-7566c4434c2a","resolution":{"observed_at":"2026-07-08T07:44:42.722081Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T07:44:42.729244Z","title":"Faster exponential-time algorithms for approximately counting independent sets.Theoretical Computer Science, 892:48–84, 2021","venue":null,"work_id":"d7f76466-6a3f-45ec-81be-62506a960ca6","year":2021},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:d997ecb50256a539039343b1735b420db9c681b9038de6e625ea64b240a56ca0","observation_id":"1a220158-8d54-4804-8a8f-5e9bdeebbfef","resolution":{"observed_at":"2026-07-08T07:44:42.731041Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/0406022","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"The number of maximal independent sets in triangle-free graphs.SIAM Journal on Discrete Mathematics, 6(2):284–288, 1993","venue":"SIAM Journal on Discrete Mathematics","work_id":"895c9a48-d615-419f-ab98-58a280397c7f","year":1993},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:e8538b420ff22259b028818d12b3d2520150140c98c667cb8caca2283577f0f2","observation_id":"b6d4c149-41ed-44a7-b7d8-8185bb9087b1","resolution":{"observed_at":"2026-07-08T07:44:42.558404Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-07-10T21:18:54.065668+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-10T21:18:54.065668+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T07:44:42.806511Z","title":"Fast approximation algorithms for the knapsack and sum of subset problems.Journal of the ACM (JACM), 22(4):463–468, 1975","venue":null,"work_id":"7d405e4f-6841-4312-8748-6b2262e17557","year":1975},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:98aa3d778beb5009a022e31380bb62cb4b96f654e163c2c9d07af58414fc7fd4","observation_id":"903f2de5-92be-49b9-ad8a-6ca72716f4e9","resolution":{"observed_at":"2026-07-08T07:44:42.808300Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T07:44:42.770244Z","title":"Polynomial-time approximation algorithms for the Ising model.SIAM Journal on computing, 22(5):1087–1116, 1993","venue":null,"work_id":"ef4d23c4-f259-4f17-8cf6-4b3162dfb5f0","year":1993},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:878388aac759a2fc1e037e391e26bd252a564df51636ca0e9ba19d06372e5823","observation_id":"1dda8b13-e90f-49ca-831c-cdf1862d1428","resolution":{"observed_at":"2026-07-08T07:44:42.772193Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T07:44:42.827786Z","title":"A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.Journal of the ACM (JACM), 51(4): 671–697, 2004","venue":null,"work_id":"dee51099-2229-41f6-afea-a3efc2cc3e22","year":2004},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:12c7dbf59429ec9d6ad070f2dc43303fe115a7197c0b9905f63611965940bf34","observation_id":"9884ef42-71c4-4aa1-8c24-918c51e59d73","resolution":{"observed_at":"2026-07-08T07:44:42.830673Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T07:44:42.749649Z","title":"Random generation of combinatorial structures from a uniform distribution.Theoretical computer science, 43:169–188, 1986","venue":null,"work_id":"399b6d6c-a8bb-479d-8f21-cce105c68a72","year":1986},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:129db77cc72115297ae22cc57f6253e922766696adfc8a80aca555140028cac5","observation_id":"529e21d8-c842-4d17-b0ab-9db79ad78459","resolution":{"observed_at":"2026-07-08T07:44:42.761201Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T07:44:42.796091Z","title":"Monte-Carlo algorithms for enumeration and reliability problems","venue":null,"work_id":"3914de3f-2c3a-4a8d-ac89-dcb60157dbaf","year":1983},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:2bc01595993bc0c12846b1b663536ef9211dcd9e0b4f9d3248c3123028c9ca00","observation_id":"01545b7f-624e-411a-88e5-9d305e365984","resolution":{"observed_at":"2026-07-08T07:44:42.798491Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T07:44:42.726201Z","title":"Monte-Carlo approximation algorithms for enumeration problems.Journal of algorithms, 10(3):429–448, 1989","venue":null,"work_id":"08a8966d-9cf5-4994-a405-7fa12de0b17e","year":1989},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:fc151f8413b12557953d49d5bcb7ff3bfd87eddc8be0afce53ab623ebe7f2cfe","observation_id":"e6d43962-8d10-4605-8621-129db3dfa6ff","resolution":{"observed_at":"2026-07-08T07:44:42.727904Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.00604","last_updated":"2023-10-04T00:28:07Z","snapshot_observed_at":"2026-08-16T15:19:21.358043Z","submitted_at":"2023-07-02T16:17:37Z","title":"Listing Small Minimal $s,t$-separators in FPT-Delay","version":2},"cited_work":{"arxiv_id":"2307.00604","doi":null,"metadata_source":"pith","pith_arxiv_id":"2307.00604","snapshot_observed_at":"2026-07-08T07:44:42.600024Z","title":"Listing Small Minimal $s,t$-separators in FPT-Delay","venue":"cs.DS","work_id":"8aa45f0d-3ae5-435f-bec7-742102f2e1f9","year":2023},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"cited_paper":"/paper/2307.00604","citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:ea64a7f5d23c5b29a67ccf6c47ba03fea7eb9b88e89facad38ae66642be1ae3e","observation_id":"3253192e-1ebb-4f44-812f-d0edabe32517","resolution":{"observed_at":"2026-07-08T07:44:42.602954Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T07:44:42.732076Z","title":"A fully polynomial approximation scheme for the total tardiness problem","venue":null,"work_id":"8a27b482-6684-4a34-99bb-a6ae63f23894","year":1982},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:1e57765e216121dcb7a789452341a2d38406491143e0bc041868a1ab984a32c6","observation_id":"e62c02e5-e51e-4c4d-95ed-d669252bfc51","resolution":{"observed_at":"2026-07-08T07:44:42.734345Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T07:44:42.772896Z","title":"Random walks in a convex body and an improved volume algorithm.Random structures & algorithms, 4(4):359–412, 1993","venue":null,"work_id":"0faaecca-e0cb-4620-b59e-5cca2830969c","year":1993},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:3f6445d2554b6974c1c925bada6bf6b00e06c7822cbb5133afe03747527ae782","observation_id":"3359e5e6-62f2-4014-9465-6c71b8ba760f","resolution":{"observed_at":"2026-07-08T07:44:42.774539Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T07:44:42.839433Z","title":"New algorithms for enumerating all maximal cliques","venue":null,"work_id":"4362c85a-469e-4bd3-824a-9ebe505ec01e","year":2004},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:727c45b5730c99660d2d79476aa3d7d0b0ccbe93892eea7651ae8dee32330f08","observation_id":"023a085a-b295-474d-a1f2-7187ffbe4865","resolution":{"observed_at":"2026-07-08T07:44:42.841287Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T07:44:42.821484Z","title":"Mitzenmacher and E","venue":null,"work_id":"e60b04ca-77b8-487e-9c1e-7af9164a7c52","year":null},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:706fcfa83c76d167fd7dcef22bac64b8b56b52a428d639840938c867a3eeb921","observation_id":"10691752-535c-4c5b-969f-893674a14335","resolution":{"observed_at":"2026-07-08T07:44:42.823428Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T07:44:42.746261Z","title":"URLhttps://books.google.com/books?id=E9UlDwAAQBAJ","venue":null,"work_id":"a3904c18-cbff-48f2-8fd1-fef064c3a8f3","year":null},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:974bed9cce7d5ad33436bd52d196959743b6108ce6849952e0745042c1824288","observation_id":"c39dda9c-47ea-4bab-935e-d0bd517a4ad4","resolution":{"observed_at":"2026-07-08T07:44:42.748554Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T07:44:42.782247Z","title":"On cliques in graphs.Israel journal of Mathematics, 3:23–28, 1965","venue":null,"work_id":"c3e71634-d6e0-42e1-b03a-61c93e5778d2","year":1965},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:58d46af1e46706dec6d964c5ea21d4c0ba8a540e70f142157ab514abd83af682","observation_id":"31017632-0bd5-46ca-a78c-02013ef44b9a","resolution":{"observed_at":"2026-07-08T07:44:42.783994Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T07:44:42.779627Z","title":"The complexity of counting functions with easy decision version","venue":null,"work_id":"d84f885f-0268-4174-882c-2c2beab30634","year":2006},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:c5af7656972cc550f60cf9d710a68b1a1174415395c7772d1f7073baded58d71","observation_id":"2aefa20b-b6a1-4fb8-8de3-aeccd1157b83","resolution":{"observed_at":"2026-07-08T07:44:42.781438Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.24963/ijcai.2025/297","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"New algorithms for #2-SAT and #3-SAT","venue":null,"work_id":"4754d07b-97e7-4b48-a9bb-97701cd1efe9","year":2025},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:940ad21199c084edf85ff829ed165c71972c37742a6f070dfe829361e21ff53b","observation_id":"c85a8362-e02e-47f4-bfaf-59f5ceac65bc","resolution":{"observed_at":"2026-07-08T07:44:42.565530Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-07-10T21:18:54.325792+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-10T21:18:54.325792+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T07:44:42.741801Z","title":"Exploiting independent subformulas: A faster approximation scheme for #k-SAT.Information Processing Letters, 113(9):337–344, 2013","venue":null,"work_id":"7fe50bcb-57bc-4e70-b267-721b21977ae0","year":2013},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:d3dd800dd66e253ac38d7d11744594833a7b32ba5d2bfe2dcb6cae5eb8b5cb50","observation_id":"48d355ef-47f4-4a03-8ba8-f32e124e4a9c","resolution":{"observed_at":"2026-07-08T07:44:42.743741Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T07:44:42.811774Z","title":"Approximate counting, uniform generation and rapidly mixing Markov chains.Information and Computation, 82(1):93–133, 1989","venue":null,"work_id":"10aa91d7-e1d2-40d3-a8af-4e7e4cf6f223","year":1989},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:0453fd957a1f4122938a7d3b88b939640e173933e54fbe72374c150bc47713c2","observation_id":"896bc532-d611-4133-abcf-d203df5e8a73","resolution":{"observed_at":"2026-07-08T07:44:42.813810Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T07:44:42.735350Z","title":"Spatial mixing and the connective constant: Optimal bounds.Probability Theory and Related Fields, 168(1): 153–197, 2017","venue":null,"work_id":"acd85b86-5ae2-4eaf-962a-1d37cadabec6","year":2017},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:c53e660d3e6e323b55315944c88b0694c838840f046e3c24b88e19bfc5fd43dd","observation_id":"8daa2ccd-1667-46ac-95b4-957c939ea66e","resolution":{"observed_at":"2026-07-08T07:44:42.737589Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T07:44:42.793276Z","title":"Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph.Discrete Applied Mathematics, 158(15):1660–1667, 2010","venue":null,"work_id":"15393386-bf6a-40d8-ac9a-6b1c0f63b0d2","year":2010},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:9b9667e531da627d6469af0d555b18fbc85e63b9dc768178678b86612b338718","observation_id":"b51c9cf4-9189-46aa-8928-d0926c034984","resolution":{"observed_at":"2026-07-08T07:44:42.795096Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1107.2001","last_updated":"2011-07-11T11:27:34Z","snapshot_observed_at":"2026-08-16T09:52:45.783907Z","submitted_at":"2011-07-11T11:27:34Z","title":"An Approximation Algorithm for #k-SAT","version":1},"cited_work":{"arxiv_id":"1107.2001","doi":null,"metadata_source":"pith","pith_arxiv_id":"1107.2001","snapshot_observed_at":"2026-07-08T07:44:42.595268Z","title":"An Approximation Algorithm for #k-SAT","venue":"cs.DS","work_id":"716053a0-0723-41c4-9e1d-7bdc88637e7a","year":2011},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"cited_paper":"/paper/1107.2001","citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:322a0b49c4819ae3c8ae85f3417a382e124ce75b72254c40d08f1a6d2240c2c9","observation_id":"0ab793b2-96c9-45d7-b01a-ebb32fd18730","resolution":{"observed_at":"2026-07-08T07:44:42.597486Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T07:44:42.715730Z","title":"A new algorithm for generating all the maximal independent sets.SIAM Journal on Computing, 6(3):505–517, 1977","venue":null,"work_id":"b684c028-d165-42f1-a9af-38fb6cab7374","year":1977},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:a62ea35609fe78cdc6fdf1a36a8de7425679275f01ce570686fda789c8d13488","observation_id":"357daa51-962c-4e88-8bd0-283a7d20a77d","resolution":{"observed_at":"2026-07-08T07:44:42.717246Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T07:44:42.799242Z","title":"The complexity of enumeration and reliability problems.siam Journal on Computing, 8(3):410–421","venue":null,"work_id":"442917bd-3e11-4401-875b-caaf37669d00","year":1979},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:42e444d040d702a2129f04d43466b974ae12c52fa3371bc7e1df7c99998a30af","observation_id":"c079c63b-440b-42bf-9991-6204ac2f5405","resolution":{"observed_at":"2026-07-08T07:44:42.802297Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T07:44:42.718201Z","title":"Finding, minimizing, and counting weighted sub- graphs","venue":null,"work_id":"f9ce26cb-4623-41d6-a378-f20f80d72ca7","year":2009},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:1eaab72b009646b6c97aa2b2775a496737128a57f92cf852ca0c6f369b435f48","observation_id":"47fc3d7c-f15d-4684-8b18-33e0d27c8c26","resolution":{"observed_at":"2026-07-08T07:44:42.719717Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T07:44:42.762155Z","title":"A tighter bound for counting max-weight solutions to 2SAT instances","venue":null,"work_id":"6791d25b-fb50-43e5-81d4-e8f5bde42f5b","year":2008},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:05dcf4d291e78eef4a5b8eeb9a94052701a0068472fa6b0f1b1b0a5d65a97cf6","observation_id":"91f2c234-eea8-4925-aeae-3689124910b5","resolution":{"observed_at":"2026-07-08T07:44:42.763773Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T07:44:42.777592Z","title":"carry weights in the instance","venue":null,"work_id":"7143c29b-003b-494d-8172-30e81050a75f","year":2006},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:34636dc52e8bbbd741feb333cd381f37bf1f49fb82c9bfa106cdba31d8922562","observation_id":"2dce032e-9954-4e78-84a7-30fb3bd0efc2","resolution":{"observed_at":"2026-07-08T07:44:42.779009Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T07:44:42.835600Z","title":null,"venue":null,"work_id":"e13cf7cf-3be7-4b17-8711-be0b70e8dc47","year":null},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:adb5d81550f723cb36c7f7c5cd403719b83c4bbc6bfa9f333a7ec470af9e3e34","observation_id":"2edee536-b2b8-4f4a-9999-fee2dec7e0c7","resolution":{"observed_at":"2026-07-08T07:44:42.837844Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T07:44:42.738706Z","title":"Under these worst-case assumptions, in branchiwe have n3(H)−n 3(Hi)≥4 + 2k i, n2(H)−n 2(Hi)≥E−(3 +k i)","venue":null,"work_id":"5168cedc-9825-40f0-8edf-5ac648600068","year":null},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:7ed55a3373ac8b70981d8a3892ea52dbebd61deadc15cabacc748978da6f9239","observation_id":"770e2457-458a-46d7-8b83-be0295a0a518","resolution":{"observed_at":"2026-07-08T07:44:42.740798Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions"},"reference_resolution":{"displayed":53,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":9,"verified_fuzzy":43},"total_outbound_references":53},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 53 of 53 outbound references and 0 inbound Pith citation observations for arXiv:2607.06393."}