{"as_of":"2026-08-16T08:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7e56072706c072c402a9f54d1070c001dbd0c545721dc2637a5b9edf6d771495","coverage":[{"denominator":39,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":39,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T15:19:32.255118Z","state":"measured"},{"denominator":39,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":39,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/1908.01650/citation-record","integrity":"/paper/1908.01650/integrity","json":"/paper/1908.01650/citation-record.json","paper":"/paper/1908.01650"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:19:32.781835Z","title":"Minimal vectors in linear code s,","venue":null,"work_id":"5e9924fd-835c-42db-8a9c-e9b309a00aec","year":2010},"citing_paper":{"arxiv_id":"1908.01650","last_updated":"2019-11-20T11:45:55Z","snapshot_observed_at":"2026-08-16T03:25:16.893163Z","submitted_at":"2019-08-05T14:40:23Z","title":"Minimal linear codes from characteristic functions","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T15:19:32.103222Z"},"links":{"citing_paper":"/paper/1908.01650"},"observation_digest":"sha256:5604cc31f1317e472b4f54fc74b51ae1056a9273b7e3f04c6cec4655439f5dfd","observation_id":"ff26164c-9c73-4033-b676-b92f4d245689","resolution":{"observed_at":"2026-08-14T15:19:32.785752Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:19:32.769097Z","title":"V ariatio ns on minimal codewords in linear codes,","venue":null,"work_id":"830a190c-a8fd-480a-b59a-4d4ff137fa68","year":1995},"citing_paper":{"arxiv_id":"1908.01650","last_updated":"2019-11-20T11:45:55Z","snapshot_observed_at":"2026-08-16T03:25:16.893163Z","submitted_at":"2019-08-05T14:40:23Z","title":"Minimal linear codes from characteristic functions","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T15:19:32.108554Z"},"links":{"citing_paper":"/paper/1908.01650"},"observation_digest":"sha256:b0c59ca491baf3a63157e593fa4e0949cab6b7ca37ab4540b09e15ac45668d09","observation_id":"fd444ff4-2c82-448c-934d-d2a3c0c252ed","resolution":{"observed_at":"2026-08-14T15:19:32.773036Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:19:32.756409Z","title":"Minimal linear codes in odd cha racteristic,","venue":null,"work_id":"50e11c47-db0f-464d-9eed-25a7652716b0","year":2019},"citing_paper":{"arxiv_id":"1908.01650","last_updated":"2019-11-20T11:45:55Z","snapshot_observed_at":"2026-08-16T03:25:16.893163Z","submitted_at":"2019-08-05T14:40:23Z","title":"Minimal linear codes from characteristic functions","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T15:19:32.112838Z"},"links":{"citing_paper":"/paper/1908.01650"},"observation_digest":"sha256:abe8d26d2df7874ea70499be0b0db8684745402d6611af77dff9af2b8a410c8f","observation_id":"efcee670-1f74-4b47-8259-360c8f910e60","resolution":{"observed_at":"2026-08-14T15:19:32.760675Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:19:32.743110Z","title":"Minimal linear codes arising fro m blocking sets,","venue":null,"work_id":"fa215df1-e499-4446-9cf1-0233eba04cf1","year":1907},"citing_paper":{"arxiv_id":"1908.01650","last_updated":"2019-11-20T11:45:55Z","snapshot_observed_at":"2026-08-16T03:25:16.893163Z","submitted_at":"2019-08-05T14:40:23Z","title":"Minimal linear codes from characteristic functions","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T15:19:32.116897Z"},"links":{"citing_paper":"/paper/1908.01650"},"observation_digest":"sha256:1873f7bcb14c14b6739be36c6754b237a3db04703edb49f0a9f9cff0fc734fb1","observation_id":"f8dddf63-d016-4e6e-8446-be2459606d38","resolution":{"observed_at":"2026-08-14T15:19:32.747563Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:19:32.729709Z","title":"Three-weight codes and association schemes,","venue":null,"work_id":"84654177-25d2-450b-b6b1-cd07ae18c452","year":1984},"citing_paper":{"arxiv_id":"1908.01650","last_updated":"2019-11-20T11:45:55Z","snapshot_observed_at":"2026-08-16T03:25:16.893163Z","submitted_at":"2019-08-05T14:40:23Z","title":"Minimal linear codes from characteristic functions","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T15:19:32.121577Z"},"links":{"citing_paper":"/paper/1908.01650"},"observation_digest":"sha256:f96b9990781cbc1b7bb2ced969a203c161babf570afe22086ceb00f178ee9860","observation_id":"3b484430-d4cd-418b-83ff-5057cedfc1ca","resolution":{"observed_at":"2026-08-14T15:19:32.734017Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:19:32.717848Z","title":"The geometry of two-we ight codes,","venue":null,"work_id":"9b08ef9e-3300-437b-9fea-350201793141","year":1986},"citing_paper":{"arxiv_id":"1908.01650","last_updated":"2019-11-20T11:45:55Z","snapshot_observed_at":"2026-08-16T03:25:16.893163Z","submitted_at":"2019-08-05T14:40:23Z","title":"Minimal linear codes from characteristic functions","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T15:19:32.125642Z"},"links":{"citing_paper":"/paper/1908.01650"},"observation_digest":"sha256:af80a6e38e8d9db8de2809876c1ba2cb7c249f133c55ef7022c52e4219358893","observation_id":"3063d0a1-72c2-4a10-9b9b-df8b7d5a1089","resolution":{"observed_at":"2026-08-14T15:19:32.721463Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:19:32.704651Z","title":"Optimized linear complementary codes implementation for hardware trojan prevention,","venue":null,"work_id":"e7e957b1-2330-4796-9355-f9153170b42d","year":2015},"citing_paper":{"arxiv_id":"1908.01650","last_updated":"2019-11-20T11:45:55Z","snapshot_observed_at":"2026-08-16T03:25:16.893163Z","submitted_at":"2019-08-05T14:40:23Z","title":"Minimal linear codes from characteristic functions","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T15:19:32.130285Z"},"links":{"citing_paper":"/paper/1908.01650"},"observation_digest":"sha256:99a8e328d7e7ec05e9f4ad085c1f9e35e3d05f71641605b14628782742cd935e","observation_id":"155c0ded-ec13-4a3a-8458-793eeb21d284","resolution":{"observed_at":"2026-08-14T15:19:32.709407Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:19:32.692313Z","title":"Complementary dual codes for c ountermeasures to side-channel attacks,","venue":null,"work_id":"71a1492d-8091-4c5e-a1d5-e805c1153d8a","year":2016},"citing_paper":{"arxiv_id":"1908.01650","last_updated":"2019-11-20T11:45:55Z","snapshot_observed_at":"2026-08-16T03:25:16.893163Z","submitted_at":"2019-08-05T14:40:23Z","title":"Minimal linear codes from characteristic functions","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T15:19:32.133860Z"},"links":{"citing_paper":"/paper/1908.01650"},"observation_digest":"sha256:d5dd903e256c3725880e6cbaa0e1889df79d72a92008b0e8f69a59666de009a9","observation_id":"f679ae1c-46c8-4ff2-b733-ce0bd70a7033","resolution":{"observed_at":"2026-08-14T15:19:32.696351Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:19:32.679909Z","title":"Boolean functions for cryptography and erro r correcting codes,","venue":null,"work_id":"2f7ee73e-5d0c-4d90-a6d3-7521047689ee","year":2010},"citing_paper":{"arxiv_id":"1908.01650","last_updated":"2019-11-20T11:45:55Z","snapshot_observed_at":"2026-08-16T03:25:16.893163Z","submitted_at":"2019-08-05T14:40:23Z","title":"Minimal linear codes from characteristic functions","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T15:19:32.137960Z"},"links":{"citing_paper":"/paper/1908.01650"},"observation_digest":"sha256:ac8d32ed1f9331e8bf34357e3c53d23e2211c42f94e17fb80611312cd038005a","observation_id":"c082f617-62b0-4688-bec0-3fbf7087de2c","resolution":{"observed_at":"2026-08-14T15:19:32.683778Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:19:32.666316Z","title":"Nonlinearities of S-boxes,","venue":null,"work_id":"849dcd78-b28b-4ef2-97a5-79460832d834","year":null},"citing_paper":{"arxiv_id":"1908.01650","last_updated":"2019-11-20T11:45:55Z","snapshot_observed_at":"2026-08-16T03:25:16.893163Z","submitted_at":"2019-08-05T14:40:23Z","title":"Minimal linear codes from characteristic functions","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T15:19:32.141760Z"},"links":{"citing_paper":"/paper/1908.01650"},"observation_digest":"sha256:c630c1b2b9d3901abfd948253ccef3835d4d76dd448431ed14e2f85d0e1b3805","observation_id":"f2ee14be-0bb0-411e-8d4b-46889a91faaa","resolution":{"observed_at":"2026-08-14T15:19:32.670109Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:19:32.654252Z","title":"Linear codes from highl y nonlinear functions and their secret sharing schemes,","venue":null,"work_id":"bcb45435-a73b-48b6-9fba-7fe46582db6e","year":2005},"citing_paper":{"arxiv_id":"1908.01650","last_updated":"2019-11-20T11:45:55Z","snapshot_observed_at":"2026-08-16T03:25:16.893163Z","submitted_at":"2019-08-05T14:40:23Z","title":"Minimal linear codes from characteristic functions","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T15:19:32.145438Z"},"links":{"citing_paper":"/paper/1908.01650"},"observation_digest":"sha256:a05d89b82378636e11a11a3bf4e96009329777652a5316f3746f1ce382f82f9a","observation_id":"f15e36e4-9d17-4ef3-942e-a5970ca24cff","resolution":{"observed_at":"2026-08-14T15:19:32.658102Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:19:32.642336Z","title":"Four decades of research on b ent functions,","venue":null,"work_id":"910e6950-8417-4cc3-9395-1a00145e1d60","year":2016},"citing_paper":{"arxiv_id":"1908.01650","last_updated":"2019-11-20T11:45:55Z","snapshot_observed_at":"2026-08-16T03:25:16.893163Z","submitted_at":"2019-08-05T14:40:23Z","title":"Minimal linear codes from characteristic functions","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T15:19:32.149171Z"},"links":{"citing_paper":"/paper/1908.01650"},"observation_digest":"sha256:db67ee0f08079acb9ecd5f6786d2bf0e7512f4c0e800ffc87c37e4c2cf604ee9","observation_id":"30d72f72-92a0-4e26-a8a3-fb7038b78023","resolution":{"observed_at":"2026-08-14T15:19:32.646046Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:19:32.629188Z","title":"Euclidean and He rmitian LCD MDS codes,","venue":null,"work_id":"bace3943-e26f-46ef-9453-d689a4e98ba7","year":2018},"citing_paper":{"arxiv_id":"1908.01650","last_updated":"2019-11-20T11:45:55Z","snapshot_observed_at":"2026-08-16T03:25:16.893163Z","submitted_at":"2019-08-05T14:40:23Z","title":"Minimal linear codes from characteristic functions","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T15:19:32.153178Z"},"links":{"citing_paper":"/paper/1908.01650"},"observation_digest":"sha256:374d1b56a6f24cc35e160b3c330989736bbc864f54f5465722cc3467714c8968","observation_id":"6253ecde-ea74-4059-bb74-ba3eec54928d","resolution":{"observed_at":"2026-08-14T15:19:32.633359Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:19:32.616300Z","title":"Li near codes over Fq are equivalent to LCD codes for q > 3,","venue":null,"work_id":"bcd7a70d-63bf-42ee-8441-64a03b9aca44","year":2018},"citing_paper":{"arxiv_id":"1908.01650","last_updated":"2019-11-20T11:45:55Z","snapshot_observed_at":"2026-08-16T03:25:16.893163Z","submitted_at":"2019-08-05T14:40:23Z","title":"Minimal linear codes from characteristic functions","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T15:19:32.156940Z"},"links":{"citing_paper":"/paper/1908.01650"},"observation_digest":"sha256:287ddbe5229588987980034ff64788011e4935d566ffbbc33bb811c00d7fae56","observation_id":"611f67b7-7d17-4dcd-8a53-a9fe9923c348","resolution":{"observed_at":"2026-08-14T15:19:32.620342Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:19:32.602193Z","title":"Further properties of several classes of Boolean functions with optimum algebr aic immunity,","venue":null,"work_id":"8a3f0be6-45bc-4c6b-80e5-343ebda117c4","year":2009},"citing_paper":{"arxiv_id":"1908.01650","last_updated":"2019-11-20T11:45:55Z","snapshot_observed_at":"2026-08-16T03:25:16.893163Z","submitted_at":"2019-08-05T14:40:23Z","title":"Minimal linear codes from characteristic functions","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T15:19:32.160608Z"},"links":{"citing_paper":"/paper/1908.01650"},"observation_digest":"sha256:6faaf0a64ba6ea3b1be9d2cc2947225377f2c8eb5e7354a5fb49c9049b6363cf","observation_id":"296dc3a4-1aa2-4489-b0c9-5f5eff91df29","resolution":{"observed_at":"2026-08-14T15:19:32.606737Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:19:32.589237Z","title":"Towards secure two -party computation from the wire-tap channel,","venue":null,"work_id":"17883dbb-c512-4dc6-8c31-31b89aa84217","year":2013},"citing_paper":{"arxiv_id":"1908.01650","last_updated":"2019-11-20T11:45:55Z","snapshot_observed_at":"2026-08-16T03:25:16.893163Z","submitted_at":"2019-08-05T14:40:23Z","title":"Minimal linear codes from characteristic functions","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T15:19:32.164355Z"},"links":{"citing_paper":"/paper/1908.01650"},"observation_digest":"sha256:33774b3af7d6f0709b042a0a91744fcf2cbf85db961f25590d8af0571cc95472","observation_id":"c6c530ce-176a-4e6e-b372-fc11f3728e3c","resolution":{"observed_at":"2026-08-14T15:19:32.593310Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:19:32.577041Z","title":"Linear codes from simplicial co mplexes,","venue":null,"work_id":"d01973b7-f84e-4efc-9018-12601098c335","year":2018},"citing_paper":{"arxiv_id":"1908.01650","last_updated":"2019-11-20T11:45:55Z","snapshot_observed_at":"2026-08-16T03:25:16.893163Z","submitted_at":"2019-08-05T14:40:23Z","title":"Minimal linear codes from characteristic functions","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T15:19:32.168604Z"},"links":{"citing_paper":"/paper/1908.01650"},"observation_digest":"sha256:9465fed768129ce809c34327c70dd3e36f5e4f9fe293b195607910b07d0016af","observation_id":"c881d712-cb5c-4d7e-bc27-7028f75eec6b","resolution":{"observed_at":"2026-08-14T15:19:32.581025Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:19:32.563458Z","title":"On bent and semi- bent quadratic Boolean functions,","venue":null,"work_id":"80cd6827-f624-4f35-a491-2d2f8e32fc4d","year":2005},"citing_paper":{"arxiv_id":"1908.01650","last_updated":"2019-11-20T11:45:55Z","snapshot_observed_at":"2026-08-16T03:25:16.893163Z","submitted_at":"2019-08-05T14:40:23Z","title":"Minimal linear codes from characteristic functions","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T15:19:32.172397Z"},"links":{"citing_paper":"/paper/1908.01650"},"observation_digest":"sha256:e69f2f39c76de369f40597a150dca2787e7884970c360d3ee99536c6f22a4215","observation_id":"ae3885ca-f5a6-4c89-93b6-acedae9b2cb9","resolution":{"observed_at":"2026-08-14T15:19:32.567632Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:19:32.550172Z","title":"On minimal and quas i-minimal linear codes","venue":null,"work_id":"02f64c6f-a0de-405f-929d-e1507591ca40","year":2003},"citing_paper":{"arxiv_id":"1908.01650","last_updated":"2019-11-20T11:45:55Z","snapshot_observed_at":"2026-08-16T03:25:16.893163Z","submitted_at":"2019-08-05T14:40:23Z","title":"Minimal linear codes from characteristic functions","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T15:19:32.176314Z"},"links":{"citing_paper":"/paper/1908.01650"},"observation_digest":"sha256:7b3099d24af5c88cb7e2a91a7c4195bd6d6fa5924a57cd21e708848bf25f1193","observation_id":"0e88337a-3d58-4ede-8e12-1bb2f574a7fa","resolution":{"observed_at":"2026-08-14T15:19:32.554423Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:19:32.537811Z","title":"Elementary Hadamard difference sets,","venue":null,"work_id":"d5e276d8-dd99-4062-8aae-a152c41909b8","year":1974},"citing_paper":{"arxiv_id":"1908.01650","last_updated":"2019-11-20T11:45:55Z","snapshot_observed_at":"2026-08-16T03:25:16.893163Z","submitted_at":"2019-08-05T14:40:23Z","title":"Minimal linear codes from characteristic functions","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T15:19:32.180232Z"},"links":{"citing_paper":"/paper/1908.01650"},"observation_digest":"sha256:e896a37fb9d40c1c0999d4addb6c64eb41ac17524577a9f4e9cce6b77542e27a","observation_id":"4278348c-4dec-4b49-9cbe-27ea47315a62","resolution":{"observed_at":"2026-08-14T15:19:32.541976Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:19:32.525271Z","title":"Linear codes from some 2-designs,","venue":null,"work_id":"31b3ae50-be56-4361-a67f-e8f77685194f","year":2015},"citing_paper":{"arxiv_id":"1908.01650","last_updated":"2019-11-20T11:45:55Z","snapshot_observed_at":"2026-08-16T03:25:16.893163Z","submitted_at":"2019-08-05T14:40:23Z","title":"Minimal linear codes from characteristic functions","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T15:19:32.184140Z"},"links":{"citing_paper":"/paper/1908.01650"},"observation_digest":"sha256:186b1acb1f5747e37eeff7124254af5cacb0d4e65e2248b909c1fe5366a29935","observation_id":"902d5f37-636a-48cd-8734-8de028812091","resolution":{"observed_at":"2026-08-14T15:19:32.529116Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:19:32.513004Z","title":"A construction of binary linear codes from Boo lean functions,","venue":null,"work_id":"371ee721-ac0a-4696-9534-e052c190509d","year":2016},"citing_paper":{"arxiv_id":"1908.01650","last_updated":"2019-11-20T11:45:55Z","snapshot_observed_at":"2026-08-16T03:25:16.893163Z","submitted_at":"2019-08-05T14:40:23Z","title":"Minimal linear codes from characteristic functions","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T15:19:32.188162Z"},"links":{"citing_paper":"/paper/1908.01650"},"observation_digest":"sha256:166654287d6a90193441d4040d1eeda5e9201dc5eb61e6abb1f646b6c43e2e0f","observation_id":"267984a3-8da9-43e8-8618-d67f7bfedeb7","resolution":{"observed_at":"2026-08-14T15:19:32.516930Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:19:32.500070Z","title":"A Generic Construction of Cartesian Authent ication Codes,","venue":null,"work_id":"e8174c70-37c7-4028-a432-c961ff45165a","year":2007},"citing_paper":{"arxiv_id":"1908.01650","last_updated":"2019-11-20T11:45:55Z","snapshot_observed_at":"2026-08-16T03:25:16.893163Z","submitted_at":"2019-08-05T14:40:23Z","title":"Minimal linear codes from characteristic functions","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T15:19:32.191802Z"},"links":{"citing_paper":"/paper/1908.01650"},"observation_digest":"sha256:f7a6b9fc587a83698a6daa078123d1fab15f9e7a4dbed6baba227ede96965c26","observation_id":"726d79b2-b62b-417c-b7ed-6ce02755729c","resolution":{"observed_at":"2026-08-14T15:19:32.504447Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:19:32.488078Z","title":"Minimal binary linear cod es,","venue":null,"work_id":"db07cee3-ea1a-496c-93b4-1bd48a3b8289","year":2018},"citing_paper":{"arxiv_id":"1908.01650","last_updated":"2019-11-20T11:45:55Z","snapshot_observed_at":"2026-08-16T03:25:16.893163Z","submitted_at":"2019-08-05T14:40:23Z","title":"Minimal linear codes from characteristic functions","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T15:19:32.195443Z"},"links":{"citing_paper":"/paper/1908.01650"},"observation_digest":"sha256:b0c0c249f076c20cdf6fc6480a30d5fb19a55766c3a2c2969791e94ce2fefbb6","observation_id":"61dfc468-ca28-45d1-8143-24d7fd2c97b6","resolution":{"observed_at":"2026-08-14T15:19:32.491756Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:19:32.475569Z","title":"Covering and secret sharing with li near codes,","venue":null,"work_id":"180d4f88-45c7-4138-b0b6-f375ff68544e","year":2003},"citing_paper":{"arxiv_id":"1908.01650","last_updated":"2019-11-20T11:45:55Z","snapshot_observed_at":"2026-08-16T03:25:16.893163Z","submitted_at":"2019-08-05T14:40:23Z","title":"Minimal linear codes from characteristic functions","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T15:19:32.199411Z"},"links":{"citing_paper":"/paper/1908.01650"},"observation_digest":"sha256:fdd637bda17cb0d8b6f3bae8619f900948505cdbe9161ec70ac6f2e3caaa72d6","observation_id":"d76660b0-b6e4-4742-88b8-cf942a593d79","resolution":{"observed_at":"2026-08-14T15:19:32.479477Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:19:32.462460Z","title":"A coding theory construction of new systematic authentication codes,","venue":null,"work_id":"325c24f4-abff-432c-9253-0b53e6e6fc46","year":2005},"citing_paper":{"arxiv_id":"1908.01650","last_updated":"2019-11-20T11:45:55Z","snapshot_observed_at":"2026-08-16T03:25:16.893163Z","submitted_at":"2019-08-05T14:40:23Z","title":"Minimal linear codes from characteristic functions","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T15:19:32.203408Z"},"links":{"citing_paper":"/paper/1908.01650"},"observation_digest":"sha256:00f865801dd74340149612de489b83a1d5d4dd6b37f966c9b16702a33d1a85d7","observation_id":"1bd5d4a1-6a70-4ebf-8fbd-dce83ce1f5ea","resolution":{"observed_at":"2026-08-14T15:19:32.466931Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:19:32.449435Z","title":"Minimal linear codes over finite fields,","venue":null,"work_id":"7c2ee71a-6639-475a-a92d-e330fe95367d","year":null},"citing_paper":{"arxiv_id":"1908.01650","last_updated":"2019-11-20T11:45:55Z","snapshot_observed_at":"2026-08-16T03:25:16.893163Z","submitted_at":"2019-08-05T14:40:23Z","title":"Minimal linear codes from characteristic functions","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T15:19:32.207758Z"},"links":{"citing_paper":"/paper/1908.01650"},"observation_digest":"sha256:8f93f56e86d6fa22c0c98d18cdc36e46de372e2cd49cc74d8bb5e53a9df42b3c","observation_id":"0b24f877-3e35-4555-8c30-1f78acdcffe7","resolution":{"observed_at":"2026-08-14T15:19:32.453439Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:19:32.437158Z","title":null,"venue":null,"work_id":"6606712d-d082-48d3-9404-efb41dd6d2b9","year":1977},"citing_paper":{"arxiv_id":"1908.01650","last_updated":"2019-11-20T11:45:55Z","snapshot_observed_at":"2026-08-16T03:25:16.893163Z","submitted_at":"2019-08-05T14:40:23Z","title":"Minimal linear codes from characteristic functions","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T15:19:32.212113Z"},"links":{"citing_paper":"/paper/1908.01650"},"observation_digest":"sha256:9321ece7500436178a5ce9df2165feece4e1caec0e9c84206ba5c5229178cd73","observation_id":"77fd224d-60c0-4dcc-bbbe-756edbbfe914","resolution":{"observed_at":"2026-08-14T15:19:32.440897Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:19:32.424891Z","title":"A family of difference sets in non-cyc lic groups,","venue":null,"work_id":"246c82bc-d931-438f-9346-3cff85ee2ab9","year":1973},"citing_paper":{"arxiv_id":"1908.01650","last_updated":"2019-11-20T11:45:55Z","snapshot_observed_at":"2026-08-16T03:25:16.893163Z","submitted_at":"2019-08-05T14:40:23Z","title":"Minimal linear codes from characteristic functions","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T15:19:32.216093Z"},"links":{"citing_paper":"/paper/1908.01650"},"observation_digest":"sha256:f5608026bf321b9c7b6a315ded3158480d8ed0701b1ace7bdbd2b931bac0b7f5","observation_id":"9f5f924b-d450-43d0-b3fa-962897d61d66","resolution":{"observed_at":"2026-08-14T15:19:32.428804Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:19:32.412518Z","title":"Minimal codewords and secret sharing,","venue":null,"work_id":"4d2185fc-bb1a-4dbf-a65f-8a5306ff5600","year":1993},"citing_paper":{"arxiv_id":"1908.01650","last_updated":"2019-11-20T11:45:55Z","snapshot_observed_at":"2026-08-16T03:25:16.893163Z","submitted_at":"2019-08-05T14:40:23Z","title":"Minimal linear codes from characteristic functions","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T15:19:32.220092Z"},"links":{"citing_paper":"/paper/1908.01650"},"observation_digest":"sha256:a1e56abac0fbce53cbf978214afaf85a6c9ff06127070ba513d3c2d2a600a939","observation_id":"e56731de-c047-4ed7-a884-2b5a63e7ff39","resolution":{"observed_at":"2026-08-14T15:19:32.416212Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:19:32.399334Z","title":"Bent functions: fundamentals and result s,","venue":null,"work_id":"7fe240ed-f721-476e-aba8-49cb64257c15","year":2016},"citing_paper":{"arxiv_id":"1908.01650","last_updated":"2019-11-20T11:45:55Z","snapshot_observed_at":"2026-08-16T03:25:16.893163Z","submitted_at":"2019-08-05T14:40:23Z","title":"Minimal linear codes from characteristic functions","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T15:19:32.224510Z"},"links":{"citing_paper":"/paper/1908.01650"},"observation_digest":"sha256:2802ada6eedf380bee571247562cdabeb0dc995f5e744940243d327f7e62958d","observation_id":"c04fd58b-bb6d-41c5-ad2a-fa98a9a65a2a","resolution":{"observed_at":"2026-08-14T15:19:32.403663Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:19:32.386218Z","title":"Linear codes with few weights from weakly regular bent functions based on a generic construction,","venue":null,"work_id":"9cdb90a5-b59c-4b6f-bace-dc11b7d46b5b","year":2017},"citing_paper":{"arxiv_id":"1908.01650","last_updated":"2019-11-20T11:45:55Z","snapshot_observed_at":"2026-08-16T03:25:16.893163Z","submitted_at":"2019-08-05T14:40:23Z","title":"Minimal linear codes from characteristic functions","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T15:19:32.228152Z"},"links":{"citing_paper":"/paper/1908.01650"},"observation_digest":"sha256:a07569e92ccf8a7eda4115f32f9cc34158963856f5dd22cc46a4bebb8e2a8842","observation_id":"8768c750-667c-4d49-8ae0-99b1e891f19f","resolution":{"observed_at":"2026-08-14T15:19:32.390571Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:19:32.373190Z","title":"Complementary dual algebr aic geometry codes,","venue":null,"work_id":"4e262938-1758-44a5-9543-b0287128a181","year":2018},"citing_paper":{"arxiv_id":"1908.01650","last_updated":"2019-11-20T11:45:55Z","snapshot_observed_at":"2026-08-16T03:25:16.893163Z","submitted_at":"2019-08-05T14:40:23Z","title":"Minimal linear codes from characteristic functions","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T15:19:32.231952Z"},"links":{"citing_paper":"/paper/1908.01650"},"observation_digest":"sha256:e33586c8ace8aaecd095d0a16af8939fa2b209e6c6e48f2079ce80e46b37c78e","observation_id":"98598e8c-1bff-4cb1-8620-363f20898193","resolution":{"observed_at":"2026-08-14T15:19:32.377233Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:19:32.358870Z","title":"Linear codes from we akly regular plateaued functions and their secret sharing s chemes,","venue":null,"work_id":"adaf8edd-a243-48cb-82fc-bc9792f32959","year":2019},"citing_paper":{"arxiv_id":"1908.01650","last_updated":"2019-11-20T11:45:55Z","snapshot_observed_at":"2026-08-16T03:25:16.893163Z","submitted_at":"2019-08-05T14:40:23Z","title":"Minimal linear codes from characteristic functions","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T15:19:32.235864Z"},"links":{"citing_paper":"/paper/1908.01650"},"observation_digest":"sha256:bfbcf2423c12ee8022953b0404ed5421788590b0d6f194bf5c1c898743b6afa7","observation_id":"5895ccfd-d443-456c-8f23-eed411023e78","resolution":{"observed_at":"2026-08-14T15:19:32.363583Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:19:32.344131Z","title":"Upp er and lower bounds on maximum nonlinearity of n-input m-out put Boolean function,","venue":null,"work_id":"f2cd1181-7696-4f03-846a-38c670594d4c","year":2001},"citing_paper":{"arxiv_id":"1908.01650","last_updated":"2019-11-20T11:45:55Z","snapshot_observed_at":"2026-08-16T03:25:16.893163Z","submitted_at":"2019-08-05T14:40:23Z","title":"Minimal linear codes from characteristic functions","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T15:19:32.239799Z"},"links":{"citing_paper":"/paper/1908.01650"},"observation_digest":"sha256:e17c5b5db646361b33f20b18bf912468157a091605e94daf6c656495882710b0","observation_id":"3e600e1c-dec6-4ae1-a38a-f0a41393442e","resolution":{"observed_at":"2026-08-14T15:19:32.348295Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:19:32.329641Z","title":"Three classes of minimal linear codes over the finite fields of odd characteristic,","venue":null,"work_id":"f4134989-f033-4f9e-9b92-f64ffb79d75b","year":2019},"citing_paper":{"arxiv_id":"1908.01650","last_updated":"2019-11-20T11:45:55Z","snapshot_observed_at":"2026-08-16T03:25:16.893163Z","submitted_at":"2019-08-05T14:40:23Z","title":"Minimal linear codes from characteristic functions","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T15:19:32.243580Z"},"links":{"citing_paper":"/paper/1908.01650"},"observation_digest":"sha256:cb0449ad14ed568fa30d6aa960aec9afa1206984a3026efa39c1ad38c112c537","observation_id":"490beaa2-abfe-405b-84a5-e93c5802f43e","resolution":{"observed_at":"2026-08-14T15:19:32.334131Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:19:32.315926Z","title":"Secret sharing schemes from three c lasses of linear codes,","venue":null,"work_id":"7774dc69-1b3a-4670-991e-b19f9f77ec23","year":2006},"citing_paper":{"arxiv_id":"1908.01650","last_updated":"2019-11-20T11:45:55Z","snapshot_observed_at":"2026-08-16T03:25:16.893163Z","submitted_at":"2019-08-05T14:40:23Z","title":"Minimal linear codes from characteristic functions","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T15:19:32.247526Z"},"links":{"citing_paper":"/paper/1908.01650"},"observation_digest":"sha256:ad507ef62069fadfa68968c7dc433c99c02ac3ef701f7a3ec3ea42042053ce9b","observation_id":"977ae806-6e13-431c-8414-2c4d586cbc8e","resolution":{"observed_at":"2026-08-14T15:19:32.320065Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:19:32.301976Z","title":"Four families of minimal bi nary linear codes with wmin/w max ≤ 1/ 2,","venue":null,"work_id":"60d97496-5cc2-4f9a-876d-42d0aa99a369","year":2019},"citing_paper":{"arxiv_id":"1908.01650","last_updated":"2019-11-20T11:45:55Z","snapshot_observed_at":"2026-08-16T03:25:16.893163Z","submitted_at":"2019-08-05T14:40:23Z","title":"Minimal linear codes from characteristic functions","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T15:19:32.251314Z"},"links":{"citing_paper":"/paper/1908.01650"},"observation_digest":"sha256:5ed2f12dba00b3af4807f8b90a8dd1069344d75c15213ad95a3a93dd70edf05d","observation_id":"d18ed121-8639-43f9-b3d4-64a29e0ead0f","resolution":{"observed_at":"2026-08-14T15:19:32.306552Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:19:32.285853Z","title":"Binary LCD codes and sel f-orthogonal codes from a generic construction,","venue":null,"work_id":"310baab6-cf4c-4732-bc33-3f9d61286626","year":2019},"citing_paper":{"arxiv_id":"1908.01650","last_updated":"2019-11-20T11:45:55Z","snapshot_observed_at":"2026-08-16T03:25:16.893163Z","submitted_at":"2019-08-05T14:40:23Z","title":"Minimal linear codes from characteristic functions","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-14T15:19:32.255118Z"},"links":{"citing_paper":"/paper/1908.01650"},"observation_digest":"sha256:fac2d4c19746065c16dda00c7036de20771360978e2adf7b7444814754c9fbcf","observation_id":"8a58fbc0-a66e-482b-9e37-b17b0d742d39","resolution":{"observed_at":"2026-08-14T15:19:32.292002Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.01650","last_updated":"2019-11-20T11:45:55Z","latest_version":2,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-16T03:25:16.893163Z","submitted_at":"2019-08-05T14:40:23Z","title":"Minimal linear codes from characteristic functions"},"reference_resolution":{"displayed":39,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":0,"verified_fuzzy":38},"total_outbound_references":39},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 39 of 39 outbound references and 0 inbound Pith citation observations for arXiv:1908.01650."}