{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:42GOY2QH4J7QKOXI2R7MT3USJY","short_pith_number":"pith:42GOY2QH","schema_version":"1.0","canonical_sha256":"e68cec6a07e27f053ae8d47ec9ee924e015a6f138de1c2a58752eea13c53d9e9","source":{"kind":"arxiv","id":"1203.1892","version":2},"attestation_state":"computed","paper":{"title":"Restricted Isometry Property in Quantized Network Coding of Sparse Messages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fabrice Labeau, Mahdy Nabaee","submitted_at":"2012-03-08T19:23:23Z","abstract_excerpt":"In this paper, we study joint network coding and distributed source coding of inter-node dependent messages, with the perspective of compressed sensing. Specifically, the theoretical guarantees for robust $\\ell_1$-min recovery of an under-determined set of linear network coded sparse messages are investigated. We discuss the guarantees for $\\ell_1$-min decoding of quantized network coded messages, using the proposed local network coding coefficients in \\cite{naba}, based on Restricted Isometry Property (RIP) of the resulting measurement matrix. Moreover, the relation between tail probability o"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1203.1892","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-08T19:23:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"928fd4845a15cb8a7441a91dd0759448c58584ac9fb67a15d93e4a6824c773e1","abstract_canon_sha256":"e66afede5185fcd440739ffe22309f697a1556dc613f983cb9810223e3500f9e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:02.500758Z","signature_b64":"3bddMVJU+xnv5IjzfqazG733GvbK05DatuVYb2Zpv2JQlaNjBHXZbEAcc5SRztz2xZ88fzrh/DScqtjcQ+UaDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e68cec6a07e27f053ae8d47ec9ee924e015a6f138de1c2a58752eea13c53d9e9","last_reissued_at":"2026-05-18T04:00:02.500102Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:02.500102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Restricted Isometry Property in Quantized Network Coding of Sparse Messages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fabrice Labeau, Mahdy Nabaee","submitted_at":"2012-03-08T19:23:23Z","abstract_excerpt":"In this paper, we study joint network coding and distributed source coding of inter-node dependent messages, with the perspective of compressed sensing. Specifically, the theoretical guarantees for robust $\\ell_1$-min recovery of an under-determined set of linear network coded sparse messages are investigated. We discuss the guarantees for $\\ell_1$-min decoding of quantized network coded messages, using the proposed local network coding coefficients in \\cite{naba}, based on Restricted Isometry Property (RIP) of the resulting measurement matrix. Moreover, the relation between tail probability o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.1892","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1203.1892","created_at":"2026-05-18T04:00:02.500201+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.1892v2","created_at":"2026-05-18T04:00:02.500201+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.1892","created_at":"2026-05-18T04:00:02.500201+00:00"},{"alias_kind":"pith_short_12","alias_value":"42GOY2QH4J7Q","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"42GOY2QH4J7QKOXI","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"42GOY2QH","created_at":"2026-05-18T12:26:53.410803+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/42GOY2QH4J7QKOXI2R7MT3USJY","json":"https://pith.science/pith/42GOY2QH4J7QKOXI2R7MT3USJY.json","graph_json":"https://pith.science/api/pith-number/42GOY2QH4J7QKOXI2R7MT3USJY/graph.json","events_json":"https://pith.science/api/pith-number/42GOY2QH4J7QKOXI2R7MT3USJY/events.json","paper":"https://pith.science/paper/42GOY2QH"},"agent_actions":{"view_html":"https://pith.science/pith/42GOY2QH4J7QKOXI2R7MT3USJY","download_json":"https://pith.science/pith/42GOY2QH4J7QKOXI2R7MT3USJY.json","view_paper":"https://pith.science/paper/42GOY2QH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.1892&json=true","fetch_graph":"https://pith.science/api/pith-number/42GOY2QH4J7QKOXI2R7MT3USJY/graph.json","fetch_events":"https://pith.science/api/pith-number/42GOY2QH4J7QKOXI2R7MT3USJY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/42GOY2QH4J7QKOXI2R7MT3USJY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/42GOY2QH4J7QKOXI2R7MT3USJY/action/storage_attestation","attest_author":"https://pith.science/pith/42GOY2QH4J7QKOXI2R7MT3USJY/action/author_attestation","sign_citation":"https://pith.science/pith/42GOY2QH4J7QKOXI2R7MT3USJY/action/citation_signature","submit_replication":"https://pith.science/pith/42GOY2QH4J7QKOXI2R7MT3USJY/action/replication_record"}},"created_at":"2026-05-18T04:00:02.500201+00:00","updated_at":"2026-05-18T04:00:02.500201+00:00"}