{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:IKII6RIXZDRMFXLRNAWM26WQ3D","short_pith_number":"pith:IKII6RIX","canonical_record":{"source":{"id":"1005.1560","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-05-10T14:24:33Z","cross_cats_sorted":["math.IT","physics.gen-ph"],"title_canon_sha256":"c3727a4d3b702c31e6adf7e2b46800d50e8f60598b38e80997a3a70d7c61f0f9","abstract_canon_sha256":"96a568f97dbe0322b69bf2f648dce56f876678ef096d6608c9f564b90f811e01"},"schema_version":"1.0"},"canonical_sha256":"42908f4517c8e2c2dd71682ccd7ad0d8d60853055bd0df9ed6b9d9e92a08899b","source":{"kind":"arxiv","id":"1005.1560","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.1560","created_at":"2026-05-18T04:29:44Z"},{"alias_kind":"arxiv_version","alias_value":"1005.1560v3","created_at":"2026-05-18T04:29:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.1560","created_at":"2026-05-18T04:29:44Z"},{"alias_kind":"pith_short_12","alias_value":"IKII6RIXZDRM","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"IKII6RIXZDRMFXLR","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"IKII6RIX","created_at":"2026-05-18T12:26:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:IKII6RIXZDRMFXLRNAWM26WQ3D","target":"record","payload":{"canonical_record":{"source":{"id":"1005.1560","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-05-10T14:24:33Z","cross_cats_sorted":["math.IT","physics.gen-ph"],"title_canon_sha256":"c3727a4d3b702c31e6adf7e2b46800d50e8f60598b38e80997a3a70d7c61f0f9","abstract_canon_sha256":"96a568f97dbe0322b69bf2f648dce56f876678ef096d6608c9f564b90f811e01"},"schema_version":"1.0"},"canonical_sha256":"42908f4517c8e2c2dd71682ccd7ad0d8d60853055bd0df9ed6b9d9e92a08899b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:29:44.587307Z","signature_b64":"37BhDDx6sHUJ36xQ4n/WV8FF7vrFaF2IMF6c8BIRalxsnBjBTT7OUteQE4WAZia+FxNz8eSEx+DPVNGQPbBYAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42908f4517c8e2c2dd71682ccd7ad0d8d60853055bd0df9ed6b9d9e92a08899b","last_reissued_at":"2026-05-18T04:29:44.586850Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:29:44.586850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1005.1560","source_version":3,"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-18T04:29:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LU6IE9Pzzbtji6pVk5YXIHHu5gAk/PopXXRygZ6njcqfzLVeAX5i2aKBdyZVtxZVnNWaqilYSbwVvR2/FqIlAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T10:21:05.721052Z"},"content_sha256":"c8183fb4b870a86acc69bf712b8f00b0a6b083173313124930003b231a9eb45a","schema_version":"1.0","event_id":"sha256:c8183fb4b870a86acc69bf712b8f00b0a6b083173313124930003b231a9eb45a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:IKII6RIXZDRMFXLRNAWM26WQ3D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computation using Noise-based Logic: Efficient String Verification over a Slow Communication Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","physics.gen-ph"],"primary_cat":"cs.IT","authors_text":"Laszlo B. Kish, Sunil Khatri, Tamas Horvath","submitted_at":"2010-05-10T14:24:33Z","abstract_excerpt":"Utilizing the hyperspace of noise-based logic, we show two string verification methods with low communication complexity. One of them is based on continuum noise-based logic. The other one utilizes noise-based logic with random telegraph signals where a mathematical analysis of the error probability is also given. The last operation can also be interpreted as computing universal hash functions with noise-based logic and using them for string comparison. To find out with 10^-25 error probability that two strings with arbitrary length are different (this value is similar to the error probability"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.1560","kind":"arxiv","version":3},"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-18T04:29:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kvHTAYACW8QgzoTCWgPUlWs7Xy6zU3VK332utPN627qbVwKLDxHO6ZnxoV899jtbficdZ4VpCf48cZ0+SZxoCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T10:21:05.721408Z"},"content_sha256":"6092f220214f1e5e301327a6496e757c7054bd5481ccdd9e798d377c54302c86","schema_version":"1.0","event_id":"sha256:6092f220214f1e5e301327a6496e757c7054bd5481ccdd9e798d377c54302c86"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IKII6RIXZDRMFXLRNAWM26WQ3D/bundle.json","state_url":"https://pith.science/pith/IKII6RIXZDRMFXLRNAWM26WQ3D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IKII6RIXZDRMFXLRNAWM26WQ3D/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-06-03T10:21:05Z","links":{"resolver":"https://pith.science/pith/IKII6RIXZDRMFXLRNAWM26WQ3D","bundle":"https://pith.science/pith/IKII6RIXZDRMFXLRNAWM26WQ3D/bundle.json","state":"https://pith.science/pith/IKII6RIXZDRMFXLRNAWM26WQ3D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IKII6RIXZDRMFXLRNAWM26WQ3D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:IKII6RIXZDRMFXLRNAWM26WQ3D","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":"96a568f97dbe0322b69bf2f648dce56f876678ef096d6608c9f564b90f811e01","cross_cats_sorted":["math.IT","physics.gen-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-05-10T14:24:33Z","title_canon_sha256":"c3727a4d3b702c31e6adf7e2b46800d50e8f60598b38e80997a3a70d7c61f0f9"},"schema_version":"1.0","source":{"id":"1005.1560","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.1560","created_at":"2026-05-18T04:29:44Z"},{"alias_kind":"arxiv_version","alias_value":"1005.1560v3","created_at":"2026-05-18T04:29:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.1560","created_at":"2026-05-18T04:29:44Z"},{"alias_kind":"pith_short_12","alias_value":"IKII6RIXZDRM","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"IKII6RIXZDRMFXLR","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"IKII6RIX","created_at":"2026-05-18T12:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:6092f220214f1e5e301327a6496e757c7054bd5481ccdd9e798d377c54302c86","target":"graph","created_at":"2026-05-18T04:29:44Z","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":"Utilizing the hyperspace of noise-based logic, we show two string verification methods with low communication complexity. One of them is based on continuum noise-based logic. The other one utilizes noise-based logic with random telegraph signals where a mathematical analysis of the error probability is also given. The last operation can also be interpreted as computing universal hash functions with noise-based logic and using them for string comparison. To find out with 10^-25 error probability that two strings with arbitrary length are different (this value is similar to the error probability","authors_text":"Laszlo B. Kish, Sunil Khatri, Tamas Horvath","cross_cats":["math.IT","physics.gen-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-05-10T14:24:33Z","title":"Computation using Noise-based Logic: Efficient String Verification over a Slow Communication Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.1560","kind":"arxiv","version":3},"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:c8183fb4b870a86acc69bf712b8f00b0a6b083173313124930003b231a9eb45a","target":"record","created_at":"2026-05-18T04:29:44Z","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":"96a568f97dbe0322b69bf2f648dce56f876678ef096d6608c9f564b90f811e01","cross_cats_sorted":["math.IT","physics.gen-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-05-10T14:24:33Z","title_canon_sha256":"c3727a4d3b702c31e6adf7e2b46800d50e8f60598b38e80997a3a70d7c61f0f9"},"schema_version":"1.0","source":{"id":"1005.1560","kind":"arxiv","version":3}},"canonical_sha256":"42908f4517c8e2c2dd71682ccd7ad0d8d60853055bd0df9ed6b9d9e92a08899b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"42908f4517c8e2c2dd71682ccd7ad0d8d60853055bd0df9ed6b9d9e92a08899b","first_computed_at":"2026-05-18T04:29:44.586850Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:29:44.586850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"37BhDDx6sHUJ36xQ4n/WV8FF7vrFaF2IMF6c8BIRalxsnBjBTT7OUteQE4WAZia+FxNz8eSEx+DPVNGQPbBYAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:29:44.587307Z","signed_message":"canonical_sha256_bytes"},"source_id":"1005.1560","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c8183fb4b870a86acc69bf712b8f00b0a6b083173313124930003b231a9eb45a","sha256:6092f220214f1e5e301327a6496e757c7054bd5481ccdd9e798d377c54302c86"],"state_sha256":"15e4e0054afa6b0ac4170cc8d925cf25db7122de53e8388a7b8ea651c9cec545"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xMuqvcrPdCEPOvP5MoA3hFN02MDWqLhzX1pVUdHUmabLfdSJCyXb5Z0qcbvFDkySlLOTLm7B4O9vJdwohbObDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T10:21:05.723292Z","bundle_sha256":"8290a9d681a1c9a1c7ab3648bdef41db697c15a95d9cd9b9be43a5108ddba4de"}}