{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:BTDBB24PWCOGW3LWVCTPFUCJR7","short_pith_number":"pith:BTDBB24P","schema_version":"1.0","canonical_sha256":"0cc610eb8fb09c6b6d76a8a6f2d0498feaabc3c5dbabb78cab844817684edc9e","source":{"kind":"arxiv","id":"1509.09187","version":1},"attestation_state":"computed","paper":{"title":"Deep Haar Scattering Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Stephane Mallat, Xiuyuan Cheng, Xu Chen","submitted_at":"2015-09-30T14:20:29Z","abstract_excerpt":"An orthogonal Haar scattering transform is a deep network, computed with a hierarchy of additions, subtractions and absolute values, over pairs of coefficients. It provides a simple mathematical model for unsupervised deep network learning. It implements non-linear contractions, which are optimized for classification, with an unsupervised pair matching algorithm, of polynomial complexity. A structured Haar scattering over graph data computes permutation invariant representations of groups of connected points in the graph. If the graph connectivity is unknown, unsupervised Haar pair learning ca"},"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":"1509.09187","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-30T14:20:29Z","cross_cats_sorted":[],"title_canon_sha256":"08d5e90c0ce76916239030247569201f661a9b607193e5d9c4c042a22c425f91","abstract_canon_sha256":"1019cea68004b027f1222d1a68f8920de6409a562c621d5015e5a8774ba687de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:26.879779Z","signature_b64":"5g9j+7le/5fJVnwcBhrc77cTPqohWvCDPic8aDbGNgAEDygwaKS35hkuUz8/hjw2EF8ZK6NTDHjpVY/jn2GsBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0cc610eb8fb09c6b6d76a8a6f2d0498feaabc3c5dbabb78cab844817684edc9e","last_reissued_at":"2026-05-18T01:31:26.879195Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:26.879195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep Haar Scattering Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Stephane Mallat, Xiuyuan Cheng, Xu Chen","submitted_at":"2015-09-30T14:20:29Z","abstract_excerpt":"An orthogonal Haar scattering transform is a deep network, computed with a hierarchy of additions, subtractions and absolute values, over pairs of coefficients. It provides a simple mathematical model for unsupervised deep network learning. It implements non-linear contractions, which are optimized for classification, with an unsupervised pair matching algorithm, of polynomial complexity. A structured Haar scattering over graph data computes permutation invariant representations of groups of connected points in the graph. If the graph connectivity is unknown, unsupervised Haar pair learning ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.09187","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":"1509.09187","created_at":"2026-05-18T01:31:26.879283+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.09187v1","created_at":"2026-05-18T01:31:26.879283+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.09187","created_at":"2026-05-18T01:31:26.879283+00:00"},{"alias_kind":"pith_short_12","alias_value":"BTDBB24PWCOG","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BTDBB24PWCOGW3LW","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BTDBB24P","created_at":"2026-05-18T12:29:14.074870+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/BTDBB24PWCOGW3LWVCTPFUCJR7","json":"https://pith.science/pith/BTDBB24PWCOGW3LWVCTPFUCJR7.json","graph_json":"https://pith.science/api/pith-number/BTDBB24PWCOGW3LWVCTPFUCJR7/graph.json","events_json":"https://pith.science/api/pith-number/BTDBB24PWCOGW3LWVCTPFUCJR7/events.json","paper":"https://pith.science/paper/BTDBB24P"},"agent_actions":{"view_html":"https://pith.science/pith/BTDBB24PWCOGW3LWVCTPFUCJR7","download_json":"https://pith.science/pith/BTDBB24PWCOGW3LWVCTPFUCJR7.json","view_paper":"https://pith.science/paper/BTDBB24P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.09187&json=true","fetch_graph":"https://pith.science/api/pith-number/BTDBB24PWCOGW3LWVCTPFUCJR7/graph.json","fetch_events":"https://pith.science/api/pith-number/BTDBB24PWCOGW3LWVCTPFUCJR7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BTDBB24PWCOGW3LWVCTPFUCJR7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BTDBB24PWCOGW3LWVCTPFUCJR7/action/storage_attestation","attest_author":"https://pith.science/pith/BTDBB24PWCOGW3LWVCTPFUCJR7/action/author_attestation","sign_citation":"https://pith.science/pith/BTDBB24PWCOGW3LWVCTPFUCJR7/action/citation_signature","submit_replication":"https://pith.science/pith/BTDBB24PWCOGW3LWVCTPFUCJR7/action/replication_record"}},"created_at":"2026-05-18T01:31:26.879283+00:00","updated_at":"2026-05-18T01:31:26.879283+00:00"}