{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:PY6W2WHQWRCMP33OGUZSSMDIWC","short_pith_number":"pith:PY6W2WHQ","schema_version":"1.0","canonical_sha256":"7e3d6d58f0b444c7ef6e3533293068b09b800df101a95408aac369f84e8d8d36","source":{"kind":"arxiv","id":"1402.6973","version":1},"attestation_state":"computed","paper":{"title":"Bounded Delay Scheduling with Packet Dependencies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Gabriel Scalosub, Michael Markovitch","submitted_at":"2014-02-27T17:02:30Z","abstract_excerpt":"A common situation occurring when dealing with multimedia traffic is having large data frames fragmented into smaller IP packets, and having these packets sent independently through the network. For real-time multimedia traffic, dropping even few packets of a frame may render the entire frame useless. Such traffic is usually modeled as having {\\em inter-packet dependencies}. We study the problem of scheduling traffic with such dependencies, where each packet has a deadline by which it should arrive at its destination. Such deadlines are common for real-time multimedia applications, and are der"},"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":"1402.6973","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-02-27T17:02:30Z","cross_cats_sorted":[],"title_canon_sha256":"a4acd5fe74189e23cfa938330b7e2693b626efeb806cef5c8e589de5b92f4c5b","abstract_canon_sha256":"6664766900ab23639b88df8d10822ce7ed847321434c36fa8f24d21f3c15a5ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:36.472165Z","signature_b64":"xciAPCkGbvXj/hVG22NiZY1MGKh8K7UoEJP9oojdpqnxtEvjs2h9EeZeKHIDHzIxf7zMm6c6AU3CgNT4xXOpBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e3d6d58f0b444c7ef6e3533293068b09b800df101a95408aac369f84e8d8d36","last_reissued_at":"2026-05-18T02:57:36.471456Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:36.471456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounded Delay Scheduling with Packet Dependencies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Gabriel Scalosub, Michael Markovitch","submitted_at":"2014-02-27T17:02:30Z","abstract_excerpt":"A common situation occurring when dealing with multimedia traffic is having large data frames fragmented into smaller IP packets, and having these packets sent independently through the network. For real-time multimedia traffic, dropping even few packets of a frame may render the entire frame useless. Such traffic is usually modeled as having {\\em inter-packet dependencies}. We study the problem of scheduling traffic with such dependencies, where each packet has a deadline by which it should arrive at its destination. Such deadlines are common for real-time multimedia applications, and are der"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.6973","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1402.6973","created_at":"2026-05-18T02:57:36.471586+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.6973v1","created_at":"2026-05-18T02:57:36.471586+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.6973","created_at":"2026-05-18T02:57:36.471586+00:00"},{"alias_kind":"pith_short_12","alias_value":"PY6W2WHQWRCM","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PY6W2WHQWRCMP33O","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PY6W2WHQ","created_at":"2026-05-18T12:28:43.426989+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/PY6W2WHQWRCMP33OGUZSSMDIWC","json":"https://pith.science/pith/PY6W2WHQWRCMP33OGUZSSMDIWC.json","graph_json":"https://pith.science/api/pith-number/PY6W2WHQWRCMP33OGUZSSMDIWC/graph.json","events_json":"https://pith.science/api/pith-number/PY6W2WHQWRCMP33OGUZSSMDIWC/events.json","paper":"https://pith.science/paper/PY6W2WHQ"},"agent_actions":{"view_html":"https://pith.science/pith/PY6W2WHQWRCMP33OGUZSSMDIWC","download_json":"https://pith.science/pith/PY6W2WHQWRCMP33OGUZSSMDIWC.json","view_paper":"https://pith.science/paper/PY6W2WHQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.6973&json=true","fetch_graph":"https://pith.science/api/pith-number/PY6W2WHQWRCMP33OGUZSSMDIWC/graph.json","fetch_events":"https://pith.science/api/pith-number/PY6W2WHQWRCMP33OGUZSSMDIWC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PY6W2WHQWRCMP33OGUZSSMDIWC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PY6W2WHQWRCMP33OGUZSSMDIWC/action/storage_attestation","attest_author":"https://pith.science/pith/PY6W2WHQWRCMP33OGUZSSMDIWC/action/author_attestation","sign_citation":"https://pith.science/pith/PY6W2WHQWRCMP33OGUZSSMDIWC/action/citation_signature","submit_replication":"https://pith.science/pith/PY6W2WHQWRCMP33OGUZSSMDIWC/action/replication_record"}},"created_at":"2026-05-18T02:57:36.471586+00:00","updated_at":"2026-05-18T02:57:36.471586+00:00"}