{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:QBNRMYZVDX7DMWMWFLSXXWDTCE","short_pith_number":"pith:QBNRMYZV","canonical_record":{"source":{"id":"1201.0200","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-12-31T00:03:33Z","cross_cats_sorted":[],"title_canon_sha256":"1d6560b084fc74a5f9bb94766bcb1553c030e34970cce159e12036a3fe996df7","abstract_canon_sha256":"002f4e0821b010604c1e40c70f750a531fbfb922bd92c43529c3a35179ade285"},"schema_version":"1.0"},"canonical_sha256":"805b1663351dfe3659962ae57bd873112afe15e20a5cdd8231defeac66be80f5","source":{"kind":"arxiv","id":"1201.0200","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.0200","created_at":"2026-05-18T04:03:42Z"},{"alias_kind":"arxiv_version","alias_value":"1201.0200v2","created_at":"2026-05-18T04:03:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0200","created_at":"2026-05-18T04:03:42Z"},{"alias_kind":"pith_short_12","alias_value":"QBNRMYZVDX7D","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QBNRMYZVDX7DMWMW","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QBNRMYZV","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:QBNRMYZVDX7DMWMWFLSXXWDTCE","target":"record","payload":{"canonical_record":{"source":{"id":"1201.0200","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-12-31T00:03:33Z","cross_cats_sorted":[],"title_canon_sha256":"1d6560b084fc74a5f9bb94766bcb1553c030e34970cce159e12036a3fe996df7","abstract_canon_sha256":"002f4e0821b010604c1e40c70f750a531fbfb922bd92c43529c3a35179ade285"},"schema_version":"1.0"},"canonical_sha256":"805b1663351dfe3659962ae57bd873112afe15e20a5cdd8231defeac66be80f5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:42.595994Z","signature_b64":"UM3VuocBUuTuJAmV+PPu/B/S8xWjhpRy2hJ4j6NvDFxI355JyLZUAkrC50F5EL3+16tAJQ8NJvyfAhhJ9srZCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"805b1663351dfe3659962ae57bd873112afe15e20a5cdd8231defeac66be80f5","last_reissued_at":"2026-05-18T04:03:42.595502Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:42.595502Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.0200","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-18T04:03:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uaVyvgkOH7eRZcOItv7FLuIpN80CAuKQMvFE3kDYn9vWP9vZB5RaExp4PS0PQd+/2r79KaeMSYvdE+VGgi1XAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:16:32.207056Z"},"content_sha256":"d73dc6abf85c39be6d598731cf7a9f2e6fd737168220ab0c8d469749cd2e6429","schema_version":"1.0","event_id":"sha256:d73dc6abf85c39be6d598731cf7a9f2e6fd737168220ab0c8d469749cd2e6429"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:QBNRMYZVDX7DMWMWFLSXXWDTCE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Gaussian matrix-product states for coding in bosonic communication channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Evgueni Karpov, Joachim Sch\\\"afer, Nicolas J. Cerf","submitted_at":"2011-12-31T00:03:33Z","abstract_excerpt":"The communication capacity of Gaussian bosonic channels with memory has recently attracted much interest. Here, we investigate a method to prepare the multimode entangled input symbol states for encoding classical information into these channels. In particular, we study the usefulness of a Gaussian matrix product state (GMPS) as an input symbol state, which can be sequentially generated although it remains heavily entangled for an arbitrary number of modes. We show that the GMPS can achieve more than 99.9% of the Gaussian capacity for Gaussian bosonic memory channels with a Markovian or non-Ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.0200","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-18T04:03:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hwTddEX8sXbKbmG9NWngaS8yjvaB6XUKe29ko72/UmgLSrmgoxQoeSiKlGbV0CnciFM3YP0FzXnZ5BpPi8CaDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:16:32.207422Z"},"content_sha256":"341bb7c41e44a56ec2413f5a19792ba067386f4f5239b90bb3dd6d5cd82e5b39","schema_version":"1.0","event_id":"sha256:341bb7c41e44a56ec2413f5a19792ba067386f4f5239b90bb3dd6d5cd82e5b39"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QBNRMYZVDX7DMWMWFLSXXWDTCE/bundle.json","state_url":"https://pith.science/pith/QBNRMYZVDX7DMWMWFLSXXWDTCE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QBNRMYZVDX7DMWMWFLSXXWDTCE/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-31T12:16:32Z","links":{"resolver":"https://pith.science/pith/QBNRMYZVDX7DMWMWFLSXXWDTCE","bundle":"https://pith.science/pith/QBNRMYZVDX7DMWMWFLSXXWDTCE/bundle.json","state":"https://pith.science/pith/QBNRMYZVDX7DMWMWFLSXXWDTCE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QBNRMYZVDX7DMWMWFLSXXWDTCE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:QBNRMYZVDX7DMWMWFLSXXWDTCE","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":"002f4e0821b010604c1e40c70f750a531fbfb922bd92c43529c3a35179ade285","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-12-31T00:03:33Z","title_canon_sha256":"1d6560b084fc74a5f9bb94766bcb1553c030e34970cce159e12036a3fe996df7"},"schema_version":"1.0","source":{"id":"1201.0200","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.0200","created_at":"2026-05-18T04:03:42Z"},{"alias_kind":"arxiv_version","alias_value":"1201.0200v2","created_at":"2026-05-18T04:03:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0200","created_at":"2026-05-18T04:03:42Z"},{"alias_kind":"pith_short_12","alias_value":"QBNRMYZVDX7D","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QBNRMYZVDX7DMWMW","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QBNRMYZV","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:341bb7c41e44a56ec2413f5a19792ba067386f4f5239b90bb3dd6d5cd82e5b39","target":"graph","created_at":"2026-05-18T04:03:42Z","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":"The communication capacity of Gaussian bosonic channels with memory has recently attracted much interest. Here, we investigate a method to prepare the multimode entangled input symbol states for encoding classical information into these channels. In particular, we study the usefulness of a Gaussian matrix product state (GMPS) as an input symbol state, which can be sequentially generated although it remains heavily entangled for an arbitrary number of modes. We show that the GMPS can achieve more than 99.9% of the Gaussian capacity for Gaussian bosonic memory channels with a Markovian or non-Ma","authors_text":"Evgueni Karpov, Joachim Sch\\\"afer, Nicolas J. Cerf","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-12-31T00:03:33Z","title":"Gaussian matrix-product states for coding in bosonic communication channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.0200","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:d73dc6abf85c39be6d598731cf7a9f2e6fd737168220ab0c8d469749cd2e6429","target":"record","created_at":"2026-05-18T04:03:42Z","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":"002f4e0821b010604c1e40c70f750a531fbfb922bd92c43529c3a35179ade285","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-12-31T00:03:33Z","title_canon_sha256":"1d6560b084fc74a5f9bb94766bcb1553c030e34970cce159e12036a3fe996df7"},"schema_version":"1.0","source":{"id":"1201.0200","kind":"arxiv","version":2}},"canonical_sha256":"805b1663351dfe3659962ae57bd873112afe15e20a5cdd8231defeac66be80f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"805b1663351dfe3659962ae57bd873112afe15e20a5cdd8231defeac66be80f5","first_computed_at":"2026-05-18T04:03:42.595502Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:03:42.595502Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UM3VuocBUuTuJAmV+PPu/B/S8xWjhpRy2hJ4j6NvDFxI355JyLZUAkrC50F5EL3+16tAJQ8NJvyfAhhJ9srZCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:03:42.595994Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.0200","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d73dc6abf85c39be6d598731cf7a9f2e6fd737168220ab0c8d469749cd2e6429","sha256:341bb7c41e44a56ec2413f5a19792ba067386f4f5239b90bb3dd6d5cd82e5b39"],"state_sha256":"c1b5b974fcf284a1de76678da1180ec28b245c6d8530fdfcccc6b519cd02c396"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QKk4o8DYNorRS5SFcoCxCvrR3QkyaqVERAkOvOR8JgPtCqKy8DGIzipEqEBch973JLGR77hFOC91PcOr5m1tCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:16:32.209835Z","bundle_sha256":"311e4194c3c3e230f7ec5ba2a736aa748ac677af7a68b541d9e6b7e626c4f259"}}