{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ONBCKJXJENW6BTMCDL4MVBKPG6","short_pith_number":"pith:ONBCKJXJ","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"},"canonical_sha256":"73422526e9236de0cd821af8ca854f37b0eb2e81004c0cd07e370d049b559209","source":{"kind":"arxiv","id":"1209.6312","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.6312","created_at":"2026-05-18T03:44:33Z"},{"alias_kind":"arxiv_version","alias_value":"1209.6312v2","created_at":"2026-05-18T03:44:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.6312","created_at":"2026-05-18T03:44:33Z"},{"alias_kind":"pith_short_12","alias_value":"ONBCKJXJENW6","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"ONBCKJXJENW6BTMC","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"ONBCKJXJ","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ONBCKJXJENW6BTMCDL4MVBKPG6","target":"record","payload":{"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"},"canonical_sha256":"73422526e9236de0cd821af8ca854f37b0eb2e81004c0cd07e370d049b559209","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"},"source_kind":"arxiv","source_id":"1209.6312","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-18T03:44:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sgBxKZq2jDUXet4e20z5h3BgLf8RBC/zuEukhlLpRvSbaiqYLQbHAyitss8NnwnWtmgmJhM6kG8neZig2u2VBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T11:23:16.155405Z"},"content_sha256":"366ee33fd21a9ab5036461fe711c9f787cf1a7128356d21cfc662ab6029a41bd","schema_version":"1.0","event_id":"sha256:366ee33fd21a9ab5036461fe711c9f787cf1a7128356d21cfc662ab6029a41bd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ONBCKJXJENW6BTMCDL4MVBKPG6","target":"graph","payload":{"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"},"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:44:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1q6BxMx2Sd/HKT59WXl6+m2Qrqi0AEghVCHb8I3ueyBYIlVD31Zacgz9Fq6ZyXppomF7/0zzMCCSpQfKv09LBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T11:23:16.156106Z"},"content_sha256":"833c3b1d2f6693a9705c68af1e892d3bd7c68270d2a3896c83746755d4277292","schema_version":"1.0","event_id":"sha256:833c3b1d2f6693a9705c68af1e892d3bd7c68270d2a3896c83746755d4277292"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ONBCKJXJENW6BTMCDL4MVBKPG6/bundle.json","state_url":"https://pith.science/pith/ONBCKJXJENW6BTMCDL4MVBKPG6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ONBCKJXJENW6BTMCDL4MVBKPG6/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-23T11:23:16Z","links":{"resolver":"https://pith.science/pith/ONBCKJXJENW6BTMCDL4MVBKPG6","bundle":"https://pith.science/pith/ONBCKJXJENW6BTMCDL4MVBKPG6/bundle.json","state":"https://pith.science/pith/ONBCKJXJENW6BTMCDL4MVBKPG6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ONBCKJXJENW6BTMCDL4MVBKPG6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ONBCKJXJENW6BTMCDL4MVBKPG6","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":"c0051a9533dd97d239fbd9e9bab2a0db43015f7c5747e06b01ee0608687a26d6","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-27T18:05:30Z","title_canon_sha256":"e90c3926b2883d42b2f0493126af8c026ed15d686800e565f25766bd579b4ec3"},"schema_version":"1.0","source":{"id":"1209.6312","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.6312","created_at":"2026-05-18T03:44:33Z"},{"alias_kind":"arxiv_version","alias_value":"1209.6312v2","created_at":"2026-05-18T03:44:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.6312","created_at":"2026-05-18T03:44:33Z"},{"alias_kind":"pith_short_12","alias_value":"ONBCKJXJENW6","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"ONBCKJXJENW6BTMC","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"ONBCKJXJ","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:833c3b1d2f6693a9705c68af1e892d3bd7c68270d2a3896c83746755d4277292","target":"graph","created_at":"2026-05-18T03:44:33Z","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":"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.","authors_text":"Manuel Arora, Paul-Hermann Zieschang","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-27T18:05:30Z","title":"An Algorithmic Approach to the Extensibility of Association Schemes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.6312","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:366ee33fd21a9ab5036461fe711c9f787cf1a7128356d21cfc662ab6029a41bd","target":"record","created_at":"2026-05-18T03:44:33Z","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":"c0051a9533dd97d239fbd9e9bab2a0db43015f7c5747e06b01ee0608687a26d6","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-27T18:05:30Z","title_canon_sha256":"e90c3926b2883d42b2f0493126af8c026ed15d686800e565f25766bd579b4ec3"},"schema_version":"1.0","source":{"id":"1209.6312","kind":"arxiv","version":2}},"canonical_sha256":"73422526e9236de0cd821af8ca854f37b0eb2e81004c0cd07e370d049b559209","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"73422526e9236de0cd821af8ca854f37b0eb2e81004c0cd07e370d049b559209","first_computed_at":"2026-05-18T03:44:33.150058Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:44:33.150058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VfLNfY0z6O+RGRR4F8IWEOJub4u3OcIRUGH95sa2toxKbXrIaymT+0OhfnCu+qSjbix2z1XZVJ2WXFpytZHRDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:44:33.150854Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.6312","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:366ee33fd21a9ab5036461fe711c9f787cf1a7128356d21cfc662ab6029a41bd","sha256:833c3b1d2f6693a9705c68af1e892d3bd7c68270d2a3896c83746755d4277292"],"state_sha256":"0fb52e08890a8f86089cd7f45b60bb21cdb510b5e50469a1d05377eac6db783a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t7dyfU6E34W/dJQwf1tn1KiWs5Z0yfT83tWEQRppEanVEmC6POmcinlQWIromqHAohaLFmnhVAVTx3qmXEkXBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T11:23:16.159634Z","bundle_sha256":"bd2e942de90627aba109ab8304f4893ff17a5ca8fbb633775f1c3aa6385ab9de"}}