{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:T3ELB6BY6S3JGRPDGHHAZPSZYG","short_pith_number":"pith:T3ELB6BY","schema_version":"1.0","canonical_sha256":"9ec8b0f838f4b69345e331ce0cbe59c1af983147849cca961637b357ef0da43b","source":{"kind":"arxiv","id":"1705.09073","version":2},"attestation_state":"computed","paper":{"title":"Load Balancing for Skewed Streams on Heterogeneous Cluster","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Hiroshi Horii, Marco Serafini, Muhammad Anis Uddin Nasir, Nicolas Kourtellis, Rudy Raymond, Sarunas Girdzijauskas, Takayuki Osogami","submitted_at":"2017-05-25T07:25:51Z","abstract_excerpt":"Streaming applications frequently encounter skewed workloads and execute on heterogeneous clusters. Optimal resource utilization in such adverse conditions becomes a challenge, as it requires inferring the resource capacities and input distribution at run time. In this paper, we tackle the aforementioned challenges by modeling them as a load balancing problem. We propose a novel partitioning strategy called Consistent Grouping (CG), which enables each processing element instance (PEI) to process the workload according to its capacity. The main idea behind CG is the notion of small, equal-sized"},"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":"1705.09073","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-25T07:25:51Z","cross_cats_sorted":[],"title_canon_sha256":"e6e6de56aa22a1313c28e8e2ceb75230436f0abd38bed20b98d0da18fd29a22d","abstract_canon_sha256":"f8df258a9a048c375b5c6a431f5a3ee09f7e1b021785a12d4d54f3f65b10af07"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:59.050277Z","signature_b64":"wm4nl8zcRTJ/Ct5RHU72fl7FLpxv4WEp4kVO1Wh+D5nz15PJGtLmLjayGbnbTm0J42H7jzLwbqAsAWcfUQVgCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ec8b0f838f4b69345e331ce0cbe59c1af983147849cca961637b357ef0da43b","last_reissued_at":"2026-05-18T00:33:59.049581Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:59.049581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Load Balancing for Skewed Streams on Heterogeneous Cluster","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Hiroshi Horii, Marco Serafini, Muhammad Anis Uddin Nasir, Nicolas Kourtellis, Rudy Raymond, Sarunas Girdzijauskas, Takayuki Osogami","submitted_at":"2017-05-25T07:25:51Z","abstract_excerpt":"Streaming applications frequently encounter skewed workloads and execute on heterogeneous clusters. Optimal resource utilization in such adverse conditions becomes a challenge, as it requires inferring the resource capacities and input distribution at run time. In this paper, we tackle the aforementioned challenges by modeling them as a load balancing problem. We propose a novel partitioning strategy called Consistent Grouping (CG), which enables each processing element instance (PEI) to process the workload according to its capacity. The main idea behind CG is the notion of small, equal-sized"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09073","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.09073","created_at":"2026-05-18T00:33:59.049691+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.09073v2","created_at":"2026-05-18T00:33:59.049691+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09073","created_at":"2026-05-18T00:33:59.049691+00:00"},{"alias_kind":"pith_short_12","alias_value":"T3ELB6BY6S3J","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"T3ELB6BY6S3JGRPD","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"T3ELB6BY","created_at":"2026-05-18T12:31:43.269735+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/T3ELB6BY6S3JGRPDGHHAZPSZYG","json":"https://pith.science/pith/T3ELB6BY6S3JGRPDGHHAZPSZYG.json","graph_json":"https://pith.science/api/pith-number/T3ELB6BY6S3JGRPDGHHAZPSZYG/graph.json","events_json":"https://pith.science/api/pith-number/T3ELB6BY6S3JGRPDGHHAZPSZYG/events.json","paper":"https://pith.science/paper/T3ELB6BY"},"agent_actions":{"view_html":"https://pith.science/pith/T3ELB6BY6S3JGRPDGHHAZPSZYG","download_json":"https://pith.science/pith/T3ELB6BY6S3JGRPDGHHAZPSZYG.json","view_paper":"https://pith.science/paper/T3ELB6BY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.09073&json=true","fetch_graph":"https://pith.science/api/pith-number/T3ELB6BY6S3JGRPDGHHAZPSZYG/graph.json","fetch_events":"https://pith.science/api/pith-number/T3ELB6BY6S3JGRPDGHHAZPSZYG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T3ELB6BY6S3JGRPDGHHAZPSZYG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T3ELB6BY6S3JGRPDGHHAZPSZYG/action/storage_attestation","attest_author":"https://pith.science/pith/T3ELB6BY6S3JGRPDGHHAZPSZYG/action/author_attestation","sign_citation":"https://pith.science/pith/T3ELB6BY6S3JGRPDGHHAZPSZYG/action/citation_signature","submit_replication":"https://pith.science/pith/T3ELB6BY6S3JGRPDGHHAZPSZYG/action/replication_record"}},"created_at":"2026-05-18T00:33:59.049691+00:00","updated_at":"2026-05-18T00:33:59.049691+00:00"}