{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:XCDG4NZUXGFPRXXSJRA2BN2T7T","short_pith_number":"pith:XCDG4NZU","canonical_record":{"source":{"id":"1109.4599","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-21T18:01:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"df1979bc5e3f7ac6fbb58aa8dcbccf86cb8ad2d59111a35ae5f91ac1812aa75d","abstract_canon_sha256":"96db95a9432dd1470590ec77447f619c28018bc9fe5b1775544d53702235fb51"},"schema_version":"1.0"},"canonical_sha256":"b8866e3734b98af8def24c41a0b753fce4dcefbc1645fbf9a11b62b3cf0ab871","source":{"kind":"arxiv","id":"1109.4599","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.4599","created_at":"2026-05-18T03:57:24Z"},{"alias_kind":"arxiv_version","alias_value":"1109.4599v2","created_at":"2026-05-18T03:57:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.4599","created_at":"2026-05-18T03:57:24Z"},{"alias_kind":"pith_short_12","alias_value":"XCDG4NZUXGFP","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"XCDG4NZUXGFPRXXS","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"XCDG4NZU","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:XCDG4NZUXGFPRXXSJRA2BN2T7T","target":"record","payload":{"canonical_record":{"source":{"id":"1109.4599","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-21T18:01:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"df1979bc5e3f7ac6fbb58aa8dcbccf86cb8ad2d59111a35ae5f91ac1812aa75d","abstract_canon_sha256":"96db95a9432dd1470590ec77447f619c28018bc9fe5b1775544d53702235fb51"},"schema_version":"1.0"},"canonical_sha256":"b8866e3734b98af8def24c41a0b753fce4dcefbc1645fbf9a11b62b3cf0ab871","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:24.882649Z","signature_b64":"hTynBtZPKtCfvnmfyqEz1OMUAINoH4vB1bahqgjSVj3kXMYcSacS+dcCXpeFZzAA1lMLBFAHhNxpbeoAidL6Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8866e3734b98af8def24c41a0b753fce4dcefbc1645fbf9a11b62b3cf0ab871","last_reissued_at":"2026-05-18T03:57:24.881934Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:24.881934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.4599","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:57:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eWYtAy3CTJhCz8g1kVvECpr3fq5EbKDxqQG5/JG6AEGqH72e2Yg/T6vv6av9yNu999kprkzQcU7pHqHNf8uZAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T12:40:20.687454Z"},"content_sha256":"7cf2ff57e09a714ce44807249e7c90c22ef31426e7c8bcbecd1198fdd64734f7","schema_version":"1.0","event_id":"sha256:7cf2ff57e09a714ce44807249e7c90c22ef31426e7c8bcbecd1198fdd64734f7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:XCDG4NZUXGFPRXXSJRA2BN2T7T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Diversity Order and Coding Gain of Multi-Source Multi-Relay Cooperative Wireless Networks with Binary Network Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fabio Graziosi, Marco Di Renzo, Michela Iezzi","submitted_at":"2011-09-21T18:01:31Z","abstract_excerpt":"In this paper, a multi-source multi-relay cooperative wireless network with binary modulation and binary network coding is studied. The system model encompasses: i) a demodulate-and-forward protocol at the relays, where the received packets are forwarded regardless of their reliability; and ii) a maximum-likelihood optimum demodulator at the destination, which accounts for possible demodulations errors at the relays. An asymptotically-tight and closed-form expression of the end-to-end error probability is derived, which clearly showcases diversity order and coding gain of each source. Unlike o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.4599","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:57:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CxLFPWdGgqYD1gb5gi4p5Y84X4bLyvYinLInSFZrYvO5Zbpevs6yeinCCLAHW4jE41NqR/4tv9Vj0FFWCJPcAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T12:40:20.688008Z"},"content_sha256":"df5fa075de6554104bd753c972f0dbc9f62f12804baabd5ecf021ee7911b36df","schema_version":"1.0","event_id":"sha256:df5fa075de6554104bd753c972f0dbc9f62f12804baabd5ecf021ee7911b36df"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XCDG4NZUXGFPRXXSJRA2BN2T7T/bundle.json","state_url":"https://pith.science/pith/XCDG4NZUXGFPRXXSJRA2BN2T7T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XCDG4NZUXGFPRXXSJRA2BN2T7T/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-24T12:40:20Z","links":{"resolver":"https://pith.science/pith/XCDG4NZUXGFPRXXSJRA2BN2T7T","bundle":"https://pith.science/pith/XCDG4NZUXGFPRXXSJRA2BN2T7T/bundle.json","state":"https://pith.science/pith/XCDG4NZUXGFPRXXSJRA2BN2T7T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XCDG4NZUXGFPRXXSJRA2BN2T7T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:XCDG4NZUXGFPRXXSJRA2BN2T7T","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":"96db95a9432dd1470590ec77447f619c28018bc9fe5b1775544d53702235fb51","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-21T18:01:31Z","title_canon_sha256":"df1979bc5e3f7ac6fbb58aa8dcbccf86cb8ad2d59111a35ae5f91ac1812aa75d"},"schema_version":"1.0","source":{"id":"1109.4599","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.4599","created_at":"2026-05-18T03:57:24Z"},{"alias_kind":"arxiv_version","alias_value":"1109.4599v2","created_at":"2026-05-18T03:57:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.4599","created_at":"2026-05-18T03:57:24Z"},{"alias_kind":"pith_short_12","alias_value":"XCDG4NZUXGFP","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"XCDG4NZUXGFPRXXS","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"XCDG4NZU","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:df5fa075de6554104bd753c972f0dbc9f62f12804baabd5ecf021ee7911b36df","target":"graph","created_at":"2026-05-18T03:57:24Z","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, a multi-source multi-relay cooperative wireless network with binary modulation and binary network coding is studied. The system model encompasses: i) a demodulate-and-forward protocol at the relays, where the received packets are forwarded regardless of their reliability; and ii) a maximum-likelihood optimum demodulator at the destination, which accounts for possible demodulations errors at the relays. An asymptotically-tight and closed-form expression of the end-to-end error probability is derived, which clearly showcases diversity order and coding gain of each source. Unlike o","authors_text":"Fabio Graziosi, Marco Di Renzo, Michela Iezzi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-21T18:01:31Z","title":"On the Diversity Order and Coding Gain of Multi-Source Multi-Relay Cooperative Wireless Networks with Binary Network Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.4599","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:7cf2ff57e09a714ce44807249e7c90c22ef31426e7c8bcbecd1198fdd64734f7","target":"record","created_at":"2026-05-18T03:57:24Z","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":"96db95a9432dd1470590ec77447f619c28018bc9fe5b1775544d53702235fb51","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-21T18:01:31Z","title_canon_sha256":"df1979bc5e3f7ac6fbb58aa8dcbccf86cb8ad2d59111a35ae5f91ac1812aa75d"},"schema_version":"1.0","source":{"id":"1109.4599","kind":"arxiv","version":2}},"canonical_sha256":"b8866e3734b98af8def24c41a0b753fce4dcefbc1645fbf9a11b62b3cf0ab871","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8866e3734b98af8def24c41a0b753fce4dcefbc1645fbf9a11b62b3cf0ab871","first_computed_at":"2026-05-18T03:57:24.881934Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:57:24.881934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hTynBtZPKtCfvnmfyqEz1OMUAINoH4vB1bahqgjSVj3kXMYcSacS+dcCXpeFZzAA1lMLBFAHhNxpbeoAidL6Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T03:57:24.882649Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.4599","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7cf2ff57e09a714ce44807249e7c90c22ef31426e7c8bcbecd1198fdd64734f7","sha256:df5fa075de6554104bd753c972f0dbc9f62f12804baabd5ecf021ee7911b36df"],"state_sha256":"56bffd66d8ca1cce0aad9b7fa14e776aefe10a49c77058a94bbb9e90df0fa03d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TpeZg6MRiW23pE7/jEQ1/tViCq/4c2mOiLnZhZmCTW2yyPz2tlG8u3yPeg2+NYEbJyslHfnleBHXU6WRuzqaDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T12:40:20.690709Z","bundle_sha256":"f9f084ad6fb74add2c19d813e759838282df7016b909554a6ae893a3589ca1d0"}}