{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:XKVH6H4PUVJ33Q4LBUY3HC4PMN","short_pith_number":"pith:XKVH6H4P","schema_version":"1.0","canonical_sha256":"baaa7f1f8fa553bdc38b0d31b38b8f635f738d59fc88ced1ac41e61d4f51d815","source":{"kind":"arxiv","id":"1909.01201","version":1},"attestation_state":"computed","paper":{"title":"Starting CLuP with polytope relaxation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Mihailo Stojnic","submitted_at":"2019-09-03T14:13:29Z","abstract_excerpt":"The Controlled Loosening-up (CLuP) mechanism that we recently introduced in \\cite{Stojnicclupint19} is a generic concept that can be utilized to solve a large class of problems in polynomial time. Since it relies in its core on an iterative procedure, the key to its excellent performance lies in a typically very small number of iterations needed to execute the entire algorithm. In a separate paper \\cite{Stojnicclupcmpl19}, we presented a detailed complexity analysis that indeed confirms the relatively small number of iterations. Since both papers, \\cite{Stojnicclupint19} and \\cite{Stojnicclupc"},"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":"1909.01201","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-09-03T14:13:29Z","cross_cats_sorted":["math.IT","math.ST","stat.TH"],"title_canon_sha256":"2854b36ca6e4d381273bcbf6d04ceb72a915aaaea15275f50043af306d73acc1","abstract_canon_sha256":"92aa3e37797b74c4127c8c5be77ca4159bc4b19b78fcf84372c31b7b3fa81b03"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:01:16.889977Z","signature_b64":"C9UirnVsPTQhYS18JT1YlWMvgLywbrZ+xXQKmL1cGYs39pY0Th7DWoYRsLUI9f3hRmFAZtRbr0gtXTaVxorFBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"baaa7f1f8fa553bdc38b0d31b38b8f635f738d59fc88ced1ac41e61d4f51d815","last_reissued_at":"2026-07-05T00:01:16.889480Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:01:16.889480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Starting CLuP with polytope relaxation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Mihailo Stojnic","submitted_at":"2019-09-03T14:13:29Z","abstract_excerpt":"The Controlled Loosening-up (CLuP) mechanism that we recently introduced in \\cite{Stojnicclupint19} is a generic concept that can be utilized to solve a large class of problems in polynomial time. Since it relies in its core on an iterative procedure, the key to its excellent performance lies in a typically very small number of iterations needed to execute the entire algorithm. In a separate paper \\cite{Stojnicclupcmpl19}, we presented a detailed complexity analysis that indeed confirms the relatively small number of iterations. Since both papers, \\cite{Stojnicclupint19} and \\cite{Stojnicclupc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.01201","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/1909.01201/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":"1909.01201","created_at":"2026-07-05T00:01:16.889548+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.01201v1","created_at":"2026-07-05T00:01:16.889548+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.01201","created_at":"2026-07-05T00:01:16.889548+00:00"},{"alias_kind":"pith_short_12","alias_value":"XKVH6H4PUVJ3","created_at":"2026-07-05T00:01:16.889548+00:00"},{"alias_kind":"pith_short_16","alias_value":"XKVH6H4PUVJ33Q4L","created_at":"2026-07-05T00:01:16.889548+00:00"},{"alias_kind":"pith_short_8","alias_value":"XKVH6H4P","created_at":"2026-07-05T00:01:16.889548+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/XKVH6H4PUVJ33Q4LBUY3HC4PMN","json":"https://pith.science/pith/XKVH6H4PUVJ33Q4LBUY3HC4PMN.json","graph_json":"https://pith.science/api/pith-number/XKVH6H4PUVJ33Q4LBUY3HC4PMN/graph.json","events_json":"https://pith.science/api/pith-number/XKVH6H4PUVJ33Q4LBUY3HC4PMN/events.json","paper":"https://pith.science/paper/XKVH6H4P"},"agent_actions":{"view_html":"https://pith.science/pith/XKVH6H4PUVJ33Q4LBUY3HC4PMN","download_json":"https://pith.science/pith/XKVH6H4PUVJ33Q4LBUY3HC4PMN.json","view_paper":"https://pith.science/paper/XKVH6H4P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.01201&json=true","fetch_graph":"https://pith.science/api/pith-number/XKVH6H4PUVJ33Q4LBUY3HC4PMN/graph.json","fetch_events":"https://pith.science/api/pith-number/XKVH6H4PUVJ33Q4LBUY3HC4PMN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XKVH6H4PUVJ33Q4LBUY3HC4PMN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XKVH6H4PUVJ33Q4LBUY3HC4PMN/action/storage_attestation","attest_author":"https://pith.science/pith/XKVH6H4PUVJ33Q4LBUY3HC4PMN/action/author_attestation","sign_citation":"https://pith.science/pith/XKVH6H4PUVJ33Q4LBUY3HC4PMN/action/citation_signature","submit_replication":"https://pith.science/pith/XKVH6H4PUVJ33Q4LBUY3HC4PMN/action/replication_record"}},"created_at":"2026-07-05T00:01:16.889548+00:00","updated_at":"2026-07-05T00:01:16.889548+00:00"}