{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:4MQDFV4SVPA3DYWBVITJNP6Q7P","short_pith_number":"pith:4MQDFV4S","canonical_record":{"source":{"id":"2607.04821","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2026-07-06T08:52:20Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"99469b2d419e5d0210fd25b4de97c3382497e93806be9932d23566aa7869e5b7","abstract_canon_sha256":"b89188df6ddf0159ff5060a9578d15679bf66958911a0bd048f8373aff923c78"},"schema_version":"1.0"},"canonical_sha256":"e32032d792abc1b1e2c1aa2696bfd0fbc1537ba2e503efe0762d0ef2dea4b486","source":{"kind":"arxiv","id":"2607.04821","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.04821","created_at":"2026-07-07T02:20:05Z"},{"alias_kind":"arxiv_version","alias_value":"2607.04821v1","created_at":"2026-07-07T02:20:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.04821","created_at":"2026-07-07T02:20:05Z"},{"alias_kind":"pith_short_12","alias_value":"4MQDFV4SVPA3","created_at":"2026-07-07T02:20:05Z"},{"alias_kind":"pith_short_16","alias_value":"4MQDFV4SVPA3DYWB","created_at":"2026-07-07T02:20:05Z"},{"alias_kind":"pith_short_8","alias_value":"4MQDFV4S","created_at":"2026-07-07T02:20:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:4MQDFV4SVPA3DYWBVITJNP6Q7P","target":"record","payload":{"canonical_record":{"source":{"id":"2607.04821","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2026-07-06T08:52:20Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"99469b2d419e5d0210fd25b4de97c3382497e93806be9932d23566aa7869e5b7","abstract_canon_sha256":"b89188df6ddf0159ff5060a9578d15679bf66958911a0bd048f8373aff923c78"},"schema_version":"1.0"},"canonical_sha256":"e32032d792abc1b1e2c1aa2696bfd0fbc1537ba2e503efe0762d0ef2dea4b486","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T02:20:05.371973Z","signature_b64":"S+jMgeJWuDI7IfSszCsi7BusmOqS5qKBp4+QI0EQl9YLGydSu9xN4wMiOZb5bqvqmXzFxu8JXaCijCf+GFJGDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e32032d792abc1b1e2c1aa2696bfd0fbc1537ba2e503efe0762d0ef2dea4b486","last_reissued_at":"2026-07-07T02:20:05.370591Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T02:20:05.370591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.04821","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-07-07T02:20:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XnyT/ZkSmox/RRGnQ6hc0t5jPOW92hez9iKIv7fNYfy9/qnYBBIWjTxav3pGZbT6hbsOmO0cX0WKzkZ3/WQYCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T20:38:03.431393Z"},"content_sha256":"79847e1fd29b04108d3d9024687d14552e44e4c1eef4b2c51eb685383b8b98d0","schema_version":"1.0","event_id":"sha256:79847e1fd29b04108d3d9024687d14552e44e4c1eef4b2c51eb685383b8b98d0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:4MQDFV4SVPA3DYWBVITJNP6Q7P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Performance evaluation of scheduling tasks in many-core systems utilizing processes and threads","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.DC","authors_text":"Anastasia Papouda, Anna Maria Sidiropoulou, Argyro Gailla, Dimitrios Kontodimos, George Tavridis, Hermione Kimpouropoulou, Kleopatra Kontogianni, Mejgan Dedaj, Michail Panagiotidis Kannas, Sotirios Kontogiannis, Stamatia Kastrinaki, Theofanis Ioannou","submitted_at":"2026-07-06T08:52:20Z","abstract_excerpt":"This study assesses the scalability of process-based and thread-based schedulers for many-core shared-memory systems using a memory-intensive row-wise quick-sort workload on large three-dimensional tensors. The process-based evaluation considers bounded prolific, bounded collective, and three pipe-based producer-consumer schedulers: one-to-one, one-to-many, and many-to-many. These pipe schedulers dynamically stream task identifiers to worker processes, exchanging increased inter-process communication overhead for enhanced runtime load balancing and flexible chunk-based task dispatching. The th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.04821","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.04821/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"},"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-07-07T02:20:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4L7axOr6m/CSZ2L1b2lcv4kiFt0A+A4UEfrHz9lAnbwQACOGi4Z+kcXljp8p5U0tOEvmmrCGbzQdYuAkEeT1CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T20:38:03.432886Z"},"content_sha256":"318787028bf719531246cdd994e5df9d0b83d9ea39add1960d23c16a7de311dd","schema_version":"1.0","event_id":"sha256:318787028bf719531246cdd994e5df9d0b83d9ea39add1960d23c16a7de311dd"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:4MQDFV4SVPA3DYWBVITJNP6Q7P","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1504/IJCNDS.2014.0640415) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"S. Kontogiannis and A. Karakos, “ALBL: An adaptive load balancing algorithm for distributed web systems,” International Journal of Communication Networks and Distributed Systems, vol. 13, no. 2, pp. 144–168, 2014. [Online]. Available: https","arxiv_id":"2607.04821","detector":"doi_compliance","evidence":{"ref_index":23,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"S. Kontogiannis and A. Karakos, “ALBL: An adaptive load balancing algorithm for distributed web systems,” International Journal of Communication Networks and Distributed Systems, vol. 13, no. 2, pp. 144–168, 2014. [Online]. Available: https","reconstructed_doi":"10.1504/IJCNDS.2014.0640415"},"severity":"advisory","ref_index":23,"audited_at":"2026-07-11T13:07:03.578875Z","event_type":"pith.integrity.v1","detected_doi":"10.1504/IJCNDS.2014.0640415","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"574c8cb180ce53125683f640211ef52359cd9a9c039e01b645a3bde7b1f4ac1a","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":12203,"payload_sha256":"01d79508f1785632c50fab6d38e7a732ba3cc77ea8bcf5e746b35e010759c20f","signature_b64":"m7JahcuB+cqHWJ4c/DvgAsz70RLBxTpZxNco05fkj5wG+JH/dVlohmJnDdxE1wvFTCxPSyftL9h4HxBDx28hBg==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-11T13:11:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DUJlBk0yyecc239SyTkKF6quU5tDkXe7QWzNfNijoFnwrjzVTRt7zcxbqwEes/cUDalTSEqj4i03FAEKDzcoAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T20:38:03.441719Z"},"content_sha256":"928a161d90f36807a1ad68d95bc5b628a4ecce85361669679611a0c4248f3b4b","schema_version":"1.0","event_id":"sha256:928a161d90f36807a1ad68d95bc5b628a4ecce85361669679611a0c4248f3b4b"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:4MQDFV4SVPA3DYWBVITJNP6Q7P","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/11424505325) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"S. Kontogiannis, L. Mamatas, I. Psaras, and V . Tsaous- sidis, “Measuring transport protocol potential for energy efficiency,” inWired/Wireless Internet Communications. Berlin, Heidelberg: Springer, 2005, pp. 333–342. [Online]. Available: h","arxiv_id":"2607.04821","detector":"doi_compliance","evidence":{"ref_index":22,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"S. Kontogiannis, L. Mamatas, I. Psaras, and V . Tsaous- sidis, “Measuring transport protocol potential for energy efficiency,” inWired/Wireless Internet Communications. Berlin, Heidelberg: Springer, 2005, pp. 333–342. [Online]. Available: h","reconstructed_doi":"10.1007/11424505325"},"severity":"advisory","ref_index":22,"audited_at":"2026-07-11T13:07:03.578875Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/11424505325","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"3a8668670a7354a45ece0142a7f10074830a0feaf091160538c083abcbf9aec7","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":12202,"payload_sha256":"4275c85b1ad6b0a4f0174ea381d1fc7b9b67532671e3b4be271b56b72bde102e","signature_b64":"3pCGrUuZNkkmINXYsDUDR4lg9b1oz9TX+X/mwXW0uRrH2Wf1grMHyhSsXpu56KQEicyKf3Q6Pi/nhUJuAwVZBw==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-11T13:11:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nlxd5XYqgV8e6dExrW1FS5v6CFe5kowiOs4XI8rMpMzipt3WsPjXfiWWUKK7UOVfR8tMFSZVC+K8haoJ6ht+DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T20:38:03.442160Z"},"content_sha256":"f711cde087c7178976eff886ba126e62ba7ad8af4c248561063dd611ce5fac68","schema_version":"1.0","event_id":"sha256:f711cde087c7178976eff886ba126e62ba7ad8af4c248561063dd611ce5fac68"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:4MQDFV4SVPA3DYWBVITJNP6Q7P","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1145/52324.523565) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"V . Jacobson, “Congestion avoidance and control,” in Proceedings of ACM SIGCOMM, 1988, pp. 314–329. [Online]. Available: https://dl.acm.org/doi/10.1145/52324. 52356 5","arxiv_id":"2607.04821","detector":"doi_compliance","evidence":{"ref_index":18,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"V . Jacobson, “Congestion avoidance and control,” in Proceedings of ACM SIGCOMM, 1988, pp. 314–329. [Online]. Available: https://dl.acm.org/doi/10.1145/52324. 52356 5","reconstructed_doi":"10.1145/52324.523565"},"severity":"advisory","ref_index":18,"audited_at":"2026-07-11T13:07:03.578875Z","event_type":"pith.integrity.v1","detected_doi":"10.1145/52324.523565","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"7e9c12e2873dbd1f032b806ea078c01f946536b77f0731aca7108ed2f4480d02","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":12201,"payload_sha256":"cc93a0231d436ef326ceaac0aa0661996cbebe283a8c439c3e396cc9f2df437d","signature_b64":"cHMWFAvABrWiYENt1mH4r3MngNMJlv1Swm54zsihh/ystnNws2Bs3UwJs22Uh6Ge0NWJEgc1zO0i2jHAzh5SAA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-11T13:11:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Li89k2EtuCvq52BvRxpcMaW8G6EqR/CSFxktSi0cvLpGehaqXQF9WQjzedTuutgCz/i8enIKwDZpWCCtDcmDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T20:38:03.442557Z"},"content_sha256":"b740ddca60c2953b7676d30abe7ce7051c14f2ac909dccc9e32c3a034fb0c6a0","schema_version":"1.0","event_id":"sha256:b740ddca60c2953b7676d30abe7ce7051c14f2ac909dccc9e32c3a034fb0c6a0"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:4MQDFV4SVPA3DYWBVITJNP6Q7P","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1016/0169-7552(89) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"D.-M. Chiu and R. Jain, “Analysis of the increase/decrease algorithms for congestion avoidance in computer networks,” Computer Networks and ISDN Systems, vol. 17, no. 1, pp. 1– 14, 1989. [Online]. Available: https://doi.org/10.1016/0169- 75","arxiv_id":"2607.04821","detector":"doi_compliance","evidence":{"ref_index":8,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"D.-M. Chiu and R. Jain, “Analysis of the increase/decrease algorithms for congestion avoidance in computer networks,” Computer Networks and ISDN Systems, vol. 17, no. 1, pp. 1– 14, 1989. [Online]. Available: https://doi.org/10.1016/0169- 75","reconstructed_doi":"10.1016/0169-7552(89"},"severity":"advisory","ref_index":8,"audited_at":"2026-07-11T13:07:03.578875Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/0169-7552(89","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"cbb474b45d203c6076ce30bbf88b8327366f7268686daebae15c128020e4e351","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":12200,"payload_sha256":"d4c29a4d07d839bda2bfbe636eec7ef21a50b8ceb9acc8aea2ae28ee78fa82db","signature_b64":"bpjBQh7QWZZrdrX+YPWosJfH9xCYKzKUZWs1g4GGElEMym+d28uCgUs/mo4Mi0jWLVBXD0R6qrWdKM1jgL7jDA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-11T13:11:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6lUsvhA5PAEXWuHdILNtLRbo9aZ8j/Vf1/ZbN40o0hzJF691kKyF/qbv9D3vVFBQWDJD2jod0cd+aJhLHV9TDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T20:38:03.444102Z"},"content_sha256":"c4591a2915ed52b4f4dda17089d1379733fe041d255ebb80d7bb2966f95063c8","schema_version":"1.0","event_id":"sha256:c4591a2915ed52b4f4dda17089d1379733fe041d255ebb80d7bb2966f95063c8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4MQDFV4SVPA3DYWBVITJNP6Q7P/bundle.json","state_url":"https://pith.science/pith/4MQDFV4SVPA3DYWBVITJNP6Q7P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4MQDFV4SVPA3DYWBVITJNP6Q7P/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-31T20:38:03Z","links":{"resolver":"https://pith.science/pith/4MQDFV4SVPA3DYWBVITJNP6Q7P","bundle":"https://pith.science/pith/4MQDFV4SVPA3DYWBVITJNP6Q7P/bundle.json","state":"https://pith.science/pith/4MQDFV4SVPA3DYWBVITJNP6Q7P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4MQDFV4SVPA3DYWBVITJNP6Q7P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:4MQDFV4SVPA3DYWBVITJNP6Q7P","merge_version":"pith-open-graph-merge-v1","event_count":6,"valid_event_count":6,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b89188df6ddf0159ff5060a9578d15679bf66958911a0bd048f8373aff923c78","cross_cats_sorted":["cs.PF"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2026-07-06T08:52:20Z","title_canon_sha256":"99469b2d419e5d0210fd25b4de97c3382497e93806be9932d23566aa7869e5b7"},"schema_version":"1.0","source":{"id":"2607.04821","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.04821","created_at":"2026-07-07T02:20:05Z"},{"alias_kind":"arxiv_version","alias_value":"2607.04821v1","created_at":"2026-07-07T02:20:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.04821","created_at":"2026-07-07T02:20:05Z"},{"alias_kind":"pith_short_12","alias_value":"4MQDFV4SVPA3","created_at":"2026-07-07T02:20:05Z"},{"alias_kind":"pith_short_16","alias_value":"4MQDFV4SVPA3DYWB","created_at":"2026-07-07T02:20:05Z"},{"alias_kind":"pith_short_8","alias_value":"4MQDFV4S","created_at":"2026-07-07T02:20:05Z"}],"graph_snapshots":[{"event_id":"sha256:318787028bf719531246cdd994e5df9d0b83d9ea39add1960d23c16a7de311dd","target":"graph","created_at":"2026-07-07T02:20:05Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.04821/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This study assesses the scalability of process-based and thread-based schedulers for many-core shared-memory systems using a memory-intensive row-wise quick-sort workload on large three-dimensional tensors. The process-based evaluation considers bounded prolific, bounded collective, and three pipe-based producer-consumer schedulers: one-to-one, one-to-many, and many-to-many. These pipe schedulers dynamically stream task identifiers to worker processes, exchanging increased inter-process communication overhead for enhanced runtime load balancing and flexible chunk-based task dispatching. The th","authors_text":"Anastasia Papouda, Anna Maria Sidiropoulou, Argyro Gailla, Dimitrios Kontodimos, George Tavridis, Hermione Kimpouropoulou, Kleopatra Kontogianni, Mejgan Dedaj, Michail Panagiotidis Kannas, Sotirios Kontogiannis, Stamatia Kastrinaki, Theofanis Ioannou","cross_cats":["cs.PF"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2026-07-06T08:52:20Z","title":"Performance evaluation of scheduling tasks in many-core systems utilizing processes and threads"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.04821","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:79847e1fd29b04108d3d9024687d14552e44e4c1eef4b2c51eb685383b8b98d0","target":"record","created_at":"2026-07-07T02:20:05Z","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":"b89188df6ddf0159ff5060a9578d15679bf66958911a0bd048f8373aff923c78","cross_cats_sorted":["cs.PF"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2026-07-06T08:52:20Z","title_canon_sha256":"99469b2d419e5d0210fd25b4de97c3382497e93806be9932d23566aa7869e5b7"},"schema_version":"1.0","source":{"id":"2607.04821","kind":"arxiv","version":1}},"canonical_sha256":"e32032d792abc1b1e2c1aa2696bfd0fbc1537ba2e503efe0762d0ef2dea4b486","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e32032d792abc1b1e2c1aa2696bfd0fbc1537ba2e503efe0762d0ef2dea4b486","first_computed_at":"2026-07-07T02:20:05.370591Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-07T02:20:05.370591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S+jMgeJWuDI7IfSszCsi7BusmOqS5qKBp4+QI0EQl9YLGydSu9xN4wMiOZb5bqvqmXzFxu8JXaCijCf+GFJGDQ==","signature_status":"signed_v1","signed_at":"2026-07-07T02:20:05.371973Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.04821","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:928a161d90f36807a1ad68d95bc5b628a4ecce85361669679611a0c4248f3b4b","sha256:b740ddca60c2953b7676d30abe7ce7051c14f2ac909dccc9e32c3a034fb0c6a0","sha256:c4591a2915ed52b4f4dda17089d1379733fe041d255ebb80d7bb2966f95063c8","sha256:f711cde087c7178976eff886ba126e62ba7ad8af4c248561063dd611ce5fac68"]}],"invalid_events":[],"applied_event_ids":["sha256:79847e1fd29b04108d3d9024687d14552e44e4c1eef4b2c51eb685383b8b98d0","sha256:318787028bf719531246cdd994e5df9d0b83d9ea39add1960d23c16a7de311dd"],"state_sha256":"dd40508a49c80a4a757e9dbec903430213f070e46257caeae652d31627e63984"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n8SU8ZS5sAV8MxAgf9jeZL0pOjlV54vQddVEhc0nGLt5cugfsahiVjYlqJXW7A6aXgPjbnYzIRCl4DGfz6oQAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-31T20:38:03.451347Z","bundle_sha256":"41de377ddd693f96549b8938dee24d448e99a1360b1ae0192d8220067b9d2383"}}