{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XI526ZBJ64JLPWIUMHO5HSUEAQ","short_pith_number":"pith:XI526ZBJ","canonical_record":{"source":{"id":"1803.09631","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-26T14:45:37Z","cross_cats_sorted":["cs.SI","eess.SP","math.IT"],"title_canon_sha256":"4ee727bcbef5a76aa991620bc69fb6e8c2c8b72fdd5981866008d94529c57a5c","abstract_canon_sha256":"6d80d0b8f4e775a142ba5cba96de8ae81be82df657548aaf608846f22b7844a2"},"schema_version":"1.0"},"canonical_sha256":"ba3baf6429f712b7d91461ddd3ca840404974ce2c33adfe349c15ce2b343cfdf","source":{"kind":"arxiv","id":"1803.09631","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.09631","created_at":"2026-05-17T23:49:33Z"},{"alias_kind":"arxiv_version","alias_value":"1803.09631v2","created_at":"2026-05-17T23:49:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09631","created_at":"2026-05-17T23:49:33Z"},{"alias_kind":"pith_short_12","alias_value":"XI526ZBJ64JL","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XI526ZBJ64JLPWIU","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XI526ZBJ","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XI526ZBJ64JLPWIUMHO5HSUEAQ","target":"record","payload":{"canonical_record":{"source":{"id":"1803.09631","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-26T14:45:37Z","cross_cats_sorted":["cs.SI","eess.SP","math.IT"],"title_canon_sha256":"4ee727bcbef5a76aa991620bc69fb6e8c2c8b72fdd5981866008d94529c57a5c","abstract_canon_sha256":"6d80d0b8f4e775a142ba5cba96de8ae81be82df657548aaf608846f22b7844a2"},"schema_version":"1.0"},"canonical_sha256":"ba3baf6429f712b7d91461ddd3ca840404974ce2c33adfe349c15ce2b343cfdf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:33.627053Z","signature_b64":"MMMPw+4Dm+9pCIOo7CC8+3F52P+BjbU+zmouTv+tBgwdxgB6ZdLMeCzwg6//LcmP/chmLDc7CySr52sX+hSmAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba3baf6429f712b7d91461ddd3ca840404974ce2c33adfe349c15ce2b343cfdf","last_reissued_at":"2026-05-17T23:49:33.626449Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:33.626449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.09631","source_version":2,"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-17T23:49:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y8RVJwFM24oOcPxhUohdSjN3lxYo/biJoe9A8zGJbaV9y2/IoIDVuTGFP7ECtlSp+e1ZxZcnsvzmUfXN2CF4Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:19:55.268470Z"},"content_sha256":"ff5da374d246f9a69cc7872330ec4f043d4bcdf684a704a1b6e2f60313bd3f78","schema_version":"1.0","event_id":"sha256:ff5da374d246f9a69cc7872330ec4f043d4bcdf684a704a1b6e2f60313bd3f78"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XI526ZBJ64JLPWIUMHO5HSUEAQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparse Recovery over Graph Incidence Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Daniel P. Robinson, Enrique Mallada, M. Devrim Kaba, Mengnan Zhao, Ren\\'e Vidal","submitted_at":"2018-03-26T14:45:37Z","abstract_excerpt":"Classical results in sparse recovery guarantee the exact reconstruction of $s$-sparse signals under assumptions on the dictionary that are either too strong or NP-hard to check. Moreover, such results may be pessimistic in practice since they are based on a worst-case analysis. In this paper, we consider the sparse recovery of signals defined over a graph, for which the dictionary takes the form of an incidence matrix. We derive necessary and sufficient conditions for sparse recovery, which depend on properties of the cycles of the graph that can be checked in polynomial time. We also derive s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09631","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":""},"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-17T23:49:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cgkFZ5+y1GXwuN/j9QyLZbEuTqlDcynArfDBukg4DufK5mptU9bky2O0qh5NQZ0VnBL6bXVFeoYwJ3+Zv+TnCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:19:55.268815Z"},"content_sha256":"e4a9032738ac12520bd7c613de25297dfcf07ede2e9961ffb6afbb33682951bd","schema_version":"1.0","event_id":"sha256:e4a9032738ac12520bd7c613de25297dfcf07ede2e9961ffb6afbb33682951bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XI526ZBJ64JLPWIUMHO5HSUEAQ/bundle.json","state_url":"https://pith.science/pith/XI526ZBJ64JLPWIUMHO5HSUEAQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XI526ZBJ64JLPWIUMHO5HSUEAQ/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-06T16:19:55Z","links":{"resolver":"https://pith.science/pith/XI526ZBJ64JLPWIUMHO5HSUEAQ","bundle":"https://pith.science/pith/XI526ZBJ64JLPWIUMHO5HSUEAQ/bundle.json","state":"https://pith.science/pith/XI526ZBJ64JLPWIUMHO5HSUEAQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XI526ZBJ64JLPWIUMHO5HSUEAQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XI526ZBJ64JLPWIUMHO5HSUEAQ","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":"6d80d0b8f4e775a142ba5cba96de8ae81be82df657548aaf608846f22b7844a2","cross_cats_sorted":["cs.SI","eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-26T14:45:37Z","title_canon_sha256":"4ee727bcbef5a76aa991620bc69fb6e8c2c8b72fdd5981866008d94529c57a5c"},"schema_version":"1.0","source":{"id":"1803.09631","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.09631","created_at":"2026-05-17T23:49:33Z"},{"alias_kind":"arxiv_version","alias_value":"1803.09631v2","created_at":"2026-05-17T23:49:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09631","created_at":"2026-05-17T23:49:33Z"},{"alias_kind":"pith_short_12","alias_value":"XI526ZBJ64JL","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XI526ZBJ64JLPWIU","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XI526ZBJ","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:e4a9032738ac12520bd7c613de25297dfcf07ede2e9961ffb6afbb33682951bd","target":"graph","created_at":"2026-05-17T23:49: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":"Classical results in sparse recovery guarantee the exact reconstruction of $s$-sparse signals under assumptions on the dictionary that are either too strong or NP-hard to check. Moreover, such results may be pessimistic in practice since they are based on a worst-case analysis. In this paper, we consider the sparse recovery of signals defined over a graph, for which the dictionary takes the form of an incidence matrix. We derive necessary and sufficient conditions for sparse recovery, which depend on properties of the cycles of the graph that can be checked in polynomial time. We also derive s","authors_text":"Daniel P. Robinson, Enrique Mallada, M. Devrim Kaba, Mengnan Zhao, Ren\\'e Vidal","cross_cats":["cs.SI","eess.SP","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-26T14:45:37Z","title":"Sparse Recovery over Graph Incidence Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09631","kind":"arxiv","version":2},"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:ff5da374d246f9a69cc7872330ec4f043d4bcdf684a704a1b6e2f60313bd3f78","target":"record","created_at":"2026-05-17T23:49: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":"6d80d0b8f4e775a142ba5cba96de8ae81be82df657548aaf608846f22b7844a2","cross_cats_sorted":["cs.SI","eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-26T14:45:37Z","title_canon_sha256":"4ee727bcbef5a76aa991620bc69fb6e8c2c8b72fdd5981866008d94529c57a5c"},"schema_version":"1.0","source":{"id":"1803.09631","kind":"arxiv","version":2}},"canonical_sha256":"ba3baf6429f712b7d91461ddd3ca840404974ce2c33adfe349c15ce2b343cfdf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ba3baf6429f712b7d91461ddd3ca840404974ce2c33adfe349c15ce2b343cfdf","first_computed_at":"2026-05-17T23:49:33.626449Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:33.626449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MMMPw+4Dm+9pCIOo7CC8+3F52P+BjbU+zmouTv+tBgwdxgB6ZdLMeCzwg6//LcmP/chmLDc7CySr52sX+hSmAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:33.627053Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.09631","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff5da374d246f9a69cc7872330ec4f043d4bcdf684a704a1b6e2f60313bd3f78","sha256:e4a9032738ac12520bd7c613de25297dfcf07ede2e9961ffb6afbb33682951bd"],"state_sha256":"16705629b7e66417a573ef32d2a0529647e4700afc2a445c987e965619ecc5a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aamxtx6Cu6BdzVDxPeadq6W8LxxP2H0dJs4tcCMG4FWhNbYEPYWFVyjDWL5kxiaKqQ8paxNfaWhKwJE0HyO4AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T16:19:55.271491Z","bundle_sha256":"6e6cab33b6ff190a08ca17608913f6bc2095f1a752319566f01a13d871f751c0"}}