{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:27C2NSA6AXKBIAG3JEU62D67Q6","short_pith_number":"pith:27C2NSA6","canonical_record":{"source":{"id":"1506.03182","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2015-06-10T06:26:02Z","cross_cats_sorted":[],"title_canon_sha256":"d4f4eb9ca934baa09806a2339ff7aee1eb3885dbcc38feab37222f42a4c0bf6a","abstract_canon_sha256":"1cf97864987d9beace079221f42323ed3a1712e49f17cae91e42577e71017b01"},"schema_version":"1.0"},"canonical_sha256":"d7c5a6c81e05d41400db4929ed0fdf87827360b212647bcb23c985e95d2733e8","source":{"kind":"arxiv","id":"1506.03182","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.03182","created_at":"2026-05-18T01:34:34Z"},{"alias_kind":"arxiv_version","alias_value":"1506.03182v2","created_at":"2026-05-18T01:34:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03182","created_at":"2026-05-18T01:34:34Z"},{"alias_kind":"pith_short_12","alias_value":"27C2NSA6AXKB","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"27C2NSA6AXKBIAG3","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"27C2NSA6","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:27C2NSA6AXKBIAG3JEU62D67Q6","target":"record","payload":{"canonical_record":{"source":{"id":"1506.03182","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2015-06-10T06:26:02Z","cross_cats_sorted":[],"title_canon_sha256":"d4f4eb9ca934baa09806a2339ff7aee1eb3885dbcc38feab37222f42a4c0bf6a","abstract_canon_sha256":"1cf97864987d9beace079221f42323ed3a1712e49f17cae91e42577e71017b01"},"schema_version":"1.0"},"canonical_sha256":"d7c5a6c81e05d41400db4929ed0fdf87827360b212647bcb23c985e95d2733e8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:34.556473Z","signature_b64":"qO/EHCBXpqNMR8Im82KOMK7P3piCwLza3rR6MlrU3JjdhdKflvRi4+suyGJ6XLFhUURvk0W2xKMJmHwCvu4TDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7c5a6c81e05d41400db4929ed0fdf87827360b212647bcb23c985e95d2733e8","last_reissued_at":"2026-05-18T01:34:34.556003Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:34.556003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.03182","source_version":2,"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:34:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YtD7QbBa61C2hLTRC1csNSSmursbHynmQ5wDaizuQTAthaI2TWuwa1vBUNUIs4qveq2oRSh2MgwORVdl17ktBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:05:38.417386Z"},"content_sha256":"eda21db2e4c6b255a377d1ac6630527b2a9c5c44a9cb8337ed448c88b305145b","schema_version":"1.0","event_id":"sha256:eda21db2e4c6b255a377d1ac6630527b2a9c5c44a9cb8337ed448c88b305145b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:27C2NSA6AXKBIAG3JEU62D67Q6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"TRISHUL: A Single-pass Optimal Two-level Inclusive Data Cache Hierarchy Selection Process for Real-time MPSoCs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Akash Kumar, Mohammad Shihabul Haque, Qiang Wu, Shaobo Luo, Yajun Ha","submitted_at":"2015-06-10T06:26:02Z","abstract_excerpt":"Hitherto discovered approaches analyze the execution time of a real time application on all the possible cache hierarchy setups to find the application specific optimal two level inclusive data cache hierarchy to reduce cost, space and energy consumption while satisfying the time deadline in real time Multiprocessor Systems on Chip. These brute force like approaches can take years to complete. Alternatively, memory access trace driven crude estimation methods can find a cache hierarchy quickly by compromising the accuracy of results. In this article, for the first time, we propose a fast and a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.03182","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":""},"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:34:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mFDWlE0SXN4dWI0nT5qSzlHsFDf2pCePnltnLfLEuN+CMDsqZIGwLM2kerHnzaUw9cmPknQzjoalK/dVqO9vCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:05:38.418173Z"},"content_sha256":"61fff173f5e051155323457bcd425d5fef485270732856342eab8c1afefcba46","schema_version":"1.0","event_id":"sha256:61fff173f5e051155323457bcd425d5fef485270732856342eab8c1afefcba46"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/27C2NSA6AXKBIAG3JEU62D67Q6/bundle.json","state_url":"https://pith.science/pith/27C2NSA6AXKBIAG3JEU62D67Q6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/27C2NSA6AXKBIAG3JEU62D67Q6/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-05-31T23:05:38Z","links":{"resolver":"https://pith.science/pith/27C2NSA6AXKBIAG3JEU62D67Q6","bundle":"https://pith.science/pith/27C2NSA6AXKBIAG3JEU62D67Q6/bundle.json","state":"https://pith.science/pith/27C2NSA6AXKBIAG3JEU62D67Q6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/27C2NSA6AXKBIAG3JEU62D67Q6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:27C2NSA6AXKBIAG3JEU62D67Q6","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":"1cf97864987d9beace079221f42323ed3a1712e49f17cae91e42577e71017b01","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2015-06-10T06:26:02Z","title_canon_sha256":"d4f4eb9ca934baa09806a2339ff7aee1eb3885dbcc38feab37222f42a4c0bf6a"},"schema_version":"1.0","source":{"id":"1506.03182","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.03182","created_at":"2026-05-18T01:34:34Z"},{"alias_kind":"arxiv_version","alias_value":"1506.03182v2","created_at":"2026-05-18T01:34:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03182","created_at":"2026-05-18T01:34:34Z"},{"alias_kind":"pith_short_12","alias_value":"27C2NSA6AXKB","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"27C2NSA6AXKBIAG3","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"27C2NSA6","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:61fff173f5e051155323457bcd425d5fef485270732856342eab8c1afefcba46","target":"graph","created_at":"2026-05-18T01:34:34Z","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":"Hitherto discovered approaches analyze the execution time of a real time application on all the possible cache hierarchy setups to find the application specific optimal two level inclusive data cache hierarchy to reduce cost, space and energy consumption while satisfying the time deadline in real time Multiprocessor Systems on Chip. These brute force like approaches can take years to complete. Alternatively, memory access trace driven crude estimation methods can find a cache hierarchy quickly by compromising the accuracy of results. In this article, for the first time, we propose a fast and a","authors_text":"Akash Kumar, Mohammad Shihabul Haque, Qiang Wu, Shaobo Luo, Yajun Ha","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2015-06-10T06:26:02Z","title":"TRISHUL: A Single-pass Optimal Two-level Inclusive Data Cache Hierarchy Selection Process for Real-time MPSoCs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.03182","kind":"arxiv","version":2},"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:eda21db2e4c6b255a377d1ac6630527b2a9c5c44a9cb8337ed448c88b305145b","target":"record","created_at":"2026-05-18T01:34:34Z","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":"1cf97864987d9beace079221f42323ed3a1712e49f17cae91e42577e71017b01","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2015-06-10T06:26:02Z","title_canon_sha256":"d4f4eb9ca934baa09806a2339ff7aee1eb3885dbcc38feab37222f42a4c0bf6a"},"schema_version":"1.0","source":{"id":"1506.03182","kind":"arxiv","version":2}},"canonical_sha256":"d7c5a6c81e05d41400db4929ed0fdf87827360b212647bcb23c985e95d2733e8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d7c5a6c81e05d41400db4929ed0fdf87827360b212647bcb23c985e95d2733e8","first_computed_at":"2026-05-18T01:34:34.556003Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:34.556003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qO/EHCBXpqNMR8Im82KOMK7P3piCwLza3rR6MlrU3JjdhdKflvRi4+suyGJ6XLFhUURvk0W2xKMJmHwCvu4TDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:34.556473Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.03182","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eda21db2e4c6b255a377d1ac6630527b2a9c5c44a9cb8337ed448c88b305145b","sha256:61fff173f5e051155323457bcd425d5fef485270732856342eab8c1afefcba46"],"state_sha256":"8fbbe1943d8fee79b9337014dfe6c183946ff526e7e575e393ddd2d03c14e2c1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WBYLDZm9iSMYhn4GT9gMAIArVjCG0jKOBeuCkriKIGXejOQIcCxV5HJnOSzI44dtpnfCvg4nIAtISeNeYzQFDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T23:05:38.422401Z","bundle_sha256":"842a1523c557cac6abc0b0a0b48d2e89277bc5b1bf7f69b2d40bb2485e0652f9"}}