{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:XVFAOARQTDGWUZ2BUBIZJTAILN","short_pith_number":"pith:XVFAOARQ","canonical_record":{"source":{"id":"1903.02082","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2019-01-18T14:21:12Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"bb78523141b19286cee952a5964c6a776a112a32cfb20c2cd70a627a0ca865a7","abstract_canon_sha256":"b8aaa258b4f9744d8bb1dc333da26043b89608ab66487583eab0aed016c76724"},"schema_version":"1.0"},"canonical_sha256":"bd4a07023098cd6a6741a05194cc085b4ea7087f909906b0c4eb419d5193a870","source":{"kind":"arxiv","id":"1903.02082","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.02082","created_at":"2026-05-17T23:51:56Z"},{"alias_kind":"arxiv_version","alias_value":"1903.02082v1","created_at":"2026-05-17T23:51:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02082","created_at":"2026-05-17T23:51:56Z"},{"alias_kind":"pith_short_12","alias_value":"XVFAOARQTDGW","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XVFAOARQTDGWUZ2B","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XVFAOARQ","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:XVFAOARQTDGWUZ2BUBIZJTAILN","target":"record","payload":{"canonical_record":{"source":{"id":"1903.02082","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2019-01-18T14:21:12Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"bb78523141b19286cee952a5964c6a776a112a32cfb20c2cd70a627a0ca865a7","abstract_canon_sha256":"b8aaa258b4f9744d8bb1dc333da26043b89608ab66487583eab0aed016c76724"},"schema_version":"1.0"},"canonical_sha256":"bd4a07023098cd6a6741a05194cc085b4ea7087f909906b0c4eb419d5193a870","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:56.703854Z","signature_b64":"AdoUJ/p7EBU2omMONnrOnMwcOCEQ1IvexMMlBLemSdqqhbJENLdT/umYamNNAaCD5vr4cU/J9jh7eQz3XqDYBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd4a07023098cd6a6741a05194cc085b4ea7087f909906b0c4eb419d5193a870","last_reissued_at":"2026-05-17T23:51:56.703438Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:56.703438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.02082","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-17T23:51:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GOIPlEi62IswBHh4fyfujGW1QiR90kaF7xwOr4Rp5pgGGIwtNDZmc19m5y7YlcujeWzUbdL/woTe+uH2J+jjDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:56:38.205046Z"},"content_sha256":"2680fc54ef2a485d4d9b6c796d49fcd07bbba01a53b5a8b5f7640d18715fbe91","schema_version":"1.0","event_id":"sha256:2680fc54ef2a485d4d9b6c796d49fcd07bbba01a53b5a8b5f7640d18715fbe91"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:XVFAOARQTDGWUZ2BUBIZJTAILN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"DA-LSTM: A Long Short-Term Memory with Depth Adaptive to Non-uniform Information Flow in Sequential Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.NE","authors_text":"Ka-Ho Chow, S.-H. Gary Chan, Yifeng Zhang","submitted_at":"2019-01-18T14:21:12Z","abstract_excerpt":"Much sequential data exhibits highly non-uniform information distribution. This cannot be correctly modeled by traditional Long Short-Term Memory (LSTM). To address that, recent works have extended LSTM by adding more activations between adjacent inputs. However, the approaches often use a fixed depth, which is at the step of the most information content. This one-size-fits-all worst-case approach is not satisfactory, because when little information is distributed to some steps, shallow structures can achieve faster convergence and consume less computation resource. In this paper, we develop a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.02082","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-17T23:51:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9ztUd+WbaDxoVnnXyPzhnzBkEi357OoDaOG+gBAf4d9fpu4RpbLu975IddMIUPenBE7rutyKGmkHVb/+y3weBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:56:38.205510Z"},"content_sha256":"714a1dd29a34b398597118aa93ce762de13022c9a6b6e948c00a7c994aa3be09","schema_version":"1.0","event_id":"sha256:714a1dd29a34b398597118aa93ce762de13022c9a6b6e948c00a7c994aa3be09"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XVFAOARQTDGWUZ2BUBIZJTAILN/bundle.json","state_url":"https://pith.science/pith/XVFAOARQTDGWUZ2BUBIZJTAILN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XVFAOARQTDGWUZ2BUBIZJTAILN/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-05T12:56:38Z","links":{"resolver":"https://pith.science/pith/XVFAOARQTDGWUZ2BUBIZJTAILN","bundle":"https://pith.science/pith/XVFAOARQTDGWUZ2BUBIZJTAILN/bundle.json","state":"https://pith.science/pith/XVFAOARQTDGWUZ2BUBIZJTAILN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XVFAOARQTDGWUZ2BUBIZJTAILN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:XVFAOARQTDGWUZ2BUBIZJTAILN","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":"b8aaa258b4f9744d8bb1dc333da26043b89608ab66487583eab0aed016c76724","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2019-01-18T14:21:12Z","title_canon_sha256":"bb78523141b19286cee952a5964c6a776a112a32cfb20c2cd70a627a0ca865a7"},"schema_version":"1.0","source":{"id":"1903.02082","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.02082","created_at":"2026-05-17T23:51:56Z"},{"alias_kind":"arxiv_version","alias_value":"1903.02082v1","created_at":"2026-05-17T23:51:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02082","created_at":"2026-05-17T23:51:56Z"},{"alias_kind":"pith_short_12","alias_value":"XVFAOARQTDGW","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XVFAOARQTDGWUZ2B","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XVFAOARQ","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:714a1dd29a34b398597118aa93ce762de13022c9a6b6e948c00a7c994aa3be09","target":"graph","created_at":"2026-05-17T23:51: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":"Much sequential data exhibits highly non-uniform information distribution. This cannot be correctly modeled by traditional Long Short-Term Memory (LSTM). To address that, recent works have extended LSTM by adding more activations between adjacent inputs. However, the approaches often use a fixed depth, which is at the step of the most information content. This one-size-fits-all worst-case approach is not satisfactory, because when little information is distributed to some steps, shallow structures can achieve faster convergence and consume less computation resource. In this paper, we develop a","authors_text":"Ka-Ho Chow, S.-H. Gary Chan, Yifeng Zhang","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2019-01-18T14:21:12Z","title":"DA-LSTM: A Long Short-Term Memory with Depth Adaptive to Non-uniform Information Flow in Sequential Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.02082","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:2680fc54ef2a485d4d9b6c796d49fcd07bbba01a53b5a8b5f7640d18715fbe91","target":"record","created_at":"2026-05-17T23:51: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":"b8aaa258b4f9744d8bb1dc333da26043b89608ab66487583eab0aed016c76724","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2019-01-18T14:21:12Z","title_canon_sha256":"bb78523141b19286cee952a5964c6a776a112a32cfb20c2cd70a627a0ca865a7"},"schema_version":"1.0","source":{"id":"1903.02082","kind":"arxiv","version":1}},"canonical_sha256":"bd4a07023098cd6a6741a05194cc085b4ea7087f909906b0c4eb419d5193a870","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd4a07023098cd6a6741a05194cc085b4ea7087f909906b0c4eb419d5193a870","first_computed_at":"2026-05-17T23:51:56.703438Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:56.703438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AdoUJ/p7EBU2omMONnrOnMwcOCEQ1IvexMMlBLemSdqqhbJENLdT/umYamNNAaCD5vr4cU/J9jh7eQz3XqDYBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:56.703854Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.02082","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2680fc54ef2a485d4d9b6c796d49fcd07bbba01a53b5a8b5f7640d18715fbe91","sha256:714a1dd29a34b398597118aa93ce762de13022c9a6b6e948c00a7c994aa3be09"],"state_sha256":"1d5f9618615d8c03c2d0087fcbe86bd4bd41dbb227ecfbbee37f2a0c98f8cfcf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bI5bw2idudqRlqtiv3cB//IUngV/FkamtUx4AuJjZYSclkMYxMZu+hlnkw/GOi3mRA8WNI1M55dCBoBRPcLFAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T12:56:38.207719Z","bundle_sha256":"979d145bbae93cfe6f696a463b72f450cd2aa40c84c816ef590601baa79feda9"}}