{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:VBINBURHUBXGIN6U4A6NEYMSEC","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":"5ef492ed30aea40cee77fbbd8e17ed8c9f7e88cae9042f2d668e436ea21eb5ad","cross_cats_sorted":["math.IT","quant-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-02-04T15:09:14Z","title_canon_sha256":"44bbbded6b6f54b1213f3ee8cf3dda0aa2e187b8cd8852b33bfe1aac7adb1317"},"schema_version":"1.0","source":{"id":"2502.02389","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.02389","created_at":"2026-07-05T11:43:30Z"},{"alias_kind":"arxiv_version","alias_value":"2502.02389v4","created_at":"2026-07-05T11:43:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.02389","created_at":"2026-07-05T11:43:30Z"},{"alias_kind":"pith_short_12","alias_value":"VBINBURHUBXG","created_at":"2026-07-05T11:43:30Z"},{"alias_kind":"pith_short_16","alias_value":"VBINBURHUBXGIN6U","created_at":"2026-07-05T11:43:30Z"},{"alias_kind":"pith_short_8","alias_value":"VBINBURH","created_at":"2026-07-05T11:43:30Z"}],"graph_snapshots":[{"event_id":"sha256:1be078ffec7d68715aae113d9e15b58b11ea9433bf0c8e96e2dbc58dbbf65eab","target":"graph","created_at":"2026-07-05T11:43:30Z","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/2502.02389/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Andreas Winter, Christian Deppe, Holger Boche, Pau Colomer","cross_cats":["math.IT","quant-ph"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-02-04T15:09:14Z","title":"Rate-reliability tradeoff for deterministic identification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.02389","kind":"arxiv","version":4},"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:a1874d42bd60cc6b5016a34ef136ce543d1033d7ad011924b211f66c579a0d9a","target":"record","created_at":"2026-07-05T11:43:30Z","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":"5ef492ed30aea40cee77fbbd8e17ed8c9f7e88cae9042f2d668e436ea21eb5ad","cross_cats_sorted":["math.IT","quant-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-02-04T15:09:14Z","title_canon_sha256":"44bbbded6b6f54b1213f3ee8cf3dda0aa2e187b8cd8852b33bfe1aac7adb1317"},"schema_version":"1.0","source":{"id":"2502.02389","kind":"arxiv","version":4}},"canonical_sha256":"a850d0d227a06e6437d4e03cd2619220b28f9adf25daf5c969ac53e7c32bc36f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a850d0d227a06e6437d4e03cd2619220b28f9adf25daf5c969ac53e7c32bc36f","first_computed_at":"2026-07-05T11:43:30.597686Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:43:30.597686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1A8s+RbccLpovUQIQ3oXKMwpL629pvSBSECDE6GGFLRGE0eeOrBN1cqAC2egtkYjNsVF6uONEoyRYhehwiRsAg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:43:30.598168Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.02389","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a1874d42bd60cc6b5016a34ef136ce543d1033d7ad011924b211f66c579a0d9a","sha256:1be078ffec7d68715aae113d9e15b58b11ea9433bf0c8e96e2dbc58dbbf65eab"],"state_sha256":"4555c312845b7d7eaf5f69122c6256ffca0d13c12510a6623fcd7c1179653c4d"}