Paper Citation Record · LEDGER

Efficient algorithms for the Hadamard decomposition

As of 20 August 2026, this Paper Citation Record lists 13 of 13 outbound references and 1 inbound Pith citation observation for arXiv:2504.13633.

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

pith.paper-citation-record.v1
2504.13633 v2

Coverage vector

measured 13 of 13 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-16T12:08:48.844314Z

measured 14 of 14 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-19T06:32:44.657259+00:00

measured 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-06T21:42:18.101365Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-06T21:42:19.175300Z

Reference resolution

13 of 13 outbound references displayed

verified exact1
verified fuzzy8
unresolved4
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation a90a0f4a-5a82-4b8d-ada8-da3d2af5d8ac · outbound

This paper cites Hyeon-Woo, M.

Efficient algorithms for the Hadamard decomposition Hyeon-Woo, M

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T12:08:49.589369Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation a5be2e30-9e8d-450d-aed8-d0bdfb465485 · outbound

This paper cites Ciaperoni, A.

Efficient algorithms for the Hadamard decomposition Ciaperoni, A

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T12:08:49.578770Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 29ce9e15-d138-40f1-af35-91f371dd5bc6 · outbound

This paper cites Gillis and F.

Efficient algorithms for the Hadamard decomposition Gillis and F

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T12:08:49.543780Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 077c7ee2-9eb9-4bc3-87ea-9af80501f5a3 · outbound

This paper cites Gillis, ”Nonnegative Matrix Factorization”, Societ y for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 2021.

Efficient algorithms for the Hadamard decomposition Gillis, ”Nonnegative Matrix Factorization”, Societ y for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 2021

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T12:08:49.470179Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 9631f44b-8ac7-4e6c-85cd-22bdac4bf75e · outbound

This paper cites an unresolved cited work.

Efficient algorithms for the Hadamard decomposition Unresolved cited work

Reference 5

Resolution: unresolved; raw_fallback, observed 2026-08-16T12:08:49.458470Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 1739dd22-d98f-4235-88cd-39cb29c10a8f · outbound

This paper cites Ciaperoni, ”HadamardDecomposition,” GitHub reposi tory, github.com/maciap/HadamardDecomposition, 2023.

Efficient algorithms for the Hadamard decomposition Ciaperoni, ”HadamardDecomposition,” GitHub reposi tory, github.com/maciap/HadamardDecomposition, 2023

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T12:08:49.368518Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 88b3b835-b942-4ef4-a9dd-1c5773e467b3 · outbound

This paper cites Girvan and M.

Efficient algorithms for the Hadamard decomposition Girvan and M

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T12:08:49.298929Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 3a933732-ce96-4197-8d8a-51fe775756d6 · outbound

This paper cites an unresolved cited work.

Efficient algorithms for the Hadamard decomposition Unresolved cited work

Reference 8

Resolution: unresolved; raw_fallback, observed 2026-08-16T12:08:49.199470Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 8a3a40ad-fe9a-45a9-a99d-e57ec0a23870 · outbound

This paper cites an unresolved cited work.

Efficient algorithms for the Hadamard decomposition Unresolved cited work

Reference 9

Resolution: verified exact; doi, observed 2026-08-16T12:08:48.984228Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 54a395fc-e176-4284-8e80-094b822b2b5f · outbound

This paper cites By removing the jth entry of r (reducing p by one) and increasing the kth entry of r by one, we obtain a better solution, since 1∗ rk < r k + 1.

Efficient algorithms for the Hadamard decomposition By removing the jth entry of r (reducing p by one) and increasing the kth entry of r by one, we obtain a better solution, since 1∗ rk < r k + 1

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T12:08:49.164120Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation a147ea14-0b91-4d54-a8e5-86eb605e85b9 · outbound

This paper cites Then it is possible to create another admissible solution by setting rj = 1 +K and by adding an entry rp+1 = 3.

Efficient algorithms for the Hadamard decomposition Then it is possible to create another admissible solution by setting rj = 1 +K and by adding an entry rp+1 = 3

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T12:08:49.117274Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 11d83941-92c4-41fb-8634-7312dfcc0078 · outbound

This paper cites an unresolved cited work.

Efficient algorithms for the Hadamard decomposition Unresolved cited work

Reference 12

Resolution: unresolved; raw_fallback, observed 2026-08-16T12:08:49.072352Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation b8bf9438-8cf8-44b9-ae5b-da27b3d736da · outbound

This paper cites an unresolved cited work.

Efficient algorithms for the Hadamard decomposition Unresolved cited work

Reference 13

Resolution: unresolved; raw_fallback, observed 2026-08-16T12:08:48.995327Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Pith citing papers

Observation e73f7a58-1d7a-4f55-bc65-4958c75f4b26 · inbound

Variable Smoothing for Weakly Convex Problems with Non-Euclidean Directions cites this paper.

Variable Smoothing for Weakly Convex Problems with Non-Euclidean Directions Efficient algorithms for the Hadamard decomposition

Reference 37

Resolution: metadata mismatch; local_arxiv, observed 2026-08-06T21:42:19.243702Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.