{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:VBINBURHUBXGIN6U4A6NEYMSEC","short_pith_number":"pith:VBINBURH","schema_version":"1.0","canonical_sha256":"a850d0d227a06e6437d4e03cd2619220b28f9adf25daf5c969ac53e7c32bc36f","source":{"kind":"arxiv","id":"2502.02389","version":4},"attestation_state":"computed","paper":{"title":"Rate-reliability tradeoff for deterministic identification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Andreas Winter, Christian Deppe, Holger Boche, Pau Colomer","submitted_at":"2025-02-04T15:09:14Z","abstract_excerpt":"We investigate deterministic identification over arbitrary memoryless channels under the constraint that the error probabilities of first and second kind are exponentially small in the block length $\\mathbf{n}$, controlled by reliability exponents $\\mathbf{E_1,E_2 \\geq 0}$. In contrast to the regime of slowly vanishing errors, where the identifiable message length scales linearithmically as $\\mathbf{\\Theta(n\\log n)}$, here we find that for positive exponents linear scaling is restored, now with a rate that is a function of the reliability exponents. We give upper and lower bounds on the ensuin"},"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":"2502.02389","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-02-04T15:09:14Z","cross_cats_sorted":["math.IT","quant-ph"],"title_canon_sha256":"44bbbded6b6f54b1213f3ee8cf3dda0aa2e187b8cd8852b33bfe1aac7adb1317","abstract_canon_sha256":"5ef492ed30aea40cee77fbbd8e17ed8c9f7e88cae9042f2d668e436ea21eb5ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:43:30.598168Z","signature_b64":"1A8s+RbccLpovUQIQ3oXKMwpL629pvSBSECDE6GGFLRGE0eeOrBN1cqAC2egtkYjNsVF6uONEoyRYhehwiRsAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a850d0d227a06e6437d4e03cd2619220b28f9adf25daf5c969ac53e7c32bc36f","last_reissued_at":"2026-07-05T11:43:30.597686Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:43:30.597686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rate-reliability tradeoff for deterministic identification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Andreas Winter, Christian Deppe, Holger Boche, Pau Colomer","submitted_at":"2025-02-04T15:09:14Z","abstract_excerpt":"We investigate deterministic identification over arbitrary memoryless channels under the constraint that the error probabilities of first and second kind are exponentially small in the block length $\\mathbf{n}$, controlled by reliability exponents $\\mathbf{E_1,E_2 \\geq 0}$. In contrast to the regime of slowly vanishing errors, where the identifiable message length scales linearithmically as $\\mathbf{\\Theta(n\\log n)}$, here we find that for positive exponents linear scaling is restored, now with a rate that is a function of the reliability exponents. We give upper and lower bounds on the ensuin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.02389","kind":"arxiv","version":4},"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/2502.02389/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":"2502.02389","created_at":"2026-07-05T11:43:30.597745+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.02389v4","created_at":"2026-07-05T11:43:30.597745+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.02389","created_at":"2026-07-05T11:43:30.597745+00:00"},{"alias_kind":"pith_short_12","alias_value":"VBINBURHUBXG","created_at":"2026-07-05T11:43:30.597745+00:00"},{"alias_kind":"pith_short_16","alias_value":"VBINBURHUBXGIN6U","created_at":"2026-07-05T11:43:30.597745+00:00"},{"alias_kind":"pith_short_8","alias_value":"VBINBURH","created_at":"2026-07-05T11:43:30.597745+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.05168","citing_title":"Deterministic identification for Bernoulli channels and related channels with continuous input","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2604.11782","citing_title":"Optimal Codes for Deterministic Identification over Gaussian Channels: Closing the Capacity Gap","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VBINBURHUBXGIN6U4A6NEYMSEC","json":"https://pith.science/pith/VBINBURHUBXGIN6U4A6NEYMSEC.json","graph_json":"https://pith.science/api/pith-number/VBINBURHUBXGIN6U4A6NEYMSEC/graph.json","events_json":"https://pith.science/api/pith-number/VBINBURHUBXGIN6U4A6NEYMSEC/events.json","paper":"https://pith.science/paper/VBINBURH"},"agent_actions":{"view_html":"https://pith.science/pith/VBINBURHUBXGIN6U4A6NEYMSEC","download_json":"https://pith.science/pith/VBINBURHUBXGIN6U4A6NEYMSEC.json","view_paper":"https://pith.science/paper/VBINBURH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.02389&json=true","fetch_graph":"https://pith.science/api/pith-number/VBINBURHUBXGIN6U4A6NEYMSEC/graph.json","fetch_events":"https://pith.science/api/pith-number/VBINBURHUBXGIN6U4A6NEYMSEC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VBINBURHUBXGIN6U4A6NEYMSEC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VBINBURHUBXGIN6U4A6NEYMSEC/action/storage_attestation","attest_author":"https://pith.science/pith/VBINBURHUBXGIN6U4A6NEYMSEC/action/author_attestation","sign_citation":"https://pith.science/pith/VBINBURHUBXGIN6U4A6NEYMSEC/action/citation_signature","submit_replication":"https://pith.science/pith/VBINBURHUBXGIN6U4A6NEYMSEC/action/replication_record"}},"created_at":"2026-07-05T11:43:30.597745+00:00","updated_at":"2026-07-05T11:43:30.597745+00:00"}