{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:YBLTKEBYG36ENPBKBT264TTCL6","short_pith_number":"pith:YBLTKEBY","canonical_record":{"source":{"id":"1311.1372","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-06T12:58:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e4414db5f08f59dff76d9db00e89936d02950e062a18f5ba6967747d21af0101","abstract_canon_sha256":"f87c4b6397cc3ab018dcbc37505b6ee7de78813e81281f8c010e8c1b84492909"},"schema_version":"1.0"},"canonical_sha256":"c05735103836fc46bc2a0cf5ee4e625fbcd4a899a72934e0bb5be97e40fd9281","source":{"kind":"arxiv","id":"1311.1372","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.1372","created_at":"2026-05-18T03:07:53Z"},{"alias_kind":"arxiv_version","alias_value":"1311.1372v1","created_at":"2026-05-18T03:07:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.1372","created_at":"2026-05-18T03:07:53Z"},{"alias_kind":"pith_short_12","alias_value":"YBLTKEBYG36E","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"YBLTKEBYG36ENPBK","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"YBLTKEBY","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:YBLTKEBYG36ENPBKBT264TTCL6","target":"record","payload":{"canonical_record":{"source":{"id":"1311.1372","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-06T12:58:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e4414db5f08f59dff76d9db00e89936d02950e062a18f5ba6967747d21af0101","abstract_canon_sha256":"f87c4b6397cc3ab018dcbc37505b6ee7de78813e81281f8c010e8c1b84492909"},"schema_version":"1.0"},"canonical_sha256":"c05735103836fc46bc2a0cf5ee4e625fbcd4a899a72934e0bb5be97e40fd9281","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:53.543267Z","signature_b64":"eVg0qlcGlgDERlBKFZzPP9GuoRK7wzHJHc5r0JSflGjn8JfPTGTGDsNcEY3VjQHq0IlgO2ZBr01i/Yq3HxCRCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c05735103836fc46bc2a0cf5ee4e625fbcd4a899a72934e0bb5be97e40fd9281","last_reissued_at":"2026-05-18T03:07:53.542482Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:53.542482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.1372","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-18T03:07:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8zquoTYcaYpU7t15ZeefQ9t5kFfYcOx1u4Fk7OM7u9vIKENhIXKdBMnuzItPFrJMW5DTFreJtDwfJvINjWQ1Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T11:08:16.451979Z"},"content_sha256":"4198e52ed739cab28c36a440e5803accac8d88aef3af6b9fcf77a9715d388ecc","schema_version":"1.0","event_id":"sha256:4198e52ed739cab28c36a440e5803accac8d88aef3af6b9fcf77a9715d388ecc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:YBLTKEBYG36ENPBKBT264TTCL6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum-Variance Importance-Sampling Bernoulli Estimator for Fast Simulation of Linear Block Codes over Binary Symmetric Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Domenico Ciuonzo, Gianmarco Romano","submitted_at":"2013-11-06T12:58:57Z","abstract_excerpt":"In this paper the choice of the Bernoulli distribution as biased distribution for importance sampling (IS) Monte-Carlo (MC) simulation of linear block codes over binary symmetric channels (BSCs) is studied. Based on the analytical derivation of the optimal IS Bernoulli distribution, with explicit calculation of the variance of the corresponding IS estimator, two novel algorithms for fast-simulation of linear block codes are proposed. For sufficiently high signal-to-noise ratios (SNRs) one of the proposed algorithm is SNR-invariant, i.e. the IS estimator does not depend on the cross-over probab"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.1372","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-18T03:07:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qtIYmwL83p6o0BspPQaSgN0pBJxqJQ3q+6rqGo96aNaGOgCRbXQytsGZxnPF/oJ+F66OlUlxW62tWc7+IMlBCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T11:08:16.452339Z"},"content_sha256":"50a06aa3639304ba4b8fd96c444752ae6290bbbed0fed9b734137fdacee975bc","schema_version":"1.0","event_id":"sha256:50a06aa3639304ba4b8fd96c444752ae6290bbbed0fed9b734137fdacee975bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YBLTKEBYG36ENPBKBT264TTCL6/bundle.json","state_url":"https://pith.science/pith/YBLTKEBYG36ENPBKBT264TTCL6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YBLTKEBYG36ENPBKBT264TTCL6/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-07-01T11:08:16Z","links":{"resolver":"https://pith.science/pith/YBLTKEBYG36ENPBKBT264TTCL6","bundle":"https://pith.science/pith/YBLTKEBYG36ENPBKBT264TTCL6/bundle.json","state":"https://pith.science/pith/YBLTKEBYG36ENPBKBT264TTCL6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YBLTKEBYG36ENPBKBT264TTCL6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:YBLTKEBYG36ENPBKBT264TTCL6","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":"f87c4b6397cc3ab018dcbc37505b6ee7de78813e81281f8c010e8c1b84492909","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-06T12:58:57Z","title_canon_sha256":"e4414db5f08f59dff76d9db00e89936d02950e062a18f5ba6967747d21af0101"},"schema_version":"1.0","source":{"id":"1311.1372","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.1372","created_at":"2026-05-18T03:07:53Z"},{"alias_kind":"arxiv_version","alias_value":"1311.1372v1","created_at":"2026-05-18T03:07:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.1372","created_at":"2026-05-18T03:07:53Z"},{"alias_kind":"pith_short_12","alias_value":"YBLTKEBYG36E","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"YBLTKEBYG36ENPBK","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"YBLTKEBY","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:50a06aa3639304ba4b8fd96c444752ae6290bbbed0fed9b734137fdacee975bc","target":"graph","created_at":"2026-05-18T03:07:53Z","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 the choice of the Bernoulli distribution as biased distribution for importance sampling (IS) Monte-Carlo (MC) simulation of linear block codes over binary symmetric channels (BSCs) is studied. Based on the analytical derivation of the optimal IS Bernoulli distribution, with explicit calculation of the variance of the corresponding IS estimator, two novel algorithms for fast-simulation of linear block codes are proposed. For sufficiently high signal-to-noise ratios (SNRs) one of the proposed algorithm is SNR-invariant, i.e. the IS estimator does not depend on the cross-over probab","authors_text":"Domenico Ciuonzo, Gianmarco Romano","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-06T12:58:57Z","title":"Minimum-Variance Importance-Sampling Bernoulli Estimator for Fast Simulation of Linear Block Codes over Binary Symmetric Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.1372","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:4198e52ed739cab28c36a440e5803accac8d88aef3af6b9fcf77a9715d388ecc","target":"record","created_at":"2026-05-18T03:07:53Z","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":"f87c4b6397cc3ab018dcbc37505b6ee7de78813e81281f8c010e8c1b84492909","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-06T12:58:57Z","title_canon_sha256":"e4414db5f08f59dff76d9db00e89936d02950e062a18f5ba6967747d21af0101"},"schema_version":"1.0","source":{"id":"1311.1372","kind":"arxiv","version":1}},"canonical_sha256":"c05735103836fc46bc2a0cf5ee4e625fbcd4a899a72934e0bb5be97e40fd9281","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c05735103836fc46bc2a0cf5ee4e625fbcd4a899a72934e0bb5be97e40fd9281","first_computed_at":"2026-05-18T03:07:53.542482Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:07:53.542482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eVg0qlcGlgDERlBKFZzPP9GuoRK7wzHJHc5r0JSflGjn8JfPTGTGDsNcEY3VjQHq0IlgO2ZBr01i/Yq3HxCRCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:07:53.543267Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.1372","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4198e52ed739cab28c36a440e5803accac8d88aef3af6b9fcf77a9715d388ecc","sha256:50a06aa3639304ba4b8fd96c444752ae6290bbbed0fed9b734137fdacee975bc"],"state_sha256":"a349025c2c8aecc2fa26bf52b6b96fbcf36cb3afce0cd508483dbbeee25ee03b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ODVTjKVNDxZXswKP+y5nFSb0RADQ/4JhodfuENzrvPU6qo+QlgU8rk5JPDgKvE/lPbu59laZ7o7VGOcqu0bYCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T11:08:16.454401Z","bundle_sha256":"ad4aa92684ba1582e0354376aa585063068a55b89e3b654b223a0b23b0688505"}}