{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:5SGCHL6A4ASYXTKMVEJPDQCJPC","short_pith_number":"pith:5SGCHL6A","canonical_record":{"source":{"id":"1208.3235","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-15T22:11:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"15e016c7ef801e83e2b7be2b6807256765f487b64a338829d57a9a4ab43d4164","abstract_canon_sha256":"061c142a644c37a54340ec12bdcdffa4856a9a34a057faa44e742fceb9de38ca"},"schema_version":"1.0"},"canonical_sha256":"ec8c23afc0e0258bcd4ca912f1c04978a858dee5cfc03b996ac6ce50ace91616","source":{"kind":"arxiv","id":"1208.3235","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.3235","created_at":"2026-05-18T03:13:58Z"},{"alias_kind":"arxiv_version","alias_value":"1208.3235v2","created_at":"2026-05-18T03:13:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.3235","created_at":"2026-05-18T03:13:58Z"},{"alias_kind":"pith_short_12","alias_value":"5SGCHL6A4ASY","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"5SGCHL6A4ASYXTKM","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"5SGCHL6A","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:5SGCHL6A4ASYXTKMVEJPDQCJPC","target":"record","payload":{"canonical_record":{"source":{"id":"1208.3235","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-15T22:11:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"15e016c7ef801e83e2b7be2b6807256765f487b64a338829d57a9a4ab43d4164","abstract_canon_sha256":"061c142a644c37a54340ec12bdcdffa4856a9a34a057faa44e742fceb9de38ca"},"schema_version":"1.0"},"canonical_sha256":"ec8c23afc0e0258bcd4ca912f1c04978a858dee5cfc03b996ac6ce50ace91616","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:58.376980Z","signature_b64":"+uljkSgpQRdjrNfX4iBqnaUdbKZtWkM0nlfokYo00Gv0SDNnAiaU+IKWBjnyTTkE8Y36Bf5l2X6rsxvpxJYRAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec8c23afc0e0258bcd4ca912f1c04978a858dee5cfc03b996ac6ce50ace91616","last_reissued_at":"2026-05-18T03:13:58.376270Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:58.376270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.3235","source_version":2,"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:13:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GQMh2YuGvYSVPApCjUIvSTEBSRMIIKegPMZx9FFzxnevv7jbN0VXvtHmwuNnmvLE/msPwMWwaVG41OwwGO5GBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:49:38.852589Z"},"content_sha256":"f30e579f8f1257a0b3436c0db8b69b0fc6da5df35639f13e5a66de7b5a9e4561","schema_version":"1.0","event_id":"sha256:f30e579f8f1257a0b3436c0db8b69b0fc6da5df35639f13e5a66de7b5a9e4561"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:5SGCHL6A4ASYXTKMVEJPDQCJPC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"First-Passage Time and Large-Deviation Analysis for Erasure Channels with Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Henry D. Pfister, Jean-Francois Chamberland, Santhosh Kumar","submitted_at":"2012-08-15T22:11:32Z","abstract_excerpt":"This article considers the performance of digital communication systems transmitting messages over finite-state erasure channels with memory. Information bits are protected from channel erasures using error-correcting codes; successful receptions of codewords are acknowledged at the source through instantaneous feedback. The primary focus of this research is on delay-sensitive applications, codes with finite block lengths and, necessarily, non-vanishing probabilities of decoding failure. The contribution of this article is twofold. A methodology to compute the distribution of the time required"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.3235","kind":"arxiv","version":2},"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:13:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rAdSqtPBhpulE61Op+Toaw5Iz/CIEbn068qzRQyhTYOjUAPAVsbNSt4xg4xhiIdt79BNWOZ++sft/gjQq+j7Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:49:38.853103Z"},"content_sha256":"ae53367ba16b3ad6965efa0c5a99c319a33aacfbf0a7d50cfa7fa293c33dfdab","schema_version":"1.0","event_id":"sha256:ae53367ba16b3ad6965efa0c5a99c319a33aacfbf0a7d50cfa7fa293c33dfdab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5SGCHL6A4ASYXTKMVEJPDQCJPC/bundle.json","state_url":"https://pith.science/pith/5SGCHL6A4ASYXTKMVEJPDQCJPC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5SGCHL6A4ASYXTKMVEJPDQCJPC/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-05-27T13:49:38Z","links":{"resolver":"https://pith.science/pith/5SGCHL6A4ASYXTKMVEJPDQCJPC","bundle":"https://pith.science/pith/5SGCHL6A4ASYXTKMVEJPDQCJPC/bundle.json","state":"https://pith.science/pith/5SGCHL6A4ASYXTKMVEJPDQCJPC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5SGCHL6A4ASYXTKMVEJPDQCJPC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:5SGCHL6A4ASYXTKMVEJPDQCJPC","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":"061c142a644c37a54340ec12bdcdffa4856a9a34a057faa44e742fceb9de38ca","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-15T22:11:32Z","title_canon_sha256":"15e016c7ef801e83e2b7be2b6807256765f487b64a338829d57a9a4ab43d4164"},"schema_version":"1.0","source":{"id":"1208.3235","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.3235","created_at":"2026-05-18T03:13:58Z"},{"alias_kind":"arxiv_version","alias_value":"1208.3235v2","created_at":"2026-05-18T03:13:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.3235","created_at":"2026-05-18T03:13:58Z"},{"alias_kind":"pith_short_12","alias_value":"5SGCHL6A4ASY","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"5SGCHL6A4ASYXTKM","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"5SGCHL6A","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:ae53367ba16b3ad6965efa0c5a99c319a33aacfbf0a7d50cfa7fa293c33dfdab","target":"graph","created_at":"2026-05-18T03:13:58Z","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":"This article considers the performance of digital communication systems transmitting messages over finite-state erasure channels with memory. Information bits are protected from channel erasures using error-correcting codes; successful receptions of codewords are acknowledged at the source through instantaneous feedback. The primary focus of this research is on delay-sensitive applications, codes with finite block lengths and, necessarily, non-vanishing probabilities of decoding failure. The contribution of this article is twofold. A methodology to compute the distribution of the time required","authors_text":"Henry D. Pfister, Jean-Francois Chamberland, Santhosh Kumar","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-15T22:11:32Z","title":"First-Passage Time and Large-Deviation Analysis for Erasure Channels with Memory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.3235","kind":"arxiv","version":2},"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:f30e579f8f1257a0b3436c0db8b69b0fc6da5df35639f13e5a66de7b5a9e4561","target":"record","created_at":"2026-05-18T03:13:58Z","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":"061c142a644c37a54340ec12bdcdffa4856a9a34a057faa44e742fceb9de38ca","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-15T22:11:32Z","title_canon_sha256":"15e016c7ef801e83e2b7be2b6807256765f487b64a338829d57a9a4ab43d4164"},"schema_version":"1.0","source":{"id":"1208.3235","kind":"arxiv","version":2}},"canonical_sha256":"ec8c23afc0e0258bcd4ca912f1c04978a858dee5cfc03b996ac6ce50ace91616","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec8c23afc0e0258bcd4ca912f1c04978a858dee5cfc03b996ac6ce50ace91616","first_computed_at":"2026-05-18T03:13:58.376270Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:13:58.376270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+uljkSgpQRdjrNfX4iBqnaUdbKZtWkM0nlfokYo00Gv0SDNnAiaU+IKWBjnyTTkE8Y36Bf5l2X6rsxvpxJYRAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:13:58.376980Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.3235","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f30e579f8f1257a0b3436c0db8b69b0fc6da5df35639f13e5a66de7b5a9e4561","sha256:ae53367ba16b3ad6965efa0c5a99c319a33aacfbf0a7d50cfa7fa293c33dfdab"],"state_sha256":"3b0abcfa46312b55f6ec5fdf7c76a96350dc9ce92398372eda5a834c3e6ce0c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yJclFucb5B6k2FrLONcb5m27e8rNZwA9UIyUv3ibaZXIyGQd+4oHWKOsccIbAHgTnV1H5kfrJZacMtD2NLhjBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T13:49:38.855708Z","bundle_sha256":"a6f1ec4cda88ab422cd8632598ce5774d9edaa1764f26326959d651926199778"}}