{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:M6AMZNICOG2XVMYBTBBJDVLYHG","short_pith_number":"pith:M6AMZNIC","canonical_record":{"source":{"id":"1508.03401","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-14T01:54:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a62bcb219ca37f31e07f99cff8471a6cd46259bf8dcc89ff25455e39f2b3d995","abstract_canon_sha256":"8301085d71f9ce1a22ec635c5b18afed9569f87ebb11fd95870aa8836fdfd77e"},"schema_version":"1.0"},"canonical_sha256":"6780ccb50271b57ab301984291d578398392b764f280a72bbb64a55f698b74f8","source":{"kind":"arxiv","id":"1508.03401","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.03401","created_at":"2026-05-18T00:10:57Z"},{"alias_kind":"arxiv_version","alias_value":"1508.03401v1","created_at":"2026-05-18T00:10:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03401","created_at":"2026-05-18T00:10:57Z"},{"alias_kind":"pith_short_12","alias_value":"M6AMZNICOG2X","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"M6AMZNICOG2XVMYB","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"M6AMZNIC","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:M6AMZNICOG2XVMYBTBBJDVLYHG","target":"record","payload":{"canonical_record":{"source":{"id":"1508.03401","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-14T01:54:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a62bcb219ca37f31e07f99cff8471a6cd46259bf8dcc89ff25455e39f2b3d995","abstract_canon_sha256":"8301085d71f9ce1a22ec635c5b18afed9569f87ebb11fd95870aa8836fdfd77e"},"schema_version":"1.0"},"canonical_sha256":"6780ccb50271b57ab301984291d578398392b764f280a72bbb64a55f698b74f8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:57.451348Z","signature_b64":"/ybIAb1E+664R1yXWXXdM8fLaHqNBefmIpQSdu6APZPj+xy5rdSFXbEUDmNBh05tJJahJ43JRuSGr68Ue9vGBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6780ccb50271b57ab301984291d578398392b764f280a72bbb64a55f698b74f8","last_reissued_at":"2026-05-18T00:10:57.450467Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:57.450467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.03401","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:10:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3v3mIghcVwl4mCMC5puGzWPOxaESczBAviN/m85ab4fUQIWk/6lhzPmLGPc970BVdWy7Z4fchsUPMTXhXIkfDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:35:28.868733Z"},"content_sha256":"f87bbbd0a084f5c7b738146193debdfac41152e4247df28c802568fa24bfb1b9","schema_version":"1.0","event_id":"sha256:f87bbbd0a084f5c7b738146193debdfac41152e4247df28c802568fa24bfb1b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:M6AMZNICOG2XVMYBTBBJDVLYHG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Binary Compressive Sensing via Analog Fountain Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Branka Vucetic, Jinhong Yuan, Mahyar Shirvanimoghaddam, Yonghui Li","submitted_at":"2015-08-14T01:54:40Z","abstract_excerpt":"In this paper, a compressive sensing (CS) approach is proposed for sparse binary signals' compression and reconstruction based on analog fountain codes (AFCs). In the proposed scheme, referred to as the analog fountain compressive sensing (AFCS), each measurement is generated from a linear combination of L randomly selected binary signal elements with real weight coefficients. The weight coefficients are chosen from a finite weight set and L, called measurement degree, is obtained based on a predefined degree distribution function. We propose a simple verification based reconstruction algorith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03401","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:10:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4G48VSs4AtQkbhhj4GWR23/Lw3sDti7Zyuftru2NlSWardFE/RSDZ5t/4/f1pk8f80in3xZYMR++JJHxYFe9DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:35:28.869241Z"},"content_sha256":"5169d59d7d4294a4fdb7e66a9aa3c9d1f27c178e797361d142af691d419eb0bb","schema_version":"1.0","event_id":"sha256:5169d59d7d4294a4fdb7e66a9aa3c9d1f27c178e797361d142af691d419eb0bb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M6AMZNICOG2XVMYBTBBJDVLYHG/bundle.json","state_url":"https://pith.science/pith/M6AMZNICOG2XVMYBTBBJDVLYHG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M6AMZNICOG2XVMYBTBBJDVLYHG/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-25T19:35:28Z","links":{"resolver":"https://pith.science/pith/M6AMZNICOG2XVMYBTBBJDVLYHG","bundle":"https://pith.science/pith/M6AMZNICOG2XVMYBTBBJDVLYHG/bundle.json","state":"https://pith.science/pith/M6AMZNICOG2XVMYBTBBJDVLYHG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M6AMZNICOG2XVMYBTBBJDVLYHG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:M6AMZNICOG2XVMYBTBBJDVLYHG","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":"8301085d71f9ce1a22ec635c5b18afed9569f87ebb11fd95870aa8836fdfd77e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-14T01:54:40Z","title_canon_sha256":"a62bcb219ca37f31e07f99cff8471a6cd46259bf8dcc89ff25455e39f2b3d995"},"schema_version":"1.0","source":{"id":"1508.03401","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.03401","created_at":"2026-05-18T00:10:57Z"},{"alias_kind":"arxiv_version","alias_value":"1508.03401v1","created_at":"2026-05-18T00:10:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03401","created_at":"2026-05-18T00:10:57Z"},{"alias_kind":"pith_short_12","alias_value":"M6AMZNICOG2X","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"M6AMZNICOG2XVMYB","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"M6AMZNIC","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:5169d59d7d4294a4fdb7e66a9aa3c9d1f27c178e797361d142af691d419eb0bb","target":"graph","created_at":"2026-05-18T00:10:57Z","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, a compressive sensing (CS) approach is proposed for sparse binary signals' compression and reconstruction based on analog fountain codes (AFCs). In the proposed scheme, referred to as the analog fountain compressive sensing (AFCS), each measurement is generated from a linear combination of L randomly selected binary signal elements with real weight coefficients. The weight coefficients are chosen from a finite weight set and L, called measurement degree, is obtained based on a predefined degree distribution function. We propose a simple verification based reconstruction algorith","authors_text":"Branka Vucetic, Jinhong Yuan, Mahyar Shirvanimoghaddam, Yonghui Li","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-14T01:54:40Z","title":"Binary Compressive Sensing via Analog Fountain Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03401","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:f87bbbd0a084f5c7b738146193debdfac41152e4247df28c802568fa24bfb1b9","target":"record","created_at":"2026-05-18T00:10:57Z","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":"8301085d71f9ce1a22ec635c5b18afed9569f87ebb11fd95870aa8836fdfd77e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-14T01:54:40Z","title_canon_sha256":"a62bcb219ca37f31e07f99cff8471a6cd46259bf8dcc89ff25455e39f2b3d995"},"schema_version":"1.0","source":{"id":"1508.03401","kind":"arxiv","version":1}},"canonical_sha256":"6780ccb50271b57ab301984291d578398392b764f280a72bbb64a55f698b74f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6780ccb50271b57ab301984291d578398392b764f280a72bbb64a55f698b74f8","first_computed_at":"2026-05-18T00:10:57.450467Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:57.450467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/ybIAb1E+664R1yXWXXdM8fLaHqNBefmIpQSdu6APZPj+xy5rdSFXbEUDmNBh05tJJahJ43JRuSGr68Ue9vGBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:57.451348Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.03401","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f87bbbd0a084f5c7b738146193debdfac41152e4247df28c802568fa24bfb1b9","sha256:5169d59d7d4294a4fdb7e66a9aa3c9d1f27c178e797361d142af691d419eb0bb"],"state_sha256":"a5ea574fedfa0be32334af03cf8af5adcc2ac6ed053b8177c760313c84ee99c5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"StABCIUtW6r6eBaRpfeHCTW9OU20hsYdJ36vvLecb0EZOUW8d6R8cgDOp6JRDGPQGBEoXQ0YMlg3O7QXEyvxCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:35:28.875155Z","bundle_sha256":"492f8020b977831c9344e2328cf16f0d025754ff8571a1e689a8df269deb701f"}}