{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KH3FL6GCUZ252SIEJUDBMV5DMB","short_pith_number":"pith:KH3FL6GC","canonical_record":{"source":{"id":"1511.05208","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-11-16T22:36:26Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"0d1d84cfa66f684e527c0cf86312b4e1456169efd3f73d839075428d2630c651","abstract_canon_sha256":"fcf1cbe8af000c3683915e28c28517306f3d537d71e1888bb2090b9547aec240"},"schema_version":"1.0"},"canonical_sha256":"51f655f8c2a675dd49044d061657a360617b511c469a3305d5615c12cc23b420","source":{"kind":"arxiv","id":"1511.05208","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.05208","created_at":"2026-05-18T01:11:38Z"},{"alias_kind":"arxiv_version","alias_value":"1511.05208v3","created_at":"2026-05-18T01:11:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05208","created_at":"2026-05-18T01:11:38Z"},{"alias_kind":"pith_short_12","alias_value":"KH3FL6GCUZ25","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"KH3FL6GCUZ252SIE","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"KH3FL6GC","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KH3FL6GCUZ252SIEJUDBMV5DMB","target":"record","payload":{"canonical_record":{"source":{"id":"1511.05208","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-11-16T22:36:26Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"0d1d84cfa66f684e527c0cf86312b4e1456169efd3f73d839075428d2630c651","abstract_canon_sha256":"fcf1cbe8af000c3683915e28c28517306f3d537d71e1888bb2090b9547aec240"},"schema_version":"1.0"},"canonical_sha256":"51f655f8c2a675dd49044d061657a360617b511c469a3305d5615c12cc23b420","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:38.600057Z","signature_b64":"nF2OzwVqE20mn8YwaovpfuH/yAYXbcvDjpUDBf3mfqjBxyJ5XRk9gPTQLBHFh/brsbBJX3Ya8yUgowvIMPZcAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51f655f8c2a675dd49044d061657a360617b511c469a3305d5615c12cc23b420","last_reissued_at":"2026-05-18T01:11:38.599598Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:38.599598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.05208","source_version":3,"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-18T01:11:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6hntC280bDMR0fOu5mnJo7i9cOUde79AzP9IP3/1a351QZB+8uzQbiV6l6ggWJAIAuaTaLwrswZaBLpeEA3nAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T17:14:45.877379Z"},"content_sha256":"e84a6f04e1eed3a2f2a737ceddbe1827365cd4e638d21a8712c71a3a397a304e","schema_version":"1.0","event_id":"sha256:e84a6f04e1eed3a2f2a737ceddbe1827365cd4e638d21a8712c71a3a397a304e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KH3FL6GCUZ252SIEJUDBMV5DMB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"HOID: Higher Order Interpolatory Decomposition for tensors based on Tucker representation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Arvind K. Saibaba","submitted_at":"2015-11-16T22:36:26Z","abstract_excerpt":"We derive a CUR-type factorization for tensors in the Tucker format based on interpolatory decomposition, which we will denote as Higher Order Interpolatory Decomposition (HOID). Given a tensor $\\mathcal{X}$, the algorithm provides a set of column vectors $\\{ \\mathbf{C}_n\\}_{n=1}^d$ which are columns extracted from the mode-$n$ tensor unfolding, along with a core tensor $\\mathcal{G}$ and together, they satisfy some error bounds. Compared to the Higher Order SVD (HOSVD) algorithm, the HOID provides a decomposition that preserves certain important features of the original tensor such as sparsity"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05208","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"},"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-18T01:11:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EkjapWulSiwns/EhlzDjHFvmvKazzkm7QhbOssnTUzzjfZs0EcD9v4Ut73an3N7Kq3wV8VvNq77qqmF7LBleDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T17:14:45.877728Z"},"content_sha256":"6579a6ed3a8dd6b817b8a63fa619ee970533a483d4b6f13f6bc1613fdc284797","schema_version":"1.0","event_id":"sha256:6579a6ed3a8dd6b817b8a63fa619ee970533a483d4b6f13f6bc1613fdc284797"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KH3FL6GCUZ252SIEJUDBMV5DMB/bundle.json","state_url":"https://pith.science/pith/KH3FL6GCUZ252SIEJUDBMV5DMB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KH3FL6GCUZ252SIEJUDBMV5DMB/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-27T17:14:45Z","links":{"resolver":"https://pith.science/pith/KH3FL6GCUZ252SIEJUDBMV5DMB","bundle":"https://pith.science/pith/KH3FL6GCUZ252SIEJUDBMV5DMB/bundle.json","state":"https://pith.science/pith/KH3FL6GCUZ252SIEJUDBMV5DMB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KH3FL6GCUZ252SIEJUDBMV5DMB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KH3FL6GCUZ252SIEJUDBMV5DMB","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":"fcf1cbe8af000c3683915e28c28517306f3d537d71e1888bb2090b9547aec240","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-11-16T22:36:26Z","title_canon_sha256":"0d1d84cfa66f684e527c0cf86312b4e1456169efd3f73d839075428d2630c651"},"schema_version":"1.0","source":{"id":"1511.05208","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.05208","created_at":"2026-05-18T01:11:38Z"},{"alias_kind":"arxiv_version","alias_value":"1511.05208v3","created_at":"2026-05-18T01:11:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05208","created_at":"2026-05-18T01:11:38Z"},{"alias_kind":"pith_short_12","alias_value":"KH3FL6GCUZ25","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"KH3FL6GCUZ252SIE","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"KH3FL6GC","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:6579a6ed3a8dd6b817b8a63fa619ee970533a483d4b6f13f6bc1613fdc284797","target":"graph","created_at":"2026-05-18T01:11:38Z","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 derive a CUR-type factorization for tensors in the Tucker format based on interpolatory decomposition, which we will denote as Higher Order Interpolatory Decomposition (HOID). Given a tensor $\\mathcal{X}$, the algorithm provides a set of column vectors $\\{ \\mathbf{C}_n\\}_{n=1}^d$ which are columns extracted from the mode-$n$ tensor unfolding, along with a core tensor $\\mathcal{G}$ and together, they satisfy some error bounds. Compared to the Higher Order SVD (HOSVD) algorithm, the HOID provides a decomposition that preserves certain important features of the original tensor such as sparsity","authors_text":"Arvind K. Saibaba","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-11-16T22:36:26Z","title":"HOID: Higher Order Interpolatory Decomposition for tensors based on Tucker representation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05208","kind":"arxiv","version":3},"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:e84a6f04e1eed3a2f2a737ceddbe1827365cd4e638d21a8712c71a3a397a304e","target":"record","created_at":"2026-05-18T01:11:38Z","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":"fcf1cbe8af000c3683915e28c28517306f3d537d71e1888bb2090b9547aec240","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-11-16T22:36:26Z","title_canon_sha256":"0d1d84cfa66f684e527c0cf86312b4e1456169efd3f73d839075428d2630c651"},"schema_version":"1.0","source":{"id":"1511.05208","kind":"arxiv","version":3}},"canonical_sha256":"51f655f8c2a675dd49044d061657a360617b511c469a3305d5615c12cc23b420","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51f655f8c2a675dd49044d061657a360617b511c469a3305d5615c12cc23b420","first_computed_at":"2026-05-18T01:11:38.599598Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:38.599598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nF2OzwVqE20mn8YwaovpfuH/yAYXbcvDjpUDBf3mfqjBxyJ5XRk9gPTQLBHFh/brsbBJX3Ya8yUgowvIMPZcAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:38.600057Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.05208","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e84a6f04e1eed3a2f2a737ceddbe1827365cd4e638d21a8712c71a3a397a304e","sha256:6579a6ed3a8dd6b817b8a63fa619ee970533a483d4b6f13f6bc1613fdc284797"],"state_sha256":"51f6c7cb14b60783d6860cd4fd6445bdb7e6607e4f46284d34fde73dddba5e68"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OlnRzUug4t0JPu6CE2Tb/OSsc67Zpswg28SCYVtvBlAAY2UbM7Q0N0XOK3JuXTN105410pqmIHdRk4s6gT+KCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T17:14:45.879671Z","bundle_sha256":"aa8c3a0668cc765daa570150ab433a7ce4fde425af582b20f1fad0a83ed5e9e3"}}