{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:3A4A6TXQWEHPVSKMCQVO4R2LGS","short_pith_number":"pith:3A4A6TXQ","canonical_record":{"source":{"id":"2508.18068","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-08-25T14:26:06Z","cross_cats_sorted":[],"title_canon_sha256":"be8e1b0f56e41ba2596aaca4e78a96c21bb0f8ddca4b3d6ccfcb06fda45d07ad","abstract_canon_sha256":"5138099396dd95f1fe6fc3781237562b4e0fb11b1c7c22cd56dd121495d36992"},"schema_version":"1.0"},"canonical_sha256":"d8380f4ef0b10efac94c142aee474b34b0d025ec657daf78e651bc8de199d9e9","source":{"kind":"arxiv","id":"2508.18068","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.18068","created_at":"2026-07-05T11:58:53Z"},{"alias_kind":"arxiv_version","alias_value":"2508.18068v1","created_at":"2026-07-05T11:58:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.18068","created_at":"2026-07-05T11:58:53Z"},{"alias_kind":"pith_short_12","alias_value":"3A4A6TXQWEHP","created_at":"2026-07-05T11:58:53Z"},{"alias_kind":"pith_short_16","alias_value":"3A4A6TXQWEHPVSKM","created_at":"2026-07-05T11:58:53Z"},{"alias_kind":"pith_short_8","alias_value":"3A4A6TXQ","created_at":"2026-07-05T11:58:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:3A4A6TXQWEHPVSKMCQVO4R2LGS","target":"record","payload":{"canonical_record":{"source":{"id":"2508.18068","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-08-25T14:26:06Z","cross_cats_sorted":[],"title_canon_sha256":"be8e1b0f56e41ba2596aaca4e78a96c21bb0f8ddca4b3d6ccfcb06fda45d07ad","abstract_canon_sha256":"5138099396dd95f1fe6fc3781237562b4e0fb11b1c7c22cd56dd121495d36992"},"schema_version":"1.0"},"canonical_sha256":"d8380f4ef0b10efac94c142aee474b34b0d025ec657daf78e651bc8de199d9e9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:58:53.138199Z","signature_b64":"vqQbNyXuWJUKS7T6gIqAbTGMRMMLlFoUvKSndbnE4/foAHQnpG4rZI4WH4WA2eKRWCqwoG/OD09Bmv8RFIxEAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8380f4ef0b10efac94c142aee474b34b0d025ec657daf78e651bc8de199d9e9","last_reissued_at":"2026-07-05T11:58:53.137726Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:58:53.137726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2508.18068","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-07-05T11:58:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C/OXoKCgX9i3sPLqMHIfaSGnBRvTgKfVAqMtPksMzm+6Dh9ImfqIFTbJvDx3G1lkcNT6iuH3EYonuSS3MqeODQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T19:15:40.703875Z"},"content_sha256":"f0554c96e23e45bc26eb51b4263d92f733800aaffd520b891ebb956f6f305ef3","schema_version":"1.0","event_id":"sha256:f0554c96e23e45bc26eb51b4263d92f733800aaffd520b891ebb956f6f305ef3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:3A4A6TXQWEHPVSKMCQVO4R2LGS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"State Transfer on Unitary Cayley Graphs and Quadratic Unitary Cayley Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Akash Kalita, Bikash Bhattacharjya","submitted_at":"2025-08-25T14:26:06Z","abstract_excerpt":"The unitary Cayley graph, denoted $X_n$, is the graph with vertex set ${\\mathbb{Z}}_n$ such that two distinct vertices $a$ and $b$ are adjacent if $a-b=u$ for some $u$ with $1 \\leq u \\leq n-1$ and $\\gcd(u,n) = 1$. The quadratic unitary Cayley graph, denoted $G_n$, is the graph with vertex set ${\\mathbb{Z}}_n$ such that two distinct vertices $a$ and $b$ are adjacent if $a-b=u^2$ or $a-b=-u^2$ for some $u$ with $1 \\leq u \\leq n-1$ and $\\gcd(u,n) = 1$. In this paper, we classify all $X_n$ admitting pretty good fractional. We also classify all $X_n$ that admit fractional revival. It turns out that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.18068","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2508.18068/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T11:58:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tP8baSrj0eN2uC0V83XY7UREaJZyZ3kikoboUnzGu+RP5axnWB8Dd9ZfsV7uDfjBskzE2P6tgZFs+PoTdFCcCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T19:15:40.704361Z"},"content_sha256":"68a20d542d56f040373f8187116d93374cf9ffa0dd2bf75a2ee06312bf4e64ee","schema_version":"1.0","event_id":"sha256:68a20d542d56f040373f8187116d93374cf9ffa0dd2bf75a2ee06312bf4e64ee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3A4A6TXQWEHPVSKMCQVO4R2LGS/bundle.json","state_url":"https://pith.science/pith/3A4A6TXQWEHPVSKMCQVO4R2LGS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3A4A6TXQWEHPVSKMCQVO4R2LGS/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-08-23T19:15:40Z","links":{"resolver":"https://pith.science/pith/3A4A6TXQWEHPVSKMCQVO4R2LGS","bundle":"https://pith.science/pith/3A4A6TXQWEHPVSKMCQVO4R2LGS/bundle.json","state":"https://pith.science/pith/3A4A6TXQWEHPVSKMCQVO4R2LGS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3A4A6TXQWEHPVSKMCQVO4R2LGS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:3A4A6TXQWEHPVSKMCQVO4R2LGS","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":"5138099396dd95f1fe6fc3781237562b4e0fb11b1c7c22cd56dd121495d36992","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-08-25T14:26:06Z","title_canon_sha256":"be8e1b0f56e41ba2596aaca4e78a96c21bb0f8ddca4b3d6ccfcb06fda45d07ad"},"schema_version":"1.0","source":{"id":"2508.18068","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.18068","created_at":"2026-07-05T11:58:53Z"},{"alias_kind":"arxiv_version","alias_value":"2508.18068v1","created_at":"2026-07-05T11:58:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.18068","created_at":"2026-07-05T11:58:53Z"},{"alias_kind":"pith_short_12","alias_value":"3A4A6TXQWEHP","created_at":"2026-07-05T11:58:53Z"},{"alias_kind":"pith_short_16","alias_value":"3A4A6TXQWEHPVSKM","created_at":"2026-07-05T11:58:53Z"},{"alias_kind":"pith_short_8","alias_value":"3A4A6TXQ","created_at":"2026-07-05T11:58:53Z"}],"graph_snapshots":[{"event_id":"sha256:68a20d542d56f040373f8187116d93374cf9ffa0dd2bf75a2ee06312bf4e64ee","target":"graph","created_at":"2026-07-05T11:58:53Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2508.18068/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The unitary Cayley graph, denoted $X_n$, is the graph with vertex set ${\\mathbb{Z}}_n$ such that two distinct vertices $a$ and $b$ are adjacent if $a-b=u$ for some $u$ with $1 \\leq u \\leq n-1$ and $\\gcd(u,n) = 1$. The quadratic unitary Cayley graph, denoted $G_n$, is the graph with vertex set ${\\mathbb{Z}}_n$ such that two distinct vertices $a$ and $b$ are adjacent if $a-b=u^2$ or $a-b=-u^2$ for some $u$ with $1 \\leq u \\leq n-1$ and $\\gcd(u,n) = 1$. In this paper, we classify all $X_n$ admitting pretty good fractional. We also classify all $X_n$ that admit fractional revival. It turns out that","authors_text":"Akash Kalita, Bikash Bhattacharjya","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-08-25T14:26:06Z","title":"State Transfer on Unitary Cayley Graphs and Quadratic Unitary Cayley Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.18068","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:f0554c96e23e45bc26eb51b4263d92f733800aaffd520b891ebb956f6f305ef3","target":"record","created_at":"2026-07-05T11:58:53Z","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":"5138099396dd95f1fe6fc3781237562b4e0fb11b1c7c22cd56dd121495d36992","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-08-25T14:26:06Z","title_canon_sha256":"be8e1b0f56e41ba2596aaca4e78a96c21bb0f8ddca4b3d6ccfcb06fda45d07ad"},"schema_version":"1.0","source":{"id":"2508.18068","kind":"arxiv","version":1}},"canonical_sha256":"d8380f4ef0b10efac94c142aee474b34b0d025ec657daf78e651bc8de199d9e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d8380f4ef0b10efac94c142aee474b34b0d025ec657daf78e651bc8de199d9e9","first_computed_at":"2026-07-05T11:58:53.137726Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:58:53.137726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vqQbNyXuWJUKS7T6gIqAbTGMRMMLlFoUvKSndbnE4/foAHQnpG4rZI4WH4WA2eKRWCqwoG/OD09Bmv8RFIxEAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:58:53.138199Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.18068","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f0554c96e23e45bc26eb51b4263d92f733800aaffd520b891ebb956f6f305ef3","sha256:68a20d542d56f040373f8187116d93374cf9ffa0dd2bf75a2ee06312bf4e64ee"],"state_sha256":"e39a54c13661115b92176d16d2557139525f631972fda92aede122446e4996f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9I4i9B8o5rIctlmKduv20MpSoiQdWuyGWFuTmanZStuYxXF8/LhseMtf562pGWB2bf/PqVHVVd4AHExEoqWKAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T19:15:40.708220Z","bundle_sha256":"1270f887a812f429bec64266cef11ee0bcdf2516d86aa3fe8971d506737d8419"}}