{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:JILG2IPE25OLNLUPXZZASPSNR5","short_pith_number":"pith:JILG2IPE","schema_version":"1.0","canonical_sha256":"4a166d21e4d75cb6ae8fbe72093e4d8f55eb5c6caec752f28e395973058a438f","source":{"kind":"arxiv","id":"2608.03282","version":1},"attestation_state":"computed","paper":{"title":"Reliability-Dependent Scaling Laws of Deterministic Identification over Binary Symmetric Channels","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT","math.PR"],"primary_cat":"cs.IT","authors_text":"Guiying Yan, Liuquan Yao, Zechun Hu, Zhicheng Liu, Zhiming Ma","submitted_at":"2026-08-04T07:57:53Z","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"},"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":"2608.03282","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-08-04T07:57:53Z","cross_cats_sorted":["math.IT","math.PR"],"title_canon_sha256":"cc08cb51a43a809ddcfff69beb130a0abe9220657aaf9ddd13fb0764f2d2d2e7","abstract_canon_sha256":"acba4d67ca0b1434ce34c047f54f7841942088d06534790f52e9ff81fc861b32"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-05T00:46:38.449656Z","signature_b64":"mnnd25xFugTvcLF8beXesTMdMLTxFl9C8RSEU1LrKCP5dD6EvgP93vYbn0ElaDVQIIexq114gmW7B7wu5szKDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a166d21e4d75cb6ae8fbe72093e4d8f55eb5c6caec752f28e395973058a438f","last_reissued_at":"2026-08-05T00:46:38.447192Z","signature_status":"signed_v1","first_computed_at":"2026-08-05T00:46:38.447192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reliability-Dependent Scaling Laws of Deterministic Identification over Binary Symmetric Channels","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT","math.PR"],"primary_cat":"cs.IT","authors_text":"Guiying Yan, Liuquan Yao, Zechun Hu, Zhicheng Liu, Zhiming Ma","submitted_at":"2026-08-04T07:57:53Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.03282","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/2608.03282/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":"2608.03282","created_at":"2026-08-05T00:46:38.448021+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.03282v1","created_at":"2026-08-05T00:46:38.448021+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.03282","created_at":"2026-08-05T00:46:38.448021+00:00"},{"alias_kind":"pith_short_12","alias_value":"JILG2IPE25OL","created_at":"2026-08-05T00:46:38.448021+00:00"},{"alias_kind":"pith_short_16","alias_value":"JILG2IPE25OLNLUP","created_at":"2026-08-05T00:46:38.448021+00:00"},{"alias_kind":"pith_short_8","alias_value":"JILG2IPE","created_at":"2026-08-05T00:46:38.448021+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/JILG2IPE25OLNLUPXZZASPSNR5","json":"https://pith.science/pith/JILG2IPE25OLNLUPXZZASPSNR5.json","graph_json":"https://pith.science/api/pith-number/JILG2IPE25OLNLUPXZZASPSNR5/graph.json","events_json":"https://pith.science/api/pith-number/JILG2IPE25OLNLUPXZZASPSNR5/events.json","paper":"https://pith.science/paper/JILG2IPE"},"agent_actions":{"view_html":"https://pith.science/pith/JILG2IPE25OLNLUPXZZASPSNR5","download_json":"https://pith.science/pith/JILG2IPE25OLNLUPXZZASPSNR5.json","view_paper":"https://pith.science/paper/JILG2IPE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.03282&json=true","fetch_graph":"https://pith.science/api/pith-number/JILG2IPE25OLNLUPXZZASPSNR5/graph.json","fetch_events":"https://pith.science/api/pith-number/JILG2IPE25OLNLUPXZZASPSNR5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JILG2IPE25OLNLUPXZZASPSNR5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JILG2IPE25OLNLUPXZZASPSNR5/action/storage_attestation","attest_author":"https://pith.science/pith/JILG2IPE25OLNLUPXZZASPSNR5/action/author_attestation","sign_citation":"https://pith.science/pith/JILG2IPE25OLNLUPXZZASPSNR5/action/citation_signature","submit_replication":"https://pith.science/pith/JILG2IPE25OLNLUPXZZASPSNR5/action/replication_record"}},"created_at":"2026-08-05T00:46:38.448021+00:00","updated_at":"2026-08-05T00:46:38.448021+00:00"}