{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DZCXQZCY62LCSSHRLGQIPBUGDL","short_pith_number":"pith:DZCXQZCY","canonical_record":{"source":{"id":"1809.01219","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-09-04T19:39:24Z","cross_cats_sorted":[],"title_canon_sha256":"605fc262cb3ecebe6ff8f12a1f80d0fcf7dc722844918aa632ac39f0e98a5381","abstract_canon_sha256":"7a42eda0aa1d79c2d69e412861d0866cd126255c916b4f27560fd1bf6e2dba8a"},"schema_version":"1.0"},"canonical_sha256":"1e45786458f6962948f159a08786861ad028d181722bef283397c6c2aafefa4a","source":{"kind":"arxiv","id":"1809.01219","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.01219","created_at":"2026-05-18T00:06:31Z"},{"alias_kind":"arxiv_version","alias_value":"1809.01219v1","created_at":"2026-05-18T00:06:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.01219","created_at":"2026-05-18T00:06:31Z"},{"alias_kind":"pith_short_12","alias_value":"DZCXQZCY62LC","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DZCXQZCY62LCSSHR","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DZCXQZCY","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DZCXQZCY62LCSSHRLGQIPBUGDL","target":"record","payload":{"canonical_record":{"source":{"id":"1809.01219","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-09-04T19:39:24Z","cross_cats_sorted":[],"title_canon_sha256":"605fc262cb3ecebe6ff8f12a1f80d0fcf7dc722844918aa632ac39f0e98a5381","abstract_canon_sha256":"7a42eda0aa1d79c2d69e412861d0866cd126255c916b4f27560fd1bf6e2dba8a"},"schema_version":"1.0"},"canonical_sha256":"1e45786458f6962948f159a08786861ad028d181722bef283397c6c2aafefa4a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:31.368023Z","signature_b64":"UeGWq8GseCrGwsVjcJGuoGlj3EoyWQ/LWfsYs4nwmxkoqna3akN3VIWr3XfIIZZ7Ql9BcxfJvyhBkovGjj1/BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e45786458f6962948f159a08786861ad028d181722bef283397c6c2aafefa4a","last_reissued_at":"2026-05-18T00:06:31.367655Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:31.367655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.01219","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:06:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a7bJY6UVKxmAzfW5kUZ2X3DesADJIiIj6T5SUXe+SEDdS+Z35J0GNSwvyficUYmn0nY6tRGYCdmP1kIJ8xoHBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:06:21.028919Z"},"content_sha256":"90bf2bcb9b649e346ddf06447d1172f58706d519b44646754e51208d7c478c09","schema_version":"1.0","event_id":"sha256:90bf2bcb9b649e346ddf06447d1172f58706d519b44646754e51208d7c478c09"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DZCXQZCY62LCSSHRLGQIPBUGDL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph-based Deep-Tree Recursive Neural Network (DTRNN) for Text Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Bin Wang, C.-C. Jay Kuo, Fenxiao Chen","submitted_at":"2018-09-04T19:39:24Z","abstract_excerpt":"A novel graph-to-tree conversion mechanism called the deep-tree generation (DTG) algorithm is first proposed to predict text data represented by graphs. The DTG method can generate a richer and more accurate representation for nodes (or vertices) in graphs. It adds flexibility in exploring the vertex neighborhood information to better reflect the second order proximity and homophily equivalence in a graph. Then, a Deep-Tree Recursive Neural Network (DTRNN) method is presented and used to classify vertices that contains text data in graphs. To demonstrate the effectiveness of the DTRNN method, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.01219","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:06:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ya1OHzFfkLp4r+xBQkA9b2bHNXHxpnZP+pSmyL7aOe6ZysjA3L5B7GNDkRo22iQPjuorL5nP74I9AafkvHqkCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:06:21.029275Z"},"content_sha256":"cb598309a723d27b163065c0f2b8c2c442f2b4ff99d4a85ca4aacd3a5ca44aca","schema_version":"1.0","event_id":"sha256:cb598309a723d27b163065c0f2b8c2c442f2b4ff99d4a85ca4aacd3a5ca44aca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DZCXQZCY62LCSSHRLGQIPBUGDL/bundle.json","state_url":"https://pith.science/pith/DZCXQZCY62LCSSHRLGQIPBUGDL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DZCXQZCY62LCSSHRLGQIPBUGDL/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-05-27T07:06:21Z","links":{"resolver":"https://pith.science/pith/DZCXQZCY62LCSSHRLGQIPBUGDL","bundle":"https://pith.science/pith/DZCXQZCY62LCSSHRLGQIPBUGDL/bundle.json","state":"https://pith.science/pith/DZCXQZCY62LCSSHRLGQIPBUGDL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DZCXQZCY62LCSSHRLGQIPBUGDL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DZCXQZCY62LCSSHRLGQIPBUGDL","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":"7a42eda0aa1d79c2d69e412861d0866cd126255c916b4f27560fd1bf6e2dba8a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-09-04T19:39:24Z","title_canon_sha256":"605fc262cb3ecebe6ff8f12a1f80d0fcf7dc722844918aa632ac39f0e98a5381"},"schema_version":"1.0","source":{"id":"1809.01219","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.01219","created_at":"2026-05-18T00:06:31Z"},{"alias_kind":"arxiv_version","alias_value":"1809.01219v1","created_at":"2026-05-18T00:06:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.01219","created_at":"2026-05-18T00:06:31Z"},{"alias_kind":"pith_short_12","alias_value":"DZCXQZCY62LC","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DZCXQZCY62LCSSHR","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DZCXQZCY","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:cb598309a723d27b163065c0f2b8c2c442f2b4ff99d4a85ca4aacd3a5ca44aca","target":"graph","created_at":"2026-05-18T00:06: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"},"paper":{"abstract_excerpt":"A novel graph-to-tree conversion mechanism called the deep-tree generation (DTG) algorithm is first proposed to predict text data represented by graphs. The DTG method can generate a richer and more accurate representation for nodes (or vertices) in graphs. It adds flexibility in exploring the vertex neighborhood information to better reflect the second order proximity and homophily equivalence in a graph. Then, a Deep-Tree Recursive Neural Network (DTRNN) method is presented and used to classify vertices that contains text data in graphs. To demonstrate the effectiveness of the DTRNN method, ","authors_text":"Bin Wang, C.-C. Jay Kuo, Fenxiao Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-09-04T19:39:24Z","title":"Graph-based Deep-Tree Recursive Neural Network (DTRNN) for Text Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.01219","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:90bf2bcb9b649e346ddf06447d1172f58706d519b44646754e51208d7c478c09","target":"record","created_at":"2026-05-18T00:06: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":"7a42eda0aa1d79c2d69e412861d0866cd126255c916b4f27560fd1bf6e2dba8a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-09-04T19:39:24Z","title_canon_sha256":"605fc262cb3ecebe6ff8f12a1f80d0fcf7dc722844918aa632ac39f0e98a5381"},"schema_version":"1.0","source":{"id":"1809.01219","kind":"arxiv","version":1}},"canonical_sha256":"1e45786458f6962948f159a08786861ad028d181722bef283397c6c2aafefa4a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1e45786458f6962948f159a08786861ad028d181722bef283397c6c2aafefa4a","first_computed_at":"2026-05-18T00:06:31.367655Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:31.367655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UeGWq8GseCrGwsVjcJGuoGlj3EoyWQ/LWfsYs4nwmxkoqna3akN3VIWr3XfIIZZ7Ql9BcxfJvyhBkovGjj1/BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:31.368023Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.01219","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:90bf2bcb9b649e346ddf06447d1172f58706d519b44646754e51208d7c478c09","sha256:cb598309a723d27b163065c0f2b8c2c442f2b4ff99d4a85ca4aacd3a5ca44aca"],"state_sha256":"96d904fed2b10c5cfe74ef57bb72bc1403795f1a84d30f1778e519b226b95b8e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8WRH6z6TfzjsfIl6Fy0Y7seq97tO6Kt06lzaHVcnwWUMFukp0KgJASPNZCBZo/JvUKGLhylZ1qGSsMGc6k8LCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T07:06:21.031613Z","bundle_sha256":"8cb35169fa4ddbf5185d4a6dd29a29b135ea7ee4e5822e12e2e9471b78f2ac78"}}