{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PGKTCJ3KIM533GN664FZ6DQU3I","short_pith_number":"pith:PGKTCJ3K","schema_version":"1.0","canonical_sha256":"799531276a433bbd99bef70b9f0e14da2b1b0c6b7e28be78eb3f27effc2824c0","source":{"kind":"arxiv","id":"1712.09761","version":1},"attestation_state":"computed","paper":{"title":"Every 4-equivalenced association scheme is Frobenius","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bora Moon","submitted_at":"2017-12-28T05:49:08Z","abstract_excerpt":"For a positive integer $k$, we say that an association scheme $(\\Omega,S)$ is $k$-equivalenced if each non-diagonal element of $S$ has valency $k$. $k$-equivalenced is weaker than pseudocyclic. It is known that every $k$-equivalenced association scheme is Frobenius when $k=2,3$ and every $4$-equivalenced association scheme is pseudocyclic. In this paper, we will show that every $4$-equivalenced association scheme is Frobenius."},"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":"1712.09761","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-28T05:49:08Z","cross_cats_sorted":[],"title_canon_sha256":"35feb4e6df5d4b93ee344abc2a6ed280650a9b55b10fd0c6e1879fb67a3698f2","abstract_canon_sha256":"014c8a4197e0e5d27766cde4415fa45078fa35eed72d4e3b724823805cb43751"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:05.641944Z","signature_b64":"L6Iyp3P22Hua2pF0OKE64IVkXaf1/5FJ9dMg/j3USuIhdXJM2cs1rFZNLnuNJe+JaS7cPU3C+oCUp74Nr6YMBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"799531276a433bbd99bef70b9f0e14da2b1b0c6b7e28be78eb3f27effc2824c0","last_reissued_at":"2026-05-18T00:27:05.641400Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:05.641400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Every 4-equivalenced association scheme is Frobenius","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bora Moon","submitted_at":"2017-12-28T05:49:08Z","abstract_excerpt":"For a positive integer $k$, we say that an association scheme $(\\Omega,S)$ is $k$-equivalenced if each non-diagonal element of $S$ has valency $k$. $k$-equivalenced is weaker than pseudocyclic. It is known that every $k$-equivalenced association scheme is Frobenius when $k=2,3$ and every $4$-equivalenced association scheme is pseudocyclic. In this paper, we will show that every $4$-equivalenced association scheme is Frobenius."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.09761","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":"1712.09761","created_at":"2026-05-18T00:27:05.641475+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.09761v1","created_at":"2026-05-18T00:27:05.641475+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09761","created_at":"2026-05-18T00:27:05.641475+00:00"},{"alias_kind":"pith_short_12","alias_value":"PGKTCJ3KIM53","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PGKTCJ3KIM533GN6","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PGKTCJ3K","created_at":"2026-05-18T12:31:37.085036+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/PGKTCJ3KIM533GN664FZ6DQU3I","json":"https://pith.science/pith/PGKTCJ3KIM533GN664FZ6DQU3I.json","graph_json":"https://pith.science/api/pith-number/PGKTCJ3KIM533GN664FZ6DQU3I/graph.json","events_json":"https://pith.science/api/pith-number/PGKTCJ3KIM533GN664FZ6DQU3I/events.json","paper":"https://pith.science/paper/PGKTCJ3K"},"agent_actions":{"view_html":"https://pith.science/pith/PGKTCJ3KIM533GN664FZ6DQU3I","download_json":"https://pith.science/pith/PGKTCJ3KIM533GN664FZ6DQU3I.json","view_paper":"https://pith.science/paper/PGKTCJ3K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.09761&json=true","fetch_graph":"https://pith.science/api/pith-number/PGKTCJ3KIM533GN664FZ6DQU3I/graph.json","fetch_events":"https://pith.science/api/pith-number/PGKTCJ3KIM533GN664FZ6DQU3I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PGKTCJ3KIM533GN664FZ6DQU3I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PGKTCJ3KIM533GN664FZ6DQU3I/action/storage_attestation","attest_author":"https://pith.science/pith/PGKTCJ3KIM533GN664FZ6DQU3I/action/author_attestation","sign_citation":"https://pith.science/pith/PGKTCJ3KIM533GN664FZ6DQU3I/action/citation_signature","submit_replication":"https://pith.science/pith/PGKTCJ3KIM533GN664FZ6DQU3I/action/replication_record"}},"created_at":"2026-05-18T00:27:05.641475+00:00","updated_at":"2026-05-18T00:27:05.641475+00:00"}