{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:HY7TTIIHTO5CEXBW4WLOLZOIRV","short_pith_number":"pith:HY7TTIIH","canonical_record":{"source":{"id":"1210.7399","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-28T04:31:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0c2ccd40e2d4461ce1a3d26b9db248f6b5d9bc00bb71607893b5e3e150a34bd5","abstract_canon_sha256":"d41c6e7966667beb4d9dce731bbdfb2c5b4de5a132b8a941f902efecb8ea2d19"},"schema_version":"1.0"},"canonical_sha256":"3e3f39a1079bba225c36e596e5e5c88d6867e7e1ccdbf81aeb61aa6b59bf2742","source":{"kind":"arxiv","id":"1210.7399","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.7399","created_at":"2026-05-18T03:42:10Z"},{"alias_kind":"arxiv_version","alias_value":"1210.7399v1","created_at":"2026-05-18T03:42:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.7399","created_at":"2026-05-18T03:42:10Z"},{"alias_kind":"pith_short_12","alias_value":"HY7TTIIHTO5C","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"HY7TTIIHTO5CEXBW","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"HY7TTIIH","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:HY7TTIIHTO5CEXBW4WLOLZOIRV","target":"record","payload":{"canonical_record":{"source":{"id":"1210.7399","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-28T04:31:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0c2ccd40e2d4461ce1a3d26b9db248f6b5d9bc00bb71607893b5e3e150a34bd5","abstract_canon_sha256":"d41c6e7966667beb4d9dce731bbdfb2c5b4de5a132b8a941f902efecb8ea2d19"},"schema_version":"1.0"},"canonical_sha256":"3e3f39a1079bba225c36e596e5e5c88d6867e7e1ccdbf81aeb61aa6b59bf2742","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:10.155531Z","signature_b64":"Q/FoWFKFZFdogaQHoJ/HRxsGNuG8SrukStexFmRFtitnXCGcw8pQpDYJHF8CYNgQ1IaHp1DnfqNw9oxlpdaTBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e3f39a1079bba225c36e596e5e5c88d6867e7e1ccdbf81aeb61aa6b59bf2742","last_reissued_at":"2026-05-18T03:42:10.154763Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:10.154763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.7399","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:42:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g+/B5PRaL5Znx4kzYu7LaxG813JUoux4FHH6wRASR8pGa6zzKyIS//XwWINciM9WSfb2iHHPMz4cnv0Gl5/CAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T08:13:43.784091Z"},"content_sha256":"721086d77ad04cfa1484e749b2e765cadde9598d50201d8c182dc6d07c8cc7e8","schema_version":"1.0","event_id":"sha256:721086d77ad04cfa1484e749b2e765cadde9598d50201d8c182dc6d07c8cc7e8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:HY7TTIIHTO5CEXBW4WLOLZOIRV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"One-Step Quantized Network Coding for Near Sparse Gaussian 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-10-28T04:31:36Z","abstract_excerpt":"In this paper, mathematical bases for non-adaptive joint source network coding of correlated messages in a Bayesian scenario are studied. Specifically, we introduce one-step Quantized Network Coding (QNC), which is a hybrid combination of network coding and packet forwarding for transmission. Motivated by the work on Bayesian compressed sensing, we derive theoretical guarantees on robust recovery in a one-step QNC scenario. Our mathematical derivations for Gaussian messages express the opportunity of distributed compression by using one-step QNC, as a simplified version of QNC scenario. Our si"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.7399","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:42:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4xX8rronemYhTyv64IavICxm3mCep3+gkvcAabbGE4qS5OJOgmylvp1jXa6TyAlh8MVRgT0CKy0ArkgdifKkCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T08:13:43.784474Z"},"content_sha256":"e3646f8595d527a2bd005da35aa84686cb767bc39731f928a16efa09edd078d3","schema_version":"1.0","event_id":"sha256:e3646f8595d527a2bd005da35aa84686cb767bc39731f928a16efa09edd078d3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HY7TTIIHTO5CEXBW4WLOLZOIRV/bundle.json","state_url":"https://pith.science/pith/HY7TTIIHTO5CEXBW4WLOLZOIRV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HY7TTIIHTO5CEXBW4WLOLZOIRV/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-12T08:13:43Z","links":{"resolver":"https://pith.science/pith/HY7TTIIHTO5CEXBW4WLOLZOIRV","bundle":"https://pith.science/pith/HY7TTIIHTO5CEXBW4WLOLZOIRV/bundle.json","state":"https://pith.science/pith/HY7TTIIHTO5CEXBW4WLOLZOIRV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HY7TTIIHTO5CEXBW4WLOLZOIRV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:HY7TTIIHTO5CEXBW4WLOLZOIRV","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":"d41c6e7966667beb4d9dce731bbdfb2c5b4de5a132b8a941f902efecb8ea2d19","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-28T04:31:36Z","title_canon_sha256":"0c2ccd40e2d4461ce1a3d26b9db248f6b5d9bc00bb71607893b5e3e150a34bd5"},"schema_version":"1.0","source":{"id":"1210.7399","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.7399","created_at":"2026-05-18T03:42:10Z"},{"alias_kind":"arxiv_version","alias_value":"1210.7399v1","created_at":"2026-05-18T03:42:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.7399","created_at":"2026-05-18T03:42:10Z"},{"alias_kind":"pith_short_12","alias_value":"HY7TTIIHTO5C","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"HY7TTIIHTO5CEXBW","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"HY7TTIIH","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:e3646f8595d527a2bd005da35aa84686cb767bc39731f928a16efa09edd078d3","target":"graph","created_at":"2026-05-18T03:42:10Z","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, mathematical bases for non-adaptive joint source network coding of correlated messages in a Bayesian scenario are studied. Specifically, we introduce one-step Quantized Network Coding (QNC), which is a hybrid combination of network coding and packet forwarding for transmission. Motivated by the work on Bayesian compressed sensing, we derive theoretical guarantees on robust recovery in a one-step QNC scenario. Our mathematical derivations for Gaussian messages express the opportunity of distributed compression by using one-step QNC, as a simplified version of QNC scenario. Our si","authors_text":"Fabrice Labeau, Mahdy Nabaee","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-28T04:31:36Z","title":"One-Step Quantized Network Coding for Near Sparse Gaussian Messages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.7399","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:721086d77ad04cfa1484e749b2e765cadde9598d50201d8c182dc6d07c8cc7e8","target":"record","created_at":"2026-05-18T03:42:10Z","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":"d41c6e7966667beb4d9dce731bbdfb2c5b4de5a132b8a941f902efecb8ea2d19","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-28T04:31:36Z","title_canon_sha256":"0c2ccd40e2d4461ce1a3d26b9db248f6b5d9bc00bb71607893b5e3e150a34bd5"},"schema_version":"1.0","source":{"id":"1210.7399","kind":"arxiv","version":1}},"canonical_sha256":"3e3f39a1079bba225c36e596e5e5c88d6867e7e1ccdbf81aeb61aa6b59bf2742","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e3f39a1079bba225c36e596e5e5c88d6867e7e1ccdbf81aeb61aa6b59bf2742","first_computed_at":"2026-05-18T03:42:10.154763Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:42:10.154763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q/FoWFKFZFdogaQHoJ/HRxsGNuG8SrukStexFmRFtitnXCGcw8pQpDYJHF8CYNgQ1IaHp1DnfqNw9oxlpdaTBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:42:10.155531Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.7399","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:721086d77ad04cfa1484e749b2e765cadde9598d50201d8c182dc6d07c8cc7e8","sha256:e3646f8595d527a2bd005da35aa84686cb767bc39731f928a16efa09edd078d3"],"state_sha256":"a26802a5b29953b9abab9f1d0714ee6eda033807ed639eea90e589d7449beec0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UO8EBWKtqV5tgks9xSKwRbpRuf6as96ICFt1tMlgRPTtAWLGumCbWBgoWhxyjsQ5naXm6mYhYREzacejxQiJBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T08:13:43.786753Z","bundle_sha256":"a7b30c1906fae213add0ecefd7c15e4f7cf50ad4c97eb778c0e8e780b7902212"}}