{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:QKPDE3EZBY6FC2MZYEL2DXJTWI","short_pith_number":"pith:QKPDE3EZ","schema_version":"1.0","canonical_sha256":"829e326c990e3c516999c117a1dd33b21281d3225d773eff14e78d682561e22f","source":{"kind":"arxiv","id":"1011.4615","version":2},"attestation_state":"computed","paper":{"title":"Generalized Tree-Based Wavelet Transform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Idan Ram, Israel Cohen, Michael Elad","submitted_at":"2010-11-20T21:32:36Z","abstract_excerpt":"In this paper we propose a new wavelet transform applicable to functions defined on graphs, high dimensional data and networks. The proposed method generalizes the Haar-like transform proposed in [1], and it is defined via a hierarchical tree, which is assumed to capture the geometry and structure of the input data. It is applied to the data using a modified version of the common one-dimensional (1D) wavelet filtering and decimation scheme, which can employ different wavelet filters. In each level of this wavelet decomposition scheme, a permutation derived from the tree is applied to the appro"},"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":"1011.4615","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2010-11-20T21:32:36Z","cross_cats_sorted":[],"title_canon_sha256":"364066166c1a3ea03076360e66b3814c7907446e1e2be191282f05b56d5464c3","abstract_canon_sha256":"50942592823e4bebb1ec0bb85e5b7e360527e086b4529f1bf8c7f62737bfcaa0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:04:42.990838Z","signature_b64":"IF2DBAnrcRncou8ntN/btX31+Xhl05qeUKVrIig8rEFKAfduI9AzYEdSWIsROIfq2AuNlCWTJiuun9HnZh1aAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"829e326c990e3c516999c117a1dd33b21281d3225d773eff14e78d682561e22f","last_reissued_at":"2026-05-18T02:04:42.990251Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:04:42.990251Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Tree-Based Wavelet Transform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Idan Ram, Israel Cohen, Michael Elad","submitted_at":"2010-11-20T21:32:36Z","abstract_excerpt":"In this paper we propose a new wavelet transform applicable to functions defined on graphs, high dimensional data and networks. The proposed method generalizes the Haar-like transform proposed in [1], and it is defined via a hierarchical tree, which is assumed to capture the geometry and structure of the input data. It is applied to the data using a modified version of the common one-dimensional (1D) wavelet filtering and decimation scheme, which can employ different wavelet filters. In each level of this wavelet decomposition scheme, a permutation derived from the tree is applied to the appro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.4615","kind":"arxiv","version":2},"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":"1011.4615","created_at":"2026-05-18T02:04:42.990344+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.4615v2","created_at":"2026-05-18T02:04:42.990344+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.4615","created_at":"2026-05-18T02:04:42.990344+00:00"},{"alias_kind":"pith_short_12","alias_value":"QKPDE3EZBY6F","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"QKPDE3EZBY6FC2MZ","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"QKPDE3EZ","created_at":"2026-05-18T12:26:12.377268+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/QKPDE3EZBY6FC2MZYEL2DXJTWI","json":"https://pith.science/pith/QKPDE3EZBY6FC2MZYEL2DXJTWI.json","graph_json":"https://pith.science/api/pith-number/QKPDE3EZBY6FC2MZYEL2DXJTWI/graph.json","events_json":"https://pith.science/api/pith-number/QKPDE3EZBY6FC2MZYEL2DXJTWI/events.json","paper":"https://pith.science/paper/QKPDE3EZ"},"agent_actions":{"view_html":"https://pith.science/pith/QKPDE3EZBY6FC2MZYEL2DXJTWI","download_json":"https://pith.science/pith/QKPDE3EZBY6FC2MZYEL2DXJTWI.json","view_paper":"https://pith.science/paper/QKPDE3EZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.4615&json=true","fetch_graph":"https://pith.science/api/pith-number/QKPDE3EZBY6FC2MZYEL2DXJTWI/graph.json","fetch_events":"https://pith.science/api/pith-number/QKPDE3EZBY6FC2MZYEL2DXJTWI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QKPDE3EZBY6FC2MZYEL2DXJTWI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QKPDE3EZBY6FC2MZYEL2DXJTWI/action/storage_attestation","attest_author":"https://pith.science/pith/QKPDE3EZBY6FC2MZYEL2DXJTWI/action/author_attestation","sign_citation":"https://pith.science/pith/QKPDE3EZBY6FC2MZYEL2DXJTWI/action/citation_signature","submit_replication":"https://pith.science/pith/QKPDE3EZBY6FC2MZYEL2DXJTWI/action/replication_record"}},"created_at":"2026-05-18T02:04:42.990344+00:00","updated_at":"2026-05-18T02:04:42.990344+00:00"}