{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:DZZXT6QIBYDX53D6EI7ZYN4JSA","short_pith_number":"pith:DZZXT6QI","schema_version":"1.0","canonical_sha256":"1e7379fa080e077eec7e223f9c3789903ef59fc5c9998e391168db8083dfcf0c","source":{"kind":"arxiv","id":"1010.5562","version":1},"attestation_state":"computed","paper":{"title":"Fast Continuous Haar and Fourier Transforms of Rectilinear Polygons from VLSI Layouts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DS"],"primary_cat":"cs.CE","authors_text":"Amina Chebira, Paul Hurley, Robin Scheibler","submitted_at":"2010-10-27T03:45:45Z","abstract_excerpt":"We develop the pruned continuous Haar transform and the fast continuous Fourier series, two fast and efficient algorithms for rectilinear polygons. Rectilinear polygons are used in VLSI processes to describe design and mask layouts of integrated circuits. The Fourier representation is at the heart of many of these processes and the Haar transform is expected to play a major role in techniques envisioned to speed up VLSI design. To ensure correct printing of the constantly shrinking transistors and simultaneously handle their increasingly large number, ever more computationally intensive techni"},"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":"1010.5562","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2010-10-27T03:45:45Z","cross_cats_sorted":["cs.CG","cs.DS"],"title_canon_sha256":"5d6f681adc63ac0f51e8e0901c4f67dcf3eac0c64fd3e3cc91fea877dba230af","abstract_canon_sha256":"eb2977a0c8914dfb6a2908019957439580329d2eec096f0fafa140fad22e9a18"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:38:16.448187Z","signature_b64":"J3UOYgWgVRAq3OQ9hnSSCXsIE5gk5VFr+7ZMmV64dT10qeGtQUM+fo7kWB/U9+Cn2GkIbYOjzOLP2VzvUBCiCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e7379fa080e077eec7e223f9c3789903ef59fc5c9998e391168db8083dfcf0c","last_reissued_at":"2026-05-18T04:38:16.447581Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:38:16.447581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Continuous Haar and Fourier Transforms of Rectilinear Polygons from VLSI Layouts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DS"],"primary_cat":"cs.CE","authors_text":"Amina Chebira, Paul Hurley, Robin Scheibler","submitted_at":"2010-10-27T03:45:45Z","abstract_excerpt":"We develop the pruned continuous Haar transform and the fast continuous Fourier series, two fast and efficient algorithms for rectilinear polygons. Rectilinear polygons are used in VLSI processes to describe design and mask layouts of integrated circuits. The Fourier representation is at the heart of many of these processes and the Haar transform is expected to play a major role in techniques envisioned to speed up VLSI design. To ensure correct printing of the constantly shrinking transistors and simultaneously handle their increasingly large number, ever more computationally intensive techni"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.5562","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":"1010.5562","created_at":"2026-05-18T04:38:16.447677+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.5562v1","created_at":"2026-05-18T04:38:16.447677+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.5562","created_at":"2026-05-18T04:38:16.447677+00:00"},{"alias_kind":"pith_short_12","alias_value":"DZZXT6QIBYDX","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"DZZXT6QIBYDX53D6","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"DZZXT6QI","created_at":"2026-05-18T12:26:06.534383+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/DZZXT6QIBYDX53D6EI7ZYN4JSA","json":"https://pith.science/pith/DZZXT6QIBYDX53D6EI7ZYN4JSA.json","graph_json":"https://pith.science/api/pith-number/DZZXT6QIBYDX53D6EI7ZYN4JSA/graph.json","events_json":"https://pith.science/api/pith-number/DZZXT6QIBYDX53D6EI7ZYN4JSA/events.json","paper":"https://pith.science/paper/DZZXT6QI"},"agent_actions":{"view_html":"https://pith.science/pith/DZZXT6QIBYDX53D6EI7ZYN4JSA","download_json":"https://pith.science/pith/DZZXT6QIBYDX53D6EI7ZYN4JSA.json","view_paper":"https://pith.science/paper/DZZXT6QI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.5562&json=true","fetch_graph":"https://pith.science/api/pith-number/DZZXT6QIBYDX53D6EI7ZYN4JSA/graph.json","fetch_events":"https://pith.science/api/pith-number/DZZXT6QIBYDX53D6EI7ZYN4JSA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DZZXT6QIBYDX53D6EI7ZYN4JSA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DZZXT6QIBYDX53D6EI7ZYN4JSA/action/storage_attestation","attest_author":"https://pith.science/pith/DZZXT6QIBYDX53D6EI7ZYN4JSA/action/author_attestation","sign_citation":"https://pith.science/pith/DZZXT6QIBYDX53D6EI7ZYN4JSA/action/citation_signature","submit_replication":"https://pith.science/pith/DZZXT6QIBYDX53D6EI7ZYN4JSA/action/replication_record"}},"created_at":"2026-05-18T04:38:16.447677+00:00","updated_at":"2026-05-18T04:38:16.447677+00:00"}