{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:YTG2KEANJUCDZSB5POAH53YLSW","short_pith_number":"pith:YTG2KEAN","canonical_record":{"source":{"id":"1206.2057","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-06-10T21:19:08Z","cross_cats_sorted":[],"title_canon_sha256":"f0146a19ebf73cb28a96eb6e64c37861819c66ffdaa1fa072a82061a5cad650b","abstract_canon_sha256":"1f5359dd1e4b0fecf29d24ff3fd772ab4d1ddc1f814aceefaf6a6e24b0d9ca1f"},"schema_version":"1.0"},"canonical_sha256":"c4cda5100d4d043cc83d7b807eef0b95b6531a80af9a8578965b7549826ee5fa","source":{"kind":"arxiv","id":"1206.2057","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.2057","created_at":"2026-05-18T03:53:44Z"},{"alias_kind":"arxiv_version","alias_value":"1206.2057v2","created_at":"2026-05-18T03:53:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.2057","created_at":"2026-05-18T03:53:44Z"},{"alias_kind":"pith_short_12","alias_value":"YTG2KEANJUCD","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"YTG2KEANJUCDZSB5","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"YTG2KEAN","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:YTG2KEANJUCDZSB5POAH53YLSW","target":"record","payload":{"canonical_record":{"source":{"id":"1206.2057","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-06-10T21:19:08Z","cross_cats_sorted":[],"title_canon_sha256":"f0146a19ebf73cb28a96eb6e64c37861819c66ffdaa1fa072a82061a5cad650b","abstract_canon_sha256":"1f5359dd1e4b0fecf29d24ff3fd772ab4d1ddc1f814aceefaf6a6e24b0d9ca1f"},"schema_version":"1.0"},"canonical_sha256":"c4cda5100d4d043cc83d7b807eef0b95b6531a80af9a8578965b7549826ee5fa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:44.591156Z","signature_b64":"Jga7zOhA4fUhQC6CkGKjgoWFs6npNOJW75XyPvbrNNYQZu7cBWCalCip7thLUtqK1KJRI3XdkVeql1Gjgy4mDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4cda5100d4d043cc83d7b807eef0b95b6531a80af9a8578965b7549826ee5fa","last_reissued_at":"2026-05-18T03:53:44.590740Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:44.590740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.2057","source_version":2,"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:53:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jot1BEMZJdPjCJvBSHl2lNM+TBspWG04GhkVV0SSbG4j4j2EqLXwNPQ5B13MslBxiiGI1hrEn1Sj3y4bAIzFCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T14:56:08.995705Z"},"content_sha256":"c8cffb1f89743e756f8a55f2ca9d2083f9a4d8a87b15a7ec431833f41ac9c8fe","schema_version":"1.0","event_id":"sha256:c8cffb1f89743e756f8a55f2ca9d2083f9a4d8a87b15a7ec431833f41ac9c8fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:YTG2KEANJUCDZSB5POAH53YLSW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finishing Flows Quickly with Preemptive Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Chi-Yao Hong, Matthew Caesar, P. Brighten Godfrey","submitted_at":"2012-06-10T21:19:08Z","abstract_excerpt":"Today's data centers face extreme challenges in providing low latency. However, fair sharing, a principle commonly adopted in current congestion control protocols, is far from optimal for satisfying latency requirements.\n  We propose Preemptive Distributed Quick (PDQ) flow scheduling, a protocol designed to complete flows quickly and meet flow deadlines. PDQ enables flow preemption to approximate a range of scheduling disciplines. For example, PDQ can emulate a shortest job first algorithm to give priority to the short flows by pausing the contending flows. PDQ borrows ideas from centralized s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.2057","kind":"arxiv","version":2},"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:53:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PC42rjC8FPSmgHEFDgKXrgFTGK1Pa7Vin2pWIuE5aWgvAMkS5nYq1EbatjmdzP5guitTrfX3VoY+HrScCgjMBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T14:56:08.996061Z"},"content_sha256":"9143271e464af60a26610f7cf96d8249f8307217d65ff0aa6373cb8ff7737a85","schema_version":"1.0","event_id":"sha256:9143271e464af60a26610f7cf96d8249f8307217d65ff0aa6373cb8ff7737a85"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YTG2KEANJUCDZSB5POAH53YLSW/bundle.json","state_url":"https://pith.science/pith/YTG2KEANJUCDZSB5POAH53YLSW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YTG2KEANJUCDZSB5POAH53YLSW/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-07-02T14:56:08Z","links":{"resolver":"https://pith.science/pith/YTG2KEANJUCDZSB5POAH53YLSW","bundle":"https://pith.science/pith/YTG2KEANJUCDZSB5POAH53YLSW/bundle.json","state":"https://pith.science/pith/YTG2KEANJUCDZSB5POAH53YLSW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YTG2KEANJUCDZSB5POAH53YLSW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:YTG2KEANJUCDZSB5POAH53YLSW","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":"1f5359dd1e4b0fecf29d24ff3fd772ab4d1ddc1f814aceefaf6a6e24b0d9ca1f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-06-10T21:19:08Z","title_canon_sha256":"f0146a19ebf73cb28a96eb6e64c37861819c66ffdaa1fa072a82061a5cad650b"},"schema_version":"1.0","source":{"id":"1206.2057","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.2057","created_at":"2026-05-18T03:53:44Z"},{"alias_kind":"arxiv_version","alias_value":"1206.2057v2","created_at":"2026-05-18T03:53:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.2057","created_at":"2026-05-18T03:53:44Z"},{"alias_kind":"pith_short_12","alias_value":"YTG2KEANJUCD","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"YTG2KEANJUCDZSB5","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"YTG2KEAN","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:9143271e464af60a26610f7cf96d8249f8307217d65ff0aa6373cb8ff7737a85","target":"graph","created_at":"2026-05-18T03:53:44Z","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":"Today's data centers face extreme challenges in providing low latency. However, fair sharing, a principle commonly adopted in current congestion control protocols, is far from optimal for satisfying latency requirements.\n  We propose Preemptive Distributed Quick (PDQ) flow scheduling, a protocol designed to complete flows quickly and meet flow deadlines. PDQ enables flow preemption to approximate a range of scheduling disciplines. For example, PDQ can emulate a shortest job first algorithm to give priority to the short flows by pausing the contending flows. PDQ borrows ideas from centralized s","authors_text":"Chi-Yao Hong, Matthew Caesar, P. Brighten Godfrey","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-06-10T21:19:08Z","title":"Finishing Flows Quickly with Preemptive Scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.2057","kind":"arxiv","version":2},"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:c8cffb1f89743e756f8a55f2ca9d2083f9a4d8a87b15a7ec431833f41ac9c8fe","target":"record","created_at":"2026-05-18T03:53:44Z","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":"1f5359dd1e4b0fecf29d24ff3fd772ab4d1ddc1f814aceefaf6a6e24b0d9ca1f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-06-10T21:19:08Z","title_canon_sha256":"f0146a19ebf73cb28a96eb6e64c37861819c66ffdaa1fa072a82061a5cad650b"},"schema_version":"1.0","source":{"id":"1206.2057","kind":"arxiv","version":2}},"canonical_sha256":"c4cda5100d4d043cc83d7b807eef0b95b6531a80af9a8578965b7549826ee5fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c4cda5100d4d043cc83d7b807eef0b95b6531a80af9a8578965b7549826ee5fa","first_computed_at":"2026-05-18T03:53:44.590740Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:53:44.590740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Jga7zOhA4fUhQC6CkGKjgoWFs6npNOJW75XyPvbrNNYQZu7cBWCalCip7thLUtqK1KJRI3XdkVeql1Gjgy4mDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:53:44.591156Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.2057","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c8cffb1f89743e756f8a55f2ca9d2083f9a4d8a87b15a7ec431833f41ac9c8fe","sha256:9143271e464af60a26610f7cf96d8249f8307217d65ff0aa6373cb8ff7737a85"],"state_sha256":"6696e39eb8ffc5410bd5414126cdb36acb42b5beee933e3d5af0e6757973ec40"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pmsECBRiN53T9KcHyUkpB/rgPSDbp4HRZ6oTAtQ6mZzUEHPru35EVnoZFfUsFQ7/ewqrW7/V3NE9exUVryNxCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T14:56:08.998030Z","bundle_sha256":"af13aa1c230e0a41a7aa399c9c1aa119e5d23a883cec846250b04dad009ed445"}}