{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:VS66ZI52CKFRIH6AME4CZRBZQJ","short_pith_number":"pith:VS66ZI52","canonical_record":{"source":{"id":"1103.0358","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-02T07:33:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fbc515b484747a43d2359fb302495f51f2b8396c7d1c06496e55df24a9ade77d","abstract_canon_sha256":"87557f0a4f98d663df955df653ab0d0c8490500141897792a1da1ba5b4491ab8"},"schema_version":"1.0"},"canonical_sha256":"acbdeca3ba128b141fc061382cc4398244fb5cf9f999186e4b7e95fc90916f86","source":{"kind":"arxiv","id":"1103.0358","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.0358","created_at":"2026-05-18T04:27:35Z"},{"alias_kind":"arxiv_version","alias_value":"1103.0358v1","created_at":"2026-05-18T04:27:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.0358","created_at":"2026-05-18T04:27:35Z"},{"alias_kind":"pith_short_12","alias_value":"VS66ZI52CKFR","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"VS66ZI52CKFRIH6A","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"VS66ZI52","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:VS66ZI52CKFRIH6AME4CZRBZQJ","target":"record","payload":{"canonical_record":{"source":{"id":"1103.0358","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-02T07:33:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fbc515b484747a43d2359fb302495f51f2b8396c7d1c06496e55df24a9ade77d","abstract_canon_sha256":"87557f0a4f98d663df955df653ab0d0c8490500141897792a1da1ba5b4491ab8"},"schema_version":"1.0"},"canonical_sha256":"acbdeca3ba128b141fc061382cc4398244fb5cf9f999186e4b7e95fc90916f86","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:35.145485Z","signature_b64":"v19pMVRXynyPMhLOX3SyzsxidaCjBNNz0bWsVscB1iEZyNIP3Lfnmr6S3iZRwk1mx0uZ7om5n4wM7Os9AuXfBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"acbdeca3ba128b141fc061382cc4398244fb5cf9f999186e4b7e95fc90916f86","last_reissued_at":"2026-05-18T04:27:35.144849Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:35.144849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.0358","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:27:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pv2UdixIKdKQrhMdwIeCNXnV2fHjtCFJC/0F3nZh1MPGwCt79rkJFq9ZVvONuz1ET53egjvuiiEjw1X0wg4jDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:07:11.962621Z"},"content_sha256":"6340b7ad351683830ba326fc8ec9c2775132dc0e5fcc1b95298f6ee0a627e8ec","schema_version":"1.0","event_id":"sha256:6340b7ad351683830ba326fc8ec9c2775132dc0e5fcc1b95298f6ee0a627e8ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:VS66ZI52CKFRIH6AME4CZRBZQJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Network Coding Capacity - Matroidal Networks and Network Capacity Regions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anthony Kim","submitted_at":"2011-03-02T07:33:17Z","abstract_excerpt":"One fundamental problem in the field of network coding is to determine the network coding capacity of networks under various network coding schemes. In this thesis, we address the problem with two approaches: matroidal networks and capacity regions.\n  In our matroidal approach, we prove the converse of the theorem which states that, if a network is scalar-linearly solvable then it is a matroidal network associated with a representable matroid over a finite field. As a consequence, we obtain a correspondence between scalar-linearly solvable networks and representable matroids over finite fields"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.0358","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:27:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JLk6w7jMDV3zX92JxREjQKbGtzMyFDVb/kyHpWhrN5cBtz38RNMo4qZwSZtLDX8B0H38laTxhLshc6XRJZIVBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:07:11.962975Z"},"content_sha256":"6054d60564e99ea55327906a9b3d0744003150367bfb5162d1c0a9c43753b716","schema_version":"1.0","event_id":"sha256:6054d60564e99ea55327906a9b3d0744003150367bfb5162d1c0a9c43753b716"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VS66ZI52CKFRIH6AME4CZRBZQJ/bundle.json","state_url":"https://pith.science/pith/VS66ZI52CKFRIH6AME4CZRBZQJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VS66ZI52CKFRIH6AME4CZRBZQJ/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-02T08:07:11Z","links":{"resolver":"https://pith.science/pith/VS66ZI52CKFRIH6AME4CZRBZQJ","bundle":"https://pith.science/pith/VS66ZI52CKFRIH6AME4CZRBZQJ/bundle.json","state":"https://pith.science/pith/VS66ZI52CKFRIH6AME4CZRBZQJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VS66ZI52CKFRIH6AME4CZRBZQJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:VS66ZI52CKFRIH6AME4CZRBZQJ","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":"87557f0a4f98d663df955df653ab0d0c8490500141897792a1da1ba5b4491ab8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-02T07:33:17Z","title_canon_sha256":"fbc515b484747a43d2359fb302495f51f2b8396c7d1c06496e55df24a9ade77d"},"schema_version":"1.0","source":{"id":"1103.0358","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.0358","created_at":"2026-05-18T04:27:35Z"},{"alias_kind":"arxiv_version","alias_value":"1103.0358v1","created_at":"2026-05-18T04:27:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.0358","created_at":"2026-05-18T04:27:35Z"},{"alias_kind":"pith_short_12","alias_value":"VS66ZI52CKFR","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"VS66ZI52CKFRIH6A","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"VS66ZI52","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:6054d60564e99ea55327906a9b3d0744003150367bfb5162d1c0a9c43753b716","target":"graph","created_at":"2026-05-18T04:27:35Z","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":"One fundamental problem in the field of network coding is to determine the network coding capacity of networks under various network coding schemes. In this thesis, we address the problem with two approaches: matroidal networks and capacity regions.\n  In our matroidal approach, we prove the converse of the theorem which states that, if a network is scalar-linearly solvable then it is a matroidal network associated with a representable matroid over a finite field. As a consequence, we obtain a correspondence between scalar-linearly solvable networks and representable matroids over finite fields","authors_text":"Anthony Kim","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-02T07:33:17Z","title":"On Network Coding Capacity - Matroidal Networks and Network Capacity Regions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.0358","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:6340b7ad351683830ba326fc8ec9c2775132dc0e5fcc1b95298f6ee0a627e8ec","target":"record","created_at":"2026-05-18T04:27:35Z","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":"87557f0a4f98d663df955df653ab0d0c8490500141897792a1da1ba5b4491ab8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-02T07:33:17Z","title_canon_sha256":"fbc515b484747a43d2359fb302495f51f2b8396c7d1c06496e55df24a9ade77d"},"schema_version":"1.0","source":{"id":"1103.0358","kind":"arxiv","version":1}},"canonical_sha256":"acbdeca3ba128b141fc061382cc4398244fb5cf9f999186e4b7e95fc90916f86","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"acbdeca3ba128b141fc061382cc4398244fb5cf9f999186e4b7e95fc90916f86","first_computed_at":"2026-05-18T04:27:35.144849Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:27:35.144849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v19pMVRXynyPMhLOX3SyzsxidaCjBNNz0bWsVscB1iEZyNIP3Lfnmr6S3iZRwk1mx0uZ7om5n4wM7Os9AuXfBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:27:35.145485Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.0358","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6340b7ad351683830ba326fc8ec9c2775132dc0e5fcc1b95298f6ee0a627e8ec","sha256:6054d60564e99ea55327906a9b3d0744003150367bfb5162d1c0a9c43753b716"],"state_sha256":"8015f22e5e4ce6b4794c3d03b2ffab0730279c5eb57c2617c5802965ab9d24b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ixQ+sYts9diD9kvxxlPUr6789ru1rQFHAzlRMr+2wJWjLrqRZoHIt7RDor/xwbjvJtrq+NPp/SecWn3Fan0VCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T08:07:11.964970Z","bundle_sha256":"df3d05d9cf5940c7755769a500a0c11fd727ca372674735024179b24bebb1453"}}