{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:QN7TM6EVDPLNSMHT6LAZ3KAPDJ","short_pith_number":"pith:QN7TM6EV","canonical_record":{"source":{"id":"1201.4725","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-01-23T14:33:10Z","cross_cats_sorted":[],"title_canon_sha256":"5715784029a9e66e15c1ddf7bef3d010624d83955e653a411a274243e5ef8b78","abstract_canon_sha256":"68675cd280da061fa61507626a11eb4d9c7a696dec56c930f2e0f87a387d17bd"},"schema_version":"1.0"},"canonical_sha256":"837f3678951bd6d930f3f2c19da80f1a46d9e3d42a92c27e4bd5b5737fe864ad","source":{"kind":"arxiv","id":"1201.4725","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.4725","created_at":"2026-05-18T04:04:05Z"},{"alias_kind":"arxiv_version","alias_value":"1201.4725v1","created_at":"2026-05-18T04:04:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.4725","created_at":"2026-05-18T04:04:05Z"},{"alias_kind":"pith_short_12","alias_value":"QN7TM6EVDPLN","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QN7TM6EVDPLNSMHT","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QN7TM6EV","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:QN7TM6EVDPLNSMHT6LAZ3KAPDJ","target":"record","payload":{"canonical_record":{"source":{"id":"1201.4725","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-01-23T14:33:10Z","cross_cats_sorted":[],"title_canon_sha256":"5715784029a9e66e15c1ddf7bef3d010624d83955e653a411a274243e5ef8b78","abstract_canon_sha256":"68675cd280da061fa61507626a11eb4d9c7a696dec56c930f2e0f87a387d17bd"},"schema_version":"1.0"},"canonical_sha256":"837f3678951bd6d930f3f2c19da80f1a46d9e3d42a92c27e4bd5b5737fe864ad","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:04:05.345197Z","signature_b64":"Z3ChuXmCwx2jrSBiYH0r8s4oij5UE9cneQMPvI5zJsqfYgLBW63MM1uLAM7d/mfK9gF/y6IhTbbX71ksAotWDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"837f3678951bd6d930f3f2c19da80f1a46d9e3d42a92c27e4bd5b5737fe864ad","last_reissued_at":"2026-05-18T04:04:05.344782Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:04:05.344782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.4725","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-18T04:04:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"psjKzLTx40vOzdrmamib+etAzLkQtWeXbq12MVQkISjzx4sHB29vPClHImCEAEGCpev6eNL9VTVas0jnUQsjAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T20:43:01.173937Z"},"content_sha256":"09c28b3b502e5b50707388b6a82d783ad5d31a5e48ea732fed1e3923f98ec558","schema_version":"1.0","event_id":"sha256:09c28b3b502e5b50707388b6a82d783ad5d31a5e48ea732fed1e3923f98ec558"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:QN7TM6EVDPLNSMHT6LAZ3KAPDJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving the LPN problem in cube-root time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Urs Wagner","submitted_at":"2012-01-23T14:33:10Z","abstract_excerpt":"In this paper it is shown that given a sufficient number of (noisy) random binary linear equations, the Learning from Parity with Noise (LPN) problem can be solved in essentially cube root time in the number of unknowns. The techniques used to recover the solution are known from fast correlation attacks on stream ciphers. As in fast correlation attacks, the performance of the algorithm depends on the number of equations given. It is shown that if this number exceeds a certain bound, and the bias of the noisy equations is polynomial in number of unknowns, the running time of the algorithm is re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.4725","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-18T04:04:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jtck/Kih7V43dHl0US4hFOKAEkzr8a3DUjk4ZUAC7lYbS4PtuDlkp14p5Um8A0bM6/+MTbnunYuFQ2jslCWhAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T20:43:01.174360Z"},"content_sha256":"8752565e5dcd16ea27706c244abe3bcc064365316c5273d8261a6e269c6da48f","schema_version":"1.0","event_id":"sha256:8752565e5dcd16ea27706c244abe3bcc064365316c5273d8261a6e269c6da48f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QN7TM6EVDPLNSMHT6LAZ3KAPDJ/bundle.json","state_url":"https://pith.science/pith/QN7TM6EVDPLNSMHT6LAZ3KAPDJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QN7TM6EVDPLNSMHT6LAZ3KAPDJ/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-25T20:43:01Z","links":{"resolver":"https://pith.science/pith/QN7TM6EVDPLNSMHT6LAZ3KAPDJ","bundle":"https://pith.science/pith/QN7TM6EVDPLNSMHT6LAZ3KAPDJ/bundle.json","state":"https://pith.science/pith/QN7TM6EVDPLNSMHT6LAZ3KAPDJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QN7TM6EVDPLNSMHT6LAZ3KAPDJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:QN7TM6EVDPLNSMHT6LAZ3KAPDJ","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":"68675cd280da061fa61507626a11eb4d9c7a696dec56c930f2e0f87a387d17bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-01-23T14:33:10Z","title_canon_sha256":"5715784029a9e66e15c1ddf7bef3d010624d83955e653a411a274243e5ef8b78"},"schema_version":"1.0","source":{"id":"1201.4725","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.4725","created_at":"2026-05-18T04:04:05Z"},{"alias_kind":"arxiv_version","alias_value":"1201.4725v1","created_at":"2026-05-18T04:04:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.4725","created_at":"2026-05-18T04:04:05Z"},{"alias_kind":"pith_short_12","alias_value":"QN7TM6EVDPLN","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QN7TM6EVDPLNSMHT","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QN7TM6EV","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:8752565e5dcd16ea27706c244abe3bcc064365316c5273d8261a6e269c6da48f","target":"graph","created_at":"2026-05-18T04:04:05Z","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":"In this paper it is shown that given a sufficient number of (noisy) random binary linear equations, the Learning from Parity with Noise (LPN) problem can be solved in essentially cube root time in the number of unknowns. The techniques used to recover the solution are known from fast correlation attacks on stream ciphers. As in fast correlation attacks, the performance of the algorithm depends on the number of equations given. It is shown that if this number exceeds a certain bound, and the bias of the noisy equations is polynomial in number of unknowns, the running time of the algorithm is re","authors_text":"Urs Wagner","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-01-23T14:33:10Z","title":"Solving the LPN problem in cube-root time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.4725","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:09c28b3b502e5b50707388b6a82d783ad5d31a5e48ea732fed1e3923f98ec558","target":"record","created_at":"2026-05-18T04:04:05Z","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":"68675cd280da061fa61507626a11eb4d9c7a696dec56c930f2e0f87a387d17bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-01-23T14:33:10Z","title_canon_sha256":"5715784029a9e66e15c1ddf7bef3d010624d83955e653a411a274243e5ef8b78"},"schema_version":"1.0","source":{"id":"1201.4725","kind":"arxiv","version":1}},"canonical_sha256":"837f3678951bd6d930f3f2c19da80f1a46d9e3d42a92c27e4bd5b5737fe864ad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"837f3678951bd6d930f3f2c19da80f1a46d9e3d42a92c27e4bd5b5737fe864ad","first_computed_at":"2026-05-18T04:04:05.344782Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:04:05.344782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z3ChuXmCwx2jrSBiYH0r8s4oij5UE9cneQMPvI5zJsqfYgLBW63MM1uLAM7d/mfK9gF/y6IhTbbX71ksAotWDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:04:05.345197Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.4725","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:09c28b3b502e5b50707388b6a82d783ad5d31a5e48ea732fed1e3923f98ec558","sha256:8752565e5dcd16ea27706c244abe3bcc064365316c5273d8261a6e269c6da48f"],"state_sha256":"2b5b5d720c8c613b5b075e76bbfdc0188350300b6e54daf464d91d8773df4bc0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E128sAV4L8TA7OMolBksPaPQ276+jl6KgDH5gw6RqYqaiidAzE9GMUgyxTQD2V8+Zm7TZAQASnFqiJrXHOpCBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T20:43:01.176659Z","bundle_sha256":"529396f3522519d426842767de4525b3fd6e5abe22c940cf386c6262d890e6fb"}}