{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:2HFJPICXF7V3652CAMH6JCKF4B","short_pith_number":"pith:2HFJPICX","canonical_record":{"source":{"id":"2212.02732","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-12-06T03:40:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f0a3255dd79132adb75fdcaefeb6aac1184981a23b7b3f2ebfda7844a567f69d","abstract_canon_sha256":"3e1b2921412655f902d0ab75823d198b6dc0bc116996a17cc7bb29495c39376d"},"schema_version":"1.0"},"canonical_sha256":"d1ca97a0572febbf7742030fe48945e065fc86d20c8cfafa8d9c080263e4947a","source":{"kind":"arxiv","id":"2212.02732","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.02732","created_at":"2026-07-05T05:23:34Z"},{"alias_kind":"arxiv_version","alias_value":"2212.02732v2","created_at":"2026-07-05T05:23:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.02732","created_at":"2026-07-05T05:23:34Z"},{"alias_kind":"pith_short_12","alias_value":"2HFJPICXF7V3","created_at":"2026-07-05T05:23:34Z"},{"alias_kind":"pith_short_16","alias_value":"2HFJPICXF7V3652C","created_at":"2026-07-05T05:23:34Z"},{"alias_kind":"pith_short_8","alias_value":"2HFJPICX","created_at":"2026-07-05T05:23:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:2HFJPICXF7V3652CAMH6JCKF4B","target":"record","payload":{"canonical_record":{"source":{"id":"2212.02732","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-12-06T03:40:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f0a3255dd79132adb75fdcaefeb6aac1184981a23b7b3f2ebfda7844a567f69d","abstract_canon_sha256":"3e1b2921412655f902d0ab75823d198b6dc0bc116996a17cc7bb29495c39376d"},"schema_version":"1.0"},"canonical_sha256":"d1ca97a0572febbf7742030fe48945e065fc86d20c8cfafa8d9c080263e4947a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:23:34.859582Z","signature_b64":"Xp+AUDpNmENeKez6xFp3IBPE1xuwBDZ1Urn9c2018FG/Wc5ebeWA7neUcajRizCUxnbloO1HB/m92MchZaxbBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1ca97a0572febbf7742030fe48945e065fc86d20c8cfafa8d9c080263e4947a","last_reissued_at":"2026-07-05T05:23:34.859139Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:23:34.859139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2212.02732","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-07-05T05:23:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w9xZjePVKnxtrjsanSUCspCR48nWUIKDGrZoq0jO+4dL3lhg+tJEI1Q0iMuWBevV218WO2wTLi5jdW/p/EhvBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T05:47:42.682127Z"},"content_sha256":"23afaf9999f2019ee4c0ec89520609db8672779d09915a50a0468ee6b64a6c23","schema_version":"1.0","event_id":"sha256:23afaf9999f2019ee4c0ec89520609db8672779d09915a50a0468ee6b64a6c23"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:2HFJPICXF7V3652CAMH6JCKF4B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deterministic $K$-identification For Slow Fading Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christian Deppe, Mohammad Javad Salariseddigh, Muris Spahovic","submitted_at":"2022-12-06T03:40:17Z","abstract_excerpt":"Deterministic $K$-identification (DKI) is addressed for Gaussian channels with slow fading (GSF), where the transmitter is restricted to an average power constraint and channel side information is available at the decoder. We derive lower and upper bounds on the DKI capacity when the number of identifiable messages $K$ may grow sub-linearly with the codeword length $n$. As a key finding, we establish that for deterministic encoding, assuming that the number of identifiable messages $K = 2^{\\kappa \\log n}$ with $\\kappa \\in [0,1)$ being the identification target rate, the codebook size scales as"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.02732","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2212.02732/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-05T05:23:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DH/7NwxTCtazt7gMirx9l8HbJgArWnd25RWIN9u7KwiKHEj2Q3yINQtWIbsVvajC+gkcVriHmFAH37D4UhijDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T05:47:42.683075Z"},"content_sha256":"ea008396991be4be4daa40581fb6e9d5c39eb4492a4ce5f58c60c01624ee4da1","schema_version":"1.0","event_id":"sha256:ea008396991be4be4daa40581fb6e9d5c39eb4492a4ce5f58c60c01624ee4da1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2HFJPICXF7V3652CAMH6JCKF4B/bundle.json","state_url":"https://pith.science/pith/2HFJPICXF7V3652CAMH6JCKF4B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2HFJPICXF7V3652CAMH6JCKF4B/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-07T05:47:42Z","links":{"resolver":"https://pith.science/pith/2HFJPICXF7V3652CAMH6JCKF4B","bundle":"https://pith.science/pith/2HFJPICXF7V3652CAMH6JCKF4B/bundle.json","state":"https://pith.science/pith/2HFJPICXF7V3652CAMH6JCKF4B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2HFJPICXF7V3652CAMH6JCKF4B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:2HFJPICXF7V3652CAMH6JCKF4B","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":"3e1b2921412655f902d0ab75823d198b6dc0bc116996a17cc7bb29495c39376d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-12-06T03:40:17Z","title_canon_sha256":"f0a3255dd79132adb75fdcaefeb6aac1184981a23b7b3f2ebfda7844a567f69d"},"schema_version":"1.0","source":{"id":"2212.02732","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.02732","created_at":"2026-07-05T05:23:34Z"},{"alias_kind":"arxiv_version","alias_value":"2212.02732v2","created_at":"2026-07-05T05:23:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.02732","created_at":"2026-07-05T05:23:34Z"},{"alias_kind":"pith_short_12","alias_value":"2HFJPICXF7V3","created_at":"2026-07-05T05:23:34Z"},{"alias_kind":"pith_short_16","alias_value":"2HFJPICXF7V3652C","created_at":"2026-07-05T05:23:34Z"},{"alias_kind":"pith_short_8","alias_value":"2HFJPICX","created_at":"2026-07-05T05:23:34Z"}],"graph_snapshots":[{"event_id":"sha256:ea008396991be4be4daa40581fb6e9d5c39eb4492a4ce5f58c60c01624ee4da1","target":"graph","created_at":"2026-07-05T05:23:34Z","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/2212.02732/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Deterministic $K$-identification (DKI) is addressed for Gaussian channels with slow fading (GSF), where the transmitter is restricted to an average power constraint and channel side information is available at the decoder. We derive lower and upper bounds on the DKI capacity when the number of identifiable messages $K$ may grow sub-linearly with the codeword length $n$. As a key finding, we establish that for deterministic encoding, assuming that the number of identifiable messages $K = 2^{\\kappa \\log n}$ with $\\kappa \\in [0,1)$ being the identification target rate, the codebook size scales as","authors_text":"Christian Deppe, Mohammad Javad Salariseddigh, Muris Spahovic","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-12-06T03:40:17Z","title":"Deterministic $K$-identification For Slow Fading Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.02732","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:23afaf9999f2019ee4c0ec89520609db8672779d09915a50a0468ee6b64a6c23","target":"record","created_at":"2026-07-05T05:23:34Z","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":"3e1b2921412655f902d0ab75823d198b6dc0bc116996a17cc7bb29495c39376d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-12-06T03:40:17Z","title_canon_sha256":"f0a3255dd79132adb75fdcaefeb6aac1184981a23b7b3f2ebfda7844a567f69d"},"schema_version":"1.0","source":{"id":"2212.02732","kind":"arxiv","version":2}},"canonical_sha256":"d1ca97a0572febbf7742030fe48945e065fc86d20c8cfafa8d9c080263e4947a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d1ca97a0572febbf7742030fe48945e065fc86d20c8cfafa8d9c080263e4947a","first_computed_at":"2026-07-05T05:23:34.859139Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:23:34.859139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Xp+AUDpNmENeKez6xFp3IBPE1xuwBDZ1Urn9c2018FG/Wc5ebeWA7neUcajRizCUxnbloO1HB/m92MchZaxbBw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:23:34.859582Z","signed_message":"canonical_sha256_bytes"},"source_id":"2212.02732","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:23afaf9999f2019ee4c0ec89520609db8672779d09915a50a0468ee6b64a6c23","sha256:ea008396991be4be4daa40581fb6e9d5c39eb4492a4ce5f58c60c01624ee4da1"],"state_sha256":"6177c370fa964a6c72b923414a3d219d28b9b756af6858318e263cb4acd18541"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lJSFlfevQQ5PnCtAToHBbEDNgDd/9EtxiFow9QpgMX1SeXXqxY9uv3t+kBrR/WT+n80XKfrYCXHcvNkIlNxkBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T05:47:42.690217Z","bundle_sha256":"9f444e9d55b91673c7583aac58f6d7b9f8d760031b21a7158b9b88dc47e2fb85"}}