{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NTQA6LSTY6YV54TRYU4L4H6IHB","short_pith_number":"pith:NTQA6LST","canonical_record":{"source":{"id":"1709.10119","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-28T18:15:58Z","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"title_canon_sha256":"547356b11d2fdc5cfdc00188b2553eea61b203effa3f42847c9c40795afbffa2","abstract_canon_sha256":"fa88d1bcd735932d50dda515a8f20ba579c14a81a078613ca6185a3849845aea"},"schema_version":"1.0"},"canonical_sha256":"6ce00f2e53c7b15ef271c538be1fc83846de959f641cc2b510fe5835fbdd81a7","source":{"kind":"arxiv","id":"1709.10119","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.10119","created_at":"2026-05-18T00:34:04Z"},{"alias_kind":"arxiv_version","alias_value":"1709.10119v1","created_at":"2026-05-18T00:34:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.10119","created_at":"2026-05-18T00:34:04Z"},{"alias_kind":"pith_short_12","alias_value":"NTQA6LSTY6YV","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"NTQA6LSTY6YV54TR","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"NTQA6LST","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NTQA6LSTY6YV54TRYU4L4H6IHB","target":"record","payload":{"canonical_record":{"source":{"id":"1709.10119","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-28T18:15:58Z","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"title_canon_sha256":"547356b11d2fdc5cfdc00188b2553eea61b203effa3f42847c9c40795afbffa2","abstract_canon_sha256":"fa88d1bcd735932d50dda515a8f20ba579c14a81a078613ca6185a3849845aea"},"schema_version":"1.0"},"canonical_sha256":"6ce00f2e53c7b15ef271c538be1fc83846de959f641cc2b510fe5835fbdd81a7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:04.274428Z","signature_b64":"0a+QWxmbD+E8/dGSdxdjl3ppQNJjGLqbN4Altx1EJeJ26/pKJ1FNQUs7rPuOUfgciRFzo9XLe9B+zilr1aXaAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ce00f2e53c7b15ef271c538be1fc83846de959f641cc2b510fe5835fbdd81a7","last_reissued_at":"2026-05-18T00:34:04.273732Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:04.273732Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.10119","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-18T00:34:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rMpoEjeSWwsimZXo/jZCT2gbprlTSETnxrlLfAZM8WhZwhul5Qid6OkN4qfcxrnxq58SUO5YsLTnKhX8rcCGCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:13:02.635362Z"},"content_sha256":"0ac770cd777c1c86c39645d01c5a95735059c658bf660b651dde23f4740af51d","schema_version":"1.0","event_id":"sha256:0ac770cd777c1c86c39645d01c5a95735059c658bf660b651dde23f4740af51d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NTQA6LSTY6YV54TRYU4L4H6IHB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Join-the-Idle-Queue for Low Latency Cloud Services","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.NI","math.IT"],"primary_cat":"cs.DC","authors_text":"Chen Feng, Chunpu Wang, Julian Cheng","submitted_at":"2017-09-28T18:15:58Z","abstract_excerpt":"Low latency is highly desirable for cloud services. To achieve low response time, stringent timing requirements are needed for task scheduling in a large-scale server farm spanning thousands of servers. In this paper, we conduct an in-depth analysis for distributed Join-the-Idle-Queue (JIQ), a promising new approximation of an idealized task-scheduling algorithm. In particular, we derive semi-closed form expressions for the delay performance of distributed JIQ, and we propose a new variant of distributed JIQ that offers clear advantages over alternative algorithms for large systems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.10119","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-18T00:34:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P6x2X9KxM3XRMeM1ptM9P7Njts6xvDZ70ppc3dC7jOWGc5ttbFxoDFjj09QMTyc7zgHalmgSfE/RDU0wNoHZCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:13:02.635706Z"},"content_sha256":"d8409f98529447fd5d1a1d6f15fa5072213a07a3874952ad8950628f65c831f2","schema_version":"1.0","event_id":"sha256:d8409f98529447fd5d1a1d6f15fa5072213a07a3874952ad8950628f65c831f2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NTQA6LSTY6YV54TRYU4L4H6IHB/bundle.json","state_url":"https://pith.science/pith/NTQA6LSTY6YV54TRYU4L4H6IHB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NTQA6LSTY6YV54TRYU4L4H6IHB/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-08T23:13:02Z","links":{"resolver":"https://pith.science/pith/NTQA6LSTY6YV54TRYU4L4H6IHB","bundle":"https://pith.science/pith/NTQA6LSTY6YV54TRYU4L4H6IHB/bundle.json","state":"https://pith.science/pith/NTQA6LSTY6YV54TRYU4L4H6IHB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NTQA6LSTY6YV54TRYU4L4H6IHB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NTQA6LSTY6YV54TRYU4L4H6IHB","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":"fa88d1bcd735932d50dda515a8f20ba579c14a81a078613ca6185a3849845aea","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-28T18:15:58Z","title_canon_sha256":"547356b11d2fdc5cfdc00188b2553eea61b203effa3f42847c9c40795afbffa2"},"schema_version":"1.0","source":{"id":"1709.10119","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.10119","created_at":"2026-05-18T00:34:04Z"},{"alias_kind":"arxiv_version","alias_value":"1709.10119v1","created_at":"2026-05-18T00:34:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.10119","created_at":"2026-05-18T00:34:04Z"},{"alias_kind":"pith_short_12","alias_value":"NTQA6LSTY6YV","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"NTQA6LSTY6YV54TR","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"NTQA6LST","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:d8409f98529447fd5d1a1d6f15fa5072213a07a3874952ad8950628f65c831f2","target":"graph","created_at":"2026-05-18T00:34:04Z","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":"Low latency is highly desirable for cloud services. To achieve low response time, stringent timing requirements are needed for task scheduling in a large-scale server farm spanning thousands of servers. In this paper, we conduct an in-depth analysis for distributed Join-the-Idle-Queue (JIQ), a promising new approximation of an idealized task-scheduling algorithm. In particular, we derive semi-closed form expressions for the delay performance of distributed JIQ, and we propose a new variant of distributed JIQ that offers clear advantages over alternative algorithms for large systems.","authors_text":"Chen Feng, Chunpu Wang, Julian Cheng","cross_cats":["cs.IT","cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-28T18:15:58Z","title":"Distributed Join-the-Idle-Queue for Low Latency Cloud Services"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.10119","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:0ac770cd777c1c86c39645d01c5a95735059c658bf660b651dde23f4740af51d","target":"record","created_at":"2026-05-18T00:34:04Z","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":"fa88d1bcd735932d50dda515a8f20ba579c14a81a078613ca6185a3849845aea","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-28T18:15:58Z","title_canon_sha256":"547356b11d2fdc5cfdc00188b2553eea61b203effa3f42847c9c40795afbffa2"},"schema_version":"1.0","source":{"id":"1709.10119","kind":"arxiv","version":1}},"canonical_sha256":"6ce00f2e53c7b15ef271c538be1fc83846de959f641cc2b510fe5835fbdd81a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ce00f2e53c7b15ef271c538be1fc83846de959f641cc2b510fe5835fbdd81a7","first_computed_at":"2026-05-18T00:34:04.273732Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:04.273732Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0a+QWxmbD+E8/dGSdxdjl3ppQNJjGLqbN4Altx1EJeJ26/pKJ1FNQUs7rPuOUfgciRFzo9XLe9B+zilr1aXaAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:04.274428Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.10119","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ac770cd777c1c86c39645d01c5a95735059c658bf660b651dde23f4740af51d","sha256:d8409f98529447fd5d1a1d6f15fa5072213a07a3874952ad8950628f65c831f2"],"state_sha256":"6a6fb49ac773cfae737e731357671373ef33d675b32b3eed8f6175429d333d09"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NqMWROVbaXEgD3USNY4H/pzlLHHYUAqsI9N5VwyU9zVSu3KD8DOuQefbUoODigJwQvQR1qANGXB+tQWbAnLHAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T23:13:02.637572Z","bundle_sha256":"84dc410e6bcec54a276324b35e43e5da380a1b106615e193e7e7ea0564d79e75"}}