{"as_of":"2026-08-15T07:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bdce3cf304b6c67059c8bf780910080a5b25d0bf215db411b184ae3d373fc58a","coverage":[{"denominator":49,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":49,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-28T07:13:05.776275Z","state":"measured"},{"denominator":49,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":49,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+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/2606.03975/citation-record","integrity":"/paper/2606.03975/integrity","json":"/paper/2606.03975/citation-record.json","paper":"/paper/2606.03975"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T07:13:05.776275Z","title":"A full dichotomy for Holant ^ c , inspired by quantum computation","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-06-28T07:13:05.776275Z"},"links":{"citing_paper":"/paper/2606.03975"},"observation_digest":"sha256:1e13dd0647c7eca868f1cc1679c5a4e4ab0b4282f8b8bcdf801e3cfb577021d0","observation_id":"b34edc93-67c3-4733-98f6-7799c5b84b29","resolution":{"observed_at":"2026-06-28T07:13:05.776275Z","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-06-28T07:13:05.776275Z","title":null,"venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-06-28T07:13:05.776275Z"},"links":{"citing_paper":"/paper/2606.03975"},"observation_digest":"sha256:c6088f5d3db07d0a50fca7016d2863c71f8cc148e64d658afd4c9960c11e8862","observation_id":"f2bb97c3-258b-4270-8c52-39b707e6c353","resolution":{"observed_at":"2026-06-28T07:13:05.776275Z","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-06-28T07:13:05.776275Z","title":"Beyond bilinear complexity: What works and what breaks with many modes? Electron","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-06-28T07:13:05.776275Z"},"links":{"citing_paper":"/paper/2606.03975"},"observation_digest":"sha256:778e347a61a7d2d2d454872f84551fc9a9d7aaf594410ab42d36f31fad3a3075","observation_id":"1c76ab36-1b50-4776-9209-9b8c545cec24","resolution":{"observed_at":"2026-06-28T07:13:05.776275Z","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-06-28T07:13:05.776275Z","title":"Berkowitz","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-06-28T07:13:05.776275Z"},"links":{"citing_paper":"/paper/2606.03975"},"observation_digest":"sha256:77c75bf714429d59e426e8880e687a008a7db584efdc4799b0e6febc4f6d676c","observation_id":"96421902-963d-4883-b4c4-8118d6d32762","resolution":{"observed_at":"2026-06-28T07:13:05.776275Z","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-06-28T07:13:05.776275Z","title":"Bunch and John E","venue":null,"work_id":null,"year":1974},"citing_paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-06-28T07:13:05.776275Z"},"links":{"citing_paper":"/paper/2606.03975"},"observation_digest":"sha256:9aa69d474d0dd218e44f11ace37707e21eff89c69d66910ddef3ccc0c2f844d5","observation_id":"0a181a68-ffd1-4bbc-9b22-7136ff77978a","resolution":{"observed_at":"2026-06-28T07:13:05.776275Z","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-06-28T07:13:05.776275Z","title":"The complexity of partial derivatives","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-06-28T07:13:05.776275Z"},"links":{"citing_paper":"/paper/2606.03975"},"observation_digest":"sha256:c78c2b17c9b2677fb8d9c4a4abbaecf7f8a42c9f408f167d56800b78882e8901","observation_id":"690d8376-0e07-4aac-94d8-58e50fb33bfe","resolution":{"observed_at":"2026-06-28T07:13:05.776275Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.06217","last_updated":"2024-06-10T12:33:22Z","snapshot_observed_at":"2026-08-13T19:24:44.287281Z","submitted_at":"2024-06-10T12:33:22Z","title":"Completeness classes in algebraic complexity theory","version":1},"cited_work":{"arxiv_id":"2406.06217","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.06217","snapshot_observed_at":"2026-07-04T19:20:07.194246Z","title":"Completeness classes in algebraic complexity theory","venue":null,"work_id":"5cda3264-6676-480c-b3b9-7ff0282999ef","year":1987},"citing_paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-06-28T07:13:05.776275Z"},"links":{"cited_paper":"/paper/2406.06217","citing_paper":"/paper/2606.03975"},"observation_digest":"sha256:f8fc66ac3cb790ead53774a16035502e5a4f0722581712aee9dec4d77b4a56af","observation_id":"2e707104-35e2-494d-a302-2eb410de0950","resolution":{"observed_at":"2026-07-02T07:06:43.916439Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T07:13:05.776275Z","title":"Some results on matchgates and holographic algorithms","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-06-28T07:13:05.776275Z"},"links":{"citing_paper":"/paper/2606.03975"},"observation_digest":"sha256:2b03470febf1650023e7dc062e233f9c5a3e26d9441e88a1de34374d63addd18","observation_id":"462cf2b1-9555-4f2c-968c-eda473ce03cb","resolution":{"observed_at":"2026-06-28T07:13:05.776275Z","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-06-28T07:13:05.776275Z","title":"Complexity dichotomies for counting problems","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-06-28T07:13:05.776275Z"},"links":{"citing_paper":"/paper/2606.03975"},"observation_digest":"sha256:a0ab40f1bb2d0a9b83cc33512651ec136a428957c15566905d82b58ef0ff1119","observation_id":"8ee999a5-9a8d-418c-bd36-a85ff6c8bbc8","resolution":{"observed_at":"2026-06-28T07:13:05.776275Z","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-06-28T07:13:05.776275Z","title":"On the theory of matchgate computations","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-06-28T07:13:05.776275Z"},"links":{"citing_paper":"/paper/2606.03975"},"observation_digest":"sha256:931ae33e9e82eebd8e8dc1d05aa9b8c42c6e7ac5e0928039df66973ba803006e","observation_id":"cfcfeaa8-5a17-4b82-a137-82701e9de2fd","resolution":{"observed_at":"2026-06-28T07:13:05.776275Z","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-06-28T07:13:05.776275Z","title":"Holographic algorithm with matchgates is universal for planar \\# csp over boolean domain","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-06-28T07:13:05.776275Z"},"links":{"citing_paper":"/paper/2606.03975"},"observation_digest":"sha256:1b795e7c570e66ddec0e7464363afd812f9a2c257be2a9d743fd75449058cea1","observation_id":"7483abf0-ece4-405d-b2a1-f73876ff7704","resolution":{"observed_at":"2026-06-28T07:13:05.776275Z","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-06-28T07:13:05.776275Z","title":"FKT is not universal - A planar H olant dichotomy for symmetric constraints","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-06-28T07:13:05.776275Z"},"links":{"citing_paper":"/paper/2606.03975"},"observation_digest":"sha256:2eadfb7befb5525678d35e158cc7fb33b1c52bcc16df9fd0cd672f17277d161d","observation_id":"535efd1c-4862-4be4-b3f7-3b9522debe0d","resolution":{"observed_at":"2026-06-28T07:13:05.776275Z","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-06-28T07:13:05.776275Z","title":"Matchgates revisited","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-06-28T07:13:05.776275Z"},"links":{"citing_paper":"/paper/2606.03975"},"observation_digest":"sha256:4053af721333067b08d02ac452ac18af29fd76487177c5967f51dffc92b33e53","observation_id":"485a8d3c-1ad3-48f4-9fb9-73afd804d93f","resolution":{"observed_at":"2026-06-28T07:13:05.776275Z","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-06-28T07:13:05.776275Z","title":"Holographic algorithms: From art to science","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-06-28T07:13:05.776275Z"},"links":{"citing_paper":"/paper/2606.03975"},"observation_digest":"sha256:4b5084b643b4fe8bd4a5fd3e7acc6c9a5eb4167de3429d9bf46d3bbc2e9d01b0","observation_id":"b62938bf-2d58-49be-85db-38a3752a73ea","resolution":{"observed_at":"2026-06-28T07:13:05.776275Z","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-06-28T07:13:05.776275Z","title":"Werner, and Freek Witteveen","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-06-28T07:13:05.776275Z"},"links":{"citing_paper":"/paper/2606.03975"},"observation_digest":"sha256:e6cadea3cd8ee702afb7c5b97cd1d317a8f1c4a4e7b2551d4172467ff41da2c9","observation_id":"af03e140-ad8c-4579-a342-c5908fa0eeb4","resolution":{"observed_at":"2026-06-28T07:13:05.776275Z","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-06-28T07:13:05.776275Z","title":"Dichotomy for H olant\\( ^ \\( _ \\) \\) problems on the boolean domain","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-06-28T07:13:05.776275Z"},"links":{"citing_paper":"/paper/2606.03975"},"observation_digest":"sha256:05d258fbac3d10c79dee6a20955b33f69cc786549576779d30a90201da2c5ef0","observation_id":"d2c1753c-b019-4ead-9103-6001dc79b9f4","resolution":{"observed_at":"2026-06-28T07:13:05.776275Z","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-06-28T07:13:05.776275Z","title":"Parameterizing the permanent: Hardness for fixed excluded minors","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-06-28T07:13:05.776275Z"},"links":{"citing_paper":"/paper/2606.03975"},"observation_digest":"sha256:de51443d4a636a601606dc74159e5e0875f74f5313889c8d884f8d787ffb6d13","observation_id":"4738ce14-7a2f-4751-8f81-69c904c90ac4","resolution":{"observed_at":"2026-06-28T07:13:05.776275Z","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-06-28T07:13:05.776275Z","title":"Paths, trees, and flowers","venue":null,"work_id":null,"year":1965},"citing_paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-06-28T07:13:05.776275Z"},"links":{"citing_paper":"/paper/2606.03975"},"observation_digest":"sha256:57f91ea11dafa9acf58438ccb8523ca53e57767d2cbf65ae993b0cecd66df78a","observation_id":"a920e3bb-2f05-4c6f-a26b-5ef9c0637266","resolution":{"observed_at":"2026-06-28T07:13:05.776275Z","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-06-28T07:13:05.776275Z","title":"Evenbly and G","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-06-28T07:13:05.776275Z"},"links":{"citing_paper":"/paper/2606.03975"},"observation_digest":"sha256:2258de4edb086826ba36b4e1e038070a0ce17bd8809085405cd6e58839715763","observation_id":"1b0c2f29-841f-43a0-8bc5-113aa3900548","resolution":{"observed_at":"2026-06-28T07:13:05.776275Z","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-06-28T07:13:05.776275Z","title":"On the expressive power of planar perfect matching and permanents of bounded treewidth matrices","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-06-28T07:13:05.776275Z"},"links":{"citing_paper":"/paper/2606.03975"},"observation_digest":"sha256:b8e3cbd4d4cfdf17e19f1009879fce7c193b986a8899e5035776863fd457d944","observation_id":"c9bdb8a2-90b7-4eb7-b01c-b72040534177","resolution":{"observed_at":"2026-06-28T07:13:05.776275Z","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-06-28T07:13:05.776275Z","title":"Nested dissection of a regular finite element mesh","venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-06-28T07:13:05.776275Z"},"links":{"citing_paper":"/paper/2606.03975"},"observation_digest":"sha256:b7db9c3dcb695cd8cd45bb739f577d2c53567d1d6fe8f6e719beef4f6847762c","observation_id":"2ef37188-c177-4946-95ba-8e246f4fee45","resolution":{"observed_at":"2026-06-28T07:13:05.776275Z","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-06-28T07:13:05.776275Z","title":"A dichotomy for real weighted H olant problems","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-06-28T07:13:05.776275Z"},"links":{"citing_paper":"/paper/2606.03975"},"observation_digest":"sha256:5366862173333eca75a4228ec26359bf49b95e7c5e9160435c14cedb2799d39c","observation_id":"37658b49-05dc-4541-8bf1-415fb923b516","resolution":{"observed_at":"2026-06-28T07:13:05.776275Z","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-06-28T07:13:05.776275Z","title":"Towards quantum machine learning with tensor networks","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-06-28T07:13:05.776275Z"},"links":{"citing_paper":"/paper/2606.03975"},"observation_digest":"sha256:fb159770617b87928e3e2aa9e59338ea684e8a73f292d235ba5b515693880391","observation_id":"085f52e9-1671-4854-9b5e-58b32d38df84","resolution":{"observed_at":"2026-06-28T07:13:05.776275Z","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-06-28T07:13:05.776275Z","title":"On the complexity of k- SAT","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-06-28T07:13:05.776275Z"},"links":{"citing_paper":"/paper/2606.03975"},"observation_digest":"sha256:57471b3001b62729928385a2be3511d927dd80696636b268903752329fe20108","observation_id":"368d6408-8475-4129-bca1-64726be56092","resolution":{"observed_at":"2026-06-28T07:13:05.776275Z","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-06-28T07:13:05.776275Z","title":"Jaeger, D","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-06-28T07:13:05.776275Z"},"links":{"citing_paper":"/paper/2606.03975"},"observation_digest":"sha256:edcb25d8d31ff43675feae740b44ac0f85854dece2eacdd59a6e9ce8419b5493","observation_id":"43cc78dd-b1bd-47c0-8b9d-8e982bb52191","resolution":{"observed_at":"2026-06-28T07:13:05.776275Z","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-06-28T07:13:05.776275Z","title":null,"venue":null,"work_id":null,"year":1963},"citing_paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-06-28T07:13:05.776275Z"},"links":{"citing_paper":"/paper/2606.03975"},"observation_digest":"sha256:b661e613cfa7d38c0c9d7a013317eeb40ca4616212d5ea2c33eccbdc6634bbee","observation_id":"3ff180d9-d28d-4abe-8b0b-7d561a30b5f7","resolution":{"observed_at":"2026-06-28T07:13:05.776275Z","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-06-28T07:13:05.776275Z","title":"Kaltofen and Pascal Koiran","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-06-28T07:13:05.776275Z"},"links":{"citing_paper":"/paper/2606.03975"},"observation_digest":"sha256:1014b273384a631248ea75610cb2c5605b30c1b1e0df5d8e44e58666bc3dc189","observation_id":"2d4f3f26-a57d-4603-a09f-93dc0b557f10","resolution":{"observed_at":"2026-06-28T07:13:05.776275Z","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-06-28T07:13:05.776275Z","title":"Lipton, Donald J","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-06-28T07:13:05.776275Z"},"links":{"citing_paper":"/paper/2606.03975"},"observation_digest":"sha256:308858f42148d7e7f0f5d737d9f5b5fe31e8787fb6e536979f0d77028bb2f045","observation_id":"9526b08c-6f52-43a4-99e1-e05d507db4b3","resolution":{"observed_at":"2026-06-28T07:13:05.776275Z","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-06-28T07:13:05.776275Z","title":"Characterizing V aliant's algebraic complexity classes","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-06-28T07:13:05.776275Z"},"links":{"citing_paper":"/paper/2606.03975"},"observation_digest":"sha256:d48c7120da02892a433fe3ca5fa2912a79a49f4f54f18ef9d70bc78947355758","observation_id":"8da3aa17-ca88-43fa-a75c-e21f4d17198a","resolution":{"observed_at":"2026-06-28T07:13:05.776275Z","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-06-28T07:13:05.776275Z","title":"Maximum matchings in planar graphs via gaussian elimination","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-06-28T07:13:05.776275Z"},"links":{"citing_paper":"/paper/2606.03975"},"observation_digest":"sha256:3576ebde942fabdbf5fb11f8dbf6e5bfc69c93681ff0768f426bd96210673b94","observation_id":"78014962-135d-4ee8-b3bf-9cb3b15de83a","resolution":{"observed_at":"2026-06-28T07:13:05.776275Z","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-06-28T07:13:05.776275Z","title":null,"venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-06-28T07:13:05.776275Z"},"links":{"citing_paper":"/paper/2606.03975"},"observation_digest":"sha256:aa84cab3935c15006c302e2f5376bc74ce598c49b296c265f76fa7d29cc44ac7","observation_id":"75d88de4-6e82-42a6-8f38-2db47b0418fb","resolution":{"observed_at":"2026-06-28T07:13:05.776275Z","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-06-28T07:13:05.776275Z","title":null,"venue":null,"work_id":null,"year":1942},"citing_paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-06-28T07:13:05.776275Z"},"links":{"citing_paper":"/paper/2606.03975"},"observation_digest":"sha256:f72d22cbf959c069e608b5a9e6a2fd7669d8f04f3d55714a397789fb223d332e","observation_id":"43f1bf40-2ec4-4eb6-85cf-aefc327b9b04","resolution":{"observed_at":"2026-06-28T07:13:05.776275Z","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-06-28T07:13:05.776275Z","title":"A dichotomy for real boolean H olant problems","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-06-28T07:13:05.776275Z"},"links":{"citing_paper":"/paper/2606.03975"},"observation_digest":"sha256:dfd751b857c9da407484c99ee6858f77dae21cb229f7fb34048bc00fd13b2947","observation_id":"47e46a3a-304f-48c8-9c72-3304883c415c","resolution":{"observed_at":"2026-06-28T07:13:05.776275Z","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-06-28T07:13:05.776275Z","title":"Partial and total matrix multiplication","venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-06-28T07:13:05.776275Z"},"links":{"citing_paper":"/paper/2606.03975"},"observation_digest":"sha256:016f4735e9ddff0fdbf7f9a762ce8b682e6ddc43541899cb9a1a0a5030746148","observation_id":"df1f0610-f592-46fe-adb8-bed90324a184","resolution":{"observed_at":"2026-06-28T07:13:05.776275Z","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-06-28T07:13:05.776275Z","title":"Gaussian elimination is not optimal","venue":null,"work_id":null,"year":1969},"citing_paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-06-28T07:13:05.776275Z"},"links":{"citing_paper":"/paper/2606.03975"},"observation_digest":"sha256:ba85b03e4872f53485e3b2cfe33cee0e117346e6e0142873f06e9d74223a064d","observation_id":"bec4c6fd-902c-427f-9b77-f8d0f78a69eb","resolution":{"observed_at":"2026-06-28T07:13:05.776275Z","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-06-28T07:13:05.776275Z","title":null,"venue":null,"work_id":null,"year":1961},"citing_paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-06-28T07:13:05.776275Z"},"links":{"citing_paper":"/paper/2606.03975"},"observation_digest":"sha256:6c9bcdb2ba01a3b023c1e1d91a19484c9b86e130c785511724227d830de6a21e","observation_id":"57b180da-acd5-4a23-a7b6-0ae3f8ff72a1","resolution":{"observed_at":"2026-06-28T07:13:05.776275Z","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-06-28T07:13:05.776275Z","title":"Classes of arithmetic circuits capturing the complexity of computing the determinant","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-06-28T07:13:05.776275Z"},"links":{"citing_paper":"/paper/2606.03975"},"observation_digest":"sha256:2dc9da7cd503921efb79298a535d924e84863ab00c1aa55c8a584fdadd71be17","observation_id":"39c88121-9c84-4a61-8cdd-771802982f04","resolution":{"observed_at":"2026-06-28T07:13:05.776275Z","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-06-28T07:13:05.776275Z","title":null,"venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-06-28T07:13:05.776275Z"},"links":{"citing_paper":"/paper/2606.03975"},"observation_digest":"sha256:e813d989430474fad23c33a9b9a7b2240f899456452d499aa07fc16e632f2099","observation_id":"e95730a1-199a-442b-8dd6-f3e8822145f7","resolution":{"observed_at":"2026-06-28T07:13:05.776275Z","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-06-28T07:13:05.776275Z","title":null,"venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-06-28T07:13:05.776275Z"},"links":{"citing_paper":"/paper/2606.03975"},"observation_digest":"sha256:cde2fd13c5661bf8263039aa47f71579383b7f5d641512d98f1210769be91696","observation_id":"1d97279c-56e9-47c7-a440-d458a2d2d005","resolution":{"observed_at":"2026-06-28T07:13:05.776275Z","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-06-28T07:13:05.776275Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-06-28T07:13:05.776275Z"},"links":{"citing_paper":"/paper/2606.03975"},"observation_digest":"sha256:f84c4083f9006c98de29467fd8118effa765ece78d78d865441ac28b5bc2baf2","observation_id":"67d6521d-27b2-4465-88a6-30ceeaed1a94","resolution":{"observed_at":"2026-06-28T07:13:05.776275Z","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-06-28T07:13:05.776275Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-06-28T07:13:05.776275Z"},"links":{"citing_paper":"/paper/2606.03975"},"observation_digest":"sha256:693ce963e109a3c8e688ade7ed76e439c96d1cc31a5b7fe684b65e012e834ebd","observation_id":"dc63403b-5f31-44a6-ab2c-9299f4077ed0","resolution":{"observed_at":"2026-06-28T07:13:05.776275Z","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-06-28T07:13:05.776275Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-06-28T07:13:05.776275Z"},"links":{"citing_paper":"/paper/2606.03975"},"observation_digest":"sha256:6e67550ee6523e25f67e24d510d37db06d265235fef254c7ed45fc978887b365","observation_id":"933b71f8-56dd-4778-9edb-fd30c946c571","resolution":{"observed_at":"2026-06-28T07:13:05.776275Z","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-06-28T07:13:05.776275Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-06-28T07:13:05.776275Z"},"links":{"citing_paper":"/paper/2606.03975"},"observation_digest":"sha256:1f97581ebc97f4a4c73c871744e7b107bebe1f74dfff7ecad0fd70325e62f348","observation_id":"ba14c954-9435-4340-89cd-a0f701797006","resolution":{"observed_at":"2026-06-28T07:13:05.776275Z","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-06-28T07:13:05.776275Z","title":"Ryan Williams","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-06-28T07:13:05.776275Z"},"links":{"citing_paper":"/paper/2606.03975"},"observation_digest":"sha256:d7d6c3095f0163f67eae92570ed8339b96d2e0817d61ba90868687653b4cadab","observation_id":"61777bdb-64ae-4e2e-8226-ef2f6ead9821","resolution":{"observed_at":"2026-06-28T07:13:05.776275Z","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-06-28T07:13:05.776275Z","title":"Complexity: Knots, Colourings and Countings","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-06-28T07:13:05.776275Z"},"links":{"citing_paper":"/paper/2606.03975"},"observation_digest":"sha256:fee5b6284dc80c327ab092a9b0267dc2ffda15643b82845d8e1f70a40b248d21","observation_id":"f365043b-6db5-43b2-af9c-88f528a29d43","resolution":{"observed_at":"2026-06-28T07:13:05.776275Z","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-06-28T07:13:05.776275Z","title":"Determinant algorithms for random planar structures","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-06-28T07:13:05.776275Z"},"links":{"citing_paper":"/paper/2606.03975"},"observation_digest":"sha256:4ac4beef272eb2d0dde52d935dc45963ceebbb8588912bd26e42d9453a1f7299","observation_id":"8b72929e-9195-43a4-ae4f-1dee652d7997","resolution":{"observed_at":"2026-06-28T07:13:05.776275Z","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-06-28T07:13:05.776275Z","title":"Ryan Williams","venue":null,"work_id":null,"year":1965},"citing_paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-06-28T07:13:05.776275Z"},"links":{"citing_paper":"/paper/2606.03975"},"observation_digest":"sha256:5f5158987f67e3da4724410e2a568ae2e760286ca87fa8fa823849717e4a9e58","observation_id":"7fb73362-34fb-40a7-ae38-ddcfcd13544d","resolution":{"observed_at":"2026-06-28T07:13:05.776275Z","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-06-28T07:13:05.776275Z","title":"Matrix sparsification for rank and determinant computations via nested dissection","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-06-28T07:13:05.776275Z"},"links":{"citing_paper":"/paper/2606.03975"},"observation_digest":"sha256:b3767d35456c44070fa3131192ebcbc0d452ac42332ba918894f223b455b0ae0","observation_id":"7d484569-73bf-4c48-a81e-0d29dff8c0af","resolution":{"observed_at":"2026-06-28T07:13:05.776275Z","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-06-28T07:13:05.776275Z","title":"Maximum matching in graphs with an excluded minor","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-06-28T07:13:05.776275Z"},"links":{"citing_paper":"/paper/2606.03975"},"observation_digest":"sha256:c229b8a657ea15565debc9520eb9138c4b60b0ac634d042e0c404a060dccdec7","observation_id":"845abbad-2e25-4686-942c-180c05de470c","resolution":{"observed_at":"2026-06-28T07:13:05.776275Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.03975","last_updated":"2026-06-02T17:56:22Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-06T15:43:16.128248Z","submitted_at":"2026-06-02T17:56:22Z","title":"Planar Perfect Matching Counting is as Hard as Determinants"},"reference_resolution":{"displayed":49,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":48,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":49},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 49 of 49 outbound references and 0 inbound Pith citation observations for arXiv:2606.03975."}