{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:S7OX3KJLLEK6C23J4UCV5FT77D","short_pith_number":"pith:S7OX3KJL","schema_version":"1.0","canonical_sha256":"97dd7da92b5915e16b69e5055e967ff8d7c943b43ed380744c9d43dc344d06d7","source":{"kind":"arxiv","id":"1805.12372","version":1},"attestation_state":"computed","paper":{"title":"Learning Tree Distributions by Hidden Markov Models","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Daniele Castellana, Davide Bacciu","submitted_at":"2018-05-31T08:22:14Z","abstract_excerpt":"Hidden tree Markov models allow learning distributions for tree structured data while being interpretable as nondeterministic automata. We provide a concise summary of the main approaches in literature, focusing in particular on the causality assumptions introduced by the choice of a specific tree visit direction. We will then sketch a novel non-parametric generalization of the bottom-up hidden tree Markov model with its interpretation as a nondeterministic tree automaton with infinite states."},"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":"1805.12372","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"stat.ML","submitted_at":"2018-05-31T08:22:14Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"95bc3fcead5a3aba57f0a1f2f0557a3a7098964ac749ae193685b46de00561f5","abstract_canon_sha256":"42585bb9dd556fb8f6a8e3652f4e3ced78a4403881fbd3633fc8c9a8f7767a77"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:30.439012Z","signature_b64":"BlT58a7DeXYpOT8odleK+D3UWcr18XeRKJzC4LJL1UmadGDJwrrGvwDrnopum7JUdGzRMzcN4Kq80wccpFfBCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97dd7da92b5915e16b69e5055e967ff8d7c943b43ed380744c9d43dc344d06d7","last_reissued_at":"2026-05-18T00:14:30.438413Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:30.438413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Tree Distributions by Hidden Markov Models","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Daniele Castellana, Davide Bacciu","submitted_at":"2018-05-31T08:22:14Z","abstract_excerpt":"Hidden tree Markov models allow learning distributions for tree structured data while being interpretable as nondeterministic automata. We provide a concise summary of the main approaches in literature, focusing in particular on the causality assumptions introduced by the choice of a specific tree visit direction. We will then sketch a novel non-parametric generalization of the bottom-up hidden tree Markov model with its interpretation as a nondeterministic tree automaton with infinite states."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.12372","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":"1805.12372","created_at":"2026-05-18T00:14:30.438526+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.12372v1","created_at":"2026-05-18T00:14:30.438526+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.12372","created_at":"2026-05-18T00:14:30.438526+00:00"},{"alias_kind":"pith_short_12","alias_value":"S7OX3KJLLEK6","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"S7OX3KJLLEK6C23J","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"S7OX3KJL","created_at":"2026-05-18T12:32:50.500415+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/S7OX3KJLLEK6C23J4UCV5FT77D","json":"https://pith.science/pith/S7OX3KJLLEK6C23J4UCV5FT77D.json","graph_json":"https://pith.science/api/pith-number/S7OX3KJLLEK6C23J4UCV5FT77D/graph.json","events_json":"https://pith.science/api/pith-number/S7OX3KJLLEK6C23J4UCV5FT77D/events.json","paper":"https://pith.science/paper/S7OX3KJL"},"agent_actions":{"view_html":"https://pith.science/pith/S7OX3KJLLEK6C23J4UCV5FT77D","download_json":"https://pith.science/pith/S7OX3KJLLEK6C23J4UCV5FT77D.json","view_paper":"https://pith.science/paper/S7OX3KJL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.12372&json=true","fetch_graph":"https://pith.science/api/pith-number/S7OX3KJLLEK6C23J4UCV5FT77D/graph.json","fetch_events":"https://pith.science/api/pith-number/S7OX3KJLLEK6C23J4UCV5FT77D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S7OX3KJLLEK6C23J4UCV5FT77D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S7OX3KJLLEK6C23J4UCV5FT77D/action/storage_attestation","attest_author":"https://pith.science/pith/S7OX3KJLLEK6C23J4UCV5FT77D/action/author_attestation","sign_citation":"https://pith.science/pith/S7OX3KJLLEK6C23J4UCV5FT77D/action/citation_signature","submit_replication":"https://pith.science/pith/S7OX3KJLLEK6C23J4UCV5FT77D/action/replication_record"}},"created_at":"2026-05-18T00:14:30.438526+00:00","updated_at":"2026-05-18T00:14:30.438526+00:00"}