{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:WCWFK35O6I62NENKMQK3N7RV4S","short_pith_number":"pith:WCWFK35O","schema_version":"1.0","canonical_sha256":"b0ac556faef23da691aa6415b6fe35e4a396e390cd575dd7825dd408acaa47f1","source":{"kind":"arxiv","id":"2411.13854","version":1},"attestation_state":"computed","paper":{"title":"Static Reuse Profile Estimation for Array Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PF","authors_text":"Abdel-Hameed A. Badawy, Abdur Razzak, Atanu Barai, Nandakishore Santhi","submitted_at":"2024-11-21T05:26:57Z","abstract_excerpt":"Reuse distance analysis is a widely recognized method for application characterization that illustrates cache locality. Although there are various techniques to calculate the reuse profile from dynamic memory traces, it is both time and space-consuming due to the requirement to collect dynamic memory traces at runtime. In contrast, static analysis reuse profile estimation is a promisingly faster approach since it is calculated at compile time without running the program or collecting memory traces. This work presents a static analysis technique to estimate the reuse profile of loop-based progr"},"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":"2411.13854","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2024-11-21T05:26:57Z","cross_cats_sorted":[],"title_canon_sha256":"a96d22ac1b4ce1fccb1ccfbb0086395b30d8575853d6a63d83c67c9f0d8bcfce","abstract_canon_sha256":"4cc6e5b31559f25d5ea01586f4e229f14d6f293e47824ddba753f96cc930e8de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:38:38.112956Z","signature_b64":"xC7dxXnylm3g1DTrEt3eJTjkrBOkBd9RWIk/G/Navg6VVkzvDxQN5AQpyQYT8b+BnqvI4dl7j6unE2ia7vUeBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0ac556faef23da691aa6415b6fe35e4a396e390cd575dd7825dd408acaa47f1","last_reissued_at":"2026-07-05T09:38:38.112461Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:38:38.112461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Static Reuse Profile Estimation for Array Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PF","authors_text":"Abdel-Hameed A. Badawy, Abdur Razzak, Atanu Barai, Nandakishore Santhi","submitted_at":"2024-11-21T05:26:57Z","abstract_excerpt":"Reuse distance analysis is a widely recognized method for application characterization that illustrates cache locality. Although there are various techniques to calculate the reuse profile from dynamic memory traces, it is both time and space-consuming due to the requirement to collect dynamic memory traces at runtime. In contrast, static analysis reuse profile estimation is a promisingly faster approach since it is calculated at compile time without running the program or collecting memory traces. This work presents a static analysis technique to estimate the reuse profile of loop-based progr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.13854","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.13854/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2411.13854","created_at":"2026-07-05T09:38:38.112525+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.13854v1","created_at":"2026-07-05T09:38:38.112525+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.13854","created_at":"2026-07-05T09:38:38.112525+00:00"},{"alias_kind":"pith_short_12","alias_value":"WCWFK35O6I62","created_at":"2026-07-05T09:38:38.112525+00:00"},{"alias_kind":"pith_short_16","alias_value":"WCWFK35O6I62NENK","created_at":"2026-07-05T09:38:38.112525+00:00"},{"alias_kind":"pith_short_8","alias_value":"WCWFK35O","created_at":"2026-07-05T09:38:38.112525+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/WCWFK35O6I62NENKMQK3N7RV4S","json":"https://pith.science/pith/WCWFK35O6I62NENKMQK3N7RV4S.json","graph_json":"https://pith.science/api/pith-number/WCWFK35O6I62NENKMQK3N7RV4S/graph.json","events_json":"https://pith.science/api/pith-number/WCWFK35O6I62NENKMQK3N7RV4S/events.json","paper":"https://pith.science/paper/WCWFK35O"},"agent_actions":{"view_html":"https://pith.science/pith/WCWFK35O6I62NENKMQK3N7RV4S","download_json":"https://pith.science/pith/WCWFK35O6I62NENKMQK3N7RV4S.json","view_paper":"https://pith.science/paper/WCWFK35O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.13854&json=true","fetch_graph":"https://pith.science/api/pith-number/WCWFK35O6I62NENKMQK3N7RV4S/graph.json","fetch_events":"https://pith.science/api/pith-number/WCWFK35O6I62NENKMQK3N7RV4S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WCWFK35O6I62NENKMQK3N7RV4S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WCWFK35O6I62NENKMQK3N7RV4S/action/storage_attestation","attest_author":"https://pith.science/pith/WCWFK35O6I62NENKMQK3N7RV4S/action/author_attestation","sign_citation":"https://pith.science/pith/WCWFK35O6I62NENKMQK3N7RV4S/action/citation_signature","submit_replication":"https://pith.science/pith/WCWFK35O6I62NENKMQK3N7RV4S/action/replication_record"}},"created_at":"2026-07-05T09:38:38.112525+00:00","updated_at":"2026-07-05T09:38:38.112525+00:00"}