{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KFUCGPED3QXQIBRBQU2DGWHGZA","short_pith_number":"pith:KFUCGPED","canonical_record":{"source":{"id":"1509.02999","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-10T03:46:55Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"08721ca437683c5b808958ab80e5f3475af082d561949286217ee74b0d636cb5","abstract_canon_sha256":"a4677cf6ef9e220dd77ed8e7695dd8a4d3c2cd654a003fbab95a4a4dadb65417"},"schema_version":"1.0"},"canonical_sha256":"5168233c83dc2f04062185343358e6c8165227ee9e92ce4cc7f42fdf91879c8e","source":{"kind":"arxiv","id":"1509.02999","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.02999","created_at":"2026-05-18T00:13:38Z"},{"alias_kind":"arxiv_version","alias_value":"1509.02999v2","created_at":"2026-05-18T00:13:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02999","created_at":"2026-05-18T00:13:38Z"},{"alias_kind":"pith_short_12","alias_value":"KFUCGPED3QXQ","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"KFUCGPED3QXQIBRB","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"KFUCGPED","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KFUCGPED3QXQIBRBQU2DGWHGZA","target":"record","payload":{"canonical_record":{"source":{"id":"1509.02999","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-10T03:46:55Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"08721ca437683c5b808958ab80e5f3475af082d561949286217ee74b0d636cb5","abstract_canon_sha256":"a4677cf6ef9e220dd77ed8e7695dd8a4d3c2cd654a003fbab95a4a4dadb65417"},"schema_version":"1.0"},"canonical_sha256":"5168233c83dc2f04062185343358e6c8165227ee9e92ce4cc7f42fdf91879c8e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:38.278091Z","signature_b64":"Ex7j4iB+dAJ1OrrnUnzky4v+BO9fGb/rpmXYawO1QH0RLz8EfB0m23OeTw4IYaCkkuN9VNtJK/yMfs6VRb6XBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5168233c83dc2f04062185343358e6c8165227ee9e92ce4cc7f42fdf91879c8e","last_reissued_at":"2026-05-18T00:13:38.277456Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:38.277456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.02999","source_version":2,"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-18T00:13:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0bmj+xl22BTmDvIWBCfNjTPeCOTJyH/tgENdoHIl8NoCkoejMiz+DyGDP4lgfyi8acIudk4mPAv9YpAtfz/7AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:44:10.356797Z"},"content_sha256":"e032c2151887072334598d7a263f3f7294f4a8e460d68812aa9627643986281e","schema_version":"1.0","event_id":"sha256:e032c2151887072334598d7a263f3f7294f4a8e460d68812aa9627643986281e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KFUCGPED3QXQIBRBQU2DGWHGZA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complex spherical codes with three inner products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.CO","authors_text":"Hiroshi Nozaki, Sho Suda","submitted_at":"2015-09-10T03:46:55Z","abstract_excerpt":"Let $X$ be a finite set in a complex sphere of $d$ dimension. Let $D(X)$ be the set of usual inner products of two distinct vectors in $X$. A set $X$ is called a complex spherical $s$-code if the cardinality of $D(X)$ is $s$ and $D(X)$ contains an imaginary number. We would like to classify the largest possible $s$-codes for given dimension $d$. In this paper, we consider the problem for the case $s=3$. Roy and Suda (2014) gave a certain upper bound for the cardinalities of $3$-codes. A $3$-code $X$ is said to be tight if $X$ attains the bound. We show that there exists no tight $3$-code excep"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.02999","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":""},"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-18T00:13:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rq6TAzFyhQ1Giv620UCEyGOQsJ2TxEhM0fX49+gaoIkuyH60qn4QTStfgsdewPazZ6Ja57IpZW9WGeLGM9IUCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:44:10.357251Z"},"content_sha256":"975e31478a5d091bb339cb3ddcc6817454868acd83bbc79d01dbbc597250741a","schema_version":"1.0","event_id":"sha256:975e31478a5d091bb339cb3ddcc6817454868acd83bbc79d01dbbc597250741a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KFUCGPED3QXQIBRBQU2DGWHGZA/bundle.json","state_url":"https://pith.science/pith/KFUCGPED3QXQIBRBQU2DGWHGZA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KFUCGPED3QXQIBRBQU2DGWHGZA/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-25T21:44:10Z","links":{"resolver":"https://pith.science/pith/KFUCGPED3QXQIBRBQU2DGWHGZA","bundle":"https://pith.science/pith/KFUCGPED3QXQIBRBQU2DGWHGZA/bundle.json","state":"https://pith.science/pith/KFUCGPED3QXQIBRBQU2DGWHGZA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KFUCGPED3QXQIBRBQU2DGWHGZA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KFUCGPED3QXQIBRBQU2DGWHGZA","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":"a4677cf6ef9e220dd77ed8e7695dd8a4d3c2cd654a003fbab95a4a4dadb65417","cross_cats_sorted":["math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-10T03:46:55Z","title_canon_sha256":"08721ca437683c5b808958ab80e5f3475af082d561949286217ee74b0d636cb5"},"schema_version":"1.0","source":{"id":"1509.02999","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.02999","created_at":"2026-05-18T00:13:38Z"},{"alias_kind":"arxiv_version","alias_value":"1509.02999v2","created_at":"2026-05-18T00:13:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02999","created_at":"2026-05-18T00:13:38Z"},{"alias_kind":"pith_short_12","alias_value":"KFUCGPED3QXQ","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"KFUCGPED3QXQIBRB","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"KFUCGPED","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:975e31478a5d091bb339cb3ddcc6817454868acd83bbc79d01dbbc597250741a","target":"graph","created_at":"2026-05-18T00:13:38Z","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":"Let $X$ be a finite set in a complex sphere of $d$ dimension. Let $D(X)$ be the set of usual inner products of two distinct vectors in $X$. A set $X$ is called a complex spherical $s$-code if the cardinality of $D(X)$ is $s$ and $D(X)$ contains an imaginary number. We would like to classify the largest possible $s$-codes for given dimension $d$. In this paper, we consider the problem for the case $s=3$. Roy and Suda (2014) gave a certain upper bound for the cardinalities of $3$-codes. A $3$-code $X$ is said to be tight if $X$ attains the bound. We show that there exists no tight $3$-code excep","authors_text":"Hiroshi Nozaki, Sho Suda","cross_cats":["math.MG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-10T03:46:55Z","title":"Complex spherical codes with three inner products"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.02999","kind":"arxiv","version":2},"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:e032c2151887072334598d7a263f3f7294f4a8e460d68812aa9627643986281e","target":"record","created_at":"2026-05-18T00:13:38Z","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":"a4677cf6ef9e220dd77ed8e7695dd8a4d3c2cd654a003fbab95a4a4dadb65417","cross_cats_sorted":["math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-10T03:46:55Z","title_canon_sha256":"08721ca437683c5b808958ab80e5f3475af082d561949286217ee74b0d636cb5"},"schema_version":"1.0","source":{"id":"1509.02999","kind":"arxiv","version":2}},"canonical_sha256":"5168233c83dc2f04062185343358e6c8165227ee9e92ce4cc7f42fdf91879c8e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5168233c83dc2f04062185343358e6c8165227ee9e92ce4cc7f42fdf91879c8e","first_computed_at":"2026-05-18T00:13:38.277456Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:38.277456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ex7j4iB+dAJ1OrrnUnzky4v+BO9fGb/rpmXYawO1QH0RLz8EfB0m23OeTw4IYaCkkuN9VNtJK/yMfs6VRb6XBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:38.278091Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.02999","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e032c2151887072334598d7a263f3f7294f4a8e460d68812aa9627643986281e","sha256:975e31478a5d091bb339cb3ddcc6817454868acd83bbc79d01dbbc597250741a"],"state_sha256":"d0d2dba4834974dcb149686d817860d73a5037418cd6f03be0446c40a259aeee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B42fMaLCgmqYW7Pob8uVUVople9IcuEMCPPq73bS6gT7iulLHKNigPiSZ7GWSFkejF1wmr3zxPZvvp3y+DwIBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T21:44:10.360784Z","bundle_sha256":"b9248dd23868ec30730769f28c4c7f7ee9fac6a125e9152da08e462ea1c26487"}}