{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:W4KHRDZEBPGZWFI2EUWEYCPELE","short_pith_number":"pith:W4KHRDZE","canonical_record":{"source":{"id":"2606.23949","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2026-06-22T21:20:04Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"7d4147c737e1af35ebcfab172207921ebaad0897f90bc8c95adb53c53c040ca7","abstract_canon_sha256":"9c87b09dc215ee4be7058aae134d28224759ec2f094bdff924e05d232e679485"},"schema_version":"1.0"},"canonical_sha256":"b714788f240bcd9b151a252c4c09e4593e88ee16932147a191cee7e2cea9395f","source":{"kind":"arxiv","id":"2606.23949","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.23949","created_at":"2026-06-24T00:14:31Z"},{"alias_kind":"arxiv_version","alias_value":"2606.23949v1","created_at":"2026-06-24T00:14:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.23949","created_at":"2026-06-24T00:14:31Z"},{"alias_kind":"pith_short_12","alias_value":"W4KHRDZEBPGZ","created_at":"2026-06-24T00:14:31Z"},{"alias_kind":"pith_short_16","alias_value":"W4KHRDZEBPGZWFI2","created_at":"2026-06-24T00:14:31Z"},{"alias_kind":"pith_short_8","alias_value":"W4KHRDZE","created_at":"2026-06-24T00:14:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:W4KHRDZEBPGZWFI2EUWEYCPELE","target":"record","payload":{"canonical_record":{"source":{"id":"2606.23949","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2026-06-22T21:20:04Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"7d4147c737e1af35ebcfab172207921ebaad0897f90bc8c95adb53c53c040ca7","abstract_canon_sha256":"9c87b09dc215ee4be7058aae134d28224759ec2f094bdff924e05d232e679485"},"schema_version":"1.0"},"canonical_sha256":"b714788f240bcd9b151a252c4c09e4593e88ee16932147a191cee7e2cea9395f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-24T00:14:31.071499Z","signature_b64":"bkqxnezphfY05zW8QFhexgvDRiBIC7rg5z3rjnR3l+5XcUdlCOpZzT0dK5V5fowNKjZKm6fpugMfTuDghC4VAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b714788f240bcd9b151a252c4c09e4593e88ee16932147a191cee7e2cea9395f","last_reissued_at":"2026-06-24T00:14:31.071081Z","signature_status":"signed_v1","first_computed_at":"2026-06-24T00:14:31.071081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.23949","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-06-24T00:14:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uO6SwKthNfkQRkcyEaP/MeFi+L7KDAN+34nEpMIiKMyO95kLYMO/YKkpUucUdKNnIcRN57Bc3N93d/34btMTCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T12:38:00.492405Z"},"content_sha256":"1cfc75358799d1caef396c9a5b5255e752b2267ba10391dd172705e349148e0f","schema_version":"1.0","event_id":"sha256:1cfc75358799d1caef396c9a5b5255e752b2267ba10391dd172705e349148e0f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:W4KHRDZEBPGZWFI2EUWEYCPELE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Variational inference and density estimation with non-negative tensor of hierarchical tucker format","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Haoxuan Chen, Lexing Ying, Xun Tang","submitted_at":"2026-06-22T21:20:04Z","abstract_excerpt":"In this work, we present an efficient method to compress a high-dimensional discrete probability function, i.e., a probability tensor, into a non-negative hierarchical Tucker format. The methodology is a two-stage procedure. In the first stage, we take an existing interpolation method to compress the target tensor into a hierarchical Tucker (HT) in a manner similar to the CUR decomposition for low-rank matrix reconstruction. In the second stage, we fit the first-stage output against a non-negative hierarchical Tucker ansatz using a second-order method tailored specifically for this setting. Wh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.23949","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.23949/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-06-24T00:14:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xQzx+tUsa/4X53Uv4EK6f5auBLQudy/SixkkmB5kx7UgOjVPYY/PUrlPLWokDKjQyVhYBe880UvklmWqrhQWBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T12:38:00.493079Z"},"content_sha256":"cb4038e393a84962812cbf35ff17b79e302a9a406806f48b6c80596a9f2dbbf8","schema_version":"1.0","event_id":"sha256:cb4038e393a84962812cbf35ff17b79e302a9a406806f48b6c80596a9f2dbbf8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W4KHRDZEBPGZWFI2EUWEYCPELE/bundle.json","state_url":"https://pith.science/pith/W4KHRDZEBPGZWFI2EUWEYCPELE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W4KHRDZEBPGZWFI2EUWEYCPELE/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-07-01T12:38:00Z","links":{"resolver":"https://pith.science/pith/W4KHRDZEBPGZWFI2EUWEYCPELE","bundle":"https://pith.science/pith/W4KHRDZEBPGZWFI2EUWEYCPELE/bundle.json","state":"https://pith.science/pith/W4KHRDZEBPGZWFI2EUWEYCPELE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W4KHRDZEBPGZWFI2EUWEYCPELE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:W4KHRDZEBPGZWFI2EUWEYCPELE","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":"9c87b09dc215ee4be7058aae134d28224759ec2f094bdff924e05d232e679485","cross_cats_sorted":["cs.NA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2026-06-22T21:20:04Z","title_canon_sha256":"7d4147c737e1af35ebcfab172207921ebaad0897f90bc8c95adb53c53c040ca7"},"schema_version":"1.0","source":{"id":"2606.23949","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.23949","created_at":"2026-06-24T00:14:31Z"},{"alias_kind":"arxiv_version","alias_value":"2606.23949v1","created_at":"2026-06-24T00:14:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.23949","created_at":"2026-06-24T00:14:31Z"},{"alias_kind":"pith_short_12","alias_value":"W4KHRDZEBPGZ","created_at":"2026-06-24T00:14:31Z"},{"alias_kind":"pith_short_16","alias_value":"W4KHRDZEBPGZWFI2","created_at":"2026-06-24T00:14:31Z"},{"alias_kind":"pith_short_8","alias_value":"W4KHRDZE","created_at":"2026-06-24T00:14:31Z"}],"graph_snapshots":[{"event_id":"sha256:cb4038e393a84962812cbf35ff17b79e302a9a406806f48b6c80596a9f2dbbf8","target":"graph","created_at":"2026-06-24T00:14:31Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.23949/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this work, we present an efficient method to compress a high-dimensional discrete probability function, i.e., a probability tensor, into a non-negative hierarchical Tucker format. The methodology is a two-stage procedure. In the first stage, we take an existing interpolation method to compress the target tensor into a hierarchical Tucker (HT) in a manner similar to the CUR decomposition for low-rank matrix reconstruction. In the second stage, we fit the first-stage output against a non-negative hierarchical Tucker ansatz using a second-order method tailored specifically for this setting. Wh","authors_text":"Haoxuan Chen, Lexing Ying, Xun Tang","cross_cats":["cs.NA"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2026-06-22T21:20:04Z","title":"Variational inference and density estimation with non-negative tensor of hierarchical tucker format"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.23949","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:1cfc75358799d1caef396c9a5b5255e752b2267ba10391dd172705e349148e0f","target":"record","created_at":"2026-06-24T00:14:31Z","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":"9c87b09dc215ee4be7058aae134d28224759ec2f094bdff924e05d232e679485","cross_cats_sorted":["cs.NA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2026-06-22T21:20:04Z","title_canon_sha256":"7d4147c737e1af35ebcfab172207921ebaad0897f90bc8c95adb53c53c040ca7"},"schema_version":"1.0","source":{"id":"2606.23949","kind":"arxiv","version":1}},"canonical_sha256":"b714788f240bcd9b151a252c4c09e4593e88ee16932147a191cee7e2cea9395f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b714788f240bcd9b151a252c4c09e4593e88ee16932147a191cee7e2cea9395f","first_computed_at":"2026-06-24T00:14:31.071081Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-24T00:14:31.071081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bkqxnezphfY05zW8QFhexgvDRiBIC7rg5z3rjnR3l+5XcUdlCOpZzT0dK5V5fowNKjZKm6fpugMfTuDghC4VAw==","signature_status":"signed_v1","signed_at":"2026-06-24T00:14:31.071499Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.23949","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1cfc75358799d1caef396c9a5b5255e752b2267ba10391dd172705e349148e0f","sha256:cb4038e393a84962812cbf35ff17b79e302a9a406806f48b6c80596a9f2dbbf8"],"state_sha256":"4c9557de4d6b532a9ec6247c09f93bd225fef5ad239f5dde799d1ad83f596693"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nuqtrsCShGjGEGXtCKXKk+biDaKjiBv6nR1JrJX6FekaEwn/Mh801SgWisEOzUjcEFDbibVK0b/5uBvePujRDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T12:38:00.495978Z","bundle_sha256":"fc4a5c91a1bc10823ca75b7158f66b201a949595dbe4b0fcb0ceb96bdf16f94e"}}