{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:QTLFLJMBIMRMQYVVV5D5TNXPAR","short_pith_number":"pith:QTLFLJMB","canonical_record":{"source":{"id":"1404.5153","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-04-21T09:53:58Z","cross_cats_sorted":[],"title_canon_sha256":"77bcbd186b52ee7deba0538056127a2a8b98a59c3f0c71969d88e0b83b7e1766","abstract_canon_sha256":"2383b4bdd8687897c77e82687c6132ffb571f0b31aba044a88b210488fbdc2ff"},"schema_version":"1.0"},"canonical_sha256":"84d655a5814322c862b5af47d9b6ef047d29d853e7305eb1158b2085f7dd2266","source":{"kind":"arxiv","id":"1404.5153","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5153","created_at":"2026-05-18T01:05:46Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5153v3","created_at":"2026-05-18T01:05:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5153","created_at":"2026-05-18T01:05:46Z"},{"alias_kind":"pith_short_12","alias_value":"QTLFLJMBIMRM","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QTLFLJMBIMRMQYVV","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QTLFLJMB","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:QTLFLJMBIMRMQYVVV5D5TNXPAR","target":"record","payload":{"canonical_record":{"source":{"id":"1404.5153","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-04-21T09:53:58Z","cross_cats_sorted":[],"title_canon_sha256":"77bcbd186b52ee7deba0538056127a2a8b98a59c3f0c71969d88e0b83b7e1766","abstract_canon_sha256":"2383b4bdd8687897c77e82687c6132ffb571f0b31aba044a88b210488fbdc2ff"},"schema_version":"1.0"},"canonical_sha256":"84d655a5814322c862b5af47d9b6ef047d29d853e7305eb1158b2085f7dd2266","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:46.608249Z","signature_b64":"KYs2Rkyftb3IqJm9hwB/DZlLwV9E1e6xpDeR89BD0ANiMj20QvKh/hZEUfhmCAAGCIWZXSyR0rcKHYa7cFLvCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84d655a5814322c862b5af47d9b6ef047d29d853e7305eb1158b2085f7dd2266","last_reissued_at":"2026-05-18T01:05:46.607653Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:46.607653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.5153","source_version":3,"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-18T01:05:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6D0SJY5l2gPfalXvkJ9m5fApQpdFSrp3FG/T+2ishfuk5oKjkE0epsewgVY8kCh67ak0/1655xxeXDGXDmgSDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T11:01:40.763015Z"},"content_sha256":"69616fe3c6a541c7c2f5f1a283a60ffd1707203eb854db56eb72d3fad4a5fc2a","schema_version":"1.0","event_id":"sha256:69616fe3c6a541c7c2f5f1a283a60ffd1707203eb854db56eb72d3fad4a5fc2a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:QTLFLJMBIMRMQYVVV5D5TNXPAR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal bounds for parity-oblivious random access codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andr\\'e Chailloux, Iordanis Kerenidis, Jamie Sikora, Srijita Kundu","submitted_at":"2014-04-21T09:53:58Z","abstract_excerpt":"Random access coding is an information task that has been extensively studied and found many applications in quantum information. In this scenario, Alice receives an $n$-bit string $x$, and wishes to encode $x$ into a quantum state $\\rho_x$, such that Bob, when receiving the state $\\rho_x$, can choose any bit $i \\in [n]$ and recover the input bit $x_i$ with high probability. Here we study two variants: parity-oblivious random access codes, where we impose the cryptographic property that Bob cannot infer any information about the parity of any subset of bits of the input apart from the single b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5153","kind":"arxiv","version":3},"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-18T01:05:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"01Db+hbwit4UxuhsT/pgGXYUWwOktTgTdnL9EmZbrTNCWrzSa34RrKLQNsYuLkmX8zsgi5NHewlPOSqNoWnTDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T11:01:40.763662Z"},"content_sha256":"53e7bd54fda79daf1c228564ee8f88368519055f71bfe5695db2d17b4f5b5622","schema_version":"1.0","event_id":"sha256:53e7bd54fda79daf1c228564ee8f88368519055f71bfe5695db2d17b4f5b5622"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QTLFLJMBIMRMQYVVV5D5TNXPAR/bundle.json","state_url":"https://pith.science/pith/QTLFLJMBIMRMQYVVV5D5TNXPAR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QTLFLJMBIMRMQYVVV5D5TNXPAR/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-07-04T11:01:40Z","links":{"resolver":"https://pith.science/pith/QTLFLJMBIMRMQYVVV5D5TNXPAR","bundle":"https://pith.science/pith/QTLFLJMBIMRMQYVVV5D5TNXPAR/bundle.json","state":"https://pith.science/pith/QTLFLJMBIMRMQYVVV5D5TNXPAR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QTLFLJMBIMRMQYVVV5D5TNXPAR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QTLFLJMBIMRMQYVVV5D5TNXPAR","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":"2383b4bdd8687897c77e82687c6132ffb571f0b31aba044a88b210488fbdc2ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-04-21T09:53:58Z","title_canon_sha256":"77bcbd186b52ee7deba0538056127a2a8b98a59c3f0c71969d88e0b83b7e1766"},"schema_version":"1.0","source":{"id":"1404.5153","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5153","created_at":"2026-05-18T01:05:46Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5153v3","created_at":"2026-05-18T01:05:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5153","created_at":"2026-05-18T01:05:46Z"},{"alias_kind":"pith_short_12","alias_value":"QTLFLJMBIMRM","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QTLFLJMBIMRMQYVV","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QTLFLJMB","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:53e7bd54fda79daf1c228564ee8f88368519055f71bfe5695db2d17b4f5b5622","target":"graph","created_at":"2026-05-18T01:05:46Z","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":"Random access coding is an information task that has been extensively studied and found many applications in quantum information. In this scenario, Alice receives an $n$-bit string $x$, and wishes to encode $x$ into a quantum state $\\rho_x$, such that Bob, when receiving the state $\\rho_x$, can choose any bit $i \\in [n]$ and recover the input bit $x_i$ with high probability. Here we study two variants: parity-oblivious random access codes, where we impose the cryptographic property that Bob cannot infer any information about the parity of any subset of bits of the input apart from the single b","authors_text":"Andr\\'e Chailloux, Iordanis Kerenidis, Jamie Sikora, Srijita Kundu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-04-21T09:53:58Z","title":"Optimal bounds for parity-oblivious random access codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5153","kind":"arxiv","version":3},"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:69616fe3c6a541c7c2f5f1a283a60ffd1707203eb854db56eb72d3fad4a5fc2a","target":"record","created_at":"2026-05-18T01:05:46Z","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":"2383b4bdd8687897c77e82687c6132ffb571f0b31aba044a88b210488fbdc2ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-04-21T09:53:58Z","title_canon_sha256":"77bcbd186b52ee7deba0538056127a2a8b98a59c3f0c71969d88e0b83b7e1766"},"schema_version":"1.0","source":{"id":"1404.5153","kind":"arxiv","version":3}},"canonical_sha256":"84d655a5814322c862b5af47d9b6ef047d29d853e7305eb1158b2085f7dd2266","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"84d655a5814322c862b5af47d9b6ef047d29d853e7305eb1158b2085f7dd2266","first_computed_at":"2026-05-18T01:05:46.607653Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:05:46.607653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KYs2Rkyftb3IqJm9hwB/DZlLwV9E1e6xpDeR89BD0ANiMj20QvKh/hZEUfhmCAAGCIWZXSyR0rcKHYa7cFLvCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:05:46.608249Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.5153","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:69616fe3c6a541c7c2f5f1a283a60ffd1707203eb854db56eb72d3fad4a5fc2a","sha256:53e7bd54fda79daf1c228564ee8f88368519055f71bfe5695db2d17b4f5b5622"],"state_sha256":"600dede2a777a76acb16a8d8782198f023c6b7056ca292619be02156a3c23325"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WRaOgWUhVve9hy+pdbX+FwB+YHoV0sRe2YlpKerzRszVYZjUImBHqUxw5Uh2mdU5AQGhx7/6i2ZlW4HnjC13Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T11:01:40.765655Z","bundle_sha256":"66c4543b1e85713000a17b526ce770d27f38065027e9b067be8e875ac375dd54"}}