{"as_of":"2026-08-10T08:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a559ec36efd197c17cd69fa6b21fbba28f5c4a4b372948d310e62b2ff10c5895","coverage":[{"denominator":23,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":23,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T21:32:34.984760Z","state":"measured"},{"denominator":23,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":23,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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/2509.08121/citation-record","integrity":"/paper/2509.08121/integrity","json":"/paper/2509.08121/citation-record.json","paper":"/paper/2509.08121"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T21:32:38.662236Z","title":"The computational complexity of linear optics","venue":null,"work_id":"545ac83c-6fe2-44fc-a7fb-ba0e52597ce4","year":2011},"citing_paper":{"arxiv_id":"2509.08121","last_updated":"2025-09-09T19:59:21Z","snapshot_observed_at":"2026-08-04T21:32:26.036148Z","submitted_at":"2025-09-09T19:59:21Z","title":"An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-04T21:32:32.847190Z"},"links":{"citing_paper":"/paper/2509.08121"},"observation_digest":"sha256:eda5b3ce9dfe64ad06952dd78aa18a0935a767c26087cc3b79846c6b69d7afe8","observation_id":"a5ec1d49-8082-4f08-b908-af5632576aed","resolution":{"observed_at":"2026-08-04T21:32:38.779243Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-04T21:32:38.461104Z","title":"The computational complexity of linear optics","venue":null,"work_id":"76e150b2-c44c-4374-8ae7-ba449ef31bb2","year":2011},"citing_paper":{"arxiv_id":"2509.08121","last_updated":"2025-09-09T19:59:21Z","snapshot_observed_at":"2026-08-04T21:32:26.036148Z","submitted_at":"2025-09-09T19:59:21Z","title":"An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-04T21:32:32.908939Z"},"links":{"citing_paper":"/paper/2509.08121"},"observation_digest":"sha256:db0f6017cb5ec514d668a09010ed85274d29298d7aea99986327a9eb190979c1","observation_id":"57d8fff5-4c64-467c-a427-e37291cbe934","resolution":{"observed_at":"2026-08-04T21:32:38.539982Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-04T21:32:38.208461Z","title":"Simply exponential approximation of the permanent of positive semidefinite matrices","venue":null,"work_id":"3d199075-19ad-4f2f-92cb-ffd84bc6bec6","year":2017},"citing_paper":{"arxiv_id":"2509.08121","last_updated":"2025-09-09T19:59:21Z","snapshot_observed_at":"2026-08-04T21:32:26.036148Z","submitted_at":"2025-09-09T19:59:21Z","title":"An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-04T21:32:33.027730Z"},"links":{"citing_paper":"/paper/2509.08121"},"observation_digest":"sha256:0b93bcbf72c95eddab367252ecbd233519e7a6d49f6b69dbf6e159eea68bb73b","observation_id":"af629201-b1f2-48bc-a014-566370e57919","resolution":{"observed_at":"2026-08-04T21:32:38.304438Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-04T21:32:37.955555Z","title":null,"venue":null,"work_id":"ffebd327-2358-4956-bf27-1c15be934079","year":1973},"citing_paper":{"arxiv_id":"2509.08121","last_updated":"2025-09-09T19:59:21Z","snapshot_observed_at":"2026-08-04T21:32:26.036148Z","submitted_at":"2025-09-09T19:59:21Z","title":"An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-04T21:32:33.115185Z"},"links":{"citing_paper":"/paper/2509.08121"},"observation_digest":"sha256:51976958a0c8af91fda1a5d44ea6e0453c2b19c0e6d61e7f4db654587eb91033","observation_id":"a290f529-04a7-4493-ad7e-a46ad2ee707b","resolution":{"observed_at":"2026-08-04T21:32:38.049109Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-04T21:32:37.737960Z","title":"On approximability of the permanent of psd matrices","venue":null,"work_id":"f40bc3a2-fe5d-4069-b8b8-70d1a502e895","year":2025},"citing_paper":{"arxiv_id":"2509.08121","last_updated":"2025-09-09T19:59:21Z","snapshot_observed_at":"2026-08-04T21:32:26.036148Z","submitted_at":"2025-09-09T19:59:21Z","title":"An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-04T21:32:33.195905Z"},"links":{"citing_paper":"/paper/2509.08121"},"observation_digest":"sha256:a44d7b84b5e6090fa049e10277bbdbc74203a78a8bebe0f8d62f1513deace2ca","observation_id":"e11248ea-c24c-48f2-94ff-cdd06bf3b860","resolution":{"observed_at":"2026-08-04T21:32:37.834305Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-04T21:32:37.563262Z","title":"Bounds on the permanent and some applications","venue":null,"work_id":"c55f8050-0b39-4a3c-aa04-fe07046aa810","year":2014},"citing_paper":{"arxiv_id":"2509.08121","last_updated":"2025-09-09T19:59:21Z","snapshot_observed_at":"2026-08-04T21:32:26.036148Z","submitted_at":"2025-09-09T19:59:21Z","title":"An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-04T21:32:33.265110Z"},"links":{"citing_paper":"/paper/2509.08121"},"observation_digest":"sha256:142ee2fce52a591e2a35adea47d2af9ec39b6560234b6f97d1256c20b46170f9","observation_id":"ce326ddb-cc32-41e0-88ef-b3a90a370bfd","resolution":{"observed_at":"2026-08-04T21:32:37.651677Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-04T21:32:37.282622Z","title":"Kräuter, and T.S","venue":null,"work_id":"a62cd6c3-4892-4a3e-b7e3-0836058f41c3","year":1998},"citing_paper":{"arxiv_id":"2509.08121","last_updated":"2025-09-09T19:59:21Z","snapshot_observed_at":"2026-08-04T21:32:26.036148Z","submitted_at":"2025-09-09T19:59:21Z","title":"An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-04T21:32:33.377213Z"},"links":{"citing_paper":"/paper/2509.08121"},"observation_digest":"sha256:1354dc5d6936fdb50cc86420454fd79f163cf744c09ebd0997e6859d2928ad7e","observation_id":"b2138339-7203-4ebf-8543-d2f15a263008","resolution":{"observed_at":"2026-08-04T21:32:37.408778Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-04T21:32:37.126315Z","title":"Computing monomer-dimer systems through matrix permanent","venue":null,"work_id":"35553cba-5af2-47a4-b564-3af07f9b6676","year":2008},"citing_paper":{"arxiv_id":"2509.08121","last_updated":"2025-09-09T19:59:21Z","snapshot_observed_at":"2026-08-04T21:32:26.036148Z","submitted_at":"2025-09-09T19:59:21Z","title":"An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-04T21:32:33.444719Z"},"links":{"citing_paper":"/paper/2509.08121"},"observation_digest":"sha256:d11d24de00d0b3c4fc9244c23ac2c35ab66e3bdc09bf413680cca8f2a90fd184","observation_id":"1aa81156-6ec4-4baa-8568-c6dfddecf106","resolution":{"observed_at":"2026-08-04T21:32:37.176869Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-04T21:32:37.001392Z","title":"An upper bound for the permanent of (0,1)-matrices","venue":null,"work_id":"304af43e-80cb-4c63-8666-106c21def10e","year":2004},"citing_paper":{"arxiv_id":"2509.08121","last_updated":"2025-09-09T19:59:21Z","snapshot_observed_at":"2026-08-04T21:32:26.036148Z","submitted_at":"2025-09-09T19:59:21Z","title":"An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-04T21:32:33.520253Z"},"links":{"citing_paper":"/paper/2509.08121"},"observation_digest":"sha256:6a2d8ad1ea6ec80133f5bb67f043f77526df86b06173ca0379560dc4ddac6548","observation_id":"25706eb4-f827-4d31-bd3a-b8fed1955eb5","resolution":{"observed_at":"2026-08-04T21:32:37.061242Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-04T21:32:36.894336Z","title":"Inapproximability of positive semidefinite permanents and quantum state tomography","venue":null,"work_id":"48ff5a08-67e7-4972-812b-14a3f2ed8ca6","year":2023},"citing_paper":{"arxiv_id":"2509.08121","last_updated":"2025-09-09T19:59:21Z","snapshot_observed_at":"2026-08-04T21:32:26.036148Z","submitted_at":"2025-09-09T19:59:21Z","title":"An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-04T21:32:33.690021Z"},"links":{"citing_paper":"/paper/2509.08121"},"observation_digest":"sha256:9adf65868c216ff5698b9d44fe10b4b4cfe391f5d8ed46412150806e4cf0ca8e","observation_id":"f3078c59-2dcf-4254-8abc-66ecd054add4","resolution":{"observed_at":"2026-08-04T21:32:36.978333Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-04T21:32:36.732495Z","title":"Upper bounds for permanents of ( \\ 0,\\,1\\ ) -matrices","venue":null,"work_id":"a8620c0f-abe5-41e7-bed9-d40e89c18aef","year":1963},"citing_paper":{"arxiv_id":"2509.08121","last_updated":"2025-09-09T19:59:21Z","snapshot_observed_at":"2026-08-04T21:32:26.036148Z","submitted_at":"2025-09-09T19:59:21Z","title":"An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-04T21:32:33.786622Z"},"links":{"citing_paper":"/paper/2509.08121"},"observation_digest":"sha256:78c1fc97cec67a2bcf53308e3f24570c8ad8d64195e876cd42d64c124fe2af7d","observation_id":"4ead4898-4f1f-4cfe-8549-f1e5a69ab100","resolution":{"observed_at":"2026-08-04T21:32:36.793489Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-04T21:32:36.561022Z","title":"Permanents","venue":null,"work_id":"6fa4406d-cd2d-4a16-8814-0af5a1dcb391","year":1984},"citing_paper":{"arxiv_id":"2509.08121","last_updated":"2025-09-09T19:59:21Z","snapshot_observed_at":"2026-08-04T21:32:26.036148Z","submitted_at":"2025-09-09T19:59:21Z","title":"An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-04T21:32:33.909191Z"},"links":{"citing_paper":"/paper/2509.08121"},"observation_digest":"sha256:95ca968c2c3f9d2da32de6e6f80dcb526b57852cefb38ec4b3e71ab863acf078","observation_id":"409213c2-d91f-4ab2-8e4a-d4d3829194f4","resolution":{"observed_at":"2026-08-04T21:32:36.642390Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-04T21:32:36.418983Z","title":"Permanents","venue":null,"work_id":"ea9787d9-949a-41e4-a1f6-ccaeb60267ba","year":1965},"citing_paper":{"arxiv_id":"2509.08121","last_updated":"2025-09-09T19:59:21Z","snapshot_observed_at":"2026-08-04T21:32:26.036148Z","submitted_at":"2025-09-09T19:59:21Z","title":"An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-04T21:32:34.088002Z"},"links":{"citing_paper":"/paper/2509.08121"},"observation_digest":"sha256:eb9041720848ee81c75698257eecd9ecfb668e4132c95ee6dac663462826a3d8","observation_id":"ddff1c68-d50f-4328-89de-3207531cf650","resolution":{"observed_at":"2026-08-04T21:32:36.475579Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-04T21:32:36.291417Z","title":"Inequalities for the permanent function","venue":null,"work_id":"109a4606-81f8-44df-915e-cef30bd72604","year":1962},"citing_paper":{"arxiv_id":"2509.08121","last_updated":"2025-09-09T19:59:21Z","snapshot_observed_at":"2026-08-04T21:32:26.036148Z","submitted_at":"2025-09-09T19:59:21Z","title":"An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-04T21:32:34.208267Z"},"links":{"citing_paper":"/paper/2509.08121"},"observation_digest":"sha256:0ddb98d4f7c50fb347177fb5bc2b49a0acb0198e0dedd64aa821d31e8206008d","observation_id":"3f6d609d-46d4-412f-8ba1-a06f1c101cad","resolution":{"observed_at":"2026-08-04T21:32:36.332525Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-04T21:32:36.105395Z","title":"An upper bound for permanents of nonnegative matrices","venue":null,"work_id":"65020aa3-3cb8-4fbe-b590-46afd7808b28","year":2008},"citing_paper":{"arxiv_id":"2509.08121","last_updated":"2025-09-09T19:59:21Z","snapshot_observed_at":"2026-08-04T21:32:26.036148Z","submitted_at":"2025-09-09T19:59:21Z","title":"An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-04T21:32:34.336970Z"},"links":{"citing_paper":"/paper/2509.08121"},"observation_digest":"sha256:5eda7dcd7b7329fa1508cddbb16d118b4c352bcc1b58419ae6e75329f95e31b2","observation_id":"91fb13d3-06e6-43df-9815-4a1c0f0c7355","resolution":{"observed_at":"2026-08-04T21:32:36.186060Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-04T21:32:35.948251Z","title":"A short proof of minc's conjecture","venue":null,"work_id":"32f8394c-2607-46fc-ac78-7296ce97d3d3","year":1978},"citing_paper":{"arxiv_id":"2509.08121","last_updated":"2025-09-09T19:59:21Z","snapshot_observed_at":"2026-08-04T21:32:26.036148Z","submitted_at":"2025-09-09T19:59:21Z","title":"An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-04T21:32:34.502024Z"},"links":{"citing_paper":"/paper/2509.08121"},"observation_digest":"sha256:9301b301f2e8986294bd722d231599689a75787fa8f146ac4fd779fa2b9c6ddd","observation_id":"88682cf1-cdef-4da6-938f-346bf0bdb402","resolution":{"observed_at":"2026-08-04T21:32:36.010926Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-04T21:32:35.783085Z","title":"Counting 1-factors in regular bipartite graphs","venue":null,"work_id":"28399c7e-d12d-430c-98af-c23f430b95bf","year":1998},"citing_paper":{"arxiv_id":"2509.08121","last_updated":"2025-09-09T19:59:21Z","snapshot_observed_at":"2026-08-04T21:32:26.036148Z","submitted_at":"2025-09-09T19:59:21Z","title":"An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-04T21:32:34.585862Z"},"links":{"citing_paper":"/paper/2509.08121"},"observation_digest":"sha256:0e3214ae3889d1d66f8c7075b25bfc0c2af26d2a86066f0188f4fa3148455f43","observation_id":"37673a3e-93d6-4286-96c9-9d353687f25c","resolution":{"observed_at":"2026-08-04T21:32:35.840000Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0406127","last_updated":"2004-06-18T09:32:19Z","snapshot_observed_at":"2026-07-07T07:16:20.902237Z","submitted_at":"2004-06-18T09:32:19Z","title":"Permanents in linear optical networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/0406127","snapshot_observed_at":"2026-08-04T21:32:34.648205Z","title":"Permanents in linear optical networks","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2509.08121","last_updated":"2025-09-09T19:59:21Z","snapshot_observed_at":"2026-08-04T21:32:26.036148Z","submitted_at":"2025-09-09T19:59:21Z","title":"An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-04T21:32:34.648205Z"},"links":{"cited_paper":"/paper/quant-ph/0406127","citing_paper":"/paper/2509.08121"},"observation_digest":"sha256:11e602656fd3e1fe01bb2d9a2a744f481c509d2839c637710386ff2451a211c2","observation_id":"a5f25bd1-dfb4-46c6-b030-2bcd24d537d9","resolution":{"observed_at":"2026-08-04T21:32:34.648205Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T21:32:35.603940Z","title":null,"venue":null,"work_id":"ea140e70-6cb2-4a67-a689-14e2e9eb8a1d","year":2000},"citing_paper":{"arxiv_id":"2509.08121","last_updated":"2025-09-09T19:59:21Z","snapshot_observed_at":"2026-08-04T21:32:26.036148Z","submitted_at":"2025-09-09T19:59:21Z","title":"An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-04T21:32:34.710327Z"},"links":{"citing_paper":"/paper/2509.08121"},"observation_digest":"sha256:ce7074ed188fcb8896b6522cf8823feeb3d8786b0d9c283f10565f6647154e6b","observation_id":"c179be11-a04a-43bd-9747-14db683df828","resolution":{"observed_at":"2026-08-04T21:32:35.684058Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-04T21:32:35.473462Z","title":null,"venue":null,"work_id":"76fa3b9d-ee0f-450a-95d5-2b9661ca56f3","year":2003},"citing_paper":{"arxiv_id":"2509.08121","last_updated":"2025-09-09T19:59:21Z","snapshot_observed_at":"2026-08-04T21:32:26.036148Z","submitted_at":"2025-09-09T19:59:21Z","title":"An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-04T21:32:34.772332Z"},"links":{"citing_paper":"/paper/2509.08121"},"observation_digest":"sha256:2e015742ea02b801dadf22e115bcec738d5ef4186684c310e4e30e57cbf01619","observation_id":"ada354ef-6740-4554-8de4-45e20e10edc1","resolution":{"observed_at":"2026-08-04T21:32:35.519259Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-04T21:32:35.299628Z","title":"Random point fields associated with certain fredholm determinants i: fermion, poisson and boson point processes","venue":null,"work_id":"e15d483a-4455-423a-9439-9e7e519ac849","year":2003},"citing_paper":{"arxiv_id":"2509.08121","last_updated":"2025-09-09T19:59:21Z","snapshot_observed_at":"2026-08-04T21:32:26.036148Z","submitted_at":"2025-09-09T19:59:21Z","title":"An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-04T21:32:34.837452Z"},"links":{"citing_paper":"/paper/2509.08121"},"observation_digest":"sha256:8ff798a95abdcab0aa68b8673a56e731c3e1d1aac59e7cf31ef1bb682137a068","observation_id":"aa35caeb-1f76-4bf2-8989-4c5e46e3ce65","resolution":{"observed_at":"2026-08-04T21:32:35.378135Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-04T21:32:35.170252Z","title":null,"venue":null,"work_id":"b29ec0ee-6d16-4d58-8e6c-8adf9c3f407a","year":1979},"citing_paper":{"arxiv_id":"2509.08121","last_updated":"2025-09-09T19:59:21Z","snapshot_observed_at":"2026-08-04T21:32:26.036148Z","submitted_at":"2025-09-09T19:59:21Z","title":"An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-04T21:32:34.918259Z"},"links":{"citing_paper":"/paper/2509.08121"},"observation_digest":"sha256:fe8c4e807f5b2da5763d5c4a1d08f38bde48efbc22ea890dd56abcb150f572bb","observation_id":"962bd985-ffad-41ca-874e-e69e1465d714","resolution":{"observed_at":"2026-08-04T21:32:35.238091Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-04T21:32:35.077096Z","title":"Maximizing products of linear forms, and the permanent of positive semidefinite matrices","venue":null,"work_id":"472af14b-4793-4d36-bd2d-689123bef9ce","year":2022},"citing_paper":{"arxiv_id":"2509.08121","last_updated":"2025-09-09T19:59:21Z","snapshot_observed_at":"2026-08-04T21:32:26.036148Z","submitted_at":"2025-09-09T19:59:21Z","title":"An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-04T21:32:34.984760Z"},"links":{"citing_paper":"/paper/2509.08121"},"observation_digest":"sha256:865b4b4ac532ad302de56f9dcc7df01995cbccd4989d35a1c85df435adc34e6a","observation_id":"f05e8d2a-03c2-4998-8832-e81be4ad4e72","resolution":{"observed_at":"2026-08-04T21:32:35.113937Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2509.08121","last_updated":"2025-09-09T19:59:21Z","latest_version":1,"primary_category":"cs.DM","snapshot_observed_at":"2026-08-04T21:32:26.036148Z","submitted_at":"2025-09-09T19:59:21Z","title":"An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality"},"reference_resolution":{"displayed":23,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":0,"verified_fuzzy":18},"total_outbound_references":23},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 23 of 23 outbound references and 0 inbound Pith citation observations for arXiv:2509.08121."}