{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:RDUR4AIZN3X7DOMVGMZHEB5BMF","short_pith_number":"pith:RDUR4AIZ","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"},"canonical_sha256":"88e91e01196eeff1b99533327207a161563bdedb4d6353eb843cf95597d6a848","source":{"kind":"arxiv","id":"1108.6293","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.6293","created_at":"2026-05-18T04:12:10Z"},{"alias_kind":"arxiv_version","alias_value":"1108.6293v3","created_at":"2026-05-18T04:12:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.6293","created_at":"2026-05-18T04:12:10Z"},{"alias_kind":"pith_short_12","alias_value":"RDUR4AIZN3X7","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"RDUR4AIZN3X7DOMV","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"RDUR4AIZ","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:RDUR4AIZN3X7DOMVGMZHEB5BMF","target":"record","payload":{"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"},"canonical_sha256":"88e91e01196eeff1b99533327207a161563bdedb4d6353eb843cf95597d6a848","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"},"source_kind":"arxiv","source_id":"1108.6293","source_version":3,"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-18T04:12:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7bFTiwbz4h47r0S1SwbZDARdseE7LZzbbQSgTBDzsETIu8PJ17tWS+R1PFrV+oDAsTQeoYkLlFwnYVkQCm4CAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:33:31.823282Z"},"content_sha256":"8bc97587fa5a98b339c6c45cb63cc8c445bbcf11848f43157b06003da96c731f","schema_version":"1.0","event_id":"sha256:8bc97587fa5a98b339c6c45cb63cc8c445bbcf11848f43157b06003da96c731f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:RDUR4AIZN3X7DOMVGMZHEB5BMF","target":"graph","payload":{"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"},"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-18T04:12:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"23FQ663Te+6Wr4T+kea22qaZyjtGuUm9UiQ9eGg6s/jhsaSobMJ4m/UdMItgCn/3SUI0+iCnJnlhH7O4Fo3iDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:33:31.823642Z"},"content_sha256":"bd289d49fd46485597511f73a2808e652a099a25d6106f14acd64810d1f82461","schema_version":"1.0","event_id":"sha256:bd289d49fd46485597511f73a2808e652a099a25d6106f14acd64810d1f82461"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RDUR4AIZN3X7DOMVGMZHEB5BMF/bundle.json","state_url":"https://pith.science/pith/RDUR4AIZN3X7DOMVGMZHEB5BMF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RDUR4AIZN3X7DOMVGMZHEB5BMF/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-28T09:33:31Z","links":{"resolver":"https://pith.science/pith/RDUR4AIZN3X7DOMVGMZHEB5BMF","bundle":"https://pith.science/pith/RDUR4AIZN3X7DOMVGMZHEB5BMF/bundle.json","state":"https://pith.science/pith/RDUR4AIZN3X7DOMVGMZHEB5BMF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RDUR4AIZN3X7DOMVGMZHEB5BMF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:RDUR4AIZN3X7DOMVGMZHEB5BMF","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":"f77101163346da82045d737847a9f61adb6acb45d0c97ce081c62a0415085472","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MM","submitted_at":"2011-08-31T17:22:23Z","title_canon_sha256":"af655180f82febb3435d9540ccab0930675258b2519ac8b8c2973017ce66aaff"},"schema_version":"1.0","source":{"id":"1108.6293","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.6293","created_at":"2026-05-18T04:12:10Z"},{"alias_kind":"arxiv_version","alias_value":"1108.6293v3","created_at":"2026-05-18T04:12:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.6293","created_at":"2026-05-18T04:12:10Z"},{"alias_kind":"pith_short_12","alias_value":"RDUR4AIZN3X7","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"RDUR4AIZN3X7DOMV","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"RDUR4AIZ","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:bd289d49fd46485597511f73a2808e652a099a25d6106f14acd64810d1f82461","target":"graph","created_at":"2026-05-18T04:12:10Z","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":"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","authors_text":"changjia chen, chunxi li, DahMing Chiu","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MM","submitted_at":"2011-08-31T17:22:23Z","title":"Buffer Map Message Compression Based on Relevant Window in P2P Streaming Media System"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.6293","kind":"arxiv","version":3},"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:8bc97587fa5a98b339c6c45cb63cc8c445bbcf11848f43157b06003da96c731f","target":"record","created_at":"2026-05-18T04:12:10Z","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":"f77101163346da82045d737847a9f61adb6acb45d0c97ce081c62a0415085472","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MM","submitted_at":"2011-08-31T17:22:23Z","title_canon_sha256":"af655180f82febb3435d9540ccab0930675258b2519ac8b8c2973017ce66aaff"},"schema_version":"1.0","source":{"id":"1108.6293","kind":"arxiv","version":3}},"canonical_sha256":"88e91e01196eeff1b99533327207a161563bdedb4d6353eb843cf95597d6a848","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88e91e01196eeff1b99533327207a161563bdedb4d6353eb843cf95597d6a848","first_computed_at":"2026-05-18T04:12:10.061365Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:12:10.061365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"J3iLKPMXdgTd+WX3CBkJ5kxaTLERYS/V1qu8gzJJXu79q1BBIP8PA4kVYCwaEUbAapLl8KafaKv1ETh0hrzvBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:12:10.062034Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.6293","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8bc97587fa5a98b339c6c45cb63cc8c445bbcf11848f43157b06003da96c731f","sha256:bd289d49fd46485597511f73a2808e652a099a25d6106f14acd64810d1f82461"],"state_sha256":"bf8ccd51511784d407c58873385ea9f9e94fbc3a43033423d3b8d21483333a3a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hbLhxzRy3LZf9JR+5zef+Ls2XaM0yeIdOhqjeiKy3amtRBmc5F5wy2ZG7d2+spqsCl08bf+RqzkBKrFa9qq+CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T09:33:31.825626Z","bundle_sha256":"d6bfe1f881094980796659a436268694295e75bc0168bb5bfcf2cb22198f76dc"}}