{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:CAJIJHFM5WYHETPF3KITDTBXY4","short_pith_number":"pith:CAJIJHFM","canonical_record":{"source":{"id":"1506.07234","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-24T04:03:13Z","cross_cats_sorted":["cs.CC","math.IT"],"title_canon_sha256":"f47a176fdc8bbfbe6f01da099bdd4297717a8115e1bced2c11dfe4f631792f12","abstract_canon_sha256":"52557b30adbd684192756a104c7e302827963dd5ad48b595111ce57f5de5ff49"},"schema_version":"1.0"},"canonical_sha256":"1012849cacedb0724de5da9131cc37c719b817e9e52bdcdeac13f7991483db8c","source":{"kind":"arxiv","id":"1506.07234","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.07234","created_at":"2026-05-18T00:44:37Z"},{"alias_kind":"arxiv_version","alias_value":"1506.07234v3","created_at":"2026-05-18T00:44:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.07234","created_at":"2026-05-18T00:44:37Z"},{"alias_kind":"pith_short_12","alias_value":"CAJIJHFM5WYH","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"CAJIJHFM5WYHETPF","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"CAJIJHFM","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:CAJIJHFM5WYHETPF3KITDTBXY4","target":"record","payload":{"canonical_record":{"source":{"id":"1506.07234","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-24T04:03:13Z","cross_cats_sorted":["cs.CC","math.IT"],"title_canon_sha256":"f47a176fdc8bbfbe6f01da099bdd4297717a8115e1bced2c11dfe4f631792f12","abstract_canon_sha256":"52557b30adbd684192756a104c7e302827963dd5ad48b595111ce57f5de5ff49"},"schema_version":"1.0"},"canonical_sha256":"1012849cacedb0724de5da9131cc37c719b817e9e52bdcdeac13f7991483db8c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:37.343147Z","signature_b64":"gh9+UQZHJxbtjRj/LwwPsaxBiMiWNrJS/13yWi5Nb6M1Rzfj7TGboluKJObZwTsxQZbWJwSzhSkSlygrghA8Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1012849cacedb0724de5da9131cc37c719b817e9e52bdcdeac13f7991483db8c","last_reissued_at":"2026-05-18T00:44:37.342476Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:37.342476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.07234","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-18T00:44:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RN9zhPUEEAkrYUIkby83anfWMjtGQKnDonIn7/e54Or2pdKxJ+yE0yfn8NK0tAneLJbKrv7Ku/Ez6vojxi01DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:04:59.977792Z"},"content_sha256":"33f1a493678ef9070091192ca48d77eb016b72af67424a6ec9deb77ee0427171","schema_version":"1.0","event_id":"sha256:33f1a493678ef9070091192ca48d77eb016b72af67424a6ec9deb77ee0427171"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:CAJIJHFM5WYHETPF3KITDTBXY4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing Linear Transformations with Unreliable Components","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.IT"],"primary_cat":"cs.IT","authors_text":"Pulkit Grover, Soummya Kar, Yaoqing Yang","submitted_at":"2015-06-24T04:03:13Z","abstract_excerpt":"We consider the problem of computing a binary linear transformation using unreliable components when all circuit components are unreliable. Two noise models of unreliable components are considered: probabilistic errors and permanent errors. We introduce the \"ENCODED\" technique that ensures that the error probability of the computation of the linear transformation is kept bounded below a small constant independent of the size of the linear transformation even when all logic gates in the computation are noisy. Further, we show that the scheme requires fewer operations (in order sense) than its \""},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.07234","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-18T00:44:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ebNjVYRNZG3TEObDLjU+AjfNp3Akrix/Xg4HxapKH4SoeGC1a8ektQ+pf9WbkLlD6xwKmMkNypKDxIcZfhx5Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:04:59.978144Z"},"content_sha256":"d048c9e4579a682ace821efde31211b3c9f85ee56918fae53fae2094ee07a6ea","schema_version":"1.0","event_id":"sha256:d048c9e4579a682ace821efde31211b3c9f85ee56918fae53fae2094ee07a6ea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CAJIJHFM5WYHETPF3KITDTBXY4/bundle.json","state_url":"https://pith.science/pith/CAJIJHFM5WYHETPF3KITDTBXY4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CAJIJHFM5WYHETPF3KITDTBXY4/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-01T10:04:59Z","links":{"resolver":"https://pith.science/pith/CAJIJHFM5WYHETPF3KITDTBXY4","bundle":"https://pith.science/pith/CAJIJHFM5WYHETPF3KITDTBXY4/bundle.json","state":"https://pith.science/pith/CAJIJHFM5WYHETPF3KITDTBXY4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CAJIJHFM5WYHETPF3KITDTBXY4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:CAJIJHFM5WYHETPF3KITDTBXY4","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":"52557b30adbd684192756a104c7e302827963dd5ad48b595111ce57f5de5ff49","cross_cats_sorted":["cs.CC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-24T04:03:13Z","title_canon_sha256":"f47a176fdc8bbfbe6f01da099bdd4297717a8115e1bced2c11dfe4f631792f12"},"schema_version":"1.0","source":{"id":"1506.07234","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.07234","created_at":"2026-05-18T00:44:37Z"},{"alias_kind":"arxiv_version","alias_value":"1506.07234v3","created_at":"2026-05-18T00:44:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.07234","created_at":"2026-05-18T00:44:37Z"},{"alias_kind":"pith_short_12","alias_value":"CAJIJHFM5WYH","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"CAJIJHFM5WYHETPF","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"CAJIJHFM","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:d048c9e4579a682ace821efde31211b3c9f85ee56918fae53fae2094ee07a6ea","target":"graph","created_at":"2026-05-18T00:44:37Z","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 consider the problem of computing a binary linear transformation using unreliable components when all circuit components are unreliable. Two noise models of unreliable components are considered: probabilistic errors and permanent errors. We introduce the \"ENCODED\" technique that ensures that the error probability of the computation of the linear transformation is kept bounded below a small constant independent of the size of the linear transformation even when all logic gates in the computation are noisy. Further, we show that the scheme requires fewer operations (in order sense) than its \"","authors_text":"Pulkit Grover, Soummya Kar, Yaoqing Yang","cross_cats":["cs.CC","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-24T04:03:13Z","title":"Computing Linear Transformations with Unreliable Components"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.07234","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:33f1a493678ef9070091192ca48d77eb016b72af67424a6ec9deb77ee0427171","target":"record","created_at":"2026-05-18T00:44:37Z","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":"52557b30adbd684192756a104c7e302827963dd5ad48b595111ce57f5de5ff49","cross_cats_sorted":["cs.CC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-24T04:03:13Z","title_canon_sha256":"f47a176fdc8bbfbe6f01da099bdd4297717a8115e1bced2c11dfe4f631792f12"},"schema_version":"1.0","source":{"id":"1506.07234","kind":"arxiv","version":3}},"canonical_sha256":"1012849cacedb0724de5da9131cc37c719b817e9e52bdcdeac13f7991483db8c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1012849cacedb0724de5da9131cc37c719b817e9e52bdcdeac13f7991483db8c","first_computed_at":"2026-05-18T00:44:37.342476Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:37.342476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gh9+UQZHJxbtjRj/LwwPsaxBiMiWNrJS/13yWi5Nb6M1Rzfj7TGboluKJObZwTsxQZbWJwSzhSkSlygrghA8Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:37.343147Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.07234","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33f1a493678ef9070091192ca48d77eb016b72af67424a6ec9deb77ee0427171","sha256:d048c9e4579a682ace821efde31211b3c9f85ee56918fae53fae2094ee07a6ea"],"state_sha256":"2c88be4cb0a0ca8d6096d02582361a727c7f2ac593ec862ec68c6dfd8947fcc2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wRAW+Pmovdk6ZRjSqcOshSFi16s3np/0AMwUsE/rreLgUg719uYMq+GMZCMrSZnzc+dGrisDxztQMykP2opGBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T10:04:59.980503Z","bundle_sha256":"d1f3a96b039528563cc0ea4c43151f7fa31e6e5d573d2fa3d510f268752f52e5"}}