{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:METZB2I2BASU37RIJ7ZW7J6SGL","short_pith_number":"pith:METZB2I2","schema_version":"1.0","canonical_sha256":"612790e91a08254dfe284ff36fa7d232c4ca6b605a241f7dfb72fc459661add6","source":{"kind":"arxiv","id":"1711.07784","version":1},"attestation_state":"computed","paper":{"title":"Hidden Tree Markov Networks: Deep and Wide Learning for Structured Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.NE"],"primary_cat":"cs.LG","authors_text":"Davide Bacciu","submitted_at":"2017-11-21T13:50:34Z","abstract_excerpt":"The paper introduces the Hidden Tree Markov Network (HTN), a neuro-probabilistic hybrid fusing the representation power of generative models for trees with the incremental and discriminative learning capabilities of neural networks. We put forward a modular architecture in which multiple generative models of limited complexity are trained to learn structural feature detectors whose outputs are then combined and integrated by neural layers at a later stage. In this respect, the model is both deep, thanks to the unfolding of the generative models on the input structures, as well as wide, given t"},"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":"1711.07784","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-21T13:50:34Z","cross_cats_sorted":["cs.AI","cs.NE"],"title_canon_sha256":"6d55930c35aeec09a1bec7f2514d7ce29bfc16fdb63042e1ab89578f348607ea","abstract_canon_sha256":"9687a56c4405ea2a3afcac5a0b837fc96d94f6e593cd3b8ee611ed5388a8c8da"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:56.516492Z","signature_b64":"pfpGVQ6h5VwOmpHBFC94bIjqxpg6AZ5jxLmzIwrDZuCQLtzTr/WiHHUE26l8A1qS75EfxsEDjWAKcQifHmi7DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"612790e91a08254dfe284ff36fa7d232c4ca6b605a241f7dfb72fc459661add6","last_reissued_at":"2026-05-18T00:29:56.516054Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:56.516054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hidden Tree Markov Networks: Deep and Wide Learning for Structured Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.NE"],"primary_cat":"cs.LG","authors_text":"Davide Bacciu","submitted_at":"2017-11-21T13:50:34Z","abstract_excerpt":"The paper introduces the Hidden Tree Markov Network (HTN), a neuro-probabilistic hybrid fusing the representation power of generative models for trees with the incremental and discriminative learning capabilities of neural networks. We put forward a modular architecture in which multiple generative models of limited complexity are trained to learn structural feature detectors whose outputs are then combined and integrated by neural layers at a later stage. In this respect, the model is both deep, thanks to the unfolding of the generative models on the input structures, as well as wide, given t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07784","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":"1711.07784","created_at":"2026-05-18T00:29:56.516127+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.07784v1","created_at":"2026-05-18T00:29:56.516127+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07784","created_at":"2026-05-18T00:29:56.516127+00:00"},{"alias_kind":"pith_short_12","alias_value":"METZB2I2BASU","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"METZB2I2BASU37RI","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"METZB2I2","created_at":"2026-05-18T12:31:31.346846+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/METZB2I2BASU37RIJ7ZW7J6SGL","json":"https://pith.science/pith/METZB2I2BASU37RIJ7ZW7J6SGL.json","graph_json":"https://pith.science/api/pith-number/METZB2I2BASU37RIJ7ZW7J6SGL/graph.json","events_json":"https://pith.science/api/pith-number/METZB2I2BASU37RIJ7ZW7J6SGL/events.json","paper":"https://pith.science/paper/METZB2I2"},"agent_actions":{"view_html":"https://pith.science/pith/METZB2I2BASU37RIJ7ZW7J6SGL","download_json":"https://pith.science/pith/METZB2I2BASU37RIJ7ZW7J6SGL.json","view_paper":"https://pith.science/paper/METZB2I2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.07784&json=true","fetch_graph":"https://pith.science/api/pith-number/METZB2I2BASU37RIJ7ZW7J6SGL/graph.json","fetch_events":"https://pith.science/api/pith-number/METZB2I2BASU37RIJ7ZW7J6SGL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/METZB2I2BASU37RIJ7ZW7J6SGL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/METZB2I2BASU37RIJ7ZW7J6SGL/action/storage_attestation","attest_author":"https://pith.science/pith/METZB2I2BASU37RIJ7ZW7J6SGL/action/author_attestation","sign_citation":"https://pith.science/pith/METZB2I2BASU37RIJ7ZW7J6SGL/action/citation_signature","submit_replication":"https://pith.science/pith/METZB2I2BASU37RIJ7ZW7J6SGL/action/replication_record"}},"created_at":"2026-05-18T00:29:56.516127+00:00","updated_at":"2026-05-18T00:29:56.516127+00:00"}