{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:3S34V2QM7MPCWWJP35FEDQ7AO2","short_pith_number":"pith:3S34V2QM","canonical_record":{"source":{"id":"2501.11636","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.IT","submitted_at":"2025-01-20T18:11:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c3759eeec8841c18f3771ec89f2590d1d50bdd6ca9fb2f2bec3177f3dc8f8ce8","abstract_canon_sha256":"e48cde02d88fa9a79929b2473da8b9553f1b1688546267e500d113ec275b66e8"},"schema_version":"1.0"},"canonical_sha256":"dcb7caea0cfb1e2b592fdf4a41c3e076abe0b7d2fde3cd0aecdc8aff11b125b4","source":{"kind":"arxiv","id":"2501.11636","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.11636","created_at":"2026-07-05T10:03:11Z"},{"alias_kind":"arxiv_version","alias_value":"2501.11636v1","created_at":"2026-07-05T10:03:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.11636","created_at":"2026-07-05T10:03:11Z"},{"alias_kind":"pith_short_12","alias_value":"3S34V2QM7MPC","created_at":"2026-07-05T10:03:11Z"},{"alias_kind":"pith_short_16","alias_value":"3S34V2QM7MPCWWJP","created_at":"2026-07-05T10:03:11Z"},{"alias_kind":"pith_short_8","alias_value":"3S34V2QM","created_at":"2026-07-05T10:03:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:3S34V2QM7MPCWWJP35FEDQ7AO2","target":"record","payload":{"canonical_record":{"source":{"id":"2501.11636","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.IT","submitted_at":"2025-01-20T18:11:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c3759eeec8841c18f3771ec89f2590d1d50bdd6ca9fb2f2bec3177f3dc8f8ce8","abstract_canon_sha256":"e48cde02d88fa9a79929b2473da8b9553f1b1688546267e500d113ec275b66e8"},"schema_version":"1.0"},"canonical_sha256":"dcb7caea0cfb1e2b592fdf4a41c3e076abe0b7d2fde3cd0aecdc8aff11b125b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:03:11.871042Z","signature_b64":"ZchgURbEe+gX6bgAoA62VaI8oW1CPFJKFPIUwGljiBN06eixRozY4ejgH0VmOluZ5d0rlCVsAPLvwYbnLUTwBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dcb7caea0cfb1e2b592fdf4a41c3e076abe0b7d2fde3cd0aecdc8aff11b125b4","last_reissued_at":"2026-07-05T10:03:11.870460Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:03:11.870460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.11636","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-07-05T10:03:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lwQgHq6zWXCFS9amsRIpZJzHU5jB7Pr2qIIyjyXwbvHsCu+ZMugWgIry6XqarGouumw6XuV5gX/ShybTG3I3BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T08:07:15.197301Z"},"content_sha256":"2992b84fa7822b48cd0ef499daf4efcb91df4341c327d0f586d9071c2c795c51","schema_version":"1.0","event_id":"sha256:2992b84fa7822b48cd0ef499daf4efcb91df4341c327d0f586d9071c2c795c51"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:3S34V2QM7MPCWWJP35FEDQ7AO2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Characterization of the Arithmetic Complexity of the Secrecy Capacity of Fast-Fading Gaussian Channels","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andrea Grigorescu, Holger Boche, H. Vincent Poor, Rafael F. Schaefer","submitted_at":"2025-01-20T18:11:59Z","abstract_excerpt":"This paper studies the computability of the secrecy capacity of fast-fading wiretap channels from an algorithmic perspective, examining whether it can be computed algorithmically or not. To address this question, the concept of Turing machines is used, which establishes fundamental performance limits of digital computers. It is shown that certain computable continuous fading probability distribution functions yield secrecy capacities that are non-computable numbers. Additionally, we assess the secrecy capacity's classification within the arithmetical hierarchy, revealing the absence of computa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.11636","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.11636/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T10:03:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aaxvlG57Nf1iYE7wYwruFQ+BksjkQgbfZHE+smJh97vohf1oYMzbKvBVfOncxqUylPXPC6RRB6UOdbCu45X3BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T08:07:15.197959Z"},"content_sha256":"bcd268e94dae2b8408314db8bd03bf48f542231e8d38844814689dd23d01b601","schema_version":"1.0","event_id":"sha256:bcd268e94dae2b8408314db8bd03bf48f542231e8d38844814689dd23d01b601"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3S34V2QM7MPCWWJP35FEDQ7AO2/bundle.json","state_url":"https://pith.science/pith/3S34V2QM7MPCWWJP35FEDQ7AO2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3S34V2QM7MPCWWJP35FEDQ7AO2/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-08-07T08:07:15Z","links":{"resolver":"https://pith.science/pith/3S34V2QM7MPCWWJP35FEDQ7AO2","bundle":"https://pith.science/pith/3S34V2QM7MPCWWJP35FEDQ7AO2/bundle.json","state":"https://pith.science/pith/3S34V2QM7MPCWWJP35FEDQ7AO2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3S34V2QM7MPCWWJP35FEDQ7AO2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:3S34V2QM7MPCWWJP35FEDQ7AO2","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":"e48cde02d88fa9a79929b2473da8b9553f1b1688546267e500d113ec275b66e8","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.IT","submitted_at":"2025-01-20T18:11:59Z","title_canon_sha256":"c3759eeec8841c18f3771ec89f2590d1d50bdd6ca9fb2f2bec3177f3dc8f8ce8"},"schema_version":"1.0","source":{"id":"2501.11636","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.11636","created_at":"2026-07-05T10:03:11Z"},{"alias_kind":"arxiv_version","alias_value":"2501.11636v1","created_at":"2026-07-05T10:03:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.11636","created_at":"2026-07-05T10:03:11Z"},{"alias_kind":"pith_short_12","alias_value":"3S34V2QM7MPC","created_at":"2026-07-05T10:03:11Z"},{"alias_kind":"pith_short_16","alias_value":"3S34V2QM7MPCWWJP","created_at":"2026-07-05T10:03:11Z"},{"alias_kind":"pith_short_8","alias_value":"3S34V2QM","created_at":"2026-07-05T10:03:11Z"}],"graph_snapshots":[{"event_id":"sha256:bcd268e94dae2b8408314db8bd03bf48f542231e8d38844814689dd23d01b601","target":"graph","created_at":"2026-07-05T10:03:11Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2501.11636/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper studies the computability of the secrecy capacity of fast-fading wiretap channels from an algorithmic perspective, examining whether it can be computed algorithmically or not. To address this question, the concept of Turing machines is used, which establishes fundamental performance limits of digital computers. It is shown that certain computable continuous fading probability distribution functions yield secrecy capacities that are non-computable numbers. Additionally, we assess the secrecy capacity's classification within the arithmetical hierarchy, revealing the absence of computa","authors_text":"Andrea Grigorescu, Holger Boche, H. Vincent Poor, Rafael F. Schaefer","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.IT","submitted_at":"2025-01-20T18:11:59Z","title":"Characterization of the Arithmetic Complexity of the Secrecy Capacity of Fast-Fading Gaussian Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.11636","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:2992b84fa7822b48cd0ef499daf4efcb91df4341c327d0f586d9071c2c795c51","target":"record","created_at":"2026-07-05T10:03:11Z","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":"e48cde02d88fa9a79929b2473da8b9553f1b1688546267e500d113ec275b66e8","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.IT","submitted_at":"2025-01-20T18:11:59Z","title_canon_sha256":"c3759eeec8841c18f3771ec89f2590d1d50bdd6ca9fb2f2bec3177f3dc8f8ce8"},"schema_version":"1.0","source":{"id":"2501.11636","kind":"arxiv","version":1}},"canonical_sha256":"dcb7caea0cfb1e2b592fdf4a41c3e076abe0b7d2fde3cd0aecdc8aff11b125b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dcb7caea0cfb1e2b592fdf4a41c3e076abe0b7d2fde3cd0aecdc8aff11b125b4","first_computed_at":"2026-07-05T10:03:11.870460Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:03:11.870460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZchgURbEe+gX6bgAoA62VaI8oW1CPFJKFPIUwGljiBN06eixRozY4ejgH0VmOluZ5d0rlCVsAPLvwYbnLUTwBA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:03:11.871042Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.11636","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2992b84fa7822b48cd0ef499daf4efcb91df4341c327d0f586d9071c2c795c51","sha256:bcd268e94dae2b8408314db8bd03bf48f542231e8d38844814689dd23d01b601"],"state_sha256":"81720fc93132e7baea87bbd3cd832305ca5a92f8f2e584b6d6b2642df0dc3366"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DuuLDWLqRiZjifY9yCE7syHoLCRLEjbYZkG3bhv497UUqG2qFVrsIACdBbwc2yZLMml5zeau5kKYme8g9i7OCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T08:07:15.202249Z","bundle_sha256":"e0a1d7783ac964ab2277dc82bc26a9aa7b37dfde17fd440d125f486a81388a67"}}