{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:X73KJBXY64MKA6KCIA6ELW2DSR","short_pith_number":"pith:X73KJBXY","canonical_record":{"source":{"id":"1905.10540","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-25T07:14:05Z","cross_cats_sorted":["cs.NE","stat.ML"],"title_canon_sha256":"00687d1958f934f7e8996708080dbcd1c077ac762476b314c78e7a8b715ad366","abstract_canon_sha256":"4dd8edefa15122fc0f56263fa9865e2a8b50b8c47fd578fef1b8d4e453e71e2c"},"schema_version":"1.0"},"canonical_sha256":"bff6a486f8f718a07942403c45db43947230a9f66e754c9008915e0b2a35b720","source":{"kind":"arxiv","id":"1905.10540","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.10540","created_at":"2026-05-17T23:45:08Z"},{"alias_kind":"arxiv_version","alias_value":"1905.10540v1","created_at":"2026-05-17T23:45:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10540","created_at":"2026-05-17T23:45:08Z"},{"alias_kind":"pith_short_12","alias_value":"X73KJBXY64MK","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"X73KJBXY64MKA6KC","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"X73KJBXY","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:X73KJBXY64MKA6KCIA6ELW2DSR","target":"record","payload":{"canonical_record":{"source":{"id":"1905.10540","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-25T07:14:05Z","cross_cats_sorted":["cs.NE","stat.ML"],"title_canon_sha256":"00687d1958f934f7e8996708080dbcd1c077ac762476b314c78e7a8b715ad366","abstract_canon_sha256":"4dd8edefa15122fc0f56263fa9865e2a8b50b8c47fd578fef1b8d4e453e71e2c"},"schema_version":"1.0"},"canonical_sha256":"bff6a486f8f718a07942403c45db43947230a9f66e754c9008915e0b2a35b720","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:08.171878Z","signature_b64":"jZcEu1XzDc78ARM2gYeSP/74ruBHHWDg9hjRmQIrWCyAXOx1isWs+z803fvpIZTXhkA4KQVmAyKdA7Zt/3f5BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bff6a486f8f718a07942403c45db43947230a9f66e754c9008915e0b2a35b720","last_reissued_at":"2026-05-17T23:45:08.171274Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:08.171274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.10540","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:45:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NazzWPhRi5upuqR/PhrnZhp9FqA/p9QhQtFBe0nlSRACBfmulFYU9W+bcvTh+xuIKcAG0RYnkS9kcz76htCODA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:15:54.542381Z"},"content_sha256":"8dcc6060622ef7524bd9d88a1c0b38da04b1de38e98a4afff7fc237395554745","schema_version":"1.0","event_id":"sha256:8dcc6060622ef7524bd9d88a1c0b38da04b1de38e98a4afff7fc237395554745"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:X73KJBXY64MKA6KCIA6ELW2DSR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Cell Structure via Recursive-Recurrent Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Diego Klabjan, Matthew Kennedy, Xin Qian","submitted_at":"2019-05-25T07:14:05Z","abstract_excerpt":"In a recurrent setting, conventional approaches to neural architecture search find and fix a general model for all data samples and time steps. We propose a novel algorithm that can dynamically search for the structure of cells in a recurrent neural network model. Based on a combination of recurrent and recursive neural networks, our algorithm is able to construct customized cell structures for each data sample and time step, allowing for a more efficient architecture search than existing models. Experiments on three common datasets show that the algorithm discovers high-performance cell archi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10540","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:45:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8qU45V7fELG7zOZYgtIas6k4fCyI3DAcKozWfmb95xmrIJWT/8+y6ZW8uNZUshqiKgOE3fdYAiC1pPwdNWl7Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:15:54.542735Z"},"content_sha256":"b18aa5f407bd64e0c4f1ffe3334fd8a95f45e240bae60be1f4e7fa7f6386c0b2","schema_version":"1.0","event_id":"sha256:b18aa5f407bd64e0c4f1ffe3334fd8a95f45e240bae60be1f4e7fa7f6386c0b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X73KJBXY64MKA6KCIA6ELW2DSR/bundle.json","state_url":"https://pith.science/pith/X73KJBXY64MKA6KCIA6ELW2DSR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X73KJBXY64MKA6KCIA6ELW2DSR/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-28T08:15:54Z","links":{"resolver":"https://pith.science/pith/X73KJBXY64MKA6KCIA6ELW2DSR","bundle":"https://pith.science/pith/X73KJBXY64MKA6KCIA6ELW2DSR/bundle.json","state":"https://pith.science/pith/X73KJBXY64MKA6KCIA6ELW2DSR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X73KJBXY64MKA6KCIA6ELW2DSR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:X73KJBXY64MKA6KCIA6ELW2DSR","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":"4dd8edefa15122fc0f56263fa9865e2a8b50b8c47fd578fef1b8d4e453e71e2c","cross_cats_sorted":["cs.NE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-25T07:14:05Z","title_canon_sha256":"00687d1958f934f7e8996708080dbcd1c077ac762476b314c78e7a8b715ad366"},"schema_version":"1.0","source":{"id":"1905.10540","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.10540","created_at":"2026-05-17T23:45:08Z"},{"alias_kind":"arxiv_version","alias_value":"1905.10540v1","created_at":"2026-05-17T23:45:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10540","created_at":"2026-05-17T23:45:08Z"},{"alias_kind":"pith_short_12","alias_value":"X73KJBXY64MK","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"X73KJBXY64MKA6KC","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"X73KJBXY","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:b18aa5f407bd64e0c4f1ffe3334fd8a95f45e240bae60be1f4e7fa7f6386c0b2","target":"graph","created_at":"2026-05-17T23:45:08Z","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":"In a recurrent setting, conventional approaches to neural architecture search find and fix a general model for all data samples and time steps. We propose a novel algorithm that can dynamically search for the structure of cells in a recurrent neural network model. Based on a combination of recurrent and recursive neural networks, our algorithm is able to construct customized cell structures for each data sample and time step, allowing for a more efficient architecture search than existing models. Experiments on three common datasets show that the algorithm discovers high-performance cell archi","authors_text":"Diego Klabjan, Matthew Kennedy, Xin Qian","cross_cats":["cs.NE","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-25T07:14:05Z","title":"Dynamic Cell Structure via Recursive-Recurrent Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10540","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:8dcc6060622ef7524bd9d88a1c0b38da04b1de38e98a4afff7fc237395554745","target":"record","created_at":"2026-05-17T23:45:08Z","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":"4dd8edefa15122fc0f56263fa9865e2a8b50b8c47fd578fef1b8d4e453e71e2c","cross_cats_sorted":["cs.NE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-25T07:14:05Z","title_canon_sha256":"00687d1958f934f7e8996708080dbcd1c077ac762476b314c78e7a8b715ad366"},"schema_version":"1.0","source":{"id":"1905.10540","kind":"arxiv","version":1}},"canonical_sha256":"bff6a486f8f718a07942403c45db43947230a9f66e754c9008915e0b2a35b720","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bff6a486f8f718a07942403c45db43947230a9f66e754c9008915e0b2a35b720","first_computed_at":"2026-05-17T23:45:08.171274Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:08.171274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jZcEu1XzDc78ARM2gYeSP/74ruBHHWDg9hjRmQIrWCyAXOx1isWs+z803fvpIZTXhkA4KQVmAyKdA7Zt/3f5BQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:08.171878Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.10540","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8dcc6060622ef7524bd9d88a1c0b38da04b1de38e98a4afff7fc237395554745","sha256:b18aa5f407bd64e0c4f1ffe3334fd8a95f45e240bae60be1f4e7fa7f6386c0b2"],"state_sha256":"85f7142db4e864b7d9c6af2516203917d117d08f92dfb8925adbf4d81b770534"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NqQbAs5edO3egn4H4UZIaMiEtROOh1cKD8tRr+AFwULy7zgctiOmg6SWGipBsz6tJODG3tKZxtjZfuqXPjtfDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T08:15:54.544785Z","bundle_sha256":"e4ffee641ec16857194261d5330c96067fcc8643d441bc5521c1d8c281fd6ef7"}}