{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:MNIKFTM554KSMCP2D52BKS4ZUZ","short_pith_number":"pith:MNIKFTM5","canonical_record":{"source":{"id":"1404.4907","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-19T00:45:23Z","cross_cats_sorted":[],"title_canon_sha256":"bd3f445a9984518d5a2ca7ba44d29e7388949a703eb5f58778539c8bbcbda2e3","abstract_canon_sha256":"d531b384433270ca21d17028731485592b48b06319740383f2ba70fd94c073b1"},"schema_version":"1.0"},"canonical_sha256":"6350a2cd9def152609fa1f74154b99a659bf9beac371d5db69ad85a038212a19","source":{"kind":"arxiv","id":"1404.4907","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.4907","created_at":"2026-05-18T02:53:52Z"},{"alias_kind":"arxiv_version","alias_value":"1404.4907v1","created_at":"2026-05-18T02:53:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4907","created_at":"2026-05-18T02:53:52Z"},{"alias_kind":"pith_short_12","alias_value":"MNIKFTM554KS","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MNIKFTM554KSMCP2","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MNIKFTM5","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:MNIKFTM554KSMCP2D52BKS4ZUZ","target":"record","payload":{"canonical_record":{"source":{"id":"1404.4907","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-19T00:45:23Z","cross_cats_sorted":[],"title_canon_sha256":"bd3f445a9984518d5a2ca7ba44d29e7388949a703eb5f58778539c8bbcbda2e3","abstract_canon_sha256":"d531b384433270ca21d17028731485592b48b06319740383f2ba70fd94c073b1"},"schema_version":"1.0"},"canonical_sha256":"6350a2cd9def152609fa1f74154b99a659bf9beac371d5db69ad85a038212a19","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:52.657953Z","signature_b64":"0vJSVdO4rtJAomEKjToiYlr2h2mBkyNqDlQI5ypUAyRCvWdpPyyXWo114UB+ij3t3SKqc29ZAIJI62UUh1JHBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6350a2cd9def152609fa1f74154b99a659bf9beac371d5db69ad85a038212a19","last_reissued_at":"2026-05-18T02:53:52.657286Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:52.657286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.4907","source_version":1,"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-18T02:53:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jj5ohwn1DuqLnPYQkheviZn62qUht4U+V5ZFIxvJBKmUkjNNvgf81TzinSCN+u/pIyqlLPqoAgYCd/DOO+jrDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:41:50.944928Z"},"content_sha256":"fd6fa8a4d3acdb3a731c3c5a8a9d7111d324af79090d7b9e493971874ca180b9","schema_version":"1.0","event_id":"sha256:fd6fa8a4d3acdb3a731c3c5a8a9d7111d324af79090d7b9e493971874ca180b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:MNIKFTM554KSMCP2D52BKS4ZUZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Automorphisms of the cycle prefix digraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bingqing Li, Vance Faber, William Y. C. Chen","submitted_at":"2014-04-19T00:45:23Z","abstract_excerpt":"Cycle prefix digraphs have been proposed as an efficient model of symmetric interconnection networks for parallel architecture. It has been discovered that the cycle prefix networks have many attractive communication properties. In this paper, we determine the automorphism group of the cycle prefix digraphs. We show that the automorphism group of a cycle prefix digraph is isomorphic to the symmetric group on its underlying alphabet. Our method can be applied to other classes of graphs built on alphabets including the hypercube, the Kautz graph,and the de Bruijn graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4907","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"},"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-18T02:53:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fHD8hXb3fKt9Oz+xJd8VJRZlEkIXbZ8pixTr/k1FiThY9SyifRC6SAnmvn+bGhVkagV/r2fdBd2cWbWjZEKlDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:41:50.945336Z"},"content_sha256":"6e6d3ac92e95534779d42a001dbe48fdca9910cf74dbf27ec54d41be73135a67","schema_version":"1.0","event_id":"sha256:6e6d3ac92e95534779d42a001dbe48fdca9910cf74dbf27ec54d41be73135a67"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MNIKFTM554KSMCP2D52BKS4ZUZ/bundle.json","state_url":"https://pith.science/pith/MNIKFTM554KSMCP2D52BKS4ZUZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MNIKFTM554KSMCP2D52BKS4ZUZ/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-06-04T22:41:50Z","links":{"resolver":"https://pith.science/pith/MNIKFTM554KSMCP2D52BKS4ZUZ","bundle":"https://pith.science/pith/MNIKFTM554KSMCP2D52BKS4ZUZ/bundle.json","state":"https://pith.science/pith/MNIKFTM554KSMCP2D52BKS4ZUZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MNIKFTM554KSMCP2D52BKS4ZUZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:MNIKFTM554KSMCP2D52BKS4ZUZ","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":"d531b384433270ca21d17028731485592b48b06319740383f2ba70fd94c073b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-19T00:45:23Z","title_canon_sha256":"bd3f445a9984518d5a2ca7ba44d29e7388949a703eb5f58778539c8bbcbda2e3"},"schema_version":"1.0","source":{"id":"1404.4907","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.4907","created_at":"2026-05-18T02:53:52Z"},{"alias_kind":"arxiv_version","alias_value":"1404.4907v1","created_at":"2026-05-18T02:53:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4907","created_at":"2026-05-18T02:53:52Z"},{"alias_kind":"pith_short_12","alias_value":"MNIKFTM554KS","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MNIKFTM554KSMCP2","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MNIKFTM5","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:6e6d3ac92e95534779d42a001dbe48fdca9910cf74dbf27ec54d41be73135a67","target":"graph","created_at":"2026-05-18T02:53:52Z","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":"Cycle prefix digraphs have been proposed as an efficient model of symmetric interconnection networks for parallel architecture. It has been discovered that the cycle prefix networks have many attractive communication properties. In this paper, we determine the automorphism group of the cycle prefix digraphs. We show that the automorphism group of a cycle prefix digraph is isomorphic to the symmetric group on its underlying alphabet. Our method can be applied to other classes of graphs built on alphabets including the hypercube, the Kautz graph,and the de Bruijn graph.","authors_text":"Bingqing Li, Vance Faber, William Y. C. Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-19T00:45:23Z","title":"Automorphisms of the cycle prefix digraph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4907","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:fd6fa8a4d3acdb3a731c3c5a8a9d7111d324af79090d7b9e493971874ca180b9","target":"record","created_at":"2026-05-18T02:53:52Z","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":"d531b384433270ca21d17028731485592b48b06319740383f2ba70fd94c073b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-19T00:45:23Z","title_canon_sha256":"bd3f445a9984518d5a2ca7ba44d29e7388949a703eb5f58778539c8bbcbda2e3"},"schema_version":"1.0","source":{"id":"1404.4907","kind":"arxiv","version":1}},"canonical_sha256":"6350a2cd9def152609fa1f74154b99a659bf9beac371d5db69ad85a038212a19","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6350a2cd9def152609fa1f74154b99a659bf9beac371d5db69ad85a038212a19","first_computed_at":"2026-05-18T02:53:52.657286Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:52.657286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0vJSVdO4rtJAomEKjToiYlr2h2mBkyNqDlQI5ypUAyRCvWdpPyyXWo114UB+ij3t3SKqc29ZAIJI62UUh1JHBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:52.657953Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.4907","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd6fa8a4d3acdb3a731c3c5a8a9d7111d324af79090d7b9e493971874ca180b9","sha256:6e6d3ac92e95534779d42a001dbe48fdca9910cf74dbf27ec54d41be73135a67"],"state_sha256":"cab2bf1e6783136f1e3082c995102ea45d13e367d5e8685b869af5fb26c1761e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K/IYZqltdPd53pOoJ1S0qQsm8WreLKbAVafLobtYQdELlpBPhc5EV1sl4HP22NWzXaxrRMFoZvKgGD5XMccAAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T22:41:50.949449Z","bundle_sha256":"e5eb1a3e22b9e4b987e012a81b381f4c21a5f359f45076bcf8fc65da1ed20c5d"}}