{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:RG25AC3NS7VR2DAQSKPWOEQS2C","short_pith_number":"pith:RG25AC3N","canonical_record":{"source":{"id":"1105.1261","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2011-05-06T10:46:32Z","cross_cats_sorted":["cs.CG","cs.DS"],"title_canon_sha256":"968ea834b679ad4d3269a98ff3a92e62a979a33a2d0de3f8ae1a958cf816178c","abstract_canon_sha256":"8949fa496967852c7c99c9ae620215d6f939b0c1902afaec62e0f57a9153ac83"},"schema_version":"1.0"},"canonical_sha256":"89b5d00b6d97eb1d0c10929f671212d085877a4ad55cc11c3e10f697b0bcc799","source":{"kind":"arxiv","id":"1105.1261","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.1261","created_at":"2026-05-18T04:22:40Z"},{"alias_kind":"arxiv_version","alias_value":"1105.1261v1","created_at":"2026-05-18T04:22:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.1261","created_at":"2026-05-18T04:22:40Z"},{"alias_kind":"pith_short_12","alias_value":"RG25AC3NS7VR","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"RG25AC3NS7VR2DAQ","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"RG25AC3N","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:RG25AC3NS7VR2DAQSKPWOEQS2C","target":"record","payload":{"canonical_record":{"source":{"id":"1105.1261","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2011-05-06T10:46:32Z","cross_cats_sorted":["cs.CG","cs.DS"],"title_canon_sha256":"968ea834b679ad4d3269a98ff3a92e62a979a33a2d0de3f8ae1a958cf816178c","abstract_canon_sha256":"8949fa496967852c7c99c9ae620215d6f939b0c1902afaec62e0f57a9153ac83"},"schema_version":"1.0"},"canonical_sha256":"89b5d00b6d97eb1d0c10929f671212d085877a4ad55cc11c3e10f697b0bcc799","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:22:40.770236Z","signature_b64":"nhDkXxEaVgkJe4Lf+tQCE9Gw2ATwdXjB3XXQdH91zXjciGpMpcRJzPjppwyQD6kiq8jrm0yo6pit0OJsyHODCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89b5d00b6d97eb1d0c10929f671212d085877a4ad55cc11c3e10f697b0bcc799","last_reissued_at":"2026-05-18T04:22:40.769794Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:22:40.769794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.1261","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-18T04:22:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M0huFUwB79BTxY2bjb3Km/7zr4RSvL5jdhdmjoHwyTDK6QQBAoZ9Q04FSmrzfqcwjDlnAdWj/uwX8EqMfWHpDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:01:02.978718Z"},"content_sha256":"5d89286a5701c1f3420b97fefee1e3eb27b782dd2321b1df8899b85d217b2328","schema_version":"1.0","event_id":"sha256:5d89286a5701c1f3420b97fefee1e3eb27b782dd2321b1df8899b85d217b2328"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:RG25AC3NS7VR2DAQSKPWOEQS2C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pruned Continuous Haar Transform of 2D Polygonal Patterns with Application to 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":"2011-05-06T10:46:32Z","abstract_excerpt":"We introduce an algorithm for the efficient computation of the continuous Haar transform of 2D patterns that can be described by polygons. These patterns are ubiquitous in VLSI processes where they are used to describe design and mask layouts. There, speed is of paramount importance due to the magnitude of the problems to be solved and hence very fast algorithms are needed. We show that by techniques borrowed from computational geometry we are not only able to compute the continuous Haar transform directly, but also to do it quickly. This is achieved by massively pruning the transform tree and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.1261","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-18T04:22:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6jyscKVcQy868RvKqLop0ScxpLYoq6BNmp1eAVV11DAEgj9tJMOC34EirJ6Rz58N+79DEAjt9CA2sAgBKDb9Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:01:02.979405Z"},"content_sha256":"6349c4b94677b16281c6094653ba3a28308d6169de59bc96ca69a04be478a833","schema_version":"1.0","event_id":"sha256:6349c4b94677b16281c6094653ba3a28308d6169de59bc96ca69a04be478a833"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RG25AC3NS7VR2DAQSKPWOEQS2C/bundle.json","state_url":"https://pith.science/pith/RG25AC3NS7VR2DAQSKPWOEQS2C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RG25AC3NS7VR2DAQSKPWOEQS2C/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-05-26T17:01:02Z","links":{"resolver":"https://pith.science/pith/RG25AC3NS7VR2DAQSKPWOEQS2C","bundle":"https://pith.science/pith/RG25AC3NS7VR2DAQSKPWOEQS2C/bundle.json","state":"https://pith.science/pith/RG25AC3NS7VR2DAQSKPWOEQS2C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RG25AC3NS7VR2DAQSKPWOEQS2C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:RG25AC3NS7VR2DAQSKPWOEQS2C","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":"8949fa496967852c7c99c9ae620215d6f939b0c1902afaec62e0f57a9153ac83","cross_cats_sorted":["cs.CG","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2011-05-06T10:46:32Z","title_canon_sha256":"968ea834b679ad4d3269a98ff3a92e62a979a33a2d0de3f8ae1a958cf816178c"},"schema_version":"1.0","source":{"id":"1105.1261","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.1261","created_at":"2026-05-18T04:22:40Z"},{"alias_kind":"arxiv_version","alias_value":"1105.1261v1","created_at":"2026-05-18T04:22:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.1261","created_at":"2026-05-18T04:22:40Z"},{"alias_kind":"pith_short_12","alias_value":"RG25AC3NS7VR","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"RG25AC3NS7VR2DAQ","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"RG25AC3N","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:6349c4b94677b16281c6094653ba3a28308d6169de59bc96ca69a04be478a833","target":"graph","created_at":"2026-05-18T04:22:40Z","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":"We introduce an algorithm for the efficient computation of the continuous Haar transform of 2D patterns that can be described by polygons. These patterns are ubiquitous in VLSI processes where they are used to describe design and mask layouts. There, speed is of paramount importance due to the magnitude of the problems to be solved and hence very fast algorithms are needed. We show that by techniques borrowed from computational geometry we are not only able to compute the continuous Haar transform directly, but also to do it quickly. This is achieved by massively pruning the transform tree and","authors_text":"Amina Chebira, Paul Hurley, Robin Scheibler","cross_cats":["cs.CG","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2011-05-06T10:46:32Z","title":"Pruned Continuous Haar Transform of 2D Polygonal Patterns with Application to VLSI Layouts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.1261","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:5d89286a5701c1f3420b97fefee1e3eb27b782dd2321b1df8899b85d217b2328","target":"record","created_at":"2026-05-18T04:22:40Z","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":"8949fa496967852c7c99c9ae620215d6f939b0c1902afaec62e0f57a9153ac83","cross_cats_sorted":["cs.CG","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2011-05-06T10:46:32Z","title_canon_sha256":"968ea834b679ad4d3269a98ff3a92e62a979a33a2d0de3f8ae1a958cf816178c"},"schema_version":"1.0","source":{"id":"1105.1261","kind":"arxiv","version":1}},"canonical_sha256":"89b5d00b6d97eb1d0c10929f671212d085877a4ad55cc11c3e10f697b0bcc799","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"89b5d00b6d97eb1d0c10929f671212d085877a4ad55cc11c3e10f697b0bcc799","first_computed_at":"2026-05-18T04:22:40.769794Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:22:40.769794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nhDkXxEaVgkJe4Lf+tQCE9Gw2ATwdXjB3XXQdH91zXjciGpMpcRJzPjppwyQD6kiq8jrm0yo6pit0OJsyHODCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:22:40.770236Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.1261","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d89286a5701c1f3420b97fefee1e3eb27b782dd2321b1df8899b85d217b2328","sha256:6349c4b94677b16281c6094653ba3a28308d6169de59bc96ca69a04be478a833"],"state_sha256":"44300608b5571b65fbf997f983080ecf82b359d393802328d68835c88af6ad24"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MUEmVawfekQBy65pxe5Lt4CRUF0iHfq5ccMUxLzzFNnhcooFGqXblq4oQ6TyQylkCpwi5aDZqWiq5FG+WKf5AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T17:01:02.982452Z","bundle_sha256":"9ccf0f4f90b5f7017f7508c11844d5d7f426b9c2af09a3d2215f8c019e1841d0"}}