{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:7WP3UIGCWAJPPKUV2H6Y4Z4TTQ","short_pith_number":"pith:7WP3UIGC","schema_version":"1.0","canonical_sha256":"fd9fba20c2b012f7aa95d1fd8e67939c058d04ec0a9aa2c181f3dc082e74a202","source":{"kind":"arxiv","id":"1306.1157","version":3},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1306.1157","created_at":"2026-05-18T01:18:53.059151+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.1157v3","created_at":"2026-05-18T01:18:53.059151+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.1157","created_at":"2026-05-18T01:18:53.059151+00:00"},{"alias_kind":"pith_short_12","alias_value":"7WP3UIGCWAJP","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"7WP3UIGCWAJPPKUV","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"7WP3UIGC","created_at":"2026-05-18T12:27:38.830355+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7WP3UIGCWAJPPKUV2H6Y4Z4TTQ","json":"https://pith.science/pith/7WP3UIGCWAJPPKUV2H6Y4Z4TTQ.json","graph_json":"https://pith.science/api/pith-number/7WP3UIGCWAJPPKUV2H6Y4Z4TTQ/graph.json","events_json":"https://pith.science/api/pith-number/7WP3UIGCWAJPPKUV2H6Y4Z4TTQ/events.json","paper":"https://pith.science/paper/7WP3UIGC"},"agent_actions":{"view_html":"https://pith.science/pith/7WP3UIGCWAJPPKUV2H6Y4Z4TTQ","download_json":"https://pith.science/pith/7WP3UIGCWAJPPKUV2H6Y4Z4TTQ.json","view_paper":"https://pith.science/paper/7WP3UIGC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.1157&json=true","fetch_graph":"https://pith.science/api/pith-number/7WP3UIGCWAJPPKUV2H6Y4Z4TTQ/graph.json","fetch_events":"https://pith.science/api/pith-number/7WP3UIGCWAJPPKUV2H6Y4Z4TTQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7WP3UIGCWAJPPKUV2H6Y4Z4TTQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7WP3UIGCWAJPPKUV2H6Y4Z4TTQ/action/storage_attestation","attest_author":"https://pith.science/pith/7WP3UIGCWAJPPKUV2H6Y4Z4TTQ/action/author_attestation","sign_citation":"https://pith.science/pith/7WP3UIGCWAJPPKUV2H6Y4Z4TTQ/action/citation_signature","submit_replication":"https://pith.science/pith/7WP3UIGCWAJPPKUV2H6Y4Z4TTQ/action/replication_record"}},"created_at":"2026-05-18T01:18:53.059151+00:00","updated_at":"2026-05-18T01:18:53.059151+00:00"}