{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:JQ7DIXJMDGRF5XBG4S4F5F5E5D","short_pith_number":"pith:JQ7DIXJM","schema_version":"1.0","canonical_sha256":"4c3e345d2c19a25edc26e4b85e97a4e8d11e59fb2bd74a1145a3e05be3ca51b7","source":{"kind":"arxiv","id":"2501.15094","version":2},"attestation_state":"computed","paper":{"title":"Exploring the Limitations of Structured Orthogonal Dictionary Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Aditya Siripuram, Anirudh Dash","submitted_at":"2025-01-25T06:00:52Z","abstract_excerpt":"This work is motivated by recent applications of structured dictionary learning, in particular when the dictionary is assumed to be the product of a few Householder atoms. We investigate the following two problems: 1) How do we approximate an orthogonal matrix $\\mathbf{V}$ with a product of a specified number of Householder matrices, and 2) How many samples are required to learn a structured (Householder) dictionary from data? For 1) we discuss an algorithm that decomposes $\\mathbf{V}$ as a product of a specified number of Householder matrices. We see that the algorithm outputs the decompositi"},"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":"2501.15094","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SP","submitted_at":"2025-01-25T06:00:52Z","cross_cats_sorted":[],"title_canon_sha256":"a6870c0c54102b6fd6785c951789065c579691781268a2a783cf1f83e6338641","abstract_canon_sha256":"c59b93901dc067cb0d303f25bca953873e936365b282da4962bd6438455ae64a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:50:46.824007Z","signature_b64":"i0E7pREflqKByGXpPD04VTAyqrt4W4ULvMpc42KAfXas/tRzhSEaGkwu1zYFa7s081m4LSTelnP0ruFVNDrDCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c3e345d2c19a25edc26e4b85e97a4e8d11e59fb2bd74a1145a3e05be3ca51b7","last_reissued_at":"2026-07-05T10:50:46.823538Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:50:46.823538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploring the Limitations of Structured Orthogonal Dictionary Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Aditya Siripuram, Anirudh Dash","submitted_at":"2025-01-25T06:00:52Z","abstract_excerpt":"This work is motivated by recent applications of structured dictionary learning, in particular when the dictionary is assumed to be the product of a few Householder atoms. We investigate the following two problems: 1) How do we approximate an orthogonal matrix $\\mathbf{V}$ with a product of a specified number of Householder matrices, and 2) How many samples are required to learn a structured (Householder) dictionary from data? For 1) we discuss an algorithm that decomposes $\\mathbf{V}$ as a product of a specified number of Householder matrices. We see that the algorithm outputs the decompositi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.15094","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.15094/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":"2501.15094","created_at":"2026-07-05T10:50:46.823599+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.15094v2","created_at":"2026-07-05T10:50:46.823599+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.15094","created_at":"2026-07-05T10:50:46.823599+00:00"},{"alias_kind":"pith_short_12","alias_value":"JQ7DIXJMDGRF","created_at":"2026-07-05T10:50:46.823599+00:00"},{"alias_kind":"pith_short_16","alias_value":"JQ7DIXJMDGRF5XBG","created_at":"2026-07-05T10:50:46.823599+00:00"},{"alias_kind":"pith_short_8","alias_value":"JQ7DIXJM","created_at":"2026-07-05T10:50:46.823599+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/JQ7DIXJMDGRF5XBG4S4F5F5E5D","json":"https://pith.science/pith/JQ7DIXJMDGRF5XBG4S4F5F5E5D.json","graph_json":"https://pith.science/api/pith-number/JQ7DIXJMDGRF5XBG4S4F5F5E5D/graph.json","events_json":"https://pith.science/api/pith-number/JQ7DIXJMDGRF5XBG4S4F5F5E5D/events.json","paper":"https://pith.science/paper/JQ7DIXJM"},"agent_actions":{"view_html":"https://pith.science/pith/JQ7DIXJMDGRF5XBG4S4F5F5E5D","download_json":"https://pith.science/pith/JQ7DIXJMDGRF5XBG4S4F5F5E5D.json","view_paper":"https://pith.science/paper/JQ7DIXJM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.15094&json=true","fetch_graph":"https://pith.science/api/pith-number/JQ7DIXJMDGRF5XBG4S4F5F5E5D/graph.json","fetch_events":"https://pith.science/api/pith-number/JQ7DIXJMDGRF5XBG4S4F5F5E5D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JQ7DIXJMDGRF5XBG4S4F5F5E5D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JQ7DIXJMDGRF5XBG4S4F5F5E5D/action/storage_attestation","attest_author":"https://pith.science/pith/JQ7DIXJMDGRF5XBG4S4F5F5E5D/action/author_attestation","sign_citation":"https://pith.science/pith/JQ7DIXJMDGRF5XBG4S4F5F5E5D/action/citation_signature","submit_replication":"https://pith.science/pith/JQ7DIXJMDGRF5XBG4S4F5F5E5D/action/replication_record"}},"created_at":"2026-07-05T10:50:46.823599+00:00","updated_at":"2026-07-05T10:50:46.823599+00:00"}