{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:M5BQGV4PIX4P7MILTK63LX23NY","short_pith_number":"pith:M5BQGV4P","schema_version":"1.0","canonical_sha256":"674303578f45f8ffb10b9abdb5df5b6e2b6c4f1856c3496626adf9184d430fb0","source":{"kind":"arxiv","id":"1710.11306","version":1},"attestation_state":"computed","paper":{"title":"The Exact Solution to Rank-1 L1-norm TUCKER2 Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.DS","authors_text":"Dimitris G. Chachlakis, Evangelos E. Papalexakis, Panos P. Markopoulos","submitted_at":"2017-10-31T03:01:35Z","abstract_excerpt":"We study rank-1 {L1-norm-based TUCKER2} (L1-TUCKER2) decomposition of 3-way tensors, treated as a collection of $N$ $D \\times M$ matrices that are to be jointly decomposed. Our contributions are as follows. i) We prove that the problem is equivalent to combinatorial optimization over $N$ antipodal-binary variables. ii) We derive the first two algorithms in the literature for its exact solution. The first algorithm has cost exponential in $N$; the second one has cost polynomial in $N$ (under a mild assumption). Our algorithms are accompanied by formal complexity analysis. iii) We conduct numeri"},"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":"1710.11306","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-31T03:01:35Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"a4e22e5b8a455fdb8d04ba3d2061d25e267d3d88a122f3a0e578f2da489af89c","abstract_canon_sha256":"ffeca2d66f379fac83449e2e16cef47263b7317b32ef6325886aaad6c2d0279b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:25.763009Z","signature_b64":"/IkUi3713Y+04F46Z3IUjeBKoohaPTJwa+ZUdkVGmOncntNZML18nvRnhj3Gp404ZiE4AomflfP96VlS/ojdBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"674303578f45f8ffb10b9abdb5df5b6e2b6c4f1856c3496626adf9184d430fb0","last_reissued_at":"2026-05-18T00:19:25.762399Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:25.762399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Exact Solution to Rank-1 L1-norm TUCKER2 Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.DS","authors_text":"Dimitris G. Chachlakis, Evangelos E. Papalexakis, Panos P. Markopoulos","submitted_at":"2017-10-31T03:01:35Z","abstract_excerpt":"We study rank-1 {L1-norm-based TUCKER2} (L1-TUCKER2) decomposition of 3-way tensors, treated as a collection of $N$ $D \\times M$ matrices that are to be jointly decomposed. Our contributions are as follows. i) We prove that the problem is equivalent to combinatorial optimization over $N$ antipodal-binary variables. ii) We derive the first two algorithms in the literature for its exact solution. The first algorithm has cost exponential in $N$; the second one has cost polynomial in $N$ (under a mild assumption). Our algorithms are accompanied by formal complexity analysis. iii) We conduct numeri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.11306","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":""},"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":"1710.11306","created_at":"2026-05-18T00:19:25.762495+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.11306v1","created_at":"2026-05-18T00:19:25.762495+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.11306","created_at":"2026-05-18T00:19:25.762495+00:00"},{"alias_kind":"pith_short_12","alias_value":"M5BQGV4PIX4P","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"M5BQGV4PIX4P7MIL","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"M5BQGV4P","created_at":"2026-05-18T12:31:28.150371+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/M5BQGV4PIX4P7MILTK63LX23NY","json":"https://pith.science/pith/M5BQGV4PIX4P7MILTK63LX23NY.json","graph_json":"https://pith.science/api/pith-number/M5BQGV4PIX4P7MILTK63LX23NY/graph.json","events_json":"https://pith.science/api/pith-number/M5BQGV4PIX4P7MILTK63LX23NY/events.json","paper":"https://pith.science/paper/M5BQGV4P"},"agent_actions":{"view_html":"https://pith.science/pith/M5BQGV4PIX4P7MILTK63LX23NY","download_json":"https://pith.science/pith/M5BQGV4PIX4P7MILTK63LX23NY.json","view_paper":"https://pith.science/paper/M5BQGV4P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.11306&json=true","fetch_graph":"https://pith.science/api/pith-number/M5BQGV4PIX4P7MILTK63LX23NY/graph.json","fetch_events":"https://pith.science/api/pith-number/M5BQGV4PIX4P7MILTK63LX23NY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M5BQGV4PIX4P7MILTK63LX23NY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M5BQGV4PIX4P7MILTK63LX23NY/action/storage_attestation","attest_author":"https://pith.science/pith/M5BQGV4PIX4P7MILTK63LX23NY/action/author_attestation","sign_citation":"https://pith.science/pith/M5BQGV4PIX4P7MILTK63LX23NY/action/citation_signature","submit_replication":"https://pith.science/pith/M5BQGV4PIX4P7MILTK63LX23NY/action/replication_record"}},"created_at":"2026-05-18T00:19:25.762495+00:00","updated_at":"2026-05-18T00:19:25.762495+00:00"}