{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:ONBCKJXJENW6BTMCDL4MVBKPG6","short_pith_number":"pith:ONBCKJXJ","schema_version":"1.0","canonical_sha256":"73422526e9236de0cd821af8ca854f37b0eb2e81004c0cd07e370d049b559209","source":{"kind":"arxiv","id":"1209.6312","version":2},"attestation_state":"computed","paper":{"title":"An Algorithmic Approach to the Extensibility of Association Schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Manuel Arora, Paul-Hermann Zieschang","submitted_at":"2012-09-27T18:05:30Z","abstract_excerpt":"An association scheme which is associated to a height t presuperscheme is said to be extensible to height t. Smith (1994, 2007) showed that an association scheme X=(Q,\\Gamma) of order d:=|Q| is Schurian iff X is extensible to height (d-2). In this work, we formalize the maximal height t_max(X) of an association scheme X as the largest positive integer such that X is extensible to height t (we also include the possibility t_max(X)=\\infty, which is equivalent to t_max(X)\\ge (d-2)). Intuitively, the maximal height provides a natural measure of how close an association scheme is to being Schurian."},"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":"1209.6312","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-27T18:05:30Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e90c3926b2883d42b2f0493126af8c026ed15d686800e565f25766bd579b4ec3","abstract_canon_sha256":"c0051a9533dd97d239fbd9e9bab2a0db43015f7c5747e06b01ee0608687a26d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:33.150854Z","signature_b64":"VfLNfY0z6O+RGRR4F8IWEOJub4u3OcIRUGH95sa2toxKbXrIaymT+0OhfnCu+qSjbix2z1XZVJ2WXFpytZHRDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73422526e9236de0cd821af8ca854f37b0eb2e81004c0cd07e370d049b559209","last_reissued_at":"2026-05-18T03:44:33.150058Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:33.150058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Algorithmic Approach to the Extensibility of Association Schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Manuel Arora, Paul-Hermann Zieschang","submitted_at":"2012-09-27T18:05:30Z","abstract_excerpt":"An association scheme which is associated to a height t presuperscheme is said to be extensible to height t. Smith (1994, 2007) showed that an association scheme X=(Q,\\Gamma) of order d:=|Q| is Schurian iff X is extensible to height (d-2). In this work, we formalize the maximal height t_max(X) of an association scheme X as the largest positive integer such that X is extensible to height t (we also include the possibility t_max(X)=\\infty, which is equivalent to t_max(X)\\ge (d-2)). Intuitively, the maximal height provides a natural measure of how close an association scheme is to being Schurian."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.6312","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1209.6312","created_at":"2026-05-18T03:44:33.150185+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.6312v2","created_at":"2026-05-18T03:44:33.150185+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.6312","created_at":"2026-05-18T03:44:33.150185+00:00"},{"alias_kind":"pith_short_12","alias_value":"ONBCKJXJENW6","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"ONBCKJXJENW6BTMC","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"ONBCKJXJ","created_at":"2026-05-18T12:27:16.716162+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2603.20989","citing_title":"Imprimitive association schemes and elimination theory","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ONBCKJXJENW6BTMCDL4MVBKPG6","json":"https://pith.science/pith/ONBCKJXJENW6BTMCDL4MVBKPG6.json","graph_json":"https://pith.science/api/pith-number/ONBCKJXJENW6BTMCDL4MVBKPG6/graph.json","events_json":"https://pith.science/api/pith-number/ONBCKJXJENW6BTMCDL4MVBKPG6/events.json","paper":"https://pith.science/paper/ONBCKJXJ"},"agent_actions":{"view_html":"https://pith.science/pith/ONBCKJXJENW6BTMCDL4MVBKPG6","download_json":"https://pith.science/pith/ONBCKJXJENW6BTMCDL4MVBKPG6.json","view_paper":"https://pith.science/paper/ONBCKJXJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.6312&json=true","fetch_graph":"https://pith.science/api/pith-number/ONBCKJXJENW6BTMCDL4MVBKPG6/graph.json","fetch_events":"https://pith.science/api/pith-number/ONBCKJXJENW6BTMCDL4MVBKPG6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ONBCKJXJENW6BTMCDL4MVBKPG6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ONBCKJXJENW6BTMCDL4MVBKPG6/action/storage_attestation","attest_author":"https://pith.science/pith/ONBCKJXJENW6BTMCDL4MVBKPG6/action/author_attestation","sign_citation":"https://pith.science/pith/ONBCKJXJENW6BTMCDL4MVBKPG6/action/citation_signature","submit_replication":"https://pith.science/pith/ONBCKJXJENW6BTMCDL4MVBKPG6/action/replication_record"}},"created_at":"2026-05-18T03:44:33.150185+00:00","updated_at":"2026-05-18T03:44:33.150185+00:00"}