{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:QCHYIYESUNFNEDPL3JTAXQST73","short_pith_number":"pith:QCHYIYES","schema_version":"1.0","canonical_sha256":"808f846092a34ad20debda660bc253fee4898a03333cb34188f7c3da9c361b70","source":{"kind":"arxiv","id":"1407.7283","version":1},"attestation_state":"computed","paper":{"title":"On the representability of the bi-uniform matroid","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carles Padr\\'o, Chaoping Xing, Simeon Ball, Zsuzsa Weiner","submitted_at":"2014-07-27T20:55:15Z","abstract_excerpt":"Every bi-uniform matroid is representable over all sufficiently large fields. But it is not known exactly over which finite fields they are representable, and the existence of efficient methods to find a representation for every given bi-uniform matroid has not been proved. The interest of these problems is due to their implications to secret sharing. The existence of efficient methods to find representations for all bi-uniform matroids is proved here for the first time. The previously known efficient constructions apply only to a particular class of bi-uniform matroids, while the known genera"},"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":"1407.7283","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-27T20:55:15Z","cross_cats_sorted":[],"title_canon_sha256":"4b0d1a37f811bcb46e38c93bc49b262e290672cacfb0dab5148787648c391f88","abstract_canon_sha256":"10e81678f81a49e27831a2038aa3ec8eeaebbc7da7686f95e151020144ec51a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:23.427263Z","signature_b64":"+DXPRJ/rnhwptvn8j2GJt+59G2OT6BfRwLzprQxwZ9CHUWK+7f0//7ar9jJwhvmbLwzJit6TS+rfTJFp3MnsAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"808f846092a34ad20debda660bc253fee4898a03333cb34188f7c3da9c361b70","last_reissued_at":"2026-05-18T02:46:23.426868Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:23.426868Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the representability of the bi-uniform matroid","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carles Padr\\'o, Chaoping Xing, Simeon Ball, Zsuzsa Weiner","submitted_at":"2014-07-27T20:55:15Z","abstract_excerpt":"Every bi-uniform matroid is representable over all sufficiently large fields. But it is not known exactly over which finite fields they are representable, and the existence of efficient methods to find a representation for every given bi-uniform matroid has not been proved. The interest of these problems is due to their implications to secret sharing. The existence of efficient methods to find representations for all bi-uniform matroids is proved here for the first time. The previously known efficient constructions apply only to a particular class of bi-uniform matroids, while the known genera"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7283","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1407.7283","created_at":"2026-05-18T02:46:23.426922+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.7283v1","created_at":"2026-05-18T02:46:23.426922+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7283","created_at":"2026-05-18T02:46:23.426922+00:00"},{"alias_kind":"pith_short_12","alias_value":"QCHYIYESUNFN","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"QCHYIYESUNFNEDPL","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"QCHYIYES","created_at":"2026-05-18T12:28:43.426989+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/QCHYIYESUNFNEDPL3JTAXQST73","json":"https://pith.science/pith/QCHYIYESUNFNEDPL3JTAXQST73.json","graph_json":"https://pith.science/api/pith-number/QCHYIYESUNFNEDPL3JTAXQST73/graph.json","events_json":"https://pith.science/api/pith-number/QCHYIYESUNFNEDPL3JTAXQST73/events.json","paper":"https://pith.science/paper/QCHYIYES"},"agent_actions":{"view_html":"https://pith.science/pith/QCHYIYESUNFNEDPL3JTAXQST73","download_json":"https://pith.science/pith/QCHYIYESUNFNEDPL3JTAXQST73.json","view_paper":"https://pith.science/paper/QCHYIYES","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.7283&json=true","fetch_graph":"https://pith.science/api/pith-number/QCHYIYESUNFNEDPL3JTAXQST73/graph.json","fetch_events":"https://pith.science/api/pith-number/QCHYIYESUNFNEDPL3JTAXQST73/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QCHYIYESUNFNEDPL3JTAXQST73/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QCHYIYESUNFNEDPL3JTAXQST73/action/storage_attestation","attest_author":"https://pith.science/pith/QCHYIYESUNFNEDPL3JTAXQST73/action/author_attestation","sign_citation":"https://pith.science/pith/QCHYIYESUNFNEDPL3JTAXQST73/action/citation_signature","submit_replication":"https://pith.science/pith/QCHYIYESUNFNEDPL3JTAXQST73/action/replication_record"}},"created_at":"2026-05-18T02:46:23.426922+00:00","updated_at":"2026-05-18T02:46:23.426922+00:00"}