{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:DC7OOFU4EV3NUXKNRYRBIYRDZH","short_pith_number":"pith:DC7OOFU4","canonical_record":{"source":{"id":"1905.10504","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-25T02:55:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3cb3ca6c9f090b184e84c01dceae9188e06dbc331d48d7ff3f868e70b4479507","abstract_canon_sha256":"f9c41f7b58890fc9429868d1c5bc5870e12236445c4c448499218efbe751d130"},"schema_version":"1.0"},"canonical_sha256":"18bee7169c2576da5d4d8e22146223c9d375f34e066714dbb998efbf90b17071","source":{"kind":"arxiv","id":"1905.10504","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.10504","created_at":"2026-05-17T23:45:08Z"},{"alias_kind":"arxiv_version","alias_value":"1905.10504v1","created_at":"2026-05-17T23:45:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10504","created_at":"2026-05-17T23:45:08Z"},{"alias_kind":"pith_short_12","alias_value":"DC7OOFU4EV3N","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"DC7OOFU4EV3NUXKN","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"DC7OOFU4","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:DC7OOFU4EV3NUXKNRYRBIYRDZH","target":"record","payload":{"canonical_record":{"source":{"id":"1905.10504","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-25T02:55:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3cb3ca6c9f090b184e84c01dceae9188e06dbc331d48d7ff3f868e70b4479507","abstract_canon_sha256":"f9c41f7b58890fc9429868d1c5bc5870e12236445c4c448499218efbe751d130"},"schema_version":"1.0"},"canonical_sha256":"18bee7169c2576da5d4d8e22146223c9d375f34e066714dbb998efbf90b17071","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:08.286917Z","signature_b64":"vm5+8hf1k0qNf+djAqMmQT2Psd2hfCUTavB5dEF3elyitTPeJkagj+e/xfVlkkP0NxBnLgyZ9qUTSX0Lm7hYAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18bee7169c2576da5d4d8e22146223c9d375f34e066714dbb998efbf90b17071","last_reissued_at":"2026-05-17T23:45:08.286103Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:08.286103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.10504","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:45:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pS4gJM53yMcW9S2JzVeb6QkjJDAmDgS4m166yIN/2quyu6GP9pKZIj2j/yEiD6ZzwCzFX+2x11jCYRelUfJFBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:35:35.544910Z"},"content_sha256":"3864a1df11c68f0af80afcabeb5618071c4a55b993774cefa863d6907a005367","schema_version":"1.0","event_id":"sha256:3864a1df11c68f0af80afcabeb5618071c4a55b993774cefa863d6907a005367"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:DC7OOFU4EV3NUXKNRYRBIYRDZH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On constructions and properties of $(n,m)$-functions with maximal number of bent components","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Haibin Kan, Jie Peng, Juan Luo, Lijing Zheng, Yanjun Li","submitted_at":"2019-05-25T02:55:51Z","abstract_excerpt":"For any positive integers $n=2k$ and $m$ such that $m\\geq k$, in this paper we show the maximal number of bent components of any $(n,m)$-functions is equal to $2^{m}-2^{m-k}$, and for those attaining the equality, their algebraic degree is at most $k$. It is easily seen that all $(n,m)$-functions of the form $G(x)=(F(x),0)$ with $F(x)$ being any vectorial bent $(n,k)$-function, have the maximum number of bent components. Those simple functions $G$ are called trivial in this paper. We show that for a power $(n,n)$-function, it has such large number of bent components if and only if it is trivia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10504","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:45:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qEIFjK+LLTdOm2fLHyZ9u2aHZK/ezTp281eORsFUBvs/n2MoJIR9uK2YHaPa8feVJCx2Wznm+jhnmCrer5YjBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:35:35.545416Z"},"content_sha256":"3b60ebede1ba763e3f8de6d406a41881ef2af8527cd0ef292d87cb8dec07851c","schema_version":"1.0","event_id":"sha256:3b60ebede1ba763e3f8de6d406a41881ef2af8527cd0ef292d87cb8dec07851c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DC7OOFU4EV3NUXKNRYRBIYRDZH/bundle.json","state_url":"https://pith.science/pith/DC7OOFU4EV3NUXKNRYRBIYRDZH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DC7OOFU4EV3NUXKNRYRBIYRDZH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T11:35:35Z","links":{"resolver":"https://pith.science/pith/DC7OOFU4EV3NUXKNRYRBIYRDZH","bundle":"https://pith.science/pith/DC7OOFU4EV3NUXKNRYRBIYRDZH/bundle.json","state":"https://pith.science/pith/DC7OOFU4EV3NUXKNRYRBIYRDZH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DC7OOFU4EV3NUXKNRYRBIYRDZH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:DC7OOFU4EV3NUXKNRYRBIYRDZH","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f9c41f7b58890fc9429868d1c5bc5870e12236445c4c448499218efbe751d130","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-25T02:55:51Z","title_canon_sha256":"3cb3ca6c9f090b184e84c01dceae9188e06dbc331d48d7ff3f868e70b4479507"},"schema_version":"1.0","source":{"id":"1905.10504","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.10504","created_at":"2026-05-17T23:45:08Z"},{"alias_kind":"arxiv_version","alias_value":"1905.10504v1","created_at":"2026-05-17T23:45:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10504","created_at":"2026-05-17T23:45:08Z"},{"alias_kind":"pith_short_12","alias_value":"DC7OOFU4EV3N","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"DC7OOFU4EV3NUXKN","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"DC7OOFU4","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:3b60ebede1ba763e3f8de6d406a41881ef2af8527cd0ef292d87cb8dec07851c","target":"graph","created_at":"2026-05-17T23:45:08Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"For any positive integers $n=2k$ and $m$ such that $m\\geq k$, in this paper we show the maximal number of bent components of any $(n,m)$-functions is equal to $2^{m}-2^{m-k}$, and for those attaining the equality, their algebraic degree is at most $k$. It is easily seen that all $(n,m)$-functions of the form $G(x)=(F(x),0)$ with $F(x)$ being any vectorial bent $(n,k)$-function, have the maximum number of bent components. Those simple functions $G$ are called trivial in this paper. We show that for a power $(n,n)$-function, it has such large number of bent components if and only if it is trivia","authors_text":"Haibin Kan, Jie Peng, Juan Luo, Lijing Zheng, Yanjun Li","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-25T02:55:51Z","title":"On constructions and properties of $(n,m)$-functions with maximal number of bent components"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10504","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3864a1df11c68f0af80afcabeb5618071c4a55b993774cefa863d6907a005367","target":"record","created_at":"2026-05-17T23:45:08Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f9c41f7b58890fc9429868d1c5bc5870e12236445c4c448499218efbe751d130","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-25T02:55:51Z","title_canon_sha256":"3cb3ca6c9f090b184e84c01dceae9188e06dbc331d48d7ff3f868e70b4479507"},"schema_version":"1.0","source":{"id":"1905.10504","kind":"arxiv","version":1}},"canonical_sha256":"18bee7169c2576da5d4d8e22146223c9d375f34e066714dbb998efbf90b17071","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"18bee7169c2576da5d4d8e22146223c9d375f34e066714dbb998efbf90b17071","first_computed_at":"2026-05-17T23:45:08.286103Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:08.286103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vm5+8hf1k0qNf+djAqMmQT2Psd2hfCUTavB5dEF3elyitTPeJkagj+e/xfVlkkP0NxBnLgyZ9qUTSX0Lm7hYAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:08.286917Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.10504","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3864a1df11c68f0af80afcabeb5618071c4a55b993774cefa863d6907a005367","sha256:3b60ebede1ba763e3f8de6d406a41881ef2af8527cd0ef292d87cb8dec07851c"],"state_sha256":"43fd2e076e16f500c411e65d49000a2a56644acec50f46ef0ba41fd5c7e27e2e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dnJefmeiKFPhR0veyYy55ezE7h/R7mxMSvLv2Nk6nTIGEOTA7u9CfKaRI+6+W70f0DWVOnibGyvAs6GkPyqLAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:35:35.548529Z","bundle_sha256":"b9666b2637eee119b0d5fdf1ae7608e51e5a73fed7382bf4c31925012c173ec9"}}