{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:6JDPB42A5OZCIOGWCQFXPWVTNQ","short_pith_number":"pith:6JDPB42A","schema_version":"1.0","canonical_sha256":"f246f0f340ebb22438d6140b77dab36c00573719761b0340238b45e3640be684","source":{"kind":"arxiv","id":"1605.04598","version":2},"attestation_state":"computed","paper":{"title":"Constrained Linear Representability of Polymatroids and Algorithms for Computing Achievability Proofs in Network Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jayant Apte, John MacLaren Walsh","submitted_at":"2016-05-15T19:48:50Z","abstract_excerpt":"The constrained linear representability problem (CLRP) for polymatroids determines whether there exists a polymatroid that is linear over a specified field while satisfying a collection of constraints on the rank function. Using a computer to test whether a certain rate vector is achievable with vector linear network codes for a multi-source network coding instance and whether there exists a multi-linear secret sharing scheme achieving a specified information ratio for a given secret sharing instance are shown to be special cases of CLRP. Methods for solving CLRP built from group theoretic tec"},"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":"1605.04598","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-15T19:48:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6203dcbf5dd632f149e28c1bb009bcafe6abed48a41180e4fd253c65ebe90aae","abstract_canon_sha256":"14e04940bf3f835b1c0d18702818f86620a65e647b6061c2baea1eaa10a7811a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:34.091270Z","signature_b64":"sxyLKvAwl/AYUprnHRJQQPGQGbAizRZrHljByO2WFq1u79Yln0K9FIKLTrE9Wlj0m3h2WwvQMdSPic0VWuD9Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f246f0f340ebb22438d6140b77dab36c00573719761b0340238b45e3640be684","last_reissued_at":"2026-05-18T00:51:34.090857Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:34.090857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constrained Linear Representability of Polymatroids and Algorithms for Computing Achievability Proofs in Network Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jayant Apte, John MacLaren Walsh","submitted_at":"2016-05-15T19:48:50Z","abstract_excerpt":"The constrained linear representability problem (CLRP) for polymatroids determines whether there exists a polymatroid that is linear over a specified field while satisfying a collection of constraints on the rank function. Using a computer to test whether a certain rate vector is achievable with vector linear network codes for a multi-source network coding instance and whether there exists a multi-linear secret sharing scheme achieving a specified information ratio for a given secret sharing instance are shown to be special cases of CLRP. Methods for solving CLRP built from group theoretic tec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04598","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1605.04598","created_at":"2026-05-18T00:51:34.090926+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.04598v2","created_at":"2026-05-18T00:51:34.090926+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04598","created_at":"2026-05-18T00:51:34.090926+00:00"},{"alias_kind":"pith_short_12","alias_value":"6JDPB42A5OZC","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"6JDPB42A5OZCIOGW","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"6JDPB42A","created_at":"2026-05-18T12:30:01.593930+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/6JDPB42A5OZCIOGWCQFXPWVTNQ","json":"https://pith.science/pith/6JDPB42A5OZCIOGWCQFXPWVTNQ.json","graph_json":"https://pith.science/api/pith-number/6JDPB42A5OZCIOGWCQFXPWVTNQ/graph.json","events_json":"https://pith.science/api/pith-number/6JDPB42A5OZCIOGWCQFXPWVTNQ/events.json","paper":"https://pith.science/paper/6JDPB42A"},"agent_actions":{"view_html":"https://pith.science/pith/6JDPB42A5OZCIOGWCQFXPWVTNQ","download_json":"https://pith.science/pith/6JDPB42A5OZCIOGWCQFXPWVTNQ.json","view_paper":"https://pith.science/paper/6JDPB42A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.04598&json=true","fetch_graph":"https://pith.science/api/pith-number/6JDPB42A5OZCIOGWCQFXPWVTNQ/graph.json","fetch_events":"https://pith.science/api/pith-number/6JDPB42A5OZCIOGWCQFXPWVTNQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6JDPB42A5OZCIOGWCQFXPWVTNQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6JDPB42A5OZCIOGWCQFXPWVTNQ/action/storage_attestation","attest_author":"https://pith.science/pith/6JDPB42A5OZCIOGWCQFXPWVTNQ/action/author_attestation","sign_citation":"https://pith.science/pith/6JDPB42A5OZCIOGWCQFXPWVTNQ/action/citation_signature","submit_replication":"https://pith.science/pith/6JDPB42A5OZCIOGWCQFXPWVTNQ/action/replication_record"}},"created_at":"2026-05-18T00:51:34.090926+00:00","updated_at":"2026-05-18T00:51:34.090926+00:00"}