{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:RDUR4AIZN3X7DOMVGMZHEB5BMF","short_pith_number":"pith:RDUR4AIZ","schema_version":"1.0","canonical_sha256":"88e91e01196eeff1b99533327207a161563bdedb4d6353eb843cf95597d6a848","source":{"kind":"arxiv","id":"1108.6293","version":3},"attestation_state":"computed","paper":{"title":"Buffer Map Message Compression Based on Relevant Window in P2P Streaming Media System","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.MM","authors_text":"changjia chen, chunxi li, DahMing Chiu","submitted_at":"2011-08-31T17:22:23Z","abstract_excerpt":"Popular peer to peer streaming media systems such as PPLive and UUSee rely on periodic buffer-map exchange between peers for proper operation. The buffer-map exchange contains redundant information which causes non-negligible overhead. In this paper we present a theoretical framework to study how the overhead can be lowered. Differentiating from the traditional data compression approach, we do not treat each buffer-map as an isolated data block, but consider the correlations between the sequentially exchanged buffer-maps. Under this framework, two buffer-map compression schemes are proposed an"},"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":"1108.6293","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MM","submitted_at":"2011-08-31T17:22:23Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"af655180f82febb3435d9540ccab0930675258b2519ac8b8c2973017ce66aaff","abstract_canon_sha256":"f77101163346da82045d737847a9f61adb6acb45d0c97ce081c62a0415085472"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:10.062034Z","signature_b64":"J3iLKPMXdgTd+WX3CBkJ5kxaTLERYS/V1qu8gzJJXu79q1BBIP8PA4kVYCwaEUbAapLl8KafaKv1ETh0hrzvBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88e91e01196eeff1b99533327207a161563bdedb4d6353eb843cf95597d6a848","last_reissued_at":"2026-05-18T04:12:10.061365Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:10.061365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Buffer Map Message Compression Based on Relevant Window in P2P Streaming Media System","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.MM","authors_text":"changjia chen, chunxi li, DahMing Chiu","submitted_at":"2011-08-31T17:22:23Z","abstract_excerpt":"Popular peer to peer streaming media systems such as PPLive and UUSee rely on periodic buffer-map exchange between peers for proper operation. The buffer-map exchange contains redundant information which causes non-negligible overhead. In this paper we present a theoretical framework to study how the overhead can be lowered. Differentiating from the traditional data compression approach, we do not treat each buffer-map as an isolated data block, but consider the correlations between the sequentially exchanged buffer-maps. Under this framework, two buffer-map compression schemes are proposed an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.6293","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1108.6293","created_at":"2026-05-18T04:12:10.061476+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.6293v3","created_at":"2026-05-18T04:12:10.061476+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.6293","created_at":"2026-05-18T04:12:10.061476+00:00"},{"alias_kind":"pith_short_12","alias_value":"RDUR4AIZN3X7","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"RDUR4AIZN3X7DOMV","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"RDUR4AIZ","created_at":"2026-05-18T12:26:41.206345+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/RDUR4AIZN3X7DOMVGMZHEB5BMF","json":"https://pith.science/pith/RDUR4AIZN3X7DOMVGMZHEB5BMF.json","graph_json":"https://pith.science/api/pith-number/RDUR4AIZN3X7DOMVGMZHEB5BMF/graph.json","events_json":"https://pith.science/api/pith-number/RDUR4AIZN3X7DOMVGMZHEB5BMF/events.json","paper":"https://pith.science/paper/RDUR4AIZ"},"agent_actions":{"view_html":"https://pith.science/pith/RDUR4AIZN3X7DOMVGMZHEB5BMF","download_json":"https://pith.science/pith/RDUR4AIZN3X7DOMVGMZHEB5BMF.json","view_paper":"https://pith.science/paper/RDUR4AIZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.6293&json=true","fetch_graph":"https://pith.science/api/pith-number/RDUR4AIZN3X7DOMVGMZHEB5BMF/graph.json","fetch_events":"https://pith.science/api/pith-number/RDUR4AIZN3X7DOMVGMZHEB5BMF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RDUR4AIZN3X7DOMVGMZHEB5BMF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RDUR4AIZN3X7DOMVGMZHEB5BMF/action/storage_attestation","attest_author":"https://pith.science/pith/RDUR4AIZN3X7DOMVGMZHEB5BMF/action/author_attestation","sign_citation":"https://pith.science/pith/RDUR4AIZN3X7DOMVGMZHEB5BMF/action/citation_signature","submit_replication":"https://pith.science/pith/RDUR4AIZN3X7DOMVGMZHEB5BMF/action/replication_record"}},"created_at":"2026-05-18T04:12:10.061476+00:00","updated_at":"2026-05-18T04:12:10.061476+00:00"}