{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:IOR4UNEEC2TROFJIT453OVQTL6","short_pith_number":"pith:IOR4UNEE","schema_version":"1.0","canonical_sha256":"43a3ca348416a71715289f3bb756135f8aed10d5db2ae9ea90157bfc24e7ed00","source":{"kind":"arxiv","id":"2507.13776","version":1},"attestation_state":"computed","paper":{"title":"RiNNAL+: a Riemannian ALM Solver for SDP-RLT Relaxations of Mixed-Binary Quadratic Programs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Di Hou, Kim-Chuan Toh, Tianyun Tang","submitted_at":"2025-07-18T09:36:29Z","abstract_excerpt":"Doubly nonnegative (DNN) relaxation usually provides a tight lower bound for a mixed-binary quadratic program (MBQP). However, solving DNN problems is challenging because: (1) the problem size is $\\Omega((n+l)^2)$ for an MBQP with $n$ variables and $l$ inequality constraints, and (2) the rank of optimal solutions cannot be estimated a priori due to the absence of theoretical bounds. In this work, we propose RiNNAL+, a Riemannian augmented Lagrangian method (ALM) for solving DNN problems. We prove that the DNN relaxation of an MBQP, with matrix dimension $(n+l+1)$, is equivalent to the SDP-RLT "},"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":"2507.13776","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-07-18T09:36:29Z","cross_cats_sorted":[],"title_canon_sha256":"ea62a53a3940359a69d9bead1cc400b1215122d75e239e59ff523f1c126822ca","abstract_canon_sha256":"5baa3e8385b2aa49a878c1f134df223b1383f9825dd20cc1414277dc5f125cd2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:39:22.802908Z","signature_b64":"EXcrgTtat8Y3gXxVABC5KZ2FJAFQWmq6rDR993AODju+IFlj2MEtm/ipmSRe130Sbs5AozIvcfyHrG56c92BBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43a3ca348416a71715289f3bb756135f8aed10d5db2ae9ea90157bfc24e7ed00","last_reissued_at":"2026-07-05T11:39:22.802432Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:39:22.802432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"RiNNAL+: a Riemannian ALM Solver for SDP-RLT Relaxations of Mixed-Binary Quadratic Programs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Di Hou, Kim-Chuan Toh, Tianyun Tang","submitted_at":"2025-07-18T09:36:29Z","abstract_excerpt":"Doubly nonnegative (DNN) relaxation usually provides a tight lower bound for a mixed-binary quadratic program (MBQP). However, solving DNN problems is challenging because: (1) the problem size is $\\Omega((n+l)^2)$ for an MBQP with $n$ variables and $l$ inequality constraints, and (2) the rank of optimal solutions cannot be estimated a priori due to the absence of theoretical bounds. In this work, we propose RiNNAL+, a Riemannian augmented Lagrangian method (ALM) for solving DNN problems. We prove that the DNN relaxation of an MBQP, with matrix dimension $(n+l+1)$, is equivalent to the SDP-RLT "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.13776","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/2507.13776/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":"2507.13776","created_at":"2026-07-05T11:39:22.802495+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.13776v1","created_at":"2026-07-05T11:39:22.802495+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.13776","created_at":"2026-07-05T11:39:22.802495+00:00"},{"alias_kind":"pith_short_12","alias_value":"IOR4UNEEC2TR","created_at":"2026-07-05T11:39:22.802495+00:00"},{"alias_kind":"pith_short_16","alias_value":"IOR4UNEEC2TROFJI","created_at":"2026-07-05T11:39:22.802495+00:00"},{"alias_kind":"pith_short_8","alias_value":"IOR4UNEE","created_at":"2026-07-05T11:39:22.802495+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/IOR4UNEEC2TROFJIT453OVQTL6","json":"https://pith.science/pith/IOR4UNEEC2TROFJIT453OVQTL6.json","graph_json":"https://pith.science/api/pith-number/IOR4UNEEC2TROFJIT453OVQTL6/graph.json","events_json":"https://pith.science/api/pith-number/IOR4UNEEC2TROFJIT453OVQTL6/events.json","paper":"https://pith.science/paper/IOR4UNEE"},"agent_actions":{"view_html":"https://pith.science/pith/IOR4UNEEC2TROFJIT453OVQTL6","download_json":"https://pith.science/pith/IOR4UNEEC2TROFJIT453OVQTL6.json","view_paper":"https://pith.science/paper/IOR4UNEE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.13776&json=true","fetch_graph":"https://pith.science/api/pith-number/IOR4UNEEC2TROFJIT453OVQTL6/graph.json","fetch_events":"https://pith.science/api/pith-number/IOR4UNEEC2TROFJIT453OVQTL6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IOR4UNEEC2TROFJIT453OVQTL6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IOR4UNEEC2TROFJIT453OVQTL6/action/storage_attestation","attest_author":"https://pith.science/pith/IOR4UNEEC2TROFJIT453OVQTL6/action/author_attestation","sign_citation":"https://pith.science/pith/IOR4UNEEC2TROFJIT453OVQTL6/action/citation_signature","submit_replication":"https://pith.science/pith/IOR4UNEEC2TROFJIT453OVQTL6/action/replication_record"}},"created_at":"2026-07-05T11:39:22.802495+00:00","updated_at":"2026-07-05T11:39:22.802495+00:00"}