{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:YWVJHB6BY26XNMCQH6N6PW7LR5","short_pith_number":"pith:YWVJHB6B","canonical_record":{"source":{"id":"1409.1657","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-05T03:34:31Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"e7bdbbde568074d7ed729239fb746e765c80c8fb7a631825c8eb17c026ceacf0","abstract_canon_sha256":"9f47b7603ae89347a50ce0e2460788980754725fd3db075c90aaef0f8c2b36e1"},"schema_version":"1.0"},"canonical_sha256":"c5aa9387c1c6bd76b0503f9be7dbeb8f75e796d65ea2ddbdcba08a4690dec27b","source":{"kind":"arxiv","id":"1409.1657","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.1657","created_at":"2026-05-18T02:43:25Z"},{"alias_kind":"arxiv_version","alias_value":"1409.1657v1","created_at":"2026-05-18T02:43:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.1657","created_at":"2026-05-18T02:43:25Z"},{"alias_kind":"pith_short_12","alias_value":"YWVJHB6BY26X","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"YWVJHB6BY26XNMCQ","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"YWVJHB6B","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:YWVJHB6BY26XNMCQH6N6PW7LR5","target":"record","payload":{"canonical_record":{"source":{"id":"1409.1657","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-05T03:34:31Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"e7bdbbde568074d7ed729239fb746e765c80c8fb7a631825c8eb17c026ceacf0","abstract_canon_sha256":"9f47b7603ae89347a50ce0e2460788980754725fd3db075c90aaef0f8c2b36e1"},"schema_version":"1.0"},"canonical_sha256":"c5aa9387c1c6bd76b0503f9be7dbeb8f75e796d65ea2ddbdcba08a4690dec27b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:25.594446Z","signature_b64":"E0q5TGt9vofiphdESLLhvbD7LcSxgCzQchlsSU9wLhiAYzXpI/q8F2l+F9sQu4vlwe8Ch1AFSQJnOXWoN1jxDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5aa9387c1c6bd76b0503f9be7dbeb8f75e796d65ea2ddbdcba08a4690dec27b","last_reissued_at":"2026-05-18T02:43:25.593897Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:25.593897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.1657","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:43:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hp4GbnsjrZUS5Mfiy4VzMvUMY6eElj4ZCzc35Q2QvwV34MXR1QYJDRk63zuvryMd+Chy5aCPsXlvFmg3sHL+BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T11:08:53.829316Z"},"content_sha256":"a86ee4b599147355e0954e9ad94630cab19ac0a9ee3e470ca904d1f34acfe912","schema_version":"1.0","event_id":"sha256:a86ee4b599147355e0954e9ad94630cab19ac0a9ee3e470ca904d1f34acfe912"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:YWVJHB6BY26XNMCQH6N6PW7LR5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Optimality of Keyless Authentication in a Noisy Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Shaoquan Jiang","submitted_at":"2014-09-05T03:34:31Z","abstract_excerpt":"We further study the keyless authentication problem in a noisy model in our previous work, where no secret setup is available for sender Alice and receiver Bob while there is DMC $W_1$ from Alice to Bob and a two-way noiseless but insecure channel between them. We propose a construction such that the message length over DMC $W_1$ does not depend on the size of the source space. If the source space is ${\\cal S}$ and the number of channel $W_1$ uses is $n$, then our protocol only has a round complexity of $\\log^*|{\\cal S}|-\\log^*n+4.$ In addition, we show that the round complexity of any secure "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.1657","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:43:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yFKjJodJw027X5VFcAdFqpTX3CLDgFFHtyQh3+FMSMbKzY8C2p4e4JBrPE0jykLBAVxzgB4XH4hRcUmP/nmQBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T11:08:53.829801Z"},"content_sha256":"27f67ccb735420c73f2e46e34b498f8405836c3b44dcd9c36818f6570d8ae687","schema_version":"1.0","event_id":"sha256:27f67ccb735420c73f2e46e34b498f8405836c3b44dcd9c36818f6570d8ae687"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YWVJHB6BY26XNMCQH6N6PW7LR5/bundle.json","state_url":"https://pith.science/pith/YWVJHB6BY26XNMCQH6N6PW7LR5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YWVJHB6BY26XNMCQH6N6PW7LR5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-19T11:08:53Z","links":{"resolver":"https://pith.science/pith/YWVJHB6BY26XNMCQH6N6PW7LR5","bundle":"https://pith.science/pith/YWVJHB6BY26XNMCQH6N6PW7LR5/bundle.json","state":"https://pith.science/pith/YWVJHB6BY26XNMCQH6N6PW7LR5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YWVJHB6BY26XNMCQH6N6PW7LR5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:YWVJHB6BY26XNMCQH6N6PW7LR5","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":"9f47b7603ae89347a50ce0e2460788980754725fd3db075c90aaef0f8c2b36e1","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-05T03:34:31Z","title_canon_sha256":"e7bdbbde568074d7ed729239fb746e765c80c8fb7a631825c8eb17c026ceacf0"},"schema_version":"1.0","source":{"id":"1409.1657","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.1657","created_at":"2026-05-18T02:43:25Z"},{"alias_kind":"arxiv_version","alias_value":"1409.1657v1","created_at":"2026-05-18T02:43:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.1657","created_at":"2026-05-18T02:43:25Z"},{"alias_kind":"pith_short_12","alias_value":"YWVJHB6BY26X","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"YWVJHB6BY26XNMCQ","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"YWVJHB6B","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:27f67ccb735420c73f2e46e34b498f8405836c3b44dcd9c36818f6570d8ae687","target":"graph","created_at":"2026-05-18T02:43:25Z","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"},"paper":{"abstract_excerpt":"We further study the keyless authentication problem in a noisy model in our previous work, where no secret setup is available for sender Alice and receiver Bob while there is DMC $W_1$ from Alice to Bob and a two-way noiseless but insecure channel between them. We propose a construction such that the message length over DMC $W_1$ does not depend on the size of the source space. If the source space is ${\\cal S}$ and the number of channel $W_1$ uses is $n$, then our protocol only has a round complexity of $\\log^*|{\\cal S}|-\\log^*n+4.$ In addition, we show that the round complexity of any secure ","authors_text":"Shaoquan Jiang","cross_cats":["cs.CR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-05T03:34:31Z","title":"On the Optimality of Keyless Authentication in a Noisy Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.1657","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:a86ee4b599147355e0954e9ad94630cab19ac0a9ee3e470ca904d1f34acfe912","target":"record","created_at":"2026-05-18T02:43:25Z","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":"9f47b7603ae89347a50ce0e2460788980754725fd3db075c90aaef0f8c2b36e1","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-05T03:34:31Z","title_canon_sha256":"e7bdbbde568074d7ed729239fb746e765c80c8fb7a631825c8eb17c026ceacf0"},"schema_version":"1.0","source":{"id":"1409.1657","kind":"arxiv","version":1}},"canonical_sha256":"c5aa9387c1c6bd76b0503f9be7dbeb8f75e796d65ea2ddbdcba08a4690dec27b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c5aa9387c1c6bd76b0503f9be7dbeb8f75e796d65ea2ddbdcba08a4690dec27b","first_computed_at":"2026-05-18T02:43:25.593897Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:43:25.593897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E0q5TGt9vofiphdESLLhvbD7LcSxgCzQchlsSU9wLhiAYzXpI/q8F2l+F9sQu4vlwe8Ch1AFSQJnOXWoN1jxDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:43:25.594446Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.1657","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a86ee4b599147355e0954e9ad94630cab19ac0a9ee3e470ca904d1f34acfe912","sha256:27f67ccb735420c73f2e46e34b498f8405836c3b44dcd9c36818f6570d8ae687"],"state_sha256":"23b81a493c3d33cfa461fa7ea274ec2f2a105c2c0877da2096797d60f89d93e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6KO2Fo0HRwXGOv06PAmxNv/mTxCYPLgG6JzUOW5NkrWyf05sTyQHr6J0E579q0pKi/f9cydDTMwKTrBnMm+sCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T11:08:53.834923Z","bundle_sha256":"6faf0ee52c74e4591f9c6de64198e0df270a8527a5eec80af1eb81885dc26410"}}