{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:IFSZNOPSSXIJ2ETSVIJLHCCHWJ","short_pith_number":"pith:IFSZNOPS","canonical_record":{"source":{"id":"1401.4126","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-01-16T18:50:58Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"37b6b74118b6bb5a48ad0e15e99866f28f9c8f16aee379b6424ff1d0c1f6664f","abstract_canon_sha256":"265e6c18b708081ac4433343d654fc19de8941127d77820e2fb67dd041108c84"},"schema_version":"1.0"},"canonical_sha256":"416596b9f295d09d1272aa12b38847b25ed999f66676a6c813704c0667a01aba","source":{"kind":"arxiv","id":"1401.4126","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4126","created_at":"2026-05-18T03:01:57Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4126v1","created_at":"2026-05-18T03:01:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4126","created_at":"2026-05-18T03:01:57Z"},{"alias_kind":"pith_short_12","alias_value":"IFSZNOPSSXIJ","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IFSZNOPSSXIJ2ETS","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IFSZNOPS","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:IFSZNOPSSXIJ2ETSVIJLHCCHWJ","target":"record","payload":{"canonical_record":{"source":{"id":"1401.4126","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-01-16T18:50:58Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"37b6b74118b6bb5a48ad0e15e99866f28f9c8f16aee379b6424ff1d0c1f6664f","abstract_canon_sha256":"265e6c18b708081ac4433343d654fc19de8941127d77820e2fb67dd041108c84"},"schema_version":"1.0"},"canonical_sha256":"416596b9f295d09d1272aa12b38847b25ed999f66676a6c813704c0667a01aba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:57.138879Z","signature_b64":"uwjGm+qGdjzWl//pH2eBNGXJ021NL3/v2amEhdR7/UVrHnMdyIt1rZEp6+Yr4N++lQWA40gfNl4GP04HUBdMCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"416596b9f295d09d1272aa12b38847b25ed999f66676a6c813704c0667a01aba","last_reissued_at":"2026-05-18T03:01:57.138273Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:57.138273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.4126","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-18T03:01:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nO7hv5VT5erOG+qXHMwWJY1dTExXa7Lc2Le3DDRzlr/ou7/HIuPNcozRqmhBqhXpgHrO5rV4bOybC6Qyn/FODw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T16:33:54.520941Z"},"content_sha256":"de15c08b20644ddd54bfa036b419a40db8484520d152cb7f36bd19d132fd22f3","schema_version":"1.0","event_id":"sha256:de15c08b20644ddd54bfa036b419a40db8484520d152cb7f36bd19d132fd22f3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:IFSZNOPSSXIJ2ETSVIJLHCCHWJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower bounds on the communication complexity of two-party (quantum) processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Alberto Montina, Stefan Wolf","submitted_at":"2014-01-16T18:50:58Z","abstract_excerpt":"The process of state preparation, its transmission and subsequent measurement can be classically simulated through the communication of some amount of classical information. Recently, we proved that the minimal communication cost is the minimum of a convex functional over a space of suitable probability distributions. It is now proved that this optimization problem is the dual of a geometric programming maximization problem, which displays some appealing properties. First, the number of variables grows linearly with the input size. Second, the objective function is linear in the input paramete"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4126","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-18T03:01:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zeJtDuJAPFi7rOeqKoQDE1uk63XkJXpXiIdetUNe0t5RPOFFYMWTIB8zlA0kpCyzSsdg88giHJa8RAtsAj99Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T16:33:54.521375Z"},"content_sha256":"4e69dd802630c13722c34a445862fae948abb2f282c70769dcb28ab9a924969d","schema_version":"1.0","event_id":"sha256:4e69dd802630c13722c34a445862fae948abb2f282c70769dcb28ab9a924969d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IFSZNOPSSXIJ2ETSVIJLHCCHWJ/bundle.json","state_url":"https://pith.science/pith/IFSZNOPSSXIJ2ETSVIJLHCCHWJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IFSZNOPSSXIJ2ETSVIJLHCCHWJ/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-22T16:33:54Z","links":{"resolver":"https://pith.science/pith/IFSZNOPSSXIJ2ETSVIJLHCCHWJ","bundle":"https://pith.science/pith/IFSZNOPSSXIJ2ETSVIJLHCCHWJ/bundle.json","state":"https://pith.science/pith/IFSZNOPSSXIJ2ETSVIJLHCCHWJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IFSZNOPSSXIJ2ETSVIJLHCCHWJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:IFSZNOPSSXIJ2ETSVIJLHCCHWJ","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":"265e6c18b708081ac4433343d654fc19de8941127d77820e2fb67dd041108c84","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-01-16T18:50:58Z","title_canon_sha256":"37b6b74118b6bb5a48ad0e15e99866f28f9c8f16aee379b6424ff1d0c1f6664f"},"schema_version":"1.0","source":{"id":"1401.4126","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4126","created_at":"2026-05-18T03:01:57Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4126v1","created_at":"2026-05-18T03:01:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4126","created_at":"2026-05-18T03:01:57Z"},{"alias_kind":"pith_short_12","alias_value":"IFSZNOPSSXIJ","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IFSZNOPSSXIJ2ETS","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IFSZNOPS","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:4e69dd802630c13722c34a445862fae948abb2f282c70769dcb28ab9a924969d","target":"graph","created_at":"2026-05-18T03:01:57Z","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 process of state preparation, its transmission and subsequent measurement can be classically simulated through the communication of some amount of classical information. Recently, we proved that the minimal communication cost is the minimum of a convex functional over a space of suitable probability distributions. It is now proved that this optimization problem is the dual of a geometric programming maximization problem, which displays some appealing properties. First, the number of variables grows linearly with the input size. Second, the objective function is linear in the input paramete","authors_text":"Alberto Montina, Stefan Wolf","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-01-16T18:50:58Z","title":"Lower bounds on the communication complexity of two-party (quantum) processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4126","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:de15c08b20644ddd54bfa036b419a40db8484520d152cb7f36bd19d132fd22f3","target":"record","created_at":"2026-05-18T03:01:57Z","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":"265e6c18b708081ac4433343d654fc19de8941127d77820e2fb67dd041108c84","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-01-16T18:50:58Z","title_canon_sha256":"37b6b74118b6bb5a48ad0e15e99866f28f9c8f16aee379b6424ff1d0c1f6664f"},"schema_version":"1.0","source":{"id":"1401.4126","kind":"arxiv","version":1}},"canonical_sha256":"416596b9f295d09d1272aa12b38847b25ed999f66676a6c813704c0667a01aba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"416596b9f295d09d1272aa12b38847b25ed999f66676a6c813704c0667a01aba","first_computed_at":"2026-05-18T03:01:57.138273Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:57.138273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uwjGm+qGdjzWl//pH2eBNGXJ021NL3/v2amEhdR7/UVrHnMdyIt1rZEp6+Yr4N++lQWA40gfNl4GP04HUBdMCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:57.138879Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.4126","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de15c08b20644ddd54bfa036b419a40db8484520d152cb7f36bd19d132fd22f3","sha256:4e69dd802630c13722c34a445862fae948abb2f282c70769dcb28ab9a924969d"],"state_sha256":"80d404a8f0f182663863386c5771736ffb7d40bfabaa01a268cf9090bb43345c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xf8oRLmLa9XZLIlqb4mUDxRMowjld/9Et/AeIaPlliBhD1REbbxzkS59DCkMzRGHLJtm95pyh/pAm3G1ASBvCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T16:33:54.523655Z","bundle_sha256":"9b565703027ce12c79d7f092b1a56766d0216e04dac7fa282a0810474dfc0cf4"}}