{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:YMHUPYZSDMAO4FP64RTTNLTZB2","short_pith_number":"pith:YMHUPYZS","canonical_record":{"source":{"id":"1205.5876","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-26T11:47:43Z","cross_cats_sorted":[],"title_canon_sha256":"0fa39564c7a8e8707af26d2df56666cc5d81757a833a86a3afbd7031a9fb7a1c","abstract_canon_sha256":"5cabe239fb309f206f147a19dcdaf281604080fb9c71e75ee1934eaffee07dcb"},"schema_version":"1.0"},"canonical_sha256":"c30f47e3321b00ee15fee46736ae790e96e51f1c8d48cc3a67ff6f353b12701d","source":{"kind":"arxiv","id":"1205.5876","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.5876","created_at":"2026-05-18T03:28:06Z"},{"alias_kind":"arxiv_version","alias_value":"1205.5876v3","created_at":"2026-05-18T03:28:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.5876","created_at":"2026-05-18T03:28:06Z"},{"alias_kind":"pith_short_12","alias_value":"YMHUPYZSDMAO","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"YMHUPYZSDMAO4FP6","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"YMHUPYZS","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:YMHUPYZSDMAO4FP64RTTNLTZB2","target":"record","payload":{"canonical_record":{"source":{"id":"1205.5876","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-26T11:47:43Z","cross_cats_sorted":[],"title_canon_sha256":"0fa39564c7a8e8707af26d2df56666cc5d81757a833a86a3afbd7031a9fb7a1c","abstract_canon_sha256":"5cabe239fb309f206f147a19dcdaf281604080fb9c71e75ee1934eaffee07dcb"},"schema_version":"1.0"},"canonical_sha256":"c30f47e3321b00ee15fee46736ae790e96e51f1c8d48cc3a67ff6f353b12701d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:06.065040Z","signature_b64":"9c4bh1CX5k98ysDRvRFxfD6N0WoR5D4kPYiovkeA/gVWjzaKeQn//o8BQKYCPhyRO1mQdwYN2qZb68HJqZFvCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c30f47e3321b00ee15fee46736ae790e96e51f1c8d48cc3a67ff6f353b12701d","last_reissued_at":"2026-05-18T03:28:06.064211Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:06.064211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.5876","source_version":3,"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-18T03:28:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZcCGzpawgl0tLcuSMIpRwVxPiTnOCsr6UNhXf6/IuIMhT2V+fy3GKyskGlx9PM4OWHZhUs/W3qMR390Lhxp9DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T08:43:59.691443Z"},"content_sha256":"eedfd4c8094e883360fb78643386d84a77aa77f6cba1b9d072eb3e60eff3b0ad","schema_version":"1.0","event_id":"sha256:eedfd4c8094e883360fb78643386d84a77aa77f6cba1b9d072eb3e60eff3b0ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:YMHUPYZSDMAO4FP64RTTNLTZB2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On optimality of designs with three distinct eigenvalues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"E. Ghorbani, G. B. Khosrovshahi, M. R. Faghihi, S. Tat","submitted_at":"2012-05-26T11:47:43Z","abstract_excerpt":"Let $\\D_{v,b,k}$ denote the family of all connected block designs with $v$ treatments and $b$ blocks of size $k$. Let $d\\in\\D_{v,b,k}$. The replication of a treatment is the number of times it appears in the blocks of $d$. The matrix $C(d)=R(d)-\\frac{1}{k}N(d)N(d)^\\top$ is called the information matrix of $d$ where $N(d)$ is the incidence matrix of $d$ and $R(d)$ is a diagonal matrix of the replications. Since $d$ is connected, $C(d)$ has $v-1$ nonzero eigenvalues $\\mu_1(d),...,\\mu_{v-1}(d)$. Let $\\D$ be the class of all binary designs of $\\D_{v,b,k}$. We prove that if there is a design $d^*\\i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.5876","kind":"arxiv","version":3},"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-18T03:28:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yq2jinxOzbGRjuqebWyg5dZ8t7RQwWty6cjonzFtCiaovHn7ka95a+GX6uK3SfHVBU4EOWDymSF6XZLKsg5BCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T08:43:59.691788Z"},"content_sha256":"78d84a08e2176179ff3cf673d6bd98c5db837b3ae27078e8cdc01fe8cf579d86","schema_version":"1.0","event_id":"sha256:78d84a08e2176179ff3cf673d6bd98c5db837b3ae27078e8cdc01fe8cf579d86"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YMHUPYZSDMAO4FP64RTTNLTZB2/bundle.json","state_url":"https://pith.science/pith/YMHUPYZSDMAO4FP64RTTNLTZB2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YMHUPYZSDMAO4FP64RTTNLTZB2/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-06-23T08:43:59Z","links":{"resolver":"https://pith.science/pith/YMHUPYZSDMAO4FP64RTTNLTZB2","bundle":"https://pith.science/pith/YMHUPYZSDMAO4FP64RTTNLTZB2/bundle.json","state":"https://pith.science/pith/YMHUPYZSDMAO4FP64RTTNLTZB2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YMHUPYZSDMAO4FP64RTTNLTZB2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:YMHUPYZSDMAO4FP64RTTNLTZB2","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":"5cabe239fb309f206f147a19dcdaf281604080fb9c71e75ee1934eaffee07dcb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-26T11:47:43Z","title_canon_sha256":"0fa39564c7a8e8707af26d2df56666cc5d81757a833a86a3afbd7031a9fb7a1c"},"schema_version":"1.0","source":{"id":"1205.5876","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.5876","created_at":"2026-05-18T03:28:06Z"},{"alias_kind":"arxiv_version","alias_value":"1205.5876v3","created_at":"2026-05-18T03:28:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.5876","created_at":"2026-05-18T03:28:06Z"},{"alias_kind":"pith_short_12","alias_value":"YMHUPYZSDMAO","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"YMHUPYZSDMAO4FP6","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"YMHUPYZS","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:78d84a08e2176179ff3cf673d6bd98c5db837b3ae27078e8cdc01fe8cf579d86","target":"graph","created_at":"2026-05-18T03:28:06Z","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 $\\D_{v,b,k}$ denote the family of all connected block designs with $v$ treatments and $b$ blocks of size $k$. Let $d\\in\\D_{v,b,k}$. The replication of a treatment is the number of times it appears in the blocks of $d$. The matrix $C(d)=R(d)-\\frac{1}{k}N(d)N(d)^\\top$ is called the information matrix of $d$ where $N(d)$ is the incidence matrix of $d$ and $R(d)$ is a diagonal matrix of the replications. Since $d$ is connected, $C(d)$ has $v-1$ nonzero eigenvalues $\\mu_1(d),...,\\mu_{v-1}(d)$. Let $\\D$ be the class of all binary designs of $\\D_{v,b,k}$. We prove that if there is a design $d^*\\i","authors_text":"E. Ghorbani, G. B. Khosrovshahi, M. R. Faghihi, S. Tat","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-26T11:47:43Z","title":"On optimality of designs with three distinct eigenvalues"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.5876","kind":"arxiv","version":3},"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:eedfd4c8094e883360fb78643386d84a77aa77f6cba1b9d072eb3e60eff3b0ad","target":"record","created_at":"2026-05-18T03:28:06Z","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":"5cabe239fb309f206f147a19dcdaf281604080fb9c71e75ee1934eaffee07dcb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-26T11:47:43Z","title_canon_sha256":"0fa39564c7a8e8707af26d2df56666cc5d81757a833a86a3afbd7031a9fb7a1c"},"schema_version":"1.0","source":{"id":"1205.5876","kind":"arxiv","version":3}},"canonical_sha256":"c30f47e3321b00ee15fee46736ae790e96e51f1c8d48cc3a67ff6f353b12701d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c30f47e3321b00ee15fee46736ae790e96e51f1c8d48cc3a67ff6f353b12701d","first_computed_at":"2026-05-18T03:28:06.064211Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:28:06.064211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9c4bh1CX5k98ysDRvRFxfD6N0WoR5D4kPYiovkeA/gVWjzaKeQn//o8BQKYCPhyRO1mQdwYN2qZb68HJqZFvCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:28:06.065040Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.5876","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eedfd4c8094e883360fb78643386d84a77aa77f6cba1b9d072eb3e60eff3b0ad","sha256:78d84a08e2176179ff3cf673d6bd98c5db837b3ae27078e8cdc01fe8cf579d86"],"state_sha256":"e51857d65ab389049bb1f5894b0bd53a73e07a65b99ec1d19f25e54517213238"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VbMx1qs8/s2w47QNH53ACVzAv1Mn5FxUgvwUmna9toV926utTqL5Si1j+BP46gPStDblRqhiMWug8aTpdtNeCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T08:43:59.693773Z","bundle_sha256":"629747b8ae2e287a39f54c60b5afe6a526393efe4c222f9e73e7dc3f0f3e6747"}}