{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:BJM7N42BA4PLLHY5663IHGC4CQ","short_pith_number":"pith:BJM7N42B","schema_version":"1.0","canonical_sha256":"0a59f6f341071eb59f1df7b683985c14325564ef7424e3a0366c4118d9febdcb","source":{"kind":"arxiv","id":"1308.5207","version":4},"attestation_state":"computed","paper":{"title":"Approximating the Little Grothendieck Problem over the Orthogonal and Unitary Groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Afonso S. Bandeira, Amit Singer, Christopher Kennedy","submitted_at":"2013-08-23T18:53:30Z","abstract_excerpt":"The little Grothendieck problem consists of maximizing $\\sum_{ij}C_{ij}x_ix_j$ over binary variables $x_i\\in\\{\\pm1\\}$, where C is a positive semidefinite matrix. In this paper we focus on a natural generalization of this problem, the little Grothendieck problem over the orthogonal group. Given C a dn x dn positive semidefinite matrix, the objective is to maximize $\\sum_{ij}Tr (C_{ij}^TO_iO_j^T)$ restricting $O_i$ to take values in the group of orthogonal matrices, where $C_{ij}$ denotes the (ij)-th d x d block of C. We propose an approximation algorithm, which we refer to as Orthogonal-Cut, to"},"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":"1308.5207","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-23T18:53:30Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"53d488a5d1599bcccdeb79782c33af1ec2c9ad24ad2ba5bda4051b5cb1470e2a","abstract_canon_sha256":"a6de8926cfdc2fda10baa7f32e393950618ad06ce8a0b883b97c34d9fa516050"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:55.646085Z","signature_b64":"1+TgjhgFWJ1w/+Bk7egWY+qJvGzK+C27uvbJFTeDW0RyA2SfrVTgowjy8A98Ixa3KUh8MyejFV2AuAv1hb6UDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a59f6f341071eb59f1df7b683985c14325564ef7424e3a0366c4118d9febdcb","last_reissued_at":"2026-05-18T01:30:55.645562Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:55.645562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating the Little Grothendieck Problem over the Orthogonal and Unitary Groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Afonso S. Bandeira, Amit Singer, Christopher Kennedy","submitted_at":"2013-08-23T18:53:30Z","abstract_excerpt":"The little Grothendieck problem consists of maximizing $\\sum_{ij}C_{ij}x_ix_j$ over binary variables $x_i\\in\\{\\pm1\\}$, where C is a positive semidefinite matrix. In this paper we focus on a natural generalization of this problem, the little Grothendieck problem over the orthogonal group. Given C a dn x dn positive semidefinite matrix, the objective is to maximize $\\sum_{ij}Tr (C_{ij}^TO_iO_j^T)$ restricting $O_i$ to take values in the group of orthogonal matrices, where $C_{ij}$ denotes the (ij)-th d x d block of C. We propose an approximation algorithm, which we refer to as Orthogonal-Cut, to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.5207","kind":"arxiv","version":4},"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":"1308.5207","created_at":"2026-05-18T01:30:55.645667+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.5207v4","created_at":"2026-05-18T01:30:55.645667+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.5207","created_at":"2026-05-18T01:30:55.645667+00:00"},{"alias_kind":"pith_short_12","alias_value":"BJM7N42BA4PL","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"BJM7N42BA4PLLHY5","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"BJM7N42B","created_at":"2026-05-18T12:27:38.830355+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/BJM7N42BA4PLLHY5663IHGC4CQ","json":"https://pith.science/pith/BJM7N42BA4PLLHY5663IHGC4CQ.json","graph_json":"https://pith.science/api/pith-number/BJM7N42BA4PLLHY5663IHGC4CQ/graph.json","events_json":"https://pith.science/api/pith-number/BJM7N42BA4PLLHY5663IHGC4CQ/events.json","paper":"https://pith.science/paper/BJM7N42B"},"agent_actions":{"view_html":"https://pith.science/pith/BJM7N42BA4PLLHY5663IHGC4CQ","download_json":"https://pith.science/pith/BJM7N42BA4PLLHY5663IHGC4CQ.json","view_paper":"https://pith.science/paper/BJM7N42B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.5207&json=true","fetch_graph":"https://pith.science/api/pith-number/BJM7N42BA4PLLHY5663IHGC4CQ/graph.json","fetch_events":"https://pith.science/api/pith-number/BJM7N42BA4PLLHY5663IHGC4CQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BJM7N42BA4PLLHY5663IHGC4CQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BJM7N42BA4PLLHY5663IHGC4CQ/action/storage_attestation","attest_author":"https://pith.science/pith/BJM7N42BA4PLLHY5663IHGC4CQ/action/author_attestation","sign_citation":"https://pith.science/pith/BJM7N42BA4PLLHY5663IHGC4CQ/action/citation_signature","submit_replication":"https://pith.science/pith/BJM7N42BA4PLLHY5663IHGC4CQ/action/replication_record"}},"created_at":"2026-05-18T01:30:55.645667+00:00","updated_at":"2026-05-18T01:30:55.645667+00:00"}