{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:QB227QPJI6E3KTLQADWEGVXQNV","short_pith_number":"pith:QB227QPJ","schema_version":"1.0","canonical_sha256":"8075afc1e94789b54d7000ec4356f06d509a1846219bafa40a759fcc0f65e386","source":{"kind":"arxiv","id":"0710.4697","version":1},"attestation_state":"computed","paper":{"title":"Statistical Timing Based Optimization using Gate Sizing","license":"","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Aseem Agarwal, David Blaauw, Kaviraj Chopra","submitted_at":"2007-10-25T09:16:49Z","abstract_excerpt":"The increased dominance of intra-die process variations has motivated the field of Statistical Static Timing Analysis (SSTA) and has raised the need for SSTA-based circuit optimization. In this paper, we propose a new sensitivity based, statistical gate sizing method. Since brute-force computation of the change in circuit delay distribution to gate size change is computationally expensive, we propose an efficient and exact pruning algorithm. The pruning algorithm is based on a novel theory of perturbation bounds which are shown to decrease as they propagate through the circuit. This allows pru"},"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":"0710.4697","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.AR","submitted_at":"2007-10-25T09:16:49Z","cross_cats_sorted":[],"title_canon_sha256":"a61be40cf06c0a9a1c3a88dd200e6545017a5ac99ccac5a4ecaa8c5d6b93ff97","abstract_canon_sha256":"b3850711f64f0f7aaa8956ba5a643bc39f89cab140183bbdc691e9560486dee5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:05.876670Z","signature_b64":"qWDLxjKKWuLX9mR9+HV1QlTX7uWU5/Q0YwXh3IQicMAxIKAM8D4rfaVJBILXTm0abfHw7qFIHu9MiS/9u+tZDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8075afc1e94789b54d7000ec4356f06d509a1846219bafa40a759fcc0f65e386","last_reissued_at":"2026-05-18T04:09:05.875716Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:05.875716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Statistical Timing Based Optimization using Gate Sizing","license":"","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Aseem Agarwal, David Blaauw, Kaviraj Chopra","submitted_at":"2007-10-25T09:16:49Z","abstract_excerpt":"The increased dominance of intra-die process variations has motivated the field of Statistical Static Timing Analysis (SSTA) and has raised the need for SSTA-based circuit optimization. In this paper, we propose a new sensitivity based, statistical gate sizing method. Since brute-force computation of the change in circuit delay distribution to gate size change is computationally expensive, we propose an efficient and exact pruning algorithm. The pruning algorithm is based on a novel theory of perturbation bounds which are shown to decrease as they propagate through the circuit. This allows pru"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0710.4697","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":"0710.4697","created_at":"2026-05-18T04:09:05.875859+00:00"},{"alias_kind":"arxiv_version","alias_value":"0710.4697v1","created_at":"2026-05-18T04:09:05.875859+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0710.4697","created_at":"2026-05-18T04:09:05.875859+00:00"},{"alias_kind":"pith_short_12","alias_value":"QB227QPJI6E3","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"QB227QPJI6E3KTLQ","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"QB227QPJ","created_at":"2026-05-18T12:25:55.427421+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/QB227QPJI6E3KTLQADWEGVXQNV","json":"https://pith.science/pith/QB227QPJI6E3KTLQADWEGVXQNV.json","graph_json":"https://pith.science/api/pith-number/QB227QPJI6E3KTLQADWEGVXQNV/graph.json","events_json":"https://pith.science/api/pith-number/QB227QPJI6E3KTLQADWEGVXQNV/events.json","paper":"https://pith.science/paper/QB227QPJ"},"agent_actions":{"view_html":"https://pith.science/pith/QB227QPJI6E3KTLQADWEGVXQNV","download_json":"https://pith.science/pith/QB227QPJI6E3KTLQADWEGVXQNV.json","view_paper":"https://pith.science/paper/QB227QPJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0710.4697&json=true","fetch_graph":"https://pith.science/api/pith-number/QB227QPJI6E3KTLQADWEGVXQNV/graph.json","fetch_events":"https://pith.science/api/pith-number/QB227QPJI6E3KTLQADWEGVXQNV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QB227QPJI6E3KTLQADWEGVXQNV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QB227QPJI6E3KTLQADWEGVXQNV/action/storage_attestation","attest_author":"https://pith.science/pith/QB227QPJI6E3KTLQADWEGVXQNV/action/author_attestation","sign_citation":"https://pith.science/pith/QB227QPJI6E3KTLQADWEGVXQNV/action/citation_signature","submit_replication":"https://pith.science/pith/QB227QPJI6E3KTLQADWEGVXQNV/action/replication_record"}},"created_at":"2026-05-18T04:09:05.875859+00:00","updated_at":"2026-05-18T04:09:05.875859+00:00"}