{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:X7QGHUVZOTW4XJGVKFPYZW3PSC","short_pith_number":"pith:X7QGHUVZ","canonical_record":{"source":{"id":"1805.12041","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2018-05-30T15:42:05Z","cross_cats_sorted":[],"title_canon_sha256":"07f5756c776f7c3d87accd659f032eadb621d342f872e76195508144f0d2a383","abstract_canon_sha256":"92b97b172d6e7133e0bf9595725c8b4ff286b22bbc2fada687091614d7ab3b23"},"schema_version":"1.0"},"canonical_sha256":"bfe063d2b974edcba4d5515f8cdb6f908717ab4eaa11ff2aa04b691a55360980","source":{"kind":"arxiv","id":"1805.12041","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.12041","created_at":"2026-05-18T00:14:35Z"},{"alias_kind":"arxiv_version","alias_value":"1805.12041v1","created_at":"2026-05-18T00:14:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.12041","created_at":"2026-05-18T00:14:35Z"},{"alias_kind":"pith_short_12","alias_value":"X7QGHUVZOTW4","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"X7QGHUVZOTW4XJGV","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"X7QGHUVZ","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:X7QGHUVZOTW4XJGVKFPYZW3PSC","target":"record","payload":{"canonical_record":{"source":{"id":"1805.12041","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2018-05-30T15:42:05Z","cross_cats_sorted":[],"title_canon_sha256":"07f5756c776f7c3d87accd659f032eadb621d342f872e76195508144f0d2a383","abstract_canon_sha256":"92b97b172d6e7133e0bf9595725c8b4ff286b22bbc2fada687091614d7ab3b23"},"schema_version":"1.0"},"canonical_sha256":"bfe063d2b974edcba4d5515f8cdb6f908717ab4eaa11ff2aa04b691a55360980","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:35.439114Z","signature_b64":"bj2/dMFnQO2/9Vj5SSaxWQFOZehhleCwRmEE6kSMPbhezhyOAPS03Hqd75qjrUJf45rfs4SXa7N5P/4t0Y2BDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bfe063d2b974edcba4d5515f8cdb6f908717ab4eaa11ff2aa04b691a55360980","last_reissued_at":"2026-05-18T00:14:35.438374Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:35.438374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.12041","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-18T00:14:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EgIHFOMP/2+3mukjXSzFoIl39IpQXBfQxV/XlEwpLlIiaX1lgnd2uh4zGBKm2+u7VJuYhPa7PX0f3ZCwqViBDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T14:43:05.209902Z"},"content_sha256":"b1af77699d3392a6eec11cab9c53e86601d71ede0fab6569fc4b15f5164fb8be","schema_version":"1.0","event_id":"sha256:b1af77699d3392a6eec11cab9c53e86601d71ede0fab6569fc4b15f5164fb8be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:X7QGHUVZOTW4XJGVKFPYZW3PSC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"BUNDLEP: Prioritizing Conflict Free Regions in Multi-Threaded Programs to Improve Cache Reuse -- Extended Results and Technical Report","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Corey Tessler, Nathan Fisher","submitted_at":"2018-05-30T15:42:05Z","abstract_excerpt":"In BUNDLE: Real-Time Multi-Threaded Scheduling to Reduce Cache Contention, Tessler and Fisher propose a scheduling mechanism and combined worst-case execution time calculation method that treats the instruction cache as a beneficial resource shared between threads. Object analysis produces a worst-case execution time bound and separates code segments into regions. Threads are dynamically placed in bundles as- sociated with regions at run time by the BUNDLE scheduling algorithm where they benefit from shared cache values.\n  In the evaluation of the previous work, tasks were created with a prede"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.12041","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-18T00:14:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n8+TPJDBtbluHH2dTXH+B5QJ/CJ/6dRXxbN9vftloyFZ0qRAiv3c5DTyJ3K41nP0HWfs4fTpALhYO2XP3YG6Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T14:43:05.210242Z"},"content_sha256":"3e2803d857f56196ce4ed609ebddaf66b2602644156ad327fbd5fd123a6e1bb2","schema_version":"1.0","event_id":"sha256:3e2803d857f56196ce4ed609ebddaf66b2602644156ad327fbd5fd123a6e1bb2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X7QGHUVZOTW4XJGVKFPYZW3PSC/bundle.json","state_url":"https://pith.science/pith/X7QGHUVZOTW4XJGVKFPYZW3PSC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X7QGHUVZOTW4XJGVKFPYZW3PSC/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-02T14:43:05Z","links":{"resolver":"https://pith.science/pith/X7QGHUVZOTW4XJGVKFPYZW3PSC","bundle":"https://pith.science/pith/X7QGHUVZOTW4XJGVKFPYZW3PSC/bundle.json","state":"https://pith.science/pith/X7QGHUVZOTW4XJGVKFPYZW3PSC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X7QGHUVZOTW4XJGVKFPYZW3PSC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:X7QGHUVZOTW4XJGVKFPYZW3PSC","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":"92b97b172d6e7133e0bf9595725c8b4ff286b22bbc2fada687091614d7ab3b23","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2018-05-30T15:42:05Z","title_canon_sha256":"07f5756c776f7c3d87accd659f032eadb621d342f872e76195508144f0d2a383"},"schema_version":"1.0","source":{"id":"1805.12041","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.12041","created_at":"2026-05-18T00:14:35Z"},{"alias_kind":"arxiv_version","alias_value":"1805.12041v1","created_at":"2026-05-18T00:14:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.12041","created_at":"2026-05-18T00:14:35Z"},{"alias_kind":"pith_short_12","alias_value":"X7QGHUVZOTW4","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"X7QGHUVZOTW4XJGV","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"X7QGHUVZ","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:3e2803d857f56196ce4ed609ebddaf66b2602644156ad327fbd5fd123a6e1bb2","target":"graph","created_at":"2026-05-18T00:14:35Z","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":"In BUNDLE: Real-Time Multi-Threaded Scheduling to Reduce Cache Contention, Tessler and Fisher propose a scheduling mechanism and combined worst-case execution time calculation method that treats the instruction cache as a beneficial resource shared between threads. Object analysis produces a worst-case execution time bound and separates code segments into regions. Threads are dynamically placed in bundles as- sociated with regions at run time by the BUNDLE scheduling algorithm where they benefit from shared cache values.\n  In the evaluation of the previous work, tasks were created with a prede","authors_text":"Corey Tessler, Nathan Fisher","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2018-05-30T15:42:05Z","title":"BUNDLEP: Prioritizing Conflict Free Regions in Multi-Threaded Programs to Improve Cache Reuse -- Extended Results and Technical Report"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.12041","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:b1af77699d3392a6eec11cab9c53e86601d71ede0fab6569fc4b15f5164fb8be","target":"record","created_at":"2026-05-18T00:14:35Z","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":"92b97b172d6e7133e0bf9595725c8b4ff286b22bbc2fada687091614d7ab3b23","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2018-05-30T15:42:05Z","title_canon_sha256":"07f5756c776f7c3d87accd659f032eadb621d342f872e76195508144f0d2a383"},"schema_version":"1.0","source":{"id":"1805.12041","kind":"arxiv","version":1}},"canonical_sha256":"bfe063d2b974edcba4d5515f8cdb6f908717ab4eaa11ff2aa04b691a55360980","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bfe063d2b974edcba4d5515f8cdb6f908717ab4eaa11ff2aa04b691a55360980","first_computed_at":"2026-05-18T00:14:35.438374Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:35.438374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bj2/dMFnQO2/9Vj5SSaxWQFOZehhleCwRmEE6kSMPbhezhyOAPS03Hqd75qjrUJf45rfs4SXa7N5P/4t0Y2BDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:35.439114Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.12041","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b1af77699d3392a6eec11cab9c53e86601d71ede0fab6569fc4b15f5164fb8be","sha256:3e2803d857f56196ce4ed609ebddaf66b2602644156ad327fbd5fd123a6e1bb2"],"state_sha256":"82661c1f3f569cc12408e780a6180bc47457dd3075ee9edf39e0e0c9b6166b69"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qJP+csj9GyeM8Bd6KQfihAb80VxBMhq1e3k4wfc7A5BHZr+yqr+zgWoEEo/6PL89qLPn8uu0jlRedfJIyd7XBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T14:43:05.212115Z","bundle_sha256":"f406e4f344ee26201522f821b0972e9f1a3394e3c919096f3e4e8fbf0fbb5375"}}