{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:QQUKYGWGVB3LS36TU77ZNVNBS4","short_pith_number":"pith:QQUKYGWG","canonical_record":{"source":{"id":"1604.00279","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-04-01T15:24:27Z","cross_cats_sorted":["cs.LG","cs.NE"],"title_canon_sha256":"d637d95e3f72173aad61e74aee43e47db80fa90aed79c590c3489e745104bae3","abstract_canon_sha256":"66744f6bc074760a302cd0691ff05cd58484de516ad2daea8bb1b876dff49e0b"},"schema_version":"1.0"},"canonical_sha256":"8428ac1ac6a876b96fd3a7ff96d5a1973ab443b48ab8ca1a0722bb2e3aa936dd","source":{"kind":"arxiv","id":"1604.00279","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.00279","created_at":"2026-05-18T00:51:51Z"},{"alias_kind":"arxiv_version","alias_value":"1604.00279v2","created_at":"2026-05-18T00:51:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00279","created_at":"2026-05-18T00:51:51Z"},{"alias_kind":"pith_short_12","alias_value":"QQUKYGWGVB3L","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"QQUKYGWGVB3LS36T","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"QQUKYGWG","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:QQUKYGWGVB3LS36TU77ZNVNBS4","target":"record","payload":{"canonical_record":{"source":{"id":"1604.00279","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-04-01T15:24:27Z","cross_cats_sorted":["cs.LG","cs.NE"],"title_canon_sha256":"d637d95e3f72173aad61e74aee43e47db80fa90aed79c590c3489e745104bae3","abstract_canon_sha256":"66744f6bc074760a302cd0691ff05cd58484de516ad2daea8bb1b876dff49e0b"},"schema_version":"1.0"},"canonical_sha256":"8428ac1ac6a876b96fd3a7ff96d5a1973ab443b48ab8ca1a0722bb2e3aa936dd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:51.499246Z","signature_b64":"Me7yCLY3vKpfiqHlnQevGxWzIldi9c+3ayLs4/dqwYjR9AbwlcTlk/N2a1vZ6xcfWFD+G7+7Hsn/dW4RncyXCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8428ac1ac6a876b96fd3a7ff96d5a1973ab443b48ab8ca1a0722bb2e3aa936dd","last_reissued_at":"2026-05-18T00:51:51.498629Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:51.498629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.00279","source_version":2,"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:51:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5GeV5pT6bfNr+iRraG3uXh3U6pUKayWDTPFvmuyHVHytzMJb3oUqwdZxztL8godwqn9XCnfICC3p8qC/vQMKBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:44:16.629045Z"},"content_sha256":"1b047cafa7e4253bfc6ea236170ca664b9d901ecafc712b7830015a1219f8776","schema_version":"1.0","event_id":"sha256:1b047cafa7e4253bfc6ea236170ca664b9d901ecafc712b7830015a1219f8776"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:QQUKYGWGVB3LS36TU77ZNVNBS4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Using Recurrent Neural Networks to Optimize Dynamical Decoupling for Quantum Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE"],"primary_cat":"quant-ph","authors_text":"Moritz August, Xiaotong Ni","submitted_at":"2016-04-01T15:24:27Z","abstract_excerpt":"We utilize machine learning models which are based on recurrent neural networks to optimize dynamical decoupling (DD) sequences. DD is a relatively simple technique for suppressing the errors in quantum memory for certain noise models. In numerical simulations, we show that with minimum use of prior knowledge and starting from random sequences, the models are able to improve over time and eventually output DD-sequences with performance better than that of the well known DD-families. Furthermore, our algorithm is easy to implement in experiments to find solutions tailored to the specific hardwa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00279","kind":"arxiv","version":2},"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:51:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yLviF9n9t9PMAVFbq+/mOeyRWZ9CbmmXzBKT9LklH61BOG9rOEJJ8NihvrLP2dx0y3DdRdRO5Mkaiti3B4KvDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:44:16.629402Z"},"content_sha256":"f4545e1ea62e72026ba79692ae6449d1e88be62d1a8857f77bee504418d23597","schema_version":"1.0","event_id":"sha256:f4545e1ea62e72026ba79692ae6449d1e88be62d1a8857f77bee504418d23597"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QQUKYGWGVB3LS36TU77ZNVNBS4/bundle.json","state_url":"https://pith.science/pith/QQUKYGWGVB3LS36TU77ZNVNBS4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QQUKYGWGVB3LS36TU77ZNVNBS4/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-03T05:44:16Z","links":{"resolver":"https://pith.science/pith/QQUKYGWGVB3LS36TU77ZNVNBS4","bundle":"https://pith.science/pith/QQUKYGWGVB3LS36TU77ZNVNBS4/bundle.json","state":"https://pith.science/pith/QQUKYGWGVB3LS36TU77ZNVNBS4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QQUKYGWGVB3LS36TU77ZNVNBS4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:QQUKYGWGVB3LS36TU77ZNVNBS4","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":"66744f6bc074760a302cd0691ff05cd58484de516ad2daea8bb1b876dff49e0b","cross_cats_sorted":["cs.LG","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-04-01T15:24:27Z","title_canon_sha256":"d637d95e3f72173aad61e74aee43e47db80fa90aed79c590c3489e745104bae3"},"schema_version":"1.0","source":{"id":"1604.00279","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.00279","created_at":"2026-05-18T00:51:51Z"},{"alias_kind":"arxiv_version","alias_value":"1604.00279v2","created_at":"2026-05-18T00:51:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00279","created_at":"2026-05-18T00:51:51Z"},{"alias_kind":"pith_short_12","alias_value":"QQUKYGWGVB3L","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"QQUKYGWGVB3LS36T","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"QQUKYGWG","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:f4545e1ea62e72026ba79692ae6449d1e88be62d1a8857f77bee504418d23597","target":"graph","created_at":"2026-05-18T00:51:51Z","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":"We utilize machine learning models which are based on recurrent neural networks to optimize dynamical decoupling (DD) sequences. DD is a relatively simple technique for suppressing the errors in quantum memory for certain noise models. In numerical simulations, we show that with minimum use of prior knowledge and starting from random sequences, the models are able to improve over time and eventually output DD-sequences with performance better than that of the well known DD-families. Furthermore, our algorithm is easy to implement in experiments to find solutions tailored to the specific hardwa","authors_text":"Moritz August, Xiaotong Ni","cross_cats":["cs.LG","cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-04-01T15:24:27Z","title":"Using Recurrent Neural Networks to Optimize Dynamical Decoupling for Quantum Memory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00279","kind":"arxiv","version":2},"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:1b047cafa7e4253bfc6ea236170ca664b9d901ecafc712b7830015a1219f8776","target":"record","created_at":"2026-05-18T00:51:51Z","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":"66744f6bc074760a302cd0691ff05cd58484de516ad2daea8bb1b876dff49e0b","cross_cats_sorted":["cs.LG","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-04-01T15:24:27Z","title_canon_sha256":"d637d95e3f72173aad61e74aee43e47db80fa90aed79c590c3489e745104bae3"},"schema_version":"1.0","source":{"id":"1604.00279","kind":"arxiv","version":2}},"canonical_sha256":"8428ac1ac6a876b96fd3a7ff96d5a1973ab443b48ab8ca1a0722bb2e3aa936dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8428ac1ac6a876b96fd3a7ff96d5a1973ab443b48ab8ca1a0722bb2e3aa936dd","first_computed_at":"2026-05-18T00:51:51.498629Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:51.498629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Me7yCLY3vKpfiqHlnQevGxWzIldi9c+3ayLs4/dqwYjR9AbwlcTlk/N2a1vZ6xcfWFD+G7+7Hsn/dW4RncyXCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:51.499246Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.00279","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b047cafa7e4253bfc6ea236170ca664b9d901ecafc712b7830015a1219f8776","sha256:f4545e1ea62e72026ba79692ae6449d1e88be62d1a8857f77bee504418d23597"],"state_sha256":"8399a9615c19fd69da5ab2a3522b2e2839c71afa8153d6693630b280f95d86ae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HGkNpDCUqBowaEwwzUwbSmgLjJ66PTEa3A60uxcjSaT6R2XaHcylWrqo+KCNQ3UVK7GJxU7rQH3T3nCA5c0ECQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T05:44:16.631393Z","bundle_sha256":"42f46c6c257630849adf1bf02a048f0f2811f270de9a2880b39eb73fe976a029"}}