{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:XKVH6H4PUVJ33Q4LBUY3HC4PMN","short_pith_number":"pith:XKVH6H4P","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"},"canonical_sha256":"baaa7f1f8fa553bdc38b0d31b38b8f635f738d59fc88ced1ac41e61d4f51d815","source":{"kind":"arxiv","id":"1909.01201","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.01201","created_at":"2026-07-05T00:01:16Z"},{"alias_kind":"arxiv_version","alias_value":"1909.01201v1","created_at":"2026-07-05T00:01:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.01201","created_at":"2026-07-05T00:01:16Z"},{"alias_kind":"pith_short_12","alias_value":"XKVH6H4PUVJ3","created_at":"2026-07-05T00:01:16Z"},{"alias_kind":"pith_short_16","alias_value":"XKVH6H4PUVJ33Q4L","created_at":"2026-07-05T00:01:16Z"},{"alias_kind":"pith_short_8","alias_value":"XKVH6H4P","created_at":"2026-07-05T00:01:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:XKVH6H4PUVJ33Q4LBUY3HC4PMN","target":"record","payload":{"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"},"canonical_sha256":"baaa7f1f8fa553bdc38b0d31b38b8f635f738d59fc88ced1ac41e61d4f51d815","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"},"source_kind":"arxiv","source_id":"1909.01201","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T00:01:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v1G2s6tbz+1jDDffGrc0hOxjml0mrQk6UKVDwJBTT6/4zqEHMPtpDPiJF9ug0/zG+J3TfDkNJ+usRawtN6snBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T17:39:14.272927Z"},"content_sha256":"2afa9b5d60117d46b53d68d35a8c53bdad585bae80063a2a22fb3c23de3c1e38","schema_version":"1.0","event_id":"sha256:2afa9b5d60117d46b53d68d35a8c53bdad585bae80063a2a22fb3c23de3c1e38"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:XKVH6H4PUVJ33Q4LBUY3HC4PMN","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T00:01:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P66JHagXFN+cRgMDQGRS5LeFmF+oRPnu5wK1avcLNSXS2iUIW7xlzJ10Mlm6qpDzClW3pUGdnkLyvwsIUmArDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T17:39:14.273443Z"},"content_sha256":"7ec73dc1c8eff7e0ebc4c570d00dbe7afbe6a91b1219156057b2cf1df7ff2282","schema_version":"1.0","event_id":"sha256:7ec73dc1c8eff7e0ebc4c570d00dbe7afbe6a91b1219156057b2cf1df7ff2282"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XKVH6H4PUVJ33Q4LBUY3HC4PMN/bundle.json","state_url":"https://pith.science/pith/XKVH6H4PUVJ33Q4LBUY3HC4PMN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XKVH6H4PUVJ33Q4LBUY3HC4PMN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-18T17:39:14Z","links":{"resolver":"https://pith.science/pith/XKVH6H4PUVJ33Q4LBUY3HC4PMN","bundle":"https://pith.science/pith/XKVH6H4PUVJ33Q4LBUY3HC4PMN/bundle.json","state":"https://pith.science/pith/XKVH6H4PUVJ33Q4LBUY3HC4PMN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XKVH6H4PUVJ33Q4LBUY3HC4PMN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:XKVH6H4PUVJ33Q4LBUY3HC4PMN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"92aa3e37797b74c4127c8c5be77ca4159bc4b19b78fcf84372c31b7b3fa81b03","cross_cats_sorted":["math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-09-03T14:13:29Z","title_canon_sha256":"2854b36ca6e4d381273bcbf6d04ceb72a915aaaea15275f50043af306d73acc1"},"schema_version":"1.0","source":{"id":"1909.01201","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.01201","created_at":"2026-07-05T00:01:16Z"},{"alias_kind":"arxiv_version","alias_value":"1909.01201v1","created_at":"2026-07-05T00:01:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.01201","created_at":"2026-07-05T00:01:16Z"},{"alias_kind":"pith_short_12","alias_value":"XKVH6H4PUVJ3","created_at":"2026-07-05T00:01:16Z"},{"alias_kind":"pith_short_16","alias_value":"XKVH6H4PUVJ33Q4L","created_at":"2026-07-05T00:01:16Z"},{"alias_kind":"pith_short_8","alias_value":"XKVH6H4P","created_at":"2026-07-05T00:01:16Z"}],"graph_snapshots":[{"event_id":"sha256:7ec73dc1c8eff7e0ebc4c570d00dbe7afbe6a91b1219156057b2cf1df7ff2282","target":"graph","created_at":"2026-07-05T00:01:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1909.01201/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Mihailo Stojnic","cross_cats":["math.IT","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-09-03T14:13:29Z","title":"Starting CLuP with polytope relaxation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.01201","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2afa9b5d60117d46b53d68d35a8c53bdad585bae80063a2a22fb3c23de3c1e38","target":"record","created_at":"2026-07-05T00:01:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"92aa3e37797b74c4127c8c5be77ca4159bc4b19b78fcf84372c31b7b3fa81b03","cross_cats_sorted":["math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-09-03T14:13:29Z","title_canon_sha256":"2854b36ca6e4d381273bcbf6d04ceb72a915aaaea15275f50043af306d73acc1"},"schema_version":"1.0","source":{"id":"1909.01201","kind":"arxiv","version":1}},"canonical_sha256":"baaa7f1f8fa553bdc38b0d31b38b8f635f738d59fc88ced1ac41e61d4f51d815","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"baaa7f1f8fa553bdc38b0d31b38b8f635f738d59fc88ced1ac41e61d4f51d815","first_computed_at":"2026-07-05T00:01:16.889480Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:01:16.889480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C9UirnVsPTQhYS18JT1YlWMvgLywbrZ+xXQKmL1cGYs39pY0Th7DWoYRsLUI9f3hRmFAZtRbr0gtXTaVxorFBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:01:16.889977Z","signed_message":"canonical_sha256_bytes"},"source_id":"1909.01201","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2afa9b5d60117d46b53d68d35a8c53bdad585bae80063a2a22fb3c23de3c1e38","sha256:7ec73dc1c8eff7e0ebc4c570d00dbe7afbe6a91b1219156057b2cf1df7ff2282"],"state_sha256":"233380142dce49a087ed43fed7257634483f1859fa4ad85f4cbe933f331d409e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OzaBdsJdaXBfjLvmIEYg7YqgFI40KJ3U0DD38DteJRneIkoFhKJOC4+Xa4MSLHE+lKUG1XepfKptP8dF42r3DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T17:39:14.278676Z","bundle_sha256":"5268d5deee5dbea50598c90536f69c90094c9f3b70d5acc88b0d1e5678f5b833"}}