{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:FRB2PPQHMBVJOX63SOFLW3GLN3","short_pith_number":"pith:FRB2PPQH","canonical_record":{"source":{"id":"1605.03530","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2016-05-11T17:41:26Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"4e6c73092a883a21f18ee38808948c2c38379e4ba29093121e608eeef7efa173","abstract_canon_sha256":"2d4b3c62df768b806575452b0e9ece4fde071f46d37daf7bd0ace098fde4018f"},"schema_version":"1.0"},"canonical_sha256":"2c43a7be07606a975fdb938abb6ccb6eef5588c33cfa835b6a14866c8568b4a9","source":{"kind":"arxiv","id":"1605.03530","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.03530","created_at":"2026-05-18T00:42:17Z"},{"alias_kind":"arxiv_version","alias_value":"1605.03530v3","created_at":"2026-05-18T00:42:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03530","created_at":"2026-05-18T00:42:17Z"},{"alias_kind":"pith_short_12","alias_value":"FRB2PPQHMBVJ","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FRB2PPQHMBVJOX63","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FRB2PPQH","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:FRB2PPQHMBVJOX63SOFLW3GLN3","target":"record","payload":{"canonical_record":{"source":{"id":"1605.03530","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2016-05-11T17:41:26Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"4e6c73092a883a21f18ee38808948c2c38379e4ba29093121e608eeef7efa173","abstract_canon_sha256":"2d4b3c62df768b806575452b0e9ece4fde071f46d37daf7bd0ace098fde4018f"},"schema_version":"1.0"},"canonical_sha256":"2c43a7be07606a975fdb938abb6ccb6eef5588c33cfa835b6a14866c8568b4a9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:17.899627Z","signature_b64":"DwO3kYBDAKrWrQPwSPLZFE0xMJyz1pDi3n8527mgcUj828EHgFFI5brSYBBXiTn7DVtxAcb9duqzCK62f9uFAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c43a7be07606a975fdb938abb6ccb6eef5588c33cfa835b6a14866c8568b4a9","last_reissued_at":"2026-05-18T00:42:17.899032Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:17.899032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.03530","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-18T00:42:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vf9Qsa1wkWHr1xCfdQICWUTk73uaht4vaRcn9truEjkbjGSF4ml1FiG/FNBNfczSj56+ujSuSGaFsTysGkDbDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T07:56:31.252418Z"},"content_sha256":"331b5c7ae943db9409bf66f2a2648694bb47b193a873595bb368a8fb379104ab","schema_version":"1.0","event_id":"sha256:331b5c7ae943db9409bf66f2a2648694bb47b193a873595bb368a8fb379104ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:FRB2PPQHMBVJOX63SOFLW3GLN3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Vertex-imprimitive symmetric graphs with exactly one edge between any two distinct blocks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.GR","authors_text":"Binzhou Xia, Sanming Zhou, Teng Fang, Xin Gui Fang","submitted_at":"2016-05-11T17:41:26Z","abstract_excerpt":"A graph $\\Gamma$ is called $G$-symmetric if it admits $G$ as a group of automorphisms acting transitively on the set of ordered pairs of adjacent vertices. We give a classification of $G$-symmetric graphs $\\Gamma$ with $V(\\Gamma)$ admitting a nontrivial $G$-invariant partition $\\mathcal{B}$ such that there is exactly one edge of $\\Gamma$ between any two distinct blocks of $\\mathcal{B}$. This is achieved by giving a classification of $(G, 2)$-point-transitive and $G$-block-transitive designs $\\mathcal{D}$ together with $G$-orbits $\\Omega$ on the flag set of $\\mathcal{D}$ such that $G_{\\sigma, L"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03530","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-18T00:42:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iP875hL3POpEuc5sok0Hp6df3HiU7cbsks4dMdr6X1Htbmr9vC6s3hcFP+xOmpcHl9d2ZmzIgfKcfYBJ/UuYBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T07:56:31.252805Z"},"content_sha256":"a7b32e766af08092c131f724df6332543b5f15a300c006fa367b45af81892f6b","schema_version":"1.0","event_id":"sha256:a7b32e766af08092c131f724df6332543b5f15a300c006fa367b45af81892f6b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FRB2PPQHMBVJOX63SOFLW3GLN3/bundle.json","state_url":"https://pith.science/pith/FRB2PPQHMBVJOX63SOFLW3GLN3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FRB2PPQHMBVJOX63SOFLW3GLN3/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-08T07:56:31Z","links":{"resolver":"https://pith.science/pith/FRB2PPQHMBVJOX63SOFLW3GLN3","bundle":"https://pith.science/pith/FRB2PPQHMBVJOX63SOFLW3GLN3/bundle.json","state":"https://pith.science/pith/FRB2PPQHMBVJOX63SOFLW3GLN3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FRB2PPQHMBVJOX63SOFLW3GLN3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FRB2PPQHMBVJOX63SOFLW3GLN3","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":"2d4b3c62df768b806575452b0e9ece4fde071f46d37daf7bd0ace098fde4018f","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2016-05-11T17:41:26Z","title_canon_sha256":"4e6c73092a883a21f18ee38808948c2c38379e4ba29093121e608eeef7efa173"},"schema_version":"1.0","source":{"id":"1605.03530","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.03530","created_at":"2026-05-18T00:42:17Z"},{"alias_kind":"arxiv_version","alias_value":"1605.03530v3","created_at":"2026-05-18T00:42:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03530","created_at":"2026-05-18T00:42:17Z"},{"alias_kind":"pith_short_12","alias_value":"FRB2PPQHMBVJ","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FRB2PPQHMBVJOX63","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FRB2PPQH","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:a7b32e766af08092c131f724df6332543b5f15a300c006fa367b45af81892f6b","target":"graph","created_at":"2026-05-18T00:42:17Z","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 graph $\\Gamma$ is called $G$-symmetric if it admits $G$ as a group of automorphisms acting transitively on the set of ordered pairs of adjacent vertices. We give a classification of $G$-symmetric graphs $\\Gamma$ with $V(\\Gamma)$ admitting a nontrivial $G$-invariant partition $\\mathcal{B}$ such that there is exactly one edge of $\\Gamma$ between any two distinct blocks of $\\mathcal{B}$. This is achieved by giving a classification of $(G, 2)$-point-transitive and $G$-block-transitive designs $\\mathcal{D}$ together with $G$-orbits $\\Omega$ on the flag set of $\\mathcal{D}$ such that $G_{\\sigma, L","authors_text":"Binzhou Xia, Sanming Zhou, Teng Fang, Xin Gui Fang","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2016-05-11T17:41:26Z","title":"Vertex-imprimitive symmetric graphs with exactly one edge between any two distinct blocks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03530","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:331b5c7ae943db9409bf66f2a2648694bb47b193a873595bb368a8fb379104ab","target":"record","created_at":"2026-05-18T00:42:17Z","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":"2d4b3c62df768b806575452b0e9ece4fde071f46d37daf7bd0ace098fde4018f","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2016-05-11T17:41:26Z","title_canon_sha256":"4e6c73092a883a21f18ee38808948c2c38379e4ba29093121e608eeef7efa173"},"schema_version":"1.0","source":{"id":"1605.03530","kind":"arxiv","version":3}},"canonical_sha256":"2c43a7be07606a975fdb938abb6ccb6eef5588c33cfa835b6a14866c8568b4a9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2c43a7be07606a975fdb938abb6ccb6eef5588c33cfa835b6a14866c8568b4a9","first_computed_at":"2026-05-18T00:42:17.899032Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:17.899032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DwO3kYBDAKrWrQPwSPLZFE0xMJyz1pDi3n8527mgcUj828EHgFFI5brSYBBXiTn7DVtxAcb9duqzCK62f9uFAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:17.899627Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.03530","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:331b5c7ae943db9409bf66f2a2648694bb47b193a873595bb368a8fb379104ab","sha256:a7b32e766af08092c131f724df6332543b5f15a300c006fa367b45af81892f6b"],"state_sha256":"3986e20dd74d0200bcc944941d41998466d02dec060899ac549a5837d7862cda"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NBfNQ+emFq4c9I6t8bHA/oGvPvhrk4sWuIM+EyCxZpXcoT6lcrN5DEZwqferpWMnCmOD2Q6YjCv2DlEw5hW2AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T07:56:31.256592Z","bundle_sha256":"bb050881e14e26ab9f2793fcdaaaaa49d4f99e5568dc144f401a7dac81d4cada"}}