{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:JILG2IPE25OLNLUPXZZASPSNR5","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":"acba4d67ca0b1434ce34c047f54f7841942088d06534790f52e9ff81fc861b32","cross_cats_sorted":["math.IT","math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-08-04T07:57:53Z","title_canon_sha256":"cc08cb51a43a809ddcfff69beb130a0abe9220657aaf9ddd13fb0764f2d2d2e7"},"schema_version":"1.0","source":{"id":"2608.03282","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.03282","created_at":"2026-08-05T00:46:38Z"},{"alias_kind":"arxiv_version","alias_value":"2608.03282v1","created_at":"2026-08-05T00:46:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.03282","created_at":"2026-08-05T00:46:38Z"},{"alias_kind":"pith_short_12","alias_value":"JILG2IPE25OL","created_at":"2026-08-05T00:46:38Z"},{"alias_kind":"pith_short_16","alias_value":"JILG2IPE25OLNLUP","created_at":"2026-08-05T00:46:38Z"},{"alias_kind":"pith_short_8","alias_value":"JILG2IPE","created_at":"2026-08-05T00:46:38Z"}],"graph_snapshots":[{"event_id":"sha256:5ba68e36f345735b1caf91e1ebca1f1a2d7190b59017a33f2a620c700e2dd69b","target":"graph","created_at":"2026-08-05T00:46:38Z","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/2608.03282/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we study the asymptotic behavior of deterministic identification (DID) over binary symmetric channels (BSCs) under vanishing error constraints. By introducing a minimum error parameter, we characterize how different error-decay regimes affect the achievable DID rate. General achievability and converse bounds are derived, with explicit asymptotic characterizations in the large-deviation, moderate-deviation, and central-limit regimes. The achievability analysis combines coding-theoretic constructions with probabilistic concentration techniques, while the converse links statistical","authors_text":"Guiying Yan, Liuquan Yao, Zechun Hu, Zhicheng Liu, Zhiming Ma","cross_cats":["math.IT","math.PR"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-08-04T07:57:53Z","title":"Reliability-Dependent Scaling Laws of Deterministic Identification over Binary Symmetric Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.03282","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:a52337860bdbc64df2ac6d609efd97fa9157d0673dc9ea27dd89b8b856f3e489","target":"record","created_at":"2026-08-05T00:46:38Z","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":"acba4d67ca0b1434ce34c047f54f7841942088d06534790f52e9ff81fc861b32","cross_cats_sorted":["math.IT","math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-08-04T07:57:53Z","title_canon_sha256":"cc08cb51a43a809ddcfff69beb130a0abe9220657aaf9ddd13fb0764f2d2d2e7"},"schema_version":"1.0","source":{"id":"2608.03282","kind":"arxiv","version":1}},"canonical_sha256":"4a166d21e4d75cb6ae8fbe72093e4d8f55eb5c6caec752f28e395973058a438f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a166d21e4d75cb6ae8fbe72093e4d8f55eb5c6caec752f28e395973058a438f","first_computed_at":"2026-08-05T00:46:38.447192Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-05T00:46:38.447192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mnnd25xFugTvcLF8beXesTMdMLTxFl9C8RSEU1LrKCP5dD6EvgP93vYbn0ElaDVQIIexq114gmW7B7wu5szKDQ==","signature_status":"signed_v1","signed_at":"2026-08-05T00:46:38.449656Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.03282","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a52337860bdbc64df2ac6d609efd97fa9157d0673dc9ea27dd89b8b856f3e489","sha256:5ba68e36f345735b1caf91e1ebca1f1a2d7190b59017a33f2a620c700e2dd69b"],"state_sha256":"1285bbd11bcdfcb19b1d3471511383dd32f4ee859ff5d367b9b0f8dbe97ceb78"}