Pith. sign in

Paper Citation Record · LEDGER

An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality

As of 9 August 2026, this Paper Citation Record lists 23 of 23 outbound references and 0 inbound Pith citation observations for arXiv:2509.08121.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2509.08121 v1

Coverage vector

measured 23 of 23 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-04T21:32:34.984760Z

measured 23 of 23 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-09T06:31:02.800959+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

23 of 23 outbound references displayed

  • verified exact0
  • verified fuzzy18
  • unresolved5
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation a5ec1d49-8082-4f08-b908-af5632576aed · outbound

This paper cites The computational complexity of linear optics.

An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality The computational complexity of linear optics

Reference 1

Resolution
verified fuzzy
raw_fallback, observed 2026-08-04T21:32:38.779243Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-04T21:32:32.847190Z digest=sha256:88eefb4da352c7b6af1273758cf61e2e75601c92933187f7c4cc673b972cb471

Observation 57d8fff5-4c64-467c-a427-e37291cbe934 · outbound

This paper cites The computational complexity of linear optics.

An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality The computational complexity of linear optics

Reference 2

Resolution
verified fuzzy
raw_fallback, observed 2026-08-04T21:32:38.539982Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-04T21:32:32.908939Z digest=sha256:6ab01845d1efcdf5b04d5a050f9025914fbf904a7dbb6bb32354700cf5f66927

Observation af629201-b1f2-48bc-a014-566370e57919 · outbound

This paper cites Simply exponential approximation of the permanent of positive semidefinite matrices.

An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality Simply exponential approximation of the permanent of positive semidefinite matrices

Reference 3

Resolution
verified fuzzy
raw_fallback, observed 2026-08-04T21:32:38.304438Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-04T21:32:33.027730Z digest=sha256:62a215f2ece51241c44ac5da86e32e555ade5df72096147a01733f95ad6d41e5

Observation a290f529-04a7-4493-ad7e-a46ad2ee707b · outbound

This paper cites an unresolved cited work.

An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality Unresolved cited work

Reference 4

Resolution
unresolved
raw_fallback, observed 2026-08-04T21:32:38.049109Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-04T21:32:33.115185Z digest=sha256:9c6bd27c9c375e2549022a38571deaed332e232278e3c3d81b405d3a4808bec8

Observation e11248ea-c24c-48f2-94ff-cdd06bf3b860 · outbound

This paper cites On approximability of the permanent of psd matrices.

An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality On approximability of the permanent of psd matrices

Reference 5

Resolution
verified fuzzy
raw_fallback, observed 2026-08-04T21:32:37.834305Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-04T21:32:33.195905Z digest=sha256:60c2b81bf9f5ce21e28212ff849cb1d4f8cf940b323924087cf5cc7f54c0a063

Observation ce326ddb-cc32-41e0-88ef-b3a90a370bfd · outbound

This paper cites Bounds on the permanent and some applications.

An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality Bounds on the permanent and some applications

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-08-04T21:32:37.651677Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-04T21:32:33.265110Z digest=sha256:f2bc2f086bf48f70ccbdec4ecfea7b7b26e45ca8c4a2f4682b345c93e63b8283

Observation b2138339-7203-4ebf-8543-d2f15a263008 · outbound

This paper cites Kräuter, and T.S.

An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality Kräuter, and T.S

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-08-04T21:32:37.408778Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-04T21:32:33.377213Z digest=sha256:f26848ba96ccc05a471e9840e3efdc6380995821f273ab1a87fec7cde9440f1e

Observation 1aa81156-6ec4-4baa-8568-c6dfddecf106 · outbound

This paper cites Computing monomer-dimer systems through matrix permanent.

An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality Computing monomer-dimer systems through matrix permanent

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-08-04T21:32:37.176869Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-04T21:32:33.444719Z digest=sha256:5d371b584036614c0f15d965ad59c790a0e868879ce12ad53fbe127d50191887

Observation 25706eb4-f827-4d31-bd3a-b8fed1955eb5 · outbound

This paper cites An upper bound for the permanent of (0,1)-matrices.

An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality An upper bound for the permanent of (0,1)-matrices

Reference 9

Resolution
verified fuzzy
raw_fallback, observed 2026-08-04T21:32:37.061242Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-04T21:32:33.520253Z digest=sha256:f009f37493ad8c5b2ffa541c5eb2196b11d7d9980962a9fae59856080dc9e38b

Observation f3078c59-2dcf-4254-8abc-66ecd054add4 · outbound

This paper cites Inapproximability of positive semidefinite permanents and quantum state tomography.

An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality Inapproximability of positive semidefinite permanents and quantum state tomography

Reference 10

Resolution
verified fuzzy
raw_fallback, observed 2026-08-04T21:32:36.978333Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-04T21:32:33.690021Z digest=sha256:ba654b2791a81b7252a01a3c363a70e8bba13777226563bc14168dda85c64bec

Observation 4ead4898-4f1f-4cfe-8549-f1e5a69ab100 · outbound

This paper cites Upper bounds for permanents of ( \ 0,\,1\ ) -matrices.

An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality Upper bounds for permanents of ( \ 0,\,1\ ) -matrices

Reference 11

Resolution
verified fuzzy
raw_fallback, observed 2026-08-04T21:32:36.793489Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-04T21:32:33.786622Z digest=sha256:13fbb69e8064d313a5a51f299c8aa94af039eecf5f8306badce67ebb63322b8c

Observation 409213c2-d91f-4ab2-8e4a-d4d3829194f4 · outbound

This paper cites Permanents.

An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality Permanents

Reference 12

Resolution
verified fuzzy
raw_fallback, observed 2026-08-04T21:32:36.642390Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-04T21:32:33.909191Z digest=sha256:3e6b8355c634e3d7132f717369f03d44083a2f06988a5d89ad4fe9b15256ab8d

Observation ddff1c68-d50f-4328-89de-3207531cf650 · outbound

This paper cites Permanents.

An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality Permanents

Reference 13

Resolution
verified fuzzy
raw_fallback, observed 2026-08-04T21:32:36.475579Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-04T21:32:34.088002Z digest=sha256:b682c2e5fa153e9ce08834fcb9bf74123cd3d52e7aea68266f7204e9259dedea

Observation 3f6d609d-46d4-412f-8ba1-a06f1c101cad · outbound

This paper cites Inequalities for the permanent function.

An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality Inequalities for the permanent function

Reference 14

Resolution
verified fuzzy
raw_fallback, observed 2026-08-04T21:32:36.332525Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-04T21:32:34.208267Z digest=sha256:27135ab1fde784aec7932efffe9f65cdf8c9f11cbce3a9147284a391ab12a641

Observation 91fb13d3-06e6-43df-9815-4a1c0f0c7355 · outbound

This paper cites An upper bound for permanents of nonnegative matrices.

An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality An upper bound for permanents of nonnegative matrices

Reference 15

Resolution
verified fuzzy
raw_fallback, observed 2026-08-04T21:32:36.186060Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-04T21:32:34.336970Z digest=sha256:78838d1205c584e1b33c5c7dcb13dc28328efee349fa437a6016045775720081

Observation 88682cf1-cdef-4da6-938f-346bf0bdb402 · outbound

This paper cites A short proof of minc's conjecture.

An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality A short proof of minc's conjecture

Reference 16

Resolution
verified fuzzy
raw_fallback, observed 2026-08-04T21:32:36.010926Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-04T21:32:34.502024Z digest=sha256:da1c091b6c7888b06e40de5e81a5177b756b0ea691fe7743c10286eaa720793e

Observation 37673a3e-93d6-4286-96c9-9d353687f25c · outbound

This paper cites Counting 1-factors in regular bipartite graphs.

An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality Counting 1-factors in regular bipartite graphs

Reference 17

Resolution
verified fuzzy
raw_fallback, observed 2026-08-04T21:32:35.840000Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-04T21:32:34.585862Z digest=sha256:3fa097c70977c20249a5b8113efd066482fa6b9e740e0a9a3e146580bc0accf6

Observation a5f25bd1-dfb4-46c6-b030-2bcd24d537d9 · outbound

This paper cites Permanents in linear optical networks.

An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality Permanents in linear optical networks

Reference 18

Resolution
unresolved
no resolver link, observed 2026-08-04T21:32:34.648205Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-04T21:32:34.648205Z digest=sha256:11e602656fd3e1fe01bb2d9a2a744f481c509d2839c637710386ff2451a211c2

Observation c179be11-a04a-43bd-9747-14db683df828 · outbound

This paper cites an unresolved cited work.

An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality Unresolved cited work

Reference 19

Resolution
unresolved
raw_fallback, observed 2026-08-04T21:32:35.684058Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-04T21:32:34.710327Z digest=sha256:8561b792be2820221f40a134f8b3c8f6473ea89696e4856581b0a2de17c0aac3

Observation ada354ef-6740-4554-8de4-45e20e10edc1 · outbound

This paper cites an unresolved cited work.

An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality Unresolved cited work

Reference 20

Resolution
unresolved
raw_fallback, observed 2026-08-04T21:32:35.519259Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-04T21:32:34.772332Z digest=sha256:d14ba481440da57a2807912fb4fc0a4bf869c432ba6701c32b3f6ed57003df3a

Observation aa35caeb-1f76-4bf2-8989-4c5e46e3ce65 · outbound

This paper cites Random point fields associated with certain fredholm determinants i: fermion, poisson and boson point processes.

An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality Random point fields associated with certain fredholm determinants i: fermion, poisson and boson point processes

Reference 21

Resolution
verified fuzzy
raw_fallback, observed 2026-08-04T21:32:35.378135Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-04T21:32:34.837452Z digest=sha256:490b18bab2c0efb84fa1fbee3d1b11eb8d35f5c3baca406c371940541b4fe6bc

Observation 962bd985-ffad-41ca-874e-e69e1465d714 · outbound

This paper cites an unresolved cited work.

An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality Unresolved cited work

Reference 22

Resolution
unresolved
raw_fallback, observed 2026-08-04T21:32:35.238091Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-04T21:32:34.918259Z digest=sha256:522fc76695d80c2f762ec4e400715e8ce361b0d5f0574ee046f9176af1d90e1e

Observation f05e8d2a-03c2-4998-8832-e81be4ad4e72 · outbound

This paper cites Maximizing products of linear forms, and the permanent of positive semidefinite matrices.

An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality Maximizing products of linear forms, and the permanent of positive semidefinite matrices

Reference 23

Resolution
verified fuzzy
raw_fallback, observed 2026-08-04T21:32:35.113937Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-04T21:32:34.984760Z digest=sha256:18a0d2cff8f122ca7fbf7d9895bb077a5d0983060640b744ffa078998c2a3a41

Pith citing papers

No inbound Pith citation observations are available.