{"as_of":"2026-08-18T02:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1e68aa35bbfec15d0353ef6d00c036e4fbdf93d36d9839fae26c5b4695c7773c","coverage":[{"denominator":29,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":29,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T21:17:37.231134Z","state":"measured"},{"denominator":29,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":29,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+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/2412.04967/citation-record","integrity":"/paper/2412.04967/integrity","json":"/paper/2412.04967/citation-record.json","paper":"/paper/2412.04967"},"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-11T21:17:38.857870Z","title":"Speeding up discrete log and factoring based schemes via precomputat ions","venue":null,"work_id":"daab09c1-76be-49f4-bbc1-dcaef55cbd3c","year":1998},"citing_paper":{"arxiv_id":"2412.04967","last_updated":"2025-02-24T07:38:43Z","snapshot_observed_at":"2026-08-12T15:20:45.048653Z","submitted_at":"2024-12-06T11:37:28Z","title":"Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T21:17:36.982460Z"},"links":{"citing_paper":"/paper/2412.04967"},"observation_digest":"sha256:5dc4dde2c78e7bb9f0a63045c9943990077444307a04e22f12af04abdebb0a97","observation_id":"ff0d6d0c-2a17-4bf9-b415-47d772a54c60","resolution":{"observed_at":"2026-08-11T21:17:38.904768Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T21:17:38.781749Z","title":"Nonneg- ative integral subset representations of integer sets","venue":null,"work_id":"8c61954e-7d02-472c-8bb1-36dca67bd6be","year":2007},"citing_paper":{"arxiv_id":"2412.04967","last_updated":"2025-02-24T07:38:43Z","snapshot_observed_at":"2026-08-12T15:20:45.048653Z","submitted_at":"2024-12-06T11:37:28Z","title":"Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T21:17:36.992351Z"},"links":{"citing_paper":"/paper/2412.04967"},"observation_digest":"sha256:9523040a37ae889bfa4ebc08b6430eb6da839ba4af957a91888747d3568c6a9d","observation_id":"19d0c186-ccb9-4f15-a10b-77e208d75b0d","resolution":{"observed_at":"2026-08-11T21:17:38.804756Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T21:17:38.736207Z","title":"On the privacy of federated clu stering: A cryp- tographic view","venue":null,"work_id":"7303d3d7-acca-45c5-9478-beb25467752f","year":2024},"citing_paper":{"arxiv_id":"2412.04967","last_updated":"2025-02-24T07:38:43Z","snapshot_observed_at":"2026-08-12T15:20:45.048653Z","submitted_at":"2024-12-06T11:37:28Z","title":"Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T21:17:37.002433Z"},"links":{"citing_paper":"/paper/2412.04967"},"observation_digest":"sha256:e1e875a45e748493d04587b92cec0d51b34682ae7e600e0f953b2dd04a6b3004","observation_id":"31060852-2607-43e0-8526-27fbee858ba1","resolution":{"observed_at":"2026-08-11T21:17:38.753417Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.14260","last_updated":"2024-09-21T23:01:33Z","snapshot_observed_at":"2026-08-16T13:16:35.264002Z","submitted_at":"2024-09-21T23:01:33Z","title":"Perfect Gradient Inversion in Federated Learning: A New Paradigm from the Hidden Subset Sum Problem","version":1},"cited_work":{"arxiv_id":"2409.14260","doi":null,"metadata_source":"pith","pith_arxiv_id":"2409.14260","snapshot_observed_at":"2026-08-11T21:17:37.324814Z","title":"Perfect Gradient Inversion in Federated Learning: A New Paradigm from the Hidden Subset Sum Problem","venue":"cs.CR","work_id":"80f84a1e-664c-4a0b-8a4f-6d44e02d6b34","year":2024},"citing_paper":{"arxiv_id":"2412.04967","last_updated":"2025-02-24T07:38:43Z","snapshot_observed_at":"2026-08-12T15:20:45.048653Z","submitted_at":"2024-12-06T11:37:28Z","title":"Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T21:17:37.037182Z"},"links":{"cited_paper":"/paper/2409.14260","citing_paper":"/paper/2412.04967"},"observation_digest":"sha256:340f241c349e881c74814c3242a8797083be5dd8db205e98f36b703739d2dbda","observation_id":"26c7caa6-a3f1-47c2-9c4f-2c93003b237c","resolution":{"observed_at":"2026-08-11T21:17:37.337279Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T21:17:38.626702Z","title":"Chan nel allocation revisited through 1-extendability of graphs","venue":null,"work_id":"ee2b0796-545c-4793-b4f4-df939afe8a92","year":2024},"citing_paper":{"arxiv_id":"2412.04967","last_updated":"2025-02-24T07:38:43Z","snapshot_observed_at":"2026-08-12T15:20:45.048653Z","submitted_at":"2024-12-06T11:37:28Z","title":"Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T21:17:37.050949Z"},"links":{"citing_paper":"/paper/2412.04967"},"observation_digest":"sha256:77c2546c1fcc1413d9188ff2159e45d093e9f2f8d744d62552b2209edf785750","observation_id":"4a878ef7-aec9-4c8c-9efc-532d87557b9e","resolution":{"observed_at":"2026-08-11T21:17:38.644755Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T21:17:38.574685Z","title":"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","venue":null,"work_id":"02cf1c26-0c72-4247-bcd5-6110b38b346f","year":2019},"citing_paper":{"arxiv_id":"2412.04967","last_updated":"2025-02-24T07:38:43Z","snapshot_observed_at":"2026-08-12T15:20:45.048653Z","submitted_at":"2024-12-06T11:37:28Z","title":"Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T21:17:37.056302Z"},"links":{"citing_paper":"/paper/2412.04967"},"observation_digest":"sha256:8199de0cc875973fb8afed7a73031c7fe1166204126dec6f2ad0004ee54774b7","observation_id":"3a8bb2de-00e0-403c-89d9-0794749974ba","resolution":{"observed_at":"2026-08-11T21:17:38.597418Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T21:17:38.483908Z","title":"Multiset theory","venue":null,"work_id":"8ad8a8b5-0496-4313-bde1-ae7b1db1e4e4","year":1989},"citing_paper":{"arxiv_id":"2412.04967","last_updated":"2025-02-24T07:38:43Z","snapshot_observed_at":"2026-08-12T15:20:45.048653Z","submitted_at":"2024-12-06T11:37:28Z","title":"Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T21:17:37.064982Z"},"links":{"citing_paper":"/paper/2412.04967"},"observation_digest":"sha256:2a35121926d4a2c0fc340c392e068d68ca80ee398b4ed8fbcddf78eb93abe44f","observation_id":"58c71307-6882-4db1-be93-e8802cff584c","resolution":{"observed_at":"2026-08-11T21:17:38.524756Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T21:17:38.422945Z","title":null,"venue":null,"work_id":"1d96bd3c-faf8-4c17-b07d-e1ad392f74bd","year":1957},"citing_paper":{"arxiv_id":"2412.04967","last_updated":"2025-02-24T07:38:43Z","snapshot_observed_at":"2026-08-12T15:20:45.048653Z","submitted_at":"2024-12-06T11:37:28Z","title":"Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T21:17:37.073618Z"},"links":{"citing_paper":"/paper/2412.04967"},"observation_digest":"sha256:5478d350d7e9c673a947042af439cb67dbef4334ca0289ac688b2c529401b5df","observation_id":"b5f0bc98-1b99-45d2-a6d7-9330fdb345eb","resolution":{"observed_at":"2026-08-11T21:17:38.449599Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T21:17:38.351813Z","title":"Unsolved problems in number theory, volume 1","venue":null,"work_id":"d44dceb9-b161-4692-9df5-eb08fe7ecc63","year":2004},"citing_paper":{"arxiv_id":"2412.04967","last_updated":"2025-02-24T07:38:43Z","snapshot_observed_at":"2026-08-12T15:20:45.048653Z","submitted_at":"2024-12-06T11:37:28Z","title":"Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T21:17:37.080154Z"},"links":{"citing_paper":"/paper/2412.04967"},"observation_digest":"sha256:d01cc083825d8917c2d27c35535ca8b74f1afc87c56796f977fe8076a94a1d56","observation_id":"3729e5a4-7a88-436a-831b-90346d769697","resolution":{"observed_at":"2026-08-11T21:17:38.376575Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T21:17:38.310727Z","title":"On the determinatio n of numbers by their sums of a fixed order","venue":null,"work_id":"a1bb0fef-b1a0-4a29-b887-8ed08f564a3a","year":1958},"citing_paper":{"arxiv_id":"2412.04967","last_updated":"2025-02-24T07:38:43Z","snapshot_observed_at":"2026-08-12T15:20:45.048653Z","submitted_at":"2024-12-06T11:37:28Z","title":"Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T21:17:37.087484Z"},"links":{"citing_paper":"/paper/2412.04967"},"observation_digest":"sha256:a66fca29261d8594d51c34932dabbf8cbcb611635d0c094ce167a2ffe16f6121","observation_id":"e93207c0-fe3a-4829-aacc-37b7739d08c3","resolution":{"observed_at":"2026-08-11T21:17:38.323158Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T21:17:38.273086Z","title":"On the determination of sets by the sets of sums of a certain order","venue":null,"work_id":"ef00bbff-fd6c-489d-8090-38ea3568c624","year":1962},"citing_paper":{"arxiv_id":"2412.04967","last_updated":"2025-02-24T07:38:43Z","snapshot_observed_at":"2026-08-12T15:20:45.048653Z","submitted_at":"2024-12-06T11:37:28Z","title":"Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T21:17:37.095737Z"},"links":{"citing_paper":"/paper/2412.04967"},"observation_digest":"sha256:00f3278278c19587dd82a8a4815a0e6a1335614b3a5a63eb3439021343053abf","observation_id":"037db1f0-717d-4ec4-845d-8d541394fe28","resolution":{"observed_at":"2026-08-11T21:17:38.290785Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T21:17:38.214757Z","title":"On the determination of sets by sets of sums of fixed order","venue":null,"work_id":"40a90f9a-935e-4488-b6a2-9f5780bda496","year":1968},"citing_paper":{"arxiv_id":"2412.04967","last_updated":"2025-02-24T07:38:43Z","snapshot_observed_at":"2026-08-12T15:20:45.048653Z","submitted_at":"2024-12-06T11:37:28Z","title":"Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T21:17:37.102203Z"},"links":{"citing_paper":"/paper/2412.04967"},"observation_digest":"sha256:c15004adb84499d46c539f62f0a5fa0f93df86e9713490cf354ba17276ea3999","observation_id":"db982222-f430-49ae-a969-46234373f9b2","resolution":{"observed_at":"2026-08-11T21:17:38.264756Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T21:17:38.079841Z","title":"Collections of mult iple sums","venue":null,"work_id":"016ad43f-468e-4595-8457-3295f15c28b3","year":1995},"citing_paper":{"arxiv_id":"2412.04967","last_updated":"2025-02-24T07:38:43Z","snapshot_observed_at":"2026-08-12T15:20:45.048653Z","submitted_at":"2024-12-06T11:37:28Z","title":"Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T21:17:37.120838Z"},"links":{"citing_paper":"/paper/2412.04967"},"observation_digest":"sha256:f9d93ed229281ce6c168ec9e7704fa1140919e66882eba08b4c632fe9097cd4a","observation_id":"b8fa9ddb-b138-4f48-9c8b-7173573f1f1d","resolution":{"observed_at":"2026-08-11T21:17:38.100520Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T21:17:38.025294Z","title":"Examples of non-uniquen ess for the com- binatorial radon transform modulo the symmetric group","venue":null,"work_id":"23abe308-28c2-4e94-850d-319193abba21","year":1996},"citing_paper":{"arxiv_id":"2412.04967","last_updated":"2025-02-24T07:38:43Z","snapshot_observed_at":"2026-08-12T15:20:45.048653Z","submitted_at":"2024-12-06T11:37:28Z","title":"Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T21:17:37.128384Z"},"links":{"citing_paper":"/paper/2412.04967"},"observation_digest":"sha256:fb2f45656f222dcb24c4c8f6f5b7b19b833c4966ba8ad3d1c522ada7b429bb97","observation_id":"18578e9c-dac9-42aa-a354-a0cb7d33047a","resolution":{"observed_at":"2026-08-11T21:17:38.064842Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T21:17:37.902709Z","title":"A set of 12 n umbers is not determined by the set of its 4-sums","venue":null,"work_id":"3c2a6ee2-7144-4169-8c6e-2471b16b15c9","year":2017},"citing_paper":{"arxiv_id":"2412.04967","last_updated":"2025-02-24T07:38:43Z","snapshot_observed_at":"2026-08-12T15:20:45.048653Z","submitted_at":"2024-12-06T11:37:28Z","title":"Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T21:17:37.131819Z"},"links":{"citing_paper":"/paper/2412.04967"},"observation_digest":"sha256:e7fe0b727cb5a0713f1367af282bd90a8aadbf749c006781c30dbe44d142a458","observation_id":"4d722a9d-51af-453e-b8d5-bade6fe65431","resolution":{"observed_at":"2026-08-11T21:17:37.929146Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.04635","last_updated":"2023-01-18T18:17:42Z","snapshot_observed_at":"2026-08-16T16:03:02.528264Z","submitted_at":"2023-01-11T18:39:38Z","title":"On The Determination of Sets By Their Subset Sums","version":2},"cited_work":{"arxiv_id":"2301.04635","doi":null,"metadata_source":"pith","pith_arxiv_id":"2301.04635","snapshot_observed_at":"2026-08-11T21:17:37.279006Z","title":"On The Determination of Sets By Their Subset Sums","venue":"math.NT","work_id":"e818d16a-75cb-4fd9-9107-f3c5f025e4a3","year":2023},"citing_paper":{"arxiv_id":"2412.04967","last_updated":"2025-02-24T07:38:43Z","snapshot_observed_at":"2026-08-12T15:20:45.048653Z","submitted_at":"2024-12-06T11:37:28Z","title":"Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T21:17:37.135946Z"},"links":{"cited_paper":"/paper/2301.04635","citing_paper":"/paper/2412.04967"},"observation_digest":"sha256:6c56611ce3598256f111853f4c8fec720473774c7596bc7e7780e1afc10d67f9","observation_id":"7d43ed4e-c4df-48be-94fb-9772b0e8cf60","resolution":{"observed_at":"2026-08-11T21:17:37.296364Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T21:17:37.806327Z","title":"A genetic algorithm for the minimum generating set problem","venue":null,"work_id":"99329db0-453b-4593-84cc-1ec8093c0336","year":2016},"citing_paper":{"arxiv_id":"2412.04967","last_updated":"2025-02-24T07:38:43Z","snapshot_observed_at":"2026-08-12T15:20:45.048653Z","submitted_at":"2024-12-06T11:37:28Z","title":"Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T21:17:37.139832Z"},"links":{"citing_paper":"/paper/2412.04967"},"observation_digest":"sha256:84f679401e8e50587f1d89f1efa95700842432061b99857235f050b73cedca8f","observation_id":"e45e81ed-970a-48f1-9a3e-789e4fec1464","resolution":{"observed_at":"2026-08-11T21:17:37.836371Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T21:17:37.759789Z","title":"The hardness of the hidd en subset sum problem and its cryptographic implications","venue":null,"work_id":"c791b0de-cac6-44bd-89e7-cbc9824e1702","year":1999},"citing_paper":{"arxiv_id":"2412.04967","last_updated":"2025-02-24T07:38:43Z","snapshot_observed_at":"2026-08-12T15:20:45.048653Z","submitted_at":"2024-12-06T11:37:28Z","title":"Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T21:17:37.143064Z"},"links":{"citing_paper":"/paper/2412.04967"},"observation_digest":"sha256:60c44fb272d4c2e4c92b06db3b2055912d308750e526a57747b11c23a91af825","observation_id":"290a75b7-83e3-430f-a1c6-e90116ede4b0","resolution":{"observed_at":"2026-08-11T21:17:37.786073Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T21:17:37.713235Z","title":"A polynomial-t ime algorithm for solving the hidden subset sum problem","venue":null,"work_id":"02c6ec97-ec16-48b2-8ccb-a43a79d646cc","year":2020},"citing_paper":{"arxiv_id":"2412.04967","last_updated":"2025-02-24T07:38:43Z","snapshot_observed_at":"2026-08-12T15:20:45.048653Z","submitted_at":"2024-12-06T11:37:28Z","title":"Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T21:17:37.147255Z"},"links":{"citing_paper":"/paper/2412.04967"},"observation_digest":"sha256:77cc53ffd436a1dcd4bee1762d954505d6704d7e154ae5edb126b211b7325ee1","observation_id":"3a5930cb-64bd-4993-9f2c-de6fc2edce11","resolution":{"observed_at":"2026-08-11T21:17:37.730393Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T21:17:37.679151Z","title":"Provably solvi ng the hidden subset sum problem via statistical learning","venue":null,"work_id":"55aa984a-75a8-4ca4-9861-05b17bc711f3","year":2021},"citing_paper":{"arxiv_id":"2412.04967","last_updated":"2025-02-24T07:38:43Z","snapshot_observed_at":"2026-08-12T15:20:45.048653Z","submitted_at":"2024-12-06T11:37:28Z","title":"Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T21:17:37.152633Z"},"links":{"citing_paper":"/paper/2412.04967"},"observation_digest":"sha256:9b585adacf6f9720211c0534693137818c4988d59a713c02c49c6dba8d1fdb23","observation_id":"fe6e343d-6688-4ee7-87c7-6371596146ab","resolution":{"observed_at":"2026-08-11T21:17:37.695714Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T21:17:37.621959Z","title":"On the hardness of the hidden subset sum problem: algebraic a nd statistical attacks","venue":null,"work_id":"7a9ec05d-2cd9-497e-a395-a928d47267bf","year":2022},"citing_paper":{"arxiv_id":"2412.04967","last_updated":"2025-02-24T07:38:43Z","snapshot_observed_at":"2026-08-12T15:20:45.048653Z","submitted_at":"2024-12-06T11:37:28Z","title":"Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T21:17:37.157134Z"},"links":{"citing_paper":"/paper/2412.04967"},"observation_digest":"sha256:73b59eee670901f987a63dacd554b8a528c9b0b7bebe70945dcfff44235106b4","observation_id":"328e0462-4d68-45d3-bebb-639d41659e08","resolution":{"observed_at":"2026-08-11T21:17:37.631896Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T21:17:37.592200Z","title":"A comprehensiv e survey of privacy-preserving federated learning: A taxonomy, revie w, and future di- rections","venue":null,"work_id":"d4a4e5cc-137c-4c73-a654-9d0594a201b3","year":2021},"citing_paper":{"arxiv_id":"2412.04967","last_updated":"2025-02-24T07:38:43Z","snapshot_observed_at":"2026-08-12T15:20:45.048653Z","submitted_at":"2024-12-06T11:37:28Z","title":"Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T21:17:37.161210Z"},"links":{"citing_paper":"/paper/2412.04967"},"observation_digest":"sha256:d45895985df03c957b1f5957ff1cfacfe4bfce778432ec9f49dd1b34cc44a633","observation_id":"8597dbe4-0bdb-4d49-9f30-3022f408dd3a","resolution":{"observed_at":"2026-08-11T21:17:37.600722Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T21:17:37.520560Z","title":"Algebra, volume 211","venue":null,"work_id":"a6de27f7-3b99-4f0f-be5d-5b38b1d04470","year":2012},"citing_paper":{"arxiv_id":"2412.04967","last_updated":"2025-02-24T07:38:43Z","snapshot_observed_at":"2026-08-12T15:20:45.048653Z","submitted_at":"2024-12-06T11:37:28Z","title":"Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T21:17:37.174756Z"},"links":{"citing_paper":"/paper/2412.04967"},"observation_digest":"sha256:5cdd6a75a55a920b81289bbc2ea58f1c498dc93677d4f5926a522fd6912b87c9","observation_id":"f239aac2-7869-4e61-9ec2-ecc2c9a88e8e","resolution":{"observed_at":"2026-08-11T21:17:37.566685Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T21:17:37.476797Z","title":"Integer partitions","venue":null,"work_id":"cfc1aa27-0763-4c19-829c-83c5410b85a3","year":2004},"citing_paper":{"arxiv_id":"2412.04967","last_updated":"2025-02-24T07:38:43Z","snapshot_observed_at":"2026-08-12T15:20:45.048653Z","submitted_at":"2024-12-06T11:37:28Z","title":"Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T21:17:37.196563Z"},"links":{"citing_paper":"/paper/2412.04967"},"observation_digest":"sha256:1048c5d39f7c51919ed879d678ee16ec67425b9aeaf1afcca550d7f2344edb64","observation_id":"c143a0ad-8e47-4723-8100-2e910b988b3d","resolution":{"observed_at":"2026-08-11T21:17:37.487247Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T21:17:37.456785Z","title":"Enumerative Combinatorics Volume 1 second edition","venue":null,"work_id":"6c8beaf4-06ff-4ef1-96f3-6d5f0c9c8c1d","year":2011},"citing_paper":{"arxiv_id":"2412.04967","last_updated":"2025-02-24T07:38:43Z","snapshot_observed_at":"2026-08-12T15:20:45.048653Z","submitted_at":"2024-12-06T11:37:28Z","title":"Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T21:17:37.206464Z"},"links":{"citing_paper":"/paper/2412.04967"},"observation_digest":"sha256:921df14da49c785b14082f6286ebe8a291615e06bc2cda8ea87f94d7c58ebcd6","observation_id":"ea3252ff-0dd7-44b0-8a61-566145bba815","resolution":{"observed_at":"2026-08-11T21:17:37.466878Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T21:17:37.437266Z","title":"Numerical Linear Algebra","venue":null,"work_id":"2a09da9a-ad7d-4087-b9d8-b42d600c8958","year":null},"citing_paper":{"arxiv_id":"2412.04967","last_updated":"2025-02-24T07:38:43Z","snapshot_observed_at":"2026-08-12T15:20:45.048653Z","submitted_at":"2024-12-06T11:37:28Z","title":"Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T21:17:37.216774Z"},"links":{"citing_paper":"/paper/2412.04967"},"observation_digest":"sha256:30422a8b8bfa95ffbad54acbeed125c6c51842015064dd439db295b73eba6a00","observation_id":"00b1efda-788b-4c1e-92b5-4ec06da5f627","resolution":{"observed_at":"2026-08-11T21:17:37.443392Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T21:17:37.414759Z","title":"Introduction to algorithms , volume 3","venue":null,"work_id":"d939ce91-3ef8-455c-881f-90f6b52c3174","year":1994},"citing_paper":{"arxiv_id":"2412.04967","last_updated":"2025-02-24T07:38:43Z","snapshot_observed_at":"2026-08-12T15:20:45.048653Z","submitted_at":"2024-12-06T11:37:28Z","title":"Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T21:17:37.221649Z"},"links":{"citing_paper":"/paper/2412.04967"},"observation_digest":"sha256:9d6c564e2c008c1dd6a3d988974a213bd0183fcf83b301d8f41f2013c04b6f11","observation_id":"2b8c464d-93a8-462c-a1d8-20e493cdf2a6","resolution":{"observed_at":"2026-08-11T21:17:37.419368Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T21:17:37.388963Z","title":"Polynomial roots fr om companion matrix eigenvalues","venue":null,"work_id":"ffbd460e-f71d-4e94-a6a9-b6e721149194","year":1995},"citing_paper":{"arxiv_id":"2412.04967","last_updated":"2025-02-24T07:38:43Z","snapshot_observed_at":"2026-08-12T15:20:45.048653Z","submitted_at":"2024-12-06T11:37:28Z","title":"Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T21:17:37.227092Z"},"links":{"citing_paper":"/paper/2412.04967"},"observation_digest":"sha256:d7529db8e4c3199c2816eb9e687d68f27a43f1cf06c2d687d6a38c4072ad618f","observation_id":"cb8dc746-23cc-4735-ad9d-6f6a3658dbae","resolution":{"observed_at":"2026-08-11T21:17:37.400825Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T21:17:37.365027Z","title":"Asymptotic fo rmulaæ in combi- natory analysis","venue":null,"work_id":"1b3fb598-ed0f-4297-b5af-cded24115e48","year":1918},"citing_paper":{"arxiv_id":"2412.04967","last_updated":"2025-02-24T07:38:43Z","snapshot_observed_at":"2026-08-12T15:20:45.048653Z","submitted_at":"2024-12-06T11:37:28Z","title":"Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T21:17:37.231134Z"},"links":{"citing_paper":"/paper/2412.04967"},"observation_digest":"sha256:8a22c899d24db8da242a7e0e18d0fa3756865f25d7c298d909176858fdf1a648","observation_id":"e529840d-e218-4e59-b3ad-749e284d9c50","resolution":{"observed_at":"2026-08-11T21:17:37.378347Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.04967","last_updated":"2025-02-24T07:38:43Z","latest_version":2,"primary_category":"math.CO","snapshot_observed_at":"2026-08-12T15:20:45.048653Z","submitted_at":"2024-12-06T11:37:28Z","title":"Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem"},"reference_resolution":{"displayed":29,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":2,"verified_fuzzy":26},"total_outbound_references":29},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 0 inbound Pith citation observations for arXiv:2412.04967."}