{"as_of":"2026-08-22T02:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:785c10a8a28fda0daf9179c276c24d4a5a451d1958f126c907d8de3368d95a9f","coverage":[{"denominator":33,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":33,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-11T13:01:03.206337Z","state":"measured"},{"denominator":33,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":33,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.04821/citation-record","integrity":"/paper/2607.04821/integrity","json":"/paper/2607.04821/citation-record.json","paper":"/paper/2607.04821"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T13:01:03.206337Z","title":"Compiler-assisted, adaptive runtime system for the support of OpenMP in embedded multicores,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.04821","last_updated":"2026-07-06T08:52:20Z","snapshot_observed_at":"2026-08-21T00:36:58.469757Z","submitted_at":"2026-07-06T08:52:20Z","title":"Performance evaluation of scheduling tasks in many-core systems utilizing processes and threads","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-11T13:01:03.206337Z"},"links":{"citing_paper":"/paper/2607.04821"},"observation_digest":"sha256:e82b5527262236e0086231294c9dbcaa7334ec13235544e5de3368f10271be1e","observation_id":"093ce295-0596-49d7-b50a-7eb96696928a","resolution":{"observed_at":"2026-07-11T13:01:03.206337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T13:01:03.206337Z","title":"Adaptive Thread Scheduling in Chip Multiprocessors,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04821","last_updated":"2026-07-06T08:52:20Z","snapshot_observed_at":"2026-08-21T00:36:58.469757Z","submitted_at":"2026-07-06T08:52:20Z","title":"Performance evaluation of scheduling tasks in many-core systems utilizing processes and threads","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-11T13:01:03.206337Z"},"links":{"citing_paper":"/paper/2607.04821"},"observation_digest":"sha256:9b15049050e3127f0fc928f9ed035a740b0743d2b65bebff9cae87ddaac854a2","observation_id":"9fef1c65-830f-4188-8637-f67beb9d1d92","resolution":{"observed_at":"2026-07-11T13:01:03.206337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T13:01:03.206337Z","title":"Available: http://link.springer.com/10.1007/ s10766-019-00637-y 2, 5","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04821","last_updated":"2026-07-06T08:52:20Z","snapshot_observed_at":"2026-08-21T00:36:58.469757Z","submitted_at":"2026-07-06T08:52:20Z","title":"Performance evaluation of scheduling tasks in many-core systems utilizing processes and threads","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-11T13:01:03.206337Z"},"links":{"citing_paper":"/paper/2607.04821"},"observation_digest":"sha256:a95207b653f465f5cc28dafd1d688f60170dd27385f74eeb3af9d87bd89a23a9","observation_id":"def4479f-69ac-4c79-bc9e-2e33e1a26fe8","resolution":{"observed_at":"2026-07-11T13:01:03.206337Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T13:01:03.206337Z","title":"Validity of the single processor approach to achieving large-scale computing capabilities,","venue":null,"work_id":null,"year":1967},"citing_paper":{"arxiv_id":"2607.04821","last_updated":"2026-07-06T08:52:20Z","snapshot_observed_at":"2026-08-21T00:36:58.469757Z","submitted_at":"2026-07-06T08:52:20Z","title":"Performance evaluation of scheduling tasks in many-core systems utilizing processes and threads","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-11T13:01:03.206337Z"},"links":{"citing_paper":"/paper/2607.04821"},"observation_digest":"sha256:f34757ca7d5b667c3e71b5f5ae4dce0ae0d8c49c5880e71181bc33e36ce7b574","observation_id":"22f86c56-1c42-4ae3-af29-3d5ba98a3ecd","resolution":{"observed_at":"2026-07-11T13:01:03.206337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T13:01:03.206337Z","title":"Scheduling multi- threaded computations by work stealing,","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.04821","last_updated":"2026-07-06T08:52:20Z","snapshot_observed_at":"2026-08-21T00:36:58.469757Z","submitted_at":"2026-07-06T08:52:20Z","title":"Performance evaluation of scheduling tasks in many-core systems utilizing processes and threads","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-11T13:01:03.206337Z"},"links":{"citing_paper":"/paper/2607.04821"},"observation_digest":"sha256:63c3fcbad3cb7e7ad369bb2b8675ecbd14508adace13cce1db0a1abb9cfc7bff","observation_id":"4f3f42ab-9bd3-417f-8ce2-52c4e4821e30","resolution":{"observed_at":"2026-07-11T13:01:03.206337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T13:01:03.206337Z","title":"An adaptive self-scheduling loop scheduler,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.04821","last_updated":"2026-07-06T08:52:20Z","snapshot_observed_at":"2026-08-21T00:36:58.469757Z","submitted_at":"2026-07-06T08:52:20Z","title":"Performance evaluation of scheduling tasks in many-core systems utilizing processes and threads","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-11T13:01:03.206337Z"},"links":{"citing_paper":"/paper/2607.04821"},"observation_digest":"sha256:be8e914134da3f8e474eed7c7adcf5d17a7b14a8bf0c89b9e8b43d54202ab551","observation_id":"dd343b58-0bd0-4240-b00f-a8b199e26f3c","resolution":{"observed_at":"2026-07-11T13:01:03.206337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T13:01:03.206337Z","title":null,"venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.04821","last_updated":"2026-07-06T08:52:20Z","snapshot_observed_at":"2026-08-21T00:36:58.469757Z","submitted_at":"2026-07-06T08:52:20Z","title":"Performance evaluation of scheduling tasks in many-core systems utilizing processes and threads","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-11T13:01:03.206337Z"},"links":{"citing_paper":"/paper/2607.04821"},"observation_digest":"sha256:ba6bdbc33535fe4b9fc0dde0a2093559f7eb6e471eb6c89ce0629fc7078585cc","observation_id":"437afabd-2112-46d3-b734-17c53560f5c2","resolution":{"observed_at":"2026-07-11T13:01:03.206337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T13:01:03.206337Z","title":"Analysis of the increase/decrease algorithms for congestion avoidance in computer networks,","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2607.04821","last_updated":"2026-07-06T08:52:20Z","snapshot_observed_at":"2026-08-21T00:36:58.469757Z","submitted_at":"2026-07-06T08:52:20Z","title":"Performance evaluation of scheduling tasks in many-core systems utilizing processes and threads","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-11T13:01:03.206337Z"},"links":{"citing_paper":"/paper/2607.04821"},"observation_digest":"sha256:7c716d67b74101b5698e5f3e6e120dffe5345d5764a223d65e3a1ab9820f68fb","observation_id":"2f851e49-7575-4354-90dc-ad7172b2f845","resolution":{"observed_at":"2026-07-11T13:01:03.206337Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T13:01:03.206337Z","title":"Evaluation of OpenMP Task Scheduling Algorithms for Large NUMA Ar- chitectures,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.04821","last_updated":"2026-07-06T08:52:20Z","snapshot_observed_at":"2026-08-21T00:36:58.469757Z","submitted_at":"2026-07-06T08:52:20Z","title":"Performance evaluation of scheduling tasks in many-core systems utilizing processes and threads","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-11T13:01:03.206337Z"},"links":{"citing_paper":"/paper/2607.04821"},"observation_digest":"sha256:a460f0288ae4d6c8aa2ef97560fdf64b024f6dda8081f2ec7e088a046d781c04","observation_id":"699edd10-8c5d-497d-8b5c-601b987bd9ee","resolution":{"observed_at":"2026-07-11T13:01:03.206337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T13:01:03.206337Z","title":"Co-operating sequential processes,","venue":null,"work_id":null,"year":1966},"citing_paper":{"arxiv_id":"2607.04821","last_updated":"2026-07-06T08:52:20Z","snapshot_observed_at":"2026-08-21T00:36:58.469757Z","submitted_at":"2026-07-06T08:52:20Z","title":"Performance evaluation of scheduling tasks in many-core systems utilizing processes and threads","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-11T13:01:03.206337Z"},"links":{"citing_paper":"/paper/2607.04821"},"observation_digest":"sha256:34aeb7202966aa7d23536be46b980636ceb84b9a79450c4de37d0523219bd04b","observation_id":"571e5b44-e5a5-4978-ae29-dc551434cca1","resolution":{"observed_at":"2026-07-11T13:01:03.206337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T13:01:03.206337Z","title":"Gropp, E","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.04821","last_updated":"2026-07-06T08:52:20Z","snapshot_observed_at":"2026-08-21T00:36:58.469757Z","submitted_at":"2026-07-06T08:52:20Z","title":"Performance evaluation of scheduling tasks in many-core systems utilizing processes and threads","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-11T13:01:03.206337Z"},"links":{"citing_paper":"/paper/2607.04821"},"observation_digest":"sha256:0a6ff41248f7bb2f794bcfca43645dbd1ea613b59f01dd7ea0c4088a4430e318","observation_id":"1175044d-d7a3-4a80-9fe6-2d6cebc5fb30","resolution":{"observed_at":"2026-07-11T13:01:03.206337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T13:01:03.206337Z","title":"A simple capacity model of massively parallel transaction systems,","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2607.04821","last_updated":"2026-07-06T08:52:20Z","snapshot_observed_at":"2026-08-21T00:36:58.469757Z","submitted_at":"2026-07-06T08:52:20Z","title":"Performance evaluation of scheduling tasks in many-core systems utilizing processes and threads","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-11T13:01:03.206337Z"},"links":{"citing_paper":"/paper/2607.04821"},"observation_digest":"sha256:56efae042b3f88b2770f5ae340bc92e59c5580c9d443660e6a6bfac1c087f295","observation_id":"74706f20-fc3d-40cf-8494-6099a9394b62","resolution":{"observed_at":"2026-07-11T13:01:03.206337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"0808.1431","last_updated":"2008-08-25T16:20:42Z","snapshot_observed_at":"2026-08-15T10:09:10.274905Z","submitted_at":"2008-08-11T00:06:16Z","title":"A General Theory of Computational Scalability Based on Rational Functions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0808.1431","snapshot_observed_at":"2026-07-11T13:01:03.206337Z","title":"A General Theory of Computational Scalability Based on Rational Functions,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.04821","last_updated":"2026-07-06T08:52:20Z","snapshot_observed_at":"2026-08-21T00:36:58.469757Z","submitted_at":"2026-07-06T08:52:20Z","title":"Performance evaluation of scheduling tasks in many-core systems utilizing processes and threads","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-11T13:01:03.206337Z"},"links":{"cited_paper":"/paper/0808.1431","citing_paper":"/paper/2607.04821"},"observation_digest":"sha256:ceb7056ddbe8d10df770fbbfebb5b7d2fe2bec7974f3d2e576d9ec1e8cef57fe","observation_id":"59a81e83-d586-48f0-9ceb-20cced3a2b2e","resolution":{"observed_at":"2026-07-11T13:01:03.206337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T13:01:03.206337Z","title":"Slaw: A scalable locality-aware adaptive work-stealing scheduler,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.04821","last_updated":"2026-07-06T08:52:20Z","snapshot_observed_at":"2026-08-21T00:36:58.469757Z","submitted_at":"2026-07-06T08:52:20Z","title":"Performance evaluation of scheduling tasks in many-core systems utilizing processes and threads","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-11T13:01:03.206337Z"},"links":{"citing_paper":"/paper/2607.04821"},"observation_digest":"sha256:907a814998c2b03ce8ed5129a8cf9520787d989068dee481301d7969ae4e23c9","observation_id":"621cb6c7-fb3e-4364-abf8-9132a27d126d","resolution":{"observed_at":"2026-07-11T13:01:03.206337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T13:01:03.206337Z","title":"Reevaluating amdahl’s law,","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2607.04821","last_updated":"2026-07-06T08:52:20Z","snapshot_observed_at":"2026-08-21T00:36:58.469757Z","submitted_at":"2026-07-06T08:52:20Z","title":"Performance evaluation of scheduling tasks in many-core systems utilizing processes and threads","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-11T13:01:03.206337Z"},"links":{"citing_paper":"/paper/2607.04821"},"observation_digest":"sha256:392a2bbe7942390e2ffb575b3fb2284114dd317816e9f5a8576501eee4eb8973","observation_id":"18a6ee4a-ba67-476d-8637-e78f99f82518","resolution":{"observed_at":"2026-07-11T13:01:03.206337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T13:01:03.206337Z","title":"Communicating sequential processes,","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2607.04821","last_updated":"2026-07-06T08:52:20Z","snapshot_observed_at":"2026-08-21T00:36:58.469757Z","submitted_at":"2026-07-06T08:52:20Z","title":"Performance evaluation of scheduling tasks in many-core systems utilizing processes and threads","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-11T13:01:03.206337Z"},"links":{"citing_paper":"/paper/2607.04821"},"observation_digest":"sha256:a3c1a7d75150bcc20484437d053290f5d5e765ade2f272076e1c3258dd72eb76","observation_id":"9744e428-e185-46b9-90da-2bc013f8296f","resolution":{"observed_at":"2026-07-11T13:01:03.206337Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T13:01:03.206337Z","title":"[Online]","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.04821","last_updated":"2026-07-06T08:52:20Z","snapshot_observed_at":"2026-08-21T00:36:58.469757Z","submitted_at":"2026-07-06T08:52:20Z","title":"Performance evaluation of scheduling tasks in many-core systems utilizing processes and threads","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-11T13:01:03.206337Z"},"links":{"citing_paper":"/paper/2607.04821"},"observation_digest":"sha256:91f97867be17a9595b33c3de97a7b91a97a8aeb2cecc29d4995809bc376ba9fd","observation_id":"1f2ab17b-d764-4414-8fb3-10412fcf0f3b","resolution":{"observed_at":"2026-07-11T13:01:03.206337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/52324","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Congestion avoidance and control,","venue":null,"work_id":"b35b06a0-47b8-41e4-a919-2d30ae8e9379","year":1988},"citing_paper":{"arxiv_id":"2607.04821","last_updated":"2026-07-06T08:52:20Z","snapshot_observed_at":"2026-08-21T00:36:58.469757Z","submitted_at":"2026-07-06T08:52:20Z","title":"Performance evaluation of scheduling tasks in many-core systems utilizing processes and threads","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-11T13:01:03.206337Z"},"links":{"citing_paper":"/paper/2607.04821"},"observation_digest":"sha256:b773c154eca6ff6ed3e73ba89a2c352843dc3fa635594923011a9470a7629160","observation_id":"445646b7-af4a-4d69-a7e3-8fb90fb23de3","resolution":{"observed_at":"2026-07-11T13:08:01.472174Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T13:01:03.206337Z","title":"The real-time producer/consumer paradigm: A paradigm for the construction of efficient, predictable real- time systems,","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2607.04821","last_updated":"2026-07-06T08:52:20Z","snapshot_observed_at":"2026-08-21T00:36:58.469757Z","submitted_at":"2026-07-06T08:52:20Z","title":"Performance evaluation of scheduling tasks in many-core systems utilizing processes and threads","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-11T13:01:03.206337Z"},"links":{"citing_paper":"/paper/2607.04821"},"observation_digest":"sha256:8f931a461c272c90700d267d5de40cf8187af1bb36dfb23b70b53382dd38d09b","observation_id":"8ad56b64-3253-4462-a71c-aac1688620b1","resolution":{"observed_at":"2026-07-11T13:01:03.206337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T13:01:03.206337Z","title":"Measuring parallel processor performance,","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2607.04821","last_updated":"2026-07-06T08:52:20Z","snapshot_observed_at":"2026-08-21T00:36:58.469757Z","submitted_at":"2026-07-06T08:52:20Z","title":"Performance evaluation of scheduling tasks in many-core systems utilizing processes and threads","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-11T13:01:03.206337Z"},"links":{"citing_paper":"/paper/2607.04821"},"observation_digest":"sha256:15b3b0ee8e38f6d113cc328b3631bd5ea8b023c9633d162d0c30d288e60ef880","observation_id":"e53c2366-4ef9-45c2-b525-f1e3faf5afe8","resolution":{"observed_at":"2026-07-11T13:01:03.206337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T13:01:03.206337Z","title":"A probing al- gorithm with adaptive workload load balancing capabilities for heterogeneous clusters,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.04821","last_updated":"2026-07-06T08:52:20Z","snapshot_observed_at":"2026-08-21T00:36:58.469757Z","submitted_at":"2026-07-06T08:52:20Z","title":"Performance evaluation of scheduling tasks in many-core systems utilizing processes and threads","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-11T13:01:03.206337Z"},"links":{"citing_paper":"/paper/2607.04821"},"observation_digest":"sha256:1498ce35c38a7f9bb441bbdbaa5f16008aa03fa15dedda4704f7ead477671afb","observation_id":"88fe8799-b3a4-4902-ba76-5255311ca328","resolution":{"observed_at":"2026-07-11T13:01:03.206337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/11424505","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T13:08:01.465278Z","title":"Measuring transport protocol potential for energy efficiency,","venue":null,"work_id":"b8a942ea-0e7c-49e4-945a-0a1c90b7e281","year":2005},"citing_paper":{"arxiv_id":"2607.04821","last_updated":"2026-07-06T08:52:20Z","snapshot_observed_at":"2026-08-21T00:36:58.469757Z","submitted_at":"2026-07-06T08:52:20Z","title":"Performance evaluation of scheduling tasks in many-core systems utilizing processes and threads","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-11T13:01:03.206337Z"},"links":{"citing_paper":"/paper/2607.04821"},"observation_digest":"sha256:57e3d7276dadd857924d8d47d139662f3c5e98d707f5043a70eb6a114ddba10f","observation_id":"b80e3cbc-9901-4e46-8d3f-7fa03af91e11","resolution":{"observed_at":"2026-07-11T13:08:01.468325Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-07-12T01:50:43.115132+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T01:50:43.115132+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1504/ijcnds.2014","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T13:08:01.478003Z","title":"ALBL: An adaptive load balancing algorithm for distributed web systems,","venue":null,"work_id":"ac6fc443-7c8a-4c1c-9d5c-24626057fa79","year":2014},"citing_paper":{"arxiv_id":"2607.04821","last_updated":"2026-07-06T08:52:20Z","snapshot_observed_at":"2026-08-21T00:36:58.469757Z","submitted_at":"2026-07-06T08:52:20Z","title":"Performance evaluation of scheduling tasks in many-core systems utilizing processes and threads","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-11T13:01:03.206337Z"},"links":{"citing_paper":"/paper/2607.04821"},"observation_digest":"sha256:025181b6770fedeb35ef9f536137f4fd727228339774665acd8472f7af24fc83","observation_id":"0e2e91a5-6105-471a-aec7-b45d74e72815","resolution":{"observed_at":"2026-07-11T13:08:01.479821Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-07-12T01:50:43.514881+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T01:50:43.514881+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T13:01:03.206337Z","title":"A probing algorithm with Adaptive Workload Load Balancing capabilities for heterogeneous clusters,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.04821","last_updated":"2026-07-06T08:52:20Z","snapshot_observed_at":"2026-08-21T00:36:58.469757Z","submitted_at":"2026-07-06T08:52:20Z","title":"Performance evaluation of scheduling tasks in many-core systems utilizing processes and threads","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-11T13:01:03.206337Z"},"links":{"citing_paper":"/paper/2607.04821"},"observation_digest":"sha256:5950a91e3ba4bad5a427bb40582993292538bc9743ffd249c46c5c8d428d4e4d","observation_id":"b2be3587-f5b4-4681-9f3c-cc9b9c401660","resolution":{"observed_at":"2026-07-11T13:01:03.206337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T13:01:03.206337Z","title":"Advanced scheduling with genetic algo- rithms in supply networks,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.04821","last_updated":"2026-07-06T08:52:20Z","snapshot_observed_at":"2026-08-21T00:36:58.469757Z","submitted_at":"2026-07-06T08:52:20Z","title":"Performance evaluation of scheduling tasks in many-core systems utilizing processes and threads","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-11T13:01:03.206337Z"},"links":{"citing_paper":"/paper/2607.04821"},"observation_digest":"sha256:58092a005476183d57d174603428a10e71d7a40263582be19db87fad41bfab0b","observation_id":"3c50eb3f-b530-4f46-8cda-a7603a1b7358","resolution":{"observed_at":"2026-07-11T13:01:03.206337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T13:01:03.206337Z","title":"[Online]","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.04821","last_updated":"2026-07-06T08:52:20Z","snapshot_observed_at":"2026-08-21T00:36:58.469757Z","submitted_at":"2026-07-06T08:52:20Z","title":"Performance evaluation of scheduling tasks in many-core systems utilizing processes and threads","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-11T13:01:03.206337Z"},"links":{"citing_paper":"/paper/2607.04821"},"observation_digest":"sha256:00979f33428901f5c293242b59d481b1256e0b52a01d9ee5b5cf40a4b9be26e4","observation_id":"43b709cc-f4b1-4ede-b419-84fb596fe572","resolution":{"observed_at":"2026-07-11T13:01:03.206337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T13:01:03.206337Z","title":"Fair adaptive parallelism for concurrent transactional memory applications,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.04821","last_updated":"2026-07-06T08:52:20Z","snapshot_observed_at":"2026-08-21T00:36:58.469757Z","submitted_at":"2026-07-06T08:52:20Z","title":"Performance evaluation of scheduling tasks in many-core systems utilizing processes and threads","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-11T13:01:03.206337Z"},"links":{"citing_paper":"/paper/2607.04821"},"observation_digest":"sha256:ef7ece32f65fbc88d5be731a2125f62bc1c6135a14845d432b7b39ed1aab5f1f","observation_id":"07294313-1ba3-47f2-bc58-f1ac2d646d45","resolution":{"observed_at":"2026-07-11T13:01:03.206337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T13:01:03.206337Z","title":"A comparative study of openmp scheduling algorithm selec- tion strategies,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04821","last_updated":"2026-07-06T08:52:20Z","snapshot_observed_at":"2026-08-21T00:36:58.469757Z","submitted_at":"2026-07-06T08:52:20Z","title":"Performance evaluation of scheduling tasks in many-core systems utilizing processes and threads","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-11T13:01:03.206337Z"},"links":{"citing_paper":"/paper/2607.04821"},"observation_digest":"sha256:65707e5fda468f394da0ec41b67895bb32c261a7dc0f1bc533a19a6fbe2f4315","observation_id":"5e228096-5ece-48df-8a05-a9584d58905a","resolution":{"observed_at":"2026-07-11T13:01:03.206337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T13:01:03.206337Z","title":"Openmp application programming interface version 5.2,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.04821","last_updated":"2026-07-06T08:52:20Z","snapshot_observed_at":"2026-08-21T00:36:58.469757Z","submitted_at":"2026-07-06T08:52:20Z","title":"Performance evaluation of scheduling tasks in many-core systems utilizing processes and threads","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-11T13:01:03.206337Z"},"links":{"citing_paper":"/paper/2607.04821"},"observation_digest":"sha256:c16aeb752f633956043142e090ce82fef9524751276bae88e1be439d970ec826","observation_id":"50ddc0db-f867-4a9f-9f8e-07a0a395cc0e","resolution":{"observed_at":"2026-07-11T13:01:03.206337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T13:01:03.206337Z","title":"A comparison of processes and threads cre- ation,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04821","last_updated":"2026-07-06T08:52:20Z","snapshot_observed_at":"2026-08-21T00:36:58.469757Z","submitted_at":"2026-07-06T08:52:20Z","title":"Performance evaluation of scheduling tasks in many-core systems utilizing processes and threads","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-11T13:01:03.206337Z"},"links":{"citing_paper":"/paper/2607.04821"},"observation_digest":"sha256:ede4a71a321e61fe78febb970815f68e9e2467d29d9ced2ff3a8c432963c35c6","observation_id":"759449a0-0afd-4aca-9533-01a0d9380aa7","resolution":{"observed_at":"2026-07-11T13:01:03.206337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T13:01:03.206337Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.04821","last_updated":"2026-07-06T08:52:20Z","snapshot_observed_at":"2026-08-21T00:36:58.469757Z","submitted_at":"2026-07-06T08:52:20Z","title":"Performance evaluation of scheduling tasks in many-core systems utilizing processes and threads","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-11T13:01:03.206337Z"},"links":{"citing_paper":"/paper/2607.04821"},"observation_digest":"sha256:96852ea95ed8c3bc96772f31b0c591aa732a4c52ee1f3c66d00b652076e9c28d","observation_id":"9f1d3345-2090-454a-9bdb-68d1617ddd4d","resolution":{"observed_at":"2026-07-11T13:01:03.206337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T13:01:03.206337Z","title":"Automatic openmp loop scheduling: A combined compiler and runtime approach,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.04821","last_updated":"2026-07-06T08:52:20Z","snapshot_observed_at":"2026-08-21T00:36:58.469757Z","submitted_at":"2026-07-06T08:52:20Z","title":"Performance evaluation of scheduling tasks in many-core systems utilizing processes and threads","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-11T13:01:03.206337Z"},"links":{"citing_paper":"/paper/2607.04821"},"observation_digest":"sha256:4a562a6fe8e61b0fa6c7592daf1fc125a126d5acf0093f79e2fcee8a7de11fd2","observation_id":"3d30a383-bc91-4f83-8a25-741b3e7f461f","resolution":{"observed_at":"2026-07-11T13:01:03.206337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T13:01:03.206337Z","title":"Investigating High- Performance Computing of Matrix Multiplications us- ing Processes, Threads, OpenMP, and MPI: A Case Study of Experiments on X86, ARM, and ARM Clus- ters,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04821","last_updated":"2026-07-06T08:52:20Z","snapshot_observed_at":"2026-08-21T00:36:58.469757Z","submitted_at":"2026-07-06T08:52:20Z","title":"Performance evaluation of scheduling tasks in many-core systems utilizing processes and threads","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-11T13:01:03.206337Z"},"links":{"citing_paper":"/paper/2607.04821"},"observation_digest":"sha256:33fa2198625247ee33b8621e77ded4c662f61e6edccc57e8621f1388a90bff27","observation_id":"5b86deaf-51d8-40cf-925c-433837063bdf","resolution":{"observed_at":"2026-07-11T13:01:03.206337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.04821","last_updated":"2026-07-06T08:52:20Z","latest_version":1,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-21T00:36:58.469757Z","submitted_at":"2026-07-06T08:52:20Z","title":"Performance evaluation of scheduling tasks in many-core systems utilizing processes and threads"},"reference_resolution":{"displayed":33,"state_counts":{"malformed_identifier":4,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":27,"verified_exact":2,"verified_fuzzy":0},"total_outbound_references":33},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 33 of 33 outbound references and 0 inbound Pith citation observations for arXiv:2607.04821."}