{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:T7ZE5VWMEWAOH2GW2SYISLYJTZ","short_pith_number":"pith:T7ZE5VWM","schema_version":"1.0","canonical_sha256":"9ff24ed6cc2580e3e8d6d4b0892f099e4fcc8ad7aea735dc37d5bd885d5058b4","source":{"kind":"arxiv","id":"1401.0887","version":1},"attestation_state":"computed","paper":{"title":"Learning parametric dictionaries for graph signals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"David I Shuman, Dorina Thanou, Pascal Frossard","submitted_at":"2014-01-05T12:17:51Z","abstract_excerpt":"In sparse signal representation, the choice of a dictionary often involves a tradeoff between two desirable properties -- the ability to adapt to specific signal data and a fast implementation of the dictionary. To sparsely represent signals residing on weighted graphs, an additional design challenge is to incorporate the intrinsic geometric structure of the irregular data domain into the atoms of the dictionary. In this work, we propose a parametric dictionary learning algorithm to design data-adapted, structured dictionaries that sparsely represent graph signals. In particular, we model grap"},"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":"1401.0887","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-01-05T12:17:51Z","cross_cats_sorted":["cs.SI","stat.ML"],"title_canon_sha256":"0486f787a96b0db35cd5280db2606ff8f616d81a74e196881ad4fc839374dc1c","abstract_canon_sha256":"15edad3e196168262f57aed26468e8e8eb773f05d4d5cf51dbab857a02837ee6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:45:33.932110Z","signature_b64":"ydJDH2un2stMPbzgbArn8g0wlT6CS26DV1oAX4XitJ+Nm1irNfBucg+NqweA5wxIg46aqzHyplkJjeCR0ARGDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ff24ed6cc2580e3e8d6d4b0892f099e4fcc8ad7aea735dc37d5bd885d5058b4","last_reissued_at":"2026-05-18T01:45:33.931496Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:45:33.931496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning parametric dictionaries for graph signals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"David I Shuman, Dorina Thanou, Pascal Frossard","submitted_at":"2014-01-05T12:17:51Z","abstract_excerpt":"In sparse signal representation, the choice of a dictionary often involves a tradeoff between two desirable properties -- the ability to adapt to specific signal data and a fast implementation of the dictionary. To sparsely represent signals residing on weighted graphs, an additional design challenge is to incorporate the intrinsic geometric structure of the irregular data domain into the atoms of the dictionary. In this work, we propose a parametric dictionary learning algorithm to design data-adapted, structured dictionaries that sparsely represent graph signals. In particular, we model grap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0887","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":"1401.0887","created_at":"2026-05-18T01:45:33.931603+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.0887v1","created_at":"2026-05-18T01:45:33.931603+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0887","created_at":"2026-05-18T01:45:33.931603+00:00"},{"alias_kind":"pith_short_12","alias_value":"T7ZE5VWMEWAO","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"T7ZE5VWMEWAOH2GW","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"T7ZE5VWM","created_at":"2026-05-18T12:28:49.207871+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/T7ZE5VWMEWAOH2GW2SYISLYJTZ","json":"https://pith.science/pith/T7ZE5VWMEWAOH2GW2SYISLYJTZ.json","graph_json":"https://pith.science/api/pith-number/T7ZE5VWMEWAOH2GW2SYISLYJTZ/graph.json","events_json":"https://pith.science/api/pith-number/T7ZE5VWMEWAOH2GW2SYISLYJTZ/events.json","paper":"https://pith.science/paper/T7ZE5VWM"},"agent_actions":{"view_html":"https://pith.science/pith/T7ZE5VWMEWAOH2GW2SYISLYJTZ","download_json":"https://pith.science/pith/T7ZE5VWMEWAOH2GW2SYISLYJTZ.json","view_paper":"https://pith.science/paper/T7ZE5VWM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.0887&json=true","fetch_graph":"https://pith.science/api/pith-number/T7ZE5VWMEWAOH2GW2SYISLYJTZ/graph.json","fetch_events":"https://pith.science/api/pith-number/T7ZE5VWMEWAOH2GW2SYISLYJTZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T7ZE5VWMEWAOH2GW2SYISLYJTZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T7ZE5VWMEWAOH2GW2SYISLYJTZ/action/storage_attestation","attest_author":"https://pith.science/pith/T7ZE5VWMEWAOH2GW2SYISLYJTZ/action/author_attestation","sign_citation":"https://pith.science/pith/T7ZE5VWMEWAOH2GW2SYISLYJTZ/action/citation_signature","submit_replication":"https://pith.science/pith/T7ZE5VWMEWAOH2GW2SYISLYJTZ/action/replication_record"}},"created_at":"2026-05-18T01:45:33.931603+00:00","updated_at":"2026-05-18T01:45:33.931603+00:00"}