{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:BE6RXKCW4RVZRWHHHKUTBT5VAB","short_pith_number":"pith:BE6RXKCW","schema_version":"1.0","canonical_sha256":"093d1ba856e46b98d8e73aa930cfb500772659a16cdb70c052ed7fe48835a529","source":{"kind":"arxiv","id":"1211.5358","version":5},"attestation_state":"computed","paper":{"title":"Stable XOR-based Policies for the Broadcast Erasure Channel with Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Leandros Tassiulas, Leonidas Georgiadis, Marios Gatzianas, Sophia Athanasiadou","submitted_at":"2012-11-22T19:33:47Z","abstract_excerpt":"In this paper we describe a network coding scheme for the Broadcast Erasure Channel with multiple unicast stochastic flows, in the case of a single source transmitting packets to $N$ users, where per-slot feedback is fed back to the transmitter in the form of ACK/NACK messages. This scheme performs only binary (XOR) operations and involves a network of queues, along with special rules for coding and moving packets among the queues, that ensure instantaneous decodability. The system under consideration belongs to a class of networks whose stability properties have been analyzed in earlier work,"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1211.5358","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-22T19:33:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b7f8c5f285c4be30290c0bb2133543ccbc1341bfdb3f312048c9309b9ce21dd2","abstract_canon_sha256":"06756f6c41b572f91a3e7d4a4031892c8b5c74f29cae4e918f255360691415eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:17.911185Z","signature_b64":"KNndloCG50zrO7tys3V9bfSDowK+DL0KNk2pkDGNnH9pFMq2LePpS1P9rmcMZ0GBI2PFxEdB2Go9C/iiSw3MAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"093d1ba856e46b98d8e73aa930cfb500772659a16cdb70c052ed7fe48835a529","last_reissued_at":"2026-05-18T00:58:17.910444Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:17.910444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stable XOR-based Policies for the Broadcast Erasure Channel with Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Leandros Tassiulas, Leonidas Georgiadis, Marios Gatzianas, Sophia Athanasiadou","submitted_at":"2012-11-22T19:33:47Z","abstract_excerpt":"In this paper we describe a network coding scheme for the Broadcast Erasure Channel with multiple unicast stochastic flows, in the case of a single source transmitting packets to $N$ users, where per-slot feedback is fed back to the transmitter in the form of ACK/NACK messages. This scheme performs only binary (XOR) operations and involves a network of queues, along with special rules for coding and moving packets among the queues, that ensure instantaneous decodability. The system under consideration belongs to a class of networks whose stability properties have been analyzed in earlier work,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.5358","kind":"arxiv","version":5},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1211.5358","created_at":"2026-05-18T00:58:17.910579+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.5358v5","created_at":"2026-05-18T00:58:17.910579+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.5358","created_at":"2026-05-18T00:58:17.910579+00:00"},{"alias_kind":"pith_short_12","alias_value":"BE6RXKCW4RVZ","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"BE6RXKCW4RVZRWHH","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"BE6RXKCW","created_at":"2026-05-18T12:26:58.693483+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BE6RXKCW4RVZRWHHHKUTBT5VAB","json":"https://pith.science/pith/BE6RXKCW4RVZRWHHHKUTBT5VAB.json","graph_json":"https://pith.science/api/pith-number/BE6RXKCW4RVZRWHHHKUTBT5VAB/graph.json","events_json":"https://pith.science/api/pith-number/BE6RXKCW4RVZRWHHHKUTBT5VAB/events.json","paper":"https://pith.science/paper/BE6RXKCW"},"agent_actions":{"view_html":"https://pith.science/pith/BE6RXKCW4RVZRWHHHKUTBT5VAB","download_json":"https://pith.science/pith/BE6RXKCW4RVZRWHHHKUTBT5VAB.json","view_paper":"https://pith.science/paper/BE6RXKCW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.5358&json=true","fetch_graph":"https://pith.science/api/pith-number/BE6RXKCW4RVZRWHHHKUTBT5VAB/graph.json","fetch_events":"https://pith.science/api/pith-number/BE6RXKCW4RVZRWHHHKUTBT5VAB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BE6RXKCW4RVZRWHHHKUTBT5VAB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BE6RXKCW4RVZRWHHHKUTBT5VAB/action/storage_attestation","attest_author":"https://pith.science/pith/BE6RXKCW4RVZRWHHHKUTBT5VAB/action/author_attestation","sign_citation":"https://pith.science/pith/BE6RXKCW4RVZRWHHHKUTBT5VAB/action/citation_signature","submit_replication":"https://pith.science/pith/BE6RXKCW4RVZRWHHHKUTBT5VAB/action/replication_record"}},"created_at":"2026-05-18T00:58:17.910579+00:00","updated_at":"2026-05-18T00:58:17.910579+00:00"}