{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:LFYBQB3GMZ3RYDAQ7OEE4MX5UC","short_pith_number":"pith:LFYBQB3G","canonical_record":{"source":{"id":"1211.6719","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-28T19:55:24Z","cross_cats_sorted":["cs.NA","math.IT"],"title_canon_sha256":"875cc1a6d7b050eebdd0b38682ae158ebfc7a66df31ceff53c50f59e50afb65c","abstract_canon_sha256":"8397874606b7e6d4159eb748eb9d7e289c68130a360ee67440e17dd233801095"},"schema_version":"1.0"},"canonical_sha256":"597018076666771c0c10fb884e32fda0a38fd2480e1799cb56261a3209afbc46","source":{"kind":"arxiv","id":"1211.6719","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.6719","created_at":"2026-05-18T03:39:43Z"},{"alias_kind":"arxiv_version","alias_value":"1211.6719v1","created_at":"2026-05-18T03:39:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.6719","created_at":"2026-05-18T03:39:43Z"},{"alias_kind":"pith_short_12","alias_value":"LFYBQB3GMZ3R","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"LFYBQB3GMZ3RYDAQ","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"LFYBQB3G","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:LFYBQB3GMZ3RYDAQ7OEE4MX5UC","target":"record","payload":{"canonical_record":{"source":{"id":"1211.6719","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-28T19:55:24Z","cross_cats_sorted":["cs.NA","math.IT"],"title_canon_sha256":"875cc1a6d7b050eebdd0b38682ae158ebfc7a66df31ceff53c50f59e50afb65c","abstract_canon_sha256":"8397874606b7e6d4159eb748eb9d7e289c68130a360ee67440e17dd233801095"},"schema_version":"1.0"},"canonical_sha256":"597018076666771c0c10fb884e32fda0a38fd2480e1799cb56261a3209afbc46","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:39:43.970135Z","signature_b64":"6LzZABAAqfziF1+hBN4Pd6kz7UYQNBXiUrRQ85y9Bm00UhlUF9koR5n6VvNgywxVezo1nwLoGZd2T2eXzPFGBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"597018076666771c0c10fb884e32fda0a38fd2480e1799cb56261a3209afbc46","last_reissued_at":"2026-05-18T03:39:43.969602Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:39:43.969602Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.6719","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-18T03:39:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"90W89ZsFdR5xEFajQcBW0VtuvTuIWavK6tKtFmXM+/RHOk5Fd1YdHGy9f62Y+HFXmnMUgYrXwaS+EckCIi4+CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:00:28.389380Z"},"content_sha256":"2baaa7c76581f03d703001a225559889541495836faf23b0a864e3622b6b803b","schema_version":"1.0","event_id":"sha256:2baaa7c76581f03d703001a225559889541495836faf23b0a864e3622b6b803b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:LFYBQB3GMZ3RYDAQ7OEE4MX5UC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cooperative Sparsity Pattern Recovery in Distributed Networks Via Distributed-OMP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.IT"],"primary_cat":"cs.IT","authors_text":"Pramod K. Varshney, Thakshila Wimalajeewa","submitted_at":"2012-11-28T19:55:24Z","abstract_excerpt":"In this paper, we consider the problem of collaboratively estimating the sparsity pattern of a sparse signal with multiple measurement data in distributed networks. We assume that each node makes Compressive Sensing (CS) based measurements via random projections regarding the same sparse signal. We propose a distributed greedy algorithm based on Orthogonal Matching Pursuit (OMP), in which the sparse support is estimated iteratively while fusing indices estimated at distributed nodes. In the proposed distributed framework, each node has to perform less number of iterations of OMP compared to th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.6719","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-18T03:39:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tp35DUs0ruWQzaYrp20hQKGKtPq3IXazpNay7VSSeBq8pdq0JwnZH+Jsjslewp4ZP+uxSmmhcpYrJ0ftCey5DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:00:28.389738Z"},"content_sha256":"de45caeffeac69c34e69901be040e38145db5d656d288209fbde8d62d9f794c2","schema_version":"1.0","event_id":"sha256:de45caeffeac69c34e69901be040e38145db5d656d288209fbde8d62d9f794c2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LFYBQB3GMZ3RYDAQ7OEE4MX5UC/bundle.json","state_url":"https://pith.science/pith/LFYBQB3GMZ3RYDAQ7OEE4MX5UC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LFYBQB3GMZ3RYDAQ7OEE4MX5UC/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-02T23:00:28Z","links":{"resolver":"https://pith.science/pith/LFYBQB3GMZ3RYDAQ7OEE4MX5UC","bundle":"https://pith.science/pith/LFYBQB3GMZ3RYDAQ7OEE4MX5UC/bundle.json","state":"https://pith.science/pith/LFYBQB3GMZ3RYDAQ7OEE4MX5UC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LFYBQB3GMZ3RYDAQ7OEE4MX5UC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:LFYBQB3GMZ3RYDAQ7OEE4MX5UC","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":"8397874606b7e6d4159eb748eb9d7e289c68130a360ee67440e17dd233801095","cross_cats_sorted":["cs.NA","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-28T19:55:24Z","title_canon_sha256":"875cc1a6d7b050eebdd0b38682ae158ebfc7a66df31ceff53c50f59e50afb65c"},"schema_version":"1.0","source":{"id":"1211.6719","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.6719","created_at":"2026-05-18T03:39:43Z"},{"alias_kind":"arxiv_version","alias_value":"1211.6719v1","created_at":"2026-05-18T03:39:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.6719","created_at":"2026-05-18T03:39:43Z"},{"alias_kind":"pith_short_12","alias_value":"LFYBQB3GMZ3R","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"LFYBQB3GMZ3RYDAQ","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"LFYBQB3G","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:de45caeffeac69c34e69901be040e38145db5d656d288209fbde8d62d9f794c2","target":"graph","created_at":"2026-05-18T03:39:43Z","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 this paper, we consider the problem of collaboratively estimating the sparsity pattern of a sparse signal with multiple measurement data in distributed networks. We assume that each node makes Compressive Sensing (CS) based measurements via random projections regarding the same sparse signal. We propose a distributed greedy algorithm based on Orthogonal Matching Pursuit (OMP), in which the sparse support is estimated iteratively while fusing indices estimated at distributed nodes. In the proposed distributed framework, each node has to perform less number of iterations of OMP compared to th","authors_text":"Pramod K. Varshney, Thakshila Wimalajeewa","cross_cats":["cs.NA","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-28T19:55:24Z","title":"Cooperative Sparsity Pattern Recovery in Distributed Networks Via Distributed-OMP"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.6719","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:2baaa7c76581f03d703001a225559889541495836faf23b0a864e3622b6b803b","target":"record","created_at":"2026-05-18T03:39:43Z","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":"8397874606b7e6d4159eb748eb9d7e289c68130a360ee67440e17dd233801095","cross_cats_sorted":["cs.NA","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-28T19:55:24Z","title_canon_sha256":"875cc1a6d7b050eebdd0b38682ae158ebfc7a66df31ceff53c50f59e50afb65c"},"schema_version":"1.0","source":{"id":"1211.6719","kind":"arxiv","version":1}},"canonical_sha256":"597018076666771c0c10fb884e32fda0a38fd2480e1799cb56261a3209afbc46","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"597018076666771c0c10fb884e32fda0a38fd2480e1799cb56261a3209afbc46","first_computed_at":"2026-05-18T03:39:43.969602Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:39:43.969602Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6LzZABAAqfziF1+hBN4Pd6kz7UYQNBXiUrRQ85y9Bm00UhlUF9koR5n6VvNgywxVezo1nwLoGZd2T2eXzPFGBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:39:43.970135Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.6719","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2baaa7c76581f03d703001a225559889541495836faf23b0a864e3622b6b803b","sha256:de45caeffeac69c34e69901be040e38145db5d656d288209fbde8d62d9f794c2"],"state_sha256":"a0d9d6f452c41765e901910b12d0b7cec4d7d21927f319edaec7ef6e7dff4275"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wNcL3liEm39rfZq10J4qUkEoN4ZYbomNPPG7l8KXdzXpcZjJi52p4Qn+sUWFaZUOp16vnrs5xFFKFDudwrSwDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T23:00:28.391881Z","bundle_sha256":"1b95ef1916e771ba17935d8e71ef18beb0e271d210d4a54d2b86dc2661844157"}}