{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:RAO2XAFB5ERBCBA5YKEN2G2IVY","short_pith_number":"pith:RAO2XAFB","canonical_record":{"source":{"id":"1202.0835","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-03T22:31:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c4e0cda4226a79d6570a25d6463dc26d2a5c198f3e0cc97f71f95524893a51be","abstract_canon_sha256":"3b98ef47fb02f52752cd21444eb63904a9eb96b4c67400caf1c7ebea9996a42f"},"schema_version":"1.0"},"canonical_sha256":"881dab80a1e92211041dc288dd1b48ae2af3d6aec938b54c1d49bb839eafe52f","source":{"kind":"arxiv","id":"1202.0835","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0835","created_at":"2026-05-18T04:03:06Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0835v1","created_at":"2026-05-18T04:03:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0835","created_at":"2026-05-18T04:03:06Z"},{"alias_kind":"pith_short_12","alias_value":"RAO2XAFB5ERB","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RAO2XAFB5ERBCBA5","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RAO2XAFB","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:RAO2XAFB5ERBCBA5YKEN2G2IVY","target":"record","payload":{"canonical_record":{"source":{"id":"1202.0835","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-03T22:31:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c4e0cda4226a79d6570a25d6463dc26d2a5c198f3e0cc97f71f95524893a51be","abstract_canon_sha256":"3b98ef47fb02f52752cd21444eb63904a9eb96b4c67400caf1c7ebea9996a42f"},"schema_version":"1.0"},"canonical_sha256":"881dab80a1e92211041dc288dd1b48ae2af3d6aec938b54c1d49bb839eafe52f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:06.060425Z","signature_b64":"kuuEiYsC1hpWhwCs16hySKWGFZfZvs7dufimw46f7956jJGNw3fCu/naYIv8/QZyIsZJUNV/6zjVlm16c+ioCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"881dab80a1e92211041dc288dd1b48ae2af3d6aec938b54c1d49bb839eafe52f","last_reissued_at":"2026-05-18T04:03:06.059723Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:06.059723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.0835","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-18T04:03:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"09JUd6u+mAzAxSMVgsa8Es/pd1yr1esX3mOkN7NFc86ejgLPiQXu1Uwb5cddex/LdSZWQAfKMPxMMKSjrbDoCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:17:12.857172Z"},"content_sha256":"8c315e69c90fe028c453b156b3ab30be4fe6c46f8c8c0f9b3ec0da0f9414e3bc","schema_version":"1.0","event_id":"sha256:8c315e69c90fe028c453b156b3ab30be4fe6c46f8c8c0f9b3ec0da0f9414e3bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:RAO2XAFB5ERBCBA5YKEN2G2IVY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reducibility of joint relay positioning and flow optimization problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mohit Thakur, Muriel M\\'edard, Nadia Fawaz","submitted_at":"2012-02-03T22:31:07Z","abstract_excerpt":"This paper shows how to reduce the otherwise hard joint relay positioning and flow optimization problem into a sequence a two simpler decoupled problems. We consider a class of wireless multicast hypergraphs mainly characterized by their hyperarc rate functions, that are increasing and convex in power, and decreasing in distance between the transmit node and the farthest end node of the hyperarc. The set-up consists of a single multicast flow session involving a source, multiple destinations and a relay that can be positioned freely. The first problem formulates the relay positioning problem i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0835","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-18T04:03:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/7EjBQS/XFGjzqOFcj7LAkLqmVgSVT7W7TgWO4aaX5wI/yHc7jBgN0bVm/0ltp71WkO3UD0/PAOy+TNNdvoWBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:17:12.857567Z"},"content_sha256":"716840aaec9b84103b405026dda3e8f4917e263f5fe399e83f8f1643b3aff186","schema_version":"1.0","event_id":"sha256:716840aaec9b84103b405026dda3e8f4917e263f5fe399e83f8f1643b3aff186"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RAO2XAFB5ERBCBA5YKEN2G2IVY/bundle.json","state_url":"https://pith.science/pith/RAO2XAFB5ERBCBA5YKEN2G2IVY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RAO2XAFB5ERBCBA5YKEN2G2IVY/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-30T08:17:12Z","links":{"resolver":"https://pith.science/pith/RAO2XAFB5ERBCBA5YKEN2G2IVY","bundle":"https://pith.science/pith/RAO2XAFB5ERBCBA5YKEN2G2IVY/bundle.json","state":"https://pith.science/pith/RAO2XAFB5ERBCBA5YKEN2G2IVY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RAO2XAFB5ERBCBA5YKEN2G2IVY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:RAO2XAFB5ERBCBA5YKEN2G2IVY","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":"3b98ef47fb02f52752cd21444eb63904a9eb96b4c67400caf1c7ebea9996a42f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-03T22:31:07Z","title_canon_sha256":"c4e0cda4226a79d6570a25d6463dc26d2a5c198f3e0cc97f71f95524893a51be"},"schema_version":"1.0","source":{"id":"1202.0835","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0835","created_at":"2026-05-18T04:03:06Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0835v1","created_at":"2026-05-18T04:03:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0835","created_at":"2026-05-18T04:03:06Z"},{"alias_kind":"pith_short_12","alias_value":"RAO2XAFB5ERB","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RAO2XAFB5ERBCBA5","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RAO2XAFB","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:716840aaec9b84103b405026dda3e8f4917e263f5fe399e83f8f1643b3aff186","target":"graph","created_at":"2026-05-18T04:03:06Z","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":"This paper shows how to reduce the otherwise hard joint relay positioning and flow optimization problem into a sequence a two simpler decoupled problems. We consider a class of wireless multicast hypergraphs mainly characterized by their hyperarc rate functions, that are increasing and convex in power, and decreasing in distance between the transmit node and the farthest end node of the hyperarc. The set-up consists of a single multicast flow session involving a source, multiple destinations and a relay that can be positioned freely. The first problem formulates the relay positioning problem i","authors_text":"Mohit Thakur, Muriel M\\'edard, Nadia Fawaz","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-03T22:31:07Z","title":"Reducibility of joint relay positioning and flow optimization problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0835","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:8c315e69c90fe028c453b156b3ab30be4fe6c46f8c8c0f9b3ec0da0f9414e3bc","target":"record","created_at":"2026-05-18T04:03:06Z","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":"3b98ef47fb02f52752cd21444eb63904a9eb96b4c67400caf1c7ebea9996a42f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-03T22:31:07Z","title_canon_sha256":"c4e0cda4226a79d6570a25d6463dc26d2a5c198f3e0cc97f71f95524893a51be"},"schema_version":"1.0","source":{"id":"1202.0835","kind":"arxiv","version":1}},"canonical_sha256":"881dab80a1e92211041dc288dd1b48ae2af3d6aec938b54c1d49bb839eafe52f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"881dab80a1e92211041dc288dd1b48ae2af3d6aec938b54c1d49bb839eafe52f","first_computed_at":"2026-05-18T04:03:06.059723Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:03:06.059723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kuuEiYsC1hpWhwCs16hySKWGFZfZvs7dufimw46f7956jJGNw3fCu/naYIv8/QZyIsZJUNV/6zjVlm16c+ioCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:03:06.060425Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.0835","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c315e69c90fe028c453b156b3ab30be4fe6c46f8c8c0f9b3ec0da0f9414e3bc","sha256:716840aaec9b84103b405026dda3e8f4917e263f5fe399e83f8f1643b3aff186"],"state_sha256":"b18120231e43b15fa0f6a518597b3fe9d0ff286063dfa0dab3db53c8edba0ef4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jqR6JCDDYqowzVXKOCaG+9u67gNL+OGV9Rz3y26x/P/wYMpp2GDn4sHSpnba43L+kHaZSam0N05uhrFwohVJDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:17:12.859640Z","bundle_sha256":"4938a5c7f4f50b7e3484b4a90097926f0fdeaa77efa735ded1fd8f26801949ff"}}