Pith. sign in

Paper Citation Record · LEDGER

Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem

As of 17 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 0 inbound Pith citation observations for arXiv:2412.04967.

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

pith.paper-citation-record.v1
2412.04967 v2

Coverage vector

measured 29 of 29 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-11T21:17:37.231134Z

measured 29 of 29 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-17T06:30:58.91139+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

29 of 29 outbound references displayed

  • verified exact2
  • verified fuzzy26
  • unresolved1
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation ff0d6d0c-2a17-4bf9-b415-47d772a54c60 · outbound

This paper cites Speeding up discrete log and factoring based schemes via precomputat ions.

Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem Speeding up discrete log and factoring based schemes via precomputat ions

Reference 1

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T21:17:38.904768Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-11T21:17:36.982460Z digest=sha256:5dc4dde2c78e7bb9f0a63045c9943990077444307a04e22f12af04abdebb0a97

Observation 19d0c186-ccb9-4f15-a10b-77e208d75b0d · outbound

This paper cites Nonneg- ative integral subset representations of integer sets.

Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem Nonneg- ative integral subset representations of integer sets

Reference 2

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T21:17:38.804756Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-11T21:17:36.992351Z digest=sha256:9523040a37ae889bfa4ebc08b6430eb6da839ba4af957a91888747d3568c6a9d

Observation 31060852-2607-43e0-8526-27fbee858ba1 · outbound

This paper cites On the privacy of federated clu stering: A cryp- tographic view.

Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem On the privacy of federated clu stering: A cryp- tographic view

Reference 3

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T21:17:38.753417Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-11T21:17:37.002433Z digest=sha256:e1e875a45e748493d04587b92cec0d51b34682ae7e600e0f953b2dd04a6b3004

Observation 26c7caa6-a3f1-47c2-9c4f-2c93003b237c · outbound

This paper cites Perfect Gradient Inversion in Federated Learning: A New Paradigm from the Hidden Subset Sum Problem.

Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem Perfect Gradient Inversion in Federated Learning: A New Paradigm from the Hidden Subset Sum Problem

Reference 4

Resolution
verified exact
local_arxiv, observed 2026-08-11T21:17:37.337279Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-11T21:17:37.037182Z digest=sha256:340f241c349e881c74814c3242a8797083be5dd8db205e98f36b703739d2dbda

Observation 4a878ef7-aec9-4c8c-9efc-532d87557b9e · outbound

This paper cites Chan nel allocation revisited through 1-extendability of graphs.

Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem Chan nel allocation revisited through 1-extendability of graphs

Reference 5

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T21:17:38.644755Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-11T21:17:37.050949Z digest=sha256:77c2546c1fcc1413d9188ff2159e45d093e9f2f8d744d62552b2209edf785750

Observation 3a8bb2de-00e0-403c-89d9-0794749974ba · outbound

This paper cites Is the multiset of n integers uniquely det ermined by the multiset of its s-sums? The American Mathematical Monthly , 126(5):400– 417, 2019.

Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem Is the multiset of n integers uniquely det ermined by the multiset of its s-sums? The American Mathematical Monthly , 126(5):400– 417, 2019

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T21:17:38.597418Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-11T21:17:37.056302Z digest=sha256:8199de0cc875973fb8afed7a73031c7fe1166204126dec6f2ad0004ee54774b7

Observation 58c71307-6882-4db1-be93-e8802cff584c · outbound

This paper cites Multiset theory.

Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem Multiset theory

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T21:17:38.524756Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-11T21:17:37.064982Z digest=sha256:2a35121926d4a2c0fc340c392e068d68ca80ee398b4ed8fbcddf78eb93abe44f

Observation b5f0bc98-1b99-45d2-a6d7-9330fdb345eb · outbound

This paper cites an unresolved cited work.

Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem Unresolved cited work

Reference 8

Resolution
unresolved
raw_fallback, observed 2026-08-11T21:17:38.449599Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-11T21:17:37.073618Z digest=sha256:5478d350d7e9c673a947042af439cb67dbef4334ca0289ac688b2c529401b5df

Observation 3729e5a4-7a88-436a-831b-90346d769697 · outbound

This paper cites Unsolved problems in number theory, volume 1.

Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem Unsolved problems in number theory, volume 1

Reference 9

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T21:17:38.376575Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-11T21:17:37.080154Z digest=sha256:d01cc083825d8917c2d27c35535ca8b74f1afc87c56796f977fe8076a94a1d56

Observation e93207c0-fe3a-4829-aacc-37b7739d08c3 · outbound

This paper cites On the determinatio n of numbers by their sums of a fixed order.

Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem On the determinatio n of numbers by their sums of a fixed order

Reference 10

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T21:17:38.323158Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-11T21:17:37.087484Z digest=sha256:a66fca29261d8594d51c34932dabbf8cbcb611635d0c094ce167a2ffe16f6121

Observation 037db1f0-717d-4ec4-845d-8d541394fe28 · outbound

This paper cites On the determination of sets by the sets of sums of a certain order.

Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem On the determination of sets by the sets of sums of a certain order

Reference 11

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T21:17:38.290785Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-11T21:17:37.095737Z digest=sha256:00f3278278c19587dd82a8a4815a0e6a1335614b3a5a63eb3439021343053abf

Observation db982222-f430-49ae-a969-46234373f9b2 · outbound

This paper cites On the determination of sets by sets of sums of fixed order.

Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem On the determination of sets by sets of sums of fixed order

Reference 12

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T21:17:38.264756Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-11T21:17:37.102203Z digest=sha256:c15004adb84499d46c539f62f0a5fa0f93df86e9713490cf354ba17276ea3999

Observation b8fa9ddb-b138-4f48-9c8b-7173573f1f1d · outbound

This paper cites Collections of mult iple sums.

Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem Collections of mult iple sums

Reference 13

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T21:17:38.100520Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-11T21:17:37.120838Z digest=sha256:f9d93ed229281ce6c168ec9e7704fa1140919e66882eba08b4c632fe9097cd4a

Observation 18578e9c-dac9-42aa-a354-a0cb7d33047a · outbound

This paper cites Examples of non-uniquen ess for the com- binatorial radon transform modulo the symmetric group.

Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem Examples of non-uniquen ess for the com- binatorial radon transform modulo the symmetric group

Reference 14

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T21:17:38.064842Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-11T21:17:37.128384Z digest=sha256:fb2f45656f222dcb24c4c8f6f5b7b19b833c4966ba8ad3d1c522ada7b429bb97

Observation 4d722a9d-51af-453e-b8d5-bade6fe65431 · outbound

This paper cites A set of 12 n umbers is not determined by the set of its 4-sums.

Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem A set of 12 n umbers is not determined by the set of its 4-sums

Reference 15

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T21:17:37.929146Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-11T21:17:37.131819Z digest=sha256:e7fe0b727cb5a0713f1367af282bd90a8aadbf749c006781c30dbe44d142a458

Observation 7d43ed4e-c4df-48be-94fb-9772b0e8cf60 · outbound

This paper cites On The Determination of Sets By Their Subset Sums.

Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem On The Determination of Sets By Their Subset Sums

Reference 16

Resolution
verified exact
local_arxiv, observed 2026-08-11T21:17:37.296364Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-11T21:17:37.135946Z digest=sha256:6c56611ce3598256f111853f4c8fec720473774c7596bc7e7780e1afc10d67f9

Observation e45e81ed-970a-48f1-9a3e-789e4fec1464 · outbound

This paper cites A genetic algorithm for the minimum generating set problem.

Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem A genetic algorithm for the minimum generating set problem

Reference 17

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T21:17:37.836371Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-11T21:17:37.139832Z digest=sha256:84f679401e8e50587f1d89f1efa95700842432061b99857235f050b73cedca8f

Observation 290a75b7-83e3-430f-a1c6-e90116ede4b0 · outbound

This paper cites The hardness of the hidd en subset sum problem and its cryptographic implications.

Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem The hardness of the hidd en subset sum problem and its cryptographic implications

Reference 18

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T21:17:37.786073Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-11T21:17:37.143064Z digest=sha256:60c44fb272d4c2e4c92b06db3b2055912d308750e526a57747b11c23a91af825

Observation 3a5930cb-64bd-4993-9f2c-de6fc2edce11 · outbound

This paper cites A polynomial-t ime algorithm for solving the hidden subset sum problem.

Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem A polynomial-t ime algorithm for solving the hidden subset sum problem

Reference 19

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T21:17:37.730393Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-11T21:17:37.147255Z digest=sha256:77cc53ffd436a1dcd4bee1762d954505d6704d7e154ae5edb126b211b7325ee1

Observation fe6e343d-6688-4ee7-87c7-6371596146ab · outbound

This paper cites Provably solvi ng the hidden subset sum problem via statistical learning.

Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem Provably solvi ng the hidden subset sum problem via statistical learning

Reference 20

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T21:17:37.695714Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-11T21:17:37.152633Z digest=sha256:9b585adacf6f9720211c0534693137818c4988d59a713c02c49c6dba8d1fdb23

Observation 328e0462-4d68-45d3-bebb-639d41659e08 · outbound

This paper cites On the hardness of the hidden subset sum problem: algebraic a nd statistical attacks.

Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem On the hardness of the hidden subset sum problem: algebraic a nd statistical attacks

Reference 21

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T21:17:37.631896Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-11T21:17:37.157134Z digest=sha256:73b59eee670901f987a63dacd554b8a528c9b0b7bebe70945dcfff44235106b4

Observation 8597dbe4-0bdb-4d49-9f30-3022f408dd3a · outbound

This paper cites A comprehensiv e survey of privacy-preserving federated learning: A taxonomy, revie w, and future di- rections.

Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem A comprehensiv e survey of privacy-preserving federated learning: A taxonomy, revie w, and future di- rections

Reference 22

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T21:17:37.600722Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-11T21:17:37.161210Z digest=sha256:d45895985df03c957b1f5957ff1cfacfe4bfce778432ec9f49dd1b34cc44a633

Observation f239aac2-7869-4e61-9ec2-ecc2c9a88e8e · outbound

This paper cites Algebra, volume 211.

Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem Algebra, volume 211

Reference 23

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T21:17:37.566685Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-11T21:17:37.174756Z digest=sha256:5cdd6a75a55a920b81289bbc2ea58f1c498dc93677d4f5926a522fd6912b87c9

Observation c143a0ad-8e47-4723-8100-2e910b988b3d · outbound

This paper cites Integer partitions.

Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem Integer partitions

Reference 24

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T21:17:37.487247Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-11T21:17:37.196563Z digest=sha256:1048c5d39f7c51919ed879d678ee16ec67425b9aeaf1afcca550d7f2344edb64

Observation ea3252ff-0dd7-44b0-8a61-566145bba815 · outbound

This paper cites Enumerative Combinatorics Volume 1 second edition.

Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem Enumerative Combinatorics Volume 1 second edition

Reference 25

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T21:17:37.466878Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-11T21:17:37.206464Z digest=sha256:921df14da49c785b14082f6286ebe8a291615e06bc2cda8ea87f94d7c58ebcd6

Observation 00b1efda-788b-4c1e-92b5-4ec06da5f627 · outbound

This paper cites Numerical Linear Algebra.

Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem Numerical Linear Algebra

Reference 26

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T21:17:37.443392Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-11T21:17:37.216774Z digest=sha256:30422a8b8bfa95ffbad54acbeed125c6c51842015064dd439db295b73eba6a00

Observation 2b8c464d-93a8-462c-a1d8-20e493cdf2a6 · outbound

This paper cites Introduction to algorithms , volume 3.

Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem Introduction to algorithms , volume 3

Reference 27

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T21:17:37.419368Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-11T21:17:37.221649Z digest=sha256:9d6c564e2c008c1dd6a3d988974a213bd0183fcf83b301d8f41f2013c04b6f11

Observation cb8dc746-23cc-4735-ad9d-6f6a3658dbae · outbound

This paper cites Polynomial roots fr om companion matrix eigenvalues.

Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem Polynomial roots fr om companion matrix eigenvalues

Reference 28

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T21:17:37.400825Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-11T21:17:37.227092Z digest=sha256:d7529db8e4c3199c2816eb9e687d68f27a43f1cf06c2d687d6a38c4072ad618f

Observation e529840d-e218-4e59-b3ad-749e284d9c50 · outbound

This paper cites Asymptotic fo rmulaæ in combi- natory analysis.

Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem Asymptotic fo rmulaæ in combi- natory analysis

Reference 29

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T21:17:37.378347Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-11T21:17:37.231134Z digest=sha256:8a22c899d24db8da242a7e0e18d0fa3756865f25d7c298d909176858fdf1a648

Pith citing papers

No inbound Pith citation observations are available.