{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EQAAGRJLVNEMMLU4MUJV6O64OM","short_pith_number":"pith:EQAAGRJL","canonical_record":{"source":{"id":"1707.01633","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-06T04:33:03Z","cross_cats_sorted":[],"title_canon_sha256":"f937910f5f29f79dad7321f3f258afcb02213420e1b3eed1663440e2107a34a4","abstract_canon_sha256":"00896ddebdba1e4bdbe9b3c27d53ab301690d46fada1bf121dd05c06b00d5d34"},"schema_version":"1.0"},"canonical_sha256":"240003452bab48c62e9c65135f3bdc7324e304caa90a48391f13821596d59bba","source":{"kind":"arxiv","id":"1707.01633","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.01633","created_at":"2026-05-18T00:40:48Z"},{"alias_kind":"arxiv_version","alias_value":"1707.01633v1","created_at":"2026-05-18T00:40:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01633","created_at":"2026-05-18T00:40:48Z"},{"alias_kind":"pith_short_12","alias_value":"EQAAGRJLVNEM","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EQAAGRJLVNEMMLU4","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EQAAGRJL","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EQAAGRJLVNEMMLU4MUJV6O64OM","target":"record","payload":{"canonical_record":{"source":{"id":"1707.01633","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-06T04:33:03Z","cross_cats_sorted":[],"title_canon_sha256":"f937910f5f29f79dad7321f3f258afcb02213420e1b3eed1663440e2107a34a4","abstract_canon_sha256":"00896ddebdba1e4bdbe9b3c27d53ab301690d46fada1bf121dd05c06b00d5d34"},"schema_version":"1.0"},"canonical_sha256":"240003452bab48c62e9c65135f3bdc7324e304caa90a48391f13821596d59bba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:48.004986Z","signature_b64":"uAuowpGKdABZcxvMWbF+etwC3FS7aGxbDS6qBHqflZCsnw+dxN2vFlwwrgCXSnFh0fWzGtSs8qcAz3G/OopfDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"240003452bab48c62e9c65135f3bdc7324e304caa90a48391f13821596d59bba","last_reissued_at":"2026-05-18T00:40:48.004287Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:48.004287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.01633","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-18T00:40:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iTNTmsVAEVpJS/+igJRQ8O7GzbKqECOFJzXaPXH8gm3MLooPC1wMrubkZe1g3aCX3MYhJGGKoHZKohMoNyAoBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:46:08.959611Z"},"content_sha256":"9ae077cf778250e34d5969831b6bc42ad94997b88fd8942d9e0d78eefd641a13","schema_version":"1.0","event_id":"sha256:9ae077cf778250e34d5969831b6bc42ad94997b88fd8942d9e0d78eefd641a13"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EQAAGRJLVNEMMLU4MUJV6O64OM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On a Generalization of the Bipartite Graph $D(k,q)$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Huaxiong Wang, Xiaoyan Cheng, Yuansheng Tang","submitted_at":"2017-07-06T04:33:03Z","abstract_excerpt":"In this paper, we deal with a generalization $\\Gamma(\\Omega,q)$ of the bipartite graphs $D(k,q)$ proposed by Lazebnik and Ustimenko, where $\\Omega$ is a set of binary sequences that are adopted to index the entries of the vertices. A few sufficient conditions on $\\Omega$ for $\\Gamma(\\Omega,q)$ to admit a variety of automorphisms are proposed. A sufficient condition for $\\Gamma(\\Omega,q)$ to be edge-transitive is proposed further. A lower bound of the number of the connected components of $\\Gamma(\\Omega,q)$ is given by showing some invariants for the components. For $\\Gamma(\\Omega,q)$, paths an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01633","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-18T00:40:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oaTpHFMadRVXj+zgUHSdEG6I5AyuSwht4M0YZ8cowMErTzMHctx1PpQqPwDd+79JT0hbXa+0dnWg89ypXpqRBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:46:08.960454Z"},"content_sha256":"47ae0a6673bc75cd0ba6a157a6bc61fe7f7309aacc12849a522bd0e14ace1e25","schema_version":"1.0","event_id":"sha256:47ae0a6673bc75cd0ba6a157a6bc61fe7f7309aacc12849a522bd0e14ace1e25"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EQAAGRJLVNEMMLU4MUJV6O64OM/bundle.json","state_url":"https://pith.science/pith/EQAAGRJLVNEMMLU4MUJV6O64OM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EQAAGRJLVNEMMLU4MUJV6O64OM/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-11T02:46:08Z","links":{"resolver":"https://pith.science/pith/EQAAGRJLVNEMMLU4MUJV6O64OM","bundle":"https://pith.science/pith/EQAAGRJLVNEMMLU4MUJV6O64OM/bundle.json","state":"https://pith.science/pith/EQAAGRJLVNEMMLU4MUJV6O64OM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EQAAGRJLVNEMMLU4MUJV6O64OM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EQAAGRJLVNEMMLU4MUJV6O64OM","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":"00896ddebdba1e4bdbe9b3c27d53ab301690d46fada1bf121dd05c06b00d5d34","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-06T04:33:03Z","title_canon_sha256":"f937910f5f29f79dad7321f3f258afcb02213420e1b3eed1663440e2107a34a4"},"schema_version":"1.0","source":{"id":"1707.01633","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.01633","created_at":"2026-05-18T00:40:48Z"},{"alias_kind":"arxiv_version","alias_value":"1707.01633v1","created_at":"2026-05-18T00:40:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01633","created_at":"2026-05-18T00:40:48Z"},{"alias_kind":"pith_short_12","alias_value":"EQAAGRJLVNEM","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EQAAGRJLVNEMMLU4","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EQAAGRJL","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:47ae0a6673bc75cd0ba6a157a6bc61fe7f7309aacc12849a522bd0e14ace1e25","target":"graph","created_at":"2026-05-18T00:40:48Z","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":"In this paper, we deal with a generalization $\\Gamma(\\Omega,q)$ of the bipartite graphs $D(k,q)$ proposed by Lazebnik and Ustimenko, where $\\Omega$ is a set of binary sequences that are adopted to index the entries of the vertices. A few sufficient conditions on $\\Omega$ for $\\Gamma(\\Omega,q)$ to admit a variety of automorphisms are proposed. A sufficient condition for $\\Gamma(\\Omega,q)$ to be edge-transitive is proposed further. A lower bound of the number of the connected components of $\\Gamma(\\Omega,q)$ is given by showing some invariants for the components. For $\\Gamma(\\Omega,q)$, paths an","authors_text":"Huaxiong Wang, Xiaoyan Cheng, Yuansheng Tang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-06T04:33:03Z","title":"On a Generalization of the Bipartite Graph $D(k,q)$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01633","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:9ae077cf778250e34d5969831b6bc42ad94997b88fd8942d9e0d78eefd641a13","target":"record","created_at":"2026-05-18T00:40:48Z","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":"00896ddebdba1e4bdbe9b3c27d53ab301690d46fada1bf121dd05c06b00d5d34","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-06T04:33:03Z","title_canon_sha256":"f937910f5f29f79dad7321f3f258afcb02213420e1b3eed1663440e2107a34a4"},"schema_version":"1.0","source":{"id":"1707.01633","kind":"arxiv","version":1}},"canonical_sha256":"240003452bab48c62e9c65135f3bdc7324e304caa90a48391f13821596d59bba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"240003452bab48c62e9c65135f3bdc7324e304caa90a48391f13821596d59bba","first_computed_at":"2026-05-18T00:40:48.004287Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:48.004287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uAuowpGKdABZcxvMWbF+etwC3FS7aGxbDS6qBHqflZCsnw+dxN2vFlwwrgCXSnFh0fWzGtSs8qcAz3G/OopfDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:48.004986Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.01633","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9ae077cf778250e34d5969831b6bc42ad94997b88fd8942d9e0d78eefd641a13","sha256:47ae0a6673bc75cd0ba6a157a6bc61fe7f7309aacc12849a522bd0e14ace1e25"],"state_sha256":"02ab8f329317a309bfe98081853d649c57b2997b96bb60f2b140482a92a9a839"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XRqIbEYrB6YsBH81azFzKDrCqg7IpRAkVkWrraPQPToU490PGyDitVx8aeO3tkt/KgK6pC2lSKAGqq6XMwR3Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T02:46:08.964417Z","bundle_sha256":"53a1789664b2533b4f1c501bb84507f1171425206b8c58958a3663f93c8b8216"}}