{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:LNO4HBMALLSTX64BWGNC5SDZDF","short_pith_number":"pith:LNO4HBMA","schema_version":"1.0","canonical_sha256":"5b5dc385805ae53bfb81b19a2ec879196fbecbba8905fab633868f9b13589551","source":{"kind":"arxiv","id":"2305.04260","version":1},"attestation_state":"computed","paper":{"title":"Deterministic K-Identification For Binary Symmetric Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christian Deppe, Holger Boche, Mohammad Javad Salariseddigh, Ons Dabbabi","submitted_at":"2023-05-07T12:37:36Z","abstract_excerpt":"Deterministic K-Identification (DKI) for the binary symmetric channel (BSC) is developed. A full characterization of the DKI capacity for such a channel, with and without the Hamming weight constraint, is established. As a key finding, we find that for deterministic encoding the number of identifiable messages $K$ may grow exponentially with the codeword length $n$, i.e., $K = 2^{\\kappa n}$, where $\\kappa$ is the target identification rate. Furthermore, the eligible region for $\\kappa$ as a function of the channel statistics, i.e., the crossover probability, is determined."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2305.04260","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-05-07T12:37:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"788cef0b83f42caf56f268635576ea84716e144819995011aa9a942eb46138e7","abstract_canon_sha256":"92366359ae4126ead41a2040a5860a7397a23e059e81bfdee45c9745cd3116f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:07:46.527278Z","signature_b64":"ymtT18jhVSO9sTINMUYFcN0MkAfH8Ly5ddNYQ+F7lQSwdqvxqeHfI0OVEOeAIfn5cU/9XqVNszUoY+zNSqlEBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b5dc385805ae53bfb81b19a2ec879196fbecbba8905fab633868f9b13589551","last_reissued_at":"2026-07-05T06:07:46.526869Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:07:46.526869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deterministic K-Identification For Binary Symmetric Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christian Deppe, Holger Boche, Mohammad Javad Salariseddigh, Ons Dabbabi","submitted_at":"2023-05-07T12:37:36Z","abstract_excerpt":"Deterministic K-Identification (DKI) for the binary symmetric channel (BSC) is developed. A full characterization of the DKI capacity for such a channel, with and without the Hamming weight constraint, is established. As a key finding, we find that for deterministic encoding the number of identifiable messages $K$ may grow exponentially with the codeword length $n$, i.e., $K = 2^{\\kappa n}$, where $\\kappa$ is the target identification rate. Furthermore, the eligible region for $\\kappa$ as a function of the channel statistics, i.e., the crossover probability, is determined."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.04260","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/2305.04260/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2305.04260","created_at":"2026-07-05T06:07:46.526933+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.04260v1","created_at":"2026-07-05T06:07:46.526933+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.04260","created_at":"2026-07-05T06:07:46.526933+00:00"},{"alias_kind":"pith_short_12","alias_value":"LNO4HBMALLST","created_at":"2026-07-05T06:07:46.526933+00:00"},{"alias_kind":"pith_short_16","alias_value":"LNO4HBMALLSTX64B","created_at":"2026-07-05T06:07:46.526933+00:00"},{"alias_kind":"pith_short_8","alias_value":"LNO4HBMA","created_at":"2026-07-05T06:07:46.526933+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LNO4HBMALLSTX64BWGNC5SDZDF","json":"https://pith.science/pith/LNO4HBMALLSTX64BWGNC5SDZDF.json","graph_json":"https://pith.science/api/pith-number/LNO4HBMALLSTX64BWGNC5SDZDF/graph.json","events_json":"https://pith.science/api/pith-number/LNO4HBMALLSTX64BWGNC5SDZDF/events.json","paper":"https://pith.science/paper/LNO4HBMA"},"agent_actions":{"view_html":"https://pith.science/pith/LNO4HBMALLSTX64BWGNC5SDZDF","download_json":"https://pith.science/pith/LNO4HBMALLSTX64BWGNC5SDZDF.json","view_paper":"https://pith.science/paper/LNO4HBMA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.04260&json=true","fetch_graph":"https://pith.science/api/pith-number/LNO4HBMALLSTX64BWGNC5SDZDF/graph.json","fetch_events":"https://pith.science/api/pith-number/LNO4HBMALLSTX64BWGNC5SDZDF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LNO4HBMALLSTX64BWGNC5SDZDF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LNO4HBMALLSTX64BWGNC5SDZDF/action/storage_attestation","attest_author":"https://pith.science/pith/LNO4HBMALLSTX64BWGNC5SDZDF/action/author_attestation","sign_citation":"https://pith.science/pith/LNO4HBMALLSTX64BWGNC5SDZDF/action/citation_signature","submit_replication":"https://pith.science/pith/LNO4HBMALLSTX64BWGNC5SDZDF/action/replication_record"}},"created_at":"2026-07-05T06:07:46.526933+00:00","updated_at":"2026-07-05T06:07:46.526933+00:00"}