{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:METZB2I2BASU37RIJ7ZW7J6SGL","short_pith_number":"pith:METZB2I2","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"},"canonical_sha256":"612790e91a08254dfe284ff36fa7d232c4ca6b605a241f7dfb72fc459661add6","source":{"kind":"arxiv","id":"1711.07784","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.07784","created_at":"2026-05-18T00:29:56Z"},{"alias_kind":"arxiv_version","alias_value":"1711.07784v1","created_at":"2026-05-18T00:29:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07784","created_at":"2026-05-18T00:29:56Z"},{"alias_kind":"pith_short_12","alias_value":"METZB2I2BASU","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"METZB2I2BASU37RI","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"METZB2I2","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:METZB2I2BASU37RIJ7ZW7J6SGL","target":"record","payload":{"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"},"canonical_sha256":"612790e91a08254dfe284ff36fa7d232c4ca6b605a241f7dfb72fc459661add6","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"},"source_kind":"arxiv","source_id":"1711.07784","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-18T00:29:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BiTv3OyjnoKC6plJoyuXSuyfssl2O8kc76PNqIRwSzVZrnPibZ+giqBXg3fBpx5Wg7/P2i0F6FfrZRIMChyoAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:19:08.470635Z"},"content_sha256":"a3bbc4c5d3ceb81e75e55f0447c3dd482dd74b5cc78ded4e2dcdbffe20fcd1ae","schema_version":"1.0","event_id":"sha256:a3bbc4c5d3ceb81e75e55f0447c3dd482dd74b5cc78ded4e2dcdbffe20fcd1ae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:METZB2I2BASU37RIJ7ZW7J6SGL","target":"graph","payload":{"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"},"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-18T00:29:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"83+LkLqBHCGVNt/IbwZDzkROKCV6UMg8vdzekhRhW7ATeUFpfs1gGQvdhAuRJ5gYOeDzikj8l0I+YjPiEQCyCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:19:08.470975Z"},"content_sha256":"a01d77d3225257807f63d8f696d15b785dd27ecd4f726ea17d04b94e3cb4de22","schema_version":"1.0","event_id":"sha256:a01d77d3225257807f63d8f696d15b785dd27ecd4f726ea17d04b94e3cb4de22"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/METZB2I2BASU37RIJ7ZW7J6SGL/bundle.json","state_url":"https://pith.science/pith/METZB2I2BASU37RIJ7ZW7J6SGL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/METZB2I2BASU37RIJ7ZW7J6SGL/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-04T19:19:08Z","links":{"resolver":"https://pith.science/pith/METZB2I2BASU37RIJ7ZW7J6SGL","bundle":"https://pith.science/pith/METZB2I2BASU37RIJ7ZW7J6SGL/bundle.json","state":"https://pith.science/pith/METZB2I2BASU37RIJ7ZW7J6SGL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/METZB2I2BASU37RIJ7ZW7J6SGL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:METZB2I2BASU37RIJ7ZW7J6SGL","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":"9687a56c4405ea2a3afcac5a0b837fc96d94f6e593cd3b8ee611ed5388a8c8da","cross_cats_sorted":["cs.AI","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-21T13:50:34Z","title_canon_sha256":"6d55930c35aeec09a1bec7f2514d7ce29bfc16fdb63042e1ab89578f348607ea"},"schema_version":"1.0","source":{"id":"1711.07784","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.07784","created_at":"2026-05-18T00:29:56Z"},{"alias_kind":"arxiv_version","alias_value":"1711.07784v1","created_at":"2026-05-18T00:29:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07784","created_at":"2026-05-18T00:29:56Z"},{"alias_kind":"pith_short_12","alias_value":"METZB2I2BASU","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"METZB2I2BASU37RI","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"METZB2I2","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:a01d77d3225257807f63d8f696d15b785dd27ecd4f726ea17d04b94e3cb4de22","target":"graph","created_at":"2026-05-18T00:29:56Z","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":"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","authors_text":"Davide Bacciu","cross_cats":["cs.AI","cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-21T13:50:34Z","title":"Hidden Tree Markov Networks: Deep and Wide Learning for Structured Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07784","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:a3bbc4c5d3ceb81e75e55f0447c3dd482dd74b5cc78ded4e2dcdbffe20fcd1ae","target":"record","created_at":"2026-05-18T00:29:56Z","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":"9687a56c4405ea2a3afcac5a0b837fc96d94f6e593cd3b8ee611ed5388a8c8da","cross_cats_sorted":["cs.AI","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-21T13:50:34Z","title_canon_sha256":"6d55930c35aeec09a1bec7f2514d7ce29bfc16fdb63042e1ab89578f348607ea"},"schema_version":"1.0","source":{"id":"1711.07784","kind":"arxiv","version":1}},"canonical_sha256":"612790e91a08254dfe284ff36fa7d232c4ca6b605a241f7dfb72fc459661add6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"612790e91a08254dfe284ff36fa7d232c4ca6b605a241f7dfb72fc459661add6","first_computed_at":"2026-05-18T00:29:56.516054Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:56.516054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pfpGVQ6h5VwOmpHBFC94bIjqxpg6AZ5jxLmzIwrDZuCQLtzTr/WiHHUE26l8A1qS75EfxsEDjWAKcQifHmi7DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:56.516492Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.07784","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a3bbc4c5d3ceb81e75e55f0447c3dd482dd74b5cc78ded4e2dcdbffe20fcd1ae","sha256:a01d77d3225257807f63d8f696d15b785dd27ecd4f726ea17d04b94e3cb4de22"],"state_sha256":"4d72ac6e7884ad47841e4399512e585df5d53a79b30f5ef8ae64390a5baddfc3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2R92D7pQq1rA9qbrYIfRWUxvDWMtc5xNFNeQmwy/yZk4jq/rhKPe8evug+rz59qDOCkHYVIq3zUuCTERRseECQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T19:19:08.472874Z","bundle_sha256":"59023a4abb252dd41d51d8e0a834dc6ad7ecaa815c9f06558200ea6db0c7f086"}}