{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:7WP3UIGCWAJPPKUV2H6Y4Z4TTQ","short_pith_number":"pith:7WP3UIGC","canonical_record":{"source":{"id":"1306.1157","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-05T15:52:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"63e168a7e2c8b37ff3f036e53c6faaf7efc3d6f5d56ca5bcbc4b4d1b12921bb8","abstract_canon_sha256":"5971b2ac242cff2f3e36691c4e9ff747b2c05c893b9e8c4c6794ebacf7e69e5f"},"schema_version":"1.0"},"canonical_sha256":"fd9fba20c2b012f7aa95d1fd8e67939c058d04ec0a9aa2c181f3dc082e74a202","source":{"kind":"arxiv","id":"1306.1157","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.1157","created_at":"2026-05-18T01:18:53Z"},{"alias_kind":"arxiv_version","alias_value":"1306.1157v3","created_at":"2026-05-18T01:18:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.1157","created_at":"2026-05-18T01:18:53Z"},{"alias_kind":"pith_short_12","alias_value":"7WP3UIGCWAJP","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"7WP3UIGCWAJPPKUV","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"7WP3UIGC","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:7WP3UIGCWAJPPKUV2H6Y4Z4TTQ","target":"record","payload":{"canonical_record":{"source":{"id":"1306.1157","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-05T15:52:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"63e168a7e2c8b37ff3f036e53c6faaf7efc3d6f5d56ca5bcbc4b4d1b12921bb8","abstract_canon_sha256":"5971b2ac242cff2f3e36691c4e9ff747b2c05c893b9e8c4c6794ebacf7e69e5f"},"schema_version":"1.0"},"canonical_sha256":"fd9fba20c2b012f7aa95d1fd8e67939c058d04ec0a9aa2c181f3dc082e74a202","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:53.059529Z","signature_b64":"u/2N/8t/VuHoN5C8Ajt5bjliwOWcwXJytiYzDSQRodbrBLLMt2uA4Ed5/8YKiAn4KlEN5UoNGPc7nRNj7Hl2BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd9fba20c2b012f7aa95d1fd8e67939c058d04ec0a9aa2c181f3dc082e74a202","last_reissued_at":"2026-05-18T01:18:53.059085Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:53.059085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.1157","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-18T01:18:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yv1+f4JUYh8YvxD13kjhO9FHGfQItgIGuWZ6OQp9eSn5iv2h1NKtuIyFyKd7bf6xC4/NUVMDbaNC2htdgDDQCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:18:07.241641Z"},"content_sha256":"890f02397feb4423d3cadbf96ac92f30406a05765d497e358833079c92ac3546","schema_version":"1.0","event_id":"sha256:890f02397feb4423d3cadbf96ac92f30406a05765d497e358833079c92ac3546"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:7WP3UIGCWAJPPKUV2H6Y4Z4TTQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear Network Coding, Linear Index Coding and Representable Discrete Polymatroids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"B. Sundar Rajan, Vijayvaradharaj T. Muralidharan","submitted_at":"2013-06-05T15:52:28Z","abstract_excerpt":"Discrete polymatroids are the multi-set analogue of matroids. In this paper, we explore the connections among linear network coding, linear index coding and representable discrete polymatroids. We consider vector linear solutions of networks over a field $\\mathbb{F}_q,$ with possibly different message and edge vector dimensions, which are referred to as linear fractional solutions. We define a \\textit{discrete polymatroidal} network and show that a linear fractional solution over a field $\\mathbb{F}_q,$ exists for a network if and only if the network is discrete polymatroidal with respect to a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.1157","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-18T01:18:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pQNabgmugkRz09VV8uzDAU1msS85KBBkKf7tiff9FKpj3FohbTSHOrpcKusOk0khCY/RlgZB2zkG2u3k8HIYBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:18:07.241989Z"},"content_sha256":"6efe4a4ff9c2b51fa386c7e624e84a8173f8c4525220dea0c9b9d4f7ba05886b","schema_version":"1.0","event_id":"sha256:6efe4a4ff9c2b51fa386c7e624e84a8173f8c4525220dea0c9b9d4f7ba05886b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7WP3UIGCWAJPPKUV2H6Y4Z4TTQ/bundle.json","state_url":"https://pith.science/pith/7WP3UIGCWAJPPKUV2H6Y4Z4TTQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7WP3UIGCWAJPPKUV2H6Y4Z4TTQ/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-04T17:18:07Z","links":{"resolver":"https://pith.science/pith/7WP3UIGCWAJPPKUV2H6Y4Z4TTQ","bundle":"https://pith.science/pith/7WP3UIGCWAJPPKUV2H6Y4Z4TTQ/bundle.json","state":"https://pith.science/pith/7WP3UIGCWAJPPKUV2H6Y4Z4TTQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7WP3UIGCWAJPPKUV2H6Y4Z4TTQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:7WP3UIGCWAJPPKUV2H6Y4Z4TTQ","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":"5971b2ac242cff2f3e36691c4e9ff747b2c05c893b9e8c4c6794ebacf7e69e5f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-05T15:52:28Z","title_canon_sha256":"63e168a7e2c8b37ff3f036e53c6faaf7efc3d6f5d56ca5bcbc4b4d1b12921bb8"},"schema_version":"1.0","source":{"id":"1306.1157","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.1157","created_at":"2026-05-18T01:18:53Z"},{"alias_kind":"arxiv_version","alias_value":"1306.1157v3","created_at":"2026-05-18T01:18:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.1157","created_at":"2026-05-18T01:18:53Z"},{"alias_kind":"pith_short_12","alias_value":"7WP3UIGCWAJP","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"7WP3UIGCWAJPPKUV","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"7WP3UIGC","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:6efe4a4ff9c2b51fa386c7e624e84a8173f8c4525220dea0c9b9d4f7ba05886b","target":"graph","created_at":"2026-05-18T01:18:53Z","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":"Discrete polymatroids are the multi-set analogue of matroids. In this paper, we explore the connections among linear network coding, linear index coding and representable discrete polymatroids. We consider vector linear solutions of networks over a field $\\mathbb{F}_q,$ with possibly different message and edge vector dimensions, which are referred to as linear fractional solutions. We define a \\textit{discrete polymatroidal} network and show that a linear fractional solution over a field $\\mathbb{F}_q,$ exists for a network if and only if the network is discrete polymatroidal with respect to a","authors_text":"B. Sundar Rajan, Vijayvaradharaj T. Muralidharan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-05T15:52:28Z","title":"Linear Network Coding, Linear Index Coding and Representable Discrete Polymatroids"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.1157","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:890f02397feb4423d3cadbf96ac92f30406a05765d497e358833079c92ac3546","target":"record","created_at":"2026-05-18T01:18:53Z","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":"5971b2ac242cff2f3e36691c4e9ff747b2c05c893b9e8c4c6794ebacf7e69e5f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-05T15:52:28Z","title_canon_sha256":"63e168a7e2c8b37ff3f036e53c6faaf7efc3d6f5d56ca5bcbc4b4d1b12921bb8"},"schema_version":"1.0","source":{"id":"1306.1157","kind":"arxiv","version":3}},"canonical_sha256":"fd9fba20c2b012f7aa95d1fd8e67939c058d04ec0a9aa2c181f3dc082e74a202","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd9fba20c2b012f7aa95d1fd8e67939c058d04ec0a9aa2c181f3dc082e74a202","first_computed_at":"2026-05-18T01:18:53.059085Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:53.059085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u/2N/8t/VuHoN5C8Ajt5bjliwOWcwXJytiYzDSQRodbrBLLMt2uA4Ed5/8YKiAn4KlEN5UoNGPc7nRNj7Hl2BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:53.059529Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.1157","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:890f02397feb4423d3cadbf96ac92f30406a05765d497e358833079c92ac3546","sha256:6efe4a4ff9c2b51fa386c7e624e84a8173f8c4525220dea0c9b9d4f7ba05886b"],"state_sha256":"486c1352ebb4daaede3c542225692d460ed98400f53857be03b975b008ea6b14"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JvAabeFz/Mn9+AAVol7RKPABD4VZmcIlvnxDob/OIM5/NEny+jtnzFXbVTHTdMJ2zPWR46A3MM2ueDMBiJp5DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T17:18:07.244173Z","bundle_sha256":"b43b682451b5a4c67ede941fb3cc5aa1e028a575632f1c464cc9a58bf1209b22"}}