{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:T7ZE5VWMEWAOH2GW2SYISLYJTZ","short_pith_number":"pith:T7ZE5VWM","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"},"canonical_sha256":"9ff24ed6cc2580e3e8d6d4b0892f099e4fcc8ad7aea735dc37d5bd885d5058b4","source":{"kind":"arxiv","id":"1401.0887","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.0887","created_at":"2026-05-18T01:45:33Z"},{"alias_kind":"arxiv_version","alias_value":"1401.0887v1","created_at":"2026-05-18T01:45:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0887","created_at":"2026-05-18T01:45:33Z"},{"alias_kind":"pith_short_12","alias_value":"T7ZE5VWMEWAO","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"T7ZE5VWMEWAOH2GW","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"T7ZE5VWM","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:T7ZE5VWMEWAOH2GW2SYISLYJTZ","target":"record","payload":{"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"},"canonical_sha256":"9ff24ed6cc2580e3e8d6d4b0892f099e4fcc8ad7aea735dc37d5bd885d5058b4","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"},"source_kind":"arxiv","source_id":"1401.0887","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:45:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GV0Z9mIiHjkmZIlSEeaV2OSA07clC4z8QaskpKpK0yqhpxYPrJzI/X6KhAxFsXIKhxFdP2yHFRDE26AR3e+zCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T09:35:44.608970Z"},"content_sha256":"0a9397cd9a07f4c836b6792235d4aa93c253fcf6a0db59f473f3eee0f3b78cd4","schema_version":"1.0","event_id":"sha256:0a9397cd9a07f4c836b6792235d4aa93c253fcf6a0db59f473f3eee0f3b78cd4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:T7ZE5VWMEWAOH2GW2SYISLYJTZ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:45:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m4PZ0lwU9UjJSDV8iwjmbFV3K1SWU0wf958fzo1dgROaMDmzLop7wPJ4qUYZlJzjwuIn8iLsmbbO2EC0G27zDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T09:35:44.609331Z"},"content_sha256":"d2b687abe242175789e23d69476cbe4d58e1a51f8e47080e2ca6e12c63a0bd7c","schema_version":"1.0","event_id":"sha256:d2b687abe242175789e23d69476cbe4d58e1a51f8e47080e2ca6e12c63a0bd7c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T7ZE5VWMEWAOH2GW2SYISLYJTZ/bundle.json","state_url":"https://pith.science/pith/T7ZE5VWMEWAOH2GW2SYISLYJTZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T7ZE5VWMEWAOH2GW2SYISLYJTZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-20T09:35:44Z","links":{"resolver":"https://pith.science/pith/T7ZE5VWMEWAOH2GW2SYISLYJTZ","bundle":"https://pith.science/pith/T7ZE5VWMEWAOH2GW2SYISLYJTZ/bundle.json","state":"https://pith.science/pith/T7ZE5VWMEWAOH2GW2SYISLYJTZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T7ZE5VWMEWAOH2GW2SYISLYJTZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:T7ZE5VWMEWAOH2GW2SYISLYJTZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"15edad3e196168262f57aed26468e8e8eb773f05d4d5cf51dbab857a02837ee6","cross_cats_sorted":["cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-01-05T12:17:51Z","title_canon_sha256":"0486f787a96b0db35cd5280db2606ff8f616d81a74e196881ad4fc839374dc1c"},"schema_version":"1.0","source":{"id":"1401.0887","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.0887","created_at":"2026-05-18T01:45:33Z"},{"alias_kind":"arxiv_version","alias_value":"1401.0887v1","created_at":"2026-05-18T01:45:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0887","created_at":"2026-05-18T01:45:33Z"},{"alias_kind":"pith_short_12","alias_value":"T7ZE5VWMEWAO","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"T7ZE5VWMEWAOH2GW","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"T7ZE5VWM","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:d2b687abe242175789e23d69476cbe4d58e1a51f8e47080e2ca6e12c63a0bd7c","target":"graph","created_at":"2026-05-18T01:45:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"David I Shuman, Dorina Thanou, Pascal Frossard","cross_cats":["cs.SI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-01-05T12:17:51Z","title":"Learning parametric dictionaries for graph signals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0887","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0a9397cd9a07f4c836b6792235d4aa93c253fcf6a0db59f473f3eee0f3b78cd4","target":"record","created_at":"2026-05-18T01:45:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"15edad3e196168262f57aed26468e8e8eb773f05d4d5cf51dbab857a02837ee6","cross_cats_sorted":["cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-01-05T12:17:51Z","title_canon_sha256":"0486f787a96b0db35cd5280db2606ff8f616d81a74e196881ad4fc839374dc1c"},"schema_version":"1.0","source":{"id":"1401.0887","kind":"arxiv","version":1}},"canonical_sha256":"9ff24ed6cc2580e3e8d6d4b0892f099e4fcc8ad7aea735dc37d5bd885d5058b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ff24ed6cc2580e3e8d6d4b0892f099e4fcc8ad7aea735dc37d5bd885d5058b4","first_computed_at":"2026-05-18T01:45:33.931496Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:45:33.931496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ydJDH2un2stMPbzgbArn8g0wlT6CS26DV1oAX4XitJ+Nm1irNfBucg+NqweA5wxIg46aqzHyplkJjeCR0ARGDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:45:33.932110Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.0887","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0a9397cd9a07f4c836b6792235d4aa93c253fcf6a0db59f473f3eee0f3b78cd4","sha256:d2b687abe242175789e23d69476cbe4d58e1a51f8e47080e2ca6e12c63a0bd7c"],"state_sha256":"ccefb9f7e0cad89d4f2065ceb71bb732128b35b59867fae91aa2eb67b5a26a49"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PGPXaFfnPJO+97gtO62dhn4NfotwulTiJytmx5D6ydteyTem5eO1w3ev1kRXSSVPQWPORmqzi+yx8RZySp6FBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T09:35:44.611162Z","bundle_sha256":"5bc3a6679ebadb19178c33e34fce874fc80a2e55b5104c3341ad9991b72d18ce"}}