{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:RNZREUAPELTNOP6733ELOVGCUE","short_pith_number":"pith:RNZREUAP","schema_version":"1.0","canonical_sha256":"8b7312500f22e6d73fdfdec8b754c2a10729c5e9d2a25d7ff1d02d5dd611517a","source":{"kind":"arxiv","id":"2010.00051","version":1},"attestation_state":"computed","paper":{"title":"A general approach for identifying hierarchical symmetry constraints for analog circuit layout","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP"],"primary_cat":"cs.LG","authors_text":"Jitesh Poojary, Kishor Kunal, Meghna Madhusudan, Ramesh Harjani, Sachin S. Sapatnekar, Tonmoy Dhar","submitted_at":"2020-09-30T18:34:58Z","abstract_excerpt":"Analog layout synthesis requires some elements in the circuit netlist to be matched and placed symmetrically. However, the set of symmetries is very circuit-specific and a versatile algorithm, applicable to a broad variety of circuits, has been elusive. This paper presents a general methodology for the automated generation of symmetry constraints, and applies these constraints to guide automated layout synthesis. While prior approaches were restricted to identifying simple symmetries, the proposed method operates hierarchically and uses graph-based algorithms to extract multiple axes of symmet"},"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":"2010.00051","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-09-30T18:34:58Z","cross_cats_sorted":["eess.SP"],"title_canon_sha256":"cdce6d90d62d2d044bac2f16ca027902420e9bd35529499391267c7f072ca1d2","abstract_canon_sha256":"d690890f2ea802e4163acbb5969c47a133d8e3a22684cac8a54c8401c0b0f3e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:39:29.821108Z","signature_b64":"yHUozvLLpIsGO6HmYixhLfJ0yZtISQycu2LWgMDz6QbFi94kK2QkfzWcE3Ar/1FY44uT3IEmUoyEtgziHGZtCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b7312500f22e6d73fdfdec8b754c2a10729c5e9d2a25d7ff1d02d5dd611517a","last_reissued_at":"2026-07-05T01:39:29.820572Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:39:29.820572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A general approach for identifying hierarchical symmetry constraints for analog circuit layout","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP"],"primary_cat":"cs.LG","authors_text":"Jitesh Poojary, Kishor Kunal, Meghna Madhusudan, Ramesh Harjani, Sachin S. Sapatnekar, Tonmoy Dhar","submitted_at":"2020-09-30T18:34:58Z","abstract_excerpt":"Analog layout synthesis requires some elements in the circuit netlist to be matched and placed symmetrically. However, the set of symmetries is very circuit-specific and a versatile algorithm, applicable to a broad variety of circuits, has been elusive. This paper presents a general methodology for the automated generation of symmetry constraints, and applies these constraints to guide automated layout synthesis. While prior approaches were restricted to identifying simple symmetries, the proposed method operates hierarchically and uses graph-based algorithms to extract multiple axes of symmet"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.00051","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/2010.00051/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":"2010.00051","created_at":"2026-07-05T01:39:29.820639+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.00051v1","created_at":"2026-07-05T01:39:29.820639+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.00051","created_at":"2026-07-05T01:39:29.820639+00:00"},{"alias_kind":"pith_short_12","alias_value":"RNZREUAPELTN","created_at":"2026-07-05T01:39:29.820639+00:00"},{"alias_kind":"pith_short_16","alias_value":"RNZREUAPELTNOP67","created_at":"2026-07-05T01:39:29.820639+00:00"},{"alias_kind":"pith_short_8","alias_value":"RNZREUAP","created_at":"2026-07-05T01:39:29.820639+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/RNZREUAPELTNOP6733ELOVGCUE","json":"https://pith.science/pith/RNZREUAPELTNOP6733ELOVGCUE.json","graph_json":"https://pith.science/api/pith-number/RNZREUAPELTNOP6733ELOVGCUE/graph.json","events_json":"https://pith.science/api/pith-number/RNZREUAPELTNOP6733ELOVGCUE/events.json","paper":"https://pith.science/paper/RNZREUAP"},"agent_actions":{"view_html":"https://pith.science/pith/RNZREUAPELTNOP6733ELOVGCUE","download_json":"https://pith.science/pith/RNZREUAPELTNOP6733ELOVGCUE.json","view_paper":"https://pith.science/paper/RNZREUAP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.00051&json=true","fetch_graph":"https://pith.science/api/pith-number/RNZREUAPELTNOP6733ELOVGCUE/graph.json","fetch_events":"https://pith.science/api/pith-number/RNZREUAPELTNOP6733ELOVGCUE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RNZREUAPELTNOP6733ELOVGCUE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RNZREUAPELTNOP6733ELOVGCUE/action/storage_attestation","attest_author":"https://pith.science/pith/RNZREUAPELTNOP6733ELOVGCUE/action/author_attestation","sign_citation":"https://pith.science/pith/RNZREUAPELTNOP6733ELOVGCUE/action/citation_signature","submit_replication":"https://pith.science/pith/RNZREUAPELTNOP6733ELOVGCUE/action/replication_record"}},"created_at":"2026-07-05T01:39:29.820639+00:00","updated_at":"2026-07-05T01:39:29.820639+00:00"}