{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:IVHODLAWNWN7FFES7DGTM45KLB","short_pith_number":"pith:IVHODLAW","canonical_record":{"source":{"id":"1611.02431","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-08T08:47:18Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"8c7e81cb22548369acaa1f005e8bfa281a65095e06bf31bccd214c55b1ec81f3","abstract_canon_sha256":"c60ce620e3381c842db07b5b3556a36b54514034dc2db34203b9807f40f1b0f1"},"schema_version":"1.0"},"canonical_sha256":"454ee1ac166d9bf29492f8cd3673aa586b4a0903f2432a40caa1c9a2ce5413af","source":{"kind":"arxiv","id":"1611.02431","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.02431","created_at":"2026-05-18T00:59:18Z"},{"alias_kind":"arxiv_version","alias_value":"1611.02431v1","created_at":"2026-05-18T00:59:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.02431","created_at":"2026-05-18T00:59:18Z"},{"alias_kind":"pith_short_12","alias_value":"IVHODLAWNWN7","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IVHODLAWNWN7FFES","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IVHODLAW","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:IVHODLAWNWN7FFES7DGTM45KLB","target":"record","payload":{"canonical_record":{"source":{"id":"1611.02431","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-08T08:47:18Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"8c7e81cb22548369acaa1f005e8bfa281a65095e06bf31bccd214c55b1ec81f3","abstract_canon_sha256":"c60ce620e3381c842db07b5b3556a36b54514034dc2db34203b9807f40f1b0f1"},"schema_version":"1.0"},"canonical_sha256":"454ee1ac166d9bf29492f8cd3673aa586b4a0903f2432a40caa1c9a2ce5413af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:18.340083Z","signature_b64":"WX+5ZOY/juyGrNoXNg0MC8BFDUZDwexRH0k93NbL+eNggyzY4pvanW+obReL5yKdPz1ZCrJygy6U5Z+YEaRSAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"454ee1ac166d9bf29492f8cd3673aa586b4a0903f2432a40caa1c9a2ce5413af","last_reissued_at":"2026-05-18T00:59:18.339333Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:18.339333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.02431","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-18T00:59:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TVNcueps3YmorePL7tObsKEHbrv//UtUB0lFwKlr/MctLWTysjDnNYZzHAEF55MnNNgm9DKDAClivsAlRhDZDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T16:56:51.711172Z"},"content_sha256":"438aa75ddc14cb005138ca743e7cdcc9e970530e5f45c18dc04c2b21e90b5194","schema_version":"1.0","event_id":"sha256:438aa75ddc14cb005138ca743e7cdcc9e970530e5f45c18dc04c2b21e90b5194"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:IVHODLAWNWN7FFES7DGTM45KLB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed recovery of jointly sparse signals under communication constraints","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"math.OC","authors_text":"Carles Anton-Haro, Enrico Magli, Javier Matamoros, Sophie M. Fosson","submitted_at":"2016-11-08T08:47:18Z","abstract_excerpt":"The problem of the distributed recovery of jointly sparse signals has attracted much attention recently. Let us assume that the nodes of a network observe different sparse signals with common support; starting from linear, compressed measurements, and exploiting network communication, each node aims at reconstructing the support and the non-zero values of its observed signal. In the literature, distributed greedy algorithms have been proposed to tackle this problem, among which the most reliable ones require a large amount of transmitted data, which barely adapts to realistic network communica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.02431","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-18T00:59:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BO1qJhXLcQQVcQ1FydRymRSIm/uJX4w0IL4uJ4reFwOl9fPuDzv1YpZHJx2105dueBzWNWN0AkCv5izoig2BCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T16:56:51.711539Z"},"content_sha256":"28711c4550d50effe8eefe759cd47fa460024a4f349b20760ccb43062e6cfa2b","schema_version":"1.0","event_id":"sha256:28711c4550d50effe8eefe759cd47fa460024a4f349b20760ccb43062e6cfa2b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IVHODLAWNWN7FFES7DGTM45KLB/bundle.json","state_url":"https://pith.science/pith/IVHODLAWNWN7FFES7DGTM45KLB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IVHODLAWNWN7FFES7DGTM45KLB/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-05-19T16:56:51Z","links":{"resolver":"https://pith.science/pith/IVHODLAWNWN7FFES7DGTM45KLB","bundle":"https://pith.science/pith/IVHODLAWNWN7FFES7DGTM45KLB/bundle.json","state":"https://pith.science/pith/IVHODLAWNWN7FFES7DGTM45KLB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IVHODLAWNWN7FFES7DGTM45KLB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:IVHODLAWNWN7FFES7DGTM45KLB","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":"c60ce620e3381c842db07b5b3556a36b54514034dc2db34203b9807f40f1b0f1","cross_cats_sorted":["cs.MA"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-08T08:47:18Z","title_canon_sha256":"8c7e81cb22548369acaa1f005e8bfa281a65095e06bf31bccd214c55b1ec81f3"},"schema_version":"1.0","source":{"id":"1611.02431","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.02431","created_at":"2026-05-18T00:59:18Z"},{"alias_kind":"arxiv_version","alias_value":"1611.02431v1","created_at":"2026-05-18T00:59:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.02431","created_at":"2026-05-18T00:59:18Z"},{"alias_kind":"pith_short_12","alias_value":"IVHODLAWNWN7","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IVHODLAWNWN7FFES","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IVHODLAW","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:28711c4550d50effe8eefe759cd47fa460024a4f349b20760ccb43062e6cfa2b","target":"graph","created_at":"2026-05-18T00:59:18Z","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":"The problem of the distributed recovery of jointly sparse signals has attracted much attention recently. Let us assume that the nodes of a network observe different sparse signals with common support; starting from linear, compressed measurements, and exploiting network communication, each node aims at reconstructing the support and the non-zero values of its observed signal. In the literature, distributed greedy algorithms have been proposed to tackle this problem, among which the most reliable ones require a large amount of transmitted data, which barely adapts to realistic network communica","authors_text":"Carles Anton-Haro, Enrico Magli, Javier Matamoros, Sophie M. Fosson","cross_cats":["cs.MA"],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-08T08:47:18Z","title":"Distributed recovery of jointly sparse signals under communication constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.02431","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:438aa75ddc14cb005138ca743e7cdcc9e970530e5f45c18dc04c2b21e90b5194","target":"record","created_at":"2026-05-18T00:59:18Z","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":"c60ce620e3381c842db07b5b3556a36b54514034dc2db34203b9807f40f1b0f1","cross_cats_sorted":["cs.MA"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-08T08:47:18Z","title_canon_sha256":"8c7e81cb22548369acaa1f005e8bfa281a65095e06bf31bccd214c55b1ec81f3"},"schema_version":"1.0","source":{"id":"1611.02431","kind":"arxiv","version":1}},"canonical_sha256":"454ee1ac166d9bf29492f8cd3673aa586b4a0903f2432a40caa1c9a2ce5413af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"454ee1ac166d9bf29492f8cd3673aa586b4a0903f2432a40caa1c9a2ce5413af","first_computed_at":"2026-05-18T00:59:18.339333Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:18.339333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WX+5ZOY/juyGrNoXNg0MC8BFDUZDwexRH0k93NbL+eNggyzY4pvanW+obReL5yKdPz1ZCrJygy6U5Z+YEaRSAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:18.340083Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.02431","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:438aa75ddc14cb005138ca743e7cdcc9e970530e5f45c18dc04c2b21e90b5194","sha256:28711c4550d50effe8eefe759cd47fa460024a4f349b20760ccb43062e6cfa2b"],"state_sha256":"c6b118a8014a3f450557724c9ece3980b5b5cbf66b38d64187e5e1f8db0d639c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m1TEQxmue4C7z4avEuorMVczjEAFA7ggs+/wKxEPCkmr5n0BFmkVBRMfbwlDd/ckk/XRlHrhrd3zRUrYdelcAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T16:56:51.713546Z","bundle_sha256":"5cb18c29706d63e46c64aa4b4464ac7bea899f731e61461ebb6f332ab6cd85ae"}}