{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ZFPYMYA75KBQBIFLNBDPTV5OST","short_pith_number":"pith:ZFPYMYA7","schema_version":"1.0","canonical_sha256":"c95f86601fea8300a0ab6846f9d7ae94d7aa4ff6ce7b63fd592aff00fc84df70","source":{"kind":"arxiv","id":"1908.01650","version":2},"attestation_state":"computed","paper":{"title":"Minimal linear codes from characteristic functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chunming Tang, Hongming Ru, Sihem Mesnager, Yanfeng Qi","submitted_at":"2019-08-05T14:40:23Z","abstract_excerpt":"Minimal linear codes have interesting applications in secret sharing schemes and secure two-party computation. This paper uses characteristic functions of some subsets of $\\mathbb{F}_q$ to construct minimal linear codes. By properties of characteristic functions, we can obtain more minimal binary linear codes from known minimal binary linear codes, which generalizes results of Ding et al. [IEEE Trans. Inf. Theory, vol. 64, no. 10, pp. 6536-6545, 2018]. By characteristic functions corresponding to some subspaces of $\\mathbb{F}_q$, we obtain many minimal linear codes, which generalizes results o"},"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":"1908.01650","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-05T14:40:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8a5a4f6f2a2b4da11a1862161feec03bacc952d245876ff1027eabecb2ce70a9","abstract_canon_sha256":"8eaa5dd62fface8524e2facbde6fdb529d397343cb0aace46b37f221a4ee2db1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:20:43.753135Z","signature_b64":"pnq+SvvFekhpjcSMoefn88WDl19R+kaxGzPggNRdo8RaWLHMP6jyWDdZ3SksvXGx17bgv2r81W4G4MOo6cNkBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c95f86601fea8300a0ab6846f9d7ae94d7aa4ff6ce7b63fd592aff00fc84df70","last_reissued_at":"2026-07-05T00:20:43.752655Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:20:43.752655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimal linear codes from characteristic functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chunming Tang, Hongming Ru, Sihem Mesnager, Yanfeng Qi","submitted_at":"2019-08-05T14:40:23Z","abstract_excerpt":"Minimal linear codes have interesting applications in secret sharing schemes and secure two-party computation. This paper uses characteristic functions of some subsets of $\\mathbb{F}_q$ to construct minimal linear codes. By properties of characteristic functions, we can obtain more minimal binary linear codes from known minimal binary linear codes, which generalizes results of Ding et al. [IEEE Trans. Inf. Theory, vol. 64, no. 10, pp. 6536-6545, 2018]. By characteristic functions corresponding to some subspaces of $\\mathbb{F}_q$, we obtain many minimal linear codes, which generalizes results o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.01650","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/1908.01650/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":"1908.01650","created_at":"2026-07-05T00:20:43.752712+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.01650v2","created_at":"2026-07-05T00:20:43.752712+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.01650","created_at":"2026-07-05T00:20:43.752712+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZFPYMYA75KBQ","created_at":"2026-07-05T00:20:43.752712+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZFPYMYA75KBQBIFL","created_at":"2026-07-05T00:20:43.752712+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZFPYMYA7","created_at":"2026-07-05T00:20:43.752712+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/ZFPYMYA75KBQBIFLNBDPTV5OST","json":"https://pith.science/pith/ZFPYMYA75KBQBIFLNBDPTV5OST.json","graph_json":"https://pith.science/api/pith-number/ZFPYMYA75KBQBIFLNBDPTV5OST/graph.json","events_json":"https://pith.science/api/pith-number/ZFPYMYA75KBQBIFLNBDPTV5OST/events.json","paper":"https://pith.science/paper/ZFPYMYA7"},"agent_actions":{"view_html":"https://pith.science/pith/ZFPYMYA75KBQBIFLNBDPTV5OST","download_json":"https://pith.science/pith/ZFPYMYA75KBQBIFLNBDPTV5OST.json","view_paper":"https://pith.science/paper/ZFPYMYA7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.01650&json=true","fetch_graph":"https://pith.science/api/pith-number/ZFPYMYA75KBQBIFLNBDPTV5OST/graph.json","fetch_events":"https://pith.science/api/pith-number/ZFPYMYA75KBQBIFLNBDPTV5OST/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZFPYMYA75KBQBIFLNBDPTV5OST/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZFPYMYA75KBQBIFLNBDPTV5OST/action/storage_attestation","attest_author":"https://pith.science/pith/ZFPYMYA75KBQBIFLNBDPTV5OST/action/author_attestation","sign_citation":"https://pith.science/pith/ZFPYMYA75KBQBIFLNBDPTV5OST/action/citation_signature","submit_replication":"https://pith.science/pith/ZFPYMYA75KBQBIFLNBDPTV5OST/action/replication_record"}},"created_at":"2026-07-05T00:20:43.752712+00:00","updated_at":"2026-07-05T00:20:43.752712+00:00"}