{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:Z6XHYUJSOF7HH25WSU2FWGTAJY","short_pith_number":"pith:Z6XHYUJS","canonical_record":{"source":{"id":"1705.04980","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2017-05-14T15:44:38Z","cross_cats_sorted":[],"title_canon_sha256":"38cc921991c3eb8df26c308687de27c7ae70c89a1f05a3eb7b3847ee7125ab5f","abstract_canon_sha256":"6e31a66e2acede40969a1e71afe06833a225a81bca9e61c2ec2ae54aa7c88a76"},"schema_version":"1.0"},"canonical_sha256":"cfae7c5132717e73ebb695345b1a604e246915cee2f697023cf0667386ad86d2","source":{"kind":"arxiv","id":"1705.04980","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.04980","created_at":"2026-05-18T00:44:34Z"},{"alias_kind":"arxiv_version","alias_value":"1705.04980v1","created_at":"2026-05-18T00:44:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.04980","created_at":"2026-05-18T00:44:34Z"},{"alias_kind":"pith_short_12","alias_value":"Z6XHYUJSOF7H","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"Z6XHYUJSOF7HH25W","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"Z6XHYUJS","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:Z6XHYUJSOF7HH25WSU2FWGTAJY","target":"record","payload":{"canonical_record":{"source":{"id":"1705.04980","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2017-05-14T15:44:38Z","cross_cats_sorted":[],"title_canon_sha256":"38cc921991c3eb8df26c308687de27c7ae70c89a1f05a3eb7b3847ee7125ab5f","abstract_canon_sha256":"6e31a66e2acede40969a1e71afe06833a225a81bca9e61c2ec2ae54aa7c88a76"},"schema_version":"1.0"},"canonical_sha256":"cfae7c5132717e73ebb695345b1a604e246915cee2f697023cf0667386ad86d2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:34.148046Z","signature_b64":"hN5Xx+lHTkZIuLGTfFLNgYe9fUokL9AC0K3ilIkS8lAkJ2rFfL2VeA6RqTaW7QklFED9Z+v5IjP+GIPQunh1Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cfae7c5132717e73ebb695345b1a604e246915cee2f697023cf0667386ad86d2","last_reissued_at":"2026-05-18T00:44:34.147527Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:34.147527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.04980","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:44:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8ZeWKu8WxQGecup7tGL+oAgTkrbhEKV9MBEl7JQprNwch9YJxUr/9UsFm9O8mLI4rHPJl9T3G2qIad3dVniZDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:00:45.961179Z"},"content_sha256":"7022aedb86ed6ddfdbe4b3fab3d61d306accc0d1f654343537b230627bd2656b","schema_version":"1.0","event_id":"sha256:7022aedb86ed6ddfdbe4b3fab3d61d306accc0d1f654343537b230627bd2656b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:Z6XHYUJSOF7HH25WSU2FWGTAJY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Statistical Timing Analysis for Latch-Controlled Circuits with Reduced Iterations and Graph Transformations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.OH","authors_text":"Bing Li, Ning Chen, Ulf Schlichtmann","submitted_at":"2017-05-14T15:44:38Z","abstract_excerpt":"Level-sensitive latches are widely used in high- performance designs. For such circuits efficient statistical timing analysis algorithms are needed to take increasing process vari- ations into account. But existing methods solving this problem are still computationally expensive and can only provide the yield at a given clock period. In this paper we propose a method combining reduced iterations and graph transformations. The reduced iterations extract setup time constraints and identify a subgraph for the following graph transformations handling the constraints from nonpositive loops. The com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.04980","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:44:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Atq2nPAMEOEaW7jB7AaNNfxGA2Tm/6tPV6nDj8bnaT92iU3QjTTFWk4n6tftE5Vmsw+Bvm0C7HuxXzpIqoAIAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:00:45.961539Z"},"content_sha256":"91a72a791fe0332afd07fbfa34ebe9d1f45890d82714f564cbab7b1546374399","schema_version":"1.0","event_id":"sha256:91a72a791fe0332afd07fbfa34ebe9d1f45890d82714f564cbab7b1546374399"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z6XHYUJSOF7HH25WSU2FWGTAJY/bundle.json","state_url":"https://pith.science/pith/Z6XHYUJSOF7HH25WSU2FWGTAJY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z6XHYUJSOF7HH25WSU2FWGTAJY/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-06-05T12:00:45Z","links":{"resolver":"https://pith.science/pith/Z6XHYUJSOF7HH25WSU2FWGTAJY","bundle":"https://pith.science/pith/Z6XHYUJSOF7HH25WSU2FWGTAJY/bundle.json","state":"https://pith.science/pith/Z6XHYUJSOF7HH25WSU2FWGTAJY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z6XHYUJSOF7HH25WSU2FWGTAJY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:Z6XHYUJSOF7HH25WSU2FWGTAJY","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":"6e31a66e2acede40969a1e71afe06833a225a81bca9e61c2ec2ae54aa7c88a76","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2017-05-14T15:44:38Z","title_canon_sha256":"38cc921991c3eb8df26c308687de27c7ae70c89a1f05a3eb7b3847ee7125ab5f"},"schema_version":"1.0","source":{"id":"1705.04980","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.04980","created_at":"2026-05-18T00:44:34Z"},{"alias_kind":"arxiv_version","alias_value":"1705.04980v1","created_at":"2026-05-18T00:44:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.04980","created_at":"2026-05-18T00:44:34Z"},{"alias_kind":"pith_short_12","alias_value":"Z6XHYUJSOF7H","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"Z6XHYUJSOF7HH25W","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"Z6XHYUJS","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:91a72a791fe0332afd07fbfa34ebe9d1f45890d82714f564cbab7b1546374399","target":"graph","created_at":"2026-05-18T00:44: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":"Level-sensitive latches are widely used in high- performance designs. For such circuits efficient statistical timing analysis algorithms are needed to take increasing process vari- ations into account. But existing methods solving this problem are still computationally expensive and can only provide the yield at a given clock period. In this paper we propose a method combining reduced iterations and graph transformations. The reduced iterations extract setup time constraints and identify a subgraph for the following graph transformations handling the constraints from nonpositive loops. The com","authors_text":"Bing Li, Ning Chen, Ulf Schlichtmann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2017-05-14T15:44:38Z","title":"Statistical Timing Analysis for Latch-Controlled Circuits with Reduced Iterations and Graph Transformations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.04980","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:7022aedb86ed6ddfdbe4b3fab3d61d306accc0d1f654343537b230627bd2656b","target":"record","created_at":"2026-05-18T00:44: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":"6e31a66e2acede40969a1e71afe06833a225a81bca9e61c2ec2ae54aa7c88a76","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2017-05-14T15:44:38Z","title_canon_sha256":"38cc921991c3eb8df26c308687de27c7ae70c89a1f05a3eb7b3847ee7125ab5f"},"schema_version":"1.0","source":{"id":"1705.04980","kind":"arxiv","version":1}},"canonical_sha256":"cfae7c5132717e73ebb695345b1a604e246915cee2f697023cf0667386ad86d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cfae7c5132717e73ebb695345b1a604e246915cee2f697023cf0667386ad86d2","first_computed_at":"2026-05-18T00:44:34.147527Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:34.147527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hN5Xx+lHTkZIuLGTfFLNgYe9fUokL9AC0K3ilIkS8lAkJ2rFfL2VeA6RqTaW7QklFED9Z+v5IjP+GIPQunh1Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:34.148046Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.04980","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7022aedb86ed6ddfdbe4b3fab3d61d306accc0d1f654343537b230627bd2656b","sha256:91a72a791fe0332afd07fbfa34ebe9d1f45890d82714f564cbab7b1546374399"],"state_sha256":"1227be9f4c222fccb9f1478079120cae82e9c1e7aa852ec6c6da217b75619e78"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ElWHeaxEJohmS5oJstMKmLO6UX9eKRiAfkQMVvoJBLbsDoubDUBBDgS+A0vZLl5Ife9yEVBkJRaZujtoxF79Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T12:00:45.963479Z","bundle_sha256":"c95e414c36dc67b1f94bd7fc5201a2984f2c00f664d4173d5022c6bdc55a8e63"}}