{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:1994:Q2VFSOHAJVWXTTBU2STUCWISUN","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":"7047602cac4dc8b0366a14606fcb92621d13b361963da1ee23111e20aa9edaa8","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"1994-11-10T00:00:00Z","title_canon_sha256":"b8f0669b6a4691b052b5f5aa6e8624dca872ba49e8f5c3b02ba8b655752f1f43"},"schema_version":"1.0","source":{"id":"math/9411221","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/9411221","created_at":"2026-05-18T01:05:50Z"},{"alias_kind":"arxiv_version","alias_value":"math/9411221v1","created_at":"2026-05-18T01:05:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/9411221","created_at":"2026-05-18T01:05:50Z"},{"alias_kind":"pith_short_12","alias_value":"Q2VFSOHAJVWX","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_16","alias_value":"Q2VFSOHAJVWXTTBU","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_8","alias_value":"Q2VFSOHA","created_at":"2026-05-18T12:25:47Z"}],"graph_snapshots":[{"event_id":"sha256:fb6ad4853403738a23ba851c713cae54644c379939aca5220ac252736b4fa100","target":"graph","created_at":"2026-05-18T01:05:50Z","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":"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.","authors_text":"Emanuel Knill","cross_cats":[],"headline":"","license":"","primary_cat":"math.CO","submitted_at":"1994-11-10T00:00:00Z","title":"Notes on the connectivity of Cayley coset digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/9411221","kind":"arxiv","version":1},"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:848d6dda2788d190939f74f22d9f62792e994e9fc9bd0f17c79866d38ba49be3","target":"record","created_at":"2026-05-18T01:05:50Z","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":"7047602cac4dc8b0366a14606fcb92621d13b361963da1ee23111e20aa9edaa8","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"1994-11-10T00:00:00Z","title_canon_sha256":"b8f0669b6a4691b052b5f5aa6e8624dca872ba49e8f5c3b02ba8b655752f1f43"},"schema_version":"1.0","source":{"id":"math/9411221","kind":"arxiv","version":1}},"canonical_sha256":"86aa5938e04d6d79cc34d4a7415912a36b205fa251978b24d99f2bc9e146d266","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"86aa5938e04d6d79cc34d4a7415912a36b205fa251978b24d99f2bc9e146d266","first_computed_at":"2026-05-18T01:05:50.861597Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:05:50.861597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FW8My3ZHQmCVqqnC6+C/glZFBR//nAT8J6NtEvYE0AV20H+S4s5fdwxJENmCUi4DdnuXFuVE4XsHvtBCCGBXBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:05:50.862049Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/9411221","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:848d6dda2788d190939f74f22d9f62792e994e9fc9bd0f17c79866d38ba49be3","sha256:fb6ad4853403738a23ba851c713cae54644c379939aca5220ac252736b4fa100"],"state_sha256":"926b31171f493c98ad8f30d87c600770a1601dcc2df00e481b7ac74eec2ab41e"}