{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:5L3CN3TE2DCARGGV6YMSX2M2H6","short_pith_number":"pith:5L3CN3TE","canonical_record":{"source":{"id":"1103.0361","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-02T07:43:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"38c899ebd6a5195bd7b92cf33c677863b8f02826032b809d1b52cef217912eb6","abstract_canon_sha256":"712797e541a33f8414ca27caeabaf5d7e9bb5cec91d4f8aff4e043b309df4bdd"},"schema_version":"1.0"},"canonical_sha256":"eaf626ee64d0c40898d5f6192be99a3fb6c8ba14d177469432bcd4edcef4a72d","source":{"kind":"arxiv","id":"1103.0361","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.0361","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"arxiv_version","alias_value":"1103.0361v2","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.0361","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"pith_short_12","alias_value":"5L3CN3TE2DCA","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"5L3CN3TE2DCARGGV","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"5L3CN3TE","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:5L3CN3TE2DCARGGV6YMSX2M2H6","target":"record","payload":{"canonical_record":{"source":{"id":"1103.0361","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-02T07:43:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"38c899ebd6a5195bd7b92cf33c677863b8f02826032b809d1b52cef217912eb6","abstract_canon_sha256":"712797e541a33f8414ca27caeabaf5d7e9bb5cec91d4f8aff4e043b309df4bdd"},"schema_version":"1.0"},"canonical_sha256":"eaf626ee64d0c40898d5f6192be99a3fb6c8ba14d177469432bcd4edcef4a72d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:43.616890Z","signature_b64":"50tjzAgDBHD+dCVPWCVB3z1N/nw0mo25AfvMqx0enmuoFTeYfct+V9W1yORzEavDgP05Bis1Da3IaDWPGlZbAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eaf626ee64d0c40898d5f6192be99a3fb6c8ba14d177469432bcd4edcef4a72d","last_reissued_at":"2026-05-18T00:58:43.616400Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:43.616400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.0361","source_version":2,"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-18T00:58:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7PSw5YblAM0bYGx8c72VnWyuXVz4Fyfo6MbIIhd+iRW+IlAauImZ0SyOWSjUpqMNCtlYr86HrNl3+9UQAdjODQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:23:55.524481Z"},"content_sha256":"d40b02d4537844f34e5f4909cfb5ac036e2d9c411d6cc91755f370ca7a67f556","schema_version":"1.0","event_id":"sha256:d40b02d4537844f34e5f4909cfb5ac036e2d9c411d6cc91755f370ca7a67f556"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:5L3CN3TE2DCARGGV6YMSX2M2H6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing Bounds on Network Capacity Regions as a Polytope Reconstruction Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anthony Kim, Muriel Medard","submitted_at":"2011-03-02T07:43:56Z","abstract_excerpt":"We define a notion of network capacity region of networks that generalizes the notion of network capacity defined by Cannons et al. and prove its notable properties such as closedness, boundedness and convexity when the finite field is fixed. We show that the network routing capacity region is a computable rational polytope and provide exact algorithms and approximation heuristics for computing the region. We define the semi-network linear coding capacity region, with respect to a fixed finite field, that inner bounds the corresponding network linear coding capacity region, show that it is a c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.0361","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"},"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-18T00:58:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OBFXgsUvOVpGKPqd60DdsDibfmPAxq0VaADBDtrRNkuHKpCrkjagyV3fNdfEcU28Assw2j6WSvp/+wePkArQDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:23:55.525090Z"},"content_sha256":"f42f96b0a26ba707d0fae4271d3aa42e36d091d2dc10c5d7fb6a44a55259540b","schema_version":"1.0","event_id":"sha256:f42f96b0a26ba707d0fae4271d3aa42e36d091d2dc10c5d7fb6a44a55259540b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5L3CN3TE2DCARGGV6YMSX2M2H6/bundle.json","state_url":"https://pith.science/pith/5L3CN3TE2DCARGGV6YMSX2M2H6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5L3CN3TE2DCARGGV6YMSX2M2H6/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-25T18:23:55Z","links":{"resolver":"https://pith.science/pith/5L3CN3TE2DCARGGV6YMSX2M2H6","bundle":"https://pith.science/pith/5L3CN3TE2DCARGGV6YMSX2M2H6/bundle.json","state":"https://pith.science/pith/5L3CN3TE2DCARGGV6YMSX2M2H6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5L3CN3TE2DCARGGV6YMSX2M2H6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:5L3CN3TE2DCARGGV6YMSX2M2H6","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":"712797e541a33f8414ca27caeabaf5d7e9bb5cec91d4f8aff4e043b309df4bdd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-02T07:43:56Z","title_canon_sha256":"38c899ebd6a5195bd7b92cf33c677863b8f02826032b809d1b52cef217912eb6"},"schema_version":"1.0","source":{"id":"1103.0361","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.0361","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"arxiv_version","alias_value":"1103.0361v2","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.0361","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"pith_short_12","alias_value":"5L3CN3TE2DCA","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"5L3CN3TE2DCARGGV","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"5L3CN3TE","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:f42f96b0a26ba707d0fae4271d3aa42e36d091d2dc10c5d7fb6a44a55259540b","target":"graph","created_at":"2026-05-18T00:58:43Z","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 define a notion of network capacity region of networks that generalizes the notion of network capacity defined by Cannons et al. and prove its notable properties such as closedness, boundedness and convexity when the finite field is fixed. We show that the network routing capacity region is a computable rational polytope and provide exact algorithms and approximation heuristics for computing the region. We define the semi-network linear coding capacity region, with respect to a fixed finite field, that inner bounds the corresponding network linear coding capacity region, show that it is a c","authors_text":"Anthony Kim, Muriel Medard","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-02T07:43:56Z","title":"Computing Bounds on Network Capacity Regions as a Polytope Reconstruction Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.0361","kind":"arxiv","version":2},"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:d40b02d4537844f34e5f4909cfb5ac036e2d9c411d6cc91755f370ca7a67f556","target":"record","created_at":"2026-05-18T00:58:43Z","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":"712797e541a33f8414ca27caeabaf5d7e9bb5cec91d4f8aff4e043b309df4bdd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-02T07:43:56Z","title_canon_sha256":"38c899ebd6a5195bd7b92cf33c677863b8f02826032b809d1b52cef217912eb6"},"schema_version":"1.0","source":{"id":"1103.0361","kind":"arxiv","version":2}},"canonical_sha256":"eaf626ee64d0c40898d5f6192be99a3fb6c8ba14d177469432bcd4edcef4a72d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eaf626ee64d0c40898d5f6192be99a3fb6c8ba14d177469432bcd4edcef4a72d","first_computed_at":"2026-05-18T00:58:43.616400Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:43.616400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"50tjzAgDBHD+dCVPWCVB3z1N/nw0mo25AfvMqx0enmuoFTeYfct+V9W1yORzEavDgP05Bis1Da3IaDWPGlZbAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:43.616890Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.0361","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d40b02d4537844f34e5f4909cfb5ac036e2d9c411d6cc91755f370ca7a67f556","sha256:f42f96b0a26ba707d0fae4271d3aa42e36d091d2dc10c5d7fb6a44a55259540b"],"state_sha256":"55dabc4eeb13ead9ac21bea1c7936b5d55f98c953b6db021e15998c503861785"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o7zW++gMQKcyvN5JEO4JalNTnEvWYVmF5fCU089bkVxUY4JgtrPaV58sudyj6zp10rzXshs9BZQqoM3PJe9VCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:23:55.527400Z","bundle_sha256":"61998ed6211ff8ac68b34f760501d0a45c641385ec779193bfc5bab925f0372c"}}