{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:VDOZPZVKEDIFV3TOLXWJRIDBRZ","short_pith_number":"pith:VDOZPZVK","canonical_record":{"source":{"id":"1207.4711","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-19T15:42:24Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"717d022dfc3ad772eb4b1419b27bfc2b8d87608eb68041dbc5b710fa75bd5c57","abstract_canon_sha256":"c71bb345c774b9b7d4e4ab708826755b7e91ede28a36bcad35e62ca302e8bbe4"},"schema_version":"1.0"},"canonical_sha256":"a8dd97e6aa20d05aee6e5dec98a0618e7c0eeccbec9934178c0b65b7cf623624","source":{"kind":"arxiv","id":"1207.4711","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.4711","created_at":"2026-05-18T03:50:36Z"},{"alias_kind":"arxiv_version","alias_value":"1207.4711v1","created_at":"2026-05-18T03:50:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4711","created_at":"2026-05-18T03:50:36Z"},{"alias_kind":"pith_short_12","alias_value":"VDOZPZVKEDIF","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VDOZPZVKEDIFV3TO","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VDOZPZVK","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:VDOZPZVKEDIFV3TOLXWJRIDBRZ","target":"record","payload":{"canonical_record":{"source":{"id":"1207.4711","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-19T15:42:24Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"717d022dfc3ad772eb4b1419b27bfc2b8d87608eb68041dbc5b710fa75bd5c57","abstract_canon_sha256":"c71bb345c774b9b7d4e4ab708826755b7e91ede28a36bcad35e62ca302e8bbe4"},"schema_version":"1.0"},"canonical_sha256":"a8dd97e6aa20d05aee6e5dec98a0618e7c0eeccbec9934178c0b65b7cf623624","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:36.013859Z","signature_b64":"9I0VY5R46ukqmEgmU9RdEhWgFLiFjVniYi8J6bw94KjYNUM2m5idk1DOemzt8TQn1rEgN+0z3x/SxYNF+UdiDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8dd97e6aa20d05aee6e5dec98a0618e7c0eeccbec9934178c0b65b7cf623624","last_reissued_at":"2026-05-18T03:50:36.012930Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:36.012930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.4711","source_version":1,"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:50:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WDkVTyG8ZybdyMIdtMPeMzf0bR8kGT0x2A/1qw/NzIkIytWNdRQpZu2mTUY1hF6L2TO31UyOP+bTBV9iXA3ABQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T03:49:37.119546Z"},"content_sha256":"091600716f0086257b17f5c75e1dc54320d7d473186c09eaa1bbf4fda3ac50f9","schema_version":"1.0","event_id":"sha256:091600716f0086257b17f5c75e1dc54320d7d473186c09eaa1bbf4fda3ac50f9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:VDOZPZVKEDIFV3TOLXWJRIDBRZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Feedback-Based Scheduling Policies for Chunked Network Codes over Networks with Loss and Delay","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Amir H. Banihashemi, Anoosheh Heidarzadeh","submitted_at":"2012-07-19T15:42:24Z","abstract_excerpt":"The problem of designing efficient feedback-based scheduling policies for chunked codes (CC) over packet networks with delay and loss is considered. For networks with feedback, two scheduling policies, referred to as random push (RP) and local-rarest-first (LRF), already exist. We propose a new scheduling policy, referred to as minimum-distance-first (MDF), based on the expected number of innovative successful packet transmissions at each node of the network prior to the \"next\" transmission time, given the feedback information from the downstream node(s) about the received packets. Unlike the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4711","kind":"arxiv","version":1},"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:50:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LUVvatLesvAinqWdyUZETVGuTJcVpRbwBzVIvEv3yNOsMwUynIldmF3uPgLBw4Px4cwjONKtR6HKUpmm5YMLBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T03:49:37.119893Z"},"content_sha256":"00520f32e6904e7dd6398d9bfd249255d168fd6da57a234cf54429176eb1f191","schema_version":"1.0","event_id":"sha256:00520f32e6904e7dd6398d9bfd249255d168fd6da57a234cf54429176eb1f191"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VDOZPZVKEDIFV3TOLXWJRIDBRZ/bundle.json","state_url":"https://pith.science/pith/VDOZPZVKEDIFV3TOLXWJRIDBRZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VDOZPZVKEDIFV3TOLXWJRIDBRZ/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-20T03:49:37Z","links":{"resolver":"https://pith.science/pith/VDOZPZVKEDIFV3TOLXWJRIDBRZ","bundle":"https://pith.science/pith/VDOZPZVKEDIFV3TOLXWJRIDBRZ/bundle.json","state":"https://pith.science/pith/VDOZPZVKEDIFV3TOLXWJRIDBRZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VDOZPZVKEDIFV3TOLXWJRIDBRZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:VDOZPZVKEDIFV3TOLXWJRIDBRZ","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":"c71bb345c774b9b7d4e4ab708826755b7e91ede28a36bcad35e62ca302e8bbe4","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-19T15:42:24Z","title_canon_sha256":"717d022dfc3ad772eb4b1419b27bfc2b8d87608eb68041dbc5b710fa75bd5c57"},"schema_version":"1.0","source":{"id":"1207.4711","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.4711","created_at":"2026-05-18T03:50:36Z"},{"alias_kind":"arxiv_version","alias_value":"1207.4711v1","created_at":"2026-05-18T03:50:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4711","created_at":"2026-05-18T03:50:36Z"},{"alias_kind":"pith_short_12","alias_value":"VDOZPZVKEDIF","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VDOZPZVKEDIFV3TO","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VDOZPZVK","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:00520f32e6904e7dd6398d9bfd249255d168fd6da57a234cf54429176eb1f191","target":"graph","created_at":"2026-05-18T03:50:36Z","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":"The problem of designing efficient feedback-based scheduling policies for chunked codes (CC) over packet networks with delay and loss is considered. For networks with feedback, two scheduling policies, referred to as random push (RP) and local-rarest-first (LRF), already exist. We propose a new scheduling policy, referred to as minimum-distance-first (MDF), based on the expected number of innovative successful packet transmissions at each node of the network prior to the \"next\" transmission time, given the feedback information from the downstream node(s) about the received packets. Unlike the ","authors_text":"Amir H. Banihashemi, Anoosheh Heidarzadeh","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-19T15:42:24Z","title":"Efficient Feedback-Based Scheduling Policies for Chunked Network Codes over Networks with Loss and Delay"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4711","kind":"arxiv","version":1},"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:091600716f0086257b17f5c75e1dc54320d7d473186c09eaa1bbf4fda3ac50f9","target":"record","created_at":"2026-05-18T03:50:36Z","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":"c71bb345c774b9b7d4e4ab708826755b7e91ede28a36bcad35e62ca302e8bbe4","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-19T15:42:24Z","title_canon_sha256":"717d022dfc3ad772eb4b1419b27bfc2b8d87608eb68041dbc5b710fa75bd5c57"},"schema_version":"1.0","source":{"id":"1207.4711","kind":"arxiv","version":1}},"canonical_sha256":"a8dd97e6aa20d05aee6e5dec98a0618e7c0eeccbec9934178c0b65b7cf623624","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a8dd97e6aa20d05aee6e5dec98a0618e7c0eeccbec9934178c0b65b7cf623624","first_computed_at":"2026-05-18T03:50:36.012930Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:50:36.012930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9I0VY5R46ukqmEgmU9RdEhWgFLiFjVniYi8J6bw94KjYNUM2m5idk1DOemzt8TQn1rEgN+0z3x/SxYNF+UdiDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:50:36.013859Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.4711","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:091600716f0086257b17f5c75e1dc54320d7d473186c09eaa1bbf4fda3ac50f9","sha256:00520f32e6904e7dd6398d9bfd249255d168fd6da57a234cf54429176eb1f191"],"state_sha256":"7572db310641b376fb2812b4eaa6753408f5b7c105be389dcb529b6ae166a5d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X0z5phnV4DjBfpbq0QHpnf8yEVJ4jK5isyrT0WsYDSsAuTp6q96U4Tx73sxsoQYwblzgNd8mOCVFyNrhGevjCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T03:49:37.121814Z","bundle_sha256":"0897004bd575ea24e3635d6ffddf74b9535034c87cc038bcfe8d03302f6ee567"}}