{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:TCRBF6VQIAXFWPD6Y55URXPVJM","short_pith_number":"pith:TCRBF6VQ","schema_version":"1.0","canonical_sha256":"98a212fab0402e5b3c7ec77b48ddf54b3c76f76feb14a334c05cb3a61c34748f","source":{"kind":"arxiv","id":"1110.6217","version":3},"attestation_state":"computed","paper":{"title":"Algorithm to find a maximum of a multilinear map over a product of spheres","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"math.AG","authors_text":"Cesar Massri","submitted_at":"2011-10-27T23:33:54Z","abstract_excerpt":"We provide an algorithm to compute the 2-norm maximum of a multilinear map over a product of spheres. As a corollary we give a method to compute the first singular value of a linear map and an application to the theory of entangled states in quantum physics. Also, we give an application to find the closest rank-one tensor of a given one."},"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":"1110.6217","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2011-10-27T23:33:54Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"d4a91ea02cf70ac65358126c5eb40aab122aaa8ea35da69fc15d106e7e5a2bd6","abstract_canon_sha256":"f852647b5d24ce4cd9e290996a359d437f911c73bf6cfe3c783324516a954255"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:31.612389Z","signature_b64":"7vZdAOgLDiTL8Hr2he/8cPNTpVhjritLDKSi5TT0GvkNoPMgp2EYDGv+ZbK59zIJIB7jFMR1bn9pj1jnc83ICw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98a212fab0402e5b3c7ec77b48ddf54b3c76f76feb14a334c05cb3a61c34748f","last_reissued_at":"2026-05-18T03:46:31.611494Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:31.611494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithm to find a maximum of a multilinear map over a product of spheres","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"math.AG","authors_text":"Cesar Massri","submitted_at":"2011-10-27T23:33:54Z","abstract_excerpt":"We provide an algorithm to compute the 2-norm maximum of a multilinear map over a product of spheres. As a corollary we give a method to compute the first singular value of a linear map and an application to the theory of entangled states in quantum physics. Also, we give an application to find the closest rank-one tensor of a given one."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.6217","kind":"arxiv","version":3},"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":"1110.6217","created_at":"2026-05-18T03:46:31.611676+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.6217v3","created_at":"2026-05-18T03:46:31.611676+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.6217","created_at":"2026-05-18T03:46:31.611676+00:00"},{"alias_kind":"pith_short_12","alias_value":"TCRBF6VQIAXF","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"TCRBF6VQIAXFWPD6","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"TCRBF6VQ","created_at":"2026-05-18T12:26:42.757692+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/TCRBF6VQIAXFWPD6Y55URXPVJM","json":"https://pith.science/pith/TCRBF6VQIAXFWPD6Y55URXPVJM.json","graph_json":"https://pith.science/api/pith-number/TCRBF6VQIAXFWPD6Y55URXPVJM/graph.json","events_json":"https://pith.science/api/pith-number/TCRBF6VQIAXFWPD6Y55URXPVJM/events.json","paper":"https://pith.science/paper/TCRBF6VQ"},"agent_actions":{"view_html":"https://pith.science/pith/TCRBF6VQIAXFWPD6Y55URXPVJM","download_json":"https://pith.science/pith/TCRBF6VQIAXFWPD6Y55URXPVJM.json","view_paper":"https://pith.science/paper/TCRBF6VQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.6217&json=true","fetch_graph":"https://pith.science/api/pith-number/TCRBF6VQIAXFWPD6Y55URXPVJM/graph.json","fetch_events":"https://pith.science/api/pith-number/TCRBF6VQIAXFWPD6Y55URXPVJM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TCRBF6VQIAXFWPD6Y55URXPVJM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TCRBF6VQIAXFWPD6Y55URXPVJM/action/storage_attestation","attest_author":"https://pith.science/pith/TCRBF6VQIAXFWPD6Y55URXPVJM/action/author_attestation","sign_citation":"https://pith.science/pith/TCRBF6VQIAXFWPD6Y55URXPVJM/action/citation_signature","submit_replication":"https://pith.science/pith/TCRBF6VQIAXFWPD6Y55URXPVJM/action/replication_record"}},"created_at":"2026-05-18T03:46:31.611676+00:00","updated_at":"2026-05-18T03:46:31.611676+00:00"}