{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:IXFBJ7UWUTMQBQ2HJFTJAJNX2Q","short_pith_number":"pith:IXFBJ7UW","schema_version":"1.0","canonical_sha256":"45ca14fe96a4d900c34749669025b7d42c0f7f1fb7b162baab785f153cf47300","source":{"kind":"arxiv","id":"1806.05356","version":1},"attestation_state":"computed","paper":{"title":"Finding GEMS: Multi-Scale Dictionaries for High-Dimensional Graph Signals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Michael Elad, Yael Yankelevsky","submitted_at":"2018-06-14T04:04:24Z","abstract_excerpt":"Modern data introduces new challenges to classic signal processing approaches, leading to a growing interest in the field of graph signal processing. A powerful and well established model for real world signals in various domains is sparse representation over a dictionary, combined with the ability to train the dictionary from signal examples. This model has been successfully applied to graph signals as well by integrating the underlying graph topology into the learned dictionary. Nonetheless, dictionary learning methods for graph signals are typically restricted to small dimensions due to the"},"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":"1806.05356","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-14T04:04:24Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"7fe5896b656b2a43ecd6faef6fea0d18009edf00b171a237c6285c4b0d55b1db","abstract_canon_sha256":"274cd4ae14e9438158cc9e844924b9d7a4340f3740604287f2d66c223b79e614"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:13.396078Z","signature_b64":"m1eHWotaw7dyH0++tojnBgLCNF3glPQCEDLCjrR0T5p0y4Tpnh1//XH8CUt/P4JkkUKN/8sZPqdMAhyq7xUADw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45ca14fe96a4d900c34749669025b7d42c0f7f1fb7b162baab785f153cf47300","last_reissued_at":"2026-05-17T23:50:13.395512Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:13.395512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding GEMS: Multi-Scale Dictionaries for High-Dimensional Graph Signals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Michael Elad, Yael Yankelevsky","submitted_at":"2018-06-14T04:04:24Z","abstract_excerpt":"Modern data introduces new challenges to classic signal processing approaches, leading to a growing interest in the field of graph signal processing. A powerful and well established model for real world signals in various domains is sparse representation over a dictionary, combined with the ability to train the dictionary from signal examples. This model has been successfully applied to graph signals as well by integrating the underlying graph topology into the learned dictionary. Nonetheless, dictionary learning methods for graph signals are typically restricted to small dimensions due to the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.05356","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":"1806.05356","created_at":"2026-05-17T23:50:13.395598+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.05356v1","created_at":"2026-05-17T23:50:13.395598+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.05356","created_at":"2026-05-17T23:50:13.395598+00:00"},{"alias_kind":"pith_short_12","alias_value":"IXFBJ7UWUTMQ","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"IXFBJ7UWUTMQBQ2H","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"IXFBJ7UW","created_at":"2026-05-18T12:32:31.084164+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/IXFBJ7UWUTMQBQ2HJFTJAJNX2Q","json":"https://pith.science/pith/IXFBJ7UWUTMQBQ2HJFTJAJNX2Q.json","graph_json":"https://pith.science/api/pith-number/IXFBJ7UWUTMQBQ2HJFTJAJNX2Q/graph.json","events_json":"https://pith.science/api/pith-number/IXFBJ7UWUTMQBQ2HJFTJAJNX2Q/events.json","paper":"https://pith.science/paper/IXFBJ7UW"},"agent_actions":{"view_html":"https://pith.science/pith/IXFBJ7UWUTMQBQ2HJFTJAJNX2Q","download_json":"https://pith.science/pith/IXFBJ7UWUTMQBQ2HJFTJAJNX2Q.json","view_paper":"https://pith.science/paper/IXFBJ7UW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.05356&json=true","fetch_graph":"https://pith.science/api/pith-number/IXFBJ7UWUTMQBQ2HJFTJAJNX2Q/graph.json","fetch_events":"https://pith.science/api/pith-number/IXFBJ7UWUTMQBQ2HJFTJAJNX2Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IXFBJ7UWUTMQBQ2HJFTJAJNX2Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IXFBJ7UWUTMQBQ2HJFTJAJNX2Q/action/storage_attestation","attest_author":"https://pith.science/pith/IXFBJ7UWUTMQBQ2HJFTJAJNX2Q/action/author_attestation","sign_citation":"https://pith.science/pith/IXFBJ7UWUTMQBQ2HJFTJAJNX2Q/action/citation_signature","submit_replication":"https://pith.science/pith/IXFBJ7UWUTMQBQ2HJFTJAJNX2Q/action/replication_record"}},"created_at":"2026-05-17T23:50:13.395598+00:00","updated_at":"2026-05-17T23:50:13.395598+00:00"}