{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:E3Z7M6Q7P4KOB2WUEWPDZAPTAN","short_pith_number":"pith:E3Z7M6Q7","schema_version":"1.0","canonical_sha256":"26f3f67a1f7f14e0ead4259e3c81f30355482ba39b332b771d0f3eb9636087a5","source":{"kind":"arxiv","id":"2608.00740","version":1},"attestation_state":"computed","paper":{"title":"Dynamic-Threshold Algorithms for the Continuous Quadratic Knapsack Problem: Reset Mechanisms and Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Chuan Yang, Peicheng Xie, Yong-jin Liu","submitted_at":"2026-08-01T16:22:57Z","abstract_excerpt":"Condat's algorithm is an efficient dynamic-threshold method for projection onto the simplex, but its extension to weighted equality constraints and the algorithmic roles of resetting and removal have received limited analysis. We develop a dynamic-threshold algorithm (DTA) for a continuous quadratic knapsack problem with a weighted equality constraint. DTA maintains a threshold invariant through three operations--addition, reset, and removal--and we establish its finite termination and correctness. A sufficient condition under which reset cannot occur motivates a simpler no-reset variant, NDTA"},"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":"2608.00740","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-08-01T16:22:57Z","cross_cats_sorted":[],"title_canon_sha256":"99ee74225e23b6b059bb5823ddafcd65dac88c9326eee9bad78de2ef4a4242e0","abstract_canon_sha256":"77c80745d5814612820a3171b10a439a3606e265c62ccdc0ea0f29c5e0cf66f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-04T01:54:51.231701Z","signature_b64":"vPbYhI43+4c5f2coj3dA6zL2w7TDpRfpbnpU47ylrqURlFYEnySvwSo6zGrknAkdTJDGHc5CZsoGrE4BqMqqBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26f3f67a1f7f14e0ead4259e3c81f30355482ba39b332b771d0f3eb9636087a5","last_reissued_at":"2026-08-04T01:54:51.230035Z","signature_status":"signed_v1","first_computed_at":"2026-08-04T01:54:51.230035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic-Threshold Algorithms for the Continuous Quadratic Knapsack Problem: Reset Mechanisms and Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Chuan Yang, Peicheng Xie, Yong-jin Liu","submitted_at":"2026-08-01T16:22:57Z","abstract_excerpt":"Condat's algorithm is an efficient dynamic-threshold method for projection onto the simplex, but its extension to weighted equality constraints and the algorithmic roles of resetting and removal have received limited analysis. We develop a dynamic-threshold algorithm (DTA) for a continuous quadratic knapsack problem with a weighted equality constraint. DTA maintains a threshold invariant through three operations--addition, reset, and removal--and we establish its finite termination and correctness. A sufficient condition under which reset cannot occur motivates a simpler no-reset variant, NDTA"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.00740","kind":"arxiv","version":1},"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/2608.00740/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":"2608.00740","created_at":"2026-08-04T01:54:51.231315+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.00740v1","created_at":"2026-08-04T01:54:51.231315+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.00740","created_at":"2026-08-04T01:54:51.231315+00:00"},{"alias_kind":"pith_short_12","alias_value":"E3Z7M6Q7P4KO","created_at":"2026-08-04T01:54:51.231315+00:00"},{"alias_kind":"pith_short_16","alias_value":"E3Z7M6Q7P4KOB2WU","created_at":"2026-08-04T01:54:51.231315+00:00"},{"alias_kind":"pith_short_8","alias_value":"E3Z7M6Q7","created_at":"2026-08-04T01:54:51.231315+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/E3Z7M6Q7P4KOB2WUEWPDZAPTAN","json":"https://pith.science/pith/E3Z7M6Q7P4KOB2WUEWPDZAPTAN.json","graph_json":"https://pith.science/api/pith-number/E3Z7M6Q7P4KOB2WUEWPDZAPTAN/graph.json","events_json":"https://pith.science/api/pith-number/E3Z7M6Q7P4KOB2WUEWPDZAPTAN/events.json","paper":"https://pith.science/paper/E3Z7M6Q7"},"agent_actions":{"view_html":"https://pith.science/pith/E3Z7M6Q7P4KOB2WUEWPDZAPTAN","download_json":"https://pith.science/pith/E3Z7M6Q7P4KOB2WUEWPDZAPTAN.json","view_paper":"https://pith.science/paper/E3Z7M6Q7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.00740&json=true","fetch_graph":"https://pith.science/api/pith-number/E3Z7M6Q7P4KOB2WUEWPDZAPTAN/graph.json","fetch_events":"https://pith.science/api/pith-number/E3Z7M6Q7P4KOB2WUEWPDZAPTAN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E3Z7M6Q7P4KOB2WUEWPDZAPTAN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E3Z7M6Q7P4KOB2WUEWPDZAPTAN/action/storage_attestation","attest_author":"https://pith.science/pith/E3Z7M6Q7P4KOB2WUEWPDZAPTAN/action/author_attestation","sign_citation":"https://pith.science/pith/E3Z7M6Q7P4KOB2WUEWPDZAPTAN/action/citation_signature","submit_replication":"https://pith.science/pith/E3Z7M6Q7P4KOB2WUEWPDZAPTAN/action/replication_record"}},"created_at":"2026-08-04T01:54:51.231315+00:00","updated_at":"2026-08-04T01:54:51.231315+00:00"}