{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1994:Q2VFSOHAJVWXTTBU2STUCWISUN","short_pith_number":"pith:Q2VFSOHA","schema_version":"1.0","canonical_sha256":"86aa5938e04d6d79cc34d4a7415912a36b205fa251978b24d99f2bc9e146d266","source":{"kind":"arxiv","id":"math/9411221","version":1},"attestation_state":"computed","paper":{"title":"Notes on the connectivity of Cayley coset digraphs","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Emanuel Knill","submitted_at":"1994-11-10T00:00:00Z","abstract_excerpt":"Hamidoune's connectivity results for hierarchical Cayley digraphs are extended to Cayley coset digraphs and thus to arbitrary vertex transitive digraphs. It is shown that if a Cayley coset digraph can be hierarchically decomposed in a certain way, then it is optimally vertex connected. The results are obtained by extending the methods used by Hamidoune. They are used to show that cycle-prefix graphs are optimally vertex connected. This implies that cycle-prefix graphs have good fault tolerance properties."},"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":"math/9411221","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"1994-11-10T00:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"b8f0669b6a4691b052b5f5aa6e8624dca872ba49e8f5c3b02ba8b655752f1f43","abstract_canon_sha256":"7047602cac4dc8b0366a14606fcb92621d13b361963da1ee23111e20aa9edaa8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:50.862049Z","signature_b64":"FW8My3ZHQmCVqqnC6+C/glZFBR//nAT8J6NtEvYE0AV20H+S4s5fdwxJENmCUi4DdnuXFuVE4XsHvtBCCGBXBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86aa5938e04d6d79cc34d4a7415912a36b205fa251978b24d99f2bc9e146d266","last_reissued_at":"2026-05-18T01:05:50.861597Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:50.861597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Notes on the connectivity of Cayley coset digraphs","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Emanuel Knill","submitted_at":"1994-11-10T00:00:00Z","abstract_excerpt":"Hamidoune's connectivity results for hierarchical Cayley digraphs are extended to Cayley coset digraphs and thus to arbitrary vertex transitive digraphs. It is shown that if a Cayley coset digraph can be hierarchically decomposed in a certain way, then it is optimally vertex connected. The results are obtained by extending the methods used by Hamidoune. They are used to show that cycle-prefix graphs are optimally vertex connected. This implies that cycle-prefix graphs have good fault tolerance properties."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/9411221","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":"math/9411221","created_at":"2026-05-18T01:05:50.861659+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/9411221v1","created_at":"2026-05-18T01:05:50.861659+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/9411221","created_at":"2026-05-18T01:05:50.861659+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q2VFSOHAJVWX","created_at":"2026-05-18T12:25:47.102015+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q2VFSOHAJVWXTTBU","created_at":"2026-05-18T12:25:47.102015+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q2VFSOHA","created_at":"2026-05-18T12:25:47.102015+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/Q2VFSOHAJVWXTTBU2STUCWISUN","json":"https://pith.science/pith/Q2VFSOHAJVWXTTBU2STUCWISUN.json","graph_json":"https://pith.science/api/pith-number/Q2VFSOHAJVWXTTBU2STUCWISUN/graph.json","events_json":"https://pith.science/api/pith-number/Q2VFSOHAJVWXTTBU2STUCWISUN/events.json","paper":"https://pith.science/paper/Q2VFSOHA"},"agent_actions":{"view_html":"https://pith.science/pith/Q2VFSOHAJVWXTTBU2STUCWISUN","download_json":"https://pith.science/pith/Q2VFSOHAJVWXTTBU2STUCWISUN.json","view_paper":"https://pith.science/paper/Q2VFSOHA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/9411221&json=true","fetch_graph":"https://pith.science/api/pith-number/Q2VFSOHAJVWXTTBU2STUCWISUN/graph.json","fetch_events":"https://pith.science/api/pith-number/Q2VFSOHAJVWXTTBU2STUCWISUN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q2VFSOHAJVWXTTBU2STUCWISUN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q2VFSOHAJVWXTTBU2STUCWISUN/action/storage_attestation","attest_author":"https://pith.science/pith/Q2VFSOHAJVWXTTBU2STUCWISUN/action/author_attestation","sign_citation":"https://pith.science/pith/Q2VFSOHAJVWXTTBU2STUCWISUN/action/citation_signature","submit_replication":"https://pith.science/pith/Q2VFSOHAJVWXTTBU2STUCWISUN/action/replication_record"}},"created_at":"2026-05-18T01:05:50.861659+00:00","updated_at":"2026-05-18T01:05:50.861659+00:00"}