{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3JRA53K2V2FU7WFAAVTMSH55PX","short_pith_number":"pith:3JRA53K2","schema_version":"1.0","canonical_sha256":"da620eed5aae8b4fd8a00566c91fbd7dd47a50ac34927a86a9aeb2c9e4863943","source":{"kind":"arxiv","id":"1801.00094","version":1},"attestation_state":"computed","paper":{"title":"A Loop-Based Methodology for Reducing Computational Redundancy in Workload Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PF","authors_text":"Elie M. Shaccour, Mohammad M. Mansour","submitted_at":"2017-12-30T07:31:29Z","abstract_excerpt":"The design of general purpose processors relies heavily on a workload gathering step in which representative programs are collected from various application domains. Processor performance, when running the workload set, is profiled using simulators that model the targeted processor architecture. However, simulating the entire workload set is prohibitively time-consuming, which precludes considering a large number of programs. To reduce simulation time, several techniques in the literature have exploited the internal program repetitiveness to extract and execute only representative code segment"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1801.00094","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2017-12-30T07:31:29Z","cross_cats_sorted":[],"title_canon_sha256":"efce03fbd318dc3bb150fd6fbc2183804cf82714d80764e8add5cbed51ed44ba","abstract_canon_sha256":"7b3a288f931feceb6b3ed1e951d5c8255406d3fb908e40ddb86fa6697cce2651"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:47.741556Z","signature_b64":"//bcni+kQ8E/wBB0N9KDWkaHtS/hg9vhuHh29xZ+mlsBh/swm1QGXKcTLrBfZUvb6mqTl7mmwsKoC3EBHp+0Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da620eed5aae8b4fd8a00566c91fbd7dd47a50ac34927a86a9aeb2c9e4863943","last_reissued_at":"2026-05-18T00:26:47.740850Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:47.740850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Loop-Based Methodology for Reducing Computational Redundancy in Workload Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PF","authors_text":"Elie M. Shaccour, Mohammad M. Mansour","submitted_at":"2017-12-30T07:31:29Z","abstract_excerpt":"The design of general purpose processors relies heavily on a workload gathering step in which representative programs are collected from various application domains. Processor performance, when running the workload set, is profiled using simulators that model the targeted processor architecture. However, simulating the entire workload set is prohibitively time-consuming, which precludes considering a large number of programs. To reduce simulation time, several techniques in the literature have exploited the internal program repetitiveness to extract and execute only representative code segment"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00094","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1801.00094","created_at":"2026-05-18T00:26:47.740957+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.00094v1","created_at":"2026-05-18T00:26:47.740957+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00094","created_at":"2026-05-18T00:26:47.740957+00:00"},{"alias_kind":"pith_short_12","alias_value":"3JRA53K2V2FU","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3JRA53K2V2FU7WFA","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3JRA53K2","created_at":"2026-05-18T12:30:58.224056+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3JRA53K2V2FU7WFAAVTMSH55PX","json":"https://pith.science/pith/3JRA53K2V2FU7WFAAVTMSH55PX.json","graph_json":"https://pith.science/api/pith-number/3JRA53K2V2FU7WFAAVTMSH55PX/graph.json","events_json":"https://pith.science/api/pith-number/3JRA53K2V2FU7WFAAVTMSH55PX/events.json","paper":"https://pith.science/paper/3JRA53K2"},"agent_actions":{"view_html":"https://pith.science/pith/3JRA53K2V2FU7WFAAVTMSH55PX","download_json":"https://pith.science/pith/3JRA53K2V2FU7WFAAVTMSH55PX.json","view_paper":"https://pith.science/paper/3JRA53K2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.00094&json=true","fetch_graph":"https://pith.science/api/pith-number/3JRA53K2V2FU7WFAAVTMSH55PX/graph.json","fetch_events":"https://pith.science/api/pith-number/3JRA53K2V2FU7WFAAVTMSH55PX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3JRA53K2V2FU7WFAAVTMSH55PX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3JRA53K2V2FU7WFAAVTMSH55PX/action/storage_attestation","attest_author":"https://pith.science/pith/3JRA53K2V2FU7WFAAVTMSH55PX/action/author_attestation","sign_citation":"https://pith.science/pith/3JRA53K2V2FU7WFAAVTMSH55PX/action/citation_signature","submit_replication":"https://pith.science/pith/3JRA53K2V2FU7WFAAVTMSH55PX/action/replication_record"}},"created_at":"2026-05-18T00:26:47.740957+00:00","updated_at":"2026-05-18T00:26:47.740957+00:00"}