{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:SMPBKQMD5MDUGCTSNQIRFXGJLB","short_pith_number":"pith:SMPBKQMD","schema_version":"1.0","canonical_sha256":"931e154183eb07430a726c1112dcc9584bea54f13fe6d7640ae2523aa47dae74","source":{"kind":"arxiv","id":"2009.02991","version":2},"attestation_state":"computed","paper":{"title":"Information Hiding Using Matroid Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Olga Kuznetsova, Ragnar Freij-Hollanti","submitted_at":"2020-09-07T10:17:43Z","abstract_excerpt":"Inspired by problems in Private Information Retrieval, we consider the setting where two users need to establish a communication protocol to transmit a secret without revealing it to external observers. This is a question of how large a linear code can be, when it is required to agree with a prescribed code on a collection of coordinate sets. We show how the efficiency of such a protocol is determined by the derived matroid of the underlying linear communication code. Furthermore, we provide several sufficient combinatorial conditions for when no secret transmission is possible."},"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":"2009.02991","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-09-07T10:17:43Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"684e61430c858675fddbf24bbc9587b3d04e571fcfe140b483e9c71eb3047bb6","abstract_canon_sha256":"6057fdb88902b4ed84cc13cd523904914c070748c5f8e8ccf4fbc4b1ae9e3ae1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:41:28.596231Z","signature_b64":"5L8FJJqLQzGDj59AGdG53C4E6USWxSlgPM9uEPfJoDjtb7Rd27EjJN0ujfNM+sVK3K5y49J4fiVz02/aIB74CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"931e154183eb07430a726c1112dcc9584bea54f13fe6d7640ae2523aa47dae74","last_reissued_at":"2026-07-05T02:41:28.595768Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:41:28.595768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Information Hiding Using Matroid Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Olga Kuznetsova, Ragnar Freij-Hollanti","submitted_at":"2020-09-07T10:17:43Z","abstract_excerpt":"Inspired by problems in Private Information Retrieval, we consider the setting where two users need to establish a communication protocol to transmit a secret without revealing it to external observers. This is a question of how large a linear code can be, when it is required to agree with a prescribed code on a collection of coordinate sets. We show how the efficiency of such a protocol is determined by the derived matroid of the underlying linear communication code. Furthermore, we provide several sufficient combinatorial conditions for when no secret transmission is possible."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.02991","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2009.02991/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2009.02991","created_at":"2026-07-05T02:41:28.595825+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.02991v2","created_at":"2026-07-05T02:41:28.595825+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.02991","created_at":"2026-07-05T02:41:28.595825+00:00"},{"alias_kind":"pith_short_12","alias_value":"SMPBKQMD5MDU","created_at":"2026-07-05T02:41:28.595825+00:00"},{"alias_kind":"pith_short_16","alias_value":"SMPBKQMD5MDUGCTS","created_at":"2026-07-05T02:41:28.595825+00:00"},{"alias_kind":"pith_short_8","alias_value":"SMPBKQMD","created_at":"2026-07-05T02:41:28.595825+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/SMPBKQMD5MDUGCTSNQIRFXGJLB","json":"https://pith.science/pith/SMPBKQMD5MDUGCTSNQIRFXGJLB.json","graph_json":"https://pith.science/api/pith-number/SMPBKQMD5MDUGCTSNQIRFXGJLB/graph.json","events_json":"https://pith.science/api/pith-number/SMPBKQMD5MDUGCTSNQIRFXGJLB/events.json","paper":"https://pith.science/paper/SMPBKQMD"},"agent_actions":{"view_html":"https://pith.science/pith/SMPBKQMD5MDUGCTSNQIRFXGJLB","download_json":"https://pith.science/pith/SMPBKQMD5MDUGCTSNQIRFXGJLB.json","view_paper":"https://pith.science/paper/SMPBKQMD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.02991&json=true","fetch_graph":"https://pith.science/api/pith-number/SMPBKQMD5MDUGCTSNQIRFXGJLB/graph.json","fetch_events":"https://pith.science/api/pith-number/SMPBKQMD5MDUGCTSNQIRFXGJLB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SMPBKQMD5MDUGCTSNQIRFXGJLB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SMPBKQMD5MDUGCTSNQIRFXGJLB/action/storage_attestation","attest_author":"https://pith.science/pith/SMPBKQMD5MDUGCTSNQIRFXGJLB/action/author_attestation","sign_citation":"https://pith.science/pith/SMPBKQMD5MDUGCTSNQIRFXGJLB/action/citation_signature","submit_replication":"https://pith.science/pith/SMPBKQMD5MDUGCTSNQIRFXGJLB/action/replication_record"}},"created_at":"2026-07-05T02:41:28.595825+00:00","updated_at":"2026-07-05T02:41:28.595825+00:00"}