{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:M4UMM5Y4VTMUKCQCVGJN2BRCMZ","short_pith_number":"pith:M4UMM5Y4","canonical_record":{"source":{"id":"1204.1505","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-04-06T16:01:53Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"0aac59b9c896986e4cec4d753c2840c840a988a29192d400dfe745384811cac1","abstract_canon_sha256":"dd408855beaf4d14b24a88b9903265832256645f66ca6fed3aad60c62b0161db"},"schema_version":"1.0"},"canonical_sha256":"6728c6771cacd9450a02a992dd06226660c4b9c003eb8a5f4c90755305fb4cdb","source":{"kind":"arxiv","id":"1204.1505","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.1505","created_at":"2026-05-18T03:36:06Z"},{"alias_kind":"arxiv_version","alias_value":"1204.1505v2","created_at":"2026-05-18T03:36:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.1505","created_at":"2026-05-18T03:36:06Z"},{"alias_kind":"pith_short_12","alias_value":"M4UMM5Y4VTMU","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"M4UMM5Y4VTMUKCQC","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"M4UMM5Y4","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:M4UMM5Y4VTMUKCQCVGJN2BRCMZ","target":"record","payload":{"canonical_record":{"source":{"id":"1204.1505","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-04-06T16:01:53Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"0aac59b9c896986e4cec4d753c2840c840a988a29192d400dfe745384811cac1","abstract_canon_sha256":"dd408855beaf4d14b24a88b9903265832256645f66ca6fed3aad60c62b0161db"},"schema_version":"1.0"},"canonical_sha256":"6728c6771cacd9450a02a992dd06226660c4b9c003eb8a5f4c90755305fb4cdb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:06.466893Z","signature_b64":"pcI2z7h8hlViGSo0uar9Yu5h6NjZV5PJqAgZJKi5FkRdBKz2SUdo1MIWhtBtMc7ViZ3qoFkEFRjLMMDJkpcCDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6728c6771cacd9450a02a992dd06226660c4b9c003eb8a5f4c90755305fb4cdb","last_reissued_at":"2026-05-18T03:36:06.466310Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:06.466310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.1505","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-18T03:36:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dbM6s61ePcj4ObJytUBM+s+W217T/q+X9yVIj50DCQen8p3K/U5gc++deB4oFACASL7CwAN4O1rO7tSB4KCsDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:51:55.189677Z"},"content_sha256":"81468a6b500237549da662385c47ecf4df80b907e46251273d859bef91c0b053","schema_version":"1.0","event_id":"sha256:81468a6b500237549da662385c47ecf4df80b907e46251273d859bef91c0b053"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:M4UMM5Y4VTMUKCQCVGJN2BRCMZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower bounds on information complexity via zero-communication protocols and applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CC","authors_text":"David Xiao, Iordanis Kerenidis, J\\'er\\'emie Roland, Sophie Laplante, Virginie Lerays","submitted_at":"2012-04-06T16:01:53Z","abstract_excerpt":"We show that almost all known lower bound methods for communication complexity are also lower bounds for the information complexity. In particular, we define a relaxed version of the partition bound of Jain and Klauck and prove that it lower bounds the information complexity of any function. Our relaxed partition bound subsumes all norm based methods (e.g. the factorization norm method) and rectangle-based methods (e.g. the rectangle/corruption bound, the smooth rectangle bound, and the discrepancy bound), except the partition bound. Our result uses a new connection between rectangles and zero"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.1505","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-18T03:36:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZUJeU0IDtf6sN2QdMH8xuwUEwOfqr7aX6FV2nTTuzLQI452JC1v8g3s2IDILlMOm98eifGRfXiKlLv5uqM0bCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:51:55.190028Z"},"content_sha256":"f4619413e1119a70130baaa3957adb7a6a5b700eef4b309332d4fcdfefbf174e","schema_version":"1.0","event_id":"sha256:f4619413e1119a70130baaa3957adb7a6a5b700eef4b309332d4fcdfefbf174e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M4UMM5Y4VTMUKCQCVGJN2BRCMZ/bundle.json","state_url":"https://pith.science/pith/M4UMM5Y4VTMUKCQCVGJN2BRCMZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M4UMM5Y4VTMUKCQCVGJN2BRCMZ/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-03T16:51:55Z","links":{"resolver":"https://pith.science/pith/M4UMM5Y4VTMUKCQCVGJN2BRCMZ","bundle":"https://pith.science/pith/M4UMM5Y4VTMUKCQCVGJN2BRCMZ/bundle.json","state":"https://pith.science/pith/M4UMM5Y4VTMUKCQCVGJN2BRCMZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M4UMM5Y4VTMUKCQCVGJN2BRCMZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:M4UMM5Y4VTMUKCQCVGJN2BRCMZ","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":"dd408855beaf4d14b24a88b9903265832256645f66ca6fed3aad60c62b0161db","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-04-06T16:01:53Z","title_canon_sha256":"0aac59b9c896986e4cec4d753c2840c840a988a29192d400dfe745384811cac1"},"schema_version":"1.0","source":{"id":"1204.1505","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.1505","created_at":"2026-05-18T03:36:06Z"},{"alias_kind":"arxiv_version","alias_value":"1204.1505v2","created_at":"2026-05-18T03:36:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.1505","created_at":"2026-05-18T03:36:06Z"},{"alias_kind":"pith_short_12","alias_value":"M4UMM5Y4VTMU","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"M4UMM5Y4VTMUKCQC","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"M4UMM5Y4","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:f4619413e1119a70130baaa3957adb7a6a5b700eef4b309332d4fcdfefbf174e","target":"graph","created_at":"2026-05-18T03:36:06Z","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 show that almost all known lower bound methods for communication complexity are also lower bounds for the information complexity. In particular, we define a relaxed version of the partition bound of Jain and Klauck and prove that it lower bounds the information complexity of any function. Our relaxed partition bound subsumes all norm based methods (e.g. the factorization norm method) and rectangle-based methods (e.g. the rectangle/corruption bound, the smooth rectangle bound, and the discrepancy bound), except the partition bound. Our result uses a new connection between rectangles and zero","authors_text":"David Xiao, Iordanis Kerenidis, J\\'er\\'emie Roland, Sophie Laplante, Virginie Lerays","cross_cats":["quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-04-06T16:01:53Z","title":"Lower bounds on information complexity via zero-communication protocols and applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.1505","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:81468a6b500237549da662385c47ecf4df80b907e46251273d859bef91c0b053","target":"record","created_at":"2026-05-18T03:36:06Z","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":"dd408855beaf4d14b24a88b9903265832256645f66ca6fed3aad60c62b0161db","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-04-06T16:01:53Z","title_canon_sha256":"0aac59b9c896986e4cec4d753c2840c840a988a29192d400dfe745384811cac1"},"schema_version":"1.0","source":{"id":"1204.1505","kind":"arxiv","version":2}},"canonical_sha256":"6728c6771cacd9450a02a992dd06226660c4b9c003eb8a5f4c90755305fb4cdb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6728c6771cacd9450a02a992dd06226660c4b9c003eb8a5f4c90755305fb4cdb","first_computed_at":"2026-05-18T03:36:06.466310Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:06.466310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pcI2z7h8hlViGSo0uar9Yu5h6NjZV5PJqAgZJKi5FkRdBKz2SUdo1MIWhtBtMc7ViZ3qoFkEFRjLMMDJkpcCDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:06.466893Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.1505","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:81468a6b500237549da662385c47ecf4df80b907e46251273d859bef91c0b053","sha256:f4619413e1119a70130baaa3957adb7a6a5b700eef4b309332d4fcdfefbf174e"],"state_sha256":"bf191cd9ed29eaa051475d59a9fb8975e5a50816165ab2f587c79ded79a45845"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FsAY4wLRZU+OBIn0Ujk9an+uDqOio17R4BAaHymG43IvL/Vldh+USjTSZ44N6VzESfchE28MalrSwprMlJvqCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T16:51:55.192037Z","bundle_sha256":"f79c09016bfe2ef4325fd8c31b7fe9f8608b65d8cdcb6f81be8b6d814082a751"}}