{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:FPUP22GQD3AIYGSMY4BTV5RFYO","short_pith_number":"pith:FPUP22GQ","canonical_record":{"source":{"id":"1202.5888","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-02-27T11:01:58Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"29ae86ccb1d9d963c6bd164afba246c25e33d68cc4c1062caa2e63846bc3a6bc","abstract_canon_sha256":"3de2f33ea6d622dba6931669d791089f8931ae375038a8160ec689d6fdd32635"},"schema_version":"1.0"},"canonical_sha256":"2be8fd68d01ec08c1a4cc7033af625c380762bec5742ceed809061c5c7468049","source":{"kind":"arxiv","id":"1202.5888","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.5888","created_at":"2026-05-18T01:24:38Z"},{"alias_kind":"arxiv_version","alias_value":"1202.5888v3","created_at":"2026-05-18T01:24:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5888","created_at":"2026-05-18T01:24:38Z"},{"alias_kind":"pith_short_12","alias_value":"FPUP22GQD3AI","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FPUP22GQD3AIYGSM","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FPUP22GQ","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:FPUP22GQD3AIYGSMY4BTV5RFYO","target":"record","payload":{"canonical_record":{"source":{"id":"1202.5888","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-02-27T11:01:58Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"29ae86ccb1d9d963c6bd164afba246c25e33d68cc4c1062caa2e63846bc3a6bc","abstract_canon_sha256":"3de2f33ea6d622dba6931669d791089f8931ae375038a8160ec689d6fdd32635"},"schema_version":"1.0"},"canonical_sha256":"2be8fd68d01ec08c1a4cc7033af625c380762bec5742ceed809061c5c7468049","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:38.884116Z","signature_b64":"Z6ARW7Rssi6QPvuH8vO9yvDec+VSHhow/FoyAgThAHkx6WntaycX5vAGyG0YX4Q3XzP8Oi8D7YGV/eA+jRbDAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2be8fd68d01ec08c1a4cc7033af625c380762bec5742ceed809061c5c7468049","last_reissued_at":"2026-05-18T01:24:38.883672Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:38.883672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.5888","source_version":3,"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-18T01:24:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V6c4hiTVyZ0hW7y1QX/vBXCB83vW3tdj9b+ehMNn0BZeeifQ2gXllNhg9ue8UxxT5epXDvnqAE8oq1Gnnb8kBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:13:45.338677Z"},"content_sha256":"d56c05fb1dd4113575bfb9553b373f0ee4991bf98d569ba5a06b6a630bffba7d","schema_version":"1.0","event_id":"sha256:d56c05fb1dd4113575bfb9553b373f0ee4991bf98d569ba5a06b6a630bffba7d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:FPUP22GQD3AIYGSMY4BTV5RFYO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An efficient algorithm for the diameter of Cayley graphs generated by transposition trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Ashwin Ganesan","submitted_at":"2012-02-27T11:01:58Z","abstract_excerpt":"A problem of practical and theoretical interest is to determine or estimate the diameter of various families of Cayley networks. The previously known estimate for the diameter of Cayley graphs generated by transposition trees is an upper bound given in the oft-cited paper of Akers and Krishnamurthy (1989). In this work, we first assess the performance of their upper bound. We show that for every $n$, there exists a tree on $n$ vertices, such that the difference between the upper bound and the true diameter value is at least $n-4$.\n  Evaluating their upper bound takes time $\\Omega(n!)$. In this"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.5888","kind":"arxiv","version":3},"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-18T01:24:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J3DPmQ/c4TqjDKTjzC+OKfmVoISgumgolKgxuiaECMjMggNvNyPKINIt1PrsABG18N6WZJlWBF0xazt4qiFdAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:13:45.339280Z"},"content_sha256":"2e452601f96880e54a7035efca30d5c67cff452ffaedb14f3dcb4fad3543ee6f","schema_version":"1.0","event_id":"sha256:2e452601f96880e54a7035efca30d5c67cff452ffaedb14f3dcb4fad3543ee6f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FPUP22GQD3AIYGSMY4BTV5RFYO/bundle.json","state_url":"https://pith.science/pith/FPUP22GQD3AIYGSMY4BTV5RFYO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FPUP22GQD3AIYGSMY4BTV5RFYO/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-11T23:13:45Z","links":{"resolver":"https://pith.science/pith/FPUP22GQD3AIYGSMY4BTV5RFYO","bundle":"https://pith.science/pith/FPUP22GQD3AIYGSMY4BTV5RFYO/bundle.json","state":"https://pith.science/pith/FPUP22GQD3AIYGSMY4BTV5RFYO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FPUP22GQD3AIYGSMY4BTV5RFYO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:FPUP22GQD3AIYGSMY4BTV5RFYO","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":"3de2f33ea6d622dba6931669d791089f8931ae375038a8160ec689d6fdd32635","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-02-27T11:01:58Z","title_canon_sha256":"29ae86ccb1d9d963c6bd164afba246c25e33d68cc4c1062caa2e63846bc3a6bc"},"schema_version":"1.0","source":{"id":"1202.5888","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.5888","created_at":"2026-05-18T01:24:38Z"},{"alias_kind":"arxiv_version","alias_value":"1202.5888v3","created_at":"2026-05-18T01:24:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5888","created_at":"2026-05-18T01:24:38Z"},{"alias_kind":"pith_short_12","alias_value":"FPUP22GQD3AI","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FPUP22GQD3AIYGSM","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FPUP22GQ","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:2e452601f96880e54a7035efca30d5c67cff452ffaedb14f3dcb4fad3543ee6f","target":"graph","created_at":"2026-05-18T01:24:38Z","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":"A problem of practical and theoretical interest is to determine or estimate the diameter of various families of Cayley networks. The previously known estimate for the diameter of Cayley graphs generated by transposition trees is an upper bound given in the oft-cited paper of Akers and Krishnamurthy (1989). In this work, we first assess the performance of their upper bound. We show that for every $n$, there exists a tree on $n$ vertices, such that the difference between the upper bound and the true diameter value is at least $n-4$.\n  Evaluating their upper bound takes time $\\Omega(n!)$. In this","authors_text":"Ashwin Ganesan","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-02-27T11:01:58Z","title":"An efficient algorithm for the diameter of Cayley graphs generated by transposition trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.5888","kind":"arxiv","version":3},"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:d56c05fb1dd4113575bfb9553b373f0ee4991bf98d569ba5a06b6a630bffba7d","target":"record","created_at":"2026-05-18T01:24:38Z","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":"3de2f33ea6d622dba6931669d791089f8931ae375038a8160ec689d6fdd32635","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-02-27T11:01:58Z","title_canon_sha256":"29ae86ccb1d9d963c6bd164afba246c25e33d68cc4c1062caa2e63846bc3a6bc"},"schema_version":"1.0","source":{"id":"1202.5888","kind":"arxiv","version":3}},"canonical_sha256":"2be8fd68d01ec08c1a4cc7033af625c380762bec5742ceed809061c5c7468049","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2be8fd68d01ec08c1a4cc7033af625c380762bec5742ceed809061c5c7468049","first_computed_at":"2026-05-18T01:24:38.883672Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:38.883672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z6ARW7Rssi6QPvuH8vO9yvDec+VSHhow/FoyAgThAHkx6WntaycX5vAGyG0YX4Q3XzP8Oi8D7YGV/eA+jRbDAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:38.884116Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.5888","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d56c05fb1dd4113575bfb9553b373f0ee4991bf98d569ba5a06b6a630bffba7d","sha256:2e452601f96880e54a7035efca30d5c67cff452ffaedb14f3dcb4fad3543ee6f"],"state_sha256":"92abd8feaa06682dbd2ef81785a325adc71f84886af395724556837ef69e2cac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9QKR1sKstrruwlEJrK9L2JWBsWyJZaVv08W9B2UPbB8hLO4kj2h00fT9MXMfkXYjwyROUPN9T97Ua0veiZLRAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T23:13:45.342931Z","bundle_sha256":"ce1ad3e12f103fefeb464fa16f2c3bdc6355b7abd7e3cedfbc8b318b02cc8da8"}}