{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VFSVUHCE4X3OUNAQPDOHR4KN5F","short_pith_number":"pith:VFSVUHCE","schema_version":"1.0","canonical_sha256":"a9655a1c44e5f6ea341078dc78f14de954512823ef449f1471a7a684e4f0a351","source":{"kind":"arxiv","id":"1511.08769","version":2},"attestation_state":"computed","paper":{"title":"Phase Transitions in Semidefinite Relaxations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.IT","math.IT"],"primary_cat":"cond-mat.stat-mech","authors_text":"Adel Javanmard, Andrea Montanari, Federico Ricci-Tersenghi","submitted_at":"2015-11-27T19:16:24Z","abstract_excerpt":"Statistical inference problems arising within signal processing, data mining, and machine learning naturally give rise to hard combinatorial optimization problems. These problems become intractable when the dimensionality of the data is large, as is often the case for modern datasets. A popular idea is to construct convex relaxations of these combinatorial problems, which can be solved efficiently for large scale datasets.\n  Semidefinite programming (SDP) relaxations are among the most powerful methods in this family, and are surprisingly well-suited for a broad range of problems where data ta"},"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":"1511.08769","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2015-11-27T19:16:24Z","cross_cats_sorted":["cs.DM","cs.IT","math.IT"],"title_canon_sha256":"90a29b95bdf8678b11b1b270618d6daf544ffd6c42d6d2c774d245c05e7568b1","abstract_canon_sha256":"c3060004e40cad3f702421e3611d000b3e8655177707d31e245a941ef78e24b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:35.143003Z","signature_b64":"UJOrOIlqbJH5Vk8UMEATzlXkUEcyKHuGu9h54o2rtn8V8RCE4R60Ue6Nb+3cKd442A1s8gIrROf/sj4cAfRtBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9655a1c44e5f6ea341078dc78f14de954512823ef449f1471a7a684e4f0a351","last_reissued_at":"2026-05-18T00:45:35.142470Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:35.142470Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Phase Transitions in Semidefinite Relaxations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.IT","math.IT"],"primary_cat":"cond-mat.stat-mech","authors_text":"Adel Javanmard, Andrea Montanari, Federico Ricci-Tersenghi","submitted_at":"2015-11-27T19:16:24Z","abstract_excerpt":"Statistical inference problems arising within signal processing, data mining, and machine learning naturally give rise to hard combinatorial optimization problems. These problems become intractable when the dimensionality of the data is large, as is often the case for modern datasets. A popular idea is to construct convex relaxations of these combinatorial problems, which can be solved efficiently for large scale datasets.\n  Semidefinite programming (SDP) relaxations are among the most powerful methods in this family, and are surprisingly well-suited for a broad range of problems where data ta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.08769","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":""},"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":"1511.08769","created_at":"2026-05-18T00:45:35.142552+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.08769v2","created_at":"2026-05-18T00:45:35.142552+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08769","created_at":"2026-05-18T00:45:35.142552+00:00"},{"alias_kind":"pith_short_12","alias_value":"VFSVUHCE4X3O","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"VFSVUHCE4X3OUNAQ","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"VFSVUHCE","created_at":"2026-05-18T12:29:44.643036+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/VFSVUHCE4X3OUNAQPDOHR4KN5F","json":"https://pith.science/pith/VFSVUHCE4X3OUNAQPDOHR4KN5F.json","graph_json":"https://pith.science/api/pith-number/VFSVUHCE4X3OUNAQPDOHR4KN5F/graph.json","events_json":"https://pith.science/api/pith-number/VFSVUHCE4X3OUNAQPDOHR4KN5F/events.json","paper":"https://pith.science/paper/VFSVUHCE"},"agent_actions":{"view_html":"https://pith.science/pith/VFSVUHCE4X3OUNAQPDOHR4KN5F","download_json":"https://pith.science/pith/VFSVUHCE4X3OUNAQPDOHR4KN5F.json","view_paper":"https://pith.science/paper/VFSVUHCE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.08769&json=true","fetch_graph":"https://pith.science/api/pith-number/VFSVUHCE4X3OUNAQPDOHR4KN5F/graph.json","fetch_events":"https://pith.science/api/pith-number/VFSVUHCE4X3OUNAQPDOHR4KN5F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VFSVUHCE4X3OUNAQPDOHR4KN5F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VFSVUHCE4X3OUNAQPDOHR4KN5F/action/storage_attestation","attest_author":"https://pith.science/pith/VFSVUHCE4X3OUNAQPDOHR4KN5F/action/author_attestation","sign_citation":"https://pith.science/pith/VFSVUHCE4X3OUNAQPDOHR4KN5F/action/citation_signature","submit_replication":"https://pith.science/pith/VFSVUHCE4X3OUNAQPDOHR4KN5F/action/replication_record"}},"created_at":"2026-05-18T00:45:35.142552+00:00","updated_at":"2026-05-18T00:45:35.142552+00:00"}