{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SYHXXPTIX4DO74DWUEBARCKQPN","short_pith_number":"pith:SYHXXPTI","schema_version":"1.0","canonical_sha256":"960f7bbe68bf06eff076a1020889507b6f49e6c5a9009df65eb06adc611ba371","source":{"kind":"arxiv","id":"1903.11587","version":2},"attestation_state":"computed","paper":{"title":"Characteristic-Dependent Linear Rank Inequalities via Complementary Vector Spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Humberto Sarria, Victor Pena","submitted_at":"2019-03-27T17:51:02Z","abstract_excerpt":"A characteristic-dependent linear rank inequality is a linear inequality that holds by ranks of subspaces of a vector space over a finite field of determined characteristic, and does not in general hold over other characteristics. In this paper, we produce new characteristic-dependent linear rank inequalities by an alternative technique to the usual Dougherty's inverse function method [9]. We take up some ideas of Blasiak [4], applied to certain complementary vector spaces, in order to produce them. Also, we present some applications to network coding. In particular, for each finite or co-fini"},"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":"1903.11587","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-27T17:51:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3c49970031f129e5a6055598a30dd8414bc586c9e31353f862d85a566a4ac8ef","abstract_canon_sha256":"4a071f46212de5200b48453539b66d7186195920d7e949dcf547a64e00f88c49"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:14.371522Z","signature_b64":"kZPiPSOZtFbyHkNFIganHuT3+jFQjZL0raH2WSP1j8DhfpNno+ZrZFc4m5FOUHdaMer4HwzxvgsR08vEpllPBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"960f7bbe68bf06eff076a1020889507b6f49e6c5a9009df65eb06adc611ba371","last_reissued_at":"2026-05-17T23:49:14.370805Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:14.370805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Characteristic-Dependent Linear Rank Inequalities via Complementary Vector Spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Humberto Sarria, Victor Pena","submitted_at":"2019-03-27T17:51:02Z","abstract_excerpt":"A characteristic-dependent linear rank inequality is a linear inequality that holds by ranks of subspaces of a vector space over a finite field of determined characteristic, and does not in general hold over other characteristics. In this paper, we produce new characteristic-dependent linear rank inequalities by an alternative technique to the usual Dougherty's inverse function method [9]. We take up some ideas of Blasiak [4], applied to certain complementary vector spaces, in order to produce them. Also, we present some applications to network coding. In particular, for each finite or co-fini"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.11587","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":"1903.11587","created_at":"2026-05-17T23:49:14.370924+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.11587v2","created_at":"2026-05-17T23:49:14.370924+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.11587","created_at":"2026-05-17T23:49:14.370924+00:00"},{"alias_kind":"pith_short_12","alias_value":"SYHXXPTIX4DO","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"SYHXXPTIX4DO74DW","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"SYHXXPTI","created_at":"2026-05-18T12:33:27.125529+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/SYHXXPTIX4DO74DWUEBARCKQPN","json":"https://pith.science/pith/SYHXXPTIX4DO74DWUEBARCKQPN.json","graph_json":"https://pith.science/api/pith-number/SYHXXPTIX4DO74DWUEBARCKQPN/graph.json","events_json":"https://pith.science/api/pith-number/SYHXXPTIX4DO74DWUEBARCKQPN/events.json","paper":"https://pith.science/paper/SYHXXPTI"},"agent_actions":{"view_html":"https://pith.science/pith/SYHXXPTIX4DO74DWUEBARCKQPN","download_json":"https://pith.science/pith/SYHXXPTIX4DO74DWUEBARCKQPN.json","view_paper":"https://pith.science/paper/SYHXXPTI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.11587&json=true","fetch_graph":"https://pith.science/api/pith-number/SYHXXPTIX4DO74DWUEBARCKQPN/graph.json","fetch_events":"https://pith.science/api/pith-number/SYHXXPTIX4DO74DWUEBARCKQPN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SYHXXPTIX4DO74DWUEBARCKQPN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SYHXXPTIX4DO74DWUEBARCKQPN/action/storage_attestation","attest_author":"https://pith.science/pith/SYHXXPTIX4DO74DWUEBARCKQPN/action/author_attestation","sign_citation":"https://pith.science/pith/SYHXXPTIX4DO74DWUEBARCKQPN/action/citation_signature","submit_replication":"https://pith.science/pith/SYHXXPTIX4DO74DWUEBARCKQPN/action/replication_record"}},"created_at":"2026-05-17T23:49:14.370924+00:00","updated_at":"2026-05-17T23:49:14.370924+00:00"}