{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:JFOCTWXG5L6NPK3NLOSU4I5BF2","short_pith_number":"pith:JFOCTWXG","schema_version":"1.0","canonical_sha256":"495c29dae6eafcd7ab6d5ba54e23a12e840a7785b10aedd2e2a12107eb9130df","source":{"kind":"arxiv","id":"2304.08880","version":1},"attestation_state":"computed","paper":{"title":"NPS: A Framework for Accurate Program Sampling Using Graph Neural Network","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.PL"],"primary_cat":"cs.AR","authors_text":"Hongzhong Zheng, Jiajie Li, Jian Chen, Jiawei Liu, Yanheng Lu, Yenkuang Chen, Yi Jin, Yuanwei Fang, Yuan Xie, Zihao Liu","submitted_at":"2023-04-18T10:13:28Z","abstract_excerpt":"With the end of Moore's Law, there is a growing demand for rapid architectural innovations in modern processors, such as RISC-V custom extensions, to continue performance scaling. Program sampling is a crucial step in microprocessor design, as it selects representative simulation points for workload simulation. While SimPoint has been the de-facto approach for decades, its limited expressiveness with Basic Block Vector (BBV) requires time-consuming human tuning, often taking months, which impedes fast innovation and agile hardware development. This paper introduces Neural Program Sampling (NPS"},"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":"2304.08880","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AR","submitted_at":"2023-04-18T10:13:28Z","cross_cats_sorted":["cs.AI","cs.LG","cs.PL"],"title_canon_sha256":"37f6576f6daac4d8251ae65e92d7f4743532bcab7e48b45d79059506138623a1","abstract_canon_sha256":"1378602d3aa0e4917aaeaa16c63d85ca3648af40e65200b339d6823b634d7e46"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:02:14.601431Z","signature_b64":"sQjoGUoiDBltojOnFGPR9gpeTkE7RT38O17vsYXTmHyMeQO35756i6GVGdXSFwLa1OrUpcxFaGIKAcLV1S7KAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"495c29dae6eafcd7ab6d5ba54e23a12e840a7785b10aedd2e2a12107eb9130df","last_reissued_at":"2026-07-05T06:02:14.601002Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:02:14.601002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"NPS: A Framework for Accurate Program Sampling Using Graph Neural Network","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.PL"],"primary_cat":"cs.AR","authors_text":"Hongzhong Zheng, Jiajie Li, Jian Chen, Jiawei Liu, Yanheng Lu, Yenkuang Chen, Yi Jin, Yuanwei Fang, Yuan Xie, Zihao Liu","submitted_at":"2023-04-18T10:13:28Z","abstract_excerpt":"With the end of Moore's Law, there is a growing demand for rapid architectural innovations in modern processors, such as RISC-V custom extensions, to continue performance scaling. Program sampling is a crucial step in microprocessor design, as it selects representative simulation points for workload simulation. While SimPoint has been the de-facto approach for decades, its limited expressiveness with Basic Block Vector (BBV) requires time-consuming human tuning, often taking months, which impedes fast innovation and agile hardware development. This paper introduces Neural Program Sampling (NPS"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.08880","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/2304.08880/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":"2304.08880","created_at":"2026-07-05T06:02:14.601077+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.08880v1","created_at":"2026-07-05T06:02:14.601077+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.08880","created_at":"2026-07-05T06:02:14.601077+00:00"},{"alias_kind":"pith_short_12","alias_value":"JFOCTWXG5L6N","created_at":"2026-07-05T06:02:14.601077+00:00"},{"alias_kind":"pith_short_16","alias_value":"JFOCTWXG5L6NPK3N","created_at":"2026-07-05T06:02:14.601077+00:00"},{"alias_kind":"pith_short_8","alias_value":"JFOCTWXG","created_at":"2026-07-05T06:02:14.601077+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.02344","citing_title":"Memory Access Vectors: Improving Sampling Fidelity for CPU Performance Simulations","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JFOCTWXG5L6NPK3NLOSU4I5BF2","json":"https://pith.science/pith/JFOCTWXG5L6NPK3NLOSU4I5BF2.json","graph_json":"https://pith.science/api/pith-number/JFOCTWXG5L6NPK3NLOSU4I5BF2/graph.json","events_json":"https://pith.science/api/pith-number/JFOCTWXG5L6NPK3NLOSU4I5BF2/events.json","paper":"https://pith.science/paper/JFOCTWXG"},"agent_actions":{"view_html":"https://pith.science/pith/JFOCTWXG5L6NPK3NLOSU4I5BF2","download_json":"https://pith.science/pith/JFOCTWXG5L6NPK3NLOSU4I5BF2.json","view_paper":"https://pith.science/paper/JFOCTWXG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.08880&json=true","fetch_graph":"https://pith.science/api/pith-number/JFOCTWXG5L6NPK3NLOSU4I5BF2/graph.json","fetch_events":"https://pith.science/api/pith-number/JFOCTWXG5L6NPK3NLOSU4I5BF2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JFOCTWXG5L6NPK3NLOSU4I5BF2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JFOCTWXG5L6NPK3NLOSU4I5BF2/action/storage_attestation","attest_author":"https://pith.science/pith/JFOCTWXG5L6NPK3NLOSU4I5BF2/action/author_attestation","sign_citation":"https://pith.science/pith/JFOCTWXG5L6NPK3NLOSU4I5BF2/action/citation_signature","submit_replication":"https://pith.science/pith/JFOCTWXG5L6NPK3NLOSU4I5BF2/action/replication_record"}},"created_at":"2026-07-05T06:02:14.601077+00:00","updated_at":"2026-07-05T06:02:14.601077+00:00"}