{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:Z4AP6XIV3JEOWBFN7MN4EC5ADN","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":"ee8b67828acc86ab3522b43275fa360261db21ed047ba968a3c855ada16f3acd","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2013-08-30T17:58:52Z","title_canon_sha256":"6ebecfc092b59de2274a9dd5b64a90c56261ae8c84ecf41a45464f76e8845ddc"},"schema_version":"1.0","source":{"id":"1308.6812","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.6812","created_at":"2026-05-18T03:14:30Z"},{"alias_kind":"arxiv_version","alias_value":"1308.6812v1","created_at":"2026-05-18T03:14:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.6812","created_at":"2026-05-18T03:14:30Z"},{"alias_kind":"pith_short_12","alias_value":"Z4AP6XIV3JEO","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"Z4AP6XIV3JEOWBFN","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"Z4AP6XIV","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:5d108395e45e33a323ad2b3ac77b388540ff29f764318b35ff4b202ce8e72717","target":"graph","created_at":"2026-05-18T03:14:30Z","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":"Given a finite group $G$ and a subset $S\\subseteq G,$ the bi-Cayley graph $\\bcay(G,S)$ is the graph whose vertex set is $G \\times \\{0,1\\}$ and edge set is $\\{\\{(x,0),(s x,1)\\} : x \\in G, s\\in S \\}$. A bi-Cayley graph $\\bcay(G,S)$ is called a BCI-graph if for any bi-Cayley graph $\\bcay(G,T),$ $\\bcay(G,S) \\cong \\bcay(G,T)$ implies that $T = g S^\\alpha$ for some $g \\in G$ and $\\alpha \\in \\aut(G)$. A group $G$ is called an $m$-BCI-group if all bi-Cayley graphs of $G$ of valency at most $m$ are BCI-graphs.In this paper we prove that, a finite nilpotent group is a 3-BCI-group if and only if it is in","authors_text":"Hiroki Koike, Istv\\'an Kov\\'acs","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2013-08-30T17:58:52Z","title":"A classification of nilpotent 3-BCI groups"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.6812","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:d308c8af652092931bd34fa2753cee408af978966a6feed8e16464af90f90bc9","target":"record","created_at":"2026-05-18T03:14:30Z","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":"ee8b67828acc86ab3522b43275fa360261db21ed047ba968a3c855ada16f3acd","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2013-08-30T17:58:52Z","title_canon_sha256":"6ebecfc092b59de2274a9dd5b64a90c56261ae8c84ecf41a45464f76e8845ddc"},"schema_version":"1.0","source":{"id":"1308.6812","kind":"arxiv","version":1}},"canonical_sha256":"cf00ff5d15da48eb04adfb1bc20ba01b4f331f9c759209ccbb66cafbec94948f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cf00ff5d15da48eb04adfb1bc20ba01b4f331f9c759209ccbb66cafbec94948f","first_computed_at":"2026-05-18T03:14:30.836101Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:14:30.836101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SB3uJ1qS3fTqPMG8+mQYmc1JSTWNvMzHS+/HTPyDj3hmI9zSu3Kz43fPomxuJrp49vB0lllndPRTi3REXi9hAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:14:30.836735Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.6812","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d308c8af652092931bd34fa2753cee408af978966a6feed8e16464af90f90bc9","sha256:5d108395e45e33a323ad2b3ac77b388540ff29f764318b35ff4b202ce8e72717"],"state_sha256":"986040485b72885a151467780b5dab09b7f8f705ce83d5b18c061c04055614ab"}