{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:K7XSM62PLXH2VQHZX5QV4T5FWV","short_pith_number":"pith:K7XSM62P","schema_version":"1.0","canonical_sha256":"57ef267b4f5dcfaac0f9bf615e4fa5b5748e180b5f6367783951a5ebb289bc4d","source":{"kind":"arxiv","id":"2412.04967","version":2},"attestation_state":"computed","paper":{"title":"Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Changheng Li, Lixia Luo, Qiongxiu Li","submitted_at":"2024-12-06T11:37:28Z","abstract_excerpt":"The Hidden Subset Sum Problem (HSSP) is a significant NP-complete problem in number theory and combinatorics, with applications in cryptography and AI privacy. For the $(n,k)$-complete HSSP, where a target multiset must be recovered from its all $k$-subset sums, existing algorithms face limitations due to high complexity or intractability. This paper proposes two deterministic algorithms: a brute-force approach, and a novel method leveraging symmetric polynomials and Vieta's formulas with $O\\left(\\sum_{u=1}^n p(u,\\leq k)^3+\\binom{n}{k}n\\right)$ complexity, where $ p(u,\\leq k)$ counts the numbe"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2412.04967","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-12-06T11:37:28Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"6f4bdc6a14f6aa792091fdd417a526ddd5eac6f0409bba0877f9a1fc51a35e4c","abstract_canon_sha256":"12d9d3fd418a3ffa169b2d668722aab7fff6c9527d0fd9448acd73cb5002c9c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:18:46.356551Z","signature_b64":"ObEEgZz9M2DgDIFz4Io2H82ppxWnUSANCEbKp+kuVI3zXwAfMOzImomDdu/uq2hK+kWMSIzVcBSTV1/l7ipCBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57ef267b4f5dcfaac0f9bf615e4fa5b5748e180b5f6367783951a5ebb289bc4d","last_reissued_at":"2026-07-05T10:18:46.355999Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:18:46.355999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deterministic Algorithms to Solve the $(n,k)$-Complete Hidden Subset Sum Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Changheng Li, Lixia Luo, Qiongxiu Li","submitted_at":"2024-12-06T11:37:28Z","abstract_excerpt":"The Hidden Subset Sum Problem (HSSP) is a significant NP-complete problem in number theory and combinatorics, with applications in cryptography and AI privacy. For the $(n,k)$-complete HSSP, where a target multiset must be recovered from its all $k$-subset sums, existing algorithms face limitations due to high complexity or intractability. This paper proposes two deterministic algorithms: a brute-force approach, and a novel method leveraging symmetric polynomials and Vieta's formulas with $O\\left(\\sum_{u=1}^n p(u,\\leq k)^3+\\binom{n}{k}n\\right)$ complexity, where $ p(u,\\leq k)$ counts the numbe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.04967","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.04967/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2412.04967","created_at":"2026-07-05T10:18:46.356064+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.04967v2","created_at":"2026-07-05T10:18:46.356064+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.04967","created_at":"2026-07-05T10:18:46.356064+00:00"},{"alias_kind":"pith_short_12","alias_value":"K7XSM62PLXH2","created_at":"2026-07-05T10:18:46.356064+00:00"},{"alias_kind":"pith_short_16","alias_value":"K7XSM62PLXH2VQHZ","created_at":"2026-07-05T10:18:46.356064+00:00"},{"alias_kind":"pith_short_8","alias_value":"K7XSM62P","created_at":"2026-07-05T10:18:46.356064+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K7XSM62PLXH2VQHZX5QV4T5FWV","json":"https://pith.science/pith/K7XSM62PLXH2VQHZX5QV4T5FWV.json","graph_json":"https://pith.science/api/pith-number/K7XSM62PLXH2VQHZX5QV4T5FWV/graph.json","events_json":"https://pith.science/api/pith-number/K7XSM62PLXH2VQHZX5QV4T5FWV/events.json","paper":"https://pith.science/paper/K7XSM62P"},"agent_actions":{"view_html":"https://pith.science/pith/K7XSM62PLXH2VQHZX5QV4T5FWV","download_json":"https://pith.science/pith/K7XSM62PLXH2VQHZX5QV4T5FWV.json","view_paper":"https://pith.science/paper/K7XSM62P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.04967&json=true","fetch_graph":"https://pith.science/api/pith-number/K7XSM62PLXH2VQHZX5QV4T5FWV/graph.json","fetch_events":"https://pith.science/api/pith-number/K7XSM62PLXH2VQHZX5QV4T5FWV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K7XSM62PLXH2VQHZX5QV4T5FWV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K7XSM62PLXH2VQHZX5QV4T5FWV/action/storage_attestation","attest_author":"https://pith.science/pith/K7XSM62PLXH2VQHZX5QV4T5FWV/action/author_attestation","sign_citation":"https://pith.science/pith/K7XSM62PLXH2VQHZX5QV4T5FWV/action/citation_signature","submit_replication":"https://pith.science/pith/K7XSM62PLXH2VQHZX5QV4T5FWV/action/replication_record"}},"created_at":"2026-07-05T10:18:46.356064+00:00","updated_at":"2026-07-05T10:18:46.356064+00:00"}