{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6YDOLUELE45DTLVEUIAPTUUMSR","short_pith_number":"pith:6YDOLUEL","canonical_record":{"source":{"id":"1607.01864","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-07T02:57:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"43901426cd940cb2f101fcb486deb696913141433206e0fdb3f1b7a0e2a50580","abstract_canon_sha256":"740dc877d4518e4da35adca7ac1c3867367f2b7715ff99fe4d4794f751f858c2"},"schema_version":"1.0"},"canonical_sha256":"f606e5d08b273a39aea4a200f9d28c945a00977f30b1b77cf6f210832ab70d20","source":{"kind":"arxiv","id":"1607.01864","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.01864","created_at":"2026-05-18T01:11:23Z"},{"alias_kind":"arxiv_version","alias_value":"1607.01864v1","created_at":"2026-05-18T01:11:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01864","created_at":"2026-05-18T01:11:23Z"},{"alias_kind":"pith_short_12","alias_value":"6YDOLUELE45D","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"6YDOLUELE45DTLVE","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"6YDOLUEL","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6YDOLUELE45DTLVEUIAPTUUMSR","target":"record","payload":{"canonical_record":{"source":{"id":"1607.01864","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-07T02:57:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"43901426cd940cb2f101fcb486deb696913141433206e0fdb3f1b7a0e2a50580","abstract_canon_sha256":"740dc877d4518e4da35adca7ac1c3867367f2b7715ff99fe4d4794f751f858c2"},"schema_version":"1.0"},"canonical_sha256":"f606e5d08b273a39aea4a200f9d28c945a00977f30b1b77cf6f210832ab70d20","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:23.119280Z","signature_b64":"IW4yyD1h/T33PRq6EEjxOygcPpthsmV585bPDcJSjSZctRDdhzber+mUu8ModZTO603l4mDK/a35HenTYStJBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f606e5d08b273a39aea4a200f9d28c945a00977f30b1b77cf6f210832ab70d20","last_reissued_at":"2026-05-18T01:11:23.118831Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:23.118831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.01864","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-18T01:11:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"adv+0wEahoLmi2gc24Olpqkovr0nLogEw9f3jhS8qImTUa/mW+Kc5NSbe8KMWnocD7Rvn43kzT3ROH/dyXBWBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:31:12.979689Z"},"content_sha256":"bbf66ab457f73f050f81237b762daf487520c810ee2c3e9e18c85065c5457b30","schema_version":"1.0","event_id":"sha256:bbf66ab457f73f050f81237b762daf487520c810ee2c3e9e18c85065c5457b30"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6YDOLUELE45DTLVEUIAPTUUMSR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Quadratic Programming Relaxation Approach to Compute-and-Forward Network Coding Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Baojian Zhou, Jinming Wen, Wai Ho Mow","submitted_at":"2016-07-07T02:57:41Z","abstract_excerpt":"Using physical layer network coding, compute-and-forward is a promising relaying scheme that effectively exploits the interference between users and thus achieves high rates. In this paper, we consider the problem of finding the optimal integer-valued coefficient vector for a relay in the compute-and-forward scheme to maximize the computation rate at that relay. Although this problem turns out to be a shortest vector problem, which is suspected to be NP-hard, we show that it can be relaxed to a series of equality-constrained quadratic programmings. The solutions of the relaxed problems serve a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.01864","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-18T01:11:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9dJx58+yCi/a9RetbZDDX+SUocgqaBKMR7zD4H9UNzGOmv2F5sgT0uUifjRyC2dm9/wv+QxYSYV6Mp6kKm97AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:31:12.980045Z"},"content_sha256":"87789666eeff6e1c452f2ee57e0c5c75700d0296614378ba9d3831d569da3b2a","schema_version":"1.0","event_id":"sha256:87789666eeff6e1c452f2ee57e0c5c75700d0296614378ba9d3831d569da3b2a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6YDOLUELE45DTLVEUIAPTUUMSR/bundle.json","state_url":"https://pith.science/pith/6YDOLUELE45DTLVEUIAPTUUMSR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6YDOLUELE45DTLVEUIAPTUUMSR/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-02T07:31:12Z","links":{"resolver":"https://pith.science/pith/6YDOLUELE45DTLVEUIAPTUUMSR","bundle":"https://pith.science/pith/6YDOLUELE45DTLVEUIAPTUUMSR/bundle.json","state":"https://pith.science/pith/6YDOLUELE45DTLVEUIAPTUUMSR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6YDOLUELE45DTLVEUIAPTUUMSR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6YDOLUELE45DTLVEUIAPTUUMSR","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":"740dc877d4518e4da35adca7ac1c3867367f2b7715ff99fe4d4794f751f858c2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-07T02:57:41Z","title_canon_sha256":"43901426cd940cb2f101fcb486deb696913141433206e0fdb3f1b7a0e2a50580"},"schema_version":"1.0","source":{"id":"1607.01864","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.01864","created_at":"2026-05-18T01:11:23Z"},{"alias_kind":"arxiv_version","alias_value":"1607.01864v1","created_at":"2026-05-18T01:11:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01864","created_at":"2026-05-18T01:11:23Z"},{"alias_kind":"pith_short_12","alias_value":"6YDOLUELE45D","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"6YDOLUELE45DTLVE","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"6YDOLUEL","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:87789666eeff6e1c452f2ee57e0c5c75700d0296614378ba9d3831d569da3b2a","target":"graph","created_at":"2026-05-18T01:11:23Z","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":"Using physical layer network coding, compute-and-forward is a promising relaying scheme that effectively exploits the interference between users and thus achieves high rates. In this paper, we consider the problem of finding the optimal integer-valued coefficient vector for a relay in the compute-and-forward scheme to maximize the computation rate at that relay. Although this problem turns out to be a shortest vector problem, which is suspected to be NP-hard, we show that it can be relaxed to a series of equality-constrained quadratic programmings. The solutions of the relaxed problems serve a","authors_text":"Baojian Zhou, Jinming Wen, Wai Ho Mow","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-07T02:57:41Z","title":"A Quadratic Programming Relaxation Approach to Compute-and-Forward Network Coding Design"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.01864","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:bbf66ab457f73f050f81237b762daf487520c810ee2c3e9e18c85065c5457b30","target":"record","created_at":"2026-05-18T01:11:23Z","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":"740dc877d4518e4da35adca7ac1c3867367f2b7715ff99fe4d4794f751f858c2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-07T02:57:41Z","title_canon_sha256":"43901426cd940cb2f101fcb486deb696913141433206e0fdb3f1b7a0e2a50580"},"schema_version":"1.0","source":{"id":"1607.01864","kind":"arxiv","version":1}},"canonical_sha256":"f606e5d08b273a39aea4a200f9d28c945a00977f30b1b77cf6f210832ab70d20","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f606e5d08b273a39aea4a200f9d28c945a00977f30b1b77cf6f210832ab70d20","first_computed_at":"2026-05-18T01:11:23.118831Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:23.118831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IW4yyD1h/T33PRq6EEjxOygcPpthsmV585bPDcJSjSZctRDdhzber+mUu8ModZTO603l4mDK/a35HenTYStJBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:23.119280Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.01864","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bbf66ab457f73f050f81237b762daf487520c810ee2c3e9e18c85065c5457b30","sha256:87789666eeff6e1c452f2ee57e0c5c75700d0296614378ba9d3831d569da3b2a"],"state_sha256":"d39fb62d3ad1fe920f170abffad37306b5c23adf4ca6974bd94f785239fac41e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4esmNLBY5YzN1bet78hkF9O5zoIhrk/UH0dL9xPBLg28im432xHB/18G8sU9yzb4AWB5K+NddcQ0Wd6GGGH2DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T07:31:12.982668Z","bundle_sha256":"0081b11efc6cc1a3310c5cee4cefa40501efc97b1d4061e8bcb9009f0bdce1ae"}}