{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:QA4ACYYC75VMFZC5QQUI22NZND","short_pith_number":"pith:QA4ACYYC","canonical_record":{"source":{"id":"2207.03413","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-07-07T16:34:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8ae8ccf8193fe5bd7f3c342ac47fae32d2b2dffaf8c8551b8c912d2a09214961","abstract_canon_sha256":"69a41209d324b988fff4f3eed4f96c0851ba7266668123834f89ed9f924ee262"},"schema_version":"1.0"},"canonical_sha256":"8038016302ff6ac2e45d84288d69b968d55b8fdb277fec426de01d97e3aa80e5","source":{"kind":"arxiv","id":"2207.03413","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.03413","created_at":"2026-07-05T04:38:22Z"},{"alias_kind":"arxiv_version","alias_value":"2207.03413v1","created_at":"2026-07-05T04:38:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.03413","created_at":"2026-07-05T04:38:22Z"},{"alias_kind":"pith_short_12","alias_value":"QA4ACYYC75VM","created_at":"2026-07-05T04:38:22Z"},{"alias_kind":"pith_short_16","alias_value":"QA4ACYYC75VMFZC5","created_at":"2026-07-05T04:38:22Z"},{"alias_kind":"pith_short_8","alias_value":"QA4ACYYC","created_at":"2026-07-05T04:38:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:QA4ACYYC75VMFZC5QQUI22NZND","target":"record","payload":{"canonical_record":{"source":{"id":"2207.03413","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-07-07T16:34:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8ae8ccf8193fe5bd7f3c342ac47fae32d2b2dffaf8c8551b8c912d2a09214961","abstract_canon_sha256":"69a41209d324b988fff4f3eed4f96c0851ba7266668123834f89ed9f924ee262"},"schema_version":"1.0"},"canonical_sha256":"8038016302ff6ac2e45d84288d69b968d55b8fdb277fec426de01d97e3aa80e5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:38:22.064546Z","signature_b64":"Xg4xzrExTrDrFC4cPGKRNulKIInIjLGDgBXCrGAAJZCQ9+IepmBXyfNq4BloPhZNf4jvBvwSQizqVmV0UcM0Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8038016302ff6ac2e45d84288d69b968d55b8fdb277fec426de01d97e3aa80e5","last_reissued_at":"2026-07-05T04:38:22.064202Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:38:22.064202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2207.03413","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-07-05T04:38:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gvIn+39tGYtUx7Sv4NPo+6hZTCUF6P2syri0b6HKgWl+0N6WI93GVyBwWznVBq5FxQjsJsAcZQDFr9ny4eQhBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T00:10:35.650804Z"},"content_sha256":"20714d3c341a776ada1d5ef98892c9dd758c8eca27c1cfc3696099809e127e4d","schema_version":"1.0","event_id":"sha256:20714d3c341a776ada1d5ef98892c9dd758c8eca27c1cfc3696099809e127e4d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:QA4ACYYC75VMFZC5QQUI22NZND","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Identification based on random coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christian Deppe, Vladimir R. Sidorenko","submitted_at":"2022-07-07T16:34:26Z","abstract_excerpt":"Ahlswede and Dueck showed possibility to identify with high probability one out of $M$ messages by transmitting $1/C\\log\\log M$ bits only, where $C$ is the channel capacity. It is known that this identification can be based on error-correcting codes. We propose an identification procedure based on random codes that achieves channel capacity. Then we show that this procedure can be simplified using pseudo-random generators."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.03413","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/2207.03413/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"},"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-07-05T04:38:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x53C8lVCzfD72JUNzdOa6HXo1NXd/RL2gAV3OmQHavg5kctgVW8e7Ir9YXs6VK3Sc0/LGvhaucL38f+dVC10Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T00:10:35.651866Z"},"content_sha256":"a9f5e265f2cb06fe3ea65cc6b604bdf7f7a8b744a8387a30850c9cf58bc02ae7","schema_version":"1.0","event_id":"sha256:a9f5e265f2cb06fe3ea65cc6b604bdf7f7a8b744a8387a30850c9cf58bc02ae7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QA4ACYYC75VMFZC5QQUI22NZND/bundle.json","state_url":"https://pith.science/pith/QA4ACYYC75VMFZC5QQUI22NZND/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QA4ACYYC75VMFZC5QQUI22NZND/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-07T00:10:35Z","links":{"resolver":"https://pith.science/pith/QA4ACYYC75VMFZC5QQUI22NZND","bundle":"https://pith.science/pith/QA4ACYYC75VMFZC5QQUI22NZND/bundle.json","state":"https://pith.science/pith/QA4ACYYC75VMFZC5QQUI22NZND/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QA4ACYYC75VMFZC5QQUI22NZND/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:QA4ACYYC75VMFZC5QQUI22NZND","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":"69a41209d324b988fff4f3eed4f96c0851ba7266668123834f89ed9f924ee262","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-07-07T16:34:26Z","title_canon_sha256":"8ae8ccf8193fe5bd7f3c342ac47fae32d2b2dffaf8c8551b8c912d2a09214961"},"schema_version":"1.0","source":{"id":"2207.03413","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.03413","created_at":"2026-07-05T04:38:22Z"},{"alias_kind":"arxiv_version","alias_value":"2207.03413v1","created_at":"2026-07-05T04:38:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.03413","created_at":"2026-07-05T04:38:22Z"},{"alias_kind":"pith_short_12","alias_value":"QA4ACYYC75VM","created_at":"2026-07-05T04:38:22Z"},{"alias_kind":"pith_short_16","alias_value":"QA4ACYYC75VMFZC5","created_at":"2026-07-05T04:38:22Z"},{"alias_kind":"pith_short_8","alias_value":"QA4ACYYC","created_at":"2026-07-05T04:38:22Z"}],"graph_snapshots":[{"event_id":"sha256:a9f5e265f2cb06fe3ea65cc6b604bdf7f7a8b744a8387a30850c9cf58bc02ae7","target":"graph","created_at":"2026-07-05T04:38:22Z","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/2207.03413/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Ahlswede and Dueck showed possibility to identify with high probability one out of $M$ messages by transmitting $1/C\\log\\log M$ bits only, where $C$ is the channel capacity. It is known that this identification can be based on error-correcting codes. We propose an identification procedure based on random codes that achieves channel capacity. Then we show that this procedure can be simplified using pseudo-random generators.","authors_text":"Christian Deppe, Vladimir R. Sidorenko","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-07-07T16:34:26Z","title":"Identification based on random coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.03413","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:20714d3c341a776ada1d5ef98892c9dd758c8eca27c1cfc3696099809e127e4d","target":"record","created_at":"2026-07-05T04:38:22Z","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":"69a41209d324b988fff4f3eed4f96c0851ba7266668123834f89ed9f924ee262","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-07-07T16:34:26Z","title_canon_sha256":"8ae8ccf8193fe5bd7f3c342ac47fae32d2b2dffaf8c8551b8c912d2a09214961"},"schema_version":"1.0","source":{"id":"2207.03413","kind":"arxiv","version":1}},"canonical_sha256":"8038016302ff6ac2e45d84288d69b968d55b8fdb277fec426de01d97e3aa80e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8038016302ff6ac2e45d84288d69b968d55b8fdb277fec426de01d97e3aa80e5","first_computed_at":"2026-07-05T04:38:22.064202Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:38:22.064202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Xg4xzrExTrDrFC4cPGKRNulKIInIjLGDgBXCrGAAJZCQ9+IepmBXyfNq4BloPhZNf4jvBvwSQizqVmV0UcM0Cg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:38:22.064546Z","signed_message":"canonical_sha256_bytes"},"source_id":"2207.03413","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:20714d3c341a776ada1d5ef98892c9dd758c8eca27c1cfc3696099809e127e4d","sha256:a9f5e265f2cb06fe3ea65cc6b604bdf7f7a8b744a8387a30850c9cf58bc02ae7"],"state_sha256":"7a30e8c5bc42d18e27f9daeea731c2c9063e0e5dac4752e0c14e1680ef4c1e74"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+FA6FCp9GSex+nGivangYPSTmEGblBwyNgu8F4pghXE2jvLUte43PkxOcUQc+u4v2EAjwT1lLnVZKW+XeGXKCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T00:10:35.716083Z","bundle_sha256":"29e419172eb5c08bfda0e65a5b49a338df3d9b3f4d4b29d42078a47be6361669"}}