{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:XATZ2PHPMW4J6O3L5IMODQFNUQ","short_pith_number":"pith:XATZ2PHP","canonical_record":{"source":{"id":"1606.08156","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-06-27T08:14:11Z","cross_cats_sorted":[],"title_canon_sha256":"6f8172ecfd486ae1eeb04f03296c473bbe816424544f7098617fe2b5579b8ca4","abstract_canon_sha256":"cca51616428e6a4bfbe16eebcf553b8e92b57b54b8e46b04be281837e32e1f08"},"schema_version":"1.0"},"canonical_sha256":"b8279d3cef65b89f3b6bea18e1c0ada4231c2e282fa3fe1d69267ddaff39d3aa","source":{"kind":"arxiv","id":"1606.08156","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.08156","created_at":"2026-05-18T01:11:52Z"},{"alias_kind":"arxiv_version","alias_value":"1606.08156v1","created_at":"2026-05-18T01:11:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.08156","created_at":"2026-05-18T01:11:52Z"},{"alias_kind":"pith_short_12","alias_value":"XATZ2PHPMW4J","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XATZ2PHPMW4J6O3L","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XATZ2PHP","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:XATZ2PHPMW4J6O3L5IMODQFNUQ","target":"record","payload":{"canonical_record":{"source":{"id":"1606.08156","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-06-27T08:14:11Z","cross_cats_sorted":[],"title_canon_sha256":"6f8172ecfd486ae1eeb04f03296c473bbe816424544f7098617fe2b5579b8ca4","abstract_canon_sha256":"cca51616428e6a4bfbe16eebcf553b8e92b57b54b8e46b04be281837e32e1f08"},"schema_version":"1.0"},"canonical_sha256":"b8279d3cef65b89f3b6bea18e1c0ada4231c2e282fa3fe1d69267ddaff39d3aa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:52.650039Z","signature_b64":"Sj8lvTvxT/qnVVZ5tgakMCp9fOFty+5XrEBOJF9/2GIBAyGmqHUW5Ot0qYnbN6aPezhLUmj1wzX0seOSYtbICg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8279d3cef65b89f3b6bea18e1c0ada4231c2e282fa3fe1d69267ddaff39d3aa","last_reissued_at":"2026-05-18T01:11:52.649700Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:52.649700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.08156","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-18T01:11:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1vGdz0EUPEotydRAJpyZJ9W8ud8thbbQWkUTF9Uw7Kv8HGJcsSY0vY8YNyOvm3+czQi7a4Bamagxv5rU7MScCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T02:40:53.677506Z"},"content_sha256":"2cbaa33907a45f213cb5bb0fd14d92ef5d3f3d413fe73501d0da4e9f8a91e931","schema_version":"1.0","event_id":"sha256:2cbaa33907a45f213cb5bb0fd14d92ef5d3f3d413fe73501d0da4e9f8a91e931"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:XATZ2PHPMW4J6O3L5IMODQFNUQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Dynamic Pinning of Parallelized Applications by Distributed Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Georgios C. Chasparis, Michael Rossbory","submitted_at":"2016-06-27T08:14:11Z","abstract_excerpt":"This paper introduces a resource allocation framework specifically tailored for addressing the problem of dynamic placement (or pinning) of parallelized applications to processing units. Under the proposed setup each thread of the parallelized application constitutes an independent decision maker (or agent), which (based on its own prior performance measurements and its own prior CPU-affinities) decides on which processing unit to run next. Decisions are updated recursively for each thread by a resource manager/scheduler which runs in parallel to the application's threads and periodically reco"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.08156","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-18T01:11:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9wlmXRSZCoGm7xYRls8XblIHQFzQXKS7fYgM1O4Yf+kJ+1fVj0na9OPq1/WxgcJzPTdf5PW6Q3Q2/wr9XiIxCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T02:40:53.677863Z"},"content_sha256":"8be2836d78f15cbc9911adad92de4c7ccabba4e28d2e7749e3530d1f2e46d1ff","schema_version":"1.0","event_id":"sha256:8be2836d78f15cbc9911adad92de4c7ccabba4e28d2e7749e3530d1f2e46d1ff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XATZ2PHPMW4J6O3L5IMODQFNUQ/bundle.json","state_url":"https://pith.science/pith/XATZ2PHPMW4J6O3L5IMODQFNUQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XATZ2PHPMW4J6O3L5IMODQFNUQ/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-05T02:40:53Z","links":{"resolver":"https://pith.science/pith/XATZ2PHPMW4J6O3L5IMODQFNUQ","bundle":"https://pith.science/pith/XATZ2PHPMW4J6O3L5IMODQFNUQ/bundle.json","state":"https://pith.science/pith/XATZ2PHPMW4J6O3L5IMODQFNUQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XATZ2PHPMW4J6O3L5IMODQFNUQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XATZ2PHPMW4J6O3L5IMODQFNUQ","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":"cca51616428e6a4bfbe16eebcf553b8e92b57b54b8e46b04be281837e32e1f08","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-06-27T08:14:11Z","title_canon_sha256":"6f8172ecfd486ae1eeb04f03296c473bbe816424544f7098617fe2b5579b8ca4"},"schema_version":"1.0","source":{"id":"1606.08156","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.08156","created_at":"2026-05-18T01:11:52Z"},{"alias_kind":"arxiv_version","alias_value":"1606.08156v1","created_at":"2026-05-18T01:11:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.08156","created_at":"2026-05-18T01:11:52Z"},{"alias_kind":"pith_short_12","alias_value":"XATZ2PHPMW4J","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XATZ2PHPMW4J6O3L","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XATZ2PHP","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:8be2836d78f15cbc9911adad92de4c7ccabba4e28d2e7749e3530d1f2e46d1ff","target":"graph","created_at":"2026-05-18T01:11:52Z","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":"This paper introduces a resource allocation framework specifically tailored for addressing the problem of dynamic placement (or pinning) of parallelized applications to processing units. Under the proposed setup each thread of the parallelized application constitutes an independent decision maker (or agent), which (based on its own prior performance measurements and its own prior CPU-affinities) decides on which processing unit to run next. Decisions are updated recursively for each thread by a resource manager/scheduler which runs in parallel to the application's threads and periodically reco","authors_text":"Georgios C. Chasparis, Michael Rossbory","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-06-27T08:14:11Z","title":"Efficient Dynamic Pinning of Parallelized Applications by Distributed Reinforcement Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.08156","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:2cbaa33907a45f213cb5bb0fd14d92ef5d3f3d413fe73501d0da4e9f8a91e931","target":"record","created_at":"2026-05-18T01:11:52Z","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":"cca51616428e6a4bfbe16eebcf553b8e92b57b54b8e46b04be281837e32e1f08","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-06-27T08:14:11Z","title_canon_sha256":"6f8172ecfd486ae1eeb04f03296c473bbe816424544f7098617fe2b5579b8ca4"},"schema_version":"1.0","source":{"id":"1606.08156","kind":"arxiv","version":1}},"canonical_sha256":"b8279d3cef65b89f3b6bea18e1c0ada4231c2e282fa3fe1d69267ddaff39d3aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8279d3cef65b89f3b6bea18e1c0ada4231c2e282fa3fe1d69267ddaff39d3aa","first_computed_at":"2026-05-18T01:11:52.649700Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:52.649700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Sj8lvTvxT/qnVVZ5tgakMCp9fOFty+5XrEBOJF9/2GIBAyGmqHUW5Ot0qYnbN6aPezhLUmj1wzX0seOSYtbICg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:52.650039Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.08156","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2cbaa33907a45f213cb5bb0fd14d92ef5d3f3d413fe73501d0da4e9f8a91e931","sha256:8be2836d78f15cbc9911adad92de4c7ccabba4e28d2e7749e3530d1f2e46d1ff"],"state_sha256":"16d8eccd3576d3a8ba0d3eeef24e79d03cd5c2839ef93d933b542678da4f0792"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jXA8mr9ZSlMaqa11u3Rk5ClJPaClQJnBLRAVxLkuJEZyvH1xvI58v9qAaN86FU1mCngn73CkvmTAwAViXNDPDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T02:40:53.679784Z","bundle_sha256":"97a772eb67302edc458a5eba965c1f805da354260b0a8632592c90f58bf64f0b"}}