{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MCCXPPFLZF7HB656OJ5RJQHWU4","short_pith_number":"pith:MCCXPPFL","canonical_record":{"source":{"id":"1801.02745","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-09T01:43:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"13a8223c69f396f865950aa83552d840962e60d2dfae6105dbff6e27c911c186","abstract_canon_sha256":"7f30f68411d87432d24490795a436bba52cd433cdaaad8aa9d9a057c2dca7936"},"schema_version":"1.0"},"canonical_sha256":"608577bcabc97e70fbbe727b14c0f6a7090d31407bd33977518d53d37a95fef1","source":{"kind":"arxiv","id":"1801.02745","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.02745","created_at":"2026-05-18T00:10:17Z"},{"alias_kind":"arxiv_version","alias_value":"1801.02745v6","created_at":"2026-05-18T00:10:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02745","created_at":"2026-05-18T00:10:17Z"},{"alias_kind":"pith_short_12","alias_value":"MCCXPPFLZF7H","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MCCXPPFLZF7HB656","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MCCXPPFL","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MCCXPPFLZF7HB656OJ5RJQHWU4","target":"record","payload":{"canonical_record":{"source":{"id":"1801.02745","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-09T01:43:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"13a8223c69f396f865950aa83552d840962e60d2dfae6105dbff6e27c911c186","abstract_canon_sha256":"7f30f68411d87432d24490795a436bba52cd433cdaaad8aa9d9a057c2dca7936"},"schema_version":"1.0"},"canonical_sha256":"608577bcabc97e70fbbe727b14c0f6a7090d31407bd33977518d53d37a95fef1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:17.128890Z","signature_b64":"HGdsxPYden4gAJjDr0H4w63MA/Xdao+A7T0fgbzYxLcq3UGANYfsJzflCDteUBgFozpQYGn5ggacp7eGplOXDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"608577bcabc97e70fbbe727b14c0f6a7090d31407bd33977518d53d37a95fef1","last_reissued_at":"2026-05-18T00:10:17.128342Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:17.128342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.02745","source_version":6,"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:10:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hY1JkkS+rtrJfHW3vr3/yVXkHPD5f+APPTSKRAE0NVck+vj7xQMwAQ2XPJxrCm4Yom65ddPR47QNxFRUj6cdAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:14:58.653388Z"},"content_sha256":"57428067be5640695f34db6000150ec5635b09b7087df472a8adca09880584cb","schema_version":"1.0","event_id":"sha256:57428067be5640695f34db6000150ec5635b09b7087df472a8adca09880584cb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MCCXPPFLZF7HB656OJ5RJQHWU4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Structural Results and Improved Upper Bounds on the Capacity of the Discrete-Time Poisson Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jo\\~ao Ribeiro, Mahdi Cheraghchi","submitted_at":"2018-01-09T01:43:19Z","abstract_excerpt":"New capacity upper bounds are presented for the discrete-time Poisson channel with no dark current and an average-power constraint. These bounds are a simple consequence of techniques developed for the seemingly unrelated problem of upper bounding the capacity of binary deletion and repetition channels. Previously, the best known capacity upper bound in the regime where the average-power constraint does not approach zero was due to Martinez (JOSA B, 2007), which is re-derived as a special case of the framework developed in this paper. Furthermore, this framework is carefully instantiated in or"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02745","kind":"arxiv","version":6},"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:10:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OSXm+YFONVtGAbNY64vcrH1pKOmEUQd056uXsmpf45T674blBrzGhwRSprnjPl9GxyD8Se4TJCkQ03Gfj2tiAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:14:58.653733Z"},"content_sha256":"becda81cae7b30c1187f0a4eef5a3a3d897c31f3fdf411b8e9bdebad64a63c84","schema_version":"1.0","event_id":"sha256:becda81cae7b30c1187f0a4eef5a3a3d897c31f3fdf411b8e9bdebad64a63c84"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MCCXPPFLZF7HB656OJ5RJQHWU4/bundle.json","state_url":"https://pith.science/pith/MCCXPPFLZF7HB656OJ5RJQHWU4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MCCXPPFLZF7HB656OJ5RJQHWU4/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-01T17:14:58Z","links":{"resolver":"https://pith.science/pith/MCCXPPFLZF7HB656OJ5RJQHWU4","bundle":"https://pith.science/pith/MCCXPPFLZF7HB656OJ5RJQHWU4/bundle.json","state":"https://pith.science/pith/MCCXPPFLZF7HB656OJ5RJQHWU4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MCCXPPFLZF7HB656OJ5RJQHWU4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MCCXPPFLZF7HB656OJ5RJQHWU4","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":"7f30f68411d87432d24490795a436bba52cd433cdaaad8aa9d9a057c2dca7936","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-09T01:43:19Z","title_canon_sha256":"13a8223c69f396f865950aa83552d840962e60d2dfae6105dbff6e27c911c186"},"schema_version":"1.0","source":{"id":"1801.02745","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.02745","created_at":"2026-05-18T00:10:17Z"},{"alias_kind":"arxiv_version","alias_value":"1801.02745v6","created_at":"2026-05-18T00:10:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02745","created_at":"2026-05-18T00:10:17Z"},{"alias_kind":"pith_short_12","alias_value":"MCCXPPFLZF7H","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MCCXPPFLZF7HB656","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MCCXPPFL","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:becda81cae7b30c1187f0a4eef5a3a3d897c31f3fdf411b8e9bdebad64a63c84","target":"graph","created_at":"2026-05-18T00:10:17Z","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":"New capacity upper bounds are presented for the discrete-time Poisson channel with no dark current and an average-power constraint. These bounds are a simple consequence of techniques developed for the seemingly unrelated problem of upper bounding the capacity of binary deletion and repetition channels. Previously, the best known capacity upper bound in the regime where the average-power constraint does not approach zero was due to Martinez (JOSA B, 2007), which is re-derived as a special case of the framework developed in this paper. Furthermore, this framework is carefully instantiated in or","authors_text":"Jo\\~ao Ribeiro, Mahdi Cheraghchi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-09T01:43:19Z","title":"Structural Results and Improved Upper Bounds on the Capacity of the Discrete-Time Poisson Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02745","kind":"arxiv","version":6},"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:57428067be5640695f34db6000150ec5635b09b7087df472a8adca09880584cb","target":"record","created_at":"2026-05-18T00:10:17Z","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":"7f30f68411d87432d24490795a436bba52cd433cdaaad8aa9d9a057c2dca7936","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-09T01:43:19Z","title_canon_sha256":"13a8223c69f396f865950aa83552d840962e60d2dfae6105dbff6e27c911c186"},"schema_version":"1.0","source":{"id":"1801.02745","kind":"arxiv","version":6}},"canonical_sha256":"608577bcabc97e70fbbe727b14c0f6a7090d31407bd33977518d53d37a95fef1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"608577bcabc97e70fbbe727b14c0f6a7090d31407bd33977518d53d37a95fef1","first_computed_at":"2026-05-18T00:10:17.128342Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:17.128342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HGdsxPYden4gAJjDr0H4w63MA/Xdao+A7T0fgbzYxLcq3UGANYfsJzflCDteUBgFozpQYGn5ggacp7eGplOXDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:17.128890Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.02745","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:57428067be5640695f34db6000150ec5635b09b7087df472a8adca09880584cb","sha256:becda81cae7b30c1187f0a4eef5a3a3d897c31f3fdf411b8e9bdebad64a63c84"],"state_sha256":"5b4f9db3dec61ab138749bc09be0a549b05379a0d9776a8896cdb3349a82611c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GQV1iuw25K8rnPvJ/5Z45QJSOLx6/D8G4vKCai4jVvQ0gy6NtVHpdmOjTaliZ4AxA8eUv85k3oGKH+Vx2g6GAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T17:14:58.655719Z","bundle_sha256":"08822ec4fb23bbc80b7965e5c6e90426c1f691b201f07664b5df2b2fc536f035"}}