{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:NTBLYFQS4AX7DVNFXU7BHS7UMI","short_pith_number":"pith:NTBLYFQS","canonical_record":{"source":{"id":"2003.00166","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-02-29T03:09:55Z","cross_cats_sorted":[],"title_canon_sha256":"5cc4aafb79d47563dbe814d92022222b1862194434c6b9346e57279dc1301594","abstract_canon_sha256":"a7e1e2928deab43918d42b149970084e861854fdb99d75d6173824917e9a1bb4"},"schema_version":"1.0"},"canonical_sha256":"6cc2bc1612e02ff1d5a5bd3e13cbf462215100367554032bb11d08a62b7372e3","source":{"kind":"arxiv","id":"2003.00166","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.00166","created_at":"2026-07-05T00:44:44Z"},{"alias_kind":"arxiv_version","alias_value":"2003.00166v1","created_at":"2026-07-05T00:44:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.00166","created_at":"2026-07-05T00:44:44Z"},{"alias_kind":"pith_short_12","alias_value":"NTBLYFQS4AX7","created_at":"2026-07-05T00:44:44Z"},{"alias_kind":"pith_short_16","alias_value":"NTBLYFQS4AX7DVNF","created_at":"2026-07-05T00:44:44Z"},{"alias_kind":"pith_short_8","alias_value":"NTBLYFQS","created_at":"2026-07-05T00:44:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:NTBLYFQS4AX7DVNFXU7BHS7UMI","target":"record","payload":{"canonical_record":{"source":{"id":"2003.00166","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-02-29T03:09:55Z","cross_cats_sorted":[],"title_canon_sha256":"5cc4aafb79d47563dbe814d92022222b1862194434c6b9346e57279dc1301594","abstract_canon_sha256":"a7e1e2928deab43918d42b149970084e861854fdb99d75d6173824917e9a1bb4"},"schema_version":"1.0"},"canonical_sha256":"6cc2bc1612e02ff1d5a5bd3e13cbf462215100367554032bb11d08a62b7372e3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:44:44.533225Z","signature_b64":"E+vF5vQdJbhjsKAgRwEX4nneGmzFU9jrQzY/FuAvzfsdfMz+GXrs9AN8oGM9qglOW1ks5PE9EaMv3//IXLnfBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6cc2bc1612e02ff1d5a5bd3e13cbf462215100367554032bb11d08a62b7372e3","last_reissued_at":"2026-07-05T00:44:44.532826Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:44:44.532826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2003.00166","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-07-05T00:44:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CxTmci8WfDl/6Rrf5xCFaPDVyL9mtmMHTDc5eFY6/rTkQMMYamVGcoq+4K3DuMzG44r8sfsHJ+0gkdJ9oHTwBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T23:32:50.214738Z"},"content_sha256":"5b12c795505a5473d4cdce22fdfdd75747541003f9a1a99e769aa17b5ed05280","schema_version":"1.0","event_id":"sha256:5b12c795505a5473d4cdce22fdfdd75747541003f9a1a99e769aa17b5ed05280"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:NTBLYFQS4AX7DVNFXU7BHS7UMI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Depth-Adaptive Graph Recurrent Network for Text Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Fandong Meng, Jie Zhou, Jinan Xu, Yijin Liu, Yufeng Chen","submitted_at":"2020-02-29T03:09:55Z","abstract_excerpt":"The Sentence-State LSTM (S-LSTM) is a powerful and high efficient graph recurrent network, which views words as nodes and performs layer-wise recurrent steps between them simultaneously. Despite its successes on text representations, the S-LSTM still suffers from two drawbacks. Firstly, given a sentence, certain words are usually more ambiguous than others, and thus more computation steps need to be taken for these difficult words and vice versa. However, the S-LSTM takes fixed computation steps for all words, irrespective of their hardness. The secondary one comes from the lack of sequential "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.00166","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2003.00166/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:44:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6vs4UxXbn+jciO5U/BgW+eO2AxcCbn6pPnjPWsismTHcVU2wGqkkxFSU9H1ykJXf1lPLQQysCC9ngbN9NHgrAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T23:32:50.215684Z"},"content_sha256":"d76a6e28c0e0fea9e33248d162a7b0fc862bf9bb33def628caaec657995540b4","schema_version":"1.0","event_id":"sha256:d76a6e28c0e0fea9e33248d162a7b0fc862bf9bb33def628caaec657995540b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NTBLYFQS4AX7DVNFXU7BHS7UMI/bundle.json","state_url":"https://pith.science/pith/NTBLYFQS4AX7DVNFXU7BHS7UMI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NTBLYFQS4AX7DVNFXU7BHS7UMI/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-08-05T23:32:50Z","links":{"resolver":"https://pith.science/pith/NTBLYFQS4AX7DVNFXU7BHS7UMI","bundle":"https://pith.science/pith/NTBLYFQS4AX7DVNFXU7BHS7UMI/bundle.json","state":"https://pith.science/pith/NTBLYFQS4AX7DVNFXU7BHS7UMI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NTBLYFQS4AX7DVNFXU7BHS7UMI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:NTBLYFQS4AX7DVNFXU7BHS7UMI","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":"a7e1e2928deab43918d42b149970084e861854fdb99d75d6173824917e9a1bb4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-02-29T03:09:55Z","title_canon_sha256":"5cc4aafb79d47563dbe814d92022222b1862194434c6b9346e57279dc1301594"},"schema_version":"1.0","source":{"id":"2003.00166","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.00166","created_at":"2026-07-05T00:44:44Z"},{"alias_kind":"arxiv_version","alias_value":"2003.00166v1","created_at":"2026-07-05T00:44:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.00166","created_at":"2026-07-05T00:44:44Z"},{"alias_kind":"pith_short_12","alias_value":"NTBLYFQS4AX7","created_at":"2026-07-05T00:44:44Z"},{"alias_kind":"pith_short_16","alias_value":"NTBLYFQS4AX7DVNF","created_at":"2026-07-05T00:44:44Z"},{"alias_kind":"pith_short_8","alias_value":"NTBLYFQS","created_at":"2026-07-05T00:44:44Z"}],"graph_snapshots":[{"event_id":"sha256:d76a6e28c0e0fea9e33248d162a7b0fc862bf9bb33def628caaec657995540b4","target":"graph","created_at":"2026-07-05T00:44:44Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2003.00166/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Sentence-State LSTM (S-LSTM) is a powerful and high efficient graph recurrent network, which views words as nodes and performs layer-wise recurrent steps between them simultaneously. Despite its successes on text representations, the S-LSTM still suffers from two drawbacks. Firstly, given a sentence, certain words are usually more ambiguous than others, and thus more computation steps need to be taken for these difficult words and vice versa. However, the S-LSTM takes fixed computation steps for all words, irrespective of their hardness. The secondary one comes from the lack of sequential ","authors_text":"Fandong Meng, Jie Zhou, Jinan Xu, Yijin Liu, Yufeng Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-02-29T03:09:55Z","title":"Depth-Adaptive Graph Recurrent Network for Text Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.00166","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:5b12c795505a5473d4cdce22fdfdd75747541003f9a1a99e769aa17b5ed05280","target":"record","created_at":"2026-07-05T00:44:44Z","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":"a7e1e2928deab43918d42b149970084e861854fdb99d75d6173824917e9a1bb4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-02-29T03:09:55Z","title_canon_sha256":"5cc4aafb79d47563dbe814d92022222b1862194434c6b9346e57279dc1301594"},"schema_version":"1.0","source":{"id":"2003.00166","kind":"arxiv","version":1}},"canonical_sha256":"6cc2bc1612e02ff1d5a5bd3e13cbf462215100367554032bb11d08a62b7372e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6cc2bc1612e02ff1d5a5bd3e13cbf462215100367554032bb11d08a62b7372e3","first_computed_at":"2026-07-05T00:44:44.532826Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:44:44.532826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E+vF5vQdJbhjsKAgRwEX4nneGmzFU9jrQzY/FuAvzfsdfMz+GXrs9AN8oGM9qglOW1ks5PE9EaMv3//IXLnfBg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:44:44.533225Z","signed_message":"canonical_sha256_bytes"},"source_id":"2003.00166","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b12c795505a5473d4cdce22fdfdd75747541003f9a1a99e769aa17b5ed05280","sha256:d76a6e28c0e0fea9e33248d162a7b0fc862bf9bb33def628caaec657995540b4"],"state_sha256":"0eea8890556c477a4ea157db8ee34e4ce645cfcc21a0397f2d833f6b4946e7ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9m5aWfkBD+d+rqTxDmt3SmJcnpWr2qWoxgDPOim0lmTHVOBJMlomTjnnuQ8AKpr3qhgcVDSfKjmMOpSQcvWACQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T23:32:50.222222Z","bundle_sha256":"09e75b7ddfa41892f6573e6a2b5cbb98dd1b458a0761333c55751b44032d89da"}}