{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:MCIB4NF7CO6ACSIB65HF3M5ALT","short_pith_number":"pith:MCIB4NF7","canonical_record":{"source":{"id":"1905.13528","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-31T12:03:00Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"d75afd786a93e2f1d997adc91a4bfc83981a383356c8e50a8870231dc83c44a7","abstract_canon_sha256":"1a0f01825112451efe2adde3a303b480d7d3e890b6b61e45fff39eff8b6802dd"},"schema_version":"1.0"},"canonical_sha256":"60901e34bf13bc014901f74e5db3a05cd2ec61296d637519325fb043f5ff3684","source":{"kind":"arxiv","id":"1905.13528","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.13528","created_at":"2026-05-17T23:44:34Z"},{"alias_kind":"arxiv_version","alias_value":"1905.13528v1","created_at":"2026-05-17T23:44:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.13528","created_at":"2026-05-17T23:44:34Z"},{"alias_kind":"pith_short_12","alias_value":"MCIB4NF7CO6A","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"MCIB4NF7CO6ACSIB","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"MCIB4NF7","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:MCIB4NF7CO6ACSIB65HF3M5ALT","target":"record","payload":{"canonical_record":{"source":{"id":"1905.13528","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-31T12:03:00Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"d75afd786a93e2f1d997adc91a4bfc83981a383356c8e50a8870231dc83c44a7","abstract_canon_sha256":"1a0f01825112451efe2adde3a303b480d7d3e890b6b61e45fff39eff8b6802dd"},"schema_version":"1.0"},"canonical_sha256":"60901e34bf13bc014901f74e5db3a05cd2ec61296d637519325fb043f5ff3684","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:34.692067Z","signature_b64":"X7NS94pNQWK5e+RS3KAyTYEumTWoODN2fkcLhQNwUiA4sdp+1U3eIyuFCQIr95succFitxYjWmJsEEm7bCqgCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60901e34bf13bc014901f74e5db3a05cd2ec61296d637519325fb043f5ff3684","last_reissued_at":"2026-05-17T23:44:34.691582Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:34.691582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.13528","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-17T23:44:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NNXplhK9tsl28U/XOWZeZpMPWmKSHl0c6HqS4uttX5GEqJvJXh7EkzYDoEveur4WH8NRzL5hsYHdtRe9vkhiAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T16:18:30.520365Z"},"content_sha256":"b629b95e158b4f14752462e964bc14fce9146b457fe73d2eb7f9d295fc1aaf83","schema_version":"1.0","event_id":"sha256:b629b95e158b4f14752462e964bc14fce9146b457fe73d2eb7f9d295fc1aaf83"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:MCIB4NF7CO6ACSIB65HF3M5ALT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bayesian Tensor Factorisation for Bottom-up Hidden Tree Markov Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Daniele Castellana, Davide Bacciu","submitted_at":"2019-05-31T12:03:00Z","abstract_excerpt":"Bottom-Up Hidden Tree Markov Model is a highly expressive model for tree-structured data. Unfortunately, it cannot be used in practice due to the intractable size of its state-transition matrix. We propose a new approximation which lies on the Tucker factorisation of tensors. The probabilistic interpretation of such approximation allows us to define a new probabilistic model for tree-structured data. Hence, we define the new approximated model and we derive its learning algorithm. Then, we empirically assess the effective power of the new model evaluating it on two different tasks. In both cas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.13528","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-17T23:44:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B2p7Kam1NuHb1hfiWcAUvaA12FkL8ptjVu8yCEwUh68zP3N/y5ircxlZWl413RwgfEyD4y8VdD9UZLqrf0vJCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T16:18:30.520711Z"},"content_sha256":"138817569fcbaa8ca1dd2d8f950898002c6e570a62b742e153057358607bc461","schema_version":"1.0","event_id":"sha256:138817569fcbaa8ca1dd2d8f950898002c6e570a62b742e153057358607bc461"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MCIB4NF7CO6ACSIB65HF3M5ALT/bundle.json","state_url":"https://pith.science/pith/MCIB4NF7CO6ACSIB65HF3M5ALT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MCIB4NF7CO6ACSIB65HF3M5ALT/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-04T16:18:30Z","links":{"resolver":"https://pith.science/pith/MCIB4NF7CO6ACSIB65HF3M5ALT","bundle":"https://pith.science/pith/MCIB4NF7CO6ACSIB65HF3M5ALT/bundle.json","state":"https://pith.science/pith/MCIB4NF7CO6ACSIB65HF3M5ALT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MCIB4NF7CO6ACSIB65HF3M5ALT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:MCIB4NF7CO6ACSIB65HF3M5ALT","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":"1a0f01825112451efe2adde3a303b480d7d3e890b6b61e45fff39eff8b6802dd","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-31T12:03:00Z","title_canon_sha256":"d75afd786a93e2f1d997adc91a4bfc83981a383356c8e50a8870231dc83c44a7"},"schema_version":"1.0","source":{"id":"1905.13528","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.13528","created_at":"2026-05-17T23:44:34Z"},{"alias_kind":"arxiv_version","alias_value":"1905.13528v1","created_at":"2026-05-17T23:44:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.13528","created_at":"2026-05-17T23:44:34Z"},{"alias_kind":"pith_short_12","alias_value":"MCIB4NF7CO6A","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"MCIB4NF7CO6ACSIB","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"MCIB4NF7","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:138817569fcbaa8ca1dd2d8f950898002c6e570a62b742e153057358607bc461","target":"graph","created_at":"2026-05-17T23:44:34Z","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":"Bottom-Up Hidden Tree Markov Model is a highly expressive model for tree-structured data. Unfortunately, it cannot be used in practice due to the intractable size of its state-transition matrix. We propose a new approximation which lies on the Tucker factorisation of tensors. The probabilistic interpretation of such approximation allows us to define a new probabilistic model for tree-structured data. Hence, we define the new approximated model and we derive its learning algorithm. Then, we empirically assess the effective power of the new model evaluating it on two different tasks. In both cas","authors_text":"Daniele Castellana, Davide Bacciu","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-31T12:03:00Z","title":"Bayesian Tensor Factorisation for Bottom-up Hidden Tree Markov Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.13528","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:b629b95e158b4f14752462e964bc14fce9146b457fe73d2eb7f9d295fc1aaf83","target":"record","created_at":"2026-05-17T23:44:34Z","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":"1a0f01825112451efe2adde3a303b480d7d3e890b6b61e45fff39eff8b6802dd","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-31T12:03:00Z","title_canon_sha256":"d75afd786a93e2f1d997adc91a4bfc83981a383356c8e50a8870231dc83c44a7"},"schema_version":"1.0","source":{"id":"1905.13528","kind":"arxiv","version":1}},"canonical_sha256":"60901e34bf13bc014901f74e5db3a05cd2ec61296d637519325fb043f5ff3684","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"60901e34bf13bc014901f74e5db3a05cd2ec61296d637519325fb043f5ff3684","first_computed_at":"2026-05-17T23:44:34.691582Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:34.691582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X7NS94pNQWK5e+RS3KAyTYEumTWoODN2fkcLhQNwUiA4sdp+1U3eIyuFCQIr95succFitxYjWmJsEEm7bCqgCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:34.692067Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.13528","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b629b95e158b4f14752462e964bc14fce9146b457fe73d2eb7f9d295fc1aaf83","sha256:138817569fcbaa8ca1dd2d8f950898002c6e570a62b742e153057358607bc461"],"state_sha256":"03f22cc26138beb9cd7c9033547510f08e9ede4806b8cd0971d12ebb32ffe59d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Om0A0krnRIEa9xOn1ukYj/XGrb3IbiLYrhwCOwxbHlBEQAfr5fnGWLlCLqoCppvvvqkYqQ4q+++svgw8V0zRBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T16:18:30.522666Z","bundle_sha256":"51d78b6bd00b61fe61f9a93d13c9e835961c2c7ddb4d462e372747b1e15b9356"}}