{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:M22MKQL2MDXUSG7BXFFVX7PBRU","short_pith_number":"pith:M22MKQL2","schema_version":"1.0","canonical_sha256":"66b4c5417a60ef491be1b94b5bfde18d02503f370a9b6754374a2b3adfd73b9a","source":{"kind":"arxiv","id":"1202.5627","version":1},"attestation_state":"computed","paper":{"title":"On $Q$-polynomial association schemes of small class","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sho Suda","submitted_at":"2012-02-25T08:15:48Z","abstract_excerpt":"We show an inequality involving the third largest or second smallest dual eigenvalues of $Q$-polynomial association schemes of class at least three. Also we characterize dual-tight $Q$-polynomial association schemes of class three. Our method is based on tridiagonal matrices and can be applied to distance-regular graphs as well."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1202.5627","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-25T08:15:48Z","cross_cats_sorted":[],"title_canon_sha256":"11ef39095f87d6142deac7edcbf025428b5f5965aba4d600e525daccc17176f4","abstract_canon_sha256":"9f2141df75ae748a0ec64e39eff8b6dcf2cbe85805e2aef46f9a032c3486162b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:25.236987Z","signature_b64":"Jz41lIR2NZqx4oQxWlVa72mCMpQNItw4KMpS40y6AQtGL7QmQDJYQdXbdxfeS+m3DygZUOqbNj+1MxDpVrM+Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66b4c5417a60ef491be1b94b5bfde18d02503f370a9b6754374a2b3adfd73b9a","last_reissued_at":"2026-05-18T04:01:25.236336Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:25.236336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On $Q$-polynomial association schemes of small class","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sho Suda","submitted_at":"2012-02-25T08:15:48Z","abstract_excerpt":"We show an inequality involving the third largest or second smallest dual eigenvalues of $Q$-polynomial association schemes of class at least three. Also we characterize dual-tight $Q$-polynomial association schemes of class three. Our method is based on tridiagonal matrices and can be applied to distance-regular graphs as well."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.5627","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1202.5627","created_at":"2026-05-18T04:01:25.236435+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.5627v1","created_at":"2026-05-18T04:01:25.236435+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5627","created_at":"2026-05-18T04:01:25.236435+00:00"},{"alias_kind":"pith_short_12","alias_value":"M22MKQL2MDXU","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"M22MKQL2MDXUSG7B","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"M22MKQL2","created_at":"2026-05-18T12:27:14.488303+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M22MKQL2MDXUSG7BXFFVX7PBRU","json":"https://pith.science/pith/M22MKQL2MDXUSG7BXFFVX7PBRU.json","graph_json":"https://pith.science/api/pith-number/M22MKQL2MDXUSG7BXFFVX7PBRU/graph.json","events_json":"https://pith.science/api/pith-number/M22MKQL2MDXUSG7BXFFVX7PBRU/events.json","paper":"https://pith.science/paper/M22MKQL2"},"agent_actions":{"view_html":"https://pith.science/pith/M22MKQL2MDXUSG7BXFFVX7PBRU","download_json":"https://pith.science/pith/M22MKQL2MDXUSG7BXFFVX7PBRU.json","view_paper":"https://pith.science/paper/M22MKQL2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.5627&json=true","fetch_graph":"https://pith.science/api/pith-number/M22MKQL2MDXUSG7BXFFVX7PBRU/graph.json","fetch_events":"https://pith.science/api/pith-number/M22MKQL2MDXUSG7BXFFVX7PBRU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M22MKQL2MDXUSG7BXFFVX7PBRU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M22MKQL2MDXUSG7BXFFVX7PBRU/action/storage_attestation","attest_author":"https://pith.science/pith/M22MKQL2MDXUSG7BXFFVX7PBRU/action/author_attestation","sign_citation":"https://pith.science/pith/M22MKQL2MDXUSG7BXFFVX7PBRU/action/citation_signature","submit_replication":"https://pith.science/pith/M22MKQL2MDXUSG7BXFFVX7PBRU/action/replication_record"}},"created_at":"2026-05-18T04:01:25.236435+00:00","updated_at":"2026-05-18T04:01:25.236435+00:00"}