{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:HQAKV5AEVTMWIXTPJ6VIHEEEFY","short_pith_number":"pith:HQAKV5AE","canonical_record":{"source":{"id":"1407.4527","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-07-16T23:24:41Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"d7961bb3e3d1c47146e86e4c5b69a49ea66dd53f642272e200c63955da8eb993","abstract_canon_sha256":"75fad601678949298e2916b7b64fb35c42d247f79476a690b79b8ac7b6e694e8"},"schema_version":"1.0"},"canonical_sha256":"3c00aaf404acd9645e6f4faa8390842e283c15825eb4ae494834f8db884ece90","source":{"kind":"arxiv","id":"1407.4527","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.4527","created_at":"2026-05-18T02:43:08Z"},{"alias_kind":"arxiv_version","alias_value":"1407.4527v3","created_at":"2026-05-18T02:43:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4527","created_at":"2026-05-18T02:43:08Z"},{"alias_kind":"pith_short_12","alias_value":"HQAKV5AEVTMW","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HQAKV5AEVTMWIXTP","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HQAKV5AE","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:HQAKV5AEVTMWIXTPJ6VIHEEEFY","target":"record","payload":{"canonical_record":{"source":{"id":"1407.4527","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-07-16T23:24:41Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"d7961bb3e3d1c47146e86e4c5b69a49ea66dd53f642272e200c63955da8eb993","abstract_canon_sha256":"75fad601678949298e2916b7b64fb35c42d247f79476a690b79b8ac7b6e694e8"},"schema_version":"1.0"},"canonical_sha256":"3c00aaf404acd9645e6f4faa8390842e283c15825eb4ae494834f8db884ece90","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:08.963212Z","signature_b64":"89fqz11xA9B82k8+tlaL5cdo1LH5woLNvpIdCZNGapOOfMYU2FfRJozncVaD4KHH8bkeBObeBb7FQWbEmxmDDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c00aaf404acd9645e6f4faa8390842e283c15825eb4ae494834f8db884ece90","last_reissued_at":"2026-05-18T02:43:08.962743Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:08.962743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.4527","source_version":3,"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-18T02:43:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DB5JXiT1JpTZ0iZsqrq3h572HAqI1GXQNYMO1FpfDogWUDWfArbUOpvuHDywfe288RqFGsuSUoDey9tWCvskDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T17:57:15.449438Z"},"content_sha256":"2faea58d6b8d2d763528b407e043f519edd6d954632675e444ef8eb086935e83","schema_version":"1.0","event_id":"sha256:2faea58d6b8d2d763528b407e043f519edd6d954632675e444ef8eb086935e83"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:HQAKV5AEVTMWIXTPJ6VIHEEEFY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Structural and Optimization Properties for Joint Selection of Source Rates and Network Flow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Bradford D. Boyle, Steven Weber","submitted_at":"2014-07-16T23:24:41Z","abstract_excerpt":"We consider the optimal transmission of distributed correlated discrete memoryless sources across a network with capacity constraints. We present several previously undiscussed structural properties of the set of feasible rates and transmission schemes. We extend previous results concerning the intersection of polymatroids and contrapolymatroids to characterize when all of the vertices of the Slepian-Wolf rate region are feasible for the capacity constrained network. An explicit relationship between the conditional independence relationships of the distributed sources and the number of vertice"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.4527","kind":"arxiv","version":3},"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-18T02:43:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Aw489PBnJXtqWP2yrTiE6OZQgoDggDPfqmQz7iL7CJyEmy3Jj/0h8j8D/+55nXeh2ubQoMBvthoZbTI6RojVBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T17:57:15.449778Z"},"content_sha256":"df1bba6e60f3b098419ee1abb1886bd92fd1b636af580d35990e88c467e679df","schema_version":"1.0","event_id":"sha256:df1bba6e60f3b098419ee1abb1886bd92fd1b636af580d35990e88c467e679df"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HQAKV5AEVTMWIXTPJ6VIHEEEFY/bundle.json","state_url":"https://pith.science/pith/HQAKV5AEVTMWIXTPJ6VIHEEEFY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HQAKV5AEVTMWIXTPJ6VIHEEEFY/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-27T17:57:15Z","links":{"resolver":"https://pith.science/pith/HQAKV5AEVTMWIXTPJ6VIHEEEFY","bundle":"https://pith.science/pith/HQAKV5AEVTMWIXTPJ6VIHEEEFY/bundle.json","state":"https://pith.science/pith/HQAKV5AEVTMWIXTPJ6VIHEEEFY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HQAKV5AEVTMWIXTPJ6VIHEEEFY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:HQAKV5AEVTMWIXTPJ6VIHEEEFY","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":"75fad601678949298e2916b7b64fb35c42d247f79476a690b79b8ac7b6e694e8","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-07-16T23:24:41Z","title_canon_sha256":"d7961bb3e3d1c47146e86e4c5b69a49ea66dd53f642272e200c63955da8eb993"},"schema_version":"1.0","source":{"id":"1407.4527","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.4527","created_at":"2026-05-18T02:43:08Z"},{"alias_kind":"arxiv_version","alias_value":"1407.4527v3","created_at":"2026-05-18T02:43:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4527","created_at":"2026-05-18T02:43:08Z"},{"alias_kind":"pith_short_12","alias_value":"HQAKV5AEVTMW","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HQAKV5AEVTMWIXTP","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HQAKV5AE","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:df1bba6e60f3b098419ee1abb1886bd92fd1b636af580d35990e88c467e679df","target":"graph","created_at":"2026-05-18T02:43:08Z","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":"We consider the optimal transmission of distributed correlated discrete memoryless sources across a network with capacity constraints. We present several previously undiscussed structural properties of the set of feasible rates and transmission schemes. We extend previous results concerning the intersection of polymatroids and contrapolymatroids to characterize when all of the vertices of the Slepian-Wolf rate region are feasible for the capacity constrained network. An explicit relationship between the conditional independence relationships of the distributed sources and the number of vertice","authors_text":"Bradford D. Boyle, Steven Weber","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-07-16T23:24:41Z","title":"Structural and Optimization Properties for Joint Selection of Source Rates and Network Flow"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.4527","kind":"arxiv","version":3},"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:2faea58d6b8d2d763528b407e043f519edd6d954632675e444ef8eb086935e83","target":"record","created_at":"2026-05-18T02:43:08Z","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":"75fad601678949298e2916b7b64fb35c42d247f79476a690b79b8ac7b6e694e8","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-07-16T23:24:41Z","title_canon_sha256":"d7961bb3e3d1c47146e86e4c5b69a49ea66dd53f642272e200c63955da8eb993"},"schema_version":"1.0","source":{"id":"1407.4527","kind":"arxiv","version":3}},"canonical_sha256":"3c00aaf404acd9645e6f4faa8390842e283c15825eb4ae494834f8db884ece90","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3c00aaf404acd9645e6f4faa8390842e283c15825eb4ae494834f8db884ece90","first_computed_at":"2026-05-18T02:43:08.962743Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:43:08.962743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"89fqz11xA9B82k8+tlaL5cdo1LH5woLNvpIdCZNGapOOfMYU2FfRJozncVaD4KHH8bkeBObeBb7FQWbEmxmDDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:43:08.963212Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.4527","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2faea58d6b8d2d763528b407e043f519edd6d954632675e444ef8eb086935e83","sha256:df1bba6e60f3b098419ee1abb1886bd92fd1b636af580d35990e88c467e679df"],"state_sha256":"8856d0bf92457401e820bc2e64442f306ae502c0fa26dca17f70a98efd67d761"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qe+NGqeY92HzoYDMW2hyCRhbHwdFTJY3+X0ajPhT0XDQy8hNr+ZVEo/Qw+04cqHOvoEvbNAKktmhH8N6l9IhAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T17:57:15.451617Z","bundle_sha256":"b3017a817db750118c0e44d10d04f98d735ed53cee1f6236934d4c0635fa1e02"}}