{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:M6NGARUMSVCX2AEKRMWOAZDM4X","short_pith_number":"pith:M6NGARUM","schema_version":"1.0","canonical_sha256":"679a60468c95457d008a8b2ce0646ce5ffee0925bfb1d56961800acdc2ec0a77","source":{"kind":"arxiv","id":"2504.12074","version":2},"attestation_state":"computed","paper":{"title":"Learning from the Past: Adaptive Parallelism Tuning for Stream Processing Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DC","authors_text":"Chengcheng Yang, Haoyu Wang, Kongzhang Hao, Lixiang Chen, Yifan Zhang, Yuxing Han, Zhanghao Chen, Zhengyi Yang","submitted_at":"2025-04-16T13:30:55Z","abstract_excerpt":"Distributed stream processing systems rely on the dataflow model to define and execute streaming jobs, organizing computations as Directed Acyclic Graphs (DAGs) of operators. Adjusting the parallelism of these operators is crucial to handling fluctuating workloads efficiently while balancing resource usage and processing performance. However, existing methods often fail to effectively utilize execution histories or fully exploit DAG structures, limiting their ability to identity bottlenecks and determine the optimal parallelism. In this paper, we propose StreamTune, a novel approach for adapti"},"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":"2504.12074","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-04-16T13:30:55Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"63bf5ba6f1144fdd1660576e257c0db9804b90baf53074f574fad3aa87a4890e","abstract_canon_sha256":"23f0f81563f31ff7d24f8eb5a5ac1f10c3afa6f38171fd34d5eba64618a40f99"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:32:28.225565Z","signature_b64":"gbkt4Ru6WFs6EBTB9Byn4EaInsLKC99agzRKdb+n5Wxd5haRwx2l5Y/GTBWYMqYVPcJIluuQOB49ic/qzOIYDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"679a60468c95457d008a8b2ce0646ce5ffee0925bfb1d56961800acdc2ec0a77","last_reissued_at":"2026-07-05T11:32:28.225036Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:32:28.225036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning from the Past: Adaptive Parallelism Tuning for Stream Processing Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DC","authors_text":"Chengcheng Yang, Haoyu Wang, Kongzhang Hao, Lixiang Chen, Yifan Zhang, Yuxing Han, Zhanghao Chen, Zhengyi Yang","submitted_at":"2025-04-16T13:30:55Z","abstract_excerpt":"Distributed stream processing systems rely on the dataflow model to define and execute streaming jobs, organizing computations as Directed Acyclic Graphs (DAGs) of operators. Adjusting the parallelism of these operators is crucial to handling fluctuating workloads efficiently while balancing resource usage and processing performance. However, existing methods often fail to effectively utilize execution histories or fully exploit DAG structures, limiting their ability to identity bottlenecks and determine the optimal parallelism. In this paper, we propose StreamTune, a novel approach for adapti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.12074","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2504.12074/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2504.12074","created_at":"2026-07-05T11:32:28.225096+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.12074v2","created_at":"2026-07-05T11:32:28.225096+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.12074","created_at":"2026-07-05T11:32:28.225096+00:00"},{"alias_kind":"pith_short_12","alias_value":"M6NGARUMSVCX","created_at":"2026-07-05T11:32:28.225096+00:00"},{"alias_kind":"pith_short_16","alias_value":"M6NGARUMSVCX2AEK","created_at":"2026-07-05T11:32:28.225096+00:00"},{"alias_kind":"pith_short_8","alias_value":"M6NGARUM","created_at":"2026-07-05T11:32:28.225096+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.14597","citing_title":"Towards a Proactive Autoscaling Framework for Data Stream Processing at the Edge using GRU and Transfer Learning","ref_index":49,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M6NGARUMSVCX2AEKRMWOAZDM4X","json":"https://pith.science/pith/M6NGARUMSVCX2AEKRMWOAZDM4X.json","graph_json":"https://pith.science/api/pith-number/M6NGARUMSVCX2AEKRMWOAZDM4X/graph.json","events_json":"https://pith.science/api/pith-number/M6NGARUMSVCX2AEKRMWOAZDM4X/events.json","paper":"https://pith.science/paper/M6NGARUM"},"agent_actions":{"view_html":"https://pith.science/pith/M6NGARUMSVCX2AEKRMWOAZDM4X","download_json":"https://pith.science/pith/M6NGARUMSVCX2AEKRMWOAZDM4X.json","view_paper":"https://pith.science/paper/M6NGARUM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.12074&json=true","fetch_graph":"https://pith.science/api/pith-number/M6NGARUMSVCX2AEKRMWOAZDM4X/graph.json","fetch_events":"https://pith.science/api/pith-number/M6NGARUMSVCX2AEKRMWOAZDM4X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M6NGARUMSVCX2AEKRMWOAZDM4X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M6NGARUMSVCX2AEKRMWOAZDM4X/action/storage_attestation","attest_author":"https://pith.science/pith/M6NGARUMSVCX2AEKRMWOAZDM4X/action/author_attestation","sign_citation":"https://pith.science/pith/M6NGARUMSVCX2AEKRMWOAZDM4X/action/citation_signature","submit_replication":"https://pith.science/pith/M6NGARUMSVCX2AEKRMWOAZDM4X/action/replication_record"}},"created_at":"2026-07-05T11:32:28.225096+00:00","updated_at":"2026-07-05T11:32:28.225096+00:00"}