{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:M5BQGV4PIX4P7MILTK63LX23NY","short_pith_number":"pith:M5BQGV4P","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"},"canonical_sha256":"674303578f45f8ffb10b9abdb5df5b6e2b6c4f1856c3496626adf9184d430fb0","source":{"kind":"arxiv","id":"1710.11306","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.11306","created_at":"2026-05-18T00:19:25Z"},{"alias_kind":"arxiv_version","alias_value":"1710.11306v1","created_at":"2026-05-18T00:19:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.11306","created_at":"2026-05-18T00:19:25Z"},{"alias_kind":"pith_short_12","alias_value":"M5BQGV4PIX4P","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"M5BQGV4PIX4P7MIL","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"M5BQGV4P","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:M5BQGV4PIX4P7MILTK63LX23NY","target":"record","payload":{"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"},"canonical_sha256":"674303578f45f8ffb10b9abdb5df5b6e2b6c4f1856c3496626adf9184d430fb0","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"},"source_kind":"arxiv","source_id":"1710.11306","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:19:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J1gs/7HaH7yZDo55FvR43NhNLxLskxfEmmnObGwKEZ95VuFT44N+COOXZvsqtJOIrJoTQ90asazSL52+SF7gAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T23:05:56.172129Z"},"content_sha256":"45a1dcf844c6c4abb40eb027313cd56390079a07521053870a66604723beedc8","schema_version":"1.0","event_id":"sha256:45a1dcf844c6c4abb40eb027313cd56390079a07521053870a66604723beedc8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:M5BQGV4PIX4P7MILTK63LX23NY","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:19:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xPNPYnQY/BkfgTMwNn/VziUYsV5UtP/olVDRSJg/3ns8QTJVjzOVQXpwZ3rh6yJt6urQKS8iaHv+EjnL7rhQDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T23:05:56.172809Z"},"content_sha256":"3623967bc99b853d784dcb3ad08222e777078da1af16bc464db0f7bc0aadc49d","schema_version":"1.0","event_id":"sha256:3623967bc99b853d784dcb3ad08222e777078da1af16bc464db0f7bc0aadc49d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M5BQGV4PIX4P7MILTK63LX23NY/bundle.json","state_url":"https://pith.science/pith/M5BQGV4PIX4P7MILTK63LX23NY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M5BQGV4PIX4P7MILTK63LX23NY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-07T23:05:56Z","links":{"resolver":"https://pith.science/pith/M5BQGV4PIX4P7MILTK63LX23NY","bundle":"https://pith.science/pith/M5BQGV4PIX4P7MILTK63LX23NY/bundle.json","state":"https://pith.science/pith/M5BQGV4PIX4P7MILTK63LX23NY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M5BQGV4PIX4P7MILTK63LX23NY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:M5BQGV4PIX4P7MILTK63LX23NY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ffeca2d66f379fac83449e2e16cef47263b7317b32ef6325886aaad6c2d0279b","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-31T03:01:35Z","title_canon_sha256":"a4e22e5b8a455fdb8d04ba3d2061d25e267d3d88a122f3a0e578f2da489af89c"},"schema_version":"1.0","source":{"id":"1710.11306","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.11306","created_at":"2026-05-18T00:19:25Z"},{"alias_kind":"arxiv_version","alias_value":"1710.11306v1","created_at":"2026-05-18T00:19:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.11306","created_at":"2026-05-18T00:19:25Z"},{"alias_kind":"pith_short_12","alias_value":"M5BQGV4PIX4P","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"M5BQGV4PIX4P7MIL","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"M5BQGV4P","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:3623967bc99b853d784dcb3ad08222e777078da1af16bc464db0f7bc0aadc49d","target":"graph","created_at":"2026-05-18T00:19:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Dimitris G. Chachlakis, Evangelos E. Papalexakis, Panos P. Markopoulos","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-31T03:01:35Z","title":"The Exact Solution to Rank-1 L1-norm TUCKER2 Decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.11306","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:45a1dcf844c6c4abb40eb027313cd56390079a07521053870a66604723beedc8","target":"record","created_at":"2026-05-18T00:19:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ffeca2d66f379fac83449e2e16cef47263b7317b32ef6325886aaad6c2d0279b","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-31T03:01:35Z","title_canon_sha256":"a4e22e5b8a455fdb8d04ba3d2061d25e267d3d88a122f3a0e578f2da489af89c"},"schema_version":"1.0","source":{"id":"1710.11306","kind":"arxiv","version":1}},"canonical_sha256":"674303578f45f8ffb10b9abdb5df5b6e2b6c4f1856c3496626adf9184d430fb0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"674303578f45f8ffb10b9abdb5df5b6e2b6c4f1856c3496626adf9184d430fb0","first_computed_at":"2026-05-18T00:19:25.762399Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:25.762399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/IkUi3713Y+04F46Z3IUjeBKoohaPTJwa+ZUdkVGmOncntNZML18nvRnhj3Gp404ZiE4AomflfP96VlS/ojdBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:25.763009Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.11306","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:45a1dcf844c6c4abb40eb027313cd56390079a07521053870a66604723beedc8","sha256:3623967bc99b853d784dcb3ad08222e777078da1af16bc464db0f7bc0aadc49d"],"state_sha256":"5d11e6c271e01ebaec00f571b46f2659e12985ece80d21c876a01c5d29fcc42d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"31shYWF4gjTi+Wz4AAXXGNK+ta67u10zYpwzNealbi8cNJvaByVnYY+2JuNolGuXWmdETf7UpXDYQX8nCHd9Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T23:05:56.176768Z","bundle_sha256":"4f0b2894e636c1f0db0b451ec2a38e6c9357c3d4588a06cb1e5c342c0225f832"}}